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 /* Non-zero if there have been any initializations at this priority
57 throughout the translation unit. */
58 int initializations_p
;
59 /* Non-zero if there have been any destructions at this priority
60 throughout the translation unit. */
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 is_namespace_ancestor
PROTO((tree
, tree
));
70 static void add_using_namespace
PROTO((tree
, tree
, int));
71 static tree ambiguous_decl
PROTO((tree
, tree
, tree
,int));
72 static tree build_anon_union_vars
PROTO((tree
, tree
*, int, int));
73 static int acceptable_java_type
PROTO((tree
));
74 static void output_vtable_inherit
PROTO((tree
));
75 static tree start_objects
PROTO((int, int));
76 static void finish_objects
PROTO((int, int, tree
));
77 static tree merge_functions
PROTO((tree
, tree
));
78 static tree decl_namespace
PROTO((tree
));
79 static tree validate_nonmember_using_decl
PROTO((tree
, tree
*, tree
*));
80 static void do_nonmember_using_decl
PROTO((tree
, tree
, tree
, tree
,
82 static tree start_static_storage_duration_function
PROTO((void));
83 static void finish_static_storage_duration_function
PROTO((tree
));
84 static priority_info get_priority_info
PROTO((int));
85 static void do_static_initialization
PROTO((tree
, tree
));
86 static void do_static_destruction
PROTO((tree
));
87 static tree start_static_initialization_or_destruction
PROTO((tree
, int));
88 static void finish_static_initialization_or_destruction
PROTO((tree
));
89 static void generate_ctor_or_dtor_function
PROTO((int, int));
90 static int generate_ctor_and_dtor_functions_for_priority
91 PROTO((splay_tree_node
, void *));
92 static tree prune_vars_needing_no_initialization
PROTO((tree
));
93 static void write_out_vars
PROTO((tree
));
95 extern int current_class_depth
;
97 /* A list of virtual function tables we must make sure to write out. */
100 /* A list of static class variables. This is needed, because a
101 static class variable can be declared inside the class without
102 an initializer, and then initialized, staticly, outside the class. */
103 static varray_type pending_statics
;
104 static size_t pending_statics_used
;
106 /* A list of functions which were declared inline, but which we
107 may need to emit outline anyway. */
108 static varray_type saved_inlines
;
109 static size_t saved_inlines_used
;
111 /* Same, but not reset. Local temp variables and global temp variables
112 can have the same name. */
113 static int global_temp_name_counter
;
115 /* Flag used when debugging spew.c */
117 extern int spew_debug
;
119 /* Nonzero if we're done parsing and into end-of-file activities. */
123 /* Functions called along with real static constructors and destructors. */
125 tree static_ctors
, static_dtors
;
127 /* The :: namespace. */
129 tree global_namespace
;
131 /* The stack for namespaces of current declarations. */
133 static tree decl_namespace_list
;
136 /* C (and C++) language-specific option variables. */
138 /* Nonzero means allow type mismatches in conditional expressions;
139 just make their values `void'. */
141 int flag_cond_mismatch
;
143 /* Nonzero means give `double' the same size as `float'. */
145 int flag_short_double
;
147 /* Nonzero means don't recognize the keyword `asm'. */
151 /* Nonzero means don't recognize any extension keywords. */
153 int flag_no_gnu_keywords
;
155 /* Nonzero means don't recognize the non-ANSI builtin functions. */
159 /* Nonzero means don't recognize the non-ANSI builtin functions.
162 int flag_no_nonansi_builtin
;
164 /* Nonzero means do some things the same way PCC does. Only provided so
165 the compiler will link. */
167 int flag_traditional
;
169 /* Nonzero means to treat bitfields as unsigned unless they say `signed'. */
171 int flag_signed_bitfields
= 1;
173 /* Nonzero means enable obscure ANSI features and disable GNU extensions
174 that might cause ANSI-compliant code to be miscompiled. */
178 /* Nonzero means do emit exported implementations of functions even if
179 they can be inlined. */
181 int flag_implement_inlines
= 1;
183 /* Nonzero means do emit exported implementations of templates, instead of
184 multiple static copies in each file that needs a definition. */
186 int flag_external_templates
;
188 /* Nonzero means that the decision to emit or not emit the implementation of a
189 template depends on where the template is instantiated, rather than where
192 int flag_alt_external_templates
;
194 /* Nonzero means that implicit instantiations will be emitted if needed. */
196 int flag_implicit_templates
= 1;
198 /* Nonzero means that implicit instantiations of inline templates will be
199 emitted if needed, even if instantiations of non-inline templates
202 int flag_implicit_inline_templates
= 1;
204 /* Nonzero means warn about implicit declarations. */
206 int warn_implicit
= 1;
208 /* Nonzero means warn about usage of long long when `-pedantic'. */
210 int warn_long_long
= 1;
212 /* Nonzero means warn when all ctors or dtors are private, and the class
215 int warn_ctor_dtor_privacy
= 1;
217 /* True if we want to implement vtables using "thunks".
218 The default is off. */
220 #ifndef DEFAULT_VTABLE_THUNKS
221 #define DEFAULT_VTABLE_THUNKS 0
223 int flag_vtable_thunks
= DEFAULT_VTABLE_THUNKS
;
225 /* Nonzero means generate separate instantiation control files and juggle
226 them at link time. */
228 int flag_use_repository
;
230 /* Nonzero if we want to issue diagnostics that the standard says are not
233 int flag_optional_diags
= 1;
235 /* Nonzero means give string constants the type `const char *', as mandated
238 int flag_const_strings
= 1;
240 /* If non-NULL, dump the tree structure for the entire translation
241 unit to this file. */
243 char *flag_dump_translation_unit
= 0;
245 /* Nonzero means warn about deprecated conversion from string constant to
248 int warn_write_strings
;
250 /* Nonzero means warn about pointer casts that can drop a type qualifier
251 from the pointer target type. */
255 /* Nonzero means warn about sizeof(function) or addition/subtraction
256 of function pointers. */
258 int warn_pointer_arith
= 1;
260 /* Nonzero means warn for any function def without prototype decl. */
262 int warn_missing_prototypes
;
264 /* Nonzero means warn about multiple (redundant) decls for the same single
265 variable or function. */
267 int warn_redundant_decls
;
269 /* Warn if initializer is not completely bracketed. */
271 int warn_missing_braces
;
273 /* Warn about comparison of signed and unsigned values. */
275 int warn_sign_compare
;
277 /* Warn about testing equality of floating point numbers. */
279 int warn_float_equal
= 0;
281 /* Warn about *printf or *scanf format/argument anomalies. */
285 /* Warn about a subscript that has type char. */
287 int warn_char_subscripts
;
289 /* Warn if a type conversion is done that might have confusing results. */
293 /* Warn if adding () is suggested. */
295 int warn_parentheses
;
297 /* Non-zero means warn in function declared in derived class has the
298 same name as a virtual in the base class, but fails to match the
299 type signature of any virtual function in the base class. */
300 int warn_overloaded_virtual
;
302 /* Non-zero means warn when declaring a class that has a non virtual
303 destructor, when it really ought to have a virtual one. */
306 /* Non-zero means warn when a function is declared extern and later inline. */
307 int warn_extern_inline
;
309 /* Non-zero means warn when the compiler will reorder code. */
312 /* Non-zero means warn when synthesis behavior differs from Cfront's. */
315 /* Non-zero means warn when we convert a pointer to member function
316 into a pointer to (void or function). */
317 int warn_pmf2ptr
= 1;
319 /* Nonzero means warn about violation of some Effective C++ style rules. */
323 /* Nonzero means warn where overload resolution chooses a promotion from
324 unsigned to signed over a conversion to an unsigned of the same size. */
328 /* Nonzero means warn when an old-style cast is used. */
330 int warn_old_style_cast
;
332 /* Warn about #pragma directives that are not recognised. */
334 int warn_unknown_pragmas
; /* Tri state variable. */
336 /* Nonzero means warn about use of multicharacter literals. */
338 int warn_multichar
= 1;
340 /* Nonzero means warn when non-templatized friend functions are
341 declared within a template */
343 int warn_nontemplate_friend
= 1;
345 /* Nonzero means complain about deprecated features. */
347 int warn_deprecated
= 1;
349 /* Nonzero means `$' can be in an identifier. */
351 #ifndef DOLLARS_IN_IDENTIFIERS
352 #define DOLLARS_IN_IDENTIFIERS 1
354 int dollars_in_ident
= DOLLARS_IN_IDENTIFIERS
;
356 /* Nonzero for -fno-strict-prototype switch: do not consider empty
357 argument prototype to mean function takes no arguments. */
359 int flag_strict_prototype
= 2;
360 int strict_prototype
= 1;
361 int strict_prototypes_lang_c
, strict_prototypes_lang_cplusplus
= 1;
363 /* Nonzero means that labels can be used as first-class objects */
367 /* Nonzero means allow Microsoft extensions without a pedwarn. */
369 int flag_ms_extensions
;
371 /* Non-zero means to collect statistics which might be expensive
372 and to print them when we are done. */
373 int flag_detailed_statistics
;
375 /* C++ specific flags. */
376 /* Zero means that `this' is a *const. This gives nice behavior in the
377 2.0 world. 1 gives 1.2-compatible behavior. 2 gives Spring behavior.
378 -2 means we're constructing an object and it has fixed type. */
380 int flag_this_is_variable
;
382 /* Nonzero means we should attempt to elide constructors when possible. */
384 int flag_elide_constructors
= 1;
386 /* Nonzero means that member functions defined in class scope are
387 inline by default. */
389 int flag_default_inline
= 1;
391 /* Controls whether compiler generates 'type descriptor' that give
392 run-time type information. */
395 /* Nonzero if we wish to output cross-referencing information
396 for the GNU class browser. */
397 extern int flag_gnu_xref
;
399 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
402 int flag_huge_objects
;
404 /* Nonzero if we want to conserve space in the .o files. We do this
405 by putting uninitialized data and runtime initialized data into
406 .common instead of .data at the expense of not flagging multiple
409 int flag_conserve_space
;
411 /* Nonzero if we want to obey access control semantics. */
413 int flag_access_control
= 1;
415 /* Nonzero if we want to understand the operator names, i.e. 'bitand'. */
417 int flag_operator_names
;
419 /* Nonzero if we want to check the return value of new and avoid calling
420 constructors if it is a null pointer. */
424 /* Nonzero if we want the new ANSI rules for pushing a new scope for `for'
425 initialization variables.
426 0: Old rules, set by -fno-for-scope.
427 2: New ANSI rules, set by -ffor-scope.
428 1: Try to implement new ANSI rules, but with backup compatibility
429 (and warnings). This is the default, for now. */
431 int flag_new_for_scope
= 1;
433 /* Nonzero if we want to emit defined symbols with common-like linkage as
434 weak symbols where possible, in order to conform to C++ semantics.
435 Otherwise, emit them as local symbols. */
439 /* Nonzero to enable experimental ABI changes. */
443 /* Nonzero to not ignore namespace std. */
447 /* Maximum template instantiation depth. Must be at least 17 for ANSI
450 int max_tinst_depth
= 17;
452 /* The name-mangling scheme to use. Must be 1 or greater to support
453 template functions with identical types, but different template
455 int name_mangling_version
= 2;
457 /* Nonzero means that guiding declarations are allowed. */
458 int flag_guiding_decls
;
460 /* Nonzero if wchar_t should be `unsigned short' instead of whatever it
461 would normally be, for use with WINE. */
462 int flag_short_wchar
;
464 /* Nonzero if squashed mangling is to be performed.
465 This uses the B and K codes to reference previously seen class types
466 and class qualifiers. */
467 int flag_do_squangling
;
469 /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */
473 /* Nonzero means make the default pedwarns warnings instead of errors.
474 The value of this flag is ignored if -pedantic is specified. */
478 /* If this variable is defined to a non-NULL value, it will be called
479 after the file has been completely parsed. */
481 void (*back_end_hook
) PROTO((tree
));
483 /* Table of language-dependent -f options.
484 STRING is the option name. VARIABLE is the address of the variable.
485 ON_VALUE is the value to store in VARIABLE
486 if `-fSTRING' is seen as an option.
487 (If `-fno-STRING' is seen as an option, the opposite value is stored.) */
489 static struct { const char *string
; int *variable
; int on_value
;}
493 {"signed-char", &flag_signed_char
, 1},
494 {"unsigned-char", &flag_signed_char
, 0},
495 {"signed-bitfields", &flag_signed_bitfields
, 1},
496 {"unsigned-bitfields", &flag_signed_bitfields
, 0},
497 {"short-enums", &flag_short_enums
, 1},
498 {"short-double", &flag_short_double
, 1},
499 {"short-wchar", &flag_short_wchar
, 1},
500 {"cond-mismatch", &flag_cond_mismatch
, 1},
501 {"asm", &flag_no_asm
, 0},
502 {"builtin", &flag_no_builtin
, 0},
504 /* C++-only options. */
505 {"access-control", &flag_access_control
, 1},
506 {"check-new", &flag_check_new
, 1},
507 {"conserve-space", &flag_conserve_space
, 1},
508 {"const-strings", &flag_const_strings
, 1},
509 {"default-inline", &flag_default_inline
, 1},
510 {"dollars-in-identifiers", &dollars_in_ident
, 1},
511 {"elide-constructors", &flag_elide_constructors
, 1},
512 {"external-templates", &flag_external_templates
, 1},
513 {"for-scope", &flag_new_for_scope
, 2},
514 {"gnu-keywords", &flag_no_gnu_keywords
, 0},
515 {"handle-exceptions", &flag_exceptions
, 1},
516 {"honor-std", &flag_honor_std
, 1},
517 {"huge-objects", &flag_huge_objects
, 1},
518 {"implement-inlines", &flag_implement_inlines
, 1},
519 {"implicit-inline-templates", &flag_implicit_inline_templates
, 1},
520 {"implicit-templates", &flag_implicit_templates
, 1},
521 {"labels-ok", &flag_labels_ok
, 1},
522 {"ms-extensions", &flag_ms_extensions
, 1},
523 {"nonansi-builtins", &flag_no_nonansi_builtin
, 0},
524 {"operator-names", &flag_operator_names
, 1},
525 {"optional-diags", &flag_optional_diags
, 1},
526 {"permissive", &flag_permissive
, 1},
527 {"repo", &flag_use_repository
, 1},
528 {"rtti", &flag_rtti
, 1},
529 {"squangle", &flag_do_squangling
, 1},
530 {"stats", &flag_detailed_statistics
, 1},
531 {"strict-prototype", &flag_strict_prototype
, 1},
532 {"vtable-gc", &flag_vtable_gc
, 1},
533 {"vtable-thunks", &flag_vtable_thunks
, 1},
534 {"weak", &flag_weak
, 1},
535 {"xref", &flag_gnu_xref
, 1}
538 /* Decode the string P as a language-specific option.
539 Return the number of strings consumed for a valid option.
540 Otherwise return 0. Should not complain if it does not
541 recognise the option. */
544 lang_decode_option (argc
, argv
)
553 int strings_processed
;
556 strings_processed
= cpp_handle_option (&parse_in
, argc
, argv
);
558 strings_processed
= 0;
559 #endif /* ! USE_CPPLIB */
561 if (!strcmp (p
, "-ftraditional") || !strcmp (p
, "-traditional"))
563 else if (p
[0] == '-' && p
[1] == 'f')
565 /* Some kind of -f option.
566 P's value is the option sans `-f'.
567 Search for it in the table of options. */
571 /* Try special -f options. */
573 if (!strcmp (p
, "handle-exceptions")
574 || !strcmp (p
, "no-handle-exceptions"))
575 warning ("-fhandle-exceptions has been renamed to -fexceptions (and is now on by default)");
576 else if (!strcmp (p
, "all-virtual")
577 || !strcmp (p
, "enum-int-equiv")
578 || !strcmp (p
, "no-nonnull-objects")
579 || !strcmp (p
, "this-is-variable"))
580 warning ("-f%s is no longer supported", p
);
581 else if (! strcmp (p
, "alt-external-templates"))
583 flag_external_templates
= 1;
584 flag_alt_external_templates
= 1;
585 cp_deprecated ("-falt-external-templates");
587 else if (! strcmp (p
, "no-alt-external-templates"))
588 flag_alt_external_templates
= 0;
589 else if (!strcmp (p
, "repo"))
591 flag_use_repository
= 1;
592 flag_implicit_templates
= 0;
594 else if (!strcmp (p
, "guiding-decls"))
596 flag_guiding_decls
= 1;
597 name_mangling_version
= 0;
599 else if (!strcmp (p
, "no-guiding-decls"))
600 flag_guiding_decls
= 0;
601 else if (!strcmp (p
, "external-templates"))
603 flag_external_templates
= 1;
604 cp_deprecated ("-fexternal-templates");
606 else if (!strcmp (p
, "new-abi"))
609 flag_do_squangling
= 1;
611 flag_vtable_thunks
= 1;
613 else if (!strcmp (p
, "no-new-abi"))
616 flag_do_squangling
= 0;
619 else if (!strncmp (p
, "template-depth-", 15))
621 = read_integral_parameter (p
+ 15, p
- 2, max_tinst_depth
);
622 else if (!strncmp (p
, "name-mangling-version-", 22))
623 name_mangling_version
624 = read_integral_parameter (p
+ 22, p
- 2, name_mangling_version
);
625 else if (!strncmp (p
, "dump-translation-unit-", 22))
628 error ("no file specified with -fdump-translation-unit");
630 flag_dump_translation_unit
= p
+ 22;
637 !found
&& j
< (sizeof (lang_f_options
)
638 / sizeof (lang_f_options
[0]));
641 if (!strcmp (p
, lang_f_options
[j
].string
))
643 *lang_f_options
[j
].variable
= lang_f_options
[j
].on_value
;
644 /* A goto here would be cleaner,
645 but breaks the vax pcc. */
648 if (p
[0] == 'n' && p
[1] == 'o' && p
[2] == '-'
649 && ! strcmp (p
+3, lang_f_options
[j
].string
))
651 *lang_f_options
[j
].variable
= ! lang_f_options
[j
].on_value
;
659 else if (p
[0] == '-' && p
[1] == 'W')
663 /* The -W options control the warning behavior of the compiler. */
666 if (p
[0] == 'n' && p
[1] == 'o' && p
[2] == '-')
669 if (!strcmp (p
, "implicit"))
670 warn_implicit
= setting
;
671 else if (!strcmp (p
, "long-long"))
672 warn_long_long
= setting
;
673 else if (!strcmp (p
, "return-type"))
674 warn_return_type
= setting
;
675 else if (!strcmp (p
, "ctor-dtor-privacy"))
676 warn_ctor_dtor_privacy
= setting
;
677 else if (!strcmp (p
, "write-strings"))
678 warn_write_strings
= setting
;
679 else if (!strcmp (p
, "cast-qual"))
680 warn_cast_qual
= setting
;
681 else if (!strcmp (p
, "char-subscripts"))
682 warn_char_subscripts
= setting
;
683 else if (!strcmp (p
, "pointer-arith"))
684 warn_pointer_arith
= setting
;
685 else if (!strcmp (p
, "missing-prototypes"))
686 warn_missing_prototypes
= setting
;
687 else if (!strcmp (p
, "redundant-decls"))
688 warn_redundant_decls
= setting
;
689 else if (!strcmp (p
, "missing-braces"))
690 warn_missing_braces
= setting
;
691 else if (!strcmp (p
, "sign-compare"))
692 warn_sign_compare
= setting
;
693 else if (!strcmp (p
, "float-equal"))
694 warn_float_equal
= setting
;
695 else if (!strcmp (p
, "format"))
696 warn_format
= setting
;
697 else if (!strcmp (p
, "conversion"))
698 warn_conversion
= setting
;
699 else if (!strcmp (p
, "parentheses"))
700 warn_parentheses
= setting
;
701 else if (!strcmp (p
, "non-virtual-dtor"))
702 warn_nonvdtor
= setting
;
703 else if (!strcmp (p
, "extern-inline"))
704 warn_extern_inline
= setting
;
705 else if (!strcmp (p
, "reorder"))
706 warn_reorder
= setting
;
707 else if (!strcmp (p
, "synth"))
708 warn_synth
= setting
;
709 else if (!strcmp (p
, "pmf-conversions"))
710 warn_pmf2ptr
= setting
;
711 else if (!strcmp (p
, "effc++"))
713 else if (!strcmp (p
, "sign-promo"))
714 warn_sign_promo
= setting
;
715 else if (!strcmp (p
, "old-style-cast"))
716 warn_old_style_cast
= setting
;
717 else if (!strcmp (p
, "overloaded-virtual"))
718 warn_overloaded_virtual
= setting
;
719 else if (!strcmp (p
, "multichar"))
720 warn_multichar
= setting
;
721 else if (!strcmp (p
, "unknown-pragmas"))
722 /* Set to greater than 1, so that even unknown pragmas in
723 system headers will be warned about. */
724 warn_unknown_pragmas
= setting
* 2;
725 else if (!strcmp (p
, "non-template-friend"))
726 warn_nontemplate_friend
= setting
;
727 else if (!strcmp (p
, "deprecated"))
728 warn_deprecated
= setting
;
729 else if (!strcmp (p
, "comment"))
730 ; /* cpp handles this one. */
731 else if (!strcmp (p
, "comments"))
732 ; /* cpp handles this one. */
733 else if (!strcmp (p
, "trigraphs"))
734 ; /* cpp handles this one. */
735 else if (!strcmp (p
, "import"))
736 ; /* cpp handles this one. */
737 else if (!strcmp (p
, "all"))
739 warn_return_type
= setting
;
740 warn_unused
= setting
;
741 warn_implicit
= setting
;
742 warn_switch
= setting
;
743 warn_format
= setting
;
744 warn_parentheses
= setting
;
745 warn_missing_braces
= setting
;
746 warn_sign_compare
= setting
;
747 warn_multichar
= setting
;
748 /* We save the value of warn_uninitialized, since if they put
749 -Wuninitialized on the command line, we need to generate a
750 warning about not using it without also specifying -O. */
751 if (warn_uninitialized
!= 1)
752 warn_uninitialized
= (setting
? 2 : 0);
753 /* Only warn about unknown pragmas that are not in system
755 warn_unknown_pragmas
= 1;
757 /* C++-specific warnings. */
758 warn_ctor_dtor_privacy
= setting
;
759 warn_nonvdtor
= setting
;
760 warn_reorder
= setting
;
761 warn_nontemplate_friend
= setting
;
763 else return strings_processed
;
765 else if (!strcmp (p
, "-ansi"))
766 flag_no_nonansi_builtin
= 1, flag_ansi
= 1,
767 flag_no_gnu_keywords
= 1, flag_operator_names
= 1;
769 /* Undocumented, only ever used when you're invoking cc1plus by hand, since
770 it's probably safe to assume no sane person would ever want to use this
771 under normal circumstances. */
772 else if (!strcmp (p
, "-spew-debug"))
776 return strings_processed
;
781 /* Incorporate `const' and `volatile' qualifiers for member functions.
782 FUNCTION is a TYPE_DECL or a FUNCTION_DECL.
783 QUALS is a list of qualifiers. */
786 grok_method_quals (ctype
, function
, quals
)
787 tree ctype
, function
, quals
;
789 tree fntype
= TREE_TYPE (function
);
790 tree raises
= TYPE_RAISES_EXCEPTIONS (fntype
);
791 int type_quals
= TYPE_UNQUALIFIED
;
792 int dup_quals
= TYPE_UNQUALIFIED
;
796 int tq
= cp_type_qual_from_rid (TREE_VALUE (quals
));
802 quals
= TREE_CHAIN (quals
);
806 if (dup_quals
!= TYPE_UNQUALIFIED
)
807 cp_error ("duplicate type qualifiers in %s declaration",
808 TREE_CODE (function
) == FUNCTION_DECL
809 ? "member function" : "type");
811 ctype
= cp_build_qualified_type (ctype
, type_quals
);
812 fntype
= build_cplus_method_type (ctype
, TREE_TYPE (fntype
),
813 (TREE_CODE (fntype
) == METHOD_TYPE
814 ? TREE_CHAIN (TYPE_ARG_TYPES (fntype
))
815 : TYPE_ARG_TYPES (fntype
)));
817 fntype
= build_exception_variant (fntype
, raises
);
819 TREE_TYPE (function
) = fntype
;
823 /* Warn when -fexternal-templates is used and #pragma
824 interface/implementation is not used all the times it should be,
828 warn_if_unknown_interface (decl
)
831 static int already_warned
= 0;
832 if (already_warned
++)
835 if (flag_alt_external_templates
)
837 struct tinst_level
*til
= tinst_for_decl ();
839 char *sf
= input_filename
;
844 input_filename
= til
->file
;
846 cp_warning ("template `%#D' instantiated in file without #pragma interface",
852 cp_warning_at ("template `%#D' defined in file without #pragma interface",
856 /* A subroutine of the parser, to handle a component list. */
859 grok_x_components (specs
)
862 struct pending_inline
**p
;
865 specs
= strip_attrs (specs
);
867 check_tag_decl (specs
);
868 t
= groktypename (build_decl_list (specs
, NULL_TREE
));
870 /* The only case where we need to do anything additional here is an
871 anonymous union field, e.g.: `struct S { union { int i; }; };'. */
872 if (t
== NULL_TREE
|| !ANON_AGGR_TYPE_P (t
))
875 fixup_anonymous_aggr (t
);
876 finish_member_declaration (build_lang_decl (FIELD_DECL
, NULL_TREE
, t
));
878 /* Ignore any inline function definitions in the anonymous union
879 since an anonymous union may not have function members. */
880 p
= &pending_inlines
;
881 for (; *p
; *p
= (*p
)->next
)
882 if (DECL_CONTEXT ((*p
)->fndecl
) != t
)
886 /* Constructors for types with virtual baseclasses need an "in-charge" flag
887 saying whether this constructor is responsible for initialization of
888 virtual baseclasses or not. All destructors also need this "in-charge"
889 flag, which additionally determines whether or not the destructor should
890 free the memory for the object.
892 This function adds the "in-charge" flag to member function FN if
893 appropriate. It is called from grokclassfn and tsubst.
894 FN must be either a constructor or destructor. */
897 maybe_retrofit_in_chrg (fn
)
900 tree basetype
, arg_types
, parms
, parm
, fntype
;
902 if (DECL_CONSTRUCTOR_P (fn
)
903 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CLASS_CONTEXT (fn
))
904 && ! DECL_CONSTRUCTOR_FOR_VBASE_P (fn
))
906 else if (! DECL_CONSTRUCTOR_P (fn
)
907 && TREE_CHAIN (DECL_ARGUMENTS (fn
)) == NULL_TREE
)
912 if (DECL_CONSTRUCTOR_P (fn
))
913 DECL_CONSTRUCTOR_FOR_VBASE_P (fn
) = 1;
915 /* First add it to DECL_ARGUMENTS... */
916 parm
= build_decl (PARM_DECL
, in_charge_identifier
, integer_type_node
);
917 /* Mark the artificial `__in_chrg' parameter as "artificial". */
918 SET_DECL_ARTIFICIAL (parm
);
919 DECL_ARG_TYPE (parm
) = integer_type_node
;
920 TREE_READONLY (parm
) = 1;
921 parms
= DECL_ARGUMENTS (fn
);
922 TREE_CHAIN (parm
) = TREE_CHAIN (parms
);
923 TREE_CHAIN (parms
) = parm
;
925 /* ...and then to TYPE_ARG_TYPES. */
926 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
927 basetype
= TREE_TYPE (TREE_VALUE (arg_types
));
928 arg_types
= hash_tree_chain (integer_type_node
, TREE_CHAIN (arg_types
));
929 fntype
= build_cplus_method_type (basetype
, TREE_TYPE (TREE_TYPE (fn
)),
931 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
)))
932 fntype
= build_exception_variant (fntype
,
933 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
)));
934 TREE_TYPE (fn
) = fntype
;
937 /* Classes overload their constituent function names automatically.
938 When a function name is declared in a record structure,
939 its name is changed to it overloaded name. Since names for
940 constructors and destructors can conflict, we place a leading
943 CNAME is the name of the class we are grokking for.
945 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
947 FLAGS contains bits saying what's special about today's
948 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
950 If FUNCTION is a destructor, then we must add the `auto-delete' field
951 as a second parameter. There is some hair associated with the fact
952 that we must "declare" this variable in the manner consistent with the
953 way the rest of the arguments were declared.
955 QUALS are the qualifiers for the this pointer. */
958 grokclassfn (ctype
, function
, flags
, quals
)
959 tree ctype
, function
;
960 enum overload_flags flags
;
963 tree fn_name
= DECL_NAME (function
);
968 if (fn_name
== NULL_TREE
)
970 error ("name missing for member function");
971 fn_name
= get_identifier ("<anonymous>");
972 DECL_NAME (function
) = fn_name
;
976 qualtype
= grok_method_quals (ctype
, function
, quals
);
980 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (function
));
981 if (TREE_CODE (TREE_TYPE (function
)) == METHOD_TYPE
)
983 /* Must add the class instance variable up front. */
984 /* Right now we just make this a pointer. But later
985 we may wish to make it special. */
986 tree type
= TREE_VALUE (arg_types
);
988 parm
= build_decl (PARM_DECL
, this_identifier
, type
);
989 /* Mark the artificial `this' parameter as "artificial". */
990 SET_DECL_ARTIFICIAL (parm
);
991 DECL_ARG_TYPE (parm
) = type
;
992 /* We can make this a register, so long as we don't
993 accidentally complain if someone tries to take its address. */
994 DECL_REGISTER (parm
) = 1;
995 TREE_READONLY (parm
) = 1;
996 TREE_CHAIN (parm
) = last_function_parms
;
997 last_function_parms
= parm
;
1000 DECL_ARGUMENTS (function
) = last_function_parms
;
1001 /* First approximations. */
1002 DECL_CONTEXT (function
) = ctype
;
1003 DECL_CLASS_CONTEXT (function
) = ctype
;
1005 if (flags
== DTOR_FLAG
|| DECL_CONSTRUCTOR_P (function
))
1007 maybe_retrofit_in_chrg (function
);
1008 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (function
));
1011 if (flags
== DTOR_FLAG
)
1013 DECL_ASSEMBLER_NAME (function
) = build_destructor_name (ctype
);
1014 TYPE_HAS_DESTRUCTOR (ctype
) = 1;
1017 set_mangled_name_for_decl (function
);
1020 /* Work on the expr used by alignof (this is only called by the parser). */
1029 if (processing_template_decl
)
1030 return build_min (ALIGNOF_EXPR
, sizetype
, expr
);
1032 if (TREE_CODE (expr
) == COMPONENT_REF
1033 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
1034 error ("`__alignof__' applied to a bit-field");
1036 if (TREE_CODE (expr
) == INDIRECT_REF
)
1038 best
= t
= TREE_OPERAND (expr
, 0);
1039 bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
1041 while (TREE_CODE (t
) == NOP_EXPR
1042 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
1045 t
= TREE_OPERAND (t
, 0);
1046 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
1047 if (thisalign
> bestalign
)
1048 best
= t
, bestalign
= thisalign
;
1050 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
1053 return c_alignof (TREE_TYPE (expr
));
1056 /* Create an ARRAY_REF, checking for the user doing things backwards
1060 grok_array_decl (array_expr
, index_exp
)
1061 tree array_expr
, index_exp
;
1063 tree type
= TREE_TYPE (array_expr
);
1064 tree p1
, p2
, i1
, i2
;
1066 if (type
== error_mark_node
|| index_exp
== error_mark_node
)
1067 return error_mark_node
;
1068 if (processing_template_decl
)
1069 return build_min (ARRAY_REF
, type
? TREE_TYPE (type
) : NULL_TREE
,
1070 array_expr
, index_exp
);
1072 if (type
== NULL_TREE
)
1074 /* Something has gone very wrong. Assume we are mistakenly reducing
1075 an expression instead of a declaration. */
1076 error ("parser may be lost: is there a '{' missing somewhere?");
1080 if (TREE_CODE (type
) == OFFSET_TYPE
1081 || TREE_CODE (type
) == REFERENCE_TYPE
)
1082 type
= TREE_TYPE (type
);
1084 /* If they have an `operator[]', use that. */
1085 if (IS_AGGR_TYPE (type
) || IS_AGGR_TYPE (TREE_TYPE (index_exp
)))
1086 return build_opfncall (ARRAY_REF
, LOOKUP_NORMAL
,
1087 array_expr
, index_exp
, NULL_TREE
);
1089 /* Otherwise, create an ARRAY_REF for a pointer or array type. It
1090 is a little-known fact that, if `a' is an array and `i' is an
1091 int, you can write `i[a]', which means the same thing as `a[i]'. */
1093 if (TREE_CODE (type
) == ARRAY_TYPE
)
1096 p1
= build_expr_type_conversion (WANT_POINTER
, array_expr
, 0);
1098 if (TREE_CODE (TREE_TYPE (index_exp
)) == ARRAY_TYPE
)
1101 p2
= build_expr_type_conversion (WANT_POINTER
, index_exp
, 0);
1103 i1
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, array_expr
, 0);
1104 i2
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, index_exp
, 0);
1106 if ((p1
&& i2
) && (i1
&& p2
))
1107 error ("ambiguous conversion for array subscript");
1110 array_expr
= p1
, index_exp
= i2
;
1112 array_expr
= p2
, index_exp
= i1
;
1115 cp_error ("invalid types `%T[%T]' for array subscript",
1116 type
, TREE_TYPE (index_exp
));
1117 return error_mark_node
;
1120 if (array_expr
== error_mark_node
|| index_exp
== error_mark_node
)
1121 error ("ambiguous conversion for array subscript");
1123 return build_array_ref (array_expr
, index_exp
);
1126 /* Given the cast expression EXP, checking out its validity. Either return
1127 an error_mark_node if there was an unavoidable error, return a cast to
1128 void for trying to delete a pointer w/ the value 0, or return the
1129 call to delete. If DOING_VEC is 1, we handle things differently
1130 for doing an array delete. If DOING_VEC is 2, they gave us the
1131 array size as an argument to delete.
1132 Implements ARM $5.3.4. This is called from the parser. */
1135 delete_sanity (exp
, size
, doing_vec
, use_global_delete
)
1137 int doing_vec
, use_global_delete
;
1140 /* For a regular vector delete (aka, no size argument) we will pass
1141 this down as a NULL_TREE into build_vec_delete. */
1142 tree maxindex
= NULL_TREE
;
1144 if (exp
== error_mark_node
)
1147 if (processing_template_decl
)
1149 t
= build_min (DELETE_EXPR
, void_type_node
, exp
, size
);
1150 DELETE_EXPR_USE_GLOBAL (t
) = use_global_delete
;
1151 DELETE_EXPR_USE_VEC (t
) = doing_vec
;
1155 if (TREE_CODE (exp
) == OFFSET_REF
)
1156 exp
= resolve_offset_ref (exp
);
1157 exp
= convert_from_reference (exp
);
1158 t
= stabilize_reference (exp
);
1159 t
= build_expr_type_conversion (WANT_POINTER
, t
, 1);
1161 if (t
== NULL_TREE
|| t
== error_mark_node
)
1163 cp_error ("type `%#T' argument given to `delete', expected pointer",
1165 return error_mark_node
;
1170 maxindex
= build_binary_op (MINUS_EXPR
, size
, integer_one_node
);
1171 pedwarn ("anachronistic use of array size in vector delete");
1174 type
= TREE_TYPE (t
);
1176 /* As of Valley Forge, you can delete a pointer to const. */
1178 /* You can't delete functions. */
1179 if (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
1181 error ("cannot delete a function");
1182 return error_mark_node
;
1185 /* Deleting ptr to void is undefined behaviour [expr.delete/3]. */
1186 if (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
)
1187 cp_warning ("`%T' is not a pointer-to-object type", type
);
1189 /* An array can't have been allocated by new, so complain. */
1190 if (TREE_CODE (t
) == ADDR_EXPR
1191 && TREE_CODE (TREE_OPERAND (t
, 0)) == VAR_DECL
1192 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == ARRAY_TYPE
)
1193 cp_warning ("deleting array `%#D'", TREE_OPERAND (t
, 0));
1195 /* Deleting a pointer with the value zero is valid and has no effect. */
1196 if (integer_zerop (t
))
1197 return build1 (NOP_EXPR
, void_type_node
, t
);
1200 return build_vec_delete (t
, maxindex
, integer_one_node
,
1201 integer_zero_node
, use_global_delete
);
1204 if (IS_AGGR_TYPE (TREE_TYPE (type
))
1205 && TYPE_GETS_REG_DELETE (TREE_TYPE (type
)))
1207 /* Only do access checking here; we'll be calling op delete
1208 from the destructor. */
1209 tree tmp
= build_op_delete_call (DELETE_EXPR
, t
, size_zero_node
,
1210 LOOKUP_NORMAL
, NULL_TREE
);
1211 if (tmp
== error_mark_node
)
1212 return error_mark_node
;
1215 return build_delete (type
, t
, integer_three_node
,
1216 LOOKUP_NORMAL
, use_global_delete
);
1220 /* Report an error if the indicated template declaration is not the
1221 sort of thing that should be a member template. */
1224 check_member_template (tmpl
)
1229 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
1230 decl
= DECL_TEMPLATE_RESULT (tmpl
);
1232 if (TREE_CODE (decl
) == FUNCTION_DECL
1233 || (TREE_CODE (decl
) == TYPE_DECL
1234 && IS_AGGR_TYPE (TREE_TYPE (decl
))))
1236 if (current_function_decl
)
1237 /* 14.5.2.2 [temp.mem]
1239 A local class shall not have member templates. */
1240 cp_error ("declaration of member template `%#D' in local class",
1243 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
1245 /* 14.5.2.3 [temp.mem]
1247 A member function template shall not be virtual. */
1249 ("invalid use of `virtual' in template declaration of `%#D'",
1251 DECL_VIRTUAL_P (decl
) = 0;
1254 /* The debug-information generating code doesn't know what to do
1255 with member templates. */
1256 DECL_IGNORED_P (tmpl
) = 1;
1259 cp_error ("template declaration of `%#D'", decl
);
1262 /* Return true iff TYPE is a valid Java parameter or return type. */
1265 acceptable_java_type (type
)
1268 if (TREE_CODE (type
) == VOID_TYPE
|| TYPE_FOR_JAVA (type
))
1270 if (TREE_CODE (type
) == POINTER_TYPE
)
1272 type
= TREE_TYPE (type
);
1273 if (TREE_CODE (type
) == RECORD_TYPE
)
1276 if (! TYPE_FOR_JAVA (type
))
1278 if (! CLASSTYPE_TEMPLATE_INFO (type
))
1280 args
= CLASSTYPE_TI_ARGS (type
);
1281 i
= TREE_VEC_LENGTH (args
);
1284 type
= TREE_VEC_ELT (args
, i
);
1285 if (TREE_CODE (type
) == POINTER_TYPE
)
1286 type
= TREE_TYPE (type
);
1287 if (! TYPE_FOR_JAVA (type
))
1296 /* For a METHOD in a Java class CTYPE, return 1 if
1297 the parameter and return types are valid Java types.
1298 Otherwise, print appropriate error messages, and return 0. */
1301 check_java_method (method
)
1305 tree arg_types
= TYPE_ARG_TYPES (TREE_TYPE (method
));
1306 tree ret_type
= TREE_TYPE (TREE_TYPE (method
));
1307 if (! acceptable_java_type (ret_type
))
1309 cp_error ("Java method '%D' has non-Java return type `%T'",
1313 for (; arg_types
!= NULL_TREE
; arg_types
= TREE_CHAIN (arg_types
))
1315 tree type
= TREE_VALUE (arg_types
);
1316 if (! acceptable_java_type (type
))
1318 cp_error ("Java method '%D' has non-Java parameter type `%T'",
1323 return jerr
? 0 : 1;
1326 /* Sanity check: report error if this function FUNCTION is not
1327 really a member of the class (CTYPE) it is supposed to belong to.
1328 CNAME is the same here as it is for grokclassfn above. */
1331 check_classfn (ctype
, function
)
1332 tree ctype
, function
;
1334 tree fn_name
= DECL_NAME (function
);
1335 tree fndecl
, fndecls
;
1336 tree method_vec
= CLASSTYPE_METHOD_VEC (complete_type (ctype
));
1340 if (DECL_USE_TEMPLATE (function
)
1341 && is_member_template (DECL_TI_TEMPLATE (function
)))
1342 /* Since this is a specialization of a member template,
1343 we're not going to find the declaration in the class.
1346 struct S { template <typename T> void f(T); };
1347 template <> void S::f(int);
1349 we're not going to find `S::f(int)', but there's no
1350 reason we should, either. We let our callers know we didn't
1351 find the method, but we don't complain. */
1354 if (method_vec
!= 0)
1356 methods
= &TREE_VEC_ELT (method_vec
, 0);
1357 end
= TREE_VEC_END (method_vec
);
1359 /* First suss out ctors and dtors. */
1360 if (*methods
&& fn_name
== DECL_NAME (OVL_CURRENT (*methods
))
1361 && DECL_CONSTRUCTOR_P (function
))
1363 if (*++methods
&& fn_name
== DECL_NAME (OVL_CURRENT (*methods
))
1364 && DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function
)))
1367 while (++methods
!= end
&& *methods
)
1370 if (fn_name
== DECL_NAME (OVL_CURRENT (*methods
)))
1373 for (fndecls
= *methods
; fndecls
!= NULL_TREE
;
1374 fndecls
= OVL_NEXT (fndecls
))
1376 fndecl
= OVL_CURRENT (fndecls
);
1377 /* The DECL_ASSEMBLER_NAME for a TEMPLATE_DECL, or
1378 for a for member function of a template class, is
1379 not mangled, so the check below does not work
1380 correctly in that case. Since mangled destructor
1381 names do not include the type of the arguments,
1382 we can't use this short-cut for them, either.
1383 (It's not legal to declare arguments for a
1384 destructor, but some people try.) */
1385 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function
))
1386 && (DECL_ASSEMBLER_NAME (function
)
1387 != DECL_NAME (function
))
1388 && (DECL_ASSEMBLER_NAME (fndecl
)
1389 != DECL_NAME (fndecl
))
1390 && (DECL_ASSEMBLER_NAME (function
)
1391 == DECL_ASSEMBLER_NAME (fndecl
)))
1394 /* We cannot simply call decls_match because this
1395 doesn't work for static member functions that are
1396 pretending to be methods, and because the name
1397 may have been changed by asm("new_name"). */
1398 if (DECL_NAME (function
) == DECL_NAME (fndecl
))
1400 tree p1
= TYPE_ARG_TYPES (TREE_TYPE (function
));
1401 tree p2
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
1403 /* Get rid of the this parameter on functions that become
1405 if (DECL_STATIC_FUNCTION_P (fndecl
)
1406 && TREE_CODE (TREE_TYPE (function
)) == METHOD_TYPE
)
1407 p1
= TREE_CHAIN (p1
);
1409 if (same_type_p (TREE_TYPE (TREE_TYPE (function
)),
1410 TREE_TYPE (TREE_TYPE (fndecl
)))
1411 && compparms (p1
, p2
)
1412 && (DECL_TEMPLATE_SPECIALIZATION (function
)
1413 == DECL_TEMPLATE_SPECIALIZATION (fndecl
))
1414 && (!DECL_TEMPLATE_SPECIALIZATION (function
)
1415 || (DECL_TI_TEMPLATE (function
)
1416 == DECL_TI_TEMPLATE (fndecl
))))
1425 if (methods
!= end
&& *methods
)
1427 tree fndecl
= *methods
;
1428 cp_error ("prototype for `%#D' does not match any in class `%T'",
1430 cp_error_at ("candidate%s: %+#D", OVL_NEXT (fndecl
) ? "s are" : " is",
1431 OVL_CURRENT (fndecl
));
1432 while (fndecl
= OVL_NEXT (fndecl
), fndecl
)
1433 cp_error_at (" %#D", OVL_CURRENT(fndecl
));
1438 if (TYPE_SIZE (ctype
) == 0)
1439 incomplete_type_error (function
, ctype
);
1441 cp_error ("no `%#D' member function declared in class `%T'",
1445 /* If we did not find the method in the class, add it to avoid
1446 spurious errors (unless the CTYPE is not yet defined, in which
1447 case we'll only confuse ourselves when the function is declared
1448 properly within the class. */
1449 if (TYPE_SIZE (ctype
))
1450 add_method (ctype
, methods
, function
);
1454 /* We have just processed the DECL, which is a static data member.
1455 Its initializer, if present, is INIT. The ASMSPEC_TREE, if
1456 present, is the assembly-language name for the data member.
1457 NEED_POP and FLAGS are as for cp_finish_decl. */
1460 finish_static_data_member_decl (decl
, init
, asmspec_tree
, need_pop
, flags
)
1467 const char *asmspec
= 0;
1470 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
1472 my_friendly_assert (TREE_PUBLIC (decl
), 0);
1474 /* We cannot call pushdecl here, because that would fill in the
1475 decl of our TREE_CHAIN. Instead, we modify cp_finish_decl to do
1476 the right thing, namely, to put this decl out straight away. */
1477 /* current_class_type can be NULL_TREE in case of error. */
1478 if (!asmspec
&& current_class_type
)
1480 DECL_INITIAL (decl
) = error_mark_node
;
1481 DECL_ASSEMBLER_NAME (decl
)
1482 = build_static_name (current_class_type
, DECL_NAME (decl
));
1484 if (! processing_template_decl
)
1486 if (!pending_statics
)
1487 VARRAY_TREE_INIT (pending_statics
, 32, "pending_statics");
1489 if (pending_statics_used
== pending_statics
->num_elements
)
1490 VARRAY_GROW (pending_statics
,
1491 2 * pending_statics
->num_elements
);
1492 VARRAY_TREE (pending_statics
, pending_statics_used
) = decl
;
1493 ++pending_statics_used
;
1496 /* Static consts need not be initialized in the class definition. */
1497 if (init
!= NULL_TREE
&& TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
1499 static int explanation
= 0;
1501 error ("initializer invalid for static member with constructor");
1502 if (explanation
++ == 0)
1503 error ("(you really want to initialize it separately)");
1506 /* Force the compiler to know when an uninitialized static const
1507 member is being used. */
1508 if (CP_TYPE_CONST_P (TREE_TYPE (decl
)) && init
== 0)
1509 TREE_USED (decl
) = 1;
1510 DECL_INITIAL (decl
) = init
;
1511 DECL_IN_AGGR_P (decl
) = 1;
1512 DECL_CONTEXT (decl
) = current_class_type
;
1513 DECL_CLASS_CONTEXT (decl
) = current_class_type
;
1515 cp_finish_decl (decl
, init
, asmspec_tree
, need_pop
, flags
);
1518 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
1519 of a structure component, returning a FIELD_DECL node.
1520 QUALS is a list of type qualifiers for this decl (such as for declaring
1521 const member functions).
1523 This is done during the parsing of the struct declaration.
1524 The FIELD_DECL nodes are chained together and the lot of them
1525 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
1529 If class A defines that certain functions in class B are friends, then
1530 the way I have set things up, it is B who is interested in permission
1531 granted by A. However, it is in A's context that these declarations
1532 are parsed. By returning a void_type_node, class A does not attempt
1533 to incorporate the declarations of the friends within its structure.
1535 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
1536 CHANGES TO CODE IN `start_method'. */
1539 grokfield (declarator
, declspecs
, init
, asmspec_tree
, attrlist
)
1540 tree declarator
, declspecs
, init
, asmspec_tree
, attrlist
;
1542 register tree value
;
1543 const char *asmspec
= 0;
1544 int flags
= LOOKUP_ONLYCONVERTING
;
1546 /* Convert () initializers to = initializers. */
1547 if (init
== NULL_TREE
&& declarator
!= NULL_TREE
1548 && TREE_CODE (declarator
) == CALL_EXPR
1549 && TREE_OPERAND (declarator
, 0)
1550 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) == IDENTIFIER_NODE
1551 || TREE_CODE (TREE_OPERAND (declarator
, 0)) == SCOPE_REF
)
1552 && parmlist_is_exprlist (CALL_DECLARATOR_PARMS (declarator
)))
1554 init
= TREE_OPERAND (declarator
, 1);
1555 declarator
= TREE_OPERAND (declarator
, 0);
1559 if (declspecs
== NULL_TREE
1560 && TREE_CODE (declarator
) == SCOPE_REF
1561 && TREE_CODE (TREE_OPERAND (declarator
, 1)) == IDENTIFIER_NODE
)
1563 /* Access declaration */
1564 if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator
, 0))))
1566 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
1567 pop_nested_class ();
1568 return do_class_using_decl (declarator
);
1572 && TREE_CODE (init
) == TREE_LIST
1573 && TREE_VALUE (init
) == error_mark_node
1574 && TREE_CHAIN (init
) == NULL_TREE
)
1577 value
= grokdeclarator (declarator
, declspecs
, FIELD
, init
!= 0, attrlist
);
1578 if (! value
|| value
== error_mark_node
)
1579 /* friend or constructor went bad. */
1582 /* Pass friendly classes back. */
1583 if (TREE_CODE (value
) == VOID_TYPE
)
1584 return void_type_node
;
1586 if (DECL_NAME (value
) != NULL_TREE
1587 && IDENTIFIER_POINTER (DECL_NAME (value
))[0] == '_'
1588 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value
)), "_vptr"))
1589 cp_error ("member `%D' conflicts with virtual function table field name",
1592 /* Stash away type declarations. */
1593 if (TREE_CODE (value
) == TYPE_DECL
)
1595 DECL_NONLOCAL (value
) = 1;
1596 DECL_CONTEXT (value
) = current_class_type
;
1597 DECL_CLASS_CONTEXT (value
) = current_class_type
;
1599 /* Now that we've updated the context, we need to remangle the
1600 name for this TYPE_DECL. */
1601 DECL_ASSEMBLER_NAME (value
) = DECL_NAME (value
);
1602 if (!uses_template_parms (value
))
1603 DECL_ASSEMBLER_NAME (value
) =
1604 get_identifier (build_overload_name (TREE_TYPE (value
), 1, 1));
1606 if (processing_template_decl
)
1607 value
= push_template_decl (value
);
1612 if (DECL_IN_AGGR_P (value
))
1614 cp_error ("`%D' is already defined in `%T'", value
,
1615 DECL_CONTEXT (value
));
1616 return void_type_node
;
1620 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
1624 if (TREE_CODE (value
) == FUNCTION_DECL
)
1626 grok_function_init (value
, init
);
1629 else if (pedantic
&& TREE_CODE (value
) != VAR_DECL
)
1630 /* Already complained in grokdeclarator. */
1634 /* We allow initializers to become parameters to base
1636 if (TREE_CODE (init
) == TREE_LIST
)
1638 if (TREE_CHAIN (init
) == NULL_TREE
)
1639 init
= TREE_VALUE (init
);
1641 init
= digest_init (TREE_TYPE (value
), init
, (tree
*)0);
1644 if (TREE_CODE (init
) == CONST_DECL
)
1645 init
= DECL_INITIAL (init
);
1646 else if (TREE_READONLY_DECL_P (init
))
1647 init
= decl_constant_value (init
);
1648 else if (TREE_CODE (init
) == CONSTRUCTOR
)
1649 init
= digest_init (TREE_TYPE (value
), init
, (tree
*)0);
1650 if (init
== error_mark_node
)
1651 /* We must make this look different than `error_mark_node'
1652 because `decl_const_value' would mis-interpret it
1653 as only meaning that this VAR_DECL is defined. */
1654 init
= build1 (NOP_EXPR
, TREE_TYPE (value
), init
);
1655 else if (processing_template_decl
)
1657 else if (! TREE_CONSTANT (init
))
1659 /* We can allow references to things that are effectively
1660 static, since references are initialized with the address. */
1661 if (TREE_CODE (TREE_TYPE (value
)) != REFERENCE_TYPE
1662 || (TREE_STATIC (init
) == 0
1663 && (TREE_CODE_CLASS (TREE_CODE (init
)) != 'd'
1664 || DECL_EXTERNAL (init
) == 0)))
1666 error ("field initializer is not constant");
1667 init
= error_mark_node
;
1673 /* The corresponding pop_obstacks is in cp_finish_decl. */
1674 push_obstacks_nochange ();
1676 if (processing_template_decl
&& ! current_function_decl
1677 && (TREE_CODE (value
) == VAR_DECL
|| TREE_CODE (value
) == FUNCTION_DECL
))
1678 value
= push_template_decl (value
);
1681 cplus_decl_attributes (value
, TREE_PURPOSE (attrlist
),
1682 TREE_VALUE (attrlist
));
1684 if (TREE_CODE (value
) == VAR_DECL
)
1686 finish_static_data_member_decl (value
, init
, asmspec_tree
,
1687 /*need_pop=*/1, flags
);
1690 if (TREE_CODE (value
) == FIELD_DECL
)
1694 /* This must override the asm specifier which was placed
1695 by grokclassfn. Lay this out fresh. */
1696 DECL_RTL (value
) = NULL_RTX
;
1697 DECL_ASSEMBLER_NAME (value
) = get_identifier (asmspec
);
1699 if (DECL_INITIAL (value
) == error_mark_node
)
1700 init
= error_mark_node
;
1701 cp_finish_decl (value
, init
, asmspec_tree
, 1, flags
);
1702 DECL_INITIAL (value
) = init
;
1703 DECL_IN_AGGR_P (value
) = 1;
1706 if (TREE_CODE (value
) == FUNCTION_DECL
)
1710 /* This must override the asm specifier which was placed
1711 by grokclassfn. Lay this out fresh. */
1712 DECL_RTL (value
) = NULL_RTX
;
1713 DECL_ASSEMBLER_NAME (value
) = get_identifier (asmspec
);
1715 cp_finish_decl (value
, init
, asmspec_tree
, 1, flags
);
1717 /* Pass friends back this way. */
1718 if (DECL_FRIEND_P (value
))
1719 return void_type_node
;
1721 DECL_IN_AGGR_P (value
) = 1;
1724 my_friendly_abort (21);
1729 /* Like `grokfield', but for bitfields.
1730 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
1733 grokbitfield (declarator
, declspecs
, width
)
1734 tree declarator
, declspecs
, width
;
1736 register tree value
= grokdeclarator (declarator
, declspecs
, BITFIELD
,
1739 if (! value
) return NULL_TREE
; /* friends went bad. */
1741 /* Pass friendly classes back. */
1742 if (TREE_CODE (value
) == VOID_TYPE
)
1743 return void_type_node
;
1745 if (TREE_CODE (value
) == TYPE_DECL
)
1747 cp_error ("cannot declare `%D' to be a bitfield type", value
);
1751 /* Usually, finish_struct_1 catches bitifields with invalid types.
1752 But, in the case of bitfields with function type, we confuse
1753 ourselves into thinking they are member functions, so we must
1755 if (TREE_CODE (value
) == FUNCTION_DECL
)
1757 cp_error ("cannot declare bitfield `%D' with funcion type",
1762 if (DECL_IN_AGGR_P (value
))
1764 cp_error ("`%D' is already defined in the class %T", value
,
1765 DECL_CONTEXT (value
));
1766 return void_type_node
;
1769 GNU_xref_member (current_class_name
, value
);
1771 if (TREE_STATIC (value
))
1773 cp_error ("static member `%D' cannot be a bitfield", value
);
1776 cp_finish_decl (value
, NULL_TREE
, NULL_TREE
, 0, 0);
1778 if (width
!= error_mark_node
)
1780 constant_expression_warning (width
);
1781 DECL_INITIAL (value
) = width
;
1782 SET_DECL_C_BIT_FIELD (value
);
1785 DECL_IN_AGGR_P (value
) = 1;
1790 grokoptypename (declspecs
, declarator
)
1791 tree declspecs
, declarator
;
1793 tree t
= grokdeclarator (declarator
, declspecs
, TYPENAME
, 0, NULL_TREE
);
1794 return build_typename_overload (t
);
1797 /* When a function is declared with an initializer,
1798 do the right thing. Currently, there are two possibilities:
1803 // initialization possibility #1.
1804 virtual void f () = 0;
1826 // initialization possibility #2
1833 copy_assignment_arg_p (parmtype
, virtualp
)
1835 int virtualp ATTRIBUTE_UNUSED
;
1837 if (current_class_type
== NULL_TREE
)
1840 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
)
1841 parmtype
= TREE_TYPE (parmtype
);
1843 if ((TYPE_MAIN_VARIANT (parmtype
) == current_class_type
)
1845 /* Non-standard hack to support old Booch components. */
1846 || (! virtualp
&& DERIVED_FROM_P (parmtype
, current_class_type
))
1855 grok_function_init (decl
, init
)
1859 /* An initializer for a function tells how this function should
1861 tree type
= TREE_TYPE (decl
);
1863 if (TREE_CODE (type
) == FUNCTION_TYPE
)
1864 cp_error ("initializer specified for non-member function `%D'", decl
);
1866 /* We'll check for this in finish_struct_1. */
1867 else if (DECL_VINDEX (decl
) == NULL_TREE
)
1868 cp_error ("initializer specified for non-virtual method `%D'", decl
);
1870 else if (integer_zerop (init
))
1873 /* Mark this function as being "defined". */
1874 DECL_INITIAL (decl
) = error_mark_node
;
1875 /* pure virtual destructors must be defined. */
1876 /* pure virtual needs to be defined (as abort) only when put in
1877 vtbl. For wellformed call, it should be itself. pr4737 */
1878 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl
)))
1880 /* Give this node rtl from `abort'. */
1881 DECL_RTL (decl
) = DECL_RTL (abort_fndecl
);
1884 DECL_ABSTRACT_VIRTUAL_P (decl
) = 1;
1885 if (DECL_NAME (decl
) == ansi_opname
[(int) MODIFY_EXPR
])
1888 = TREE_VALUE (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
))));
1890 if (copy_assignment_arg_p (parmtype
, 1))
1891 TYPE_HAS_ABSTRACT_ASSIGN_REF (current_class_type
) = 1;
1895 cp_error ("invalid initializer for virtual method `%D'", decl
);
1899 cplus_decl_attributes (decl
, attributes
, prefix_attributes
)
1900 tree decl
, attributes
, prefix_attributes
;
1902 if (decl
== NULL_TREE
|| decl
== void_type_node
)
1905 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
1906 decl
= DECL_TEMPLATE_RESULT (decl
);
1908 decl_attributes (decl
, attributes
, prefix_attributes
);
1910 if (TREE_CODE (decl
) == TYPE_DECL
)
1911 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (decl
), TREE_TYPE (decl
));
1914 /* CONSTRUCTOR_NAME:
1915 Return the name for the constructor (or destructor) for the
1916 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1917 IDENTIFIER_NODE. When given a template, this routine doesn't
1918 lose the specialization. */
1921 constructor_name_full (thing
)
1924 if (TREE_CODE (thing
) == TEMPLATE_TYPE_PARM
1925 || TREE_CODE (thing
) == TEMPLATE_TEMPLATE_PARM
1926 || TREE_CODE (thing
) == TYPENAME_TYPE
)
1927 thing
= TYPE_NAME (thing
);
1928 else if (IS_AGGR_TYPE_CODE (TREE_CODE (thing
)))
1930 if (TYPE_WAS_ANONYMOUS (thing
) && TYPE_HAS_CONSTRUCTOR (thing
))
1931 thing
= DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (thing
), 0)));
1933 thing
= TYPE_NAME (thing
);
1935 if (TREE_CODE (thing
) == TYPE_DECL
1936 || (TREE_CODE (thing
) == TEMPLATE_DECL
1937 && TREE_CODE (DECL_TEMPLATE_RESULT (thing
)) == TYPE_DECL
))
1938 thing
= DECL_NAME (thing
);
1939 my_friendly_assert (TREE_CODE (thing
) == IDENTIFIER_NODE
, 197);
1943 /* CONSTRUCTOR_NAME:
1944 Return the name for the constructor (or destructor) for the
1945 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1946 IDENTIFIER_NODE. When given a template, return the plain
1947 unspecialized name. */
1950 constructor_name (thing
)
1954 thing
= constructor_name_full (thing
);
1955 t
= IDENTIFIER_TEMPLATE (thing
);
1961 /* Record the existence of an addressable inline function. */
1964 mark_inline_for_output (decl
)
1967 decl
= DECL_MAIN_VARIANT (decl
);
1968 if (DECL_SAVED_INLINE (decl
))
1970 DECL_SAVED_INLINE (decl
) = 1;
1972 VARRAY_TREE_INIT (saved_inlines
, 32, "saved_inlines");
1974 if (saved_inlines_used
== saved_inlines
->num_elements
)
1975 VARRAY_GROW (saved_inlines
,
1976 2 * saved_inlines
->num_elements
);
1977 VARRAY_TREE (saved_inlines
, saved_inlines_used
) = decl
;
1978 ++saved_inlines_used
;
1981 /* Hand off a unique name which can be used for variable we don't really
1982 want to know about anyway, for example, the anonymous variables which
1983 are needed to make references work. Declare this thing so we can use it.
1984 The variable created will be of type TYPE.
1986 STATICP is nonzero if this variable should be static. */
1989 get_temp_name (type
, staticp
)
1993 char buf
[sizeof (AUTO_TEMP_FORMAT
) + 20];
1995 int toplev
= toplevel_bindings_p ();
1997 push_obstacks_nochange ();
1998 if (toplev
|| staticp
)
2000 end_temporary_allocation ();
2001 sprintf (buf
, AUTO_TEMP_FORMAT
, global_temp_name_counter
++);
2002 decl
= pushdecl_top_level (build_decl (VAR_DECL
, get_identifier (buf
), type
));
2006 sprintf (buf
, AUTO_TEMP_FORMAT
, temp_name_counter
++);
2007 decl
= pushdecl (build_decl (VAR_DECL
, get_identifier (buf
), type
));
2009 TREE_USED (decl
) = 1;
2010 TREE_STATIC (decl
) = staticp
;
2011 DECL_ARTIFICIAL (decl
) = 1;
2013 /* If this is a local variable, then lay out its rtl now.
2014 Otherwise, callers of this function are responsible for dealing
2015 with this variable's rtl. */
2019 my_friendly_assert (DECL_INITIAL (decl
) == NULL_TREE
,
2027 /* Hunts through the global anonymous union ANON_DECL, building
2028 appropriate VAR_DECLs. Stores cleanups on the list of ELEMS, and
2029 returns a VAR_DECL whose size is the same as the size of the
2030 ANON_DECL, if one is available. */
2033 build_anon_union_vars (anon_decl
, elems
, static_p
, external_p
)
2039 tree type
= TREE_TYPE (anon_decl
);
2040 tree main_decl
= NULL_TREE
;
2043 /* Rather than write the code to handle the non-union case,
2044 just give an error. */
2045 if (TREE_CODE (type
) != UNION_TYPE
)
2046 error ("anonymous struct not inside named type");
2048 for (field
= TYPE_FIELDS (type
);
2050 field
= TREE_CHAIN (field
))
2054 if (DECL_ARTIFICIAL (field
))
2056 if (TREE_CODE (field
) != FIELD_DECL
)
2058 cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members",
2063 if (TREE_PRIVATE (field
))
2064 cp_pedwarn_at ("private member `%#D' in anonymous union", field
);
2065 else if (TREE_PROTECTED (field
))
2066 cp_pedwarn_at ("protected member `%#D' in anonymous union", field
);
2068 if (DECL_NAME (field
) == NULL_TREE
2069 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2071 decl
= build_anon_union_vars (field
, elems
, static_p
, external_p
);
2075 else if (DECL_NAME (field
) == NULL_TREE
)
2079 decl
= build_decl (VAR_DECL
, DECL_NAME (field
), TREE_TYPE (field
));
2080 /* tell `pushdecl' that this is not tentative. */
2081 DECL_INITIAL (decl
) = error_mark_node
;
2082 TREE_PUBLIC (decl
) = 0;
2083 TREE_STATIC (decl
) = static_p
;
2084 DECL_EXTERNAL (decl
) = external_p
;
2085 decl
= pushdecl (decl
);
2086 DECL_INITIAL (decl
) = NULL_TREE
;
2089 /* Only write out one anon union element--choose the one that
2090 can hold them all. */
2091 if (main_decl
== NULL_TREE
2092 && simple_cst_equal (DECL_SIZE (decl
),
2093 DECL_SIZE (anon_decl
)) == 1)
2096 /* ??? This causes there to be no debug info written out
2098 TREE_ASM_WRITTEN (decl
) = 1;
2100 if (DECL_NAME (field
) == NULL_TREE
2101 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2102 /* The remainder of the processing was already done in the
2106 /* If there's a cleanup to do, it belongs in the
2107 TREE_PURPOSE of the following TREE_LIST. */
2108 *elems
= tree_cons (NULL_TREE
, decl
, *elems
);
2109 TREE_TYPE (*elems
) = type
;
2115 /* Finish off the processing of a UNION_TYPE structure.
2116 If there are static members, then all members are
2117 static, and must be laid out together. If the
2118 union is an anonymous union, we arrange for that
2119 as well. PUBLIC_P is nonzero if this union is
2120 not declared static. */
2123 finish_anon_union (anon_union_decl
)
2124 tree anon_union_decl
;
2126 tree type
= TREE_TYPE (anon_union_decl
);
2128 int public_p
= TREE_PUBLIC (anon_union_decl
);
2129 int static_p
= TREE_STATIC (anon_union_decl
);
2130 int external_p
= DECL_EXTERNAL (anon_union_decl
);
2132 if (TYPE_FIELDS (type
) == NULL_TREE
)
2137 error ("global anonymous unions must be declared static");
2141 main_decl
= build_anon_union_vars (anon_union_decl
,
2142 &DECL_ANON_UNION_ELEMS (anon_union_decl
),
2143 static_p
, external_p
);
2145 if (main_decl
== NULL_TREE
)
2147 warning ("anonymous union with no members");
2153 make_decl_rtl (main_decl
, 0, toplevel_bindings_p ());
2154 DECL_RTL (anon_union_decl
) = DECL_RTL (main_decl
);
2155 expand_anon_union_decl (anon_union_decl
,
2157 DECL_ANON_UNION_ELEMS (anon_union_decl
));
2160 add_decl_stmt (anon_union_decl
);
2163 /* Finish processing a builtin type TYPE. It's name is NAME,
2164 its fields are in the array FIELDS. LEN is the number of elements
2165 in FIELDS minus one, or put another way, it is the maximum subscript
2168 It is given the same alignment as ALIGN_TYPE. */
2171 finish_builtin_type (type
, name
, fields
, len
, align_type
)
2180 TYPE_FIELDS (type
) = fields
[0];
2181 for (i
= 0; i
< len
; i
++)
2183 layout_type (TREE_TYPE (fields
[i
]));
2184 DECL_FIELD_CONTEXT (fields
[i
]) = type
;
2185 TREE_CHAIN (fields
[i
]) = fields
[i
+1];
2187 DECL_FIELD_CONTEXT (fields
[i
]) = type
;
2188 DECL_CLASS_CONTEXT (fields
[i
]) = type
;
2189 TYPE_ALIGN (type
) = TYPE_ALIGN (align_type
);
2191 #if 0 /* not yet, should get fixed properly later */
2192 TYPE_NAME (type
) = make_type_decl (get_identifier (name
), type
);
2194 TYPE_NAME (type
) = build_decl (TYPE_DECL
, get_identifier (name
), type
);
2196 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2197 layout_decl (TYPE_NAME (type
), 0);
2200 /* Auxiliary functions to make type signatures for
2201 `operator new' and `operator delete' correspond to
2202 what compiler will be expecting. */
2205 coerce_new_type (type
)
2210 if (TREE_CODE (type
) == METHOD_TYPE
)
2211 type
= build_function_type (TREE_TYPE (type
), TREE_CHAIN (TYPE_ARG_TYPES (type
)));
2212 if (! same_type_p (TREE_TYPE (type
), ptr_type_node
))
2213 e1
= 1, error ("`operator new' must return type `void *'");
2215 /* Technically the type must be `size_t', but we may not know
2217 if (TYPE_ARG_TYPES (type
) == NULL_TREE
)
2218 e1
= 1, error ("`operator new' takes type `size_t' parameter");
2219 else if (! same_type_p (TREE_VALUE (TYPE_ARG_TYPES (type
)), sizetype
))
2220 e2
= 1, error ("`operator new' takes type `size_t' as first parameter");
2222 type
= build_function_type (ptr_type_node
, tree_cons (NULL_TREE
, sizetype
, TREE_CHAIN (TYPE_ARG_TYPES (type
))));
2224 type
= build_function_type (ptr_type_node
, TYPE_ARG_TYPES (type
));
2229 coerce_delete_type (type
)
2236 tree arg_types
= TYPE_ARG_TYPES (type
);
2238 if (TREE_CODE (type
) == METHOD_TYPE
)
2240 type
= build_function_type (TREE_TYPE (type
), TREE_CHAIN (arg_types
));
2241 arg_types
= TREE_CHAIN (arg_types
);
2244 if (TREE_TYPE (type
) != void_type_node
)
2245 e1
= 1, error ("`operator delete' must return type `void'");
2247 if (arg_types
== NULL_TREE
2248 || ! same_type_p (TREE_VALUE (arg_types
), ptr_type_node
))
2249 e2
= 1, error ("`operator delete' takes type `void *' as first parameter");
2253 && TREE_CHAIN (arg_types
)
2254 && TREE_CHAIN (arg_types
) != void_list_node
)
2256 /* Again, technically this argument must be `size_t', but again
2257 we may not know what that is. */
2258 tree t2
= TREE_VALUE (TREE_CHAIN (arg_types
));
2259 if (! same_type_p (t2
, sizetype
))
2260 e3
= 1, error ("second argument to `operator delete' must be of type `size_t'");
2261 else if (TREE_CHAIN (TREE_CHAIN (arg_types
)) != void_list_node
)
2264 if (TREE_CHAIN (TREE_CHAIN (arg_types
)))
2265 error ("too many arguments in declaration of `operator delete'");
2267 error ("`...' invalid in specification of `operator delete'");
2272 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
,
2273 build_tree_list (NULL_TREE
, sizetype
));
2276 if (arg_types
== NULL_TREE
)
2277 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
2279 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, TREE_CHAIN (arg_types
));
2285 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
,
2286 arg_types
? TREE_CHAIN (arg_types
): NULL_TREE
);
2288 type
= build_function_type (void_type_node
, arg_types
);
2294 mark_vtable_entries (decl
)
2297 tree entries
= CONSTRUCTOR_ELTS (DECL_INITIAL (decl
));
2299 for (; entries
; entries
= TREE_CHAIN (entries
))
2304 fnaddr
= (flag_vtable_thunks
? TREE_VALUE (entries
)
2305 : FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (entries
)));
2307 if (TREE_CODE (fnaddr
) == NOP_EXPR
)
2311 fn
= TREE_OPERAND (fnaddr
, 0);
2312 TREE_ADDRESSABLE (fn
) = 1;
2313 if (TREE_CODE (fn
) == THUNK_DECL
&& DECL_EXTERNAL (fn
))
2315 DECL_EXTERNAL (fn
) = 0;
2322 /* Set DECL up to have the closest approximation of "initialized common"
2323 linkage available. */
2326 comdat_linkage (decl
)
2330 make_decl_one_only (decl
);
2331 else if (TREE_CODE (decl
) == FUNCTION_DECL
|| DECL_VIRTUAL_P (decl
))
2332 /* We can just emit functions and vtables statically; it doesn't really
2333 matter if we have multiple copies. */
2334 TREE_PUBLIC (decl
) = 0;
2337 /* Static data member template instantiations, however, cannot
2338 have multiple copies. */
2339 if (DECL_INITIAL (decl
) == 0
2340 || DECL_INITIAL (decl
) == error_mark_node
)
2341 DECL_COMMON (decl
) = 1;
2342 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
2344 DECL_COMMON (decl
) = 1;
2345 DECL_INITIAL (decl
) = error_mark_node
;
2349 /* We can't do anything useful; leave vars for explicit
2351 DECL_EXTERNAL (decl
) = 1;
2352 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2356 if (DECL_LANG_SPECIFIC (decl
))
2357 DECL_COMDAT (decl
) = 1;
2360 /* For win32 we also want to put explicit instantiations in
2361 linkonce sections, so that they will be merged with implicit
2362 instantiations; otherwise we get duplicate symbol errors. */
2365 maybe_make_one_only (decl
)
2368 /* We used to say that this was not necessary on targets that support weak
2369 symbols, because the implicit instantiations will defer to the explicit
2370 one. However, that's not actually the case in SVR4; a strong definition
2371 after a weak one is an error. Also, not making explicit
2372 instantiations one_only means that we can end up with two copies of
2373 some template instantiations. */
2374 if (! supports_one_only ())
2377 /* We can't set DECL_COMDAT on functions, or finish_file will think
2378 we can get away with not emitting them if they aren't used. We need
2379 to for variables so that cp_finish_decl will update their linkage,
2380 because their DECL_INITIAL may not have been set properly yet. */
2382 make_decl_one_only (decl
);
2384 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_LANG_SPECIFIC (decl
))
2385 DECL_COMDAT (decl
) = 1;
2388 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
2389 based on TYPE and other static flags.
2391 Note that anything public is tagged TREE_PUBLIC, whether
2392 it's public in this file or in another one. */
2395 import_export_vtable (decl
, type
, final
)
2399 if (DECL_INTERFACE_KNOWN (decl
))
2402 if (TYPE_FOR_JAVA (type
))
2404 TREE_PUBLIC (decl
) = 1;
2405 DECL_EXTERNAL (decl
) = 1;
2406 DECL_INTERFACE_KNOWN (decl
) = 1;
2408 else if (CLASSTYPE_INTERFACE_KNOWN (type
))
2410 TREE_PUBLIC (decl
) = 1;
2411 DECL_EXTERNAL (decl
) = ! CLASSTYPE_VTABLE_NEEDS_WRITING (type
);
2412 DECL_INTERFACE_KNOWN (decl
) = 1;
2416 /* We can only wait to decide if we have real non-inline virtual
2417 functions in our class, or if we come from a template. */
2419 int found
= CLASSTYPE_TEMPLATE_INSTANTIATION (type
);
2421 if (! found
&& ! final
)
2424 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
2425 method
= TREE_CHAIN (method
))
2426 if (DECL_VINDEX (method
) != NULL_TREE
2427 && ! DECL_THIS_INLINE (method
)
2428 && ! DECL_ABSTRACT_VIRTUAL_P (method
))
2435 if (final
|| ! found
)
2437 comdat_linkage (decl
);
2438 DECL_EXTERNAL (decl
) = 0;
2442 TREE_PUBLIC (decl
) = 1;
2443 DECL_EXTERNAL (decl
) = 1;
2448 /* Determine whether or not we want to specifically import or export CTYPE,
2449 using various heuristics. */
2452 import_export_class (ctype
)
2455 /* -1 for imported, 1 for exported. */
2456 int import_export
= 0;
2458 if (CLASSTYPE_INTERFACE_KNOWN (ctype
))
2461 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
2462 we will have CLASSTYPE_INTERFACE_ONLY set but not
2463 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
2464 heuristic because someone will supply a #pragma implementation
2465 elsewhere, and deducing it here would produce a conflict. */
2466 if (CLASSTYPE_INTERFACE_ONLY (ctype
))
2469 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
2470 /* FIXME this should really use some sort of target-independent macro. */
2471 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype
)))
2473 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype
)))
2477 /* If we got -fno-implicit-templates, we import template classes that
2478 weren't explicitly instantiated. */
2479 if (import_export
== 0
2480 && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype
)
2481 && ! flag_implicit_templates
)
2484 /* Base our import/export status on that of the first non-inline,
2485 non-abstract virtual function, if any. */
2486 if (import_export
== 0
2487 && TYPE_VIRTUAL_P (ctype
)
2488 && ! CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2491 for (method
= TYPE_METHODS (ctype
); method
!= NULL_TREE
;
2492 method
= TREE_CHAIN (method
))
2494 if (DECL_VINDEX (method
) != NULL_TREE
2495 && !DECL_THIS_INLINE (method
)
2496 && !DECL_ABSTRACT_VIRTUAL_P (method
))
2498 import_export
= (DECL_REALLY_EXTERN (method
) ? -1 : 1);
2504 #ifdef MULTIPLE_SYMBOL_SPACES
2505 if (import_export
== -1)
2511 SET_CLASSTYPE_INTERFACE_KNOWN (ctype
);
2512 CLASSTYPE_VTABLE_NEEDS_WRITING (ctype
) = (import_export
> 0);
2513 CLASSTYPE_INTERFACE_ONLY (ctype
) = (import_export
< 0);
2517 /* We need to describe to the assembler the relationship between
2518 a vtable and the vtable of the parent class. */
2521 output_vtable_inherit (vars
)
2527 op
[0] = XEXP (DECL_RTL (vars
), 0); /* strip the mem ref */
2529 parent
= binfo_for_vtable (vars
);
2531 if (parent
== TYPE_BINFO (DECL_CONTEXT (vars
)))
2535 parent
= TYPE_BINFO_VTABLE (BINFO_TYPE (parent
));
2536 op
[1] = XEXP (DECL_RTL (parent
), 0); /* strip the mem ref */
2539 my_friendly_abort (980826);
2541 output_asm_insn (".vtable_inherit %c0, %c1", op
);
2545 finish_vtable_vardecl (t
, data
)
2547 void *data ATTRIBUTE_UNUSED
;
2550 tree ctype
= DECL_CONTEXT (vars
);
2551 import_export_class (ctype
);
2552 import_export_vtable (vars
, ctype
, 1);
2554 if (! DECL_EXTERNAL (vars
)
2555 && (DECL_INTERFACE_KNOWN (vars
)
2556 || DECL_NEEDED_P (vars
)
2557 || (hack_decl_function_context (vars
) && TREE_USED (vars
)))
2558 && ! TREE_ASM_WRITTEN (vars
))
2561 mark_vtable_entries (vars
);
2562 if (TREE_TYPE (DECL_INITIAL (vars
)) == 0)
2563 store_init_value (vars
, DECL_INITIAL (vars
));
2565 if (write_symbols
== DWARF_DEBUG
|| write_symbols
== DWARF2_DEBUG
)
2567 /* Mark the VAR_DECL node representing the vtable itself as a
2568 "gratuitous" one, thereby forcing dwarfout.c to ignore it.
2569 It is rather important that such things be ignored because
2570 any effort to actually generate DWARF for them will run
2571 into trouble when/if we encounter code like:
2574 struct S { virtual void member (); };
2576 because the artificial declaration of the vtable itself (as
2577 manufactured by the g++ front end) will say that the vtable
2578 is a static member of `S' but only *after* the debug output
2579 for the definition of `S' has already been output. This causes
2580 grief because the DWARF entry for the definition of the vtable
2581 will try to refer back to an earlier *declaration* of the
2582 vtable as a static member of `S' and there won't be one.
2583 We might be able to arrange to have the "vtable static member"
2584 attached to the member list for `S' before the debug info for
2585 `S' get written (which would solve the problem) but that would
2586 require more intrusive changes to the g++ front end. */
2588 DECL_IGNORED_P (vars
) = 1;
2591 /* Always make vtables weak. */
2593 comdat_linkage (vars
);
2595 rest_of_decl_compilation (vars
, NULL_PTR
, 1, 1);
2598 output_vtable_inherit (vars
);
2600 /* Because we're only doing syntax-checking, we'll never end up
2601 actually marking the variable as written. */
2602 if (flag_syntax_only
)
2603 TREE_ASM_WRITTEN (vars
) = 1;
2607 else if (!DECL_NEEDED_P (vars
))
2608 /* We don't know what to do with this one yet. */
2611 *t
= TREE_CHAIN (vars
);
2616 prune_vtable_vardecl (t
, data
)
2618 void *data ATTRIBUTE_UNUSED
;
2620 *t
= TREE_CHAIN (*t
);
2624 /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an
2625 inline function or template instantiation at end-of-file. */
2628 import_export_decl (decl
)
2631 if (DECL_INTERFACE_KNOWN (decl
))
2634 if (DECL_TEMPLATE_INSTANTIATION (decl
)
2635 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl
))
2637 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2638 if ((DECL_IMPLICIT_INSTANTIATION (decl
)
2639 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl
))
2640 && (flag_implicit_templates
2641 || (flag_implicit_inline_templates
&& DECL_THIS_INLINE (decl
))))
2643 if (!TREE_PUBLIC (decl
))
2644 /* Templates are allowed to have internal linkage. See
2648 comdat_linkage (decl
);
2651 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2653 else if (DECL_FUNCTION_MEMBER_P (decl
))
2655 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2656 import_export_class (ctype
);
2657 if (CLASSTYPE_INTERFACE_KNOWN (ctype
)
2659 ? (! DECL_THIS_INLINE (decl
))
2660 : (! DECL_ARTIFICIAL (decl
) || DECL_VINDEX (decl
))))
2662 DECL_NOT_REALLY_EXTERN (decl
)
2663 = ! (CLASSTYPE_INTERFACE_ONLY (ctype
)
2664 || (DECL_THIS_INLINE (decl
) && ! flag_implement_inlines
2665 && !DECL_VINDEX (decl
)));
2667 /* Always make artificials weak. */
2668 if (DECL_ARTIFICIAL (decl
) && flag_weak
)
2669 comdat_linkage (decl
);
2671 maybe_make_one_only (decl
);
2674 comdat_linkage (decl
);
2676 else if (DECL_TINFO_FN_P (decl
))
2678 tree ctype
= TREE_TYPE (DECL_NAME (decl
));
2680 if (IS_AGGR_TYPE (ctype
))
2681 import_export_class (ctype
);
2683 if (IS_AGGR_TYPE (ctype
) && CLASSTYPE_INTERFACE_KNOWN (ctype
)
2684 && TYPE_VIRTUAL_P (ctype
)
2685 /* If -fno-rtti, we're not necessarily emitting this stuff with
2686 the class, so go ahead and emit it now. This can happen
2687 when a class is used in exception handling. */
2689 /* If the type is a cv-qualified variant of a type, then we
2690 must emit the tinfo function in this translation unit
2691 since it will not be emitted when the vtable for the type
2692 is output (which is when the unqualified version is
2694 && same_type_p (ctype
, TYPE_MAIN_VARIANT (ctype
)))
2696 DECL_NOT_REALLY_EXTERN (decl
)
2697 = ! (CLASSTYPE_INTERFACE_ONLY (ctype
)
2698 || (DECL_THIS_INLINE (decl
) && ! flag_implement_inlines
2699 && !DECL_VINDEX (decl
)));
2701 /* Always make artificials weak. */
2703 comdat_linkage (decl
);
2705 else if (TYPE_BUILT_IN (ctype
)
2706 && same_type_p (ctype
, TYPE_MAIN_VARIANT (ctype
)))
2707 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2709 comdat_linkage (decl
);
2712 comdat_linkage (decl
);
2714 DECL_INTERFACE_KNOWN (decl
) = 1;
2718 build_cleanup (decl
)
2722 tree type
= TREE_TYPE (decl
);
2724 if (TREE_CODE (type
) == ARRAY_TYPE
)
2728 mark_addressable (decl
);
2729 temp
= build1 (ADDR_EXPR
, build_pointer_type (type
), decl
);
2731 temp
= build_delete (TREE_TYPE (temp
), temp
,
2733 LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
, 0);
2737 extern int parse_time
, varconst_time
;
2743 tree sname
= get_id_2 ("__sn", base
);
2744 /* For struct X foo __attribute__((weak)), there is a counter
2745 __snfoo. Since base is already an assembler name, sname should
2746 be globally unique */
2747 tree sentry
= IDENTIFIER_GLOBAL_VALUE (sname
);
2750 push_permanent_obstack ();
2751 sentry
= build_decl (VAR_DECL
, sname
, integer_type_node
);
2752 TREE_PUBLIC (sentry
) = 1;
2753 DECL_ARTIFICIAL (sentry
) = 1;
2754 TREE_STATIC (sentry
) = 1;
2755 TREE_USED (sentry
) = 1;
2756 DECL_COMMON (sentry
) = 1;
2757 pushdecl_top_level (sentry
);
2758 cp_finish_decl (sentry
, NULL_TREE
, NULL_TREE
, 0, 0);
2764 /* Start the process of running a particular set of global constructors
2765 or destructors. Subroutine of do_[cd]tors. */
2768 start_objects (method_type
, initp
)
2769 int method_type
, initp
;
2775 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
2777 if (initp
!= DEFAULT_INIT_PRIORITY
)
2787 sprintf (type
, "%c%c%.5u", method_type
, joiner
, initp
);
2790 sprintf (type
, "%c", method_type
);
2792 fnname
= get_file_function_name_long (type
);
2794 start_function (void_list_node
,
2795 make_call_declarator (fnname
, void_list_node
, NULL_TREE
,
2797 NULL_TREE
, SF_DEFAULT
);
2799 #if defined(ASM_OUTPUT_CONSTRUCTOR) && defined(ASM_OUTPUT_DESTRUCTOR)
2800 /* It can be a static function as long as collect2 does not have
2801 to scan the object file to find its ctor/dtor routine. */
2802 TREE_PUBLIC (current_function_decl
) = 0;
2805 /* Mark this declaration as used to avoid spurious warnings. */
2806 TREE_USED (current_function_decl
) = 1;
2808 /* Mark this function as a global constructor or destructor. */
2809 if (method_type
== 'I')
2810 DECL_GLOBAL_CTOR_P (current_function_decl
) = 1;
2812 DECL_GLOBAL_DTOR_P (current_function_decl
) = 1;
2813 GLOBAL_INIT_PRIORITY (current_function_decl
) = initp
;
2815 body
= begin_compound_stmt (/*has_no_scope=*/0);
2817 /* We cannot allow these functions to be elided, even if they do not
2818 have external linkage. And, there's no point in deferring
2819 copmilation of thes functions; they're all going to have to be
2821 current_function_cannot_inline
2822 = "static constructors and destructors cannot be inlined";
2827 /* Finish the process of running a particular set of global constructors
2828 or destructors. Subroutine of do_[cd]tors. */
2831 finish_objects (method_type
, initp
, body
)
2832 int method_type
, initp
;
2839 finish_compound_stmt(/*has_no_scope=*/0, body
);
2840 fn
= finish_function (lineno
, 0);
2843 /* When only doing semantic analysis, and no RTL generation, we
2844 can't call functions that directly emit assembly code; there is
2845 no assembly file in which to put the code. */
2846 if (flag_syntax_only
)
2849 fnname
= XSTR (XEXP (DECL_RTL (fn
), 0), 0);
2850 if (initp
== DEFAULT_INIT_PRIORITY
)
2852 if (method_type
== 'I')
2853 assemble_constructor (fnname
);
2855 assemble_destructor (fnname
);
2857 #if defined (ASM_OUTPUT_SECTION_NAME) && defined (ASM_OUTPUT_CONSTRUCTOR)
2858 /* If we're using init priority we can't use assemble_*tor, but on ELF
2859 targets we can stick the references into named sections for GNU ld
2864 sprintf (buf
, ".%ctors.%.5u", method_type
== 'I' ? 'c' : 'd',
2865 /* invert the numbering so the linker puts us in the proper
2866 order; constructors are run from right to left, and the
2867 linker sorts in increasing order. */
2868 MAX_INIT_PRIORITY
- initp
);
2869 named_section (NULL_TREE
, buf
, 0);
2870 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, fnname
),
2871 POINTER_SIZE
/ BITS_PER_UNIT
, 1);
2876 /* The names of the parameters to the function created to handle
2877 initializations and destructions for objects with static storage
2879 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
2880 #define PRIORITY_IDENTIFIER "__priority"
2882 /* The name of the function we create to handle initializations and
2883 destructions for objects with static storage duration. */
2884 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
2886 /* The declaration for the __INITIALIZE_P argument. */
2887 static tree initialize_p_decl
;
2889 /* The declaration for the __PRIORITY argument. */
2890 static tree priority_decl
;
2892 /* The declaration for the static storage duration function. */
2893 static tree ssdf_decl
;
2895 /* All the static storage duration functions created in this
2896 translation unit. */
2897 static varray_type ssdf_decls
;
2898 static size_t ssdf_decls_used
;
2900 /* A map from priority levels to information about that priority
2901 level. There may be many such levels, so efficient lookup is
2903 static splay_tree priority_info_map
;
2905 /* Begins the generation of the function that will handle all
2906 initialization and destruction of objects with static storage
2907 duration. The function generated takes two parameters of type
2908 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
2909 non-zero, it performs initializations. Otherwise, it performs
2910 destructions. It only performs those initializations or
2911 destructions with the indicated __PRIORITY. The generated function
2914 It is assumed that this function will only be called once per
2915 translation unit. */
2918 start_static_storage_duration_function ()
2920 static unsigned ssdf_number
;
2925 char id
[sizeof (SSDF_IDENTIFIER
) + 1 /* '\0' */ + 32];
2927 /* Create the identifier for this function. It will be of the form
2928 SSDF_IDENTIFIER_<number>. */
2929 sprintf (id
, "%s_%u", SSDF_IDENTIFIER
, ssdf_number
++);
2930 if (ssdf_number
== 0)
2932 /* Overflow occurred. That means there are at least 4 billion
2933 initialization functions. */
2934 sorry ("too many initialization functions required");
2935 my_friendly_abort (19990430);
2938 /* Create the parameters. */
2939 parm_types
= void_list_node
;
2940 parm_types
= tree_cons (NULL_TREE
, integer_type_node
, parm_types
);
2941 parm_types
= tree_cons (NULL_TREE
, integer_type_node
, parm_types
);
2942 type
= build_function_type (void_type_node
, parm_types
);
2944 /* Create the FUNCTION_DECL itself. */
2945 ssdf_decl
= build_lang_decl (FUNCTION_DECL
,
2946 get_identifier (id
),
2948 TREE_PUBLIC (ssdf_decl
) = 0;
2949 DECL_ARTIFICIAL (ssdf_decl
) = 1;
2951 /* Put this function in the list of functions to be called from the
2952 static constructors and destructors. */
2955 VARRAY_TREE_INIT (ssdf_decls
, 32, "ssdf_decls");
2957 /* Take this opportunity to initialize the map from priority
2958 numbers to information about that priority level. */
2959 priority_info_map
= splay_tree_new (splay_tree_compare_ints
,
2960 /*delete_key_fn=*/0,
2961 /*delete_value_fn=*/
2962 (splay_tree_delete_value_fn
) &free
);
2964 /* We always need to generate functions for the
2965 DEFAULT_INIT_PRIORITY so enter it now. That way when we walk
2966 priorities later, we'll be sure to find the
2967 DEFAULT_INIT_PRIORITY. */
2968 get_priority_info (DEFAULT_INIT_PRIORITY
);
2971 if (ssdf_decls_used
== ssdf_decls
->num_elements
)
2972 VARRAY_GROW (ssdf_decls
, 2 * ssdf_decls_used
);
2973 VARRAY_TREE (ssdf_decls
, ssdf_decls_used
) = ssdf_decl
;
2976 /* Create the argument list. */
2977 initialize_p_decl
= build_decl (PARM_DECL
,
2978 get_identifier (INITIALIZE_P_IDENTIFIER
),
2980 DECL_CONTEXT (initialize_p_decl
) = ssdf_decl
;
2981 DECL_ARG_TYPE (initialize_p_decl
) = integer_type_node
;
2982 TREE_USED (initialize_p_decl
) = 1;
2983 priority_decl
= build_decl (PARM_DECL
, get_identifier (PRIORITY_IDENTIFIER
),
2985 DECL_CONTEXT (priority_decl
) = ssdf_decl
;
2986 DECL_ARG_TYPE (priority_decl
) = integer_type_node
;
2987 TREE_USED (priority_decl
) = 1;
2989 TREE_CHAIN (initialize_p_decl
) = priority_decl
;
2990 DECL_ARGUMENTS (ssdf_decl
) = initialize_p_decl
;
2992 /* Put the function in the global scope. */
2993 pushdecl (ssdf_decl
);
2995 /* Start the function itself. This is equivalent to declarating the
2998 static void __ssdf (int __initialize_p, init __priority_p);
3000 It is static because we only need to call this function from the
3001 various constructor and destructor functions for this module. */
3002 start_function (/*specs=*/NULL_TREE
,
3004 /*attrs=*/NULL_TREE
,
3007 /* Set up the scope of the outermost block in the function. */
3008 body
= begin_compound_stmt (/*has_no_scope=*/0);
3010 /* This function must not be deferred because we are depending on
3011 its compilation to tell us what is TREE_SYMBOL_REFERENCED. */
3012 current_function_cannot_inline
3013 = "static storage duration functions cannot be inlined";
3018 /* Finish the generation of the function which performs initialization
3019 and destruction of objects with static storage duration. After
3020 this point, no more such objects can be created. */
3023 finish_static_storage_duration_function (body
)
3026 /* Close out the function. */
3027 finish_compound_stmt (/*has_no_scope=*/0, body
);
3028 expand_body (finish_function (lineno
, 0));
3031 /* Return the information about the indicated PRIORITY level. If no
3032 code to handle this level has yet been generated, generate the
3033 appropriate prologue. */
3035 static priority_info
3036 get_priority_info (priority
)
3042 n
= splay_tree_lookup (priority_info_map
,
3043 (splay_tree_key
) priority
);
3046 /* Create a new priority information structure, and insert it
3048 pi
= (priority_info
) xmalloc (sizeof (struct priority_info_s
));
3049 pi
->initializations_p
= 0;
3050 pi
->destructions_p
= 0;
3051 splay_tree_insert (priority_info_map
,
3052 (splay_tree_key
) priority
,
3053 (splay_tree_value
) pi
);
3056 pi
= (priority_info
) n
->value
;
3061 /* Set up to handle the initialization or destruction of DECL. If
3062 INITP is non-zero, we are initializing the variable. Otherwise, we
3063 are destroying it. */
3066 start_static_initialization_or_destruction (decl
, initp
)
3070 tree sentry_if_stmt
= NULL_TREE
;
3076 /* Figure out the priority for this declaration. */
3077 priority
= DECL_INIT_PRIORITY (decl
);
3079 priority
= DEFAULT_INIT_PRIORITY
;
3081 /* Remember that we had an initialization or finalization at this
3083 pi
= get_priority_info (priority
);
3085 pi
->initializations_p
= 1;
3087 pi
->destructions_p
= 1;
3089 /* Trick the compiler into thinking we are at the file and line
3090 where DECL was declared so that error-messages make sense, and so
3091 that the debugger will show somewhat sensible file and line
3093 input_filename
= DECL_SOURCE_FILE (decl
);
3094 lineno
= DECL_SOURCE_LINE (decl
);
3100 Access control for implicit calls to the constructors,
3101 the conversion functions, or the destructor called to
3102 create and destroy a static data member is performed as
3103 if these calls appeared in the scope of the member's
3106 we pretend we are in a static member function of the class of
3107 which the DECL is a member. */
3108 if (member_p (decl
))
3110 DECL_CLASS_CONTEXT (current_function_decl
) = DECL_CONTEXT (decl
);
3111 DECL_STATIC_FUNCTION_P (current_function_decl
) = 1;
3114 /* Conditionalize this initialization on being in the right priority
3115 and being initializing/finalizing appropriately. */
3116 sentry_if_stmt
= begin_if_stmt ();
3117 cond
= build_binary_op (EQ_EXPR
,
3119 build_int_2 (priority
, 0));
3120 init_cond
= initp
? integer_one_node
: integer_zero_node
;
3121 init_cond
= build_binary_op (EQ_EXPR
,
3124 cond
= build_binary_op (TRUTH_ANDIF_EXPR
, cond
, init_cond
);
3126 /* We need a sentry if this is an object with external linkage that
3127 might be initialized in more than one place. */
3128 if (TREE_PUBLIC (decl
) && (DECL_COMMON (decl
)
3129 || DECL_ONE_ONLY (decl
)
3130 || DECL_WEAK (decl
)))
3135 sentry
= get_sentry (DECL_ASSEMBLER_NAME (decl
));
3137 /* We do initializations only if the SENTRY is zero, i.e., if we
3138 are the first to initialize the variable. We do destructions
3139 only if the SENTRY is one, i.e., if we are the last to
3140 destroy the variable. */
3142 sentry_cond
= build_binary_op (EQ_EXPR
,
3143 build_unary_op (PREINCREMENT_EXPR
,
3148 sentry_cond
= build_binary_op (EQ_EXPR
,
3149 build_unary_op (PREDECREMENT_EXPR
,
3154 cond
= build_binary_op (TRUTH_ANDIF_EXPR
, cond
, sentry_cond
);
3157 finish_if_stmt_cond (cond
, sentry_if_stmt
);
3159 return sentry_if_stmt
;
3162 /* We've just finished generating code to do an initialization or
3163 finalization. SENTRY_IF_STMT is the if-statement we used to guard
3164 the initialization. */
3167 finish_static_initialization_or_destruction (sentry_if_stmt
)
3168 tree sentry_if_stmt
;
3170 finish_then_clause (sentry_if_stmt
);
3173 /* Now that we're done with DECL we don't need to pretend to be a
3174 member of its class any longer. */
3175 DECL_CLASS_CONTEXT (current_function_decl
) = NULL_TREE
;
3176 DECL_STATIC_FUNCTION_P (current_function_decl
) = 0;
3179 /* Generate code to do the static initialization of DECL. The
3180 initialization is INIT. If DECL may be initialized more than once
3181 in different object files, SENTRY is the guard variable to
3182 check. PRIORITY is the priority for the initialization. */
3185 do_static_initialization (decl
, init
)
3190 tree sentry_if_stmt
;
3192 /* Set up for the initialization. */
3194 = start_static_initialization_or_destruction (decl
,
3197 /* Do the initialization itself. */
3198 if (IS_AGGR_TYPE (TREE_TYPE (decl
))
3199 || TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
3200 expr
= build_aggr_init (decl
, init
, 0);
3201 else if (TREE_CODE (init
) == TREE_VEC
)
3202 expr
= build_vec_init (decl
, TREE_VEC_ELT (init
, 0),
3203 TREE_VEC_ELT (init
, 1),
3204 TREE_VEC_ELT (init
, 2), 0);
3207 expr
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
3208 TREE_SIDE_EFFECTS (expr
) = 1;
3210 finish_expr_stmt (expr
);
3213 finish_static_initialization_or_destruction (sentry_if_stmt
);
3216 /* Generate code to do the static destruction of DECL. If DECL may be
3217 initialized more than once in different object files, SENTRY is the
3218 guard variable to check. PRIORITY is the priority for the
3222 do_static_destruction (decl
)
3225 tree sentry_if_stmt
;
3227 /* If we don't need a destructor, there's nothing to do. */
3228 if (!TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
3231 /* Actually do the destruction. */
3232 sentry_if_stmt
= start_static_initialization_or_destruction (decl
,
3234 finish_expr_stmt (build_cleanup (decl
));
3235 finish_static_initialization_or_destruction (sentry_if_stmt
);
3238 /* VARS is a list of variables with static storage duration which may
3239 need initialization and/or finalization. Remove those variables
3240 that don't really need to be initialized or finalized, and return
3241 the resulting list. The order in which the variables appear in
3242 VARS is in reverse order of the order in which they should actually
3243 be initialized. The list we return is in the unreversed order;
3244 i.e., the first variable should be initialized first. */
3247 prune_vars_needing_no_initialization (vars
)
3253 for (var
= vars
, result
= NULL_TREE
;
3255 var
= TREE_CHAIN (var
))
3257 tree decl
= TREE_VALUE (var
);
3258 tree init
= TREE_PURPOSE (var
);
3260 /* Deal gracefully with error. */
3261 if (decl
== error_mark_node
)
3264 /* The only things that can be initialized are variables. */
3265 my_friendly_assert (TREE_CODE (decl
) == VAR_DECL
, 19990420);
3267 /* If this object is not defined, we don't need to do anything
3269 if (DECL_EXTERNAL (decl
))
3272 /* Also, if the initializer already contains errors, we can bail
3274 if (init
&& TREE_CODE (init
) == TREE_LIST
3275 && value_member (error_mark_node
, init
))
3278 /* This variable is going to need initialization and/or
3279 finalization, so we add it to the list. */
3280 result
= tree_cons (init
, decl
, result
);
3286 /* Make sure we have told the back end about all the variables in
3290 write_out_vars (vars
)
3295 for (v
= vars
; v
; v
= TREE_CHAIN (v
))
3296 if (! TREE_ASM_WRITTEN (TREE_VALUE (v
)))
3297 rest_of_decl_compilation (TREE_VALUE (v
), 0, 1, 1);
3300 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
3301 (otherwise) that will initialize all gobal objects with static
3302 storage duration having the indicated PRIORITY. */
3305 generate_ctor_or_dtor_function (constructor_p
, priority
)
3314 /* We use `I' to indicate initialization and `D' to indicate
3321 /* Begin the function. */
3322 body
= start_objects (function_key
, priority
);
3324 /* Call the static storage duration function with appropriate
3326 for (i
= 0; i
< ssdf_decls_used
; ++i
)
3328 arguments
= tree_cons (NULL_TREE
, build_int_2 (priority
, 0),
3330 arguments
= tree_cons (NULL_TREE
, build_int_2 (constructor_p
, 0),
3332 finish_expr_stmt (build_function_call (VARRAY_TREE (ssdf_decls
, i
),
3336 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
3337 calls to any functions marked with attributes indicating that
3338 they should be called at initialization- or destruction-time. */
3339 if (priority
== DEFAULT_INIT_PRIORITY
)
3343 for (fns
= constructor_p
? static_ctors
: static_dtors
;
3345 fns
= TREE_CHAIN (fns
))
3346 finish_expr_stmt (build_function_call (TREE_VALUE (fns
), NULL_TREE
));
3349 /* Close out the function. */
3350 finish_objects (function_key
, priority
, body
);
3353 /* Generate constructor and destructor functions for the priority
3357 generate_ctor_and_dtor_functions_for_priority (n
, data
)
3359 void *data ATTRIBUTE_UNUSED
;
3361 int priority
= (int) n
->key
;
3362 priority_info pi
= (priority_info
) n
->value
;
3364 /* Generate the functions themselves, but only if they are really
3366 if (pi
->initializations_p
3367 || (priority
== DEFAULT_INIT_PRIORITY
&& static_ctors
))
3368 generate_ctor_or_dtor_function (/*constructor_p=*/1,
3370 if (pi
->destructions_p
3371 || (priority
== DEFAULT_INIT_PRIORITY
&& static_dtors
))
3372 generate_ctor_or_dtor_function (/*constructor_p=*/0,
3375 /* Keep iterating. */
3379 /* This routine is called from the last rule in yyparse ().
3380 Its job is to create all the code needed to initialize and
3381 destroy the global aggregates. We do the destruction
3382 first, since that way we only need to reverse the decls once. */
3388 int start_time
, this_time
;
3395 /* Bad parse errors. Just forget about it. */
3396 if (! global_bindings_p () || current_class_type
|| decl_namespace_list
)
3399 start_time
= get_run_time ();
3401 /* Otherwise, GDB can get confused, because in only knows
3402 about source for LINENO-1 lines. */
3405 interface_unknown
= 1;
3408 /* We now have to write out all the stuff we put off writing out.
3411 o Template specializations that we have not yet instantiated,
3412 but which are needed.
3413 o Initialization and destruction for non-local objects with
3414 static storage duration. (Local objects with static storage
3415 duration are initialized when their scope is first entered,
3416 and are cleaned up via atexit.)
3417 o Virtual function tables.
3419 All of these may cause others to be needed. For example,
3420 instantiating one function may cause another to be needed, and
3421 generating the intiailzer for an object may cause templates to be
3422 instantiated, etc., etc. */
3424 this_time
= get_run_time ();
3425 parse_time
-= this_time
- start_time
;
3426 varconst_time
+= this_time
- start_time
;
3427 start_time
= get_run_time ();
3428 permanent_allocation (1);
3434 /* If there are templates that we've put off instantiating, do
3436 instantiate_pending_templates ();
3438 /* Write out virtual tables as required. Note that writing out
3439 the virtual table for a template class may cause the
3440 instantiation of members of that class. */
3441 if (walk_globals (vtable_decl_p
,
3442 finish_vtable_vardecl
,
3446 /* The list of objects with static storage duration is built up
3447 in reverse order. We clear STATIC_AGGREGATES so that any new
3448 aggregates added during the initialization of these will be
3449 initialized in the correct order when we next come around the
3451 vars
= prune_vars_needing_no_initialization (static_aggregates
);
3452 static_aggregates
= NULL_TREE
;
3458 /* We need to start a new initialization function each time
3459 through the loop. That's because we need to know which
3460 vtables have been referenced, and TREE_SYMBOL_REFERENCED
3461 isn't computed until a function is finished, and written
3462 out. That's a deficiency in the back-end. When this is
3463 fixed, these initialization functions could all become
3464 inline, with resulting performance improvements. */
3465 tree ssdf_body
= start_static_storage_duration_function ();
3467 /* Make sure the back end knows about all the variables. */
3468 write_out_vars (vars
);
3470 /* First generate code to do all the initializations. */
3471 for (v
= vars
; v
; v
= TREE_CHAIN (v
))
3472 do_static_initialization (TREE_VALUE (v
),
3475 /* Then, generate code to do all the destructions. Do these
3476 in reverse order so that the most recently constructed
3477 variable is the first destroyed. */
3478 vars
= nreverse (vars
);
3479 for (v
= vars
; v
; v
= TREE_CHAIN (v
))
3480 do_static_destruction (TREE_VALUE (v
));
3482 /* Finish up the static storage duration function for this
3484 finish_static_storage_duration_function (ssdf_body
);
3486 /* All those initializations and finalizations might cause
3487 us to need more inline functions, more template
3488 instantiations, etc. */
3492 /* Go through the various inline functions, and see if any need
3494 for (i
= 0; i
< saved_inlines_used
; ++i
)
3496 tree decl
= VARRAY_TREE (saved_inlines
, i
);
3497 import_export_decl (decl
);
3498 if (DECL_ARTIFICIAL (decl
) && ! DECL_INITIAL (decl
)
3500 && (! DECL_REALLY_EXTERN (decl
) || DECL_INLINE (decl
)))
3502 /* Even though we're already at the top-level, we push
3503 there again. That way, when we pop back a few lines
3504 hence, all of our state is restored. Otherwise,
3505 finish_function doesn't clean things up, and we end
3506 up with CURRENT_FUNCTION_DECL set. */
3507 push_to_top_level ();
3508 if (DECL_TINFO_FN_P (decl
))
3509 synthesize_tinfo_fn (decl
);
3511 synthesize_method (decl
);
3512 pop_from_top_level ();
3517 /* Mark all functions that might deal with exception-handling as
3519 mark_all_runtime_matches ();
3521 /* We lie to the back-end, pretending that some functions are
3522 not defined when they really are. This keeps these functions
3523 from being put out unncessarily. But, we must stop lying
3524 when the functions are referenced, or if they are not comdat
3525 since they need to be put out now. */
3526 for (i
= 0; i
< saved_inlines_used
; ++i
)
3528 tree decl
= VARRAY_TREE (saved_inlines
, i
);
3530 if (DECL_NOT_REALLY_EXTERN (decl
)
3531 && DECL_INITIAL (decl
)
3532 && (DECL_NEEDED_P (decl
) || !DECL_COMDAT (decl
)))
3533 DECL_EXTERNAL (decl
) = 0;
3536 if (saved_inlines_used
3537 && wrapup_global_declarations (&VARRAY_TREE (saved_inlines
, 0),
3538 saved_inlines_used
))
3540 if (walk_namespaces (wrapup_globals_for_namespace
, /*data=*/0))
3543 /* Static data members are just like namespace-scope globals. */
3544 for (i
= 0; i
< pending_statics_used
; ++i
)
3546 tree decl
= VARRAY_TREE (pending_statics
, i
);
3547 if (TREE_ASM_WRITTEN (decl
))
3549 import_export_decl (decl
);
3550 if (DECL_NOT_REALLY_EXTERN (decl
) && ! DECL_IN_AGGR_P (decl
))
3551 DECL_EXTERNAL (decl
) = 0;
3554 && wrapup_global_declarations (&VARRAY_TREE (pending_statics
, 0),
3555 pending_statics_used
))
3560 /* We give C linkage to static constructors and destructors. */
3561 push_lang_context (lang_name_c
);
3563 /* Generate initialization and destruction functions for all
3564 priorities for which they are required. */
3565 if (priority_info_map
)
3566 splay_tree_foreach (priority_info_map
,
3567 generate_ctor_and_dtor_functions_for_priority
,
3570 /* We're done with the splay-tree now. */
3571 if (priority_info_map
)
3572 splay_tree_delete (priority_info_map
);
3574 /* We're done with static constructors, so we can go back to "C++"
3576 pop_lang_context ();
3578 /* Now delete from the chain of variables all virtual function tables.
3579 We output them all ourselves, because each will be treated
3580 specially. We don't do this if we're just doing semantic
3581 analysis, and not code-generation. */
3582 if (!flag_syntax_only
)
3583 walk_globals (vtable_decl_p
, prune_vtable_vardecl
, /*data=*/0);
3585 /* Now, issue warnings about static, but not defined, functions,
3586 etc., and emit debugging information. */
3587 walk_namespaces (wrapup_globals_for_namespace
, /*data=*/&reconsider
);
3588 if (pending_statics
)
3589 check_global_declarations (&VARRAY_TREE (pending_statics
, 0),
3590 pending_statics_used
);
3594 /* The entire file is now complete. If requested, dump everything
3596 if (flag_dump_translation_unit
)
3597 dump_node_to_file (global_namespace
, flag_dump_translation_unit
);
3599 /* If there's some tool that wants to examine the entire translation
3600 unit, let it do so now. */
3602 (*back_end_hook
) (global_namespace
);
3604 this_time
= get_run_time ();
3605 parse_time
-= this_time
- start_time
;
3606 varconst_time
+= this_time
- start_time
;
3608 if (flag_detailed_statistics
)
3610 dump_tree_statistics ();
3611 dump_time_statistics ();
3615 /* This is something of the form 'A()()()()()+1' that has turned out to be an
3616 expr. Since it was parsed like a type, we need to wade through and fix
3617 that. Unfortunately, since operator() is left-associative, we can't use
3618 tail recursion. In the above example, TYPE is `A', and DECL is
3621 Maybe this shouldn't be recursive, but how often will it actually be
3625 reparse_absdcl_as_expr (type
, decl
)
3628 /* do build_functional_cast (type, NULL_TREE) at bottom */
3629 if (TREE_OPERAND (decl
, 0) == NULL_TREE
)
3630 return build_functional_cast (type
, NULL_TREE
);
3633 decl
= reparse_absdcl_as_expr (type
, TREE_OPERAND (decl
, 0));
3635 decl
= build_x_function_call (decl
, NULL_TREE
, current_class_ref
);
3637 if (TREE_CODE (decl
) == CALL_EXPR
3638 && (! TREE_TYPE (decl
)
3639 || TREE_CODE (TREE_TYPE (decl
)) != VOID_TYPE
))
3640 decl
= require_complete_type (decl
);
3645 /* This is something of the form `int ((int)(int)(int)1)' that has turned
3646 out to be an expr. Since it was parsed like a type, we need to wade
3647 through and fix that. Since casts are right-associative, we are
3648 reversing the order, so we don't have to recurse.
3650 In the above example, DECL is the `(int)(int)(int)', and EXPR is the
3654 reparse_absdcl_as_casts (decl
, expr
)
3659 if (TREE_CODE (expr
) == CONSTRUCTOR
3660 && TREE_TYPE (expr
) == 0)
3662 type
= groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl
)));
3663 decl
= TREE_OPERAND (decl
, 0);
3665 expr
= digest_init (type
, expr
, (tree
*) 0);
3666 if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_SIZE (type
) == 0)
3668 int failure
= complete_array_type (type
, expr
, 1);
3670 my_friendly_abort (78);
3676 type
= groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl
)));
3677 decl
= TREE_OPERAND (decl
, 0);
3678 expr
= build_c_cast (type
, expr
);
3681 if (warn_old_style_cast
&& ! in_system_header
3682 && current_lang_name
!= lang_name_c
)
3683 warning ("use of old-style cast");
3688 /* Given plain tree nodes for an expression, build up the full semantics. */
3691 build_expr_from_tree (t
)
3694 if (t
== NULL_TREE
|| t
== error_mark_node
)
3697 switch (TREE_CODE (t
))
3699 case IDENTIFIER_NODE
:
3700 return do_identifier (t
, 0, NULL_TREE
);
3703 if (LOOKUP_EXPR_GLOBAL (t
))
3704 return do_scoped_id (TREE_OPERAND (t
, 0), 0);
3706 return do_identifier (TREE_OPERAND (t
, 0), 0, NULL_TREE
);
3708 case TEMPLATE_ID_EXPR
:
3709 return (lookup_template_function
3710 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3711 build_expr_from_tree (TREE_OPERAND (t
, 1))));
3714 return build_x_indirect_ref
3715 (build_expr_from_tree (TREE_OPERAND (t
, 0)), "unary *");
3718 return build_functional_cast
3719 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3721 case REINTERPRET_CAST_EXPR
:
3722 return build_reinterpret_cast
3723 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3725 case CONST_CAST_EXPR
:
3726 return build_const_cast
3727 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3729 case DYNAMIC_CAST_EXPR
:
3730 return build_dynamic_cast
3731 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3733 case STATIC_CAST_EXPR
:
3734 return build_static_cast
3735 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3737 case PREDECREMENT_EXPR
:
3738 case PREINCREMENT_EXPR
:
3739 case POSTDECREMENT_EXPR
:
3740 case POSTINCREMENT_EXPR
:
3744 case TRUTH_NOT_EXPR
:
3746 case CONVERT_EXPR
: /* Unary + */
3751 return build_x_unary_op (TREE_CODE (t
),
3752 build_expr_from_tree (TREE_OPERAND (t
, 0)));
3757 case TRUNC_DIV_EXPR
:
3759 case FLOOR_DIV_EXPR
:
3760 case ROUND_DIV_EXPR
:
3761 case EXACT_DIV_EXPR
:
3763 case BIT_ANDTC_EXPR
:
3766 case TRUNC_MOD_EXPR
:
3767 case FLOOR_MOD_EXPR
:
3768 case TRUTH_ANDIF_EXPR
:
3769 case TRUTH_ORIF_EXPR
:
3770 case TRUTH_AND_EXPR
:
3785 return build_x_binary_op
3787 build_expr_from_tree (TREE_OPERAND (t
, 0)),
3788 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3791 return build_m_component_ref
3792 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3793 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3796 return build_offset_ref (TREE_OPERAND (t
, 0), TREE_OPERAND (t
, 1));
3799 if (TREE_OPERAND (t
, 0) == NULL_TREE
)
3801 return build_parse_node (ARRAY_REF
, NULL_TREE
,
3802 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3803 return grok_array_decl (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3804 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3809 tree r
= build_expr_from_tree (TREE_OPERAND (t
, 0));
3810 if (TREE_CODE_CLASS (TREE_CODE (r
)) != 't')
3812 return TREE_CODE (t
) == SIZEOF_EXPR
? c_sizeof (r
) : c_alignof (r
);
3816 return build_x_modify_expr
3817 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3818 TREE_CODE (TREE_OPERAND (t
, 1)),
3819 build_expr_from_tree (TREE_OPERAND (t
, 2)));
3822 return build_x_arrow
3823 (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3827 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3828 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3829 build_expr_from_tree (TREE_OPERAND (t
, 2)),
3830 NEW_EXPR_USE_GLOBAL (t
));
3833 return delete_sanity
3834 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3835 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3836 DELETE_EXPR_USE_VEC (t
), DELETE_EXPR_USE_GLOBAL (t
));
3839 if (TREE_OPERAND (t
, 1) == NULL_TREE
)
3840 return build_x_compound_expr
3841 (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3843 my_friendly_abort (42);
3845 case METHOD_CALL_EXPR
:
3846 if (TREE_CODE (TREE_OPERAND (t
, 0)) == SCOPE_REF
)
3848 tree ref
= TREE_OPERAND (t
, 0);
3849 return build_scoped_method_call
3850 (build_expr_from_tree (TREE_OPERAND (t
, 1)),
3851 build_expr_from_tree (TREE_OPERAND (ref
, 0)),
3852 TREE_OPERAND (ref
, 1),
3853 build_expr_from_tree (TREE_OPERAND (t
, 2)));
3857 tree fn
= TREE_OPERAND (t
, 0);
3859 /* We can get a TEMPLATE_ID_EXPR here on code like:
3863 so we must resolve that. However, we can also get things
3864 like a BIT_NOT_EXPR here, when referring to a destructor,
3865 and things like that are not correctly resolved by
3866 build_expr_from_tree. So, just use build_expr_from_tree
3867 when we really need it. */
3868 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3869 fn
= lookup_template_function
3870 (TREE_OPERAND (fn
, 0),
3871 build_expr_from_tree (TREE_OPERAND (fn
, 1)));
3873 return build_method_call
3874 (build_expr_from_tree (TREE_OPERAND (t
, 1)),
3876 build_expr_from_tree (TREE_OPERAND (t
, 2)),
3877 NULL_TREE
, LOOKUP_NORMAL
);
3881 if (TREE_CODE (TREE_OPERAND (t
, 0)) == SCOPE_REF
)
3883 tree ref
= TREE_OPERAND (t
, 0);
3884 return build_member_call
3885 (build_expr_from_tree (TREE_OPERAND (ref
, 0)),
3886 TREE_OPERAND (ref
, 1),
3887 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3891 tree name
= TREE_OPERAND (t
, 0);
3893 tree args
= build_expr_from_tree (TREE_OPERAND (t
, 1));
3894 if (args
!= NULL_TREE
&& TREE_CODE (name
) == LOOKUP_EXPR
3895 && !LOOKUP_EXPR_GLOBAL (name
)
3896 && TREE_CODE ((id
= TREE_OPERAND (name
, 0))) == IDENTIFIER_NODE
3897 && (!current_class_type
3898 || !lookup_member (current_class_type
, id
, 0, 0)))
3900 /* Do Koenig lookup if there are no class members. */
3901 name
= do_identifier (id
, 0, args
);
3903 else if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
3904 || ! really_overloaded_fn (name
))
3905 name
= build_expr_from_tree (name
);
3906 return build_x_function_call (name
, args
, current_class_ref
);
3910 return build_x_conditional_expr
3911 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3912 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3913 build_expr_from_tree (TREE_OPERAND (t
, 2)));
3915 case PSEUDO_DTOR_EXPR
:
3916 return (finish_pseudo_destructor_call_expr
3917 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3918 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3919 build_expr_from_tree (TREE_OPERAND (t
, 2))));
3923 tree purpose
, value
, chain
;
3925 if (t
== void_list_node
)
3928 purpose
= TREE_PURPOSE (t
);
3930 purpose
= build_expr_from_tree (purpose
);
3931 value
= TREE_VALUE (t
);
3933 value
= build_expr_from_tree (value
);
3934 chain
= TREE_CHAIN (t
);
3935 if (chain
&& chain
!= void_type_node
)
3936 chain
= build_expr_from_tree (chain
);
3937 return tree_cons (purpose
, value
, chain
);
3942 tree object
= build_expr_from_tree (TREE_OPERAND (t
, 0));
3943 tree field
= TREE_OPERAND (t
, 1);
3945 /* We use a COMPONENT_REF to indicate things of the form `x.b'
3946 and `x.A::b'. We must distinguish between those cases
3948 if (TREE_CODE (field
) == SCOPE_REF
)
3949 return build_object_ref (object
,
3950 TREE_OPERAND (field
, 0),
3951 TREE_OPERAND (field
, 1));
3953 return build_x_component_ref (object
, field
,
3958 return build_throw (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3964 /* digest_init will do the wrong thing if we let it. */
3965 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
)))
3968 r
= build_nt (CONSTRUCTOR
, NULL_TREE
,
3969 build_expr_from_tree (CONSTRUCTOR_ELTS (t
)));
3970 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
3973 return digest_init (TREE_TYPE (t
), r
, 0);
3978 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (t
, 0))) == 't')
3979 return get_typeid (TREE_OPERAND (t
, 0));
3980 return build_x_typeid (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3983 return convert_from_reference (t
);
3986 return build_va_arg (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3994 /* This is something of the form `int (*a)++' that has turned out to be an
3995 expr. It was only converted into parse nodes, so we need to go through
3996 and build up the semantics. Most of the work is done by
3997 build_expr_from_tree, above.
3999 In the above example, TYPE is `int' and DECL is `*a'. */
4002 reparse_decl_as_expr (type
, decl
)
4005 decl
= build_expr_from_tree (decl
);
4007 return build_functional_cast (type
, build_expr_list (NULL_TREE
, decl
));
4012 /* This is something of the form `int (*a)' that has turned out to be a
4013 decl. It was only converted into parse nodes, so we need to do the
4014 checking that make_{pointer,reference}_declarator do. */
4017 finish_decl_parsing (decl
)
4020 extern int current_class_depth
;
4022 switch (TREE_CODE (decl
))
4024 case IDENTIFIER_NODE
:
4027 return make_pointer_declarator
4028 (NULL_TREE
, finish_decl_parsing (TREE_OPERAND (decl
, 0)));
4030 return make_reference_declarator
4031 (NULL_TREE
, finish_decl_parsing (TREE_OPERAND (decl
, 0)));
4033 TREE_OPERAND (decl
, 0) = finish_decl_parsing (TREE_OPERAND (decl
, 0));
4036 push_nested_class (TREE_TYPE (TREE_OPERAND (decl
, 0)), 3);
4037 TREE_COMPLEXITY (decl
) = current_class_depth
;
4040 TREE_OPERAND (decl
, 0) = finish_decl_parsing (TREE_OPERAND (decl
, 0));
4043 /* For attribute handling. */
4044 TREE_VALUE (decl
) = finish_decl_parsing (TREE_VALUE (decl
));
4047 my_friendly_abort (5);
4053 check_cp_case_value (value
)
4056 if (value
== NULL_TREE
)
4059 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4060 STRIP_TYPE_NOPS (value
);
4062 if (TREE_READONLY_DECL_P (value
))
4064 value
= decl_constant_value (value
);
4065 STRIP_TYPE_NOPS (value
);
4067 value
= fold (value
);
4069 if (TREE_CODE (value
) != INTEGER_CST
4070 && value
!= error_mark_node
)
4072 cp_error ("case label `%E' does not reduce to an integer constant",
4074 value
= error_mark_node
;
4077 /* Promote char or short to int. */
4078 value
= default_conversion (value
);
4080 constant_expression_warning (value
);
4085 /* Return 1 if root encloses child. */
4088 is_namespace_ancestor (root
, child
)
4093 if (root
== global_namespace
)
4095 if (child
== global_namespace
)
4097 return is_namespace_ancestor (root
, CP_DECL_CONTEXT (child
));
4101 /* Return the namespace that is the common ancestor
4102 of two given namespaces. */
4105 namespace_ancestor (ns1
, ns2
)
4108 if (is_namespace_ancestor (ns1
, ns2
))
4110 return namespace_ancestor (CP_DECL_CONTEXT (ns1
), ns2
);
4113 /* Insert used into the using list of user. Set indirect_flag if this
4114 directive is not directly from the source. Also find the common
4115 ancestor and let our users know about the new namespace */
4117 add_using_namespace (user
, used
, indirect
)
4123 /* Using oneself is a no-op. */
4126 my_friendly_assert (TREE_CODE (user
) == NAMESPACE_DECL
, 380);
4127 my_friendly_assert (TREE_CODE (used
) == NAMESPACE_DECL
, 380);
4128 /* Check if we already have this. */
4129 t
= purpose_member (used
, DECL_NAMESPACE_USING (user
));
4133 /* Promote to direct usage. */
4134 TREE_INDIRECT_USING (t
) = 0;
4138 /* Add used to the user's using list. */
4139 DECL_NAMESPACE_USING (user
)
4140 = tree_cons (used
, namespace_ancestor (user
, used
),
4141 DECL_NAMESPACE_USING (user
));
4143 TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user
)) = indirect
;
4145 /* Add user to the used's users list. */
4146 DECL_NAMESPACE_USERS (used
)
4147 = tree_cons (user
, 0, DECL_NAMESPACE_USERS (used
));
4149 /* Recursively add all namespaces used. */
4150 for (t
= DECL_NAMESPACE_USING (used
); t
; t
= TREE_CHAIN (t
))
4151 /* indirect usage */
4152 add_using_namespace (user
, TREE_PURPOSE (t
), 1);
4154 /* Tell everyone using us about the new used namespaces. */
4155 for (t
= DECL_NAMESPACE_USERS (user
); t
; t
= TREE_CHAIN (t
))
4156 add_using_namespace (TREE_PURPOSE (t
), used
, 1);
4159 /* Combines two sets of overloaded functions into an OVERLOAD chain, removing
4160 duplicates. The first list becomes the tail of the result.
4162 The algorithm is O(n^2). We could get this down to O(n log n) by
4163 doing a sort on the addresses of the functions, if that becomes
4167 merge_functions (s1
, s2
)
4171 for (; s2
; s2
= OVL_NEXT (s2
))
4173 tree fn
= OVL_CURRENT (s2
);
4174 if (! ovl_member (fn
, s1
))
4175 s1
= build_overload (fn
, s1
);
4180 /* This should return an error not all definitions define functions.
4181 It is not an error if we find two functions with exactly the
4182 same signature, only if these are selected in overload resolution.
4183 old is the current set of bindings, new the freshly-found binding.
4184 XXX Do we want to give *all* candidates in case of ambiguity?
4185 XXX In what way should I treat extern declarations?
4186 XXX I don't want to repeat the entire duplicate_decls here */
4189 ambiguous_decl (name
, old
, new, flags
)
4196 my_friendly_assert (old
!= NULL_TREE
, 393);
4197 /* Copy the value. */
4198 val
= BINDING_VALUE (new);
4200 switch (TREE_CODE (val
))
4203 /* If we expect types or namespaces, and not templates,
4204 or this is not a template class. */
4205 if (LOOKUP_QUALIFIERS_ONLY (flags
)
4206 && !DECL_CLASS_TEMPLATE_P (val
))
4210 if (LOOKUP_NAMESPACES_ONLY (flags
))
4213 case NAMESPACE_DECL
:
4214 if (LOOKUP_TYPES_ONLY (flags
))
4218 if (LOOKUP_QUALIFIERS_ONLY (flags
))
4222 if (!BINDING_VALUE (old
))
4223 BINDING_VALUE (old
) = val
;
4224 else if (val
&& val
!= BINDING_VALUE (old
))
4226 if (is_overloaded_fn (BINDING_VALUE (old
))
4227 && is_overloaded_fn (val
))
4229 BINDING_VALUE (old
) = merge_functions (BINDING_VALUE (old
),
4234 /* Some declarations are functions, some are not. */
4235 if (flags
& LOOKUP_COMPLAIN
)
4237 /* If we've already given this error for this lookup,
4238 BINDING_VALUE (old) is error_mark_node, so let's not
4239 repeat ourselves. */
4240 if (BINDING_VALUE (old
) != error_mark_node
)
4242 cp_error ("use of `%D' is ambiguous", name
);
4243 cp_error_at (" first declared as `%#D' here",
4244 BINDING_VALUE (old
));
4246 cp_error_at (" also declared as `%#D' here", val
);
4248 return error_mark_node
;
4251 /* ... and copy the type. */
4252 type
= BINDING_TYPE (new);
4253 if (LOOKUP_NAMESPACES_ONLY (flags
))
4255 if (!BINDING_TYPE (old
))
4256 BINDING_TYPE (old
) = type
;
4257 else if (type
&& BINDING_TYPE (old
) != type
)
4259 if (flags
& LOOKUP_COMPLAIN
)
4261 cp_error ("`%D' denotes an ambiguous type",name
);
4262 cp_error_at (" first type here", BINDING_TYPE (old
));
4263 cp_error_at (" other type here", type
);
4269 /* Subroutine of unualified_namespace_lookup:
4270 Add the bindings of NAME in used namespaces to VAL.
4271 We are currently looking for names in namespace SCOPE, so we
4272 look through USINGS for using-directives of namespaces
4273 which have SCOPE as a common ancestor with the current scope.
4274 Returns zero on errors. */
4277 lookup_using_namespace (name
, val
, usings
, scope
, flags
, spacesp
)
4278 tree name
, val
, usings
, scope
;
4284 /* Iterate over all used namespaces in current, searching for using
4285 directives of scope. */
4286 for (iter
= usings
; iter
; iter
= TREE_CHAIN (iter
))
4287 if (TREE_VALUE (iter
) == scope
)
4290 *spacesp
= tree_cons (TREE_PURPOSE (iter
), NULL_TREE
,
4292 val1
= binding_for_name (name
, TREE_PURPOSE (iter
));
4293 /* Resolve ambiguities. */
4294 val
= ambiguous_decl (name
, val
, val1
, flags
);
4296 return val
!= error_mark_node
;
4300 Accepts the NAME to lookup and its qualifying SCOPE.
4301 Returns the name/type pair found into the CPLUS_BINDING RESULT,
4305 qualified_lookup_using_namespace (name
, scope
, result
, flags
)
4311 /* Maintain a list of namespaces visited... */
4312 tree seen
= NULL_TREE
;
4313 /* ... and a list of namespace yet to see. */
4314 tree todo
= NULL_TREE
;
4316 while (scope
&& (result
!= error_mark_node
))
4318 seen
= temp_tree_cons (scope
, NULL_TREE
, seen
);
4319 result
= ambiguous_decl (name
, result
,
4320 binding_for_name (name
, scope
), flags
);
4321 if (!BINDING_VALUE (result
) && !BINDING_TYPE (result
))
4322 /* Consider using directives. */
4323 for (usings
= DECL_NAMESPACE_USING (scope
); usings
;
4324 usings
= TREE_CHAIN (usings
))
4325 /* If this was a real directive, and we have not seen it. */
4326 if (!TREE_INDIRECT_USING (usings
)
4327 && !purpose_member (TREE_PURPOSE (usings
), seen
))
4328 todo
= temp_tree_cons (TREE_PURPOSE (usings
), NULL_TREE
, todo
);
4331 scope
= TREE_PURPOSE (todo
);
4332 todo
= TREE_CHAIN (todo
);
4335 scope
= NULL_TREE
; /* If there never was a todo list. */
4337 return result
!= error_mark_node
;
4340 /* [namespace.memdef]/2 */
4342 /* Set the context of a declaration to scope. Complain if we are not
4346 set_decl_namespace (decl
, scope
, friendp
)
4352 if (scope
== std_node
)
4353 scope
= global_namespace
;
4354 /* Get rid of namespace aliases. */
4355 scope
= ORIGINAL_NAMESPACE (scope
);
4357 /* It is ok for friends to be qualified in parallel space. */
4358 if (!friendp
&& !is_namespace_ancestor (current_namespace
, scope
))
4359 cp_error ("declaration of `%D' not in a namespace surrounding `%D'",
4361 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
4362 if (scope
!= current_namespace
)
4364 /* See whether this has been declared in the namespace. */
4365 old
= namespace_binding (DECL_NAME (decl
), scope
);
4367 /* No old declaration at all. */
4369 if (!is_overloaded_fn (decl
))
4370 /* Don't compare non-function decls with decls_match here,
4371 since it can't check for the correct constness at this
4372 point. pushdecl will find those errors later. */
4374 /* Since decl is a function, old should contain a function decl. */
4375 if (!is_overloaded_fn (old
))
4377 if (processing_template_decl
|| processing_specialization
)
4378 /* We have not yet called push_template_decl to turn the
4379 FUNCTION_DECL into a TEMPLATE_DECL, so the declarations
4380 won't match. But, we'll check later, when we construct the
4383 for (; old
; old
= OVL_NEXT (old
))
4384 if (decls_match (decl
, OVL_CURRENT (old
)))
4390 cp_error ("`%D' should have been declared inside `%D'",
4394 /* Compute the namespace where a declaration is defined. */
4397 decl_namespace (decl
)
4400 while (DECL_CONTEXT (decl
))
4402 decl
= DECL_CONTEXT (decl
);
4403 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
4405 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 't')
4406 decl
= TYPE_STUB_DECL (decl
);
4407 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd', 390);
4410 return global_namespace
;
4413 /* Return the namespace where the current declaration is declared. */
4416 current_decl_namespace ()
4419 /* If we have been pushed into a different namespace, use it. */
4420 if (decl_namespace_list
)
4421 return TREE_PURPOSE (decl_namespace_list
);
4423 if (current_class_type
)
4424 result
= decl_namespace (TYPE_STUB_DECL (current_class_type
));
4425 else if (current_function_decl
)
4426 result
= decl_namespace (current_function_decl
);
4428 result
= current_namespace
;
4432 /* Temporarily set the namespace for the current declaration. */
4435 push_decl_namespace (decl
)
4438 if (TREE_CODE (decl
) != NAMESPACE_DECL
)
4439 decl
= decl_namespace (decl
);
4440 decl_namespace_list
= tree_cons (decl
, NULL_TREE
, decl_namespace_list
);
4444 pop_decl_namespace ()
4446 decl_namespace_list
= TREE_CHAIN (decl_namespace_list
);
4449 /* Enter a class or namespace scope. */
4455 if (TREE_CODE (t
) == NAMESPACE_DECL
)
4456 push_decl_namespace (t
);
4461 /* Leave scope pushed by push_scope. */
4467 if (TREE_CODE (t
) == NAMESPACE_DECL
)
4468 pop_decl_namespace ();
4473 /* [basic.lookup.koenig] */
4474 /* A non-zero return value in the functions below indicates an error.
4475 All nodes allocated in the procedure are on the scratch obstack. */
4485 static int arg_assoc
PROTO((struct arg_lookup
*, tree
));
4486 static int arg_assoc_args
PROTO((struct arg_lookup
*, tree
));
4487 static int arg_assoc_type
PROTO((struct arg_lookup
*, tree
));
4488 static int add_function
PROTO((struct arg_lookup
*, tree
));
4489 static int arg_assoc_namespace
PROTO((struct arg_lookup
*, tree
));
4490 static int arg_assoc_class
PROTO((struct arg_lookup
*, tree
));
4491 static int arg_assoc_template_arg
PROTO((struct arg_lookup
*, tree
));
4493 /* Add a function to the lookup structure.
4494 Returns 1 on error. */
4497 add_function (k
, fn
)
4498 struct arg_lookup
*k
;
4501 /* We used to check here to see if the function was already in the list,
4502 but that's O(n^2), which is just too expensive for function lookup.
4503 Now we deal with the occasional duplicate in joust. In doing this, we
4504 assume that the number of duplicates will be small compared to the
4505 total number of functions being compared, which should usually be the
4508 /* We must find only functions, or exactly one non-function. */
4509 if (k
->functions
&& is_overloaded_fn (k
->functions
)
4510 && is_overloaded_fn (fn
))
4511 k
->functions
= build_overload (fn
, k
->functions
);
4512 else if (k
->functions
)
4514 tree f1
= OVL_CURRENT (k
->functions
);
4516 if (is_overloaded_fn (f1
))
4518 fn
= f1
; f1
= f2
; f2
= fn
;
4520 cp_error_at ("`%D' is not a function,", f1
);
4521 cp_error_at (" conflict with `%D'", f2
);
4522 cp_error (" in call to `%D'", k
->name
);
4530 /* Add functions of a namespace to the lookup structure.
4531 Returns 1 on error. */
4534 arg_assoc_namespace (k
, scope
)
4535 struct arg_lookup
*k
;
4540 if (purpose_member (scope
, k
->namespaces
))
4542 k
->namespaces
= tree_cons (scope
, NULL_TREE
, k
->namespaces
);
4544 value
= namespace_binding (k
->name
, scope
);
4548 for (; value
; value
= OVL_NEXT (value
))
4549 if (add_function (k
, OVL_CURRENT (value
)))
4555 /* Adds everything associated with a template argument to the lookup
4556 structure. Returns 1 on error. */
4559 arg_assoc_template_arg (k
, arg
)
4560 struct arg_lookup
* k
;
4563 /* [basic.lookup.koenig]
4565 If T is a template-id, its associated namespaces and classes are
4566 ... the namespaces and classes associated with the types of the
4567 template arguments provided for template type parameters
4568 (excluding template template parameters); the namespaces in which
4569 any template template arguments are defined; and the classes in
4570 which any member templates used as template template arguments
4571 are defined. [Note: non-type template arguments do not
4572 contribute to the set of associated namespaces. ] */
4574 /* Consider first template template arguments. */
4575 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
4577 tree ctx
= CP_DECL_CONTEXT (arg
);
4579 /* It's not a member template. */
4580 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
4581 return arg_assoc_namespace (k
, ctx
);
4582 /* Otherwise, it must be member template. */
4584 return arg_assoc_class (k
, ctx
);
4586 /* It's not a template template argument, but it is a type template
4588 else if (TREE_CODE_CLASS (TREE_CODE (arg
)) == 't')
4589 return arg_assoc_type (k
, arg
);
4590 /* It's a non-type template argument. */
4595 /* Adds everything associated with class to the lookup structure.
4596 Returns 1 on error. */
4599 arg_assoc_class (k
, type
)
4600 struct arg_lookup
* k
;
4603 tree list
, friends
, context
;
4606 /* Backend build structures, such as __builtin_va_list, aren't
4607 affected by all this. */
4608 if (!CLASS_TYPE_P (type
))
4611 if (purpose_member (type
, k
->classes
))
4613 k
->classes
= tree_cons (type
, NULL_TREE
, k
->classes
);
4615 context
= decl_namespace (TYPE_MAIN_DECL (type
));
4616 if (arg_assoc_namespace (k
, context
))
4619 /* Process baseclasses. */
4620 for (i
= 0; i
< CLASSTYPE_N_BASECLASSES (type
); i
++)
4621 if (arg_assoc_class (k
, TYPE_BINFO_BASETYPE (type
, i
)))
4624 /* Process friends. */
4625 for (list
= DECL_FRIENDLIST (TYPE_MAIN_DECL (type
)); list
;
4626 list
= TREE_CHAIN (list
))
4627 if (k
->name
== TREE_PURPOSE (list
))
4628 for (friends
= TREE_VALUE (list
); friends
;
4629 friends
= TREE_CHAIN (friends
))
4630 /* Only interested in global functions with potentially hidden
4631 (i.e. unqualified) declarations. */
4632 if (TREE_PURPOSE (list
) == error_mark_node
&& TREE_VALUE (list
)
4633 && decl_namespace (TREE_VALUE (list
)) == context
)
4634 if (add_function (k
, TREE_VALUE (list
)))
4637 /* Process template arguments. */
4638 if (CLASSTYPE_TEMPLATE_INFO (type
))
4640 list
= innermost_args (CLASSTYPE_TI_ARGS (type
));
4641 for (i
= 0; i
< TREE_VEC_LENGTH (list
); ++i
)
4642 arg_assoc_template_arg (k
, TREE_VEC_ELT (list
, i
));
4648 /* Adds everything associated with a given type.
4649 Returns 1 on error. */
4652 arg_assoc_type (k
, type
)
4653 struct arg_lookup
*k
;
4656 switch (TREE_CODE (type
))
4666 if (TYPE_PTRMEMFUNC_P (type
))
4667 return arg_assoc_type (k
, TYPE_PTRMEMFUNC_FN_TYPE (type
));
4668 return arg_assoc_class (k
, type
);
4670 case REFERENCE_TYPE
:
4672 return arg_assoc_type (k
, TREE_TYPE (type
));
4675 return arg_assoc_namespace (k
, decl_namespace (TYPE_MAIN_DECL (type
)));
4677 /* Pointer to member: associate class type and value type. */
4678 if (arg_assoc_type (k
, TYPE_OFFSET_BASETYPE (type
)))
4680 return arg_assoc_type (k
, TREE_TYPE (type
));
4682 /* The basetype is referenced in the first arg type, so just
4685 /* Associate the parameter types. */
4686 if (arg_assoc_args (k
, TYPE_ARG_TYPES (type
)))
4688 /* Associate the return type. */
4689 return arg_assoc_type (k
, TREE_TYPE (type
));
4690 case TEMPLATE_TYPE_PARM
:
4691 case TEMPLATE_TEMPLATE_PARM
:
4694 if (type
== unknown_type_node
)
4696 /* else fall through */
4698 my_friendly_abort (390);
4703 /* Adds everything associated with arguments. Returns 1 on error. */
4706 arg_assoc_args (k
, args
)
4707 struct arg_lookup
* k
;
4710 for (; args
; args
= TREE_CHAIN (args
))
4711 if (arg_assoc (k
, TREE_VALUE (args
)))
4716 /* Adds everything associated with a given tree_node. Returns 1 on error. */
4720 struct arg_lookup
* k
;
4723 if (n
== error_mark_node
)
4726 if (TREE_CODE_CLASS (TREE_CODE (n
)) == 't')
4727 return arg_assoc_type (k
, n
);
4729 if (! type_unknown_p (n
))
4730 return arg_assoc_type (k
, TREE_TYPE (n
));
4732 if (TREE_CODE (n
) == ADDR_EXPR
)
4733 n
= TREE_OPERAND (n
, 0);
4734 if (TREE_CODE (n
) == COMPONENT_REF
)
4735 n
= TREE_OPERAND (n
, 1);
4736 if (TREE_CODE (n
) == OFFSET_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... */
4750 tree
template = TREE_OPERAND (n
, 0);
4751 tree args
= TREE_OPERAND (n
, 1);
4755 /* First, the template. There may actually be more than one if
4756 this is an overloaded function template. But, in that case,
4757 we only need the first; all the functions will be in the same
4759 template = OVL_CURRENT (template);
4761 ctx
= CP_DECL_CONTEXT (template);
4763 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
4765 if (arg_assoc_namespace (k
, ctx
) == 1)
4768 /* It must be a member template. */
4769 else if (arg_assoc_class (k
, ctx
) == 1)
4772 /* Now the arguments. */
4773 for (arg
= args
; arg
!= NULL_TREE
; arg
= TREE_CHAIN (arg
))
4774 if (arg_assoc_template_arg (k
, TREE_VALUE (arg
)) == 1)
4779 my_friendly_assert (TREE_CODE (n
) == OVERLOAD
, 980715);
4781 for (; n
; n
= OVL_CHAIN (n
))
4782 if (arg_assoc_type (k
, TREE_TYPE (OVL_FUNCTION (n
))))
4789 /* Performs Koenig lookup depending on arguments, where fns
4790 are the functions found in normal lookup. */
4793 lookup_arg_dependent (name
, fns
, args
)
4798 struct arg_lookup k
;
4802 k
.classes
= NULL_TREE
;
4804 /* Note that we've already looked at some namespaces during normal
4805 unqualified lookup, unless we found a decl in function scope. */
4806 if (fns
&& ! TREE_PERMANENT (OVL_CURRENT (fns
)))
4807 k
.namespaces
= NULL_TREE
;
4809 unqualified_namespace_lookup (name
, 0, &k
.namespaces
);
4811 push_scratch_obstack ();
4812 arg_assoc_args (&k
, args
);
4817 /* Process a namespace-alias declaration. */
4820 do_namespace_alias (alias
, namespace)
4821 tree alias
, namespace;
4823 if (TREE_CODE (namespace) != NAMESPACE_DECL
)
4825 /* The parser did not find it, so it's not there. */
4826 cp_error ("unknown namespace `%D'", namespace);
4830 namespace = ORIGINAL_NAMESPACE (namespace);
4832 /* Build the alias. */
4833 alias
= build_lang_decl (NAMESPACE_DECL
, alias
, void_type_node
);
4834 DECL_NAMESPACE_ALIAS (alias
) = namespace;
4838 /* Check a non-member using-declaration. Return the name and scope
4839 being used, and the USING_DECL, or NULL_TREE on failure. */
4842 validate_nonmember_using_decl (decl
, scope
, name
)
4847 if (TREE_CODE (decl
) == SCOPE_REF
4848 && TREE_OPERAND (decl
, 0) == std_node
)
4850 if (namespace_bindings_p ()
4851 && current_namespace
== global_namespace
)
4852 /* There's no need for a using declaration at all, here,
4853 since `std' is the same as `::'. We can't just pass this
4854 on because we'll complain later about declaring something
4855 in the same scope as a using declaration with the same
4856 name. We return NULL_TREE which indicates to the caller
4857 that there's no need to do any further processing. */
4860 *scope
= global_namespace
;
4861 *name
= TREE_OPERAND (decl
, 1);
4863 else if (TREE_CODE (decl
) == SCOPE_REF
)
4865 *scope
= TREE_OPERAND (decl
, 0);
4866 *name
= TREE_OPERAND (decl
, 1);
4868 /* [namespace.udecl]
4870 A using-declaration for a class member shall be a
4871 member-declaration. */
4872 if (TREE_CODE (*scope
) != NAMESPACE_DECL
)
4874 if (TYPE_P (*scope
))
4875 cp_error ("`%T' is not a namespace", *scope
);
4877 cp_error ("`%D' is not a namespace", *scope
);
4881 else if (TREE_CODE (decl
) == IDENTIFIER_NODE
4882 || TREE_CODE (decl
) == TYPE_DECL
4883 || TREE_CODE (decl
) == TEMPLATE_DECL
)
4885 *scope
= global_namespace
;
4889 my_friendly_abort (382);
4890 if (TREE_CODE_CLASS (TREE_CODE (*name
)) == 'd')
4891 *name
= DECL_NAME (*name
);
4892 /* Make a USING_DECL. */
4893 return push_using_decl (*scope
, *name
);
4896 /* Process local and global using-declarations. */
4899 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, newval
, newtype
)
4901 tree oldval
, oldtype
;
4902 tree
*newval
, *newtype
;
4906 *newval
= *newtype
= NULL_TREE
;
4907 decls
= make_node (CPLUS_BINDING
);
4908 if (!qualified_lookup_using_namespace (name
, scope
, decls
, 0))
4912 if (!BINDING_VALUE (decls
) && !BINDING_TYPE (decls
))
4914 cp_error ("`%D' not declared", name
);
4918 /* Check for using functions. */
4919 if (BINDING_VALUE (decls
) && is_overloaded_fn (BINDING_VALUE (decls
)))
4923 if (oldval
&& !is_overloaded_fn (oldval
))
4925 duplicate_decls (OVL_CURRENT (BINDING_VALUE (decls
)), oldval
);
4930 for (tmp
= BINDING_VALUE (decls
); tmp
; tmp
= OVL_NEXT (tmp
))
4932 tree new_fn
= OVL_CURRENT (tmp
);
4934 /* [namespace.udecl]
4936 If a function declaration in namespace scope or block
4937 scope has the same name and the same parameter types as a
4938 function introduced by a using declaration the program is
4940 for (tmp1
= oldval
; tmp1
; tmp1
= OVL_NEXT (tmp1
))
4942 tree old_fn
= OVL_CURRENT (tmp1
);
4944 if (!OVL_USED (tmp1
)
4945 && compparms (TYPE_ARG_TYPES (TREE_TYPE (new_fn
)),
4946 TYPE_ARG_TYPES (TREE_TYPE (old_fn
))))
4948 /* There was already a non-using declaration in
4949 this scope with the same parameter types. */
4950 cp_error ("`%D' is already declared in this scope",
4954 else if (duplicate_decls (new_fn
, old_fn
))
4955 /* We're re-using something we already used
4956 before. We don't need to add it again. */
4960 /* If we broke out of the loop, there's no reason to add
4961 this function to the using declarations for this
4966 *newval
= build_overload (OVL_CURRENT (tmp
), *newval
);
4967 if (TREE_CODE (*newval
) != OVERLOAD
)
4968 *newval
= ovl_cons (*newval
, NULL_TREE
);
4969 OVL_USED (*newval
) = 1;
4974 *newval
= BINDING_VALUE (decls
);
4976 duplicate_decls (*newval
, oldval
);
4979 *newtype
= BINDING_TYPE (decls
);
4980 if (oldtype
&& *newtype
&& oldtype
!= *newtype
)
4982 cp_error ("using directive `%D' introduced ambiguous type `%T'",
4988 /* Process a using-declaration not appearing in class or local scope. */
4991 do_toplevel_using_decl (decl
)
4994 tree scope
, name
, binding
;
4995 tree oldval
, oldtype
, newval
, newtype
;
4997 decl
= validate_nonmember_using_decl (decl
, &scope
, &name
);
4998 if (decl
== NULL_TREE
)
5001 binding
= binding_for_name (name
, current_namespace
);
5003 oldval
= BINDING_VALUE (binding
);
5004 oldtype
= BINDING_TYPE (binding
);
5006 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
5008 /* Copy declarations found. */
5010 BINDING_VALUE (binding
) = newval
;
5012 BINDING_TYPE (binding
) = newtype
;
5016 /* Process a using-declaration at function scope. */
5019 do_local_using_decl (decl
)
5023 tree oldval
, oldtype
, newval
, newtype
;
5025 decl
= validate_nonmember_using_decl (decl
, &scope
, &name
);
5026 if (decl
== NULL_TREE
)
5029 oldval
= lookup_name_current_level (name
);
5030 oldtype
= lookup_type_current_level (name
);
5032 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
5036 if (is_overloaded_fn (newval
))
5040 /* We only need to push declarations for those functions
5041 that were not already bound in the current level.
5042 The old value might be NULL_TREE, it might be a single
5043 function, or an OVERLOAD. */
5044 if (oldval
&& TREE_CODE (oldval
) == OVERLOAD
)
5045 term
= OVL_FUNCTION (oldval
);
5048 for (fn
= newval
; fn
&& OVL_CURRENT (fn
) != term
;
5050 push_overloaded_decl (OVL_CURRENT (fn
),
5051 PUSH_LOCAL
| PUSH_USING
);
5054 push_local_binding (name
, newval
, PUSH_USING
);
5057 set_identifier_type_value (name
, newtype
);
5061 do_class_using_decl (decl
)
5066 if (TREE_CODE (decl
) != SCOPE_REF
5067 || TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (decl
, 0))) != 't')
5069 cp_error ("using-declaration for non-member at class scope");
5072 name
= TREE_OPERAND (decl
, 1);
5073 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
5075 cp_error ("using-declaration for destructor");
5078 if (TREE_CODE (name
) == TYPE_DECL
)
5079 name
= DECL_NAME (name
);
5081 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 980716);
5083 value
= build_lang_decl (USING_DECL
, name
, void_type_node
);
5084 DECL_INITIAL (value
) = TREE_OPERAND (decl
, 0);
5088 /* Process a using-directive. */
5091 do_using_directive (namespace)
5094 if (namespace == std_node
)
5096 /* using namespace A::B::C; */
5097 if (TREE_CODE (namespace) == SCOPE_REF
)
5098 namespace = TREE_OPERAND (namespace, 1);
5099 if (TREE_CODE (namespace) == IDENTIFIER_NODE
)
5101 /* Lookup in lexer did not find a namespace. */
5102 cp_error ("namespace `%T' undeclared", namespace);
5105 if (TREE_CODE (namespace) != NAMESPACE_DECL
)
5107 cp_error ("`%T' is not a namespace", namespace);
5110 namespace = ORIGINAL_NAMESPACE (namespace);
5111 if (!toplevel_bindings_p ())
5112 push_using_directive (namespace);
5115 add_using_namespace (current_namespace
, namespace, 0);
5119 check_default_args (x
)
5122 tree arg
= TYPE_ARG_TYPES (TREE_TYPE (x
));
5123 int saw_def
= 0, i
= 0 - (TREE_CODE (TREE_TYPE (x
)) == METHOD_TYPE
);
5124 for (; arg
&& arg
!= void_list_node
; arg
= TREE_CHAIN (arg
), ++i
)
5126 if (TREE_PURPOSE (arg
))
5130 cp_error_at ("default argument missing for parameter %P of `%+#D'",
5141 TREE_USED (decl
) = 1;
5142 if (processing_template_decl
)
5144 assemble_external (decl
);
5146 /* Is it a synthesized method that needs to be synthesized? */
5147 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_CLASS_CONTEXT (decl
)
5148 && DECL_ARTIFICIAL (decl
) && ! DECL_INITIAL (decl
)
5149 /* Kludge: don't synthesize for default args. */
5150 && current_function_decl
)
5151 synthesize_method (decl
);
5153 /* If this is a function or variable that is an instance of some
5154 template, we now know that we will need to actually do the
5155 instantiation. A TEMPLATE_DECL may also have DECL_TEMPLATE_INFO,
5156 if it's a partial instantiation, but there's no need to
5157 instantiate such a thing. We check that DECL is not an explicit
5158 instantiation because that is not checked in instantiate_decl. */
5159 if (TREE_CODE (decl
) != TEMPLATE_DECL
5160 && DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
5161 && !DECL_EXPLICIT_INSTANTIATION (decl
))
5162 instantiate_decl (decl
);
5165 /* Helper function for named_class_head_sans_basetype nonterminal. We
5166 have just seen something of the form `AGGR SCOPE::ID'. Return a
5167 TYPE_DECL for the type declared by ID in SCOPE. */
5170 handle_class_head (aggr
, scope
, id
)
5171 tree aggr
, scope
, id
;
5175 if (TREE_CODE (id
) == TYPE_DECL
)
5177 else if (DECL_CLASS_TEMPLATE_P (id
))
5178 decl
= DECL_TEMPLATE_RESULT (id
);
5181 tree current
= current_scope();
5183 if (current
== NULL_TREE
)
5184 current
= current_namespace
;
5185 if (scope
== std_node
)
5186 scope
= global_namespace
;
5187 if (scope
== NULL_TREE
)
5188 scope
= global_namespace
;
5189 if (scope
== current
)
5191 /* We've been given AGGR SCOPE::ID, when we're already inside SCOPE.
5192 Be nice about it. */
5194 cp_pedwarn ("extra qualification `%T::' on member `%D' ignored",
5195 FROB_CONTEXT (scope
), id
);
5197 else if (scope
!= global_namespace
)
5198 cp_error ("`%T' does not have a nested type named `%D'", scope
, id
);
5200 cp_error ("no file-scope type named `%D'", id
);
5202 /* Inject it at the current scope. */
5203 decl
= TYPE_MAIN_DECL (xref_tag (aggr
, id
, 1));
5206 /* Enter the SCOPE. If this turns out not to be a definition, the
5207 parser must leave the scope. */
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
);
5221 /* Initialize decl2.c. */
5226 ggc_add_tree_root (&decl_namespace_list
, 1);
5227 ggc_add_tree_varray_root (&saved_inlines
, 1);
5228 ggc_add_tree_varray_root (&pending_statics
, 1);
5229 ggc_add_tree_varray_root (&ssdf_decls
, 1);
5230 ggc_add_tree_root (&ssdf_decl
, 1);
5231 ggc_add_tree_root (&priority_decl
, 1);
5232 ggc_add_tree_root (&initialize_p_decl
, 1);
5233 ggc_add_tree_root (&pending_vtables
, 1);