1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
3 1999, 2000, 2001, 2002 Free Software Foundation, Inc.
4 Hacked by Michael Tiemann (tiemann@cygnus.com)
6 This file is part of GNU CC.
8 GNU CC is free software; you can redistribute it and/or modify
9 it under the terms of the GNU General Public License as published by
10 the Free Software Foundation; either version 2, or (at your option)
13 GNU CC is distributed in the hope that it will be useful,
14 but WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 GNU General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with GNU CC; see the file COPYING. If not, write to
20 the Free Software Foundation, 59 Temple Place - Suite 330,
21 Boston, MA 02111-1307, USA. */
24 /* Process declarations and symbol lookup for C front end.
25 Also constructs types; the standard scalar types at initialization,
26 and structure, union, array and enum types when they are declared. */
28 /* ??? not all decl nodes are given the most useful possible
29 line numbers. For example, the CONST_DECLs for enum values. */
48 extern cpp_reader
*parse_in
;
50 /* This structure contains information about the initializations
51 and/or destructions required for a particular priority level. */
52 typedef struct priority_info_s
{
53 /* Non-zero if there have been any initializations at this priority
54 throughout the translation unit. */
55 int initializations_p
;
56 /* Non-zero if there have been any destructions at this priority
57 throughout the translation unit. */
61 static void mark_vtable_entries
PARAMS ((tree
));
62 static void grok_function_init
PARAMS ((tree
, tree
));
63 static int finish_vtable_vardecl
PARAMS ((tree
*, void *));
64 static int prune_vtable_vardecl
PARAMS ((tree
*, void *));
65 static int is_namespace_ancestor
PARAMS ((tree
, tree
));
66 static void add_using_namespace
PARAMS ((tree
, tree
, int));
67 static tree ambiguous_decl
PARAMS ((tree
, tree
, tree
,int));
68 static tree build_anon_union_vars
PARAMS ((tree
, tree
*, int, int));
69 static int acceptable_java_type
PARAMS ((tree
));
70 static void output_vtable_inherit
PARAMS ((tree
));
71 static tree start_objects
PARAMS ((int, int));
72 static void finish_objects
PARAMS ((int, int, tree
));
73 static tree merge_functions
PARAMS ((tree
, tree
));
74 static tree decl_namespace
PARAMS ((tree
));
75 static tree validate_nonmember_using_decl
PARAMS ((tree
, tree
*, tree
*));
76 static void do_nonmember_using_decl
PARAMS ((tree
, tree
, tree
, tree
,
78 static tree start_static_storage_duration_function
PARAMS ((void));
79 static void finish_static_storage_duration_function
PARAMS ((tree
));
80 static priority_info get_priority_info
PARAMS ((int));
81 static void do_static_initialization
PARAMS ((tree
, tree
));
82 static void do_static_destruction
PARAMS ((tree
));
83 static tree start_static_initialization_or_destruction
PARAMS ((tree
, int));
84 static void finish_static_initialization_or_destruction
PARAMS ((tree
));
85 static void generate_ctor_or_dtor_function
PARAMS ((int, int));
86 static int generate_ctor_and_dtor_functions_for_priority
87 PARAMS ((splay_tree_node
, void *));
88 static tree prune_vars_needing_no_initialization
PARAMS ((tree
));
89 static void write_out_vars
PARAMS ((tree
));
90 static void import_export_class
PARAMS ((tree
));
91 static tree key_method
PARAMS ((tree
));
92 static int compare_options
PARAMS ((const PTR
, const PTR
));
93 static tree get_guard_bits
PARAMS ((tree
));
95 /* A list of static class variables. This is needed, because a
96 static class variable can be declared inside the class without
97 an initializer, and then initialized, statically, outside the class. */
98 static varray_type pending_statics
;
99 #define pending_statics_used \
100 (pending_statics ? pending_statics->elements_used : 0)
102 /* A list of functions which were declared inline, but which we
103 may need to emit outline anyway. */
104 static varray_type deferred_fns
;
105 #define deferred_fns_used \
106 (deferred_fns ? deferred_fns->elements_used : 0)
108 /* Flag used when debugging spew.c */
110 extern int spew_debug
;
112 /* Nonzero if we're done parsing and into end-of-file activities. */
116 /* Functions called along with real static constructors and destructors. */
121 /* The :: namespace. */
123 tree global_namespace
;
125 /* C (and C++) language-specific option variables. */
127 /* Nonzero means don't recognize the keyword `asm'. */
131 /* Nonzero means don't recognize any extension keywords. */
133 int flag_no_gnu_keywords
;
135 /* Nonzero means to treat bitfields as unsigned unless they say `signed'. */
137 int flag_signed_bitfields
= 1;
139 /* Nonzero means do emit exported implementations of functions even if
140 they can be inlined. */
142 int flag_implement_inlines
= 1;
144 /* Nonzero means do emit exported implementations of templates, instead of
145 multiple static copies in each file that needs a definition. */
147 int flag_external_templates
;
149 /* Nonzero means that the decision to emit or not emit the implementation of a
150 template depends on where the template is instantiated, rather than where
153 int flag_alt_external_templates
;
155 /* Nonzero means that implicit instantiations will be emitted if needed. */
157 int flag_implicit_templates
= 1;
159 /* Nonzero means that implicit instantiations of inline templates will be
160 emitted if needed, even if instantiations of non-inline templates
163 int flag_implicit_inline_templates
= 1;
165 /* Nonzero means warn about implicit declarations. */
167 int warn_implicit
= 1;
169 /* Nonzero means warn about usage of long long when `-pedantic'. */
171 int warn_long_long
= 1;
173 /* Nonzero means warn when all ctors or dtors are private, and the class
176 int warn_ctor_dtor_privacy
= 1;
178 /* Nonzero means generate separate instantiation control files and juggle
179 them at link time. */
181 int flag_use_repository
;
183 /* Nonzero if we want to issue diagnostics that the standard says are not
186 int flag_optional_diags
= 1;
188 /* Nonzero means give string constants the type `const char *', as mandated
191 int flag_const_strings
= 1;
193 /* Nonzero means warn about deprecated conversion from string constant to
196 int warn_write_strings
;
198 /* Nonzero means warn about pointer casts that can drop a type qualifier
199 from the pointer target type. */
203 /* Nonzero means warn about sizeof(function) or addition/subtraction
204 of function pointers. */
206 int warn_pointer_arith
= 1;
208 /* Nonzero means warn for any function def without prototype decl. */
210 int warn_missing_prototypes
;
212 /* Nonzero means warn about multiple (redundant) decls for the same single
213 variable or function. */
215 int warn_redundant_decls
;
217 /* Warn if initializer is not completely bracketed. */
219 int warn_missing_braces
;
221 /* Warn about comparison of signed and unsigned values. */
223 int warn_sign_compare
;
225 /* Warn about testing equality of floating point numbers. */
227 int warn_float_equal
= 0;
229 /* Warn about functions which might be candidates for format attributes. */
231 int warn_missing_format_attribute
;
233 /* Warn about a subscript that has type char. */
235 int warn_char_subscripts
;
237 /* Warn if a type conversion is done that might have confusing results. */
241 /* Warn if adding () is suggested. */
243 int warn_parentheses
;
245 /* Non-zero means warn in function declared in derived class has the
246 same name as a virtual in the base class, but fails to match the
247 type signature of any virtual function in the base class. */
249 int warn_overloaded_virtual
;
251 /* Non-zero means warn when declaring a class that has a non virtual
252 destructor, when it really ought to have a virtual one. */
256 /* Non-zero means warn when the compiler will reorder code. */
260 /* Non-zero means warn when synthesis behavior differs from Cfront's. */
264 /* Non-zero means warn when we convert a pointer to member function
265 into a pointer to (void or function). */
267 int warn_pmf2ptr
= 1;
269 /* Nonzero means warn about violation of some Effective C++ style rules. */
273 /* Nonzero means warn where overload resolution chooses a promotion from
274 unsigned to signed over a conversion to an unsigned of the same size. */
278 /* Nonzero means warn when an old-style cast is used. */
280 int warn_old_style_cast
;
282 /* Warn about #pragma directives that are not recognised. */
284 int warn_unknown_pragmas
; /* Tri state variable. */
286 /* Nonzero means warn when non-templatized friend functions are
287 declared within a template */
289 int warn_nontemplate_friend
= 1;
291 /* Nonzero means complain about deprecated features. */
293 int warn_deprecated
= 1;
295 /* Nonzero means `$' can be in an identifier. */
297 #ifndef DOLLARS_IN_IDENTIFIERS
298 #define DOLLARS_IN_IDENTIFIERS 1
300 int dollars_in_ident
= DOLLARS_IN_IDENTIFIERS
;
302 /* Nonzero means allow Microsoft extensions without a pedwarn. */
304 int flag_ms_extensions
;
306 /* C++ specific flags. */
308 /* Nonzero means we should attempt to elide constructors when possible. */
310 int flag_elide_constructors
= 1;
312 /* Nonzero means that member functions defined in class scope are
313 inline by default. */
315 int flag_default_inline
= 1;
317 /* Controls whether compiler generates 'type descriptor' that give
318 run-time type information. */
322 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
325 int flag_huge_objects
;
327 /* Nonzero if we want to conserve space in the .o files. We do this
328 by putting uninitialized data and runtime initialized data into
329 .common instead of .data at the expense of not flagging multiple
332 int flag_conserve_space
;
334 /* Nonzero if we want to obey access control semantics. */
336 int flag_access_control
= 1;
338 /* Nonzero if we want to understand the operator names, i.e. 'bitand'. */
340 int flag_operator_names
= 1;
342 /* Nonzero if we want to check the return value of new and avoid calling
343 constructors if it is a null pointer. */
347 /* Nonzero if we want the new ISO rules for pushing a new scope for `for'
348 initialization variables.
349 0: Old rules, set by -fno-for-scope.
350 2: New ISO rules, set by -ffor-scope.
351 1: Try to implement new ISO rules, but with backup compatibility
352 (and warnings). This is the default, for now. */
354 int flag_new_for_scope
= 1;
356 /* Nonzero if we want to emit defined symbols with common-like linkage as
357 weak symbols where possible, in order to conform to C++ semantics.
358 Otherwise, emit them as local symbols. */
362 /* Nonzero to use __cxa_atexit, rather than atexit, to register
363 destructors for local statics and global objects. */
365 int flag_use_cxa_atexit
;
367 /* Maximum template instantiation depth. This limit is rather
368 arbitrary, but it exists to limit the time it takes to notice
369 infinite template instantiations. */
371 int max_tinst_depth
= 500;
373 /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */
377 /* Nonzero means make the default pedwarns warnings instead of errors.
378 The value of this flag is ignored if -pedantic is specified. */
382 /* Nonzero means to implement standard semantics for exception
383 specifications, calling unexpected if an exception is thrown that
384 doesn't match the specification. Zero means to treat them as
385 assertions and optimize accordingly, but not check them. */
387 int flag_enforce_eh_specs
= 1;
389 /* Table of language-dependent -f options.
390 STRING is the option name. VARIABLE is the address of the variable.
391 ON_VALUE is the value to store in VARIABLE
392 if `-fSTRING' is seen as an option.
393 (If `-fno-STRING' is seen as an option, the opposite value is stored.) */
395 static const struct { const char *const string
; int *const variable
; const int on_value
;}
399 {"signed-char", &flag_signed_char
, 1},
400 {"unsigned-char", &flag_signed_char
, 0},
401 {"signed-bitfields", &flag_signed_bitfields
, 1},
402 {"unsigned-bitfields", &flag_signed_bitfields
, 0},
403 {"short-enums", &flag_short_enums
, 1},
404 {"short-double", &flag_short_double
, 1},
405 {"short-wchar", &flag_short_wchar
, 1},
406 {"asm", &flag_no_asm
, 0},
407 {"builtin", &flag_no_builtin
, 0},
409 /* C++-only options. */
410 {"access-control", &flag_access_control
, 1},
411 {"check-new", &flag_check_new
, 1},
412 {"conserve-space", &flag_conserve_space
, 1},
413 {"const-strings", &flag_const_strings
, 1},
414 {"default-inline", &flag_default_inline
, 1},
415 {"dollars-in-identifiers", &dollars_in_ident
, 1},
416 {"elide-constructors", &flag_elide_constructors
, 1},
417 {"enforce-eh-specs", &flag_enforce_eh_specs
, 1},
418 {"external-templates", &flag_external_templates
, 1},
419 {"for-scope", &flag_new_for_scope
, 2},
420 {"gnu-keywords", &flag_no_gnu_keywords
, 0},
421 {"handle-exceptions", &flag_exceptions
, 1},
422 {"implement-inlines", &flag_implement_inlines
, 1},
423 {"implicit-inline-templates", &flag_implicit_inline_templates
, 1},
424 {"implicit-templates", &flag_implicit_templates
, 1},
425 {"ms-extensions", &flag_ms_extensions
, 1},
426 {"nonansi-builtins", &flag_no_nonansi_builtin
, 0},
427 {"operator-names", &flag_operator_names
, 1},
428 {"optional-diags", &flag_optional_diags
, 1},
429 {"permissive", &flag_permissive
, 1},
430 {"repo", &flag_use_repository
, 1},
431 {"rtti", &flag_rtti
, 1},
432 {"stats", &flag_detailed_statistics
, 1},
433 {"vtable-gc", &flag_vtable_gc
, 1},
434 {"use-cxa-atexit", &flag_use_cxa_atexit
, 1},
435 {"weak", &flag_weak
, 1}
438 /* The list of `-f' options that we no longer support. The `-f'
439 prefix is not given in this table. The `-fno-' variants are not
440 listed here. This table must be kept in alphabetical order. */
441 static const char * const unsupported_options
[] = {
458 /* Compare two option strings, pointed two by P1 and P2, for use with
462 compare_options (p1
, p2
)
466 return strcmp (*((const char *const *) p1
), *((const char *const *) p2
));
469 /* Decode the string P as a language-specific option.
470 Return the number of strings consumed for a valid option.
471 Otherwise return 0. Should not complain if it does not
472 recognise the option. */
475 cxx_decode_option (argc
, argv
)
479 int strings_processed
;
480 const char *p
= argv
[0];
482 strings_processed
= cpp_handle_option (parse_in
, argc
, argv
, 0);
484 if (p
[0] == '-' && p
[1] == 'f')
486 /* Some kind of -f option.
487 P's value is the option sans `-f'.
488 Search for it in the table of options. */
489 const char *option_value
= NULL
;
490 const char *positive_option
;
494 /* Try special -f options. */
496 /* See if this is one of the options no longer supported. We
497 used to support these options, so we continue to accept them,
499 if (strncmp (p
, "no-", strlen ("no-")) == 0)
500 positive_option
= p
+ strlen ("no-");
504 /* If the option is present, issue a warning. Indicate to our
505 caller that the option was processed successfully. */
506 if (bsearch (&positive_option
,
508 ARRAY_SIZE (unsupported_options
),
509 sizeof (unsupported_options
[0]),
512 warning ("-f%s is no longer supported", p
);
516 if (!strcmp (p
, "handle-exceptions")
517 || !strcmp (p
, "no-handle-exceptions"))
518 warning ("-fhandle-exceptions has been renamed to -fexceptions (and is now on by default)");
519 else if (! strcmp (p
, "alt-external-templates"))
521 flag_external_templates
= 1;
522 flag_alt_external_templates
= 1;
523 cp_deprecated ("-falt-external-templates");
525 else if (! strcmp (p
, "no-alt-external-templates"))
526 flag_alt_external_templates
= 0;
527 else if (!strcmp (p
, "repo"))
529 flag_use_repository
= 1;
530 flag_implicit_templates
= 0;
532 else if (!strcmp (p
, "external-templates"))
534 flag_external_templates
= 1;
535 cp_deprecated ("-fexternal-templates");
537 else if ((option_value
538 = skip_leading_substring (p
, "template-depth-")))
540 = read_integral_parameter (option_value
, p
- 2, max_tinst_depth
);
541 else if ((option_value
542 = skip_leading_substring (p
, "name-mangling-version-")))
544 warning ("-fname-mangling-version is no longer supported");
547 else if (dump_switch_p (p
))
553 for (j
= 0; !found
&& j
< ARRAY_SIZE (lang_f_options
); j
++)
555 if (!strcmp (p
, lang_f_options
[j
].string
))
557 *lang_f_options
[j
].variable
= lang_f_options
[j
].on_value
;
558 /* A goto here would be cleaner,
559 but breaks the VAX pcc. */
562 else if (p
[0] == 'n' && p
[1] == 'o' && p
[2] == '-'
563 && ! strcmp (p
+3, lang_f_options
[j
].string
))
565 *lang_f_options
[j
].variable
= ! lang_f_options
[j
].on_value
;
573 else if (p
[0] == '-' && p
[1] == 'W')
577 /* The -W options control the warning behavior of the compiler. */
580 if (p
[0] == 'n' && p
[1] == 'o' && p
[2] == '-')
583 if (!strcmp (p
, "implicit"))
584 warn_implicit
= setting
;
585 else if (!strcmp (p
, "long-long"))
586 warn_long_long
= setting
;
587 else if (!strcmp (p
, "return-type"))
588 warn_return_type
= setting
;
589 else if (!strcmp (p
, "ctor-dtor-privacy"))
590 warn_ctor_dtor_privacy
= setting
;
591 else if (!strcmp (p
, "write-strings"))
592 warn_write_strings
= setting
;
593 else if (!strcmp (p
, "cast-qual"))
594 warn_cast_qual
= setting
;
595 else if (!strcmp (p
, "char-subscripts"))
596 warn_char_subscripts
= setting
;
597 else if (!strcmp (p
, "pointer-arith"))
598 warn_pointer_arith
= setting
;
599 else if (!strcmp (p
, "missing-prototypes"))
600 warn_missing_prototypes
= setting
;
601 else if (!strcmp (p
, "strict-prototypes"))
604 warning ("-Wno-strict-prototypes is not supported in C++");
606 else if (!strcmp (p
, "redundant-decls"))
607 warn_redundant_decls
= setting
;
608 else if (!strcmp (p
, "missing-braces"))
609 warn_missing_braces
= setting
;
610 else if (!strcmp (p
, "sign-compare"))
611 warn_sign_compare
= setting
;
612 else if (!strcmp (p
, "float-equal"))
613 warn_float_equal
= setting
;
614 else if (!strcmp (p
, "format"))
615 set_Wformat (setting
);
616 else if (!strcmp (p
, "format=2"))
618 else if (!strcmp (p
, "format-y2k"))
619 warn_format_y2k
= setting
;
620 else if (!strcmp (p
, "format-extra-args"))
621 warn_format_extra_args
= setting
;
622 else if (!strcmp (p
, "format-nonliteral"))
623 warn_format_nonliteral
= setting
;
624 else if (!strcmp (p
, "format-security"))
625 warn_format_security
= setting
;
626 else if (!strcmp (p
, "missing-format-attribute"))
627 warn_missing_format_attribute
= setting
;
628 else if (!strcmp (p
, "conversion"))
629 warn_conversion
= setting
;
630 else if (!strcmp (p
, "parentheses"))
631 warn_parentheses
= setting
;
632 else if (!strcmp (p
, "non-virtual-dtor"))
633 warn_nonvdtor
= setting
;
634 else if (!strcmp (p
, "reorder"))
635 warn_reorder
= setting
;
636 else if (!strcmp (p
, "synth"))
637 warn_synth
= setting
;
638 else if (!strcmp (p
, "pmf-conversions"))
639 warn_pmf2ptr
= setting
;
640 else if (!strcmp (p
, "effc++"))
642 else if (!strcmp (p
, "sign-promo"))
643 warn_sign_promo
= setting
;
644 else if (!strcmp (p
, "old-style-cast"))
645 warn_old_style_cast
= setting
;
646 else if (!strcmp (p
, "overloaded-virtual"))
647 warn_overloaded_virtual
= setting
;
648 else if (!strcmp (p
, "multichar"))
649 warn_multichar
= setting
;
650 else if (!strcmp (p
, "unknown-pragmas"))
651 /* Set to greater than 1, so that even unknown pragmas in
652 system headers will be warned about. */
653 warn_unknown_pragmas
= setting
* 2;
654 else if (!strcmp (p
, "non-template-friend"))
655 warn_nontemplate_friend
= setting
;
656 else if (!strcmp (p
, "deprecated"))
657 warn_deprecated
= setting
;
658 else if (!strcmp (p
, "comment"))
659 ; /* cpp handles this one. */
660 else if (!strcmp (p
, "comments"))
661 ; /* cpp handles this one. */
662 else if (!strcmp (p
, "trigraphs"))
663 ; /* cpp handles this one. */
664 else if (!strcmp (p
, "import"))
665 ; /* cpp handles this one. */
666 else if (!strcmp (p
, "all"))
668 warn_return_type
= setting
;
669 set_Wunused (setting
);
670 warn_implicit
= setting
;
671 warn_switch
= setting
;
672 set_Wformat (setting
);
673 warn_parentheses
= setting
;
674 warn_missing_braces
= setting
;
675 warn_sign_compare
= setting
;
676 warn_multichar
= setting
;
677 /* We save the value of warn_uninitialized, since if they put
678 -Wuninitialized on the command line, we need to generate a
679 warning about not using it without also specifying -O. */
680 if (warn_uninitialized
!= 1)
681 warn_uninitialized
= (setting
? 2 : 0);
682 /* Only warn about unknown pragmas that are not in system
684 warn_unknown_pragmas
= 1;
686 /* C++-specific warnings. */
687 warn_ctor_dtor_privacy
= setting
;
688 warn_nonvdtor
= setting
;
689 warn_reorder
= setting
;
690 warn_nontemplate_friend
= setting
;
692 else return strings_processed
;
694 else if (!strcmp (p
, "-E"))
695 flag_preprocess_only
= 1;
696 else if (!strcmp (p
, "-undef"))
698 else if (!strcmp (p
, "-ansi"))
699 flag_no_nonansi_builtin
= 1, flag_iso
= 1,
700 flag_noniso_default_format_attributes
= 0, flag_no_gnu_keywords
= 1;
702 /* Undocumented, only ever used when you're invoking cc1plus by hand, since
703 it's probably safe to assume no sane person would ever want to use this
704 under normal circumstances. */
705 else if (!strcmp (p
, "-spew-debug"))
709 return strings_processed
;
714 /* Incorporate `const' and `volatile' qualifiers for member functions.
715 FUNCTION is a TYPE_DECL or a FUNCTION_DECL.
716 QUALS is a list of qualifiers. Returns any explicit
717 top-level qualifiers of the method's this pointer, anything other than
718 TYPE_UNQUALIFIED will be an extension. */
721 grok_method_quals (ctype
, function
, quals
)
722 tree ctype
, function
, quals
;
724 tree fntype
= TREE_TYPE (function
);
725 tree raises
= TYPE_RAISES_EXCEPTIONS (fntype
);
726 int type_quals
= TYPE_UNQUALIFIED
;
727 int dup_quals
= TYPE_UNQUALIFIED
;
728 int this_quals
= TYPE_UNQUALIFIED
;
732 int tq
= cp_type_qual_from_rid (TREE_VALUE (quals
));
734 if ((type_quals
| this_quals
) & tq
)
736 else if (tq
& TYPE_QUAL_RESTRICT
)
740 quals
= TREE_CHAIN (quals
);
744 if (dup_quals
!= TYPE_UNQUALIFIED
)
745 error ("duplicate type qualifiers in %s declaration",
746 TREE_CODE (function
) == FUNCTION_DECL
747 ? "member function" : "type");
749 ctype
= cp_build_qualified_type (ctype
, type_quals
);
750 fntype
= build_cplus_method_type (ctype
, TREE_TYPE (fntype
),
751 (TREE_CODE (fntype
) == METHOD_TYPE
752 ? TREE_CHAIN (TYPE_ARG_TYPES (fntype
))
753 : TYPE_ARG_TYPES (fntype
)));
755 fntype
= build_exception_variant (fntype
, raises
);
757 TREE_TYPE (function
) = fntype
;
761 /* Warn when -fexternal-templates is used and #pragma
762 interface/implementation is not used all the times it should be,
766 warn_if_unknown_interface (decl
)
769 static int already_warned
= 0;
770 if (already_warned
++)
773 if (flag_alt_external_templates
)
775 tree til
= tinst_for_decl ();
777 const char *sf
= input_filename
;
781 lineno
= TINST_LINE (til
);
782 input_filename
= TINST_FILE (til
);
784 warning ("template `%#D' instantiated in file without #pragma interface",
790 cp_warning_at ("template `%#D' defined in file without #pragma interface",
794 /* A subroutine of the parser, to handle a component list. */
797 grok_x_components (specs
)
802 specs
= strip_attrs (specs
);
804 check_tag_decl (specs
);
805 t
= groktypename (build_tree_list (specs
, NULL_TREE
));
807 /* The only case where we need to do anything additional here is an
808 anonymous union field, e.g.: `struct S { union { int i; }; };'. */
809 if (t
== NULL_TREE
|| !ANON_AGGR_TYPE_P (t
))
812 fixup_anonymous_aggr (t
);
813 finish_member_declaration (build_decl (FIELD_DECL
, NULL_TREE
, t
));
816 /* Returns a PARM_DECL for a parameter of the indicated TYPE, with the
820 build_artificial_parm (name
, type
)
826 parm
= build_decl (PARM_DECL
, name
, type
);
827 DECL_ARTIFICIAL (parm
) = 1;
828 /* All our artificial parms are implicitly `const'; they cannot be
830 TREE_READONLY (parm
) = 1;
831 DECL_ARG_TYPE (parm
) = type
;
835 /* Constructors for types with virtual baseclasses need an "in-charge" flag
836 saying whether this constructor is responsible for initialization of
837 virtual baseclasses or not. All destructors also need this "in-charge"
838 flag, which additionally determines whether or not the destructor should
839 free the memory for the object.
841 This function adds the "in-charge" flag to member function FN if
842 appropriate. It is called from grokclassfn and tsubst.
843 FN must be either a constructor or destructor.
845 The in-charge flag follows the 'this' parameter, and is followed by the
846 VTT parm (if any), then the user-written parms. */
849 maybe_retrofit_in_chrg (fn
)
852 tree basetype
, arg_types
, parms
, parm
, fntype
;
854 /* If we've already add the in-charge parameter don't do it again. */
855 if (DECL_HAS_IN_CHARGE_PARM_P (fn
))
858 /* When processing templates we can't know, in general, whether or
859 not we're going to have virtual baseclasses. */
860 if (uses_template_parms (fn
))
863 /* We don't need an in-charge parameter for constructors that don't
864 have virtual bases. */
865 if (DECL_CONSTRUCTOR_P (fn
)
866 && !TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (fn
)))
869 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
870 basetype
= TREE_TYPE (TREE_VALUE (arg_types
));
871 arg_types
= TREE_CHAIN (arg_types
);
873 parms
= TREE_CHAIN (DECL_ARGUMENTS (fn
));
875 /* If this is a subobject constructor or destructor, our caller will
876 pass us a pointer to our VTT. */
877 if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (fn
)))
879 parm
= build_artificial_parm (vtt_parm_identifier
, vtt_parm_type
);
881 /* First add it to DECL_ARGUMENTS between 'this' and the real args... */
882 TREE_CHAIN (parm
) = parms
;
885 /* ...and then to TYPE_ARG_TYPES. */
886 arg_types
= hash_tree_chain (vtt_parm_type
, arg_types
);
888 DECL_HAS_VTT_PARM_P (fn
) = 1;
891 /* Then add the in-charge parm (before the VTT parm). */
892 parm
= build_artificial_parm (in_charge_identifier
, integer_type_node
);
893 TREE_CHAIN (parm
) = parms
;
895 arg_types
= hash_tree_chain (integer_type_node
, arg_types
);
897 /* Insert our new parameter(s) into the list. */
898 TREE_CHAIN (DECL_ARGUMENTS (fn
)) = parms
;
900 /* And rebuild the function type. */
901 fntype
= build_cplus_method_type (basetype
, TREE_TYPE (TREE_TYPE (fn
)),
903 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
)))
904 fntype
= build_exception_variant (fntype
,
905 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
)));
906 TREE_TYPE (fn
) = fntype
;
908 /* Now we've got the in-charge parameter. */
909 DECL_HAS_IN_CHARGE_PARM_P (fn
) = 1;
912 /* Classes overload their constituent function names automatically.
913 When a function name is declared in a record structure,
914 its name is changed to it overloaded name. Since names for
915 constructors and destructors can conflict, we place a leading
918 CNAME is the name of the class we are grokking for.
920 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
922 FLAGS contains bits saying what's special about today's
923 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
925 If FUNCTION is a destructor, then we must add the `auto-delete' field
926 as a second parameter. There is some hair associated with the fact
927 that we must "declare" this variable in the manner consistent with the
928 way the rest of the arguments were declared.
930 QUALS are the qualifiers for the this pointer. */
933 grokclassfn (ctype
, function
, flags
, quals
)
934 tree ctype
, function
;
935 enum overload_flags flags
;
938 tree fn_name
= DECL_NAME (function
);
939 int this_quals
= TYPE_UNQUALIFIED
;
941 /* Even within an `extern "C"' block, members get C++ linkage. See
942 [dcl.link] for details. */
943 SET_DECL_LANGUAGE (function
, lang_cplusplus
);
945 if (fn_name
== NULL_TREE
)
947 error ("name missing for member function");
948 fn_name
= get_identifier ("<anonymous>");
949 DECL_NAME (function
) = fn_name
;
953 this_quals
= grok_method_quals (ctype
, function
, quals
);
955 if (TREE_CODE (TREE_TYPE (function
)) == METHOD_TYPE
)
957 /* Must add the class instance variable up front. */
958 /* Right now we just make this a pointer. But later
959 we may wish to make it special. */
960 tree type
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (function
)));
964 /* The `this' parameter is implicitly `const'; it cannot be
966 this_quals
|= TYPE_QUAL_CONST
;
967 qual_type
= cp_build_qualified_type (type
, this_quals
);
968 parm
= build_artificial_parm (this_identifier
, qual_type
);
969 c_apply_type_quals_to_decl (this_quals
, parm
);
970 TREE_CHAIN (parm
) = last_function_parms
;
971 last_function_parms
= parm
;
974 DECL_ARGUMENTS (function
) = last_function_parms
;
975 DECL_CONTEXT (function
) = ctype
;
977 if (flags
== DTOR_FLAG
)
978 DECL_DESTRUCTOR_P (function
) = 1;
980 if (flags
== DTOR_FLAG
|| DECL_CONSTRUCTOR_P (function
))
981 maybe_retrofit_in_chrg (function
);
983 if (flags
== DTOR_FLAG
)
985 DECL_DESTRUCTOR_P (function
) = 1;
986 TYPE_HAS_DESTRUCTOR (ctype
) = 1;
990 /* Create an ARRAY_REF, checking for the user doing things backwards
994 grok_array_decl (array_expr
, index_exp
)
995 tree array_expr
, index_exp
;
997 tree type
= TREE_TYPE (array_expr
);
1000 if (type
== error_mark_node
|| index_exp
== error_mark_node
)
1001 return error_mark_node
;
1002 if (processing_template_decl
)
1003 return build_min (ARRAY_REF
, type
? TREE_TYPE (type
) : NULL_TREE
,
1004 array_expr
, index_exp
);
1006 if (type
== NULL_TREE
)
1008 /* Something has gone very wrong. Assume we are mistakenly reducing
1009 an expression instead of a declaration. */
1010 error ("parser may be lost: is there a '{' missing somewhere?");
1014 if (TREE_CODE (type
) == OFFSET_TYPE
1015 || TREE_CODE (type
) == REFERENCE_TYPE
)
1016 type
= TREE_TYPE (type
);
1018 /* If they have an `operator[]', use that. */
1019 if (IS_AGGR_TYPE (type
) || IS_AGGR_TYPE (TREE_TYPE (index_exp
)))
1020 return build_opfncall (ARRAY_REF
, LOOKUP_NORMAL
,
1021 array_expr
, index_exp
, NULL_TREE
);
1023 /* Otherwise, create an ARRAY_REF for a pointer or array type. It
1024 is a little-known fact that, if `a' is an array and `i' is an
1025 int, you can write `i[a]', which means the same thing as `a[i]'. */
1027 if (TREE_CODE (type
) == ARRAY_TYPE
)
1030 p1
= build_expr_type_conversion (WANT_POINTER
, array_expr
, 0);
1032 if (TREE_CODE (TREE_TYPE (index_exp
)) == ARRAY_TYPE
)
1035 p2
= build_expr_type_conversion (WANT_POINTER
, index_exp
, 0);
1037 i1
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, array_expr
, 0);
1038 i2
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, index_exp
, 0);
1040 if ((p1
&& i2
) && (i1
&& p2
))
1041 error ("ambiguous conversion for array subscript");
1044 array_expr
= p1
, index_exp
= i2
;
1046 array_expr
= p2
, index_exp
= i1
;
1049 error ("invalid types `%T[%T]' for array subscript",
1050 type
, TREE_TYPE (index_exp
));
1051 return error_mark_node
;
1054 if (array_expr
== error_mark_node
|| index_exp
== error_mark_node
)
1055 error ("ambiguous conversion for array subscript");
1057 return build_array_ref (array_expr
, index_exp
);
1060 /* Given the cast expression EXP, checking out its validity. Either return
1061 an error_mark_node if there was an unavoidable error, return a cast to
1062 void for trying to delete a pointer w/ the value 0, or return the
1063 call to delete. If DOING_VEC is 1, we handle things differently
1064 for doing an array delete. If DOING_VEC is 2, they gave us the
1065 array size as an argument to delete.
1066 Implements ARM $5.3.4. This is called from the parser. */
1069 delete_sanity (exp
, size
, doing_vec
, use_global_delete
)
1071 int doing_vec
, use_global_delete
;
1074 /* For a regular vector delete (aka, no size argument) we will pass
1075 this down as a NULL_TREE into build_vec_delete. */
1076 tree maxindex
= NULL_TREE
;
1078 if (exp
== error_mark_node
)
1081 if (processing_template_decl
)
1083 t
= build_min (DELETE_EXPR
, void_type_node
, exp
, size
);
1084 DELETE_EXPR_USE_GLOBAL (t
) = use_global_delete
;
1085 DELETE_EXPR_USE_VEC (t
) = doing_vec
;
1089 if (TREE_CODE (exp
) == OFFSET_REF
)
1090 exp
= resolve_offset_ref (exp
);
1091 exp
= convert_from_reference (exp
);
1092 t
= stabilize_reference (exp
);
1093 t
= build_expr_type_conversion (WANT_POINTER
, t
, 1);
1095 if (t
== NULL_TREE
|| t
== error_mark_node
)
1097 error ("type `%#T' argument given to `delete', expected pointer",
1099 return error_mark_node
;
1104 maxindex
= cp_build_binary_op (MINUS_EXPR
, size
, integer_one_node
);
1105 pedwarn ("anachronistic use of array size in vector delete");
1108 type
= TREE_TYPE (t
);
1110 /* As of Valley Forge, you can delete a pointer to const. */
1112 /* You can't delete functions. */
1113 if (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
1115 error ("cannot delete a function. Only pointer-to-objects are valid arguments to `delete'");
1116 return error_mark_node
;
1119 /* Deleting ptr to void is undefined behaviour [expr.delete/3]. */
1120 if (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
)
1122 warning ("deleting `%T' is undefined", type
);
1126 /* An array can't have been allocated by new, so complain. */
1127 if (TREE_CODE (t
) == ADDR_EXPR
1128 && TREE_CODE (TREE_OPERAND (t
, 0)) == VAR_DECL
1129 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == ARRAY_TYPE
)
1130 warning ("deleting array `%#D'", TREE_OPERAND (t
, 0));
1132 /* Deleting a pointer with the value zero is valid and has no effect. */
1133 if (integer_zerop (t
))
1134 return build1 (NOP_EXPR
, void_type_node
, t
);
1137 return build_vec_delete (t
, maxindex
, sfk_deleting_destructor
,
1140 return build_delete (type
, t
, sfk_deleting_destructor
,
1141 LOOKUP_NORMAL
, use_global_delete
);
1144 /* Report an error if the indicated template declaration is not the
1145 sort of thing that should be a member template. */
1148 check_member_template (tmpl
)
1153 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
1154 decl
= DECL_TEMPLATE_RESULT (tmpl
);
1156 if (TREE_CODE (decl
) == FUNCTION_DECL
1157 || (TREE_CODE (decl
) == TYPE_DECL
1158 && IS_AGGR_TYPE (TREE_TYPE (decl
))))
1160 if (current_function_decl
)
1161 /* 14.5.2.2 [temp.mem]
1163 A local class shall not have member templates. */
1164 error ("invalid declaration of member template `%#D' in local class",
1167 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
1169 /* 14.5.2.3 [temp.mem]
1171 A member function template shall not be virtual. */
1173 ("invalid use of `virtual' in template declaration of `%#D'",
1175 DECL_VIRTUAL_P (decl
) = 0;
1178 /* The debug-information generating code doesn't know what to do
1179 with member templates. */
1180 DECL_IGNORED_P (tmpl
) = 1;
1183 error ("template declaration of `%#D'", decl
);
1186 /* Return true iff TYPE is a valid Java parameter or return type. */
1189 acceptable_java_type (type
)
1192 if (TREE_CODE (type
) == VOID_TYPE
|| TYPE_FOR_JAVA (type
))
1194 if (TREE_CODE (type
) == POINTER_TYPE
|| TREE_CODE (type
) == REFERENCE_TYPE
)
1196 type
= TREE_TYPE (type
);
1197 if (TREE_CODE (type
) == RECORD_TYPE
)
1200 if (! TYPE_FOR_JAVA (type
))
1202 if (! CLASSTYPE_TEMPLATE_INFO (type
))
1204 args
= CLASSTYPE_TI_ARGS (type
);
1205 i
= TREE_VEC_LENGTH (args
);
1208 type
= TREE_VEC_ELT (args
, i
);
1209 if (TREE_CODE (type
) == POINTER_TYPE
)
1210 type
= TREE_TYPE (type
);
1211 if (! TYPE_FOR_JAVA (type
))
1220 /* For a METHOD in a Java class CTYPE, return 1 if
1221 the parameter and return types are valid Java types.
1222 Otherwise, print appropriate error messages, and return 0. */
1225 check_java_method (method
)
1229 tree arg_types
= TYPE_ARG_TYPES (TREE_TYPE (method
));
1230 tree ret_type
= TREE_TYPE (TREE_TYPE (method
));
1231 if (! acceptable_java_type (ret_type
))
1233 error ("Java method '%D' has non-Java return type `%T'",
1237 for (; arg_types
!= NULL_TREE
; arg_types
= TREE_CHAIN (arg_types
))
1239 tree type
= TREE_VALUE (arg_types
);
1240 if (! acceptable_java_type (type
))
1242 error ("Java method '%D' has non-Java parameter type `%T'",
1247 return jerr
? 0 : 1;
1250 /* Sanity check: report error if this function FUNCTION is not
1251 really a member of the class (CTYPE) it is supposed to belong to.
1252 CNAME is the same here as it is for grokclassfn above. */
1255 check_classfn (ctype
, function
)
1256 tree ctype
, function
;
1258 tree fn_name
= DECL_NAME (function
);
1259 tree fndecl
, fndecls
;
1260 tree method_vec
= CLASSTYPE_METHOD_VEC (complete_type (ctype
));
1264 if (DECL_USE_TEMPLATE (function
)
1265 && !(TREE_CODE (function
) == TEMPLATE_DECL
1266 && DECL_TEMPLATE_SPECIALIZATION (function
))
1267 && is_member_template (DECL_TI_TEMPLATE (function
)))
1268 /* Since this is a specialization of a member template,
1269 we're not going to find the declaration in the class.
1272 struct S { template <typename T> void f(T); };
1273 template <> void S::f(int);
1275 we're not going to find `S::f(int)', but there's no
1276 reason we should, either. We let our callers know we didn't
1277 find the method, but we don't complain. */
1280 if (method_vec
!= 0)
1282 methods
= &TREE_VEC_ELT (method_vec
, 0);
1283 end
= TREE_VEC_END (method_vec
);
1285 /* First suss out ctors and dtors. */
1286 if (*methods
&& fn_name
== DECL_NAME (OVL_CURRENT (*methods
))
1287 && DECL_CONSTRUCTOR_P (function
))
1289 if (*++methods
&& fn_name
== DECL_NAME (OVL_CURRENT (*methods
))
1290 && DECL_DESTRUCTOR_P (function
))
1293 while (++methods
!= end
&& *methods
)
1296 if (fn_name
== DECL_NAME (OVL_CURRENT (*methods
)))
1299 for (fndecls
= *methods
; fndecls
!= NULL_TREE
;
1300 fndecls
= OVL_NEXT (fndecls
))
1302 fndecl
= OVL_CURRENT (fndecls
);
1304 /* We cannot simply call decls_match because this
1305 doesn't work for static member functions that are
1306 pretending to be methods, and because the name
1307 may have been changed by asm("new_name"). */
1308 if (DECL_NAME (function
) == DECL_NAME (fndecl
))
1310 tree p1
= TYPE_ARG_TYPES (TREE_TYPE (function
));
1311 tree p2
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
1313 /* Get rid of the this parameter on functions that become
1315 if (DECL_STATIC_FUNCTION_P (fndecl
)
1316 && TREE_CODE (TREE_TYPE (function
)) == METHOD_TYPE
)
1317 p1
= TREE_CHAIN (p1
);
1319 if (same_type_p (TREE_TYPE (TREE_TYPE (function
)),
1320 TREE_TYPE (TREE_TYPE (fndecl
)))
1321 && compparms (p1
, p2
)
1322 && (DECL_TEMPLATE_SPECIALIZATION (function
)
1323 == DECL_TEMPLATE_SPECIALIZATION (fndecl
))
1324 && (!DECL_TEMPLATE_SPECIALIZATION (function
)
1325 || (DECL_TI_TEMPLATE (function
)
1326 == DECL_TI_TEMPLATE (fndecl
))))
1335 if (methods
!= end
&& *methods
)
1337 tree fndecl
= *methods
;
1338 error ("prototype for `%#D' does not match any in class `%T'",
1340 cp_error_at ("candidate%s: %+#D", OVL_NEXT (fndecl
) ? "s are" : " is",
1341 OVL_CURRENT (fndecl
));
1342 while (fndecl
= OVL_NEXT (fndecl
), fndecl
)
1343 cp_error_at (" %#D", OVL_CURRENT(fndecl
));
1348 if (!COMPLETE_TYPE_P (ctype
))
1349 cxx_incomplete_type_error (function
, ctype
);
1351 error ("no `%#D' member function declared in class `%T'",
1355 /* If we did not find the method in the class, add it to avoid
1356 spurious errors (unless the CTYPE is not yet defined, in which
1357 case we'll only confuse ourselves when the function is declared
1358 properly within the class. */
1359 if (COMPLETE_TYPE_P (ctype
))
1360 add_method (ctype
, function
, /*error_p=*/1);
1364 /* We have just processed the DECL, which is a static data member.
1365 Its initializer, if present, is INIT. The ASMSPEC_TREE, if
1366 present, is the assembly-language name for the data member.
1367 FLAGS is as for cp_finish_decl. */
1370 finish_static_data_member_decl (decl
, init
, asmspec_tree
, flags
)
1376 my_friendly_assert (TREE_PUBLIC (decl
), 0);
1378 DECL_CONTEXT (decl
) = current_class_type
;
1380 /* We cannot call pushdecl here, because that would fill in the
1381 TREE_CHAIN of our decl. Instead, we modify cp_finish_decl to do
1382 the right thing, namely, to put this decl out straight away. */
1383 /* current_class_type can be NULL_TREE in case of error. */
1384 if (!asmspec_tree
&& current_class_type
)
1385 DECL_INITIAL (decl
) = error_mark_node
;
1387 if (! processing_template_decl
)
1389 if (!pending_statics
)
1390 VARRAY_TREE_INIT (pending_statics
, 32, "pending_statics");
1391 VARRAY_PUSH_TREE (pending_statics
, decl
);
1394 if (LOCAL_CLASS_P (current_class_type
))
1395 pedwarn ("local class `%#T' shall not have static data member `%#D'",
1396 current_class_type
, decl
);
1398 /* Static consts need not be initialized in the class definition. */
1399 if (init
!= NULL_TREE
&& TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
1401 static int explained
= 0;
1403 error ("initializer invalid for static member with constructor");
1406 error ("(an out of class initialization is required)");
1411 /* Force the compiler to know when an uninitialized static const
1412 member is being used. */
1413 if (CP_TYPE_CONST_P (TREE_TYPE (decl
)) && init
== 0)
1414 TREE_USED (decl
) = 1;
1415 DECL_INITIAL (decl
) = init
;
1416 DECL_IN_AGGR_P (decl
) = 1;
1418 cp_finish_decl (decl
, init
, asmspec_tree
, flags
);
1421 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
1422 of a structure component, returning a _DECL node.
1423 QUALS is a list of type qualifiers for this decl (such as for declaring
1424 const member functions).
1426 This is done during the parsing of the struct declaration.
1427 The _DECL nodes are chained together and the lot of them
1428 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
1430 If class A defines that certain functions in class B are friends, then
1431 the way I have set things up, it is B who is interested in permission
1432 granted by A. However, it is in A's context that these declarations
1433 are parsed. By returning a void_type_node, class A does not attempt
1434 to incorporate the declarations of the friends within its structure.
1436 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
1437 CHANGES TO CODE IN `start_method'. */
1440 grokfield (declarator
, declspecs
, init
, asmspec_tree
, attrlist
)
1441 tree declarator
, declspecs
, init
, asmspec_tree
, attrlist
;
1444 const char *asmspec
= 0;
1445 int flags
= LOOKUP_ONLYCONVERTING
;
1447 /* Convert () initializers to = initializers. */
1448 if (init
== NULL_TREE
&& declarator
!= NULL_TREE
1449 && TREE_CODE (declarator
) == CALL_EXPR
1450 && TREE_OPERAND (declarator
, 0)
1451 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) == IDENTIFIER_NODE
1452 || TREE_CODE (TREE_OPERAND (declarator
, 0)) == SCOPE_REF
)
1453 && parmlist_is_exprlist (CALL_DECLARATOR_PARMS (declarator
)))
1455 /* It's invalid to try to initialize a data member using a
1456 functional notation, e.g.:
1462 Explain that to the user. */
1463 static int explained
;
1465 error ("invalid data member initialization");
1468 error ("(use `=' to initialize static data members)");
1472 declarator
= TREE_OPERAND (declarator
, 0);
1476 if (declspecs
== NULL_TREE
1477 && TREE_CODE (declarator
) == SCOPE_REF
1478 && TREE_CODE (TREE_OPERAND (declarator
, 1)) == IDENTIFIER_NODE
)
1480 /* Access declaration */
1481 if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator
, 0))))
1483 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
1484 pop_nested_class ();
1485 return do_class_using_decl (declarator
);
1489 && TREE_CODE (init
) == TREE_LIST
1490 && TREE_VALUE (init
) == error_mark_node
1491 && TREE_CHAIN (init
) == NULL_TREE
)
1494 value
= grokdeclarator (declarator
, declspecs
, FIELD
, init
!= 0, &attrlist
);
1495 if (! value
|| value
== error_mark_node
)
1496 /* friend or constructor went bad. */
1498 if (TREE_TYPE (value
) == error_mark_node
)
1499 return error_mark_node
;
1501 /* Pass friendly classes back. */
1502 if (TREE_CODE (value
) == VOID_TYPE
)
1503 return void_type_node
;
1505 if (DECL_NAME (value
) != NULL_TREE
1506 && IDENTIFIER_POINTER (DECL_NAME (value
))[0] == '_'
1507 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value
)), "_vptr"))
1508 error ("member `%D' conflicts with virtual function table field name",
1511 /* Stash away type declarations. */
1512 if (TREE_CODE (value
) == TYPE_DECL
)
1514 DECL_NONLOCAL (value
) = 1;
1515 DECL_CONTEXT (value
) = current_class_type
;
1517 if (CLASS_TYPE_P (TREE_TYPE (value
)))
1518 CLASSTYPE_GOT_SEMICOLON (TREE_TYPE (value
)) = 1;
1520 if (processing_template_decl
)
1521 value
= push_template_decl (value
);
1526 if (DECL_IN_AGGR_P (value
))
1528 error ("`%D' is already defined in `%T'", value
,
1529 DECL_CONTEXT (value
));
1530 return void_type_node
;
1534 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
1538 if (TREE_CODE (value
) == FUNCTION_DECL
)
1540 grok_function_init (value
, init
);
1543 else if (pedantic
&& TREE_CODE (value
) != VAR_DECL
)
1544 /* Already complained in grokdeclarator. */
1548 /* We allow initializers to become parameters to base
1550 if (TREE_CODE (init
) == TREE_LIST
)
1552 if (TREE_CHAIN (init
) == NULL_TREE
)
1553 init
= TREE_VALUE (init
);
1555 init
= digest_init (TREE_TYPE (value
), init
, (tree
*)0);
1558 if (TREE_CODE (init
) == CONST_DECL
)
1559 init
= DECL_INITIAL (init
);
1560 else if (TREE_READONLY_DECL_P (init
))
1561 init
= decl_constant_value (init
);
1562 else if (TREE_CODE (init
) == CONSTRUCTOR
)
1563 init
= digest_init (TREE_TYPE (value
), init
, (tree
*)0);
1564 if (init
== error_mark_node
)
1565 /* We must make this look different than `error_mark_node'
1566 because `decl_const_value' would mis-interpret it
1567 as only meaning that this VAR_DECL is defined. */
1568 init
= build1 (NOP_EXPR
, TREE_TYPE (value
), init
);
1569 else if (processing_template_decl
)
1571 else if (! TREE_CONSTANT (init
))
1573 /* We can allow references to things that are effectively
1574 static, since references are initialized with the address. */
1575 if (TREE_CODE (TREE_TYPE (value
)) != REFERENCE_TYPE
1576 || (TREE_STATIC (init
) == 0
1577 && (!DECL_P (init
) || DECL_EXTERNAL (init
) == 0)))
1579 error ("field initializer is not constant");
1580 init
= error_mark_node
;
1586 if (processing_template_decl
&& ! current_function_decl
1587 && (TREE_CODE (value
) == VAR_DECL
|| TREE_CODE (value
) == FUNCTION_DECL
))
1588 value
= push_template_decl (value
);
1591 cplus_decl_attributes (&value
, attrlist
, 0);
1593 if (TREE_CODE (value
) == VAR_DECL
)
1595 finish_static_data_member_decl (value
, init
, asmspec_tree
,
1599 if (TREE_CODE (value
) == FIELD_DECL
)
1602 error ("`asm' specifiers are not permitted on non-static data members");
1603 if (DECL_INITIAL (value
) == error_mark_node
)
1604 init
= error_mark_node
;
1605 cp_finish_decl (value
, init
, NULL_TREE
, flags
);
1606 DECL_INITIAL (value
) = init
;
1607 DECL_IN_AGGR_P (value
) = 1;
1610 if (TREE_CODE (value
) == FUNCTION_DECL
)
1614 /* This must override the asm specifier which was placed
1615 by grokclassfn. Lay this out fresh. */
1616 SET_DECL_RTL (value
, NULL_RTX
);
1617 SET_DECL_ASSEMBLER_NAME (value
, get_identifier (asmspec
));
1619 if (!DECL_FRIEND_P (value
))
1620 grok_special_member_properties (value
);
1622 cp_finish_decl (value
, init
, asmspec_tree
, flags
);
1624 /* Pass friends back this way. */
1625 if (DECL_FRIEND_P (value
))
1626 return void_type_node
;
1628 DECL_IN_AGGR_P (value
) = 1;
1636 /* Like `grokfield', but for bitfields.
1637 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
1640 grokbitfield (declarator
, declspecs
, width
)
1641 tree declarator
, declspecs
, width
;
1643 register tree value
= grokdeclarator (declarator
, declspecs
, BITFIELD
,
1646 if (! value
) return NULL_TREE
; /* friends went bad. */
1648 /* Pass friendly classes back. */
1649 if (TREE_CODE (value
) == VOID_TYPE
)
1650 return void_type_node
;
1652 if (TREE_CODE (value
) == TYPE_DECL
)
1654 error ("cannot declare `%D' to be a bit-field type", value
);
1658 /* Usually, finish_struct_1 catches bitfields with invalid types.
1659 But, in the case of bitfields with function type, we confuse
1660 ourselves into thinking they are member functions, so we must
1662 if (TREE_CODE (value
) == FUNCTION_DECL
)
1664 error ("cannot declare bit-field `%D' with function type",
1669 if (DECL_IN_AGGR_P (value
))
1671 error ("`%D' is already defined in the class %T", value
,
1672 DECL_CONTEXT (value
));
1673 return void_type_node
;
1676 if (TREE_STATIC (value
))
1678 error ("static member `%D' cannot be a bit-field", value
);
1681 cp_finish_decl (value
, NULL_TREE
, NULL_TREE
, 0);
1683 if (width
!= error_mark_node
)
1685 constant_expression_warning (width
);
1686 DECL_INITIAL (value
) = width
;
1687 SET_DECL_C_BIT_FIELD (value
);
1690 DECL_IN_AGGR_P (value
) = 1;
1695 grokoptypename (declspecs
, declarator
)
1696 tree declspecs
, declarator
;
1698 tree t
= grokdeclarator (declarator
, declspecs
, TYPENAME
, 0, NULL
);
1699 return mangle_conv_op_name_for_type (t
);
1702 /* When a function is declared with an initializer,
1703 do the right thing. Currently, there are two possibilities:
1708 // initialization possibility #1.
1709 virtual void f () = 0;
1731 // initialization possibility #2
1738 grok_function_init (decl
, init
)
1742 /* An initializer for a function tells how this function should
1744 tree type
= TREE_TYPE (decl
);
1746 if (TREE_CODE (type
) == FUNCTION_TYPE
)
1747 error ("initializer specified for non-member function `%D'", decl
);
1748 else if (integer_zerop (init
))
1749 DECL_PURE_VIRTUAL_P (decl
) = 1;
1751 error ("invalid initializer for virtual method `%D'", decl
);
1755 cplus_decl_attributes (decl
, attributes
, flags
)
1756 tree
*decl
, attributes
;
1759 if (*decl
== NULL_TREE
|| *decl
== void_type_node
)
1762 if (TREE_CODE (*decl
) == TEMPLATE_DECL
)
1763 decl
= &DECL_TEMPLATE_RESULT (*decl
);
1765 decl_attributes (decl
, attributes
, flags
);
1767 if (TREE_CODE (*decl
) == TYPE_DECL
)
1768 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (*decl
), TREE_TYPE (*decl
));
1771 /* CONSTRUCTOR_NAME:
1772 Return the name for the constructor (or destructor) for the
1773 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1774 IDENTIFIER_NODE. When given a template, this routine doesn't
1775 lose the specialization. */
1778 constructor_name_full (thing
)
1781 if (TREE_CODE (thing
) == TEMPLATE_TYPE_PARM
1782 || TREE_CODE (thing
) == BOUND_TEMPLATE_TEMPLATE_PARM
1783 || TREE_CODE (thing
) == TYPENAME_TYPE
)
1784 thing
= TYPE_NAME (thing
);
1785 else if (IS_AGGR_TYPE_CODE (TREE_CODE (thing
)))
1787 if (TYPE_WAS_ANONYMOUS (thing
) && TYPE_HAS_CONSTRUCTOR (thing
))
1788 thing
= DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (thing
), 0)));
1790 thing
= TYPE_NAME (thing
);
1792 if (TREE_CODE (thing
) == TYPE_DECL
1793 || (TREE_CODE (thing
) == TEMPLATE_DECL
1794 && TREE_CODE (DECL_TEMPLATE_RESULT (thing
)) == TYPE_DECL
))
1795 thing
= DECL_NAME (thing
);
1796 my_friendly_assert (TREE_CODE (thing
) == IDENTIFIER_NODE
, 197);
1800 /* CONSTRUCTOR_NAME:
1801 Return the name for the constructor (or destructor) for the
1802 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1803 IDENTIFIER_NODE. When given a template, return the plain
1804 unspecialized name. */
1807 constructor_name (thing
)
1811 thing
= constructor_name_full (thing
);
1812 t
= IDENTIFIER_TEMPLATE (thing
);
1818 /* Defer the compilation of the FN until the end of compilation. */
1824 if (DECL_DEFERRED_FN (fn
))
1826 DECL_DEFERRED_FN (fn
) = 1;
1828 VARRAY_TREE_INIT (deferred_fns
, 32, "deferred_fns");
1830 VARRAY_PUSH_TREE (deferred_fns
, fn
);
1833 /* Hunts through the global anonymous union ANON_DECL, building
1834 appropriate VAR_DECLs. Stores cleanups on the list of ELEMS, and
1835 returns a VAR_DECL whose size is the same as the size of the
1836 ANON_DECL, if one is available.
1838 FIXME: we should really handle anonymous unions by binding the names
1839 of the members to COMPONENT_REFs rather than this kludge. */
1842 build_anon_union_vars (anon_decl
, elems
, static_p
, external_p
)
1848 tree type
= TREE_TYPE (anon_decl
);
1849 tree main_decl
= NULL_TREE
;
1852 /* Rather than write the code to handle the non-union case,
1853 just give an error. */
1854 if (TREE_CODE (type
) != UNION_TYPE
)
1855 error ("anonymous struct not inside named type");
1857 for (field
= TYPE_FIELDS (type
);
1859 field
= TREE_CHAIN (field
))
1863 if (DECL_ARTIFICIAL (field
))
1865 if (TREE_CODE (field
) != FIELD_DECL
)
1867 cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members",
1872 if (TREE_PRIVATE (field
))
1873 cp_pedwarn_at ("private member `%#D' in anonymous union", field
);
1874 else if (TREE_PROTECTED (field
))
1875 cp_pedwarn_at ("protected member `%#D' in anonymous union", field
);
1877 if (DECL_NAME (field
) == NULL_TREE
1878 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
1880 decl
= build_anon_union_vars (field
, elems
, static_p
, external_p
);
1884 else if (DECL_NAME (field
) == NULL_TREE
)
1888 decl
= build_decl (VAR_DECL
, DECL_NAME (field
), TREE_TYPE (field
));
1889 /* tell `pushdecl' that this is not tentative. */
1890 DECL_INITIAL (decl
) = error_mark_node
;
1891 TREE_PUBLIC (decl
) = 0;
1892 TREE_STATIC (decl
) = static_p
;
1893 DECL_EXTERNAL (decl
) = external_p
;
1894 decl
= pushdecl (decl
);
1895 DECL_INITIAL (decl
) = NULL_TREE
;
1898 /* Only write out one anon union element--choose the largest
1899 one. We used to try to find one the same size as the union,
1900 but that fails if the ABI forces us to align the union more
1902 if (main_decl
== NULL_TREE
1903 || tree_int_cst_lt (DECL_SIZE (main_decl
), DECL_SIZE (decl
)))
1906 TREE_ASM_WRITTEN (main_decl
) = 1;
1910 /* ??? This causes there to be no debug info written out
1912 TREE_ASM_WRITTEN (decl
) = 1;
1914 if (DECL_NAME (field
) == NULL_TREE
1915 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
1916 /* The remainder of the processing was already done in the
1920 /* If there's a cleanup to do, it belongs in the
1921 TREE_PURPOSE of the following TREE_LIST. */
1922 *elems
= tree_cons (NULL_TREE
, decl
, *elems
);
1923 TREE_TYPE (*elems
) = type
;
1929 /* Finish off the processing of a UNION_TYPE structure. If the union is an
1930 anonymous union, then all members must be laid out together. PUBLIC_P
1931 is nonzero if this union is not declared static. */
1934 finish_anon_union (anon_union_decl
)
1935 tree anon_union_decl
;
1937 tree type
= TREE_TYPE (anon_union_decl
);
1939 int public_p
= TREE_PUBLIC (anon_union_decl
);
1940 int static_p
= TREE_STATIC (anon_union_decl
);
1941 int external_p
= DECL_EXTERNAL (anon_union_decl
);
1943 /* The VAR_DECL's context is the same as the TYPE's context. */
1944 DECL_CONTEXT (anon_union_decl
) = DECL_CONTEXT (TYPE_NAME (type
));
1946 if (TYPE_FIELDS (type
) == NULL_TREE
)
1951 error ("namespace-scope anonymous aggregates must be static");
1955 main_decl
= build_anon_union_vars (anon_union_decl
,
1956 &DECL_ANON_UNION_ELEMS (anon_union_decl
),
1957 static_p
, external_p
);
1959 if (main_decl
== NULL_TREE
)
1961 warning ("anonymous aggregate with no members");
1967 make_decl_rtl (main_decl
, 0);
1968 COPY_DECL_RTL (main_decl
, anon_union_decl
);
1969 expand_anon_union_decl (anon_union_decl
,
1971 DECL_ANON_UNION_ELEMS (anon_union_decl
));
1974 add_decl_stmt (anon_union_decl
);
1977 /* Finish processing a builtin type TYPE. It's name is NAME,
1978 its fields are in the array FIELDS. LEN is the number of elements
1979 in FIELDS minus one, or put another way, it is the maximum subscript
1982 It is given the same alignment as ALIGN_TYPE. */
1985 finish_builtin_type (type
, name
, fields
, len
, align_type
)
1994 TYPE_FIELDS (type
) = fields
[0];
1995 for (i
= 0; i
< len
; i
++)
1997 layout_type (TREE_TYPE (fields
[i
]));
1998 DECL_FIELD_CONTEXT (fields
[i
]) = type
;
1999 TREE_CHAIN (fields
[i
]) = fields
[i
+1];
2001 DECL_FIELD_CONTEXT (fields
[i
]) = type
;
2002 TYPE_ALIGN (type
) = TYPE_ALIGN (align_type
);
2003 TYPE_USER_ALIGN (type
) = TYPE_USER_ALIGN (align_type
);
2005 #if 0 /* not yet, should get fixed properly later */
2006 TYPE_NAME (type
) = make_type_decl (get_identifier (name
), type
);
2008 TYPE_NAME (type
) = build_decl (TYPE_DECL
, get_identifier (name
), type
);
2010 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2011 layout_decl (TYPE_NAME (type
), 0);
2014 /* Auxiliary functions to make type signatures for
2015 `operator new' and `operator delete' correspond to
2016 what compiler will be expecting. */
2019 coerce_new_type (type
)
2023 tree args
= TYPE_ARG_TYPES (type
);
2025 my_friendly_assert (TREE_CODE (type
) == FUNCTION_TYPE
, 20001107);
2027 if (!same_type_p (TREE_TYPE (type
), ptr_type_node
))
2028 e
= 1, error ("`operator new' must return type `%T'", ptr_type_node
);
2030 if (!args
|| args
== void_list_node
2031 || !same_type_p (TREE_VALUE (args
), c_size_type_node
))
2034 if (args
&& args
!= void_list_node
)
2035 args
= TREE_CHAIN (args
);
2036 pedwarn ("`operator new' takes type `size_t' (`%T') as first parameter", c_size_type_node
);
2041 args
= tree_cons (NULL_TREE
, c_size_type_node
, args
);
2044 type
= build_exception_variant
2045 (build_function_type (ptr_type_node
, args
),
2046 TYPE_RAISES_EXCEPTIONS (type
));
2054 coerce_delete_type (type
)
2058 tree args
= TYPE_ARG_TYPES (type
);
2060 my_friendly_assert (TREE_CODE (type
) == FUNCTION_TYPE
, 20001107);
2062 if (!same_type_p (TREE_TYPE (type
), void_type_node
))
2063 e
= 1, error ("`operator delete' must return type `%T'", void_type_node
);
2065 if (!args
|| args
== void_list_node
2066 || !same_type_p (TREE_VALUE (args
), ptr_type_node
))
2069 if (args
&& args
!= void_list_node
)
2070 args
= TREE_CHAIN (args
);
2071 error ("`operator delete' takes type `%T' as first parameter", ptr_type_node
);
2076 args
= tree_cons (NULL_TREE
, ptr_type_node
, args
);
2079 type
= build_exception_variant
2080 (build_function_type (void_type_node
, args
),
2081 TYPE_RAISES_EXCEPTIONS (type
));
2090 mark_vtable_entries (decl
)
2093 tree entries
= CONSTRUCTOR_ELTS (DECL_INITIAL (decl
));
2095 for (; entries
; entries
= TREE_CHAIN (entries
))
2097 tree fnaddr
= TREE_VALUE (entries
);
2100 if (TREE_CODE (fnaddr
) != ADDR_EXPR
2101 && TREE_CODE (fnaddr
) != FDESC_EXPR
)
2102 /* This entry is an offset: a virtual base class offset, a
2103 virtual call offset, an RTTI offset, etc. */
2106 fn
= TREE_OPERAND (fnaddr
, 0);
2107 TREE_ADDRESSABLE (fn
) = 1;
2108 /* When we don't have vcall offsets, we output thunks whenever
2109 we output the vtables that contain them. With vcall offsets,
2110 we know all the thunks we'll need when we emit a virtual
2111 function, so we emit the thunks there instead. */
2112 if (DECL_THUNK_P (fn
))
2113 use_thunk (fn
, /*emit_p=*/0);
2118 /* Set DECL up to have the closest approximation of "initialized common"
2119 linkage available. */
2122 comdat_linkage (decl
)
2126 make_decl_one_only (decl
);
2127 else if (TREE_CODE (decl
) == FUNCTION_DECL
2128 || (TREE_CODE (decl
) == VAR_DECL
&& DECL_ARTIFICIAL (decl
)))
2129 /* We can just emit function and compiler-generated variables
2130 statically; having multiple copies is (for the most part) only
2133 There are two correctness issues, however: the address of a
2134 template instantiation with external linkage should be the
2135 same, independent of what translation unit asks for the
2136 address, and this will not hold when we emit multiple copies of
2137 the function. However, there's little else we can do.
2139 Also, by default, the typeinfo implementation assumes that
2140 there will be only one copy of the string used as the name for
2141 each type. Therefore, if weak symbols are unavailable, the
2142 run-time library should perform a more conservative check; it
2143 should perform a string comparison, rather than an address
2145 TREE_PUBLIC (decl
) = 0;
2148 /* Static data member template instantiations, however, cannot
2149 have multiple copies. */
2150 if (DECL_INITIAL (decl
) == 0
2151 || DECL_INITIAL (decl
) == error_mark_node
)
2152 DECL_COMMON (decl
) = 1;
2153 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
2155 DECL_COMMON (decl
) = 1;
2156 DECL_INITIAL (decl
) = error_mark_node
;
2160 /* We can't do anything useful; leave vars for explicit
2162 DECL_EXTERNAL (decl
) = 1;
2163 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2167 if (DECL_LANG_SPECIFIC (decl
))
2168 DECL_COMDAT (decl
) = 1;
2171 /* For win32 we also want to put explicit instantiations in
2172 linkonce sections, so that they will be merged with implicit
2173 instantiations; otherwise we get duplicate symbol errors. */
2176 maybe_make_one_only (decl
)
2179 /* We used to say that this was not necessary on targets that support weak
2180 symbols, because the implicit instantiations will defer to the explicit
2181 one. However, that's not actually the case in SVR4; a strong definition
2182 after a weak one is an error. Also, not making explicit
2183 instantiations one_only means that we can end up with two copies of
2184 some template instantiations. */
2188 /* We can't set DECL_COMDAT on functions, or finish_file will think
2189 we can get away with not emitting them if they aren't used. We need
2190 to for variables so that cp_finish_decl will update their linkage,
2191 because their DECL_INITIAL may not have been set properly yet. */
2193 make_decl_one_only (decl
);
2195 if (TREE_CODE (decl
) == VAR_DECL
)
2197 DECL_COMDAT (decl
) = 1;
2198 /* Mark it needed so we don't forget to emit it. */
2199 TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl
)) = 1;
2203 /* Returns the virtual function with which the vtable for TYPE is
2204 emitted, or NULL_TREE if that heuristic is not applicable to TYPE. */
2212 if (TYPE_FOR_JAVA (type
)
2213 || CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
2214 || CLASSTYPE_INTERFACE_KNOWN (type
))
2217 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
2218 method
= TREE_CHAIN (method
))
2219 if (DECL_VINDEX (method
) != NULL_TREE
2220 && ! DECL_DECLARED_INLINE_P (method
)
2221 && (! DECL_PURE_VIRTUAL_P (method
)
2223 /* This would be nice, but we didn't think of it in time. */
2224 || DECL_DESTRUCTOR_P (method
)
2232 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
2233 based on TYPE and other static flags.
2235 Note that anything public is tagged TREE_PUBLIC, whether
2236 it's public in this file or in another one. */
2239 import_export_vtable (decl
, type
, final
)
2243 if (DECL_INTERFACE_KNOWN (decl
))
2246 if (TYPE_FOR_JAVA (type
))
2248 TREE_PUBLIC (decl
) = 1;
2249 DECL_EXTERNAL (decl
) = 1;
2250 DECL_INTERFACE_KNOWN (decl
) = 1;
2252 else if (CLASSTYPE_INTERFACE_KNOWN (type
))
2254 TREE_PUBLIC (decl
) = 1;
2255 DECL_EXTERNAL (decl
) = CLASSTYPE_INTERFACE_ONLY (type
);
2256 DECL_INTERFACE_KNOWN (decl
) = 1;
2260 /* We can only wait to decide if we have real non-inline virtual
2261 functions in our class, or if we come from a template. */
2263 int found
= (CLASSTYPE_TEMPLATE_INSTANTIATION (type
)
2264 || key_method (type
));
2266 if (final
|| ! found
)
2268 comdat_linkage (decl
);
2269 DECL_EXTERNAL (decl
) = 0;
2273 TREE_PUBLIC (decl
) = 1;
2274 DECL_EXTERNAL (decl
) = 1;
2279 /* Determine whether or not we want to specifically import or export CTYPE,
2280 using various heuristics. */
2283 import_export_class (ctype
)
2286 /* -1 for imported, 1 for exported. */
2287 int import_export
= 0;
2289 /* It only makes sense to call this function at EOF. The reason is
2290 that this function looks at whether or not the first non-inline
2291 non-abstract virtual member function has been defined in this
2292 translation unit. But, we can't possibly know that until we've
2293 seen the entire translation unit. */
2294 my_friendly_assert (at_eof
, 20000226);
2296 if (CLASSTYPE_INTERFACE_KNOWN (ctype
))
2299 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
2300 we will have CLASSTYPE_INTERFACE_ONLY set but not
2301 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
2302 heuristic because someone will supply a #pragma implementation
2303 elsewhere, and deducing it here would produce a conflict. */
2304 if (CLASSTYPE_INTERFACE_ONLY (ctype
))
2307 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype
)))
2309 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype
)))
2312 /* If we got -fno-implicit-templates, we import template classes that
2313 weren't explicitly instantiated. */
2314 if (import_export
== 0
2315 && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype
)
2316 && ! flag_implicit_templates
)
2319 /* Base our import/export status on that of the first non-inline,
2320 non-pure virtual function, if any. */
2321 if (import_export
== 0
2322 && TYPE_POLYMORPHIC_P (ctype
))
2324 tree method
= key_method (ctype
);
2326 import_export
= (DECL_REALLY_EXTERN (method
) ? -1 : 1);
2329 #ifdef MULTIPLE_SYMBOL_SPACES
2330 if (import_export
== -1)
2336 SET_CLASSTYPE_INTERFACE_KNOWN (ctype
);
2337 CLASSTYPE_INTERFACE_ONLY (ctype
) = (import_export
< 0);
2341 /* We need to describe to the assembler the relationship between
2342 a vtable and the vtable of the parent class. */
2345 output_vtable_inherit (vars
)
2349 rtx child_rtx
, parent_rtx
;
2351 child_rtx
= XEXP (DECL_RTL (vars
), 0); /* strip the mem ref */
2353 parent
= binfo_for_vtable (vars
);
2355 if (parent
== TYPE_BINFO (DECL_CONTEXT (vars
)))
2356 parent_rtx
= const0_rtx
;
2359 parent
= get_vtbl_decl_for_binfo (TYPE_BINFO (BINFO_TYPE (parent
)));
2360 parent_rtx
= XEXP (DECL_RTL (parent
), 0); /* strip the mem ref */
2365 assemble_vtable_inherit (child_rtx
, parent_rtx
);
2369 finish_vtable_vardecl (t
, data
)
2371 void *data ATTRIBUTE_UNUSED
;
2374 tree ctype
= DECL_CONTEXT (vars
);
2375 import_export_class (ctype
);
2376 import_export_vtable (vars
, ctype
, 1);
2378 if (! DECL_EXTERNAL (vars
)
2379 && DECL_NEEDED_P (vars
)
2380 && ! TREE_ASM_WRITTEN (vars
))
2382 if (TREE_TYPE (vars
) == void_type_node
)
2383 /* It is a dummy vtable made by get_vtable_decl. Ignore it. */
2387 mark_vtable_entries (vars
);
2388 if (TREE_TYPE (DECL_INITIAL (vars
)) == 0)
2389 store_init_value (vars
, DECL_INITIAL (vars
));
2391 if (write_symbols
== DWARF_DEBUG
|| write_symbols
== DWARF2_DEBUG
)
2393 /* Mark the VAR_DECL node representing the vtable itself as a
2394 "gratuitous" one, thereby forcing dwarfout.c to ignore it.
2395 It is rather important that such things be ignored because
2396 any effort to actually generate DWARF for them will run
2397 into trouble when/if we encounter code like:
2400 struct S { virtual void member (); };
2402 because the artificial declaration of the vtable itself (as
2403 manufactured by the g++ front end) will say that the vtable
2404 is a static member of `S' but only *after* the debug output
2405 for the definition of `S' has already been output. This causes
2406 grief because the DWARF entry for the definition of the vtable
2407 will try to refer back to an earlier *declaration* of the
2408 vtable as a static member of `S' and there won't be one.
2409 We might be able to arrange to have the "vtable static member"
2410 attached to the member list for `S' before the debug info for
2411 `S' get written (which would solve the problem) but that would
2412 require more intrusive changes to the g++ front end. */
2414 DECL_IGNORED_P (vars
) = 1;
2417 /* Always make vtables weak. */
2419 comdat_linkage (vars
);
2421 rest_of_decl_compilation (vars
, NULL
, 1, 1);
2424 output_vtable_inherit (vars
);
2426 /* Because we're only doing syntax-checking, we'll never end up
2427 actually marking the variable as written. */
2428 if (flag_syntax_only
)
2429 TREE_ASM_WRITTEN (vars
) = 1;
2431 /* Since we're writing out the vtable here, also write the debug
2433 note_debug_info_needed (ctype
);
2438 /* If the references to this class' vtables were optimized away, still
2439 emit the appropriate debugging information. See dfs_debug_mark. */
2440 if (DECL_COMDAT (vars
)
2441 && CLASSTYPE_DEBUG_REQUESTED (ctype
))
2442 note_debug_info_needed (ctype
);
2448 prune_vtable_vardecl (t
, data
)
2450 void *data ATTRIBUTE_UNUSED
;
2452 *t
= TREE_CHAIN (*t
);
2456 /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an
2457 inline function or template instantiation at end-of-file. */
2460 import_export_decl (decl
)
2463 if (DECL_INTERFACE_KNOWN (decl
))
2466 if (DECL_TEMPLATE_INSTANTIATION (decl
)
2467 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl
))
2469 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2470 if ((DECL_IMPLICIT_INSTANTIATION (decl
)
2471 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl
))
2472 && (flag_implicit_templates
2473 || (flag_implicit_inline_templates
2474 && DECL_DECLARED_INLINE_P (decl
))))
2476 if (!TREE_PUBLIC (decl
))
2477 /* Templates are allowed to have internal linkage. See
2481 comdat_linkage (decl
);
2485 DECL_EXTERNAL (decl
) = 1;
2486 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2489 else if (DECL_FUNCTION_MEMBER_P (decl
))
2491 if (!DECL_DECLARED_INLINE_P (decl
))
2493 tree ctype
= DECL_CONTEXT (decl
);
2494 import_export_class (ctype
);
2495 if (CLASSTYPE_INTERFACE_KNOWN (ctype
))
2497 DECL_NOT_REALLY_EXTERN (decl
)
2498 = ! (CLASSTYPE_INTERFACE_ONLY (ctype
)
2499 || (DECL_DECLARED_INLINE_P (decl
)
2500 && ! flag_implement_inlines
2501 && !DECL_VINDEX (decl
)));
2503 if (!DECL_NOT_REALLY_EXTERN (decl
))
2504 DECL_EXTERNAL (decl
) = 1;
2506 /* Always make artificials weak. */
2507 if (DECL_ARTIFICIAL (decl
) && flag_weak
)
2508 comdat_linkage (decl
);
2510 maybe_make_one_only (decl
);
2514 comdat_linkage (decl
);
2516 else if (tinfo_decl_p (decl
, 0))
2518 /* Here, we only decide whether or not the tinfo node should be
2519 emitted with the vtable. The decl we're considering isn't
2520 actually the one which gets emitted; that one is generated in
2521 create_real_tinfo_var. */
2523 tree ctype
= TREE_TYPE (DECL_NAME (decl
));
2525 if (IS_AGGR_TYPE (ctype
))
2526 import_export_class (ctype
);
2528 if (IS_AGGR_TYPE (ctype
) && CLASSTYPE_INTERFACE_KNOWN (ctype
)
2529 && TYPE_POLYMORPHIC_P (ctype
)
2530 /* If -fno-rtti, we're not necessarily emitting this stuff with
2531 the class, so go ahead and emit it now. This can happen
2532 when a class is used in exception handling. */
2534 /* If the type is a cv-qualified variant of a type, then we
2535 must emit the tinfo function in this translation unit
2536 since it will not be emitted when the vtable for the type
2537 is output (which is when the unqualified version is
2539 && same_type_p (ctype
, TYPE_MAIN_VARIANT (ctype
)))
2541 DECL_NOT_REALLY_EXTERN (decl
)
2542 = ! CLASSTYPE_INTERFACE_ONLY (ctype
);
2543 DECL_COMDAT (decl
) = 0;
2547 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2548 DECL_COMDAT (decl
) = 1;
2552 comdat_linkage (decl
);
2554 DECL_INTERFACE_KNOWN (decl
) = 1;
2558 build_cleanup (decl
)
2562 tree type
= TREE_TYPE (decl
);
2564 if (TREE_CODE (type
) == ARRAY_TYPE
)
2568 cxx_mark_addressable (decl
);
2569 temp
= build1 (ADDR_EXPR
, build_pointer_type (type
), decl
);
2571 temp
= build_delete (TREE_TYPE (temp
), temp
,
2572 sfk_complete_destructor
,
2573 LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
, 0);
2577 /* Returns the initialization guard variable for the variable DECL,
2578 which has static storage duration. */
2587 sname
= mangle_guard_variable (decl
);
2588 guard
= IDENTIFIER_GLOBAL_VALUE (sname
);
2593 /* We use a type that is big enough to contain a mutex as well
2594 as an integer counter. */
2595 guard_type
= long_long_integer_type_node
;
2596 guard
= build_decl (VAR_DECL
, sname
, guard_type
);
2598 /* The guard should have the same linkage as what it guards. */
2599 TREE_PUBLIC (guard
) = TREE_PUBLIC (decl
);
2600 TREE_STATIC (guard
) = TREE_STATIC (decl
);
2601 DECL_COMMON (guard
) = DECL_COMMON (decl
);
2602 DECL_ONE_ONLY (guard
) = DECL_ONE_ONLY (decl
);
2603 if (TREE_PUBLIC (decl
))
2604 DECL_WEAK (guard
) = DECL_WEAK (decl
);
2606 DECL_ARTIFICIAL (guard
) = 1;
2607 TREE_USED (guard
) = 1;
2608 pushdecl_top_level (guard
);
2609 cp_finish_decl (guard
, NULL_TREE
, NULL_TREE
, 0);
2614 /* Return those bits of the GUARD variable that should be set when the
2615 guarded entity is actually initialized. */
2618 get_guard_bits (guard
)
2621 /* We only set the first byte of the guard, in order to leave room
2622 for a mutex in the high-order bits. */
2623 guard
= build1 (ADDR_EXPR
,
2624 build_pointer_type (TREE_TYPE (guard
)),
2626 guard
= build1 (NOP_EXPR
,
2627 build_pointer_type (char_type_node
),
2629 guard
= build1 (INDIRECT_REF
, char_type_node
, guard
);
2634 /* Return an expression which determines whether or not the GUARD
2635 variable has already been initialized. */
2638 get_guard_cond (guard
)
2643 /* Check to see if the GUARD is zero. */
2644 guard
= get_guard_bits (guard
);
2645 guard_value
= integer_zero_node
;
2646 if (!same_type_p (TREE_TYPE (guard_value
), TREE_TYPE (guard
)))
2647 guard_value
= convert (TREE_TYPE (guard
), guard_value
);
2648 return cp_build_binary_op (EQ_EXPR
, guard
, guard_value
);
2651 /* Return an expression which sets the GUARD variable, indicating that
2652 the variable being guarded has been initialized. */
2660 /* Set the GUARD to one. */
2661 guard
= get_guard_bits (guard
);
2662 guard_init
= integer_one_node
;
2663 if (!same_type_p (TREE_TYPE (guard_init
), TREE_TYPE (guard
)))
2664 guard_init
= convert (TREE_TYPE (guard
), guard_init
);
2665 return build_modify_expr (guard
, NOP_EXPR
, guard_init
);
2668 /* Start the process of running a particular set of global constructors
2669 or destructors. Subroutine of do_[cd]tors. */
2672 start_objects (method_type
, initp
)
2673 int method_type
, initp
;
2679 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
2681 if (initp
!= DEFAULT_INIT_PRIORITY
)
2691 sprintf (type
, "%c%c%.5u", method_type
, joiner
, initp
);
2694 sprintf (type
, "%c", method_type
);
2696 fnname
= get_file_function_name_long (type
);
2698 start_function (void_list_node
,
2699 make_call_declarator (fnname
, void_list_node
, NULL_TREE
,
2701 NULL_TREE
, SF_DEFAULT
);
2703 /* It can be a static function as long as collect2 does not have
2704 to scan the object file to find its ctor/dtor routine. */
2705 TREE_PUBLIC (current_function_decl
) = ! targetm
.have_ctors_dtors
;
2707 /* Mark this declaration as used to avoid spurious warnings. */
2708 TREE_USED (current_function_decl
) = 1;
2710 /* Mark this function as a global constructor or destructor. */
2711 if (method_type
== 'I')
2712 DECL_GLOBAL_CTOR_P (current_function_decl
) = 1;
2714 DECL_GLOBAL_DTOR_P (current_function_decl
) = 1;
2715 GLOBAL_INIT_PRIORITY (current_function_decl
) = initp
;
2717 body
= begin_compound_stmt (/*has_no_scope=*/0);
2719 /* We cannot allow these functions to be elided, even if they do not
2720 have external linkage. And, there's no point in deferring
2721 copmilation of thes functions; they're all going to have to be
2723 current_function_cannot_inline
2724 = "static constructors and destructors cannot be inlined";
2729 /* Finish the process of running a particular set of global constructors
2730 or destructors. Subroutine of do_[cd]tors. */
2733 finish_objects (method_type
, initp
, body
)
2734 int method_type
, initp
;
2740 finish_compound_stmt (/*has_no_scope=*/0, body
);
2741 fn
= finish_function (0);
2744 /* When only doing semantic analysis, and no RTL generation, we
2745 can't call functions that directly emit assembly code; there is
2746 no assembly file in which to put the code. */
2747 if (flag_syntax_only
)
2750 if (targetm
.have_ctors_dtors
)
2752 rtx fnsym
= XEXP (DECL_RTL (fn
), 0);
2753 if (method_type
== 'I')
2754 (* targetm
.asm_out
.constructor
) (fnsym
, initp
);
2756 (* targetm
.asm_out
.destructor
) (fnsym
, initp
);
2760 /* The names of the parameters to the function created to handle
2761 initializations and destructions for objects with static storage
2763 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
2764 #define PRIORITY_IDENTIFIER "__priority"
2766 /* The name of the function we create to handle initializations and
2767 destructions for objects with static storage duration. */
2768 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
2770 /* The declaration for the __INITIALIZE_P argument. */
2771 static tree initialize_p_decl
;
2773 /* The declaration for the __PRIORITY argument. */
2774 static tree priority_decl
;
2776 /* The declaration for the static storage duration function. */
2777 static tree ssdf_decl
;
2779 /* All the static storage duration functions created in this
2780 translation unit. */
2781 static varray_type ssdf_decls
;
2783 /* A map from priority levels to information about that priority
2784 level. There may be many such levels, so efficient lookup is
2786 static splay_tree priority_info_map
;
2788 /* Begins the generation of the function that will handle all
2789 initialization and destruction of objects with static storage
2790 duration. The function generated takes two parameters of type
2791 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
2792 non-zero, it performs initializations. Otherwise, it performs
2793 destructions. It only performs those initializations or
2794 destructions with the indicated __PRIORITY. The generated function
2797 It is assumed that this function will only be called once per
2798 translation unit. */
2801 start_static_storage_duration_function ()
2803 static unsigned ssdf_number
;
2808 char id
[sizeof (SSDF_IDENTIFIER
) + 1 /* '\0' */ + 32];
2810 /* Create the identifier for this function. It will be of the form
2811 SSDF_IDENTIFIER_<number>. */
2812 sprintf (id
, "%s_%u", SSDF_IDENTIFIER
, ssdf_number
++);
2813 if (ssdf_number
== 0)
2815 /* Overflow occurred. That means there are at least 4 billion
2816 initialization functions. */
2817 sorry ("too many initialization functions required");
2821 /* Create the parameters. */
2822 parm_types
= void_list_node
;
2823 parm_types
= tree_cons (NULL_TREE
, integer_type_node
, parm_types
);
2824 parm_types
= tree_cons (NULL_TREE
, integer_type_node
, parm_types
);
2825 type
= build_function_type (void_type_node
, parm_types
);
2827 /* Create the FUNCTION_DECL itself. */
2828 ssdf_decl
= build_lang_decl (FUNCTION_DECL
,
2829 get_identifier (id
),
2831 TREE_PUBLIC (ssdf_decl
) = 0;
2832 DECL_ARTIFICIAL (ssdf_decl
) = 1;
2834 /* Put this function in the list of functions to be called from the
2835 static constructors and destructors. */
2838 VARRAY_TREE_INIT (ssdf_decls
, 32, "ssdf_decls");
2840 /* Take this opportunity to initialize the map from priority
2841 numbers to information about that priority level. */
2842 priority_info_map
= splay_tree_new (splay_tree_compare_ints
,
2843 /*delete_key_fn=*/0,
2844 /*delete_value_fn=*/
2845 (splay_tree_delete_value_fn
) &free
);
2847 /* We always need to generate functions for the
2848 DEFAULT_INIT_PRIORITY so enter it now. That way when we walk
2849 priorities later, we'll be sure to find the
2850 DEFAULT_INIT_PRIORITY. */
2851 get_priority_info (DEFAULT_INIT_PRIORITY
);
2854 VARRAY_PUSH_TREE (ssdf_decls
, ssdf_decl
);
2856 /* Create the argument list. */
2857 initialize_p_decl
= build_decl (PARM_DECL
,
2858 get_identifier (INITIALIZE_P_IDENTIFIER
),
2860 DECL_CONTEXT (initialize_p_decl
) = ssdf_decl
;
2861 DECL_ARG_TYPE (initialize_p_decl
) = integer_type_node
;
2862 TREE_USED (initialize_p_decl
) = 1;
2863 priority_decl
= build_decl (PARM_DECL
, get_identifier (PRIORITY_IDENTIFIER
),
2865 DECL_CONTEXT (priority_decl
) = ssdf_decl
;
2866 DECL_ARG_TYPE (priority_decl
) = integer_type_node
;
2867 TREE_USED (priority_decl
) = 1;
2869 TREE_CHAIN (initialize_p_decl
) = priority_decl
;
2870 DECL_ARGUMENTS (ssdf_decl
) = initialize_p_decl
;
2872 /* Put the function in the global scope. */
2873 pushdecl (ssdf_decl
);
2875 /* Start the function itself. This is equivalent to declarating the
2878 static void __ssdf (int __initialize_p, init __priority_p);
2880 It is static because we only need to call this function from the
2881 various constructor and destructor functions for this module. */
2882 start_function (/*specs=*/NULL_TREE
,
2884 /*attrs=*/NULL_TREE
,
2887 /* Set up the scope of the outermost block in the function. */
2888 body
= begin_compound_stmt (/*has_no_scope=*/0);
2890 /* This function must not be deferred because we are depending on
2891 its compilation to tell us what is TREE_SYMBOL_REFERENCED. */
2892 current_function_cannot_inline
2893 = "static storage duration functions cannot be inlined";
2898 /* Finish the generation of the function which performs initialization
2899 and destruction of objects with static storage duration. After
2900 this point, no more such objects can be created. */
2903 finish_static_storage_duration_function (body
)
2906 /* Close out the function. */
2907 finish_compound_stmt (/*has_no_scope=*/0, body
);
2908 expand_body (finish_function (0));
2911 /* Return the information about the indicated PRIORITY level. If no
2912 code to handle this level has yet been generated, generate the
2913 appropriate prologue. */
2915 static priority_info
2916 get_priority_info (priority
)
2922 n
= splay_tree_lookup (priority_info_map
,
2923 (splay_tree_key
) priority
);
2926 /* Create a new priority information structure, and insert it
2928 pi
= (priority_info
) xmalloc (sizeof (struct priority_info_s
));
2929 pi
->initializations_p
= 0;
2930 pi
->destructions_p
= 0;
2931 splay_tree_insert (priority_info_map
,
2932 (splay_tree_key
) priority
,
2933 (splay_tree_value
) pi
);
2936 pi
= (priority_info
) n
->value
;
2941 /* Set up to handle the initialization or destruction of DECL. If
2942 INITP is non-zero, we are initializing the variable. Otherwise, we
2943 are destroying it. */
2946 start_static_initialization_or_destruction (decl
, initp
)
2950 tree guard_if_stmt
= NULL_TREE
;
2957 /* Figure out the priority for this declaration. */
2958 priority
= DECL_INIT_PRIORITY (decl
);
2960 priority
= DEFAULT_INIT_PRIORITY
;
2962 /* Remember that we had an initialization or finalization at this
2964 pi
= get_priority_info (priority
);
2966 pi
->initializations_p
= 1;
2968 pi
->destructions_p
= 1;
2970 /* Trick the compiler into thinking we are at the file and line
2971 where DECL was declared so that error-messages make sense, and so
2972 that the debugger will show somewhat sensible file and line
2974 input_filename
= DECL_SOURCE_FILE (decl
);
2975 lineno
= DECL_SOURCE_LINE (decl
);
2981 Access control for implicit calls to the constructors,
2982 the conversion functions, or the destructor called to
2983 create and destroy a static data member is performed as
2984 if these calls appeared in the scope of the member's
2987 we pretend we are in a static member function of the class of
2988 which the DECL is a member. */
2989 if (member_p (decl
))
2991 DECL_CONTEXT (current_function_decl
) = DECL_CONTEXT (decl
);
2992 DECL_STATIC_FUNCTION_P (current_function_decl
) = 1;
2995 /* Conditionalize this initialization on being in the right priority
2996 and being initializing/finalizing appropriately. */
2997 guard_if_stmt
= begin_if_stmt ();
2998 cond
= cp_build_binary_op (EQ_EXPR
,
3000 build_int_2 (priority
, 0));
3001 init_cond
= initp
? integer_one_node
: integer_zero_node
;
3002 init_cond
= cp_build_binary_op (EQ_EXPR
,
3005 cond
= cp_build_binary_op (TRUTH_ANDIF_EXPR
, cond
, init_cond
);
3007 /* Assume we don't need a guard. */
3009 /* We need a guard if this is an object with external linkage that
3010 might be initialized in more than one place. (For example, a
3011 static data member of a template, when the data member requires
3013 if (TREE_PUBLIC (decl
) && (DECL_COMMON (decl
)
3014 || DECL_ONE_ONLY (decl
)
3015 || DECL_WEAK (decl
)))
3019 guard
= get_guard (decl
);
3021 /* When using __cxa_atexit, we just check the GUARD as we would
3022 for a local static. */
3023 if (flag_use_cxa_atexit
)
3025 /* When using __cxa_atexit, we never try to destroy
3026 anything from a static destructor. */
3027 my_friendly_assert (initp
, 20000629);
3028 guard_cond
= get_guard_cond (guard
);
3030 /* If we don't have __cxa_atexit, then we will be running
3031 destructors from .fini sections, or their equivalents. So,
3032 we need to know how many times we've tried to initialize this
3033 object. We do initializations only if the GUARD is zero,
3034 i.e., if we are the first to initialize the variable. We do
3035 destructions only if the GUARD is one, i.e., if we are the
3036 last to destroy the variable. */
3039 = cp_build_binary_op (EQ_EXPR
,
3040 build_unary_op (PREINCREMENT_EXPR
,
3046 = cp_build_binary_op (EQ_EXPR
,
3047 build_unary_op (PREDECREMENT_EXPR
,
3052 cond
= cp_build_binary_op (TRUTH_ANDIF_EXPR
, cond
, guard_cond
);
3055 finish_if_stmt_cond (cond
, guard_if_stmt
);
3057 /* If we're using __cxa_atexit, we have not already set the GUARD,
3058 so we must do so now. */
3059 if (guard
&& initp
&& flag_use_cxa_atexit
)
3060 finish_expr_stmt (set_guard (guard
));
3062 return guard_if_stmt
;
3065 /* We've just finished generating code to do an initialization or
3066 finalization. GUARD_IF_STMT is the if-statement we used to guard
3067 the initialization. */
3070 finish_static_initialization_or_destruction (guard_if_stmt
)
3073 finish_then_clause (guard_if_stmt
);
3076 /* Now that we're done with DECL we don't need to pretend to be a
3077 member of its class any longer. */
3078 DECL_CONTEXT (current_function_decl
) = NULL_TREE
;
3079 DECL_STATIC_FUNCTION_P (current_function_decl
) = 0;
3082 /* Generate code to do the static initialization of DECL. The
3083 initialization is INIT. If DECL may be initialized more than once
3084 in different object files, GUARD is the guard variable to
3085 check. PRIORITY is the priority for the initialization. */
3088 do_static_initialization (decl
, init
)
3095 /* Set up for the initialization. */
3097 = start_static_initialization_or_destruction (decl
,
3100 /* Do the initialization itself. */
3101 if (IS_AGGR_TYPE (TREE_TYPE (decl
))
3102 || TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
3103 expr
= build_aggr_init (decl
, init
, 0);
3106 expr
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
3107 TREE_SIDE_EFFECTS (expr
) = 1;
3109 finish_expr_stmt (expr
);
3111 /* If we're using __cxa_atexit, register a a function that calls the
3112 destructor for the object. */
3113 if (flag_use_cxa_atexit
)
3114 register_dtor_fn (decl
);
3117 finish_static_initialization_or_destruction (guard_if_stmt
);
3120 /* Generate code to do the static destruction of DECL. If DECL may be
3121 initialized more than once in different object files, GUARD is the
3122 guard variable to check. PRIORITY is the priority for the
3126 do_static_destruction (decl
)
3131 /* If we're using __cxa_atexit, then destructors are registered
3132 immediately after objects are initialized. */
3133 my_friendly_assert (!flag_use_cxa_atexit
, 20000121);
3135 /* If we don't need a destructor, there's nothing to do. */
3136 if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl
)))
3139 /* Actually do the destruction. */
3140 guard_if_stmt
= start_static_initialization_or_destruction (decl
,
3142 finish_expr_stmt (build_cleanup (decl
));
3143 finish_static_initialization_or_destruction (guard_if_stmt
);
3146 /* VARS is a list of variables with static storage duration which may
3147 need initialization and/or finalization. Remove those variables
3148 that don't really need to be initialized or finalized, and return
3149 the resulting list. The order in which the variables appear in
3150 VARS is in reverse order of the order in which they should actually
3151 be initialized. The list we return is in the unreversed order;
3152 i.e., the first variable should be initialized first. */
3155 prune_vars_needing_no_initialization (vars
)
3161 for (var
= vars
, result
= NULL_TREE
;
3163 var
= TREE_CHAIN (var
))
3165 tree decl
= TREE_VALUE (var
);
3166 tree init
= TREE_PURPOSE (var
);
3168 /* Deal gracefully with error. */
3169 if (decl
== error_mark_node
)
3172 /* The only things that can be initialized are variables. */
3173 my_friendly_assert (TREE_CODE (decl
) == VAR_DECL
, 19990420);
3175 /* If this object is not defined, we don't need to do anything
3177 if (DECL_EXTERNAL (decl
))
3180 /* Also, if the initializer already contains errors, we can bail
3182 if (init
&& TREE_CODE (init
) == TREE_LIST
3183 && value_member (error_mark_node
, init
))
3186 /* This variable is going to need initialization and/or
3187 finalization, so we add it to the list. */
3188 result
= tree_cons (init
, decl
, result
);
3194 /* Make sure we have told the back end about all the variables in
3198 write_out_vars (vars
)
3203 for (v
= vars
; v
; v
= TREE_CHAIN (v
))
3204 if (! TREE_ASM_WRITTEN (TREE_VALUE (v
)))
3205 rest_of_decl_compilation (TREE_VALUE (v
), 0, 1, 1);
3208 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
3209 (otherwise) that will initialize all gobal objects with static
3210 storage duration having the indicated PRIORITY. */
3213 generate_ctor_or_dtor_function (constructor_p
, priority
)
3222 /* We use `I' to indicate initialization and `D' to indicate
3229 /* Begin the function. */
3230 body
= start_objects (function_key
, priority
);
3232 /* Call the static storage duration function with appropriate
3234 for (i
= 0; i
< ssdf_decls
->elements_used
; ++i
)
3236 arguments
= tree_cons (NULL_TREE
, build_int_2 (priority
, 0),
3238 arguments
= tree_cons (NULL_TREE
, build_int_2 (constructor_p
, 0),
3240 finish_expr_stmt (build_function_call (VARRAY_TREE (ssdf_decls
, i
),
3244 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
3245 calls to any functions marked with attributes indicating that
3246 they should be called at initialization- or destruction-time. */
3247 if (priority
== DEFAULT_INIT_PRIORITY
)
3251 for (fns
= constructor_p
? static_ctors
: static_dtors
;
3253 fns
= TREE_CHAIN (fns
))
3254 finish_expr_stmt (build_function_call (TREE_VALUE (fns
), NULL_TREE
));
3257 /* Close out the function. */
3258 finish_objects (function_key
, priority
, body
);
3261 /* Generate constructor and destructor functions for the priority
3265 generate_ctor_and_dtor_functions_for_priority (n
, data
)
3267 void *data ATTRIBUTE_UNUSED
;
3269 int priority
= (int) n
->key
;
3270 priority_info pi
= (priority_info
) n
->value
;
3272 /* Generate the functions themselves, but only if they are really
3274 if (pi
->initializations_p
3275 || (priority
== DEFAULT_INIT_PRIORITY
&& static_ctors
))
3276 generate_ctor_or_dtor_function (/*constructor_p=*/1,
3278 if (pi
->destructions_p
3279 || (priority
== DEFAULT_INIT_PRIORITY
&& static_dtors
))
3280 generate_ctor_or_dtor_function (/*constructor_p=*/0,
3283 /* Keep iterating. */
3287 /* This routine is called from the last rule in yyparse ().
3288 Its job is to create all the code needed to initialize and
3289 destroy the global aggregates. We do the destruction
3290 first, since that way we only need to reverse the decls once. */
3301 /* Bad parse errors. Just forget about it. */
3302 if (! global_bindings_p () || current_class_type
|| decl_namespace_list
)
3305 /* Otherwise, GDB can get confused, because in only knows
3306 about source for LINENO-1 lines. */
3309 interface_unknown
= 1;
3312 /* We now have to write out all the stuff we put off writing out.
3315 o Template specializations that we have not yet instantiated,
3316 but which are needed.
3317 o Initialization and destruction for non-local objects with
3318 static storage duration. (Local objects with static storage
3319 duration are initialized when their scope is first entered,
3320 and are cleaned up via atexit.)
3321 o Virtual function tables.
3323 All of these may cause others to be needed. For example,
3324 instantiating one function may cause another to be needed, and
3325 generating the intiailzer for an object may cause templates to be
3326 instantiated, etc., etc. */
3328 timevar_push (TV_VARCONST
);
3330 emit_support_tinfos ();
3336 /* If there are templates that we've put off instantiating, do
3338 instantiate_pending_templates ();
3340 /* Write out virtual tables as required. Note that writing out
3341 the virtual table for a template class may cause the
3342 instantiation of members of that class. */
3343 if (walk_globals (vtable_decl_p
,
3344 finish_vtable_vardecl
,
3348 /* Write out needed type info variables. Writing out one variable
3349 might cause others to be needed. */
3350 if (walk_globals (tinfo_decl_p
, emit_tinfo_decl
, /*data=*/0))
3353 /* The list of objects with static storage duration is built up
3354 in reverse order. We clear STATIC_AGGREGATES so that any new
3355 aggregates added during the initialization of these will be
3356 initialized in the correct order when we next come around the
3358 vars
= prune_vars_needing_no_initialization (static_aggregates
);
3359 static_aggregates
= NULL_TREE
;
3365 /* We need to start a new initialization function each time
3366 through the loop. That's because we need to know which
3367 vtables have been referenced, and TREE_SYMBOL_REFERENCED
3368 isn't computed until a function is finished, and written
3369 out. That's a deficiency in the back-end. When this is
3370 fixed, these initialization functions could all become
3371 inline, with resulting performance improvements. */
3372 tree ssdf_body
= start_static_storage_duration_function ();
3374 /* Make sure the back end knows about all the variables. */
3375 write_out_vars (vars
);
3377 /* First generate code to do all the initializations. */
3378 for (v
= vars
; v
; v
= TREE_CHAIN (v
))
3379 do_static_initialization (TREE_VALUE (v
),
3382 /* Then, generate code to do all the destructions. Do these
3383 in reverse order so that the most recently constructed
3384 variable is the first destroyed. If we're using
3385 __cxa_atexit, then we don't need to do this; functions
3386 were registered at initialization time to destroy the
3388 if (!flag_use_cxa_atexit
)
3390 vars
= nreverse (vars
);
3391 for (v
= vars
; v
; v
= TREE_CHAIN (v
))
3392 do_static_destruction (TREE_VALUE (v
));
3397 /* Finish up the static storage duration function for this
3399 finish_static_storage_duration_function (ssdf_body
);
3401 /* All those initializations and finalizations might cause
3402 us to need more inline functions, more template
3403 instantiations, etc. */
3407 /* Go through the various inline functions, and see if any need
3409 for (i
= 0; i
< deferred_fns_used
; ++i
)
3411 tree decl
= VARRAY_TREE (deferred_fns
, i
);
3412 import_export_decl (decl
);
3413 if (DECL_ARTIFICIAL (decl
) && ! DECL_INITIAL (decl
)
3415 && (! DECL_REALLY_EXTERN (decl
) || DECL_INLINE (decl
)))
3417 /* Even though we're already at the top-level, we push
3418 there again. That way, when we pop back a few lines
3419 hence, all of our state is restored. Otherwise,
3420 finish_function doesn't clean things up, and we end
3421 up with CURRENT_FUNCTION_DECL set. */
3422 push_to_top_level ();
3423 synthesize_method (decl
);
3424 pop_from_top_level ();
3429 /* We lie to the back-end, pretending that some functions are
3430 not defined when they really are. This keeps these functions
3431 from being put out unnecessarily. But, we must stop lying
3432 when the functions are referenced, or if they are not comdat
3433 since they need to be put out now.
3434 This is done in a separate for cycle, because if some deferred
3435 function is contained in another deferred function later in
3436 deferred_fns varray, rest_of_compilation would skip this
3437 function and we really cannot expand the same function twice. */
3438 for (i
= 0; i
< deferred_fns_used
; ++i
)
3440 tree decl
= VARRAY_TREE (deferred_fns
, i
);
3442 if (DECL_NOT_REALLY_EXTERN (decl
)
3443 && DECL_INITIAL (decl
)
3444 && DECL_NEEDED_P (decl
))
3445 DECL_EXTERNAL (decl
) = 0;
3448 for (i
= 0; i
< deferred_fns_used
; ++i
)
3450 tree decl
= VARRAY_TREE (deferred_fns
, i
);
3452 /* If we're going to need to write this function out, and
3453 there's already a body for it, create RTL for it now.
3454 (There might be no body if this is a method we haven't
3455 gotten around to synthesizing yet.) */
3456 if (!DECL_EXTERNAL (decl
)
3457 && DECL_NEEDED_P (decl
)
3458 && DECL_SAVED_TREE (decl
)
3459 && !TREE_ASM_WRITTEN (decl
))
3461 int saved_not_really_extern
;
3463 /* When we call finish_function in expand_body, it will
3464 try to reset DECL_NOT_REALLY_EXTERN so we save and
3466 saved_not_really_extern
= DECL_NOT_REALLY_EXTERN (decl
);
3467 /* Generate RTL for this function now that we know we
3470 /* Undo the damage done by finish_function. */
3471 DECL_EXTERNAL (decl
) = 0;
3472 DECL_NOT_REALLY_EXTERN (decl
) = saved_not_really_extern
;
3473 /* If we're compiling -fsyntax-only pretend that this
3474 function has been written out so that we don't try to
3476 if (flag_syntax_only
)
3477 TREE_ASM_WRITTEN (decl
) = 1;
3482 if (deferred_fns_used
3483 && wrapup_global_declarations (&VARRAY_TREE (deferred_fns
, 0),
3486 if (walk_namespaces (wrapup_globals_for_namespace
, /*data=*/0))
3489 /* Static data members are just like namespace-scope globals. */
3490 for (i
= 0; i
< pending_statics_used
; ++i
)
3492 tree decl
= VARRAY_TREE (pending_statics
, i
);
3493 if (TREE_ASM_WRITTEN (decl
))
3495 import_export_decl (decl
);
3496 if (DECL_NOT_REALLY_EXTERN (decl
) && ! DECL_IN_AGGR_P (decl
))
3497 DECL_EXTERNAL (decl
) = 0;
3500 && wrapup_global_declarations (&VARRAY_TREE (pending_statics
, 0),
3501 pending_statics_used
))
3506 /* We give C linkage to static constructors and destructors. */
3507 push_lang_context (lang_name_c
);
3509 /* Generate initialization and destruction functions for all
3510 priorities for which they are required. */
3511 if (priority_info_map
)
3512 splay_tree_foreach (priority_info_map
,
3513 generate_ctor_and_dtor_functions_for_priority
,
3516 /* We're done with the splay-tree now. */
3517 if (priority_info_map
)
3518 splay_tree_delete (priority_info_map
);
3520 /* We're done with static constructors, so we can go back to "C++"
3522 pop_lang_context ();
3524 /* Now delete from the chain of variables all virtual function tables.
3525 We output them all ourselves, because each will be treated
3526 specially. We don't do this if we're just doing semantic
3527 analysis, and not code-generation. */
3528 if (!flag_syntax_only
)
3529 walk_globals (vtable_decl_p
, prune_vtable_vardecl
, /*data=*/0);
3531 /* Now, issue warnings about static, but not defined, functions,
3532 etc., and emit debugging information. */
3533 walk_namespaces (wrapup_globals_for_namespace
, /*data=*/&reconsider
);
3534 if (pending_statics
)
3535 check_global_declarations (&VARRAY_TREE (pending_statics
, 0),
3536 pending_statics_used
);
3540 /* The entire file is now complete. If requested, dump everything
3544 FILE *stream
= dump_begin (TDI_all
, &flags
);
3548 dump_node (global_namespace
, flags
& ~TDF_SLIM
, stream
);
3549 dump_end (TDI_all
, stream
);
3553 timevar_pop (TV_VARCONST
);
3555 if (flag_detailed_statistics
)
3557 dump_tree_statistics ();
3558 dump_time_statistics ();
3562 /* This is something of the form 'A()()()()()+1' that has turned out to be an
3563 expr. Since it was parsed like a type, we need to wade through and fix
3564 that. Unfortunately, since operator() is left-associative, we can't use
3565 tail recursion. In the above example, TYPE is `A', and DECL is
3568 Maybe this shouldn't be recursive, but how often will it actually be
3572 reparse_absdcl_as_expr (type
, decl
)
3575 /* do build_functional_cast (type, NULL_TREE) at bottom */
3576 if (TREE_OPERAND (decl
, 0) == NULL_TREE
)
3577 return build_functional_cast (type
, NULL_TREE
);
3580 decl
= reparse_absdcl_as_expr (type
, TREE_OPERAND (decl
, 0));
3582 decl
= build_x_function_call (decl
, NULL_TREE
, current_class_ref
);
3584 if (TREE_CODE (decl
) == CALL_EXPR
3585 && (! TREE_TYPE (decl
)
3586 || TREE_CODE (TREE_TYPE (decl
)) != VOID_TYPE
))
3587 decl
= require_complete_type (decl
);
3592 /* This is something of the form `int ((int)(int)(int)1)' that has turned
3593 out to be an expr. Since it was parsed like a type, we need to wade
3594 through and fix that. Since casts are right-associative, we are
3595 reversing the order, so we don't have to recurse.
3597 In the above example, DECL is the `(int)(int)(int)', and EXPR is the
3601 reparse_absdcl_as_casts (decl
, expr
)
3607 if (TREE_CODE (expr
) == CONSTRUCTOR
3608 && TREE_TYPE (expr
) == 0)
3610 type
= groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl
)));
3611 decl
= TREE_OPERAND (decl
, 0);
3613 if (processing_template_decl
)
3614 TREE_TYPE (expr
) = type
;
3617 expr
= digest_init (type
, expr
, (tree
*) 0);
3618 if (TREE_CODE (type
) == ARRAY_TYPE
&& !COMPLETE_TYPE_P (type
))
3620 int failure
= complete_array_type (type
, expr
, 1);
3621 my_friendly_assert (!failure
, 78);
3628 type
= groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl
)));
3629 decl
= TREE_OPERAND (decl
, 0);
3630 if (!VOID_TYPE_P (type
))
3632 expr
= build_c_cast (type
, expr
);
3635 if (warn_old_style_cast
&& ! in_system_header
3636 && non_void_p
&& current_lang_name
!= lang_name_c
)
3637 warning ("use of old-style cast");
3642 /* Given plain tree nodes for an expression, build up the full semantics. */
3645 build_expr_from_tree (t
)
3648 if (t
== NULL_TREE
|| t
== error_mark_node
)
3651 switch (TREE_CODE (t
))
3653 case IDENTIFIER_NODE
:
3654 return do_identifier (t
, 0, NULL_TREE
);
3657 if (LOOKUP_EXPR_GLOBAL (t
))
3658 return do_scoped_id (TREE_OPERAND (t
, 0), 0);
3660 return do_identifier (TREE_OPERAND (t
, 0), 0, NULL_TREE
);
3662 case TEMPLATE_ID_EXPR
:
3663 return (lookup_template_function
3664 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3665 build_expr_from_tree (TREE_OPERAND (t
, 1))));
3668 return build_x_indirect_ref
3669 (build_expr_from_tree (TREE_OPERAND (t
, 0)), "unary *");
3672 return build_functional_cast
3673 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3675 case REINTERPRET_CAST_EXPR
:
3676 return build_reinterpret_cast
3677 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3679 case CONST_CAST_EXPR
:
3680 return build_const_cast
3681 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3683 case DYNAMIC_CAST_EXPR
:
3684 return build_dynamic_cast
3685 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3687 case STATIC_CAST_EXPR
:
3688 return build_static_cast
3689 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3691 case PREDECREMENT_EXPR
:
3692 case PREINCREMENT_EXPR
:
3693 case POSTDECREMENT_EXPR
:
3694 case POSTINCREMENT_EXPR
:
3698 case TRUTH_NOT_EXPR
:
3700 case CONVERT_EXPR
: /* Unary + */
3705 return build_x_unary_op (TREE_CODE (t
),
3706 build_expr_from_tree (TREE_OPERAND (t
, 0)));
3711 case TRUNC_DIV_EXPR
:
3713 case FLOOR_DIV_EXPR
:
3714 case ROUND_DIV_EXPR
:
3715 case EXACT_DIV_EXPR
:
3717 case BIT_ANDTC_EXPR
:
3720 case TRUNC_MOD_EXPR
:
3721 case FLOOR_MOD_EXPR
:
3722 case TRUTH_ANDIF_EXPR
:
3723 case TRUTH_ORIF_EXPR
:
3724 case TRUTH_AND_EXPR
:
3739 return build_x_binary_op
3741 build_expr_from_tree (TREE_OPERAND (t
, 0)),
3742 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3745 return build_m_component_ref
3746 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3747 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3750 return build_offset_ref (TREE_OPERAND (t
, 0), TREE_OPERAND (t
, 1));
3753 if (TREE_OPERAND (t
, 0) == NULL_TREE
)
3755 return build_nt (ARRAY_REF
, NULL_TREE
,
3756 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3757 return grok_array_decl (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3758 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3763 tree r
= build_expr_from_tree (TREE_OPERAND (t
, 0));
3765 return TREE_CODE (t
) == SIZEOF_EXPR
? expr_sizeof (r
) : c_alignof_expr (r
);
3767 return TREE_CODE (t
) == SIZEOF_EXPR
? c_sizeof (r
) : c_alignof (r
);
3771 return build_x_modify_expr
3772 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3773 TREE_CODE (TREE_OPERAND (t
, 1)),
3774 build_expr_from_tree (TREE_OPERAND (t
, 2)));
3777 return build_x_arrow
3778 (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3782 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3783 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3784 build_expr_from_tree (TREE_OPERAND (t
, 2)),
3785 NEW_EXPR_USE_GLOBAL (t
));
3788 return delete_sanity
3789 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3790 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3791 DELETE_EXPR_USE_VEC (t
), DELETE_EXPR_USE_GLOBAL (t
));
3794 if (TREE_OPERAND (t
, 1) == NULL_TREE
)
3795 return build_x_compound_expr
3796 (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3800 case METHOD_CALL_EXPR
:
3801 if (TREE_CODE (TREE_OPERAND (t
, 0)) == SCOPE_REF
)
3803 tree ref
= TREE_OPERAND (t
, 0);
3804 tree name
= TREE_OPERAND (ref
, 1);
3806 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3807 name
= build_nt (TEMPLATE_ID_EXPR
,
3808 TREE_OPERAND (name
, 0),
3809 build_expr_from_tree (TREE_OPERAND (name
, 1)));
3811 return build_scoped_method_call
3812 (build_expr_from_tree (TREE_OPERAND (t
, 1)),
3813 build_expr_from_tree (TREE_OPERAND (ref
, 0)),
3815 build_expr_from_tree (TREE_OPERAND (t
, 2)));
3819 tree fn
= TREE_OPERAND (t
, 0);
3821 /* We can get a TEMPLATE_ID_EXPR here on code like:
3825 so we must resolve that. However, we can also get things
3826 like a BIT_NOT_EXPR here, when referring to a destructor,
3827 and things like that are not correctly resolved by
3828 build_expr_from_tree. So, just use build_expr_from_tree
3829 when we really need it. */
3830 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3831 fn
= lookup_template_function
3832 (TREE_OPERAND (fn
, 0),
3833 build_expr_from_tree (TREE_OPERAND (fn
, 1)));
3835 return build_method_call
3836 (build_expr_from_tree (TREE_OPERAND (t
, 1)),
3838 build_expr_from_tree (TREE_OPERAND (t
, 2)),
3839 NULL_TREE
, LOOKUP_NORMAL
);
3843 if (TREE_CODE (TREE_OPERAND (t
, 0)) == SCOPE_REF
)
3845 tree ref
= TREE_OPERAND (t
, 0);
3846 tree name
= TREE_OPERAND (ref
, 1);
3848 if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
3849 name
= build_nt (TEMPLATE_ID_EXPR
,
3850 TREE_OPERAND (name
, 0),
3851 build_expr_from_tree (TREE_OPERAND (name
, 1)));
3853 return build_member_call
3854 (build_expr_from_tree (TREE_OPERAND (ref
, 0)),
3856 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3860 tree name
= TREE_OPERAND (t
, 0);
3862 tree args
= build_expr_from_tree (TREE_OPERAND (t
, 1));
3863 if (args
!= NULL_TREE
&& TREE_CODE (name
) == LOOKUP_EXPR
3864 && !LOOKUP_EXPR_GLOBAL (name
)
3865 && TREE_CODE ((id
= TREE_OPERAND (name
, 0))) == IDENTIFIER_NODE
3866 && (!current_class_type
3867 || !lookup_member (current_class_type
, id
, 0, 0)))
3869 /* Do Koenig lookup if there are no class members. */
3870 name
= do_identifier (id
, 0, args
);
3872 else if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
3873 || ! really_overloaded_fn (name
))
3874 name
= build_expr_from_tree (name
);
3875 return build_x_function_call (name
, args
, current_class_ref
);
3879 return build_x_conditional_expr
3880 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3881 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3882 build_expr_from_tree (TREE_OPERAND (t
, 2)));
3884 case PSEUDO_DTOR_EXPR
:
3885 return (finish_pseudo_destructor_call_expr
3886 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3887 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3888 build_expr_from_tree (TREE_OPERAND (t
, 2))));
3892 tree purpose
, value
, chain
;
3894 if (t
== void_list_node
)
3897 purpose
= TREE_PURPOSE (t
);
3899 purpose
= build_expr_from_tree (purpose
);
3900 value
= TREE_VALUE (t
);
3902 value
= build_expr_from_tree (value
);
3903 chain
= TREE_CHAIN (t
);
3904 if (chain
&& chain
!= void_type_node
)
3905 chain
= build_expr_from_tree (chain
);
3906 return tree_cons (purpose
, value
, chain
);
3911 tree object
= build_expr_from_tree (TREE_OPERAND (t
, 0));
3912 tree field
= TREE_OPERAND (t
, 1);
3914 /* We use a COMPONENT_REF to indicate things of the form `x.b'
3915 and `x.A::b'. We must distinguish between those cases
3917 if (TREE_CODE (field
) == SCOPE_REF
)
3918 return build_object_ref (object
,
3919 TREE_OPERAND (field
, 0),
3920 TREE_OPERAND (field
, 1));
3922 return build_x_component_ref (object
, field
,
3927 return build_throw (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3933 tree type
= TREE_TYPE (t
);
3936 /* digest_init will do the wrong thing if we let it. */
3937 if (type
&& TYPE_PTRMEMFUNC_P (type
))
3941 /* We do not want to process the purpose of aggregate
3942 initializers as they are identifier nodes which will be
3943 looked up by digest_init. */
3944 purpose_p
= !(type
&& IS_AGGR_TYPE (type
));
3945 for (elts
= CONSTRUCTOR_ELTS (t
); elts
; elts
= TREE_CHAIN (elts
))
3947 tree purpose
= TREE_PURPOSE (elts
);
3948 tree value
= TREE_VALUE (elts
);
3950 if (purpose
&& purpose_p
)
3951 purpose
= build_expr_from_tree (purpose
);
3952 value
= build_expr_from_tree (value
);
3953 r
= tree_cons (purpose
, value
, r
);
3956 r
= build_nt (CONSTRUCTOR
, NULL_TREE
, nreverse (r
));
3957 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
3960 return digest_init (type
, r
, 0);
3965 if (TYPE_P (TREE_OPERAND (t
, 0)))
3966 return get_typeid (TREE_OPERAND (t
, 0));
3967 return build_typeid (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3970 return convert_from_reference (t
);
3973 return build_va_arg (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3981 /* This is something of the form `int (*a)++' that has turned out to be an
3982 expr. It was only converted into parse nodes, so we need to go through
3983 and build up the semantics. Most of the work is done by
3984 build_expr_from_tree, above.
3986 In the above example, TYPE is `int' and DECL is `*a'. */
3989 reparse_decl_as_expr (type
, decl
)
3992 decl
= build_expr_from_tree (decl
);
3994 return build_functional_cast (type
, build_tree_list (NULL_TREE
, decl
));
3999 /* This is something of the form `int (*a)' that has turned out to be a
4000 decl. It was only converted into parse nodes, so we need to do the
4001 checking that make_{pointer,reference}_declarator do. */
4004 finish_decl_parsing (decl
)
4007 switch (TREE_CODE (decl
))
4009 case IDENTIFIER_NODE
:
4012 return make_pointer_declarator
4013 (NULL_TREE
, finish_decl_parsing (TREE_OPERAND (decl
, 0)));
4015 return make_reference_declarator
4016 (NULL_TREE
, finish_decl_parsing (TREE_OPERAND (decl
, 0)));
4018 TREE_OPERAND (decl
, 0) = finish_decl_parsing (TREE_OPERAND (decl
, 0));
4021 push_nested_class (TREE_TYPE (TREE_OPERAND (decl
, 0)), 3);
4022 TREE_COMPLEXITY (decl
) = current_class_depth
;
4025 TREE_OPERAND (decl
, 0) = finish_decl_parsing (TREE_OPERAND (decl
, 0));
4028 /* For attribute handling. */
4029 TREE_VALUE (decl
) = finish_decl_parsing (TREE_VALUE (decl
));
4031 case TEMPLATE_ID_EXPR
:
4039 /* Return 1 if root encloses child. */
4042 is_namespace_ancestor (root
, child
)
4047 if (root
== global_namespace
)
4049 if (child
== global_namespace
)
4051 return is_namespace_ancestor (root
, CP_DECL_CONTEXT (child
));
4055 /* Return the namespace that is the common ancestor
4056 of two given namespaces. */
4059 namespace_ancestor (ns1
, ns2
)
4062 if (is_namespace_ancestor (ns1
, ns2
))
4064 return namespace_ancestor (CP_DECL_CONTEXT (ns1
), ns2
);
4067 /* Insert used into the using list of user. Set indirect_flag if this
4068 directive is not directly from the source. Also find the common
4069 ancestor and let our users know about the new namespace */
4071 add_using_namespace (user
, used
, indirect
)
4077 /* Using oneself is a no-op. */
4080 my_friendly_assert (TREE_CODE (user
) == NAMESPACE_DECL
, 380);
4081 my_friendly_assert (TREE_CODE (used
) == NAMESPACE_DECL
, 380);
4082 /* Check if we already have this. */
4083 t
= purpose_member (used
, DECL_NAMESPACE_USING (user
));
4087 /* Promote to direct usage. */
4088 TREE_INDIRECT_USING (t
) = 0;
4092 /* Add used to the user's using list. */
4093 DECL_NAMESPACE_USING (user
)
4094 = tree_cons (used
, namespace_ancestor (user
, used
),
4095 DECL_NAMESPACE_USING (user
));
4097 TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user
)) = indirect
;
4099 /* Add user to the used's users list. */
4100 DECL_NAMESPACE_USERS (used
)
4101 = tree_cons (user
, 0, DECL_NAMESPACE_USERS (used
));
4103 /* Recursively add all namespaces used. */
4104 for (t
= DECL_NAMESPACE_USING (used
); t
; t
= TREE_CHAIN (t
))
4105 /* indirect usage */
4106 add_using_namespace (user
, TREE_PURPOSE (t
), 1);
4108 /* Tell everyone using us about the new used namespaces. */
4109 for (t
= DECL_NAMESPACE_USERS (user
); t
; t
= TREE_CHAIN (t
))
4110 add_using_namespace (TREE_PURPOSE (t
), used
, 1);
4113 /* Combines two sets of overloaded functions into an OVERLOAD chain, removing
4114 duplicates. The first list becomes the tail of the result.
4116 The algorithm is O(n^2). We could get this down to O(n log n) by
4117 doing a sort on the addresses of the functions, if that becomes
4121 merge_functions (s1
, s2
)
4125 for (; s2
; s2
= OVL_NEXT (s2
))
4127 tree fn2
= OVL_CURRENT (s2
);
4130 for (fns1
= s1
; fns1
; fns1
= OVL_NEXT (fns1
))
4132 tree fn1
= OVL_CURRENT (fns1
);
4134 /* If the function from S2 is already in S1, there is no
4135 need to add it again. For `extern "C"' functions, we
4136 might have two FUNCTION_DECLs for the same function, in
4137 different namespaces; again, we only need one of them. */
4139 || (DECL_EXTERN_C_P (fn1
) && DECL_EXTERN_C_P (fn2
)
4140 && DECL_NAME (fn1
) == DECL_NAME (fn2
)))
4144 /* If we exhausted all of the functions in S1, FN2 is new. */
4146 s1
= build_overload (fn2
, s1
);
4151 /* This should return an error not all definitions define functions.
4152 It is not an error if we find two functions with exactly the
4153 same signature, only if these are selected in overload resolution.
4154 old is the current set of bindings, new the freshly-found binding.
4155 XXX Do we want to give *all* candidates in case of ambiguity?
4156 XXX In what way should I treat extern declarations?
4157 XXX I don't want to repeat the entire duplicate_decls here */
4160 ambiguous_decl (name
, old
, new, flags
)
4167 my_friendly_assert (old
!= NULL_TREE
, 393);
4168 /* Copy the value. */
4169 val
= BINDING_VALUE (new);
4171 switch (TREE_CODE (val
))
4174 /* If we expect types or namespaces, and not templates,
4175 or this is not a template class. */
4176 if (LOOKUP_QUALIFIERS_ONLY (flags
)
4177 && !DECL_CLASS_TEMPLATE_P (val
))
4181 if (LOOKUP_NAMESPACES_ONLY (flags
))
4184 case NAMESPACE_DECL
:
4185 if (LOOKUP_TYPES_ONLY (flags
))
4189 /* Ignore built-in functions that are still anticipated. */
4190 if (LOOKUP_QUALIFIERS_ONLY (flags
) || DECL_ANTICIPATED (val
))
4194 if (LOOKUP_QUALIFIERS_ONLY (flags
))
4198 if (!BINDING_VALUE (old
))
4199 BINDING_VALUE (old
) = val
;
4200 else if (val
&& val
!= BINDING_VALUE (old
))
4202 if (is_overloaded_fn (BINDING_VALUE (old
))
4203 && is_overloaded_fn (val
))
4205 BINDING_VALUE (old
) = merge_functions (BINDING_VALUE (old
),
4210 /* Some declarations are functions, some are not. */
4211 if (flags
& LOOKUP_COMPLAIN
)
4213 /* If we've already given this error for this lookup,
4214 BINDING_VALUE (old) is error_mark_node, so let's not
4215 repeat ourselves. */
4216 if (BINDING_VALUE (old
) != error_mark_node
)
4218 error ("use of `%D' is ambiguous", name
);
4219 cp_error_at (" first declared as `%#D' here",
4220 BINDING_VALUE (old
));
4222 cp_error_at (" also declared as `%#D' here", val
);
4224 BINDING_VALUE (old
) = error_mark_node
;
4227 /* ... and copy the type. */
4228 type
= BINDING_TYPE (new);
4229 if (LOOKUP_NAMESPACES_ONLY (flags
))
4231 if (!BINDING_TYPE (old
))
4232 BINDING_TYPE (old
) = type
;
4233 else if (type
&& BINDING_TYPE (old
) != type
)
4235 if (flags
& LOOKUP_COMPLAIN
)
4237 error ("`%D' denotes an ambiguous type",name
);
4238 cp_error_at (" first type here", BINDING_TYPE (old
));
4239 cp_error_at (" other type here", type
);
4245 /* Subroutine of unualified_namespace_lookup:
4246 Add the bindings of NAME in used namespaces to VAL.
4247 We are currently looking for names in namespace SCOPE, so we
4248 look through USINGS for using-directives of namespaces
4249 which have SCOPE as a common ancestor with the current scope.
4250 Returns zero on errors. */
4253 lookup_using_namespace (name
, val
, usings
, scope
, flags
, spacesp
)
4254 tree name
, val
, usings
, scope
;
4260 /* Iterate over all used namespaces in current, searching for using
4261 directives of scope. */
4262 for (iter
= usings
; iter
; iter
= TREE_CHAIN (iter
))
4263 if (TREE_VALUE (iter
) == scope
)
4266 *spacesp
= tree_cons (TREE_PURPOSE (iter
), NULL_TREE
,
4268 val1
= binding_for_name (name
, TREE_PURPOSE (iter
));
4269 /* Resolve ambiguities. */
4270 val
= ambiguous_decl (name
, val
, val1
, flags
);
4272 return BINDING_VALUE (val
) != error_mark_node
;
4276 Accepts the NAME to lookup and its qualifying SCOPE.
4277 Returns the name/type pair found into the CPLUS_BINDING RESULT,
4281 qualified_lookup_using_namespace (name
, scope
, result
, flags
)
4287 /* Maintain a list of namespaces visited... */
4288 tree seen
= NULL_TREE
;
4289 /* ... and a list of namespace yet to see. */
4290 tree todo
= NULL_TREE
;
4292 /* Look through namespace aliases. */
4293 scope
= ORIGINAL_NAMESPACE (scope
);
4294 while (scope
&& (result
!= error_mark_node
))
4296 seen
= tree_cons (scope
, NULL_TREE
, seen
);
4297 result
= ambiguous_decl (name
, result
,
4298 binding_for_name (name
, scope
), flags
);
4299 if (!BINDING_VALUE (result
) && !BINDING_TYPE (result
))
4300 /* Consider using directives. */
4301 for (usings
= DECL_NAMESPACE_USING (scope
); usings
;
4302 usings
= TREE_CHAIN (usings
))
4303 /* If this was a real directive, and we have not seen it. */
4304 if (!TREE_INDIRECT_USING (usings
)
4305 && !purpose_member (TREE_PURPOSE (usings
), seen
))
4306 todo
= tree_cons (TREE_PURPOSE (usings
), NULL_TREE
, todo
);
4309 scope
= TREE_PURPOSE (todo
);
4310 todo
= TREE_CHAIN (todo
);
4313 scope
= NULL_TREE
; /* If there never was a todo list. */
4315 return result
!= error_mark_node
;
4318 /* [namespace.memdef]/2 */
4320 /* Set the context of a declaration to scope. Complain if we are not
4324 set_decl_namespace (decl
, scope
, friendp
)
4331 /* Get rid of namespace aliases. */
4332 scope
= ORIGINAL_NAMESPACE (scope
);
4334 /* It is ok for friends to be qualified in parallel space. */
4335 if (!friendp
&& !is_namespace_ancestor (current_namespace
, scope
))
4336 error ("declaration of `%D' not in a namespace surrounding `%D'",
4338 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
4339 if (scope
!= current_namespace
)
4341 /* See whether this has been declared in the namespace. */
4342 old
= namespace_binding (DECL_NAME (decl
), scope
);
4344 /* No old declaration at all. */
4346 /* A template can be explicitly specialized in any namespace. */
4347 if (processing_explicit_instantiation
)
4349 if (!is_overloaded_fn (decl
))
4350 /* Don't compare non-function decls with decls_match here,
4351 since it can't check for the correct constness at this
4352 point. pushdecl will find those errors later. */
4354 /* Since decl is a function, old should contain a function decl. */
4355 if (!is_overloaded_fn (old
))
4357 if (processing_template_decl
|| processing_specialization
)
4358 /* We have not yet called push_template_decl to turn the
4359 FUNCTION_DECL into a TEMPLATE_DECL, so the declarations
4360 won't match. But, we'll check later, when we construct the
4363 for (; old
; old
= OVL_NEXT (old
))
4364 if (decls_match (decl
, OVL_CURRENT (old
)))
4370 error ("`%D' should have been declared inside `%D'",
4374 /* Compute the namespace where a declaration is defined. */
4377 decl_namespace (decl
)
4381 decl
= TYPE_STUB_DECL (decl
);
4382 while (DECL_CONTEXT (decl
))
4384 decl
= DECL_CONTEXT (decl
);
4385 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
4388 decl
= TYPE_STUB_DECL (decl
);
4389 my_friendly_assert (DECL_P (decl
), 390);
4392 return global_namespace
;
4395 /* Return the namespace where the current declaration is declared. */
4398 current_decl_namespace ()
4401 /* If we have been pushed into a different namespace, use it. */
4402 if (decl_namespace_list
)
4403 return TREE_PURPOSE (decl_namespace_list
);
4405 if (current_class_type
)
4406 result
= decl_namespace (TYPE_STUB_DECL (current_class_type
));
4407 else if (current_function_decl
)
4408 result
= decl_namespace (current_function_decl
);
4410 result
= current_namespace
;
4414 /* Temporarily set the namespace for the current declaration. */
4417 push_decl_namespace (decl
)
4420 if (TREE_CODE (decl
) != NAMESPACE_DECL
)
4421 decl
= decl_namespace (decl
);
4422 decl_namespace_list
= tree_cons (ORIGINAL_NAMESPACE (decl
),
4423 NULL_TREE
, decl_namespace_list
);
4427 pop_decl_namespace ()
4429 decl_namespace_list
= TREE_CHAIN (decl_namespace_list
);
4432 /* Enter a class or namespace scope. */
4438 if (TREE_CODE (t
) == NAMESPACE_DECL
)
4439 push_decl_namespace (t
);
4444 /* Leave scope pushed by push_scope. */
4450 if (TREE_CODE (t
) == NAMESPACE_DECL
)
4451 pop_decl_namespace ();
4456 /* [basic.lookup.koenig] */
4457 /* A non-zero return value in the functions below indicates an error.
4458 All nodes allocated in the procedure are on the scratch obstack. */
4468 static int arg_assoc
PARAMS ((struct arg_lookup
*, tree
));
4469 static int arg_assoc_args
PARAMS ((struct arg_lookup
*, tree
));
4470 static int arg_assoc_type
PARAMS ((struct arg_lookup
*, tree
));
4471 static int add_function
PARAMS ((struct arg_lookup
*, tree
));
4472 static int arg_assoc_namespace
PARAMS ((struct arg_lookup
*, tree
));
4473 static int arg_assoc_class
PARAMS ((struct arg_lookup
*, tree
));
4474 static int arg_assoc_template_arg
PARAMS ((struct arg_lookup
*, tree
));
4476 /* Add a function to the lookup structure.
4477 Returns 1 on error. */
4480 add_function (k
, fn
)
4481 struct arg_lookup
*k
;
4484 /* We used to check here to see if the function was already in the list,
4485 but that's O(n^2), which is just too expensive for function lookup.
4486 Now we deal with the occasional duplicate in joust. In doing this, we
4487 assume that the number of duplicates will be small compared to the
4488 total number of functions being compared, which should usually be the
4491 /* We must find only functions, or exactly one non-function. */
4494 else if (is_overloaded_fn (k
->functions
) && is_overloaded_fn (fn
))
4495 k
->functions
= build_overload (fn
, k
->functions
);
4498 tree f1
= OVL_CURRENT (k
->functions
);
4500 if (is_overloaded_fn (f1
))
4502 fn
= f1
; f1
= f2
; f2
= fn
;
4504 cp_error_at ("`%D' is not a function,", f1
);
4505 cp_error_at (" conflict with `%D'", f2
);
4506 error (" in call to `%D'", k
->name
);
4513 /* Add functions of a namespace to the lookup structure.
4514 Returns 1 on error. */
4517 arg_assoc_namespace (k
, scope
)
4518 struct arg_lookup
*k
;
4523 if (purpose_member (scope
, k
->namespaces
))
4525 k
->namespaces
= tree_cons (scope
, NULL_TREE
, k
->namespaces
);
4527 value
= namespace_binding (k
->name
, scope
);
4531 for (; value
; value
= OVL_NEXT (value
))
4532 if (add_function (k
, OVL_CURRENT (value
)))
4538 /* Adds everything associated with a template argument to the lookup
4539 structure. Returns 1 on error. */
4542 arg_assoc_template_arg (k
, arg
)
4543 struct arg_lookup
* k
;
4546 /* [basic.lookup.koenig]
4548 If T is a template-id, its associated namespaces and classes are
4549 ... the namespaces and classes associated with the types of the
4550 template arguments provided for template type parameters
4551 (excluding template template parameters); the namespaces in which
4552 any template template arguments are defined; and the classes in
4553 which any member templates used as template template arguments
4554 are defined. [Note: non-type template arguments do not
4555 contribute to the set of associated namespaces. ] */
4557 /* Consider first template template arguments. */
4558 if (TREE_CODE (arg
) == TEMPLATE_TEMPLATE_PARM
4559 || TREE_CODE (arg
) == UNBOUND_CLASS_TEMPLATE
)
4561 else if (TREE_CODE (arg
) == TEMPLATE_DECL
)
4563 tree ctx
= CP_DECL_CONTEXT (arg
);
4565 /* It's not a member template. */
4566 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
4567 return arg_assoc_namespace (k
, ctx
);
4568 /* Otherwise, it must be member template. */
4570 return arg_assoc_class (k
, ctx
);
4572 /* It's not a template template argument, but it is a type template
4574 else if (TYPE_P (arg
))
4575 return arg_assoc_type (k
, arg
);
4576 /* It's a non-type template argument. */
4581 /* Adds everything associated with class to the lookup structure.
4582 Returns 1 on error. */
4585 arg_assoc_class (k
, type
)
4586 struct arg_lookup
* k
;
4589 tree list
, friends
, context
;
4592 /* Backend build structures, such as __builtin_va_list, aren't
4593 affected by all this. */
4594 if (!CLASS_TYPE_P (type
))
4597 if (purpose_member (type
, k
->classes
))
4599 k
->classes
= tree_cons (type
, NULL_TREE
, k
->classes
);
4601 context
= decl_namespace (TYPE_MAIN_DECL (type
));
4602 if (arg_assoc_namespace (k
, context
))
4605 /* Process baseclasses. */
4606 for (i
= 0; i
< CLASSTYPE_N_BASECLASSES (type
); i
++)
4607 if (arg_assoc_class (k
, TYPE_BINFO_BASETYPE (type
, i
)))
4610 /* Process friends. */
4611 for (list
= DECL_FRIENDLIST (TYPE_MAIN_DECL (type
)); list
;
4612 list
= TREE_CHAIN (list
))
4613 if (k
->name
== TREE_PURPOSE (list
))
4614 for (friends
= TREE_VALUE (list
); friends
;
4615 friends
= TREE_CHAIN (friends
))
4616 /* Only interested in global functions with potentially hidden
4617 (i.e. unqualified) declarations. */
4618 if (TREE_PURPOSE (friends
) == error_mark_node
&& TREE_VALUE (friends
)
4619 && decl_namespace (TREE_VALUE (friends
)) == context
)
4620 if (add_function (k
, TREE_VALUE (friends
)))
4623 /* Process template arguments. */
4624 if (CLASSTYPE_TEMPLATE_INFO (type
))
4626 list
= INNERMOST_TEMPLATE_ARGS (CLASSTYPE_TI_ARGS (type
));
4627 for (i
= 0; i
< TREE_VEC_LENGTH (list
); ++i
)
4628 arg_assoc_template_arg (k
, TREE_VEC_ELT (list
, i
));
4634 /* Adds everything associated with a given type.
4635 Returns 1 on error. */
4638 arg_assoc_type (k
, type
)
4639 struct arg_lookup
*k
;
4642 switch (TREE_CODE (type
))
4653 if (TYPE_PTRMEMFUNC_P (type
))
4654 return arg_assoc_type (k
, TYPE_PTRMEMFUNC_FN_TYPE (type
));
4655 return arg_assoc_class (k
, type
);
4657 case REFERENCE_TYPE
:
4659 return arg_assoc_type (k
, TREE_TYPE (type
));
4662 return arg_assoc_namespace (k
, decl_namespace (TYPE_MAIN_DECL (type
)));
4664 /* Pointer to member: associate class type and value type. */
4665 if (arg_assoc_type (k
, TYPE_OFFSET_BASETYPE (type
)))
4667 return arg_assoc_type (k
, TREE_TYPE (type
));
4669 /* The basetype is referenced in the first arg type, so just
4672 /* Associate the parameter types. */
4673 if (arg_assoc_args (k
, TYPE_ARG_TYPES (type
)))
4675 /* Associate the return type. */
4676 return arg_assoc_type (k
, TREE_TYPE (type
));
4677 case TEMPLATE_TYPE_PARM
:
4678 case BOUND_TEMPLATE_TEMPLATE_PARM
:
4683 if (type
== unknown_type_node
)
4685 /* else fall through */
4692 /* Adds everything associated with arguments. Returns 1 on error. */
4695 arg_assoc_args (k
, args
)
4696 struct arg_lookup
* k
;
4699 for (; args
; args
= TREE_CHAIN (args
))
4700 if (arg_assoc (k
, TREE_VALUE (args
)))
4705 /* Adds everything associated with a given tree_node. Returns 1 on error. */
4709 struct arg_lookup
* k
;
4712 if (n
== error_mark_node
)
4716 return arg_assoc_type (k
, n
);
4718 if (! type_unknown_p (n
))
4719 return arg_assoc_type (k
, TREE_TYPE (n
));
4721 if (TREE_CODE (n
) == ADDR_EXPR
)
4722 n
= TREE_OPERAND (n
, 0);
4723 if (TREE_CODE (n
) == COMPONENT_REF
)
4724 n
= TREE_OPERAND (n
, 1);
4725 if (TREE_CODE (n
) == OFFSET_REF
)
4726 n
= TREE_OPERAND (n
, 1);
4727 while (TREE_CODE (n
) == TREE_LIST
)
4730 if (TREE_CODE (n
) == FUNCTION_DECL
)
4731 return arg_assoc_type (k
, TREE_TYPE (n
));
4732 if (TREE_CODE (n
) == TEMPLATE_ID_EXPR
)
4734 /* [basic.lookup.koenig]
4736 If T is a template-id, its associated namespaces and classes
4737 are the namespace in which the template is defined; for
4738 member templates, the member template's class... */
4739 tree
template = TREE_OPERAND (n
, 0);
4740 tree args
= TREE_OPERAND (n
, 1);
4744 if (TREE_CODE (template) == COMPONENT_REF
)
4745 template = TREE_OPERAND (template, 1);
4747 /* First, the template. There may actually be more than one if
4748 this is an overloaded function template. But, in that case,
4749 we only need the first; all the functions will be in the same
4751 template = OVL_CURRENT (template);
4753 ctx
= CP_DECL_CONTEXT (template);
4755 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
4757 if (arg_assoc_namespace (k
, ctx
) == 1)
4760 /* It must be a member template. */
4761 else if (arg_assoc_class (k
, ctx
) == 1)
4764 /* Now the arguments. */
4765 for (arg
= args
; arg
!= NULL_TREE
; arg
= TREE_CHAIN (arg
))
4766 if (arg_assoc_template_arg (k
, TREE_VALUE (arg
)) == 1)
4771 my_friendly_assert (TREE_CODE (n
) == OVERLOAD
, 980715);
4773 for (; n
; n
= OVL_CHAIN (n
))
4774 if (arg_assoc_type (k
, TREE_TYPE (OVL_FUNCTION (n
))))
4781 /* Performs Koenig lookup depending on arguments, where fns
4782 are the functions found in normal lookup. */
4785 lookup_arg_dependent (name
, fns
, args
)
4790 struct arg_lookup k
;
4791 tree fn
= NULL_TREE
;
4795 k
.classes
= NULL_TREE
;
4797 /* Note that we've already looked at some namespaces during normal
4798 unqualified lookup, unless we found a decl in function scope. */
4800 fn
= OVL_CURRENT (fns
);
4801 if (fn
&& TREE_CODE (fn
) == FUNCTION_DECL
&& DECL_LOCAL_FUNCTION_P (fn
))
4802 k
.namespaces
= NULL_TREE
;
4804 unqualified_namespace_lookup (name
, 0, &k
.namespaces
);
4806 arg_assoc_args (&k
, args
);
4810 /* Process a namespace-alias declaration. */
4813 do_namespace_alias (alias
, namespace)
4814 tree alias
, namespace;
4816 if (TREE_CODE (namespace) != NAMESPACE_DECL
)
4818 /* The parser did not find it, so it's not there. */
4819 error ("unknown namespace `%D'", namespace);
4823 namespace = ORIGINAL_NAMESPACE (namespace);
4825 /* Build the alias. */
4826 alias
= build_lang_decl (NAMESPACE_DECL
, alias
, void_type_node
);
4827 DECL_NAMESPACE_ALIAS (alias
) = namespace;
4831 /* Check a non-member using-declaration. Return the name and scope
4832 being used, and the USING_DECL, or NULL_TREE on failure. */
4835 validate_nonmember_using_decl (decl
, scope
, name
)
4840 if (TREE_CODE (decl
) == SCOPE_REF
)
4842 *scope
= TREE_OPERAND (decl
, 0);
4843 *name
= TREE_OPERAND (decl
, 1);
4845 if (!processing_template_decl
)
4847 /* [namespace.udecl]
4848 A using-declaration for a class member shall be a
4849 member-declaration. */
4850 if(TREE_CODE (*scope
) != NAMESPACE_DECL
)
4852 if (TYPE_P (*scope
))
4853 error ("`%T' is not a namespace", *scope
);
4855 error ("`%D' is not a namespace", *scope
);
4860 A using-declaration shall not name a template-id. */
4861 if (TREE_CODE (*name
) == TEMPLATE_ID_EXPR
)
4863 *name
= TREE_OPERAND (*name
, 0);
4864 error ("a using-declaration cannot specify a template-id. Try `using %D'", *name
);
4869 else if (TREE_CODE (decl
) == IDENTIFIER_NODE
4870 || TREE_CODE (decl
) == TYPE_DECL
4871 || TREE_CODE (decl
) == TEMPLATE_DECL
)
4873 *scope
= global_namespace
;
4876 else if (TREE_CODE (decl
) == NAMESPACE_DECL
)
4878 error ("namespace `%D' not allowed in using-declaration", decl
);
4884 *name
= DECL_NAME (*name
);
4885 /* Make a USING_DECL. */
4886 return push_using_decl (*scope
, *name
);
4889 /* Process local and global using-declarations. */
4892 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, newval
, newtype
)
4894 tree oldval
, oldtype
;
4895 tree
*newval
, *newtype
;
4899 *newval
= *newtype
= NULL_TREE
;
4900 decls
= make_node (CPLUS_BINDING
);
4901 if (!qualified_lookup_using_namespace (name
, scope
, decls
, 0))
4905 if (!BINDING_VALUE (decls
) && !BINDING_TYPE (decls
))
4907 error ("`%D' not declared", name
);
4911 /* Check for using functions. */
4912 if (BINDING_VALUE (decls
) && is_overloaded_fn (BINDING_VALUE (decls
)))
4916 if (oldval
&& !is_overloaded_fn (oldval
))
4918 duplicate_decls (OVL_CURRENT (BINDING_VALUE (decls
)), oldval
);
4923 for (tmp
= BINDING_VALUE (decls
); tmp
; tmp
= OVL_NEXT (tmp
))
4925 tree new_fn
= OVL_CURRENT (tmp
);
4927 /* [namespace.udecl]
4929 If a function declaration in namespace scope or block
4930 scope has the same name and the same parameter types as a
4931 function introduced by a using declaration the program is
4933 for (tmp1
= oldval
; tmp1
; tmp1
= OVL_NEXT (tmp1
))
4935 tree old_fn
= OVL_CURRENT (tmp1
);
4937 if (new_fn
== old_fn
)
4938 /* The function already exists in the current namespace. */
4940 else if (OVL_USED (tmp1
))
4941 continue; /* this is a using decl */
4942 else if (compparms (TYPE_ARG_TYPES (TREE_TYPE (new_fn
)),
4943 TYPE_ARG_TYPES (TREE_TYPE (old_fn
))))
4945 /* If this using declaration introduces a function
4946 recognized as a built-in, no longer mark it as
4947 anticipated in this scope. */
4948 if (DECL_ANTICIPATED (old_fn
))
4950 DECL_ANTICIPATED (old_fn
) = 0;
4954 /* There was already a non-using declaration in
4955 this scope with the same parameter types. If both
4956 are the same extern "C" functions, that's ok. */
4957 if (!decls_match (new_fn
, old_fn
))
4958 error ("`%D' is already declared in this scope", name
);
4963 /* If we broke out of the loop, there's no reason to add
4964 this function to the using declarations for this
4969 *newval
= build_overload (OVL_CURRENT (tmp
), *newval
);
4970 if (TREE_CODE (*newval
) != OVERLOAD
)
4971 *newval
= ovl_cons (*newval
, NULL_TREE
);
4972 OVL_USED (*newval
) = 1;
4977 *newval
= BINDING_VALUE (decls
);
4979 duplicate_decls (*newval
, oldval
);
4982 *newtype
= BINDING_TYPE (decls
);
4983 if (oldtype
&& *newtype
&& oldtype
!= *newtype
)
4985 error ("using declaration `%D' introduced ambiguous type `%T'",
4991 /* Process a using-declaration not appearing in class or local scope. */
4994 do_toplevel_using_decl (decl
)
4997 tree scope
, name
, binding
;
4998 tree oldval
, oldtype
, newval
, newtype
;
5000 decl
= validate_nonmember_using_decl (decl
, &scope
, &name
);
5001 if (decl
== NULL_TREE
)
5004 binding
= binding_for_name (name
, current_namespace
);
5006 oldval
= BINDING_VALUE (binding
);
5007 oldtype
= BINDING_TYPE (binding
);
5009 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
5011 /* Copy declarations found. */
5013 BINDING_VALUE (binding
) = newval
;
5015 BINDING_TYPE (binding
) = newtype
;
5019 /* Process a using-declaration at function scope. */
5022 do_local_using_decl (decl
)
5026 tree oldval
, oldtype
, newval
, newtype
;
5028 decl
= validate_nonmember_using_decl (decl
, &scope
, &name
);
5029 if (decl
== NULL_TREE
)
5032 if (building_stmt_tree ()
5033 && at_function_scope_p ())
5034 add_decl_stmt (decl
);
5036 oldval
= lookup_name_current_level (name
);
5037 oldtype
= lookup_type_current_level (name
);
5039 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
5043 if (is_overloaded_fn (newval
))
5047 /* We only need to push declarations for those functions
5048 that were not already bound in the current level.
5049 The old value might be NULL_TREE, it might be a single
5050 function, or an OVERLOAD. */
5051 if (oldval
&& TREE_CODE (oldval
) == OVERLOAD
)
5052 term
= OVL_FUNCTION (oldval
);
5055 for (fn
= newval
; fn
&& OVL_CURRENT (fn
) != term
;
5057 push_overloaded_decl (OVL_CURRENT (fn
),
5058 PUSH_LOCAL
| PUSH_USING
);
5061 push_local_binding (name
, newval
, PUSH_USING
);
5064 set_identifier_type_value (name
, newtype
);
5068 do_class_using_decl (decl
)
5073 if (TREE_CODE (decl
) != SCOPE_REF
5074 || !TYPE_P (TREE_OPERAND (decl
, 0)))
5076 error ("using-declaration for non-member at class scope");
5079 name
= TREE_OPERAND (decl
, 1);
5080 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
5082 error ("using-declaration for destructor");
5085 else if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
)
5087 name
= TREE_OPERAND (name
, 0);
5088 error ("a using-declaration cannot specify a template-id. Try `using %T::%D'", TREE_OPERAND (decl
, 0), name
);
5091 if (TREE_CODE (name
) == TYPE_DECL
|| TREE_CODE (name
) == TEMPLATE_DECL
)
5092 name
= DECL_NAME (name
);
5094 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 980716);
5096 value
= build_lang_decl (USING_DECL
, name
, void_type_node
);
5097 DECL_INITIAL (value
) = TREE_OPERAND (decl
, 0);
5101 /* Process a using-directive. */
5104 do_using_directive (namespace)
5107 if (building_stmt_tree ())
5108 add_stmt (build_stmt (USING_STMT
, namespace));
5110 /* using namespace A::B::C; */
5111 if (TREE_CODE (namespace) == SCOPE_REF
)
5112 namespace = TREE_OPERAND (namespace, 1);
5113 if (TREE_CODE (namespace) == IDENTIFIER_NODE
)
5115 /* Lookup in lexer did not find a namespace. */
5116 if (!processing_template_decl
)
5117 error ("namespace `%T' undeclared", namespace);
5120 if (TREE_CODE (namespace) != NAMESPACE_DECL
)
5122 if (!processing_template_decl
)
5123 error ("`%T' is not a namespace", namespace);
5126 namespace = ORIGINAL_NAMESPACE (namespace);
5127 if (!toplevel_bindings_p ())
5128 push_using_directive (namespace);
5131 add_using_namespace (current_namespace
, namespace, 0);
5135 check_default_args (x
)
5138 tree arg
= TYPE_ARG_TYPES (TREE_TYPE (x
));
5139 int saw_def
= 0, i
= 0 - (TREE_CODE (TREE_TYPE (x
)) == METHOD_TYPE
);
5140 for (; arg
&& arg
!= void_list_node
; arg
= TREE_CHAIN (arg
), ++i
)
5142 if (TREE_PURPOSE (arg
))
5146 cp_error_at ("default argument missing for parameter %P of `%+#D'",
5157 TREE_USED (decl
) = 1;
5158 if (processing_template_decl
)
5160 assemble_external (decl
);
5162 /* Is it a synthesized method that needs to be synthesized? */
5163 if (TREE_CODE (decl
) == FUNCTION_DECL
5164 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl
)
5165 && DECL_ARTIFICIAL (decl
)
5166 && ! DECL_INITIAL (decl
)
5167 /* Kludge: don't synthesize for default args. */
5168 && current_function_decl
)
5170 synthesize_method (decl
);
5171 /* If we've already synthesized the method we don't need to
5172 instantiate it, so we can return right away. */
5176 /* If this is a function or variable that is an instance of some
5177 template, we now know that we will need to actually do the
5178 instantiation. We check that DECL is not an explicit
5179 instantiation because that is not checked in instantiate_decl. */
5180 if ((DECL_NON_THUNK_FUNCTION_P (decl
) || TREE_CODE (decl
) == VAR_DECL
)
5181 && DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
5182 && (!DECL_EXPLICIT_INSTANTIATION (decl
)
5183 || (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_INLINE (decl
))))
5184 instantiate_decl (decl
, /*defer_ok=*/1);
5187 /* Helper function for class_head_decl and class_head_defn
5188 nonterminals. AGGR is the class, union or struct tag. SCOPE is the
5189 explicit scope used (NULL for no scope resolution). ID is the
5190 name. DEFN_P is true, if this is a definition of the class and
5191 NEW_TYPE_P is set to non-zero, if we push into the scope containing
5192 the to be defined aggregate.
5194 Return a TYPE_DECL for the type declared by ID in SCOPE. */
5197 handle_class_head (aggr
, scope
, id
, defn_p
, new_type_p
)
5198 tree aggr
, scope
, id
;
5202 tree decl
= NULL_TREE
;
5203 tree current
= current_scope ();
5204 bool xrefd_p
= false;
5206 if (current
== NULL_TREE
)
5207 current
= current_namespace
;
5213 if (TREE_CODE (id
) == TYPE_DECL
)
5214 /* We must bash typedefs back to the main decl of the
5215 type. Otherwise we become confused about scopes. */
5216 decl
= TYPE_MAIN_DECL (TREE_TYPE (id
));
5217 else if (DECL_CLASS_TEMPLATE_P (id
))
5218 decl
= DECL_TEMPLATE_RESULT (id
);
5223 /* According to the suggested resolution of core issue
5224 180, 'typename' is assumed after a class-key. */
5225 decl
= make_typename_type (scope
, id
, tf_error
);
5226 if (decl
!= error_mark_node
)
5227 decl
= TYPE_MAIN_DECL (decl
);
5231 else if (scope
== current
)
5233 /* We've been given AGGR SCOPE::ID, when we're already
5234 inside SCOPE. Be nice about it. */
5236 pedwarn ("extra qualification `%T::' on member `%D' ignored",
5240 error ("`%T' does not have a class or union named `%D'",
5247 decl
= TYPE_MAIN_DECL (xref_tag (aggr
, id
, !defn_p
));
5251 if (!TYPE_BINFO (TREE_TYPE (decl
)))
5253 error ("`%T' is not a class or union type", decl
);
5254 return error_mark_node
;
5259 /* For a definition, we want to enter the containing scope
5260 before looking up any base classes etc. Only do so, if this
5261 is different to the current scope. */
5262 tree context
= CP_DECL_CONTEXT (decl
);
5264 *new_type_p
= (current
!= context
5265 && TREE_CODE (context
) != TEMPLATE_TYPE_PARM
5266 && TREE_CODE (context
) != BOUND_TEMPLATE_TEMPLATE_PARM
);
5268 push_scope (context
);
5270 if (TREE_CODE (TREE_TYPE (decl
)) == RECORD_TYPE
)
5271 /* It is legal to define a class with a different class key,
5272 and this changes the default member access. */
5273 CLASSTYPE_DECLARED_CLASS (TREE_TYPE (decl
))
5274 = aggr
== class_type_node
;
5276 if (!xrefd_p
&& PROCESSING_REAL_TEMPLATE_DECL_P ())
5277 decl
= push_template_decl (decl
);
5283 /* Initialize decl2.c. */
5288 ggc_add_tree_varray_root (&deferred_fns
, 1);
5289 ggc_add_tree_varray_root (&pending_statics
, 1);
5290 ggc_add_tree_varray_root (&ssdf_decls
, 1);
5291 ggc_add_tree_root (&ssdf_decl
, 1);
5292 ggc_add_tree_root (&priority_decl
, 1);
5293 ggc_add_tree_root (&initialize_p_decl
, 1);