1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 92-98, 1999 Free Software Foundation, Inc.
3 Hacked by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* Process declarations and symbol lookup for C front end.
24 Also constructs types; the standard scalar types at initialization,
25 and structure, union, array and enum types when they are declared. */
27 /* ??? not all decl nodes are given the most useful possible
28 line numbers. For example, the CONST_DECLs for enum values. */
43 #include "dwarf2out.h"
48 extern cpp_reader parse_in
;
51 static tree get_sentry
PROTO((tree
));
52 static void mark_vtable_entries
PROTO((tree
));
53 static void grok_function_init
PROTO((tree
, tree
));
54 static int finish_vtable_vardecl
PROTO((tree
, tree
));
55 static int prune_vtable_vardecl
PROTO((tree
, tree
));
56 static void finish_sigtable_vardecl
PROTO((tree
, tree
));
57 static int is_namespace_ancestor
PROTO((tree
, tree
));
58 static void add_using_namespace
PROTO((tree
, tree
, int));
59 static tree ambiguous_decl
PROTO((tree
, tree
, tree
,int));
60 static tree build_anon_union_vars
PROTO((tree
, tree
*, int, int));
61 static void check_decl_namespace
PROTO((void));
63 extern int current_class_depth
;
65 /* A list of virtual function tables we must make sure to write out. */
68 /* A list of static class variables. This is needed, because a
69 static class variable can be declared inside the class without
70 an initializer, and then initialized, staticly, outside the class. */
73 /* A list of functions which were declared inline, but which we
74 may need to emit outline anyway. */
75 static tree saved_inlines
;
77 /* Used to help generate temporary names which are unique within
78 a function. Reset to 0 by start_function. */
80 int temp_name_counter
;
82 /* Same, but not reset. Local temp variables and global temp variables
83 can have the same name. */
84 static int global_temp_name_counter
;
86 /* Flag used when debugging spew.c */
88 extern int spew_debug
;
90 /* Nonzero if we're done parsing and into end-of-file activities. */
94 /* Functions called along with real static constructors and destructors. */
96 tree static_ctors
, static_dtors
;
98 /* The current open namespace, and ::. */
100 tree current_namespace
;
101 tree global_namespace
;
103 /* The stack for namespaces of current declarations. */
105 static tree decl_namespace_list
;
108 /* C (and C++) language-specific option variables. */
110 /* Nonzero means allow type mismatches in conditional expressions;
111 just make their values `void'. */
113 int flag_cond_mismatch
;
115 /* Nonzero means give `double' the same size as `float'. */
117 int flag_short_double
;
119 /* Nonzero means don't recognize the keyword `asm'. */
123 /* Nonzero means don't recognize any extension keywords. */
125 int flag_no_gnu_keywords
;
127 /* Nonzero means don't recognize the non-ANSI builtin functions. */
131 /* Nonzero means don't recognize the non-ANSI builtin functions.
134 int flag_no_nonansi_builtin
;
136 /* Nonzero means do some things the same way PCC does. Only provided so
137 the compiler will link. */
139 int flag_traditional
;
141 /* Nonzero means to treat bitfields as unsigned unless they say `signed'. */
143 int flag_signed_bitfields
= 1;
145 /* Nonzero means handle `#ident' directives. 0 means ignore them. */
149 /* Nonzero means enable obscure ANSI features and disable GNU extensions
150 that might cause ANSI-compliant code to be miscompiled. */
154 /* Nonzero means do emit exported implementations of functions even if
155 they can be inlined. */
157 int flag_implement_inlines
= 1;
159 /* Nonzero means do emit exported implementations of templates, instead of
160 multiple static copies in each file that needs a definition. */
162 int flag_external_templates
;
164 /* Nonzero means that the decision to emit or not emit the implementation of a
165 template depends on where the template is instantiated, rather than where
168 int flag_alt_external_templates
;
170 /* Nonzero means that implicit instantiations will be emitted if needed. */
172 int flag_implicit_templates
= 1;
174 /* Nonzero means that implicit instantiations of inline templates will be
175 emitted if needed, even if instantiations of non-inline templates
178 int flag_implicit_inline_templates
= 1;
180 /* Nonzero means allow numerical priorities on constructors. */
182 #ifdef USE_INIT_PRIORITY
183 int flag_init_priority
= 1;
185 int flag_init_priority
;
188 /* Nonzero means warn about implicit declarations. */
190 int warn_implicit
= 1;
192 /* Nonzero means warn about usage of long long when `-pedantic'. */
194 int warn_long_long
= 1;
196 /* Nonzero means warn when all ctors or dtors are private, and the class
199 int warn_ctor_dtor_privacy
= 1;
201 /* True if we want to implement vtables using "thunks".
202 The default is off. */
204 #ifndef DEFAULT_VTABLE_THUNKS
205 #define DEFAULT_VTABLE_THUNKS 0
207 int flag_vtable_thunks
= DEFAULT_VTABLE_THUNKS
;
209 /* True if we want to deal with repository information. */
211 int flag_use_repository
;
213 /* Nonzero if we want to issue diagnostics that the standard says are not
216 int flag_optional_diags
= 1;
218 /* Nonzero means give string constants the type `const char *', as mandated
221 int flag_const_strings
= 1;
223 /* Nonzero means warn about deprecated conversion from string constant to
226 int warn_write_strings
;
228 /* Nonzero means warn about pointer casts that can drop a type qualifier
229 from the pointer target type. */
233 /* Nonzero means warn about sizeof(function) or addition/subtraction
234 of function pointers. */
236 int warn_pointer_arith
= 1;
238 /* Nonzero means warn for any function def without prototype decl. */
240 int warn_missing_prototypes
;
242 /* Nonzero means warn about multiple (redundant) decls for the same single
243 variable or function. */
245 int warn_redundant_decls
;
247 /* Warn if initializer is not completely bracketed. */
249 int warn_missing_braces
;
251 /* Warn about comparison of signed and unsigned values. */
253 int warn_sign_compare
;
255 /* Warn about *printf or *scanf format/argument anomalies. */
259 /* Warn about a subscript that has type char. */
261 int warn_char_subscripts
;
263 /* Warn if a type conversion is done that might have confusing results. */
267 /* Warn if adding () is suggested. */
269 int warn_parentheses
;
271 /* Non-zero means warn in function declared in derived class has the
272 same name as a virtual in the base class, but fails to match the
273 type signature of any virtual function in the base class. */
274 int warn_overloaded_virtual
;
276 /* Non-zero means warn when declaring a class that has a non virtual
277 destructor, when it really ought to have a virtual one. */
280 /* Non-zero means warn when a function is declared extern and later inline. */
281 int warn_extern_inline
;
283 /* Non-zero means warn when the compiler will reorder code. */
286 /* Non-zero means warn when synthesis behavior differs from Cfront's. */
289 /* Non-zero means warn when we convert a pointer to member function
290 into a pointer to (void or function). */
291 int warn_pmf2ptr
= 1;
293 /* Nonzero means warn about violation of some Effective C++ style rules. */
297 /* Nonzero means warn where overload resolution chooses a promotion from
298 unsigned to signed over a conversion to an unsigned of the same size. */
302 /* Nonzero means warn when an old-style cast is used. */
304 int warn_old_style_cast
;
306 /* Warn about #pragma directives that are not recognised. */
308 int warn_unknown_pragmas
; /* Tri state variable. */
310 /* Nonzero means warn about use of multicharacter literals. */
312 int warn_multichar
= 1;
314 /* Nonzero means warn when non-templatized friend functions are
315 declared within a template */
317 int warn_nontemplate_friend
= 1;
319 /* Nonzero means `$' can be in an identifier. */
321 #ifndef DOLLARS_IN_IDENTIFIERS
322 #define DOLLARS_IN_IDENTIFIERS 1
324 int dollars_in_ident
= DOLLARS_IN_IDENTIFIERS
;
326 /* Nonzero for -fno-strict-prototype switch: do not consider empty
327 argument prototype to mean function takes no arguments. */
329 int flag_strict_prototype
= 2;
330 int strict_prototype
= 1;
331 int strict_prototypes_lang_c
, strict_prototypes_lang_cplusplus
= 1;
333 /* Nonzero means that labels can be used as first-class objects */
337 /* Non-zero means to collect statistics which might be expensive
338 and to print them when we are done. */
339 int flag_detailed_statistics
;
341 /* C++ specific flags. */
342 /* Zero means that `this' is a *const. This gives nice behavior in the
343 2.0 world. 1 gives 1.2-compatible behavior. 2 gives Spring behavior.
344 -2 means we're constructing an object and it has fixed type. */
346 int flag_this_is_variable
;
348 /* 3 means write out only virtuals function tables `defined'
349 in this implementation file.
350 0 means write out virtual function tables and give them
351 (C) static access (default). */
355 /* Nonzero means we should attempt to elide constructors when possible. */
357 int flag_elide_constructors
= 1;
359 /* Nonzero means recognize and handle signature language constructs. */
361 int flag_handle_signatures
;
363 /* Nonzero means that member functions defined in class scope are
364 inline by default. */
366 int flag_default_inline
= 1;
368 /* Controls whether compiler generates 'type descriptor' that give
369 run-time type information. */
372 /* Nonzero if we wish to output cross-referencing information
373 for the GNU class browser. */
374 extern int flag_gnu_xref
;
376 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
379 int flag_huge_objects
;
381 /* Nonzero if we want to conserve space in the .o files. We do this
382 by putting uninitialized data and runtime initialized data into
383 .common instead of .data at the expense of not flagging multiple
386 int flag_conserve_space
;
388 /* Nonzero if we want to obey access control semantics. */
390 int flag_access_control
= 1;
392 /* Nonzero if we want to understand the operator names, i.e. 'bitand'. */
394 int flag_operator_names
;
396 /* Nonzero if we want to check the return value of new and avoid calling
397 constructors if it is a null pointer. */
401 /* Nonzero if we want the new ANSI rules for pushing a new scope for `for'
402 initialization variables.
403 0: Old rules, set by -fno-for-scope.
404 2: New ANSI rules, set by -ffor-scope.
405 1: Try to implement new ANSI rules, but with backup compatibility
406 (and warnings). This is the default, for now. */
408 int flag_new_for_scope
= 1;
410 /* Nonzero if we want to emit defined symbols with common-like linkage as
411 weak symbols where possible, in order to conform to C++ semantics.
412 Otherwise, emit them as local symbols. */
416 /* Nonzero to enable experimental ABI changes. */
420 /* Nonzero to not ignore namespace std. */
424 /* Maximum template instantiation depth. Must be at least 17 for ANSI
427 int max_tinst_depth
= 17;
429 /* The name-mangling scheme to use. Must be 1 or greater to support
430 template functions with identical types, but different template
432 int name_mangling_version
= 2;
434 /* Nonzero means that guiding declarations are allowed. */
435 int flag_guiding_decls
;
437 /* Nonzero if squashed mangling is to be performed.
438 This uses the B and K codes to reference previously seen class types
439 and class qualifiers. */
440 int flag_do_squangling
;
442 /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */
446 /* Nonzero means make the default pedwarns warnings instead of errors.
447 The value of this flag is ignored if -pedantic is specified. */
451 /* Table of language-dependent -f options.
452 STRING is the option name. VARIABLE is the address of the variable.
453 ON_VALUE is the value to store in VARIABLE
454 if `-fSTRING' is seen as an option.
455 (If `-fno-STRING' is seen as an option, the opposite value is stored.) */
457 static struct { char *string
; int *variable
; int on_value
;} lang_f_options
[] =
460 {"signed-char", &flag_signed_char
, 1},
461 {"unsigned-char", &flag_signed_char
, 0},
462 {"signed-bitfields", &flag_signed_bitfields
, 1},
463 {"unsigned-bitfields", &flag_signed_bitfields
, 0},
464 {"short-enums", &flag_short_enums
, 1},
465 {"short-double", &flag_short_double
, 1},
466 {"cond-mismatch", &flag_cond_mismatch
, 1},
467 {"asm", &flag_no_asm
, 0},
468 {"builtin", &flag_no_builtin
, 0},
469 {"ident", &flag_no_ident
, 0},
471 /* C++-only options. */
472 {"access-control", &flag_access_control
, 1},
473 {"check-new", &flag_check_new
, 1},
474 {"conserve-space", &flag_conserve_space
, 1},
475 {"const-strings", &flag_const_strings
, 1},
476 {"default-inline", &flag_default_inline
, 1},
477 {"dollars-in-identifiers", &dollars_in_ident
, 1},
478 {"elide-constructors", &flag_elide_constructors
, 1},
479 {"external-templates", &flag_external_templates
, 1},
480 {"for-scope", &flag_new_for_scope
, 2},
481 {"gnu-keywords", &flag_no_gnu_keywords
, 0},
482 {"handle-exceptions", &flag_exceptions
, 1},
483 {"handle-signatures", &flag_handle_signatures
, 1},
484 {"honor-std", &flag_honor_std
, 1},
485 {"huge-objects", &flag_huge_objects
, 1},
486 {"implement-inlines", &flag_implement_inlines
, 1},
487 {"implicit-inline-templates", &flag_implicit_inline_templates
, 1},
488 {"implicit-templates", &flag_implicit_templates
, 1},
489 {"init-priority", &flag_init_priority
, 1},
490 {"labels-ok", &flag_labels_ok
, 1},
491 {"nonansi-builtins", &flag_no_nonansi_builtin
, 0},
492 {"operator-names", &flag_operator_names
, 1},
493 {"optional-diags", &flag_optional_diags
, 1},
494 {"permissive", &flag_permissive
, 1},
495 {"repo", &flag_use_repository
, 1},
496 {"rtti", &flag_rtti
, 1},
497 {"squangle", &flag_do_squangling
, 1},
498 {"stats", &flag_detailed_statistics
, 1},
499 {"strict-prototype", &flag_strict_prototype
, 1},
500 {"this-is-variable", &flag_this_is_variable
, 1},
501 {"vtable-gc", &flag_vtable_gc
, 1},
502 {"vtable-thunks", &flag_vtable_thunks
, 1},
503 {"weak", &flag_weak
, 1},
504 {"xref", &flag_gnu_xref
, 1}
507 /* Decode the string P as a language-specific option.
508 Return the number of strings consumed for a valid option.
509 Otherwise return 0. */
512 lang_decode_option (argc
, argv
)
521 int strings_processed
;
524 strings_processed
= cpp_handle_option (&parse_in
, argc
, argv
);
526 strings_processed
= 0;
527 #endif /* ! USE_CPPLIB */
529 if (!strcmp (p
, "-ftraditional") || !strcmp (p
, "-traditional"))
531 else if (p
[0] == '-' && p
[1] == 'f')
533 /* Some kind of -f option.
534 P's value is the option sans `-f'.
535 Search for it in the table of options. */
540 /* Try special -f options. */
542 if (!strcmp (p
, "handle-exceptions")
543 || !strcmp (p
, "no-handle-exceptions"))
544 warning ("-fhandle-exceptions has been renamed to -fexceptions (and is now on by default)");
546 if (!strcmp (p
, "memoize-lookups")
547 || !strcmp (p
, "no-memoize-lookups")
548 || !strcmp (p
, "save-memoized")
549 || !strcmp (p
, "no-save-memoized")
550 || !strcmp (p
, "no-all-virtual")
551 || !strcmp (p
, "no-enum-int-equiv")
552 || !strcmp (p
, "nonnull-objects")
553 || !strcmp (p
, "ansi-overloading"))
558 else if (!strcmp (p
, "all-virtual")
559 || !strcmp (p
, "enum-int-equiv")
560 || !strcmp (p
, "no-nonnull-objects")
561 || !strcmp (p
, "no-ansi-overloading"))
563 warning ("-f%s is no longer supported", p
);
566 else if (! strcmp (p
, "alt-external-templates"))
568 flag_external_templates
= 1;
569 flag_alt_external_templates
= 1;
572 else if (! strcmp (p
, "no-alt-external-templates"))
574 flag_alt_external_templates
= 0;
577 else if (!strcmp (p
, "repo"))
579 flag_use_repository
= 1;
580 flag_implicit_templates
= 0;
583 else if (!strcmp (p
, "guiding-decls"))
585 flag_guiding_decls
= 1;
586 name_mangling_version
= 0;
589 else if (!strcmp (p
, "no-guiding-decls"))
591 flag_guiding_decls
= 0;
594 else if (!strcmp (p
, "new-abi"))
597 flag_do_squangling
= 1;
599 flag_vtable_thunks
= 1;
601 else if (!strcmp (p
, "no-new-abi"))
604 flag_do_squangling
= 0;
607 else if (!strncmp (p
, "template-depth-", 15))
612 if (*endp
>= '0' && *endp
<= '9')
616 error ("Invalid option `%s'", p
- 2);
617 goto template_depth_lose
;
620 max_tinst_depth
= atoi (p
+ 15);
621 template_depth_lose
: ;
623 else if (!strncmp (p
, "name-mangling-version-", 22))
628 if (*endp
>= '0' && *endp
<= '9')
632 error ("Invalid option `%s'", p
- 2);
633 goto mangling_version_lose
;
636 name_mangling_version
= atoi (p
+ 22);
637 mangling_version_lose
: ;
640 !found
&& j
< sizeof (lang_f_options
) / sizeof (lang_f_options
[0]);
643 if (!strcmp (p
, lang_f_options
[j
].string
))
645 *lang_f_options
[j
].variable
= lang_f_options
[j
].on_value
;
646 /* A goto here would be cleaner,
647 but breaks the vax pcc. */
650 if (p
[0] == 'n' && p
[1] == 'o' && p
[2] == '-'
651 && ! strcmp (p
+3, lang_f_options
[j
].string
))
653 *lang_f_options
[j
].variable
= ! lang_f_options
[j
].on_value
;
659 else if (p
[0] == '-' && p
[1] == 'W')
663 /* The -W options control the warning behavior of the compiler. */
666 if (p
[0] == 'n' && p
[1] == 'o' && p
[2] == '-')
669 if (!strcmp (p
, "implicit"))
670 warn_implicit
= setting
;
671 else if (!strcmp (p
, "long-long"))
672 warn_long_long
= setting
;
673 else if (!strcmp (p
, "return-type"))
674 warn_return_type
= setting
;
675 else if (!strcmp (p
, "ctor-dtor-privacy"))
676 warn_ctor_dtor_privacy
= setting
;
677 else if (!strcmp (p
, "write-strings"))
678 warn_write_strings
= setting
;
679 else if (!strcmp (p
, "cast-qual"))
680 warn_cast_qual
= setting
;
681 else if (!strcmp (p
, "char-subscripts"))
682 warn_char_subscripts
= setting
;
683 else if (!strcmp (p
, "pointer-arith"))
684 warn_pointer_arith
= setting
;
685 else if (!strcmp (p
, "missing-prototypes"))
686 warn_missing_prototypes
= setting
;
687 else if (!strcmp (p
, "redundant-decls"))
688 warn_redundant_decls
= setting
;
689 else if (!strcmp (p
, "missing-braces"))
690 warn_missing_braces
= setting
;
691 else if (!strcmp (p
, "sign-compare"))
692 warn_sign_compare
= setting
;
693 else if (!strcmp (p
, "format"))
694 warn_format
= setting
;
695 else if (!strcmp (p
, "conversion"))
696 warn_conversion
= setting
;
697 else if (!strcmp (p
, "parentheses"))
698 warn_parentheses
= setting
;
699 else if (!strcmp (p
, "non-virtual-dtor"))
700 warn_nonvdtor
= setting
;
701 else if (!strcmp (p
, "extern-inline"))
702 warn_extern_inline
= setting
;
703 else if (!strcmp (p
, "reorder"))
704 warn_reorder
= setting
;
705 else if (!strcmp (p
, "synth"))
706 warn_synth
= setting
;
707 else if (!strcmp (p
, "pmf-conversions"))
708 warn_pmf2ptr
= setting
;
709 else if (!strcmp (p
, "effc++"))
711 else if (!strcmp (p
, "sign-promo"))
712 warn_sign_promo
= setting
;
713 else if (!strcmp (p
, "old-style-cast"))
714 warn_old_style_cast
= setting
;
715 else if (!strcmp (p
, "overloaded-virtual"))
716 warn_overloaded_virtual
= setting
;
717 else if (!strcmp (p
, "multichar"))
718 warn_multichar
= setting
;
719 else if (!strcmp (p
, "unknown-pragmas"))
720 /* Set to greater than 1, so that even unknown pragmas in
721 system headers will be warned about. */
722 warn_unknown_pragmas
= setting
* 2;
723 else if (!strcmp (p
, "non-template-friend"))
724 warn_nontemplate_friend
= setting
;
725 else if (!strcmp (p
, "comment"))
726 ; /* cpp handles this one. */
727 else if (!strcmp (p
, "comments"))
728 ; /* cpp handles this one. */
729 else if (!strcmp (p
, "trigraphs"))
730 ; /* cpp handles this one. */
731 else if (!strcmp (p
, "import"))
732 ; /* cpp handles this one. */
733 else if (!strcmp (p
, "all"))
735 warn_return_type
= setting
;
736 warn_unused
= setting
;
737 warn_implicit
= setting
;
738 warn_ctor_dtor_privacy
= setting
;
739 warn_switch
= setting
;
740 warn_format
= setting
;
741 warn_parentheses
= setting
;
742 warn_missing_braces
= setting
;
743 warn_sign_compare
= setting
;
744 warn_extern_inline
= setting
;
745 warn_nonvdtor
= setting
;
746 warn_multichar
= setting
;
747 /* We save the value of warn_uninitialized, since if they put
748 -Wuninitialized on the command line, we need to generate a
749 warning about not using it without also specifying -O. */
750 if (warn_uninitialized
!= 1)
751 warn_uninitialized
= (setting
? 2 : 0);
752 warn_reorder
= setting
;
753 warn_sign_promo
= setting
;
754 /* Only warn about unknown pragmas that are not in system
756 warn_unknown_pragmas
= 1;
757 warn_nontemplate_friend
= setting
;
759 else return strings_processed
;
761 else if (!strcmp (p
, "-ansi"))
762 flag_no_nonansi_builtin
= 1, flag_ansi
= 1,
763 flag_no_gnu_keywords
= 1, flag_operator_names
= 1;
765 /* Undocumented, only ever used when you're invoking cc1plus by hand, since
766 it's probably safe to assume no sane person would ever want to use this
767 under normal circumstances. */
768 else if (!strcmp (p
, "-spew-debug"))
772 return strings_processed
;
777 /* Incorporate `const' and `volatile' qualifiers for member functions.
778 FUNCTION is a TYPE_DECL or a FUNCTION_DECL.
779 QUALS is a list of qualifiers. */
782 grok_method_quals (ctype
, function
, quals
)
783 tree ctype
, function
, quals
;
785 tree fntype
= TREE_TYPE (function
);
786 tree raises
= TYPE_RAISES_EXCEPTIONS (fntype
);
787 int type_quals
= TYPE_UNQUALIFIED
;
788 int dup_quals
= TYPE_UNQUALIFIED
;
792 int tq
= cp_type_qual_from_rid (TREE_VALUE (quals
));
798 quals
= TREE_CHAIN (quals
);
802 if (dup_quals
!= TYPE_UNQUALIFIED
)
803 cp_error ("duplicate type qualifiers in %s declaration",
804 TREE_CODE (function
) == FUNCTION_DECL
805 ? "member function" : "type");
807 ctype
= cp_build_qualified_type (ctype
, type_quals
);
808 fntype
= build_cplus_method_type (ctype
, TREE_TYPE (fntype
),
809 (TREE_CODE (fntype
) == METHOD_TYPE
810 ? TREE_CHAIN (TYPE_ARG_TYPES (fntype
))
811 : TYPE_ARG_TYPES (fntype
)));
813 fntype
= build_exception_variant (fntype
, raises
);
815 TREE_TYPE (function
) = fntype
;
819 /* Warn when -fexternal-templates is used and #pragma
820 interface/implementation is not used all the times it should be,
824 warn_if_unknown_interface (decl
)
827 static int already_warned
= 0;
828 if (already_warned
++)
831 if (flag_alt_external_templates
)
833 struct tinst_level
*til
= tinst_for_decl ();
835 char *sf
= input_filename
;
840 input_filename
= til
->file
;
842 cp_warning ("template `%#D' instantiated in file without #pragma interface",
848 cp_warning_at ("template `%#D' defined in file without #pragma interface",
852 /* A subroutine of the parser, to handle a component list. */
855 grok_x_components (specs
)
858 struct pending_inline
**p
;
861 specs
= strip_attrs (specs
);
863 check_tag_decl (specs
);
864 t
= groktypename (build_decl_list (specs
, NULL_TREE
));
866 /* The only case where we need to do anything additional here is an
867 anonymous union field, e.g.: `struct S { union { int i; }; };'. */
868 if (t
== NULL_TREE
|| !ANON_UNION_TYPE_P (t
))
871 fixup_anonymous_union (t
);
872 finish_member_declaration (build_lang_field_decl (FIELD_DECL
,
876 /* Ignore any inline function definitions in the anonymous union
877 since an anonymous union may not have function members. */
878 p
= &pending_inlines
;
879 for (; *p
; *p
= (*p
)->next
)
880 if (DECL_CONTEXT ((*p
)->fndecl
) != t
)
884 /* Constructors for types with virtual baseclasses need an "in-charge" flag
885 saying whether this constructor is responsible for initialization of
886 virtual baseclasses or not. All destructors also need this "in-charge"
887 flag, which additionally determines whether or not the destructor should
888 free the memory for the object.
890 This function adds the "in-charge" flag to member function FN if
891 appropriate. It is called from grokclassfn and tsubst.
892 FN must be either a constructor or destructor. */
895 maybe_retrofit_in_chrg (fn
)
898 tree basetype
, arg_types
, parms
, parm
, fntype
;
900 if (DECL_CONSTRUCTOR_P (fn
)
901 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CLASS_CONTEXT (fn
))
902 && ! DECL_CONSTRUCTOR_FOR_VBASE_P (fn
))
904 else if (! DECL_CONSTRUCTOR_P (fn
)
905 && TREE_CHAIN (DECL_ARGUMENTS (fn
)) == NULL_TREE
)
910 if (DECL_CONSTRUCTOR_P (fn
))
911 DECL_CONSTRUCTOR_FOR_VBASE_P (fn
) = 1;
913 /* First add it to DECL_ARGUMENTS... */
914 parm
= build_decl (PARM_DECL
, in_charge_identifier
, integer_type_node
);
915 /* Mark the artificial `__in_chrg' parameter as "artificial". */
916 SET_DECL_ARTIFICIAL (parm
);
917 DECL_ARG_TYPE (parm
) = integer_type_node
;
918 TREE_READONLY (parm
) = 1;
919 parms
= DECL_ARGUMENTS (fn
);
920 TREE_CHAIN (parm
) = TREE_CHAIN (parms
);
921 TREE_CHAIN (parms
) = parm
;
923 /* ...and then to TYPE_ARG_TYPES. */
924 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
925 basetype
= TREE_TYPE (TREE_VALUE (arg_types
));
926 arg_types
= hash_tree_chain (integer_type_node
, TREE_CHAIN (arg_types
));
927 fntype
= build_cplus_method_type (basetype
, TREE_TYPE (TREE_TYPE (fn
)),
929 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
)))
930 fntype
= build_exception_variant (fntype
,
931 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
)));
932 TREE_TYPE (fn
) = fntype
;
935 /* Classes overload their constituent function names automatically.
936 When a function name is declared in a record structure,
937 its name is changed to it overloaded name. Since names for
938 constructors and destructors can conflict, we place a leading
941 CNAME is the name of the class we are grokking for.
943 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
945 FLAGS contains bits saying what's special about today's
946 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
948 If FUNCTION is a destructor, then we must add the `auto-delete' field
949 as a second parameter. There is some hair associated with the fact
950 that we must "declare" this variable in the manner consistent with the
951 way the rest of the arguments were declared.
953 QUALS are the qualifiers for the this pointer. */
956 grokclassfn (ctype
, function
, flags
, quals
)
957 tree ctype
, function
;
958 enum overload_flags flags
;
961 tree fn_name
= DECL_NAME (function
);
966 if (fn_name
== NULL_TREE
)
968 error ("name missing for member function");
969 fn_name
= get_identifier ("<anonymous>");
970 DECL_NAME (function
) = fn_name
;
974 qualtype
= grok_method_quals (ctype
, function
, quals
);
978 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (function
));
979 if (TREE_CODE (TREE_TYPE (function
)) == METHOD_TYPE
)
981 /* Must add the class instance variable up front. */
982 /* Right now we just make this a pointer. But later
983 we may wish to make it special. */
984 tree type
= TREE_VALUE (arg_types
);
987 if ((flag_this_is_variable
> 0)
988 && (flags
== DTOR_FLAG
|| DECL_CONSTRUCTOR_P (function
)))
991 parm
= build_decl (PARM_DECL
, this_identifier
, type
);
992 /* Mark the artificial `this' parameter as "artificial". */
993 SET_DECL_ARTIFICIAL (parm
);
994 DECL_ARG_TYPE (parm
) = type
;
995 /* We can make this a register, so long as we don't
996 accidentally complain if someone tries to take its address. */
997 DECL_REGISTER (parm
) = 1;
999 TREE_READONLY (parm
) = 1;
1000 TREE_CHAIN (parm
) = last_function_parms
;
1001 last_function_parms
= parm
;
1004 DECL_ARGUMENTS (function
) = last_function_parms
;
1005 /* First approximations. */
1006 DECL_CONTEXT (function
) = ctype
;
1007 DECL_CLASS_CONTEXT (function
) = ctype
;
1009 if (flags
== DTOR_FLAG
|| DECL_CONSTRUCTOR_P (function
))
1011 maybe_retrofit_in_chrg (function
);
1012 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (function
));
1015 if (flags
== DTOR_FLAG
)
1017 DECL_ASSEMBLER_NAME (function
) = build_destructor_name (ctype
);
1018 TYPE_HAS_DESTRUCTOR (ctype
) = 1;
1021 set_mangled_name_for_decl (function
);
1024 /* Work on the expr used by alignof (this is only called by the parser). */
1033 if (processing_template_decl
)
1034 return build_min (ALIGNOF_EXPR
, sizetype
, expr
);
1036 if (TREE_CODE (expr
) == COMPONENT_REF
1037 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
1038 error ("`__alignof__' applied to a bit-field");
1040 if (TREE_CODE (expr
) == INDIRECT_REF
)
1042 best
= t
= TREE_OPERAND (expr
, 0);
1043 bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
1045 while (TREE_CODE (t
) == NOP_EXPR
1046 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
1049 t
= TREE_OPERAND (t
, 0);
1050 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
1051 if (thisalign
> bestalign
)
1052 best
= t
, bestalign
= thisalign
;
1054 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
1058 /* ANSI says arrays and fns are converted inside comma.
1059 But we can't convert them in build_compound_expr
1060 because that would break commas in lvalues.
1061 So do the conversion here if operand was a comma. */
1062 if (TREE_CODE (expr
) == COMPOUND_EXPR
1063 && (TREE_CODE (TREE_TYPE (expr
)) == ARRAY_TYPE
1064 || TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
))
1065 expr
= default_conversion (expr
);
1066 return c_alignof (TREE_TYPE (expr
));
1070 /* Create an ARRAY_REF, checking for the user doing things backwards
1074 grok_array_decl (array_expr
, index_exp
)
1075 tree array_expr
, index_exp
;
1077 tree type
= TREE_TYPE (array_expr
);
1078 tree p1
, p2
, i1
, i2
;
1080 if (type
== error_mark_node
|| index_exp
== error_mark_node
)
1081 return error_mark_node
;
1082 if (processing_template_decl
)
1083 return build_min (ARRAY_REF
, type
? TREE_TYPE (type
) : NULL_TREE
,
1084 array_expr
, index_exp
);
1086 if (type
== NULL_TREE
)
1088 /* Something has gone very wrong. Assume we are mistakenly reducing
1089 an expression instead of a declaration. */
1090 error ("parser may be lost: is there a '{' missing somewhere?");
1094 if (TREE_CODE (type
) == OFFSET_TYPE
1095 || TREE_CODE (type
) == REFERENCE_TYPE
)
1096 type
= TREE_TYPE (type
);
1098 /* If they have an `operator[]', use that. */
1099 if (IS_AGGR_TYPE (type
) || IS_AGGR_TYPE (TREE_TYPE (index_exp
)))
1100 return build_opfncall (ARRAY_REF
, LOOKUP_NORMAL
,
1101 array_expr
, index_exp
, NULL_TREE
);
1103 /* Otherwise, create an ARRAY_REF for a pointer or array type. It
1104 is a little-known fact that, if `a' is an array and `i' is an
1105 int, you can write `i[a]', which means the same thing as `a[i]'. */
1107 if (TREE_CODE (type
) == ARRAY_TYPE
)
1110 p1
= build_expr_type_conversion (WANT_POINTER
, array_expr
, 0);
1112 if (TREE_CODE (TREE_TYPE (index_exp
)) == ARRAY_TYPE
)
1115 p2
= build_expr_type_conversion (WANT_POINTER
, index_exp
, 0);
1117 i1
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, array_expr
, 0);
1118 i2
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, index_exp
, 0);
1120 if ((p1
&& i2
) && (i1
&& p2
))
1121 error ("ambiguous conversion for array subscript");
1124 array_expr
= p1
, index_exp
= i2
;
1126 array_expr
= p2
, index_exp
= i1
;
1129 cp_error ("invalid types `%T[%T]' for array subscript",
1130 type
, TREE_TYPE (index_exp
));
1131 return error_mark_node
;
1134 if (array_expr
== error_mark_node
|| index_exp
== error_mark_node
)
1135 error ("ambiguous conversion for array subscript");
1137 return build_array_ref (array_expr
, index_exp
);
1140 /* Given the cast expression EXP, checking out its validity. Either return
1141 an error_mark_node if there was an unavoidable error, return a cast to
1142 void for trying to delete a pointer w/ the value 0, or return the
1143 call to delete. If DOING_VEC is 1, we handle things differently
1144 for doing an array delete. If DOING_VEC is 2, they gave us the
1145 array size as an argument to delete.
1146 Implements ARM $5.3.4. This is called from the parser. */
1149 delete_sanity (exp
, size
, doing_vec
, use_global_delete
)
1151 int doing_vec
, use_global_delete
;
1154 /* For a regular vector delete (aka, no size argument) we will pass
1155 this down as a NULL_TREE into build_vec_delete. */
1156 tree maxindex
= NULL_TREE
;
1158 if (exp
== error_mark_node
)
1161 if (processing_template_decl
)
1163 t
= build_min (DELETE_EXPR
, void_type_node
, exp
, size
);
1164 DELETE_EXPR_USE_GLOBAL (t
) = use_global_delete
;
1165 DELETE_EXPR_USE_VEC (t
) = doing_vec
;
1169 if (TREE_CODE (exp
) == OFFSET_REF
)
1170 exp
= resolve_offset_ref (exp
);
1171 exp
= convert_from_reference (exp
);
1172 t
= stabilize_reference (exp
);
1173 t
= build_expr_type_conversion (WANT_POINTER
, t
, 1);
1175 if (t
== NULL_TREE
|| t
== error_mark_node
)
1177 cp_error ("type `%#T' argument given to `delete', expected pointer",
1179 return error_mark_node
;
1184 maxindex
= build_binary_op (MINUS_EXPR
, size
, integer_one_node
, 1);
1185 pedwarn ("anachronistic use of array size in vector delete");
1188 type
= TREE_TYPE (t
);
1190 /* As of Valley Forge, you can delete a pointer to const. */
1192 /* You can't delete functions. */
1193 if (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
1195 error ("cannot delete a function");
1196 return error_mark_node
;
1199 /* An array can't have been allocated by new, so complain. */
1200 if (TREE_CODE (t
) == ADDR_EXPR
1201 && TREE_CODE (TREE_OPERAND (t
, 0)) == VAR_DECL
1202 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == ARRAY_TYPE
)
1203 cp_warning ("deleting array `%#D'", TREE_OPERAND (t
, 0));
1205 /* Deleting a pointer with the value zero is valid and has no effect. */
1206 if (integer_zerop (t
))
1207 return build1 (NOP_EXPR
, void_type_node
, t
);
1210 return build_vec_delete (t
, maxindex
, integer_one_node
,
1211 integer_zero_node
, use_global_delete
);
1214 if (IS_AGGR_TYPE (TREE_TYPE (type
))
1215 && TYPE_GETS_REG_DELETE (TREE_TYPE (type
)))
1217 /* Only do access checking here; we'll be calling op delete
1218 from the destructor. */
1219 tree tmp
= build_op_delete_call (DELETE_EXPR
, t
, size_zero_node
,
1220 LOOKUP_NORMAL
, NULL_TREE
);
1221 if (tmp
== error_mark_node
)
1222 return error_mark_node
;
1225 return build_delete (type
, t
, integer_three_node
,
1226 LOOKUP_NORMAL
, use_global_delete
);
1230 /* Report an error if the indicated template declaration is not the
1231 sort of thing that should be a member template. */
1234 check_member_template (tmpl
)
1239 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
1240 decl
= DECL_TEMPLATE_RESULT (tmpl
);
1242 if (TREE_CODE (decl
) == FUNCTION_DECL
1243 || (TREE_CODE (decl
) == TYPE_DECL
1244 && IS_AGGR_TYPE (TREE_TYPE (decl
))))
1246 if (current_function_decl
)
1247 /* 14.5.2.2 [temp.mem]
1249 A local class shall not have member templates. */
1250 cp_error ("declaration of member template `%#D' in local class",
1253 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
1255 /* 14.5.2.3 [temp.mem]
1257 A member function template shall not be virtual. */
1259 ("invalid use of `virtual' in template declaration of `%#D'",
1261 DECL_VIRTUAL_P (decl
) = 0;
1264 /* The debug-information generating code doesn't know what to do
1265 with member templates. */
1266 DECL_IGNORED_P (tmpl
) = 1;
1269 cp_error ("template declaration of `%#D'", decl
);
1272 /* Return true iff TYPE is a valid Java parameter or return type. */
1275 acceptable_java_type (type
)
1278 if (TREE_CODE (type
) == VOID_TYPE
|| TYPE_FOR_JAVA (type
))
1280 if (TREE_CODE (type
) == POINTER_TYPE
)
1282 type
= TREE_TYPE (type
);
1283 if (TREE_CODE (type
) == RECORD_TYPE
)
1286 if (! TYPE_FOR_JAVA (type
))
1288 if (! CLASSTYPE_TEMPLATE_INFO (type
))
1290 args
= CLASSTYPE_TI_ARGS (type
);
1291 i
= TREE_VEC_LENGTH (args
);
1294 type
= TREE_VEC_ELT (args
, i
);
1295 if (TREE_CODE (type
) == POINTER_TYPE
)
1296 type
= TREE_TYPE (type
);
1297 if (! TYPE_FOR_JAVA (type
))
1306 /* For a METHOD in a Java class CTYPE, return 1 if
1307 the parameter and return types are valid Java types.
1308 Otherwise, print appropriate error messages, and return 0. */
1311 check_java_method (method
)
1315 tree arg_types
= TYPE_ARG_TYPES (TREE_TYPE (method
));
1316 tree ret_type
= TREE_TYPE (TREE_TYPE (method
));
1317 if (! acceptable_java_type (ret_type
))
1319 cp_error ("Java method '%D' has non-Java return type `%T'",
1323 for (; arg_types
!= NULL_TREE
; arg_types
= TREE_CHAIN (arg_types
))
1325 tree type
= TREE_VALUE (arg_types
);
1326 if (! acceptable_java_type (type
))
1328 cp_error ("Java method '%D' has non-Java parameter type `%T'",
1333 return jerr
? 0 : 1;
1336 /* Sanity check: report error if this function FUNCTION is not
1337 really a member of the class (CTYPE) it is supposed to belong to.
1338 CNAME is the same here as it is for grokclassfn above. */
1341 check_classfn (ctype
, function
)
1342 tree ctype
, function
;
1344 tree fn_name
= DECL_NAME (function
);
1345 tree fndecl
, fndecls
;
1346 tree method_vec
= CLASSTYPE_METHOD_VEC (complete_type (ctype
));
1349 tree templates
= NULL_TREE
;
1351 if (method_vec
!= 0)
1353 methods
= &TREE_VEC_ELT (method_vec
, 0);
1354 end
= TREE_VEC_END (method_vec
);
1356 /* First suss out ctors and dtors. */
1357 if (*methods
&& fn_name
== DECL_NAME (OVL_CURRENT (*methods
))
1358 && DECL_CONSTRUCTOR_P (function
))
1360 if (*++methods
&& fn_name
== DECL_NAME (OVL_CURRENT (*methods
))
1361 && DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function
)))
1364 while (++methods
!= end
&& *methods
)
1367 if (fn_name
== DECL_NAME (OVL_CURRENT (*methods
)))
1370 for (fndecls
= *methods
; fndecls
!= NULL_TREE
;
1371 fndecls
= OVL_NEXT (fndecls
))
1373 fndecl
= OVL_CURRENT (fndecls
);
1374 /* The DECL_ASSEMBLER_NAME for a TEMPLATE_DECL, or
1375 for a for member function of a template class, is
1376 not mangled, so the check below does not work
1377 correctly in that case. Since mangled destructor
1378 names do not include the type of the arguments,
1379 we can't use this short-cut for them, either.
1380 (It's not legal to declare arguments for a
1381 destructor, but some people try.) */
1382 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function
))
1383 && (DECL_ASSEMBLER_NAME (function
)
1384 != DECL_NAME (function
))
1385 && (DECL_ASSEMBLER_NAME (fndecl
)
1386 != DECL_NAME (fndecl
))
1387 && (DECL_ASSEMBLER_NAME (function
)
1388 == DECL_ASSEMBLER_NAME (fndecl
)))
1391 /* We cannot simply call decls_match because this
1392 doesn't work for static member functions that are
1393 pretending to be methods, and because the name
1394 may have been changed by asm("new_name"). */
1395 if (DECL_NAME (function
) == DECL_NAME (fndecl
))
1397 tree p1
= TYPE_ARG_TYPES (TREE_TYPE (function
));
1398 tree p2
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
1400 /* Get rid of the this parameter on functions that become
1402 if (DECL_STATIC_FUNCTION_P (fndecl
)
1403 && TREE_CODE (TREE_TYPE (function
)) == METHOD_TYPE
)
1404 p1
= TREE_CHAIN (p1
);
1406 if (same_type_p (TREE_TYPE (TREE_TYPE (function
)),
1407 TREE_TYPE (TREE_TYPE (fndecl
)))
1408 && compparms (p1
, p2
)
1409 && (DECL_TEMPLATE_SPECIALIZATION (function
)
1410 == DECL_TEMPLATE_SPECIALIZATION (fndecl
))
1411 && (!DECL_TEMPLATE_SPECIALIZATION (function
)
1412 || (DECL_TI_TEMPLATE (function
)
1413 == DECL_TI_TEMPLATE (fndecl
))))
1416 if (is_member_template (fndecl
))
1417 /* This function might be an instantiation
1418 or specialization of fndecl. */
1420 scratch_tree_cons (NULL_TREE
, fndecl
, templates
);
1425 else if (TREE_CODE (OVL_CURRENT (fndecl
)) == TEMPLATE_DECL
1426 && DECL_CONV_FN_P (OVL_CURRENT (fndecl
))
1427 && DECL_CONV_FN_P (function
))
1428 /* The method in the class is a member template
1429 conversion operator. We are declaring another
1430 conversion operator. It is possible that even though
1431 the names don't match, there is some specialization
1434 scratch_tree_cons (NULL_TREE
, fndecl
, templates
);
1439 /* This function might be an instantiation or a specialization.
1440 We should verify that this is possible. For now, we simply
1441 return NULL_TREE, which lets the caller know that this function
1442 is new, but we don't print an error message. */
1445 if (methods
!= end
&& *methods
)
1447 tree fndecl
= *methods
;
1448 cp_error ("prototype for `%#D' does not match any in class `%T'",
1450 cp_error_at ("candidate%s: %+#D", OVL_NEXT (fndecl
) ? "s are" : " is",
1451 OVL_CURRENT (fndecl
));
1452 while (fndecl
= OVL_NEXT (fndecl
), fndecl
)
1453 cp_error_at (" %#D", OVL_CURRENT(fndecl
));
1458 if (TYPE_SIZE (ctype
) == 0)
1459 incomplete_type_error (function
, ctype
);
1461 cp_error ("no `%#D' member function declared in class `%T'",
1465 /* If we did not find the method in the class, add it to avoid
1466 spurious errors (unless the CTYPE is not yet defined, in which
1467 case we'll only confuse ourselves when the function is declared
1468 properly within the class. */
1469 if (TYPE_SIZE (ctype
))
1470 add_method (ctype
, methods
, function
);
1474 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
1475 of a structure component, returning a FIELD_DECL node.
1476 QUALS is a list of type qualifiers for this decl (such as for declaring
1477 const member functions).
1479 This is done during the parsing of the struct declaration.
1480 The FIELD_DECL nodes are chained together and the lot of them
1481 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
1485 If class A defines that certain functions in class B are friends, then
1486 the way I have set things up, it is B who is interested in permission
1487 granted by A. However, it is in A's context that these declarations
1488 are parsed. By returning a void_type_node, class A does not attempt
1489 to incorporate the declarations of the friends within its structure.
1491 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
1492 CHANGES TO CODE IN `start_method'. */
1495 grokfield (declarator
, declspecs
, init
, asmspec_tree
, attrlist
)
1496 tree declarator
, declspecs
, init
, asmspec_tree
, attrlist
;
1498 register tree value
;
1500 int flags
= LOOKUP_ONLYCONVERTING
;
1502 /* Convert () initializers to = initializers. */
1503 if (init
== NULL_TREE
&& declarator
!= NULL_TREE
1504 && TREE_CODE (declarator
) == CALL_EXPR
1505 && TREE_OPERAND (declarator
, 0)
1506 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) == IDENTIFIER_NODE
1507 || TREE_CODE (TREE_OPERAND (declarator
, 0)) == SCOPE_REF
)
1508 && parmlist_is_exprlist (TREE_OPERAND (declarator
, 1)))
1510 init
= TREE_OPERAND (declarator
, 1);
1511 declarator
= TREE_OPERAND (declarator
, 0);
1515 if (declspecs
== NULL_TREE
1516 && TREE_CODE (declarator
) == SCOPE_REF
1517 && TREE_CODE (TREE_OPERAND (declarator
, 1)) == IDENTIFIER_NODE
)
1519 /* Access declaration */
1520 if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator
, 0))))
1522 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
1523 pop_nested_class (1);
1524 return do_class_using_decl (declarator
);
1528 && TREE_CODE (init
) == TREE_LIST
1529 && TREE_VALUE (init
) == error_mark_node
1530 && TREE_CHAIN (init
) == NULL_TREE
)
1533 value
= grokdeclarator (declarator
, declspecs
, FIELD
, init
!= 0, NULL_TREE
);
1534 if (! value
|| value
== error_mark_node
)
1535 /* friend or constructor went bad. */
1538 /* Pass friendly classes back. */
1539 if (TREE_CODE (value
) == VOID_TYPE
)
1540 return void_type_node
;
1542 if (DECL_NAME (value
) != NULL_TREE
1543 && IDENTIFIER_POINTER (DECL_NAME (value
))[0] == '_'
1544 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value
)), "_vptr"))
1545 cp_error ("member `%D' conflicts with virtual function table field name",
1548 /* Stash away type declarations. */
1549 if (TREE_CODE (value
) == TYPE_DECL
)
1551 DECL_NONLOCAL (value
) = 1;
1552 DECL_CONTEXT (value
) = current_class_type
;
1553 DECL_CLASS_CONTEXT (value
) = current_class_type
;
1555 /* Now that we've updated the context, we need to remangle the
1556 name for this TYPE_DECL. */
1557 DECL_ASSEMBLER_NAME (value
) = DECL_NAME (value
);
1558 if (!uses_template_parms (value
))
1559 DECL_ASSEMBLER_NAME (value
) =
1560 get_identifier (build_overload_name (TREE_TYPE (value
), 1, 1));
1562 pushdecl_class_level (value
);
1566 if (IS_SIGNATURE (current_class_type
)
1567 && TREE_CODE (value
) != FUNCTION_DECL
)
1569 error ("field declaration not allowed in signature");
1570 return void_type_node
;
1573 if (DECL_IN_AGGR_P (value
))
1575 cp_error ("`%D' is already defined in `%T'", value
,
1576 DECL_CONTEXT (value
));
1577 return void_type_node
;
1581 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
1585 if (IS_SIGNATURE (current_class_type
)
1586 && TREE_CODE (value
) == FUNCTION_DECL
)
1588 error ("function declarations cannot have initializers in signature");
1591 else if (TREE_CODE (value
) == FUNCTION_DECL
)
1593 grok_function_init (value
, init
);
1596 else if (pedantic
&& TREE_CODE (value
) != VAR_DECL
)
1597 /* Already complained in grokdeclarator. */
1601 /* We allow initializers to become parameters to base
1603 if (TREE_CODE (init
) == TREE_LIST
)
1605 if (TREE_CHAIN (init
) == NULL_TREE
)
1606 init
= TREE_VALUE (init
);
1608 init
= digest_init (TREE_TYPE (value
), init
, (tree
*)0);
1611 if (TREE_CODE (init
) == CONST_DECL
)
1612 init
= DECL_INITIAL (init
);
1613 else if (TREE_READONLY_DECL_P (init
))
1614 init
= decl_constant_value (init
);
1615 else if (TREE_CODE (init
) == CONSTRUCTOR
)
1616 init
= digest_init (TREE_TYPE (value
), init
, (tree
*)0);
1617 my_friendly_assert (TREE_PERMANENT (init
), 192);
1618 if (init
== error_mark_node
)
1619 /* We must make this look different than `error_mark_node'
1620 because `decl_const_value' would mis-interpret it
1621 as only meaning that this VAR_DECL is defined. */
1622 init
= build1 (NOP_EXPR
, TREE_TYPE (value
), init
);
1623 else if (processing_template_decl
)
1625 else if (! TREE_CONSTANT (init
))
1627 /* We can allow references to things that are effectively
1628 static, since references are initialized with the address. */
1629 if (TREE_CODE (TREE_TYPE (value
)) != REFERENCE_TYPE
1630 || (TREE_STATIC (init
) == 0
1631 && (TREE_CODE_CLASS (TREE_CODE (init
)) != 'd'
1632 || DECL_EXTERNAL (init
) == 0)))
1634 error ("field initializer is not constant");
1635 init
= error_mark_node
;
1641 /* The corresponding pop_obstacks is in cp_finish_decl. */
1642 push_obstacks_nochange ();
1644 if (processing_template_decl
&& ! current_function_decl
1645 && (TREE_CODE (value
) == VAR_DECL
|| TREE_CODE (value
) == FUNCTION_DECL
))
1646 value
= push_template_decl (value
);
1648 check_template_shadow (value
);
1651 cplus_decl_attributes (value
, TREE_PURPOSE (attrlist
),
1652 TREE_VALUE (attrlist
));
1654 if (TREE_CODE (value
) == VAR_DECL
)
1656 my_friendly_assert (TREE_PUBLIC (value
), 0);
1658 /* We cannot call pushdecl here, because that would
1659 fill in the value of our TREE_CHAIN. Instead, we
1660 modify cp_finish_decl to do the right thing, namely, to
1661 put this decl out straight away. */
1662 /* current_class_type can be NULL_TREE in case of error. */
1663 if (asmspec
== 0 && current_class_type
)
1665 TREE_PUBLIC (value
) = 1;
1666 DECL_INITIAL (value
) = error_mark_node
;
1667 DECL_ASSEMBLER_NAME (value
)
1668 = build_static_name (current_class_type
, DECL_NAME (value
));
1670 if (! processing_template_decl
)
1671 pending_statics
= perm_tree_cons (NULL_TREE
, value
, pending_statics
);
1673 /* Static consts need not be initialized in the class definition. */
1674 if (init
!= NULL_TREE
&& TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (value
)))
1676 static int explanation
= 0;
1678 error ("initializer invalid for static member with constructor");
1679 if (explanation
++ == 0)
1680 error ("(you really want to initialize it separately)");
1683 /* Force the compiler to know when an uninitialized static
1684 const member is being used. */
1685 if (CP_TYPE_CONST_P (TREE_TYPE (value
)) && init
== 0)
1686 TREE_USED (value
) = 1;
1687 DECL_INITIAL (value
) = init
;
1688 DECL_IN_AGGR_P (value
) = 1;
1689 DECL_CONTEXT (value
) = current_class_type
;
1690 DECL_CLASS_CONTEXT (value
) = current_class_type
;
1692 cp_finish_decl (value
, init
, asmspec_tree
, 1, flags
);
1693 pushdecl_class_level (value
);
1696 if (TREE_CODE (value
) == FIELD_DECL
)
1700 /* This must override the asm specifier which was placed
1701 by grokclassfn. Lay this out fresh. */
1702 DECL_RTL (value
) = NULL_RTX
;
1703 DECL_ASSEMBLER_NAME (value
) = get_identifier (asmspec
);
1705 if (DECL_INITIAL (value
) == error_mark_node
)
1706 init
= error_mark_node
;
1707 cp_finish_decl (value
, init
, asmspec_tree
, 1, flags
);
1708 DECL_INITIAL (value
) = init
;
1709 DECL_IN_AGGR_P (value
) = 1;
1712 if (TREE_CODE (value
) == FUNCTION_DECL
)
1716 /* This must override the asm specifier which was placed
1717 by grokclassfn. Lay this out fresh. */
1718 DECL_RTL (value
) = NULL_RTX
;
1719 DECL_ASSEMBLER_NAME (value
) = get_identifier (asmspec
);
1721 cp_finish_decl (value
, init
, asmspec_tree
, 1, flags
);
1723 /* Pass friends back this way. */
1724 if (DECL_FRIEND_P (value
))
1725 return void_type_node
;
1727 #if 0 /* Just because a fn is declared doesn't mean we'll try to define it. */
1728 if (current_function_decl
&& ! IS_SIGNATURE (current_class_type
))
1729 cp_error ("method `%#D' of local class must be defined in class body",
1733 DECL_IN_AGGR_P (value
) = 1;
1736 my_friendly_abort (21);
1741 /* Like `grokfield', but for bitfields.
1742 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
1745 grokbitfield (declarator
, declspecs
, width
)
1746 tree declarator
, declspecs
, width
;
1748 register tree value
= grokdeclarator (declarator
, declspecs
, BITFIELD
,
1751 if (! value
) return NULL_TREE
; /* friends went bad. */
1753 /* Pass friendly classes back. */
1754 if (TREE_CODE (value
) == VOID_TYPE
)
1755 return void_type_node
;
1757 if (TREE_CODE (value
) == TYPE_DECL
)
1759 cp_error ("cannot declare `%D' to be a bitfield type", value
);
1763 /* Usually, finish_struct_1 catches bitifields with invalid types.
1764 But, in the case of bitfields with function type, we confuse
1765 ourselves into thinking they are member functions, so we must
1767 if (TREE_CODE (value
) == FUNCTION_DECL
)
1769 cp_error ("cannot declare bitfield `%D' with funcion type",
1774 if (IS_SIGNATURE (current_class_type
))
1776 error ("field declaration not allowed in signature");
1777 return void_type_node
;
1780 if (DECL_IN_AGGR_P (value
))
1782 cp_error ("`%D' is already defined in the class %T", value
,
1783 DECL_CONTEXT (value
));
1784 return void_type_node
;
1787 GNU_xref_member (current_class_name
, value
);
1789 if (TREE_STATIC (value
))
1791 cp_error ("static member `%D' cannot be a bitfield", value
);
1794 cp_finish_decl (value
, NULL_TREE
, NULL_TREE
, 0, 0);
1796 if (width
!= error_mark_node
)
1798 constant_expression_warning (width
);
1799 DECL_INITIAL (value
) = width
;
1800 SET_DECL_C_BIT_FIELD (value
);
1803 DECL_IN_AGGR_P (value
) = 1;
1808 grokoptypename (declspecs
, declarator
)
1809 tree declspecs
, declarator
;
1811 tree t
= grokdeclarator (declarator
, declspecs
, TYPENAME
, 0, NULL_TREE
);
1812 return build_typename_overload (t
);
1815 /* When a function is declared with an initializer,
1816 do the right thing. Currently, there are two possibilities:
1821 // initialization possibility #1.
1822 virtual void f () = 0;
1844 // initialization possibility #2
1851 copy_assignment_arg_p (parmtype
, virtualp
)
1853 int virtualp ATTRIBUTE_UNUSED
;
1855 if (current_class_type
== NULL_TREE
)
1858 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
)
1859 parmtype
= TREE_TYPE (parmtype
);
1861 if ((TYPE_MAIN_VARIANT (parmtype
) == current_class_type
)
1863 /* Non-standard hack to support old Booch components. */
1864 || (! virtualp
&& DERIVED_FROM_P (parmtype
, current_class_type
))
1873 grok_function_init (decl
, init
)
1877 /* An initializer for a function tells how this function should
1879 tree type
= TREE_TYPE (decl
);
1881 if (TREE_CODE (type
) == FUNCTION_TYPE
)
1882 cp_error ("initializer specified for non-member function `%D'", decl
);
1884 /* We'll check for this in finish_struct_1. */
1885 else if (DECL_VINDEX (decl
) == NULL_TREE
)
1886 cp_error ("initializer specified for non-virtual method `%D'", decl
);
1888 else if (integer_zerop (init
))
1891 /* Mark this function as being "defined". */
1892 DECL_INITIAL (decl
) = error_mark_node
;
1893 /* pure virtual destructors must be defined. */
1894 /* pure virtual needs to be defined (as abort) only when put in
1895 vtbl. For wellformed call, it should be itself. pr4737 */
1896 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl
)))
1898 extern tree abort_fndecl
;
1899 /* Give this node rtl from `abort'. */
1900 DECL_RTL (decl
) = DECL_RTL (abort_fndecl
);
1903 DECL_ABSTRACT_VIRTUAL_P (decl
) = 1;
1904 if (DECL_NAME (decl
) == ansi_opname
[(int) MODIFY_EXPR
])
1907 = TREE_VALUE (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
))));
1909 if (copy_assignment_arg_p (parmtype
, 1))
1910 TYPE_HAS_ABSTRACT_ASSIGN_REF (current_class_type
) = 1;
1914 cp_error ("invalid initializer for virtual method `%D'", decl
);
1918 cplus_decl_attributes (decl
, attributes
, prefix_attributes
)
1919 tree decl
, attributes
, prefix_attributes
;
1921 if (decl
== NULL_TREE
|| decl
== void_type_node
)
1924 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
1925 decl
= DECL_TEMPLATE_RESULT (decl
);
1927 decl_attributes (decl
, attributes
, prefix_attributes
);
1929 if (TREE_CODE (decl
) == TYPE_DECL
)
1930 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (decl
), TREE_TYPE (decl
));
1933 /* CONSTRUCTOR_NAME:
1934 Return the name for the constructor (or destructor) for the
1935 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1936 IDENTIFIER_NODE. When given a template, this routine doesn't
1937 lose the specialization. */
1940 constructor_name_full (thing
)
1943 if (TREE_CODE (thing
) == TEMPLATE_TYPE_PARM
1944 || TREE_CODE (thing
) == TEMPLATE_TEMPLATE_PARM
1945 || TREE_CODE (thing
) == TYPENAME_TYPE
)
1946 thing
= TYPE_NAME (thing
);
1947 else if (IS_AGGR_TYPE_CODE (TREE_CODE (thing
)))
1949 if (TYPE_WAS_ANONYMOUS (thing
) && TYPE_HAS_CONSTRUCTOR (thing
))
1950 thing
= DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (thing
), 0)));
1952 thing
= TYPE_NAME (thing
);
1954 if (TREE_CODE (thing
) == TYPE_DECL
1955 || (TREE_CODE (thing
) == TEMPLATE_DECL
1956 && TREE_CODE (DECL_TEMPLATE_RESULT (thing
)) == TYPE_DECL
))
1957 thing
= DECL_NAME (thing
);
1958 my_friendly_assert (TREE_CODE (thing
) == IDENTIFIER_NODE
, 197);
1962 /* CONSTRUCTOR_NAME:
1963 Return the name for the constructor (or destructor) for the
1964 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1965 IDENTIFIER_NODE. When given a template, return the plain
1966 unspecialized name. */
1969 constructor_name (thing
)
1973 thing
= constructor_name_full (thing
);
1974 t
= IDENTIFIER_TEMPLATE (thing
);
1980 /* Cache the value of this class's main virtual function table pointer
1981 in a register variable. This will save one indirection if a
1982 more than one virtual function call is made this function. */
1987 extern tree base_init_expr
;
1989 if (base_init_expr
== 0
1990 && DECL_CONSTRUCTOR_P (current_function_decl
))
1992 if (processing_template_decl
)
1993 add_tree (build_min_nt
1995 current_member_init_list
, current_base_init_list
));
1997 emit_base_init (current_class_type
, 0);
2001 /* Record the existence of an addressable inline function. */
2004 mark_inline_for_output (decl
)
2007 decl
= DECL_MAIN_VARIANT (decl
);
2008 if (DECL_SAVED_INLINE (decl
))
2010 my_friendly_assert (TREE_PERMANENT (decl
), 363);
2011 DECL_SAVED_INLINE (decl
) = 1;
2013 if (DECL_PENDING_INLINE_INFO (decl
) != 0
2014 && ! DECL_PENDING_INLINE_INFO (decl
)->deja_vu
)
2016 struct pending_inline
*t
= pending_inlines
;
2017 my_friendly_assert (DECL_SAVED_INSNS (decl
) == 0, 198);
2020 if (t
== DECL_PENDING_INLINE_INFO (decl
))
2026 t
= DECL_PENDING_INLINE_INFO (decl
);
2027 t
->next
= pending_inlines
;
2028 pending_inlines
= t
;
2030 DECL_PENDING_INLINE_INFO (decl
) = 0;
2033 saved_inlines
= perm_tree_cons (NULL_TREE
, decl
, saved_inlines
);
2039 temp_name_counter
= 0;
2042 /* Hand off a unique name which can be used for variable we don't really
2043 want to know about anyway, for example, the anonymous variables which
2044 are needed to make references work. Declare this thing so we can use it.
2045 The variable created will be of type TYPE.
2047 STATICP is nonzero if this variable should be static. */
2050 get_temp_name (type
, staticp
)
2054 char buf
[sizeof (AUTO_TEMP_FORMAT
) + 20];
2056 int toplev
= toplevel_bindings_p ();
2058 push_obstacks_nochange ();
2059 if (toplev
|| staticp
)
2061 end_temporary_allocation ();
2062 sprintf (buf
, AUTO_TEMP_FORMAT
, global_temp_name_counter
++);
2063 decl
= pushdecl_top_level (build_decl (VAR_DECL
, get_identifier (buf
), type
));
2067 sprintf (buf
, AUTO_TEMP_FORMAT
, temp_name_counter
++);
2068 decl
= pushdecl (build_decl (VAR_DECL
, get_identifier (buf
), type
));
2070 TREE_USED (decl
) = 1;
2071 TREE_STATIC (decl
) = staticp
;
2072 DECL_ARTIFICIAL (decl
) = 1;
2074 /* If this is a local variable, then lay out its rtl now.
2075 Otherwise, callers of this function are responsible for dealing
2076 with this variable's rtl. */
2080 expand_decl_init (decl
);
2087 /* Get a variable which we can use for multiple assignments.
2088 It is not entered into current_binding_level, because
2089 that breaks things when it comes time to do final cleanups
2090 (which take place "outside" the binding contour of the function). */
2093 get_temp_regvar (type
, init
)
2098 decl
= build_decl (VAR_DECL
, NULL_TREE
, type
);
2099 TREE_USED (decl
) = 1;
2100 DECL_REGISTER (decl
) = 1;
2101 DECL_ARTIFICIAL (decl
) = 1;
2103 DECL_RTL (decl
) = assign_temp (type
, 2, 0, 1);
2104 /* We can expand these without fear, since they cannot need
2105 constructors or destructors. */
2106 expand_expr (build_modify_expr (decl
, INIT_EXPR
, init
),
2107 NULL_RTX
, VOIDmode
, 0);
2112 /* Hunts through the global anonymous union ANON_DECL, building
2113 appropriate VAR_DECLs. Stores cleanups on the list of ELEMS, and
2114 returns a VAR_DECL whose size is the same as the size of the
2115 ANON_DECL, if one is available. */
2118 build_anon_union_vars (anon_decl
, elems
, static_p
, external_p
)
2124 tree type
= TREE_TYPE (anon_decl
);
2125 tree main_decl
= NULL_TREE
;
2128 for (field
= TYPE_FIELDS (type
);
2130 field
= TREE_CHAIN (field
))
2134 if (DECL_ARTIFICIAL (field
))
2136 if (TREE_CODE (field
) != FIELD_DECL
)
2138 cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members",
2143 if (TREE_PRIVATE (field
))
2144 cp_pedwarn_at ("private member `%#D' in anonymous union", field
);
2145 else if (TREE_PROTECTED (field
))
2146 cp_pedwarn_at ("protected member `%#D' in anonymous union", field
);
2148 if (DECL_NAME (field
) == NULL_TREE
2149 && TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
)
2151 decl
= build_anon_union_vars (field
, elems
, static_p
, external_p
);
2155 else if (DECL_NAME (field
) == NULL_TREE
)
2159 decl
= build_decl (VAR_DECL
, DECL_NAME (field
), TREE_TYPE (field
));
2160 /* tell `pushdecl' that this is not tentative. */
2161 DECL_INITIAL (decl
) = error_mark_node
;
2162 TREE_PUBLIC (decl
) = 0;
2163 TREE_STATIC (decl
) = static_p
;
2164 DECL_EXTERNAL (decl
) = external_p
;
2165 decl
= pushdecl (decl
);
2166 DECL_INITIAL (decl
) = NULL_TREE
;
2169 /* Only write out one anon union element--choose the one that
2170 can hold them all. */
2171 if (main_decl
== NULL_TREE
2172 && simple_cst_equal (DECL_SIZE (decl
),
2173 DECL_SIZE (anon_decl
)) == 1)
2176 /* ??? This causes there to be no debug info written out
2178 TREE_ASM_WRITTEN (decl
) = 1;
2180 if (DECL_NAME (field
) == NULL_TREE
2181 && TREE_CODE (TREE_TYPE (field
)) == UNION_TYPE
)
2182 /* The remainder of the processing was already done in the
2186 /* If there's a cleanup to do, it belongs in the
2187 TREE_PURPOSE of the following TREE_LIST. */
2188 *elems
= scratch_tree_cons (NULL_TREE
, decl
, *elems
);
2189 TREE_TYPE (*elems
) = type
;
2195 /* Finish off the processing of a UNION_TYPE structure.
2196 If there are static members, then all members are
2197 static, and must be laid out together. If the
2198 union is an anonymous union, we arrange for that
2199 as well. PUBLIC_P is nonzero if this union is
2200 not declared static. */
2203 finish_anon_union (anon_union_decl
)
2204 tree anon_union_decl
;
2206 tree type
= TREE_TYPE (anon_union_decl
);
2207 tree elems
= NULL_TREE
;
2209 int public_p
= TREE_PUBLIC (anon_union_decl
);
2210 int static_p
= TREE_STATIC (anon_union_decl
);
2211 int external_p
= DECL_EXTERNAL (anon_union_decl
);
2213 if (TYPE_FIELDS (type
) == NULL_TREE
)
2218 error ("global anonymous unions must be declared static");
2222 main_decl
= build_anon_union_vars (anon_union_decl
, &elems
,
2223 static_p
, external_p
);
2225 if (main_decl
== NULL_TREE
)
2227 warning ("anonymous union with no members");
2233 make_decl_rtl (main_decl
, 0, toplevel_bindings_p ());
2234 DECL_RTL (anon_union_decl
) = DECL_RTL (main_decl
);
2237 /* The following call assumes that there are never any cleanups
2238 for anonymous unions--a reasonable assumption. */
2239 expand_anon_union_decl (anon_union_decl
, NULL_TREE
, elems
);
2242 /* Finish processing a builtin type TYPE. It's name is NAME,
2243 its fields are in the array FIELDS. LEN is the number of elements
2244 in FIELDS minus one, or put another way, it is the maximum subscript
2247 It is given the same alignment as ALIGN_TYPE. */
2250 finish_builtin_type (type
, name
, fields
, len
, align_type
)
2259 TYPE_FIELDS (type
) = fields
[0];
2260 for (i
= 0; i
< len
; i
++)
2262 layout_type (TREE_TYPE (fields
[i
]));
2263 DECL_FIELD_CONTEXT (fields
[i
]) = type
;
2264 TREE_CHAIN (fields
[i
]) = fields
[i
+1];
2266 DECL_FIELD_CONTEXT (fields
[i
]) = type
;
2267 DECL_CLASS_CONTEXT (fields
[i
]) = type
;
2268 TYPE_ALIGN (type
) = TYPE_ALIGN (align_type
);
2270 #if 0 /* not yet, should get fixed properly later */
2271 TYPE_NAME (type
) = make_type_decl (get_identifier (name
), type
);
2273 TYPE_NAME (type
) = build_decl (TYPE_DECL
, get_identifier (name
), type
);
2275 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2276 layout_decl (TYPE_NAME (type
), 0);
2279 /* Auxiliary functions to make type signatures for
2280 `operator new' and `operator delete' correspond to
2281 what compiler will be expecting. */
2284 coerce_new_type (type
)
2289 if (TREE_CODE (type
) == METHOD_TYPE
)
2290 type
= build_function_type (TREE_TYPE (type
), TREE_CHAIN (TYPE_ARG_TYPES (type
)));
2291 if (! same_type_p (TREE_TYPE (type
), ptr_type_node
))
2292 e1
= 1, error ("`operator new' must return type `void *'");
2294 /* Technically the type must be `size_t', but we may not know
2296 if (TYPE_ARG_TYPES (type
) == NULL_TREE
)
2297 e1
= 1, error ("`operator new' takes type `size_t' parameter");
2298 else if (! same_type_p (TREE_VALUE (TYPE_ARG_TYPES (type
)), sizetype
))
2299 e2
= 1, error ("`operator new' takes type `size_t' as first parameter");
2301 type
= build_function_type (ptr_type_node
, tree_cons (NULL_TREE
, sizetype
, TREE_CHAIN (TYPE_ARG_TYPES (type
))));
2303 type
= build_function_type (ptr_type_node
, TYPE_ARG_TYPES (type
));
2308 coerce_delete_type (type
)
2315 tree arg_types
= TYPE_ARG_TYPES (type
);
2317 if (TREE_CODE (type
) == METHOD_TYPE
)
2319 type
= build_function_type (TREE_TYPE (type
), TREE_CHAIN (arg_types
));
2320 arg_types
= TREE_CHAIN (arg_types
);
2323 if (TREE_TYPE (type
) != void_type_node
)
2324 e1
= 1, error ("`operator delete' must return type `void'");
2326 if (arg_types
== NULL_TREE
2327 || ! same_type_p (TREE_VALUE (arg_types
), ptr_type_node
))
2328 e2
= 1, error ("`operator delete' takes type `void *' as first parameter");
2332 && TREE_CHAIN (arg_types
)
2333 && TREE_CHAIN (arg_types
) != void_list_node
)
2335 /* Again, technically this argument must be `size_t', but again
2336 we may not know what that is. */
2337 tree t2
= TREE_VALUE (TREE_CHAIN (arg_types
));
2338 if (! same_type_p (t2
, sizetype
))
2339 e3
= 1, error ("second argument to `operator delete' must be of type `size_t'");
2340 else if (TREE_CHAIN (TREE_CHAIN (arg_types
)) != void_list_node
)
2343 if (TREE_CHAIN (TREE_CHAIN (arg_types
)))
2344 error ("too many arguments in declaration of `operator delete'");
2346 error ("`...' invalid in specification of `operator delete'");
2351 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
,
2352 build_tree_list (NULL_TREE
, sizetype
));
2355 if (arg_types
== NULL_TREE
)
2356 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
2358 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, TREE_CHAIN (arg_types
));
2364 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
,
2365 arg_types
? TREE_CHAIN (arg_types
): NULL_TREE
);
2367 type
= build_function_type (void_type_node
, arg_types
);
2372 extern tree abort_fndecl
;
2375 mark_vtable_entries (decl
)
2378 tree entries
= CONSTRUCTOR_ELTS (DECL_INITIAL (decl
));
2382 tree fnaddr
= (flag_vtable_thunks
? TREE_VALUE (TREE_CHAIN (entries
))
2383 : FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (entries
)));
2384 tree fn
= TREE_OPERAND (fnaddr
, 0);
2385 TREE_ADDRESSABLE (fn
) = 1;
2388 skip_rtti_stuff (&entries
);
2390 for (; entries
; entries
= TREE_CHAIN (entries
))
2392 tree fnaddr
= (flag_vtable_thunks
? TREE_VALUE (entries
)
2393 : FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (entries
)));
2394 tree fn
= TREE_OPERAND (fnaddr
, 0);
2395 TREE_ADDRESSABLE (fn
) = 1;
2396 if (DECL_LANG_SPECIFIC (fn
) && DECL_ABSTRACT_VIRTUAL_P (fn
))
2398 TREE_OPERAND (fnaddr
, 0) = fn
= copy_node (fn
);
2399 DECL_RTL (fn
) = DECL_RTL (abort_fndecl
);
2400 mark_used (abort_fndecl
);
2402 if (TREE_CODE (fn
) == THUNK_DECL
&& DECL_EXTERNAL (fn
))
2404 DECL_EXTERNAL (fn
) = 0;
2411 /* Set DECL up to have the closest approximation of "initialized common"
2412 linkage available. */
2415 comdat_linkage (decl
)
2419 make_decl_one_only (decl
);
2421 TREE_PUBLIC (decl
) = 0;
2423 if (DECL_LANG_SPECIFIC (decl
))
2424 DECL_COMDAT (decl
) = 1;
2427 /* For win32 we also want to put explicit instantiations in
2428 linkonce sections, so that they will be merged with implicit
2429 instantiations; otherwise we get duplicate symbol errors. */
2432 maybe_make_one_only (decl
)
2435 /* This is not necessary on targets that support weak symbols, because
2436 the implicit instantiations will defer to the explicit one. */
2437 if (! supports_one_only () || SUPPORTS_WEAK
)
2440 /* We can't set DECL_COMDAT on functions, or finish_file will think
2441 we can get away with not emitting them if they aren't used.
2442 We can't use make_decl_one_only for variables, because their
2443 DECL_INITIAL may not have been set properly yet. */
2445 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2446 make_decl_one_only (decl
);
2448 comdat_linkage (decl
);
2451 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
2452 based on TYPE and other static flags.
2454 Note that anything public is tagged TREE_PUBLIC, whether
2455 it's public in this file or in another one. */
2458 import_export_vtable (decl
, type
, final
)
2462 if (DECL_INTERFACE_KNOWN (decl
))
2465 if (TYPE_FOR_JAVA (type
))
2467 TREE_PUBLIC (decl
) = 1;
2468 DECL_EXTERNAL (decl
) = 1;
2469 DECL_INTERFACE_KNOWN (decl
) = 1;
2471 else if (CLASSTYPE_INTERFACE_KNOWN (type
))
2473 TREE_PUBLIC (decl
) = 1;
2474 DECL_EXTERNAL (decl
) = ! CLASSTYPE_VTABLE_NEEDS_WRITING (type
);
2475 DECL_INTERFACE_KNOWN (decl
) = 1;
2477 /* Always make vtables weak. */
2479 comdat_linkage (decl
);
2483 /* We can only wait to decide if we have real non-inline virtual
2484 functions in our class, or if we come from a template. */
2486 int found
= CLASSTYPE_TEMPLATE_INSTANTIATION (type
);
2488 if (! found
&& ! final
)
2491 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
2492 method
= TREE_CHAIN (method
))
2493 if (DECL_VINDEX (method
) != NULL_TREE
2494 && ! DECL_THIS_INLINE (method
)
2495 && ! DECL_ABSTRACT_VIRTUAL_P (method
))
2502 if (final
|| ! found
)
2504 comdat_linkage (decl
);
2505 DECL_EXTERNAL (decl
) = 0;
2509 TREE_PUBLIC (decl
) = 1;
2510 DECL_EXTERNAL (decl
) = 1;
2515 /* Determine whether or not we want to specifically import or export CTYPE,
2516 using various heuristics. */
2519 import_export_class (ctype
)
2522 /* -1 for imported, 1 for exported. */
2523 int import_export
= 0;
2525 if (CLASSTYPE_INTERFACE_KNOWN (ctype
))
2528 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
2529 /* FIXME this should really use some sort of target-independent macro. */
2530 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype
)))
2532 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype
)))
2536 /* If we got -fno-implicit-templates, we import template classes that
2537 weren't explicitly instantiated. */
2538 if (import_export
== 0
2539 && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype
)
2540 && ! flag_implicit_templates
)
2543 /* Base our import/export status on that of the first non-inline,
2544 non-abstract virtual function, if any. */
2545 if (import_export
== 0
2546 && TYPE_VIRTUAL_P (ctype
)
2547 && ! CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2550 for (method
= TYPE_METHODS (ctype
); method
!= NULL_TREE
;
2551 method
= TREE_CHAIN (method
))
2553 if (DECL_VINDEX (method
) != NULL_TREE
2554 && !DECL_THIS_INLINE (method
)
2555 && !DECL_ABSTRACT_VIRTUAL_P (method
))
2557 import_export
= (DECL_REALLY_EXTERN (method
) ? -1 : 1);
2563 #ifdef MULTIPLE_SYMBOL_SPACES
2564 if (import_export
== -1)
2570 SET_CLASSTYPE_INTERFACE_KNOWN (ctype
);
2571 CLASSTYPE_VTABLE_NEEDS_WRITING (ctype
) = (import_export
> 0);
2572 CLASSTYPE_INTERFACE_ONLY (ctype
) = (import_export
< 0);
2576 /* We need to describe to the assembler the relationship between
2577 a vtable and the vtable of the parent class. */
2580 output_vtable_inherit (vars
)
2586 op
[0] = XEXP (DECL_RTL (vars
), 0); /* strip the mem ref */
2588 parent
= binfo_for_vtable (vars
);
2590 if (parent
== TYPE_BINFO (DECL_CONTEXT (vars
)))
2594 parent
= TYPE_BINFO_VTABLE (BINFO_TYPE (parent
));
2595 op
[1] = XEXP (DECL_RTL (parent
), 0); /* strip the mem ref */
2598 my_friendly_abort (980826);
2600 output_asm_insn (".vtable_inherit %c0, %c1", op
);
2604 finish_vtable_vardecl (prev
, vars
)
2607 tree ctype
= DECL_CONTEXT (vars
);
2608 import_export_class (ctype
);
2609 import_export_vtable (vars
, ctype
, 1);
2611 if (! DECL_EXTERNAL (vars
)
2612 && (DECL_INTERFACE_KNOWN (vars
)
2613 || TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (vars
))
2614 || (hack_decl_function_context (vars
) && TREE_USED (vars
)))
2615 && ! TREE_ASM_WRITTEN (vars
))
2618 mark_vtable_entries (vars
);
2619 if (TREE_TYPE (DECL_INITIAL (vars
)) == 0)
2620 store_init_value (vars
, DECL_INITIAL (vars
));
2622 if (write_symbols
== DWARF_DEBUG
|| write_symbols
== DWARF2_DEBUG
)
2624 /* Mark the VAR_DECL node representing the vtable itself as a
2625 "gratuitous" one, thereby forcing dwarfout.c to ignore it.
2626 It is rather important that such things be ignored because
2627 any effort to actually generate DWARF for them will run
2628 into trouble when/if we encounter code like:
2631 struct S { virtual void member (); };
2633 because the artificial declaration of the vtable itself (as
2634 manufactured by the g++ front end) will say that the vtable
2635 is a static member of `S' but only *after* the debug output
2636 for the definition of `S' has already been output. This causes
2637 grief because the DWARF entry for the definition of the vtable
2638 will try to refer back to an earlier *declaration* of the
2639 vtable as a static member of `S' and there won't be one.
2640 We might be able to arrange to have the "vtable static member"
2641 attached to the member list for `S' before the debug info for
2642 `S' get written (which would solve the problem) but that would
2643 require more intrusive changes to the g++ front end. */
2645 DECL_IGNORED_P (vars
) = 1;
2648 rest_of_decl_compilation (vars
, NULL_PTR
, 1, 1);
2651 output_vtable_inherit (vars
);
2655 else if (! TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (vars
)))
2656 /* We don't know what to do with this one yet. */
2659 /* We know that PREV must be non-zero here. */
2660 TREE_CHAIN (prev
) = TREE_CHAIN (vars
);
2665 prune_vtable_vardecl (prev
, vars
)
2668 /* We know that PREV must be non-zero here. */
2669 TREE_CHAIN (prev
) = TREE_CHAIN (vars
);
2674 walk_vtables (typedecl_fn
, vardecl_fn
)
2675 register void (*typedecl_fn
) PROTO ((tree
, tree
));
2676 register int (*vardecl_fn
) PROTO ((tree
, tree
));
2681 for (prev
= 0, vars
= getdecls (); vars
; vars
= TREE_CHAIN (vars
))
2683 register tree type
= TREE_TYPE (vars
);
2685 if (TREE_CODE (vars
) == VAR_DECL
&& DECL_VIRTUAL_P (vars
))
2688 flag
|= (*vardecl_fn
) (prev
, vars
);
2690 if (prev
&& TREE_CHAIN (prev
) != vars
)
2693 else if (TREE_CODE (vars
) == TYPE_DECL
2694 && type
!= error_mark_node
2695 && TYPE_LANG_SPECIFIC (type
)
2696 && CLASSTYPE_VSIZE (type
))
2698 if (typedecl_fn
) (*typedecl_fn
) (prev
, vars
);
2708 finish_sigtable_vardecl (prev
, vars
)
2711 /* We don't need to mark sigtable entries as addressable here as is done
2712 for vtables. Since sigtables, unlike vtables, are always written out,
2713 that was already done in build_signature_table_constructor. */
2715 rest_of_decl_compilation (vars
, NULL_PTR
, 1, 1);
2717 /* We know that PREV must be non-zero here. */
2718 TREE_CHAIN (prev
) = TREE_CHAIN (vars
);
2722 walk_sigtables (typedecl_fn
, vardecl_fn
)
2723 register void (*typedecl_fn
) PROTO((tree
, tree
));
2724 register void (*vardecl_fn
) PROTO((tree
, tree
));
2728 for (prev
= 0, vars
= getdecls (); vars
; vars
= TREE_CHAIN (vars
))
2730 register tree type
= TREE_TYPE (vars
);
2732 if (TREE_CODE (vars
) == TYPE_DECL
2733 && type
!= error_mark_node
2734 && IS_SIGNATURE (type
))
2736 if (typedecl_fn
) (*typedecl_fn
) (prev
, vars
);
2738 else if (TREE_CODE (vars
) == VAR_DECL
2739 && TREE_TYPE (vars
) != error_mark_node
2740 && IS_SIGNATURE (TREE_TYPE (vars
)))
2742 if (vardecl_fn
) (*vardecl_fn
) (prev
, vars
);
2749 /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an
2750 inline function or template instantiation at end-of-file. */
2753 import_export_decl (decl
)
2756 if (DECL_INTERFACE_KNOWN (decl
))
2759 if (DECL_TEMPLATE_INSTANTIATION (decl
)
2760 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl
))
2762 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2763 if ((DECL_IMPLICIT_INSTANTIATION (decl
)
2764 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl
))
2765 && (flag_implicit_templates
2766 || (flag_implicit_inline_templates
&& DECL_THIS_INLINE (decl
))))
2768 if (!TREE_PUBLIC (decl
))
2769 /* Templates are allowed to have internal linkage. See
2772 else if (TREE_CODE (decl
) == FUNCTION_DECL
)
2773 comdat_linkage (decl
);
2775 DECL_COMDAT (decl
) = 1;
2778 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2780 else if (DECL_FUNCTION_MEMBER_P (decl
))
2782 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2783 import_export_class (ctype
);
2784 if (CLASSTYPE_INTERFACE_KNOWN (ctype
)
2785 && (! DECL_ARTIFICIAL (decl
) || DECL_VINDEX (decl
)))
2787 DECL_NOT_REALLY_EXTERN (decl
)
2788 = ! (CLASSTYPE_INTERFACE_ONLY (ctype
)
2789 || (DECL_THIS_INLINE (decl
) && ! flag_implement_inlines
));
2791 /* Always make artificials weak. */
2792 if (DECL_ARTIFICIAL (decl
) && flag_weak
)
2793 comdat_linkage (decl
);
2796 comdat_linkage (decl
);
2798 /* tinfo function */
2799 else if (DECL_ARTIFICIAL (decl
) && DECL_MUTABLE_P (decl
))
2801 tree ctype
= TREE_TYPE (DECL_NAME (decl
));
2803 if (IS_AGGR_TYPE (ctype
))
2804 import_export_class (ctype
);
2806 if (IS_AGGR_TYPE (ctype
) && CLASSTYPE_INTERFACE_KNOWN (ctype
)
2807 && TYPE_VIRTUAL_P (ctype
)
2808 /* If the type is a cv-qualified variant of a type, then we
2809 must emit the tinfo function in this translation unit
2810 since it will not be emitted when the vtable for the type
2811 is output (which is when the unqualified version is
2813 && ctype
== TYPE_MAIN_VARIANT (ctype
))
2815 DECL_NOT_REALLY_EXTERN (decl
)
2816 = ! (CLASSTYPE_INTERFACE_ONLY (ctype
)
2817 || (DECL_THIS_INLINE (decl
) && ! flag_implement_inlines
));
2819 /* Always make artificials weak. */
2821 comdat_linkage (decl
);
2823 else if (TYPE_BUILT_IN (ctype
) && ctype
== TYPE_MAIN_VARIANT (ctype
))
2824 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2826 comdat_linkage (decl
);
2829 comdat_linkage (decl
);
2831 DECL_INTERFACE_KNOWN (decl
) = 1;
2835 build_cleanup (decl
)
2839 tree type
= TREE_TYPE (decl
);
2841 if (TREE_CODE (type
) == ARRAY_TYPE
)
2845 mark_addressable (decl
);
2846 temp
= build1 (ADDR_EXPR
, build_pointer_type (type
), decl
);
2848 temp
= build_delete (TREE_TYPE (temp
), temp
,
2850 LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
, 0);
2854 extern int parse_time
, varconst_time
;
2855 extern tree pending_templates
;
2856 extern tree maybe_templates
;
2862 tree sname
= get_id_2 ("__sn", base
);
2863 /* For struct X foo __attribute__((weak)), there is a counter
2864 __snfoo. Since base is already an assembler name, sname should
2865 be globally unique */
2866 tree sentry
= IDENTIFIER_GLOBAL_VALUE (sname
);
2869 push_obstacks_nochange ();
2870 end_temporary_allocation ();
2871 sentry
= build_decl (VAR_DECL
, sname
, integer_type_node
);
2872 TREE_PUBLIC (sentry
) = 1;
2873 DECL_ARTIFICIAL (sentry
) = 1;
2874 TREE_STATIC (sentry
) = 1;
2875 TREE_USED (sentry
) = 1;
2876 DECL_COMMON (sentry
) = 1;
2877 pushdecl_top_level (sentry
);
2878 cp_finish_decl (sentry
, NULL_TREE
, NULL_TREE
, 0, 0);
2884 /* A list of objects which have constructors or destructors
2885 which reside in the global scope. The decl is stored in
2886 the TREE_VALUE slot and the initializer is stored
2887 in the TREE_PURPOSE slot. */
2888 extern tree static_aggregates_initp
;
2890 /* Set up the static_aggregates* lists for processing. Subroutine of
2891 finish_file. Note that this function changes the format of
2892 static_aggregates_initp, from (priority . decl) to
2893 (priority . ((initializer . decl) ...)). */
2900 if (! flag_init_priority
)
2902 for (t
= static_aggregates_initp
; t
; t
= TREE_CHAIN (t
))
2903 cp_warning ("init_priority for `%#D' ignored without -finit-priority",
2908 /* First, remove any entries from static_aggregates that are also in
2909 static_aggregates_initp, and update the entries in _initp to
2910 include the initializer. */
2911 p
= &static_aggregates
;
2914 t
= value_member (TREE_VALUE (*p
), static_aggregates_initp
);
2918 TREE_VALUE (t
) = *p
;
2919 *p
= TREE_CHAIN (*p
);
2920 TREE_CHAIN (TREE_VALUE (t
)) = NULL_TREE
;
2923 p
= &TREE_CHAIN (*p
);
2926 /* Then, group static_aggregates_initp. After this step, there will only
2927 be one entry for each priority, with a chain coming off it. */
2928 t
= static_aggregates_initp
;
2929 static_aggregates_initp
= NULL_TREE
;
2931 for (; t
; t
= next_t
)
2933 next_t
= TREE_CHAIN (t
);
2935 for (p
= &static_aggregates_initp
; ; p
= &TREE_CHAIN (*p
))
2938 || tree_int_cst_lt (TREE_PURPOSE (*p
), TREE_PURPOSE (t
)))
2940 TREE_CHAIN (t
) = *p
;
2944 else if (tree_int_cst_equal (TREE_PURPOSE (*p
), TREE_PURPOSE (t
)))
2946 TREE_CHAIN (TREE_VALUE (t
)) = TREE_VALUE (*p
);
2947 TREE_VALUE (*p
) = TREE_VALUE (t
);
2953 /* Reverse each list to preserve the order (currently reverse declaration
2954 order, for destructors). */
2955 for (t
= static_aggregates_initp
; t
; t
= TREE_CHAIN (t
))
2956 TREE_VALUE (t
) = nreverse (TREE_VALUE (t
));
2959 /* Start the process of running a particular set of global constructors
2960 or destructors. Subroutine of do_[cd]tors. */
2963 start_objects (method_type
, initp
)
2964 int method_type
, initp
;
2969 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
2971 if (flag_init_priority
)
2981 initp
= DEFAULT_INIT_PRIORITY
;
2983 sprintf (type
, "%c%c%.5u", method_type
, joiner
, initp
);
2986 sprintf (type
, "%c", method_type
);
2988 fnname
= get_file_function_name_long (type
);
2990 start_function (void_list_node
,
2991 make_call_declarator (fnname
, void_list_node
, NULL_TREE
,
2995 store_parm_decls ();
2999 expand_start_bindings (0);
3002 /* Finish the process of running a particular set of global constructors
3003 or destructors. Subroutine of do_[cd]tors. */
3006 finish_objects (method_type
, initp
)
3007 int method_type
, initp
;
3013 tree list
= (method_type
== 'I' ? static_ctors
: static_dtors
);
3015 if (! current_function_decl
&& list
)
3016 start_objects (method_type
, initp
);
3018 for (; list
; list
= TREE_CHAIN (list
))
3019 expand_expr_stmt (build_function_call (TREE_VALUE (list
), NULL_TREE
));
3022 if (! current_function_decl
)
3025 fnname
= XSTR (XEXP (DECL_RTL (current_function_decl
), 0), 0);
3028 expand_end_bindings (getdecls (), 1, 0);
3031 finish_function (lineno
, 0, 0);
3033 if (! flag_init_priority
)
3035 if (method_type
== 'I')
3036 assemble_constructor (fnname
);
3038 assemble_destructor (fnname
);
3041 #ifdef ASM_OUTPUT_SECTION_NAME
3042 /* If we're using init priority we can't use assemble_*tor, but on ELF
3043 targets we can stick the references into named sections for GNU ld
3045 if (flag_init_priority
)
3049 initp
= DEFAULT_INIT_PRIORITY
;
3050 sprintf (buf
, ".%ctors.%.5u", method_type
== 'I' ? 'c' : 'd',
3051 /* invert the numbering so the linker puts us in the proper
3052 order; constructors are run from right to left, and the
3053 linker sorts in increasing order. */
3054 MAX_INIT_PRIORITY
- initp
);
3055 named_section (NULL_TREE
, buf
, 0);
3056 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, fnname
),
3057 POINTER_SIZE
/ BITS_PER_UNIT
, 1);
3062 /* Generate a function to run a set of global destructors. START is either
3063 NULL_TREE or a node indicating a set of destructors with the same
3064 init priority. Subroutine of finish_file. */
3075 initp
= TREE_INT_CST_LOW (TREE_PURPOSE (start
));
3076 vars
= TREE_VALUE (start
);
3081 vars
= static_aggregates
;
3084 for (; vars
; vars
= TREE_CHAIN (vars
))
3086 tree decl
= TREE_VALUE (vars
);
3087 tree type
= TREE_TYPE (decl
);
3090 if (TYPE_NEEDS_DESTRUCTOR (type
) && ! TREE_STATIC (vars
)
3091 && ! DECL_EXTERNAL (decl
))
3093 int protect
= (TREE_PUBLIC (decl
) && (DECL_COMMON (decl
)
3094 || DECL_ONE_ONLY (decl
)
3095 || DECL_WEAK (decl
)));
3097 if (! current_function_decl
)
3098 start_objects ('D', initp
);
3100 /* Set these global variables so that GDB at least puts
3101 us near the declaration which required the initialization. */
3102 input_filename
= DECL_SOURCE_FILE (decl
);
3103 lineno
= DECL_SOURCE_LINE (decl
);
3104 emit_note (input_filename
, lineno
);
3110 Access control for implicit calls to the constructors,
3111 the conversion functions, or the destructor called to
3112 create and destroy a static data member is performed as
3113 if these calls appeared in the scope of the member's
3116 we must convince enforce_access to let us access the
3118 if (member_p (decl
))
3120 DECL_CLASS_CONTEXT (current_function_decl
)
3121 = DECL_CONTEXT (decl
);
3122 DECL_STATIC_FUNCTION_P (current_function_decl
) = 1;
3125 temp
= build_cleanup (decl
);
3129 tree sentry
= get_sentry (DECL_ASSEMBLER_NAME (decl
));
3130 sentry
= build_unary_op (PREDECREMENT_EXPR
, sentry
, 0);
3131 sentry
= build_binary_op (EQ_EXPR
, sentry
, integer_zero_node
, 1);
3132 expand_start_cond (sentry
, 0);
3135 expand_expr_stmt (temp
);
3140 /* Now that we're done with DECL we don't need to pretend to
3141 be a member of its class any longer. */
3142 DECL_CLASS_CONTEXT (current_function_decl
) = NULL_TREE
;
3143 DECL_STATIC_FUNCTION_P (current_function_decl
) = 0;
3147 finish_objects ('D', initp
);
3150 /* Generate a function to run a set of global constructors. START is
3151 either NULL_TREE or a node indicating a set of constructors with the
3152 same init priority. Subroutine of finish_file. */
3163 initp
= TREE_INT_CST_LOW (TREE_PURPOSE (start
));
3164 vars
= TREE_VALUE (start
);
3169 vars
= static_aggregates
;
3172 /* Reverse the list so it's in the right order for ctors. */
3173 vars
= nreverse (vars
);
3175 for (; vars
; vars
= TREE_CHAIN (vars
))
3177 tree decl
= TREE_VALUE (vars
);
3178 tree init
= TREE_PURPOSE (vars
);
3180 /* If this was a static attribute within some function's scope,
3181 then don't initialize it here. Also, don't bother
3182 with initializers that contain errors. */
3183 if (TREE_STATIC (vars
)
3184 || DECL_EXTERNAL (decl
)
3185 || (init
&& TREE_CODE (init
) == TREE_LIST
3186 && value_member (error_mark_node
, init
)))
3189 if (TREE_CODE (decl
) == VAR_DECL
)
3191 int protect
= (TREE_PUBLIC (decl
) && (DECL_COMMON (decl
)
3192 || DECL_ONE_ONLY (decl
)
3193 || DECL_WEAK (decl
)));
3195 if (! current_function_decl
)
3196 start_objects ('I', initp
);
3198 /* Set these global variables so that GDB at least puts
3199 us near the declaration which required the initialization. */
3200 input_filename
= DECL_SOURCE_FILE (decl
);
3201 lineno
= DECL_SOURCE_LINE (decl
);
3202 emit_note (input_filename
, lineno
);
3204 /* 9.5p5: The initializer of a static member of a class has
3205 the same access rights as a member function. */
3206 if (member_p (decl
))
3208 DECL_CLASS_CONTEXT (current_function_decl
)
3209 = DECL_CONTEXT (decl
);
3210 DECL_STATIC_FUNCTION_P (current_function_decl
) = 1;
3215 tree sentry
= get_sentry (DECL_ASSEMBLER_NAME (decl
));
3216 sentry
= build_unary_op (PREINCREMENT_EXPR
, sentry
, 0);
3217 sentry
= build_binary_op
3218 (EQ_EXPR
, sentry
, integer_one_node
, 1);
3219 expand_start_cond (sentry
, 0);
3222 expand_start_target_temps ();
3224 if (IS_AGGR_TYPE (TREE_TYPE (decl
))
3225 || TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
3226 expand_aggr_init (decl
, init
, 0);
3227 else if (TREE_CODE (init
) == TREE_VEC
)
3229 expand_expr (expand_vec_init (decl
, TREE_VEC_ELT (init
, 0),
3230 TREE_VEC_ELT (init
, 1),
3231 TREE_VEC_ELT (init
, 2), 0),
3232 const0_rtx
, VOIDmode
, EXPAND_NORMAL
);
3235 expand_assignment (decl
, init
, 0, 0);
3237 /* The expression might have involved increments and
3241 /* Cleanup any temporaries needed for the initial value. */
3242 expand_end_target_temps ();
3247 DECL_CLASS_CONTEXT (current_function_decl
) = NULL_TREE
;
3248 DECL_STATIC_FUNCTION_P (current_function_decl
) = 0;
3250 else if (decl
== error_mark_node
)
3253 my_friendly_abort (22);
3256 finish_objects ('I', initp
);
3259 /* This routine is called from the last rule in yyparse ().
3260 Its job is to create all the code needed to initialize and
3261 destroy the global aggregates. We do the destruction
3262 first, since that way we only need to reverse the decls once. */
3268 int start_time
, this_time
;
3272 int needs_cleaning
= 0, needs_messing_up
= 0;
3276 /* Bad parse errors. Just forget about it. */
3277 if (! global_bindings_p () || current_class_type
)
3280 check_decl_namespace ();
3282 start_time
= get_run_time ();
3284 /* Otherwise, GDB can get confused, because in only knows
3285 about source for LINENO-1 lines. */
3288 interface_unknown
= 1;
3291 for (fnname
= pending_templates
; fnname
; fnname
= TREE_CHAIN (fnname
))
3293 tree srcloc
= TREE_PURPOSE (fnname
);
3294 tree decl
= TREE_VALUE (fnname
);
3296 input_filename
= SRCLOC_FILE (srcloc
);
3297 lineno
= SRCLOC_LINE (srcloc
);
3299 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 't')
3301 instantiate_class_template (decl
);
3302 if (CLASSTYPE_TEMPLATE_INSTANTIATION (decl
))
3303 for (vars
= TYPE_METHODS (decl
); vars
; vars
= TREE_CHAIN (vars
))
3304 if (! DECL_ARTIFICIAL (vars
))
3305 instantiate_decl (vars
);
3308 instantiate_decl (decl
);
3311 for (fnname
= maybe_templates
; fnname
; fnname
= TREE_CHAIN (fnname
))
3313 tree args
, fn
, decl
= TREE_VALUE (fnname
);
3315 if (DECL_INITIAL (decl
))
3318 fn
= TREE_PURPOSE (fnname
);
3319 args
= get_bindings (fn
, decl
, NULL_TREE
);
3320 fn
= instantiate_template (fn
, args
);
3321 instantiate_decl (fn
);
3324 cat_namespace_levels();
3326 /* Push into C language context, because that's all
3328 push_lang_context (lang_name_c
);
3331 /* The reason for pushing garbage onto the global_binding_level is to
3332 ensure that we can slice out _DECLs which pertain to virtual function
3333 tables. If the last thing pushed onto the global_binding_level was a
3334 virtual function table, then slicing it out would slice away all the
3335 decls (i.e., we lose the head of the chain).
3337 There are several ways of getting the same effect, from changing the
3338 way that iterators over the chain treat the elements that pertain to
3339 virtual function tables, moving the implementation of this code to
3340 decl.c (where we can manipulate global_binding_level directly),
3341 popping the garbage after pushing it and slicing away the vtable
3342 stuff, or just leaving it alone. */
3344 /* Make last thing in global scope not be a virtual function table. */
3345 #if 0 /* not yet, should get fixed properly later */
3346 vars
= make_type_decl (get_identifier (" @%$#@!"), integer_type_node
);
3348 vars
= build_decl (TYPE_DECL
, get_identifier (" @%$#@!"), integer_type_node
);
3350 DECL_IGNORED_P (vars
) = 1;
3351 SET_DECL_ARTIFICIAL (vars
);
3355 for (vars
= static_aggregates
; vars
; vars
= TREE_CHAIN (vars
))
3356 if (! TREE_ASM_WRITTEN (TREE_VALUE (vars
)))
3357 rest_of_decl_compilation (TREE_VALUE (vars
), 0, 1, 1);
3358 vars
= static_aggregates
;
3360 if (static_ctors
|| vars
)
3361 needs_messing_up
= 1;
3362 if (static_dtors
|| vars
)
3367 /* After setup_initp, the aggregates are listed in reverse declaration
3368 order, for cleaning. */
3371 do_dtors (NULL_TREE
);
3373 if (flag_init_priority
)
3374 for (vars
= static_aggregates_initp
; vars
; vars
= TREE_CHAIN (vars
))
3378 /* do_ctors will reverse the lists for messing up. */
3379 if (needs_messing_up
)
3381 do_ctors (NULL_TREE
);
3383 if (flag_init_priority
)
3384 for (vars
= static_aggregates_initp
; vars
; vars
= TREE_CHAIN (vars
))
3388 permanent_allocation (1);
3390 /* Done with C language context needs. */
3391 pop_lang_context ();
3393 /* Now write out any static class variables (which may have since
3394 learned how to be initialized). */
3395 while (pending_statics
)
3397 tree decl
= TREE_VALUE (pending_statics
);
3399 /* Output DWARF debug information. */
3400 #ifdef DWARF_DEBUGGING_INFO
3401 if (write_symbols
== DWARF_DEBUG
)
3402 dwarfout_file_scope_decl (decl
, 1);
3404 #ifdef DWARF2_DEBUGGING_INFO
3405 if (write_symbols
== DWARF2_DEBUG
)
3406 dwarf2out_decl (decl
);
3409 DECL_DEFER_OUTPUT (decl
) = 0;
3410 rest_of_decl_compilation
3411 (decl
, IDENTIFIER_POINTER (DECL_ASSEMBLER_NAME (decl
)), 1, 1);
3413 pending_statics
= TREE_CHAIN (pending_statics
);
3416 this_time
= get_run_time ();
3417 parse_time
-= this_time
- start_time
;
3418 varconst_time
+= this_time
- start_time
;
3420 start_time
= get_run_time ();
3422 if (flag_handle_signatures
)
3423 walk_sigtables ((void (*) PROTO ((tree
, tree
))) 0,
3424 finish_sigtable_vardecl
);
3426 for (fnname
= saved_inlines
; fnname
; fnname
= TREE_CHAIN (fnname
))
3428 tree decl
= TREE_VALUE (fnname
);
3429 import_export_decl (decl
);
3432 mark_all_runtime_matches ();
3434 /* Now write out inline functions which had their addresses taken and
3435 which were not declared virtual and which were not declared `extern
3438 int reconsider
= 1; /* More may be referenced; check again */
3442 tree
*p
= &saved_inlines
;
3445 /* We need to do this each time so that newly completed template
3446 types don't wind up at the front of the list. Sigh. */
3447 vars
= build_decl (TYPE_DECL
, make_anon_name (), integer_type_node
);
3448 DECL_IGNORED_P (vars
) = 1;
3449 SET_DECL_ARTIFICIAL (vars
);
3452 reconsider
|= walk_vtables ((void (*) PROTO((tree
, tree
))) 0,
3453 finish_vtable_vardecl
);
3457 tree decl
= TREE_VALUE (*p
);
3459 if (DECL_ARTIFICIAL (decl
) && ! DECL_INITIAL (decl
)
3461 && (! DECL_REALLY_EXTERN (decl
) || DECL_INLINE (decl
)))
3463 if (DECL_MUTABLE_P (decl
))
3464 synthesize_tinfo_fn (decl
);
3466 synthesize_method (decl
);
3470 /* Catch new template instantiations. */
3471 if (decl
!= TREE_VALUE (*p
))
3474 if (TREE_ASM_WRITTEN (decl
)
3475 || (DECL_SAVED_INSNS (decl
) == 0 && ! DECL_ARTIFICIAL (decl
)))
3476 *p
= TREE_CHAIN (*p
);
3477 else if (DECL_INITIAL (decl
) == 0)
3478 p
= &TREE_CHAIN (*p
);
3479 else if ((TREE_PUBLIC (decl
) && ! DECL_COMDAT (decl
))
3480 || TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl
))
3481 || flag_keep_inline_functions
)
3483 if (DECL_NOT_REALLY_EXTERN (decl
))
3485 DECL_EXTERNAL (decl
) = 0;
3487 /* We can't inline this function after it's been
3488 emitted. We want a variant of
3489 output_inline_function that doesn't prevent
3490 subsequent integration... */
3491 DECL_INLINE (decl
) = 0;
3492 output_inline_function (decl
);
3493 permanent_allocation (1);
3496 *p
= TREE_CHAIN (*p
);
3499 p
= &TREE_CHAIN (*p
);
3503 /* It's possible that some of the remaining inlines will still be
3504 needed. For example, a static inline whose address is used in
3505 the initializer for a file-scope static variable will be
3506 needed. Code in compile_file will handle this, but we mustn't
3507 pretend that there are no definitions for the inlines, or it
3510 FIXME: This won't catch member functions. We should really
3511 unify this stuff with the compile_file stuff. */
3512 for (vars
= saved_inlines
; vars
!= NULL_TREE
; vars
= TREE_CHAIN (vars
))
3514 tree decl
= TREE_VALUE (vars
);
3516 if (DECL_NOT_REALLY_EXTERN (decl
)
3517 && !DECL_COMDAT (decl
)
3518 && DECL_INITIAL (decl
) != NULL_TREE
)
3519 DECL_EXTERNAL (decl
) = 0;
3523 /* Now delete from the chain of variables all virtual function tables.
3524 We output them all ourselves, because each will be treated specially. */
3526 walk_vtables ((void (*) PROTO((tree
, tree
))) 0,
3527 prune_vtable_vardecl
);
3531 this_time
= get_run_time ();
3532 parse_time
-= this_time
- start_time
;
3533 varconst_time
+= this_time
- start_time
;
3535 if (flag_detailed_statistics
)
3537 dump_tree_statistics ();
3538 dump_time_statistics ();
3542 /* This is something of the form 'A()()()()()+1' that has turned out to be an
3543 expr. Since it was parsed like a type, we need to wade through and fix
3544 that. Unfortunately, since operator() is left-associative, we can't use
3545 tail recursion. In the above example, TYPE is `A', and DECL is
3548 Maybe this shouldn't be recursive, but how often will it actually be
3552 reparse_absdcl_as_expr (type
, decl
)
3555 /* do build_functional_cast (type, NULL_TREE) at bottom */
3556 if (TREE_OPERAND (decl
, 0) == NULL_TREE
)
3557 return build_functional_cast (type
, NULL_TREE
);
3560 decl
= reparse_absdcl_as_expr (type
, TREE_OPERAND (decl
, 0));
3562 decl
= build_x_function_call (decl
, NULL_TREE
, current_class_ref
);
3564 if (TREE_CODE (decl
) == CALL_EXPR
&& TREE_TYPE (decl
) != void_type_node
)
3565 decl
= require_complete_type (decl
);
3570 /* This is something of the form `int ((int)(int)(int)1)' that has turned
3571 out to be an expr. Since it was parsed like a type, we need to wade
3572 through and fix that. Since casts are right-associative, we are
3573 reversing the order, so we don't have to recurse.
3575 In the above example, DECL is the `(int)(int)(int)', and EXPR is the
3579 reparse_absdcl_as_casts (decl
, expr
)
3584 if (TREE_CODE (expr
) == CONSTRUCTOR
3585 && TREE_TYPE (expr
) == 0)
3587 type
= groktypename (TREE_VALUE (TREE_OPERAND (decl
, 1)));
3588 decl
= TREE_OPERAND (decl
, 0);
3590 if (IS_SIGNATURE (type
))
3592 error ("cast specifies signature type");
3593 return error_mark_node
;
3596 expr
= digest_init (type
, expr
, (tree
*) 0);
3597 if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_SIZE (type
) == 0)
3599 int failure
= complete_array_type (type
, expr
, 1);
3601 my_friendly_abort (78);
3607 type
= groktypename (TREE_VALUE (TREE_OPERAND (decl
, 1)));
3608 decl
= TREE_OPERAND (decl
, 0);
3609 expr
= build_c_cast (type
, expr
);
3612 if (warn_old_style_cast
)
3613 warning ("use of old-style cast");
3618 /* Given plain tree nodes for an expression, build up the full semantics. */
3621 build_expr_from_tree (t
)
3624 if (t
== NULL_TREE
|| t
== error_mark_node
)
3627 switch (TREE_CODE (t
))
3629 case IDENTIFIER_NODE
:
3630 return do_identifier (t
, 0, NULL_TREE
);
3633 if (LOOKUP_EXPR_GLOBAL (t
))
3634 return do_scoped_id (TREE_OPERAND (t
, 0), 0);
3636 return do_identifier (TREE_OPERAND (t
, 0), 0, NULL_TREE
);
3638 case TEMPLATE_ID_EXPR
:
3639 return (lookup_template_function
3640 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3641 build_expr_from_tree (TREE_OPERAND (t
, 1))));
3644 return build_x_indirect_ref
3645 (build_expr_from_tree (TREE_OPERAND (t
, 0)), "unary *");
3648 return build_functional_cast
3649 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3651 case REINTERPRET_CAST_EXPR
:
3652 return build_reinterpret_cast
3653 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3655 case CONST_CAST_EXPR
:
3656 return build_const_cast
3657 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3659 case DYNAMIC_CAST_EXPR
:
3660 return build_dynamic_cast
3661 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3663 case STATIC_CAST_EXPR
:
3664 return build_static_cast
3665 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3667 case PREDECREMENT_EXPR
:
3668 case PREINCREMENT_EXPR
:
3669 case POSTDECREMENT_EXPR
:
3670 case POSTINCREMENT_EXPR
:
3674 case TRUTH_NOT_EXPR
:
3676 case CONVERT_EXPR
: /* Unary + */
3679 return build_x_unary_op (TREE_CODE (t
),
3680 build_expr_from_tree (TREE_OPERAND (t
, 0)));
3685 case TRUNC_DIV_EXPR
:
3687 case FLOOR_DIV_EXPR
:
3688 case ROUND_DIV_EXPR
:
3689 case EXACT_DIV_EXPR
:
3691 case BIT_ANDTC_EXPR
:
3694 case TRUNC_MOD_EXPR
:
3695 case FLOOR_MOD_EXPR
:
3696 case TRUTH_ANDIF_EXPR
:
3697 case TRUTH_ORIF_EXPR
:
3698 case TRUTH_AND_EXPR
:
3713 return build_x_binary_op
3715 build_expr_from_tree (TREE_OPERAND (t
, 0)),
3716 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3719 return build_m_component_ref
3720 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3721 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3724 return build_offset_ref (TREE_OPERAND (t
, 0), TREE_OPERAND (t
, 1));
3727 if (TREE_OPERAND (t
, 0) == NULL_TREE
)
3729 return build_parse_node (ARRAY_REF
, NULL_TREE
,
3730 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3731 return grok_array_decl (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3732 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3737 tree r
= build_expr_from_tree (TREE_OPERAND (t
, 0));
3738 if (TREE_CODE_CLASS (TREE_CODE (r
)) != 't')
3740 return TREE_CODE (t
) == SIZEOF_EXPR
? c_sizeof (r
) : c_alignof (r
);
3744 return build_x_modify_expr
3745 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3746 TREE_CODE (TREE_OPERAND (t
, 1)),
3747 build_expr_from_tree (TREE_OPERAND (t
, 2)));
3750 return build_x_arrow
3751 (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3755 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3756 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3757 build_expr_from_tree (TREE_OPERAND (t
, 2)),
3758 NEW_EXPR_USE_GLOBAL (t
));
3761 return delete_sanity
3762 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3763 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3764 DELETE_EXPR_USE_VEC (t
), DELETE_EXPR_USE_GLOBAL (t
));
3767 if (TREE_OPERAND (t
, 1) == NULL_TREE
)
3768 return build_x_compound_expr
3769 (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3771 my_friendly_abort (42);
3773 case METHOD_CALL_EXPR
:
3774 if (TREE_CODE (TREE_OPERAND (t
, 0)) == SCOPE_REF
)
3776 tree ref
= TREE_OPERAND (t
, 0);
3777 return build_scoped_method_call
3778 (build_expr_from_tree (TREE_OPERAND (t
, 1)),
3779 build_expr_from_tree (TREE_OPERAND (ref
, 0)),
3780 TREE_OPERAND (ref
, 1),
3781 build_expr_from_tree (TREE_OPERAND (t
, 2)));
3785 tree fn
= TREE_OPERAND (t
, 0);
3787 /* We can get a TEMPLATE_ID_EXPR here on code like:
3791 so we must resolve that. However, we can also get things
3792 like a BIT_NOT_EXPR here, when referring to a destructor,
3793 and things like that are not correctly resolved by
3794 build_expr_from_tree. So, just use build_expr_from_tree
3795 when we really need it. */
3796 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3797 fn
= build_expr_from_tree (fn
);
3799 return build_method_call
3800 (build_expr_from_tree (TREE_OPERAND (t
, 1)),
3802 build_expr_from_tree (TREE_OPERAND (t
, 2)),
3803 NULL_TREE
, LOOKUP_NORMAL
);
3807 if (TREE_CODE (TREE_OPERAND (t
, 0)) == SCOPE_REF
)
3809 tree ref
= TREE_OPERAND (t
, 0);
3810 return build_member_call
3811 (build_expr_from_tree (TREE_OPERAND (ref
, 0)),
3812 TREE_OPERAND (ref
, 1),
3813 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3817 tree name
= TREE_OPERAND (t
, 0);
3819 tree args
= build_expr_from_tree (TREE_OPERAND (t
, 1));
3820 if (args
!= NULL_TREE
&& TREE_CODE (name
) == LOOKUP_EXPR
3821 && !LOOKUP_EXPR_GLOBAL (name
)
3822 && TREE_CODE ((id
= TREE_OPERAND (name
, 0))) == IDENTIFIER_NODE
3823 && (!current_class_type
3824 || !lookup_member (current_class_type
, id
, 0, 0)))
3826 /* Do Koenig lookup if there are no class members. */
3827 name
= do_identifier (id
, 0, args
);
3829 else if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
3830 || ! really_overloaded_fn (name
))
3831 name
= build_expr_from_tree (name
);
3832 return build_x_function_call (name
, args
, current_class_ref
);
3836 return build_x_conditional_expr
3837 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3838 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3839 build_expr_from_tree (TREE_OPERAND (t
, 2)));
3843 tree purpose
, value
, chain
;
3845 if (t
== void_list_node
)
3848 purpose
= TREE_PURPOSE (t
);
3850 purpose
= build_expr_from_tree (purpose
);
3851 value
= TREE_VALUE (t
);
3853 value
= build_expr_from_tree (value
);
3854 chain
= TREE_CHAIN (t
);
3855 if (chain
&& chain
!= void_type_node
)
3856 chain
= build_expr_from_tree (chain
);
3857 return expr_tree_cons (purpose
, value
, chain
);
3861 return build_x_component_ref
3862 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3863 TREE_OPERAND (t
, 1), NULL_TREE
, 1);
3866 return build_throw (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3872 /* digest_init will do the wrong thing if we let it. */
3873 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
)))
3876 r
= build_nt (CONSTRUCTOR
, NULL_TREE
,
3877 build_expr_from_tree (CONSTRUCTOR_ELTS (t
)));
3878 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
3881 return digest_init (TREE_TYPE (t
), r
, 0);
3886 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (t
, 0))) == 't')
3887 return get_typeid (TREE_OPERAND (t
, 0));
3888 return build_x_typeid (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3891 return convert_from_reference (t
);
3898 /* This is something of the form `int (*a)++' that has turned out to be an
3899 expr. It was only converted into parse nodes, so we need to go through
3900 and build up the semantics. Most of the work is done by
3901 build_expr_from_tree, above.
3903 In the above example, TYPE is `int' and DECL is `*a'. */
3906 reparse_decl_as_expr (type
, decl
)
3909 decl
= build_expr_from_tree (decl
);
3911 return build_functional_cast (type
, build_expr_list (NULL_TREE
, decl
));
3916 /* This is something of the form `int (*a)' that has turned out to be a
3917 decl. It was only converted into parse nodes, so we need to do the
3918 checking that make_{pointer,reference}_declarator do. */
3921 finish_decl_parsing (decl
)
3924 extern int current_class_depth
;
3926 switch (TREE_CODE (decl
))
3928 case IDENTIFIER_NODE
:
3931 return make_pointer_declarator
3932 (NULL_TREE
, finish_decl_parsing (TREE_OPERAND (decl
, 0)));
3934 return make_reference_declarator
3935 (NULL_TREE
, finish_decl_parsing (TREE_OPERAND (decl
, 0)));
3937 TREE_OPERAND (decl
, 0) = finish_decl_parsing (TREE_OPERAND (decl
, 0));
3940 push_nested_class (TREE_TYPE (TREE_OPERAND (decl
, 0)), 3);
3941 TREE_COMPLEXITY (decl
) = current_class_depth
;
3944 TREE_OPERAND (decl
, 0) = finish_decl_parsing (TREE_OPERAND (decl
, 0));
3947 /* For attribute handling. */
3948 TREE_VALUE (decl
) = finish_decl_parsing (TREE_VALUE (decl
));
3951 my_friendly_abort (5);
3957 check_cp_case_value (value
)
3960 if (value
== NULL_TREE
)
3963 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
3964 STRIP_TYPE_NOPS (value
);
3966 if (TREE_READONLY_DECL_P (value
))
3968 value
= decl_constant_value (value
);
3969 STRIP_TYPE_NOPS (value
);
3971 value
= fold (value
);
3973 if (TREE_CODE (value
) != INTEGER_CST
3974 && value
!= error_mark_node
)
3976 cp_error ("case label `%E' does not reduce to an integer constant",
3978 value
= error_mark_node
;
3981 /* Promote char or short to int. */
3982 value
= default_conversion (value
);
3984 constant_expression_warning (value
);
3989 /* Return 1 if root encloses child. */
3992 is_namespace_ancestor (root
, child
)
3997 if (root
== global_namespace
)
3999 if (child
== global_namespace
)
4001 return is_namespace_ancestor (root
, CP_DECL_CONTEXT (child
));
4005 /* Return the namespace that is the common ancestor
4006 of two given namespaces. */
4009 namespace_ancestor (ns1
, ns2
)
4012 if (is_namespace_ancestor (ns1
, ns2
))
4014 return namespace_ancestor (CP_DECL_CONTEXT (ns1
), ns2
);
4017 /* Insert used into the using list of user. Set indirect_flag if this
4018 directive is not directly from the source. Also find the common
4019 ancestor and let our users know about the new namespace */
4021 add_using_namespace (user
, used
, indirect
)
4027 /* Using oneself is a no-op. */
4030 my_friendly_assert (TREE_CODE (user
) == NAMESPACE_DECL
, 380);
4031 my_friendly_assert (TREE_CODE (used
) == NAMESPACE_DECL
, 380);
4032 /* Check if we already have this. */
4033 t
= purpose_member (used
, DECL_NAMESPACE_USING (user
));
4037 /* Promote to direct usage. */
4038 TREE_INDIRECT_USING (t
) = 0;
4042 /* Add used to the user's using list. */
4043 DECL_NAMESPACE_USING (user
)
4044 = perm_tree_cons (used
, namespace_ancestor (user
, used
),
4045 DECL_NAMESPACE_USING (user
));
4047 TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user
)) = indirect
;
4049 /* Add user to the used's users list. */
4050 DECL_NAMESPACE_USERS (used
)
4051 = perm_tree_cons (user
, 0, DECL_NAMESPACE_USERS (used
));
4053 /* Recursively add all namespaces used. */
4054 for (t
= DECL_NAMESPACE_USING (used
); t
; t
= TREE_CHAIN (t
))
4055 /* indirect usage */
4056 add_using_namespace (user
, TREE_PURPOSE (t
), 1);
4058 /* Tell everyone using us about the new used namespaces. */
4059 for (t
= DECL_NAMESPACE_USERS (user
); t
; t
= TREE_CHAIN (t
))
4060 add_using_namespace (TREE_PURPOSE (t
), used
, 1);
4063 /* Combines two sets of overloaded functions into an OVERLOAD chain, removing
4064 duplicates. The first list becomes the tail of the result.
4066 The algorithm is O(n^2). We could get this down to O(n log n) by
4067 doing a sort on the addresses of the functions, if that becomes
4071 merge_functions (s1
, s2
)
4075 for (; s2
; s2
= OVL_NEXT (s2
))
4077 tree fn
= OVL_CURRENT (s2
);
4078 if (! ovl_member (fn
, s1
))
4079 s1
= build_overload (fn
, s1
);
4084 /* This should return an error not all definitions define functions.
4085 It is not an error if we find two functions with exactly the
4086 same signature, only if these are selected in overload resolution.
4087 old is the current set of bindings, new the freshly-found binding.
4088 XXX Do we want to give *all* candidates in case of ambiguity?
4089 XXX In what way should I treat extern declarations?
4090 XXX I don't want to repeat the entire duplicate_decls here */
4093 ambiguous_decl (name
, old
, new, flags
)
4100 my_friendly_assert (old
!= NULL_TREE
, 393);
4101 /* Copy the value. */
4102 val
= BINDING_VALUE (new);
4104 switch (TREE_CODE (val
))
4107 /* If we expect types or namespaces, and not templates,
4108 or this is not a template class. */
4109 if (LOOKUP_QUALIFIERS_ONLY (flags
)
4110 && (!(flags
& LOOKUP_TEMPLATES_EXPECTED
)
4111 || !DECL_CLASS_TEMPLATE_P (val
)))
4115 if (LOOKUP_NAMESPACES_ONLY (flags
))
4118 case NAMESPACE_DECL
:
4119 if (LOOKUP_TYPES_ONLY (flags
))
4123 if (LOOKUP_QUALIFIERS_ONLY (flags
))
4127 if (!BINDING_VALUE (old
))
4128 BINDING_VALUE (old
) = val
;
4129 else if (val
&& val
!= BINDING_VALUE (old
))
4131 if (is_overloaded_fn (BINDING_VALUE (old
))
4132 && is_overloaded_fn (val
))
4134 BINDING_VALUE (old
) = merge_functions (BINDING_VALUE (old
),
4139 /* Some declarations are functions, some are not. */
4140 if (flags
& LOOKUP_COMPLAIN
)
4142 /* If we've already given this error for this lookup,
4143 BINDING_VALUE (old) is error_mark_node, so let's not
4144 repeat ourselves. */
4145 if (BINDING_VALUE (old
) != error_mark_node
)
4147 cp_error ("use of `%D' is ambiguous", name
);
4148 cp_error_at (" first declared as `%#D' here",
4149 BINDING_VALUE (old
));
4151 cp_error_at (" also declared as `%#D' here", val
);
4153 return error_mark_node
;
4156 /* ... and copy the type. */
4157 type
= BINDING_TYPE (new);
4158 if (LOOKUP_NAMESPACES_ONLY (flags
))
4160 if (!BINDING_TYPE (old
))
4161 BINDING_TYPE (old
) = type
;
4162 else if (type
&& BINDING_TYPE (old
) != type
)
4164 if (flags
& LOOKUP_COMPLAIN
)
4166 cp_error ("`%D' denotes an ambiguous type",name
);
4167 cp_error_at (" first type here", BINDING_TYPE (old
));
4168 cp_error_at (" other type here", type
);
4174 /* Add the bindings of name in used namespaces to val.
4175 The using list is defined by usings, and the lookup goes to scope.
4176 Returns zero on errors. */
4179 lookup_using_namespace (name
, val
, usings
, scope
, flags
)
4180 tree name
, val
, usings
, scope
;
4185 /* Iterate over all used namespaces in current, searching for using
4186 directives of scope. */
4187 for (iter
= usings
; iter
; iter
= TREE_CHAIN (iter
))
4188 if (TREE_VALUE (iter
) == scope
)
4190 val1
= binding_for_name (name
, TREE_PURPOSE (iter
));
4191 /* Resolve ambiguities. */
4192 val
= ambiguous_decl (name
, val
, val1
, flags
);
4194 return val
!= error_mark_node
;
4198 Excepts the name to lookup and its qualifying scope.
4199 Returns the name/type pair found into the CPLUS_BINDING result,
4203 qualified_lookup_using_namespace (name
, scope
, result
, flags
)
4209 /* Maintain a list of namespaces visited... */
4210 tree seen
= NULL_TREE
;
4211 /* ... and a list of namespace yet to see. */
4212 tree todo
= NULL_TREE
;
4214 while (scope
&& (result
!= error_mark_node
))
4216 seen
= temp_tree_cons (scope
, NULL_TREE
, seen
);
4217 result
= ambiguous_decl (name
, result
,
4218 binding_for_name (name
, scope
), flags
);
4219 if (!BINDING_VALUE (result
) && !BINDING_TYPE (result
))
4220 /* Consider using directives. */
4221 for (usings
= DECL_NAMESPACE_USING (scope
); usings
;
4222 usings
= TREE_CHAIN (usings
))
4223 /* If this was a real directive, and we have not seen it. */
4224 if (!TREE_INDIRECT_USING (usings
)
4225 && !purpose_member (TREE_PURPOSE (usings
), seen
))
4226 todo
= temp_tree_cons (TREE_PURPOSE (usings
), NULL_TREE
, todo
);
4229 scope
= TREE_PURPOSE (todo
);
4230 todo
= TREE_CHAIN (todo
);
4233 scope
= NULL_TREE
; /* If there never was a todo list. */
4235 return result
!= error_mark_node
;
4238 /* [namespace.memdef]/2 */
4240 /* Set the context of a declaration to scope. Complain if we are not
4244 set_decl_namespace (decl
, scope
)
4249 if (scope
== std_node
)
4250 scope
= global_namespace
;
4251 /* Get rid of namespace aliases. */
4252 scope
= ORIGINAL_NAMESPACE (scope
);
4254 if (!is_namespace_ancestor (current_namespace
, scope
))
4255 cp_error ("declaration of `%D' not in a namespace surrounding `%D'",
4257 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
4258 if (scope
!= current_namespace
)
4260 /* See whether this has been declared in the namespace. */
4261 old
= namespace_binding (DECL_NAME (decl
), scope
);
4263 /* No old declaration at all. */
4265 if (!is_overloaded_fn (decl
))
4266 /* Don't compare non-function decls with decls_match here,
4267 since it can't check for the correct constness at this
4268 point. pushdecl will find those errors later. */
4270 /* Since decl is a function, old should contain a function decl. */
4271 if (!is_overloaded_fn (old
))
4273 for (; old
; old
= OVL_NEXT (old
))
4274 if (decls_match (decl
, OVL_CURRENT (old
)))
4280 cp_error ("`%D' should have been declared inside `%D'",
4284 /* Compute the namespace where a declaration is defined. */
4287 decl_namespace (decl
)
4290 while (DECL_CONTEXT (decl
))
4292 decl
= DECL_CONTEXT (decl
);
4293 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
4295 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 't')
4296 decl
= TYPE_STUB_DECL (decl
);
4297 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd', 390);
4300 return global_namespace
;
4303 /* Return the namespace where the current declaration is declared. */
4306 current_decl_namespace ()
4309 /* If we have been pushed into a different namespace, use it. */
4310 if (decl_namespace_list
)
4311 return TREE_PURPOSE (decl_namespace_list
);
4313 if (current_class_type
)
4314 result
= decl_namespace (TYPE_STUB_DECL (current_class_type
));
4315 else if (current_function_decl
)
4316 result
= decl_namespace (current_function_decl
);
4318 result
= current_namespace
;
4322 /* Temporarily set the namespace for the current declaration. */
4325 push_decl_namespace (decl
)
4328 if (TREE_CODE (decl
) != NAMESPACE_DECL
)
4329 decl
= decl_namespace (decl
);
4330 decl_namespace_list
= tree_cons (decl
, NULL_TREE
, decl_namespace_list
);
4334 pop_decl_namespace ()
4336 decl_namespace_list
= TREE_CHAIN (decl_namespace_list
);
4340 check_decl_namespace ()
4342 my_friendly_assert (decl_namespace_list
== NULL_TREE
, 980711);
4345 /* Enter a class or namespace scope. */
4351 if (TREE_CODE (t
) == NAMESPACE_DECL
)
4352 push_decl_namespace (t
);
4357 /* Leave scope pushed by push_scope. */
4363 if (TREE_CODE (t
) == NAMESPACE_DECL
)
4364 pop_decl_namespace ();
4369 /* [basic.lookup.koenig] */
4370 /* A non-zero return value in the functions below indicates an error.
4371 All nodes allocated in the procedure are on the scratch obstack. */
4381 static int arg_assoc
PROTO((struct arg_lookup
*, tree
));
4382 static int arg_assoc_args
PROTO((struct arg_lookup
*, tree
));
4383 static int arg_assoc_type
PROTO((struct arg_lookup
*, tree
));
4385 /* Add a function to the lookup structure.
4386 Returns 1 on error. */
4389 add_function (k
, fn
)
4390 struct arg_lookup
*k
;
4393 if (ovl_member (fn
, k
->functions
))
4395 /* We must find only functions, or exactly one non-function. */
4396 if (k
->functions
&& is_overloaded_fn (k
->functions
)
4397 && is_overloaded_fn (fn
))
4398 k
->functions
= build_overload (fn
, k
->functions
);
4402 tree f1
= OVL_CURRENT (k
->functions
);
4404 if (is_overloaded_fn (f1
))
4406 fn
= f1
; f1
= f2
; f2
= fn
;
4408 cp_error_at ("`%D' is not a function,", f1
);
4409 cp_error_at (" conflict with `%D'", f2
);
4410 cp_error (" in call to `%D'", k
->name
);
4418 /* Add functions of a namespace to the lookup structure.
4419 Returns 1 on error. */
4422 arg_assoc_namespace (k
, scope
)
4423 struct arg_lookup
*k
;
4428 if (purpose_member (scope
, k
->namespaces
))
4430 k
->namespaces
= tree_cons (scope
, NULL_TREE
, k
->namespaces
);
4432 value
= namespace_binding (k
->name
, scope
);
4436 for (; value
; value
= OVL_NEXT (value
))
4437 if (add_function (k
, OVL_CURRENT (value
)))
4443 /* Adds everything associated with class to the lookup structure.
4444 Returns 1 on error. */
4447 arg_assoc_class (k
, type
)
4448 struct arg_lookup
* k
;
4451 tree list
, friends
, context
;
4454 if (purpose_member (type
, k
->classes
))
4456 k
->classes
= tree_cons (type
, NULL_TREE
, k
->classes
);
4458 context
= decl_namespace (TYPE_MAIN_DECL (type
));
4459 if (arg_assoc_namespace (k
, context
))
4462 /* Process baseclasses. */
4463 for (i
= 0; i
< CLASSTYPE_N_BASECLASSES (type
); i
++)
4464 if (arg_assoc_class (k
, TYPE_BINFO_BASETYPE (type
, i
)))
4467 /* Process friends. */
4468 for (list
= DECL_FRIENDLIST (TYPE_MAIN_DECL (type
)); list
;
4469 list
= TREE_CHAIN (list
))
4470 if (k
->name
== TREE_PURPOSE (list
))
4471 for (friends
= TREE_VALUE (list
); friends
;
4472 friends
= TREE_CHAIN (friends
))
4473 /* Only interested in global functions with potentially hidden
4474 (i.e. unqualified) declarations. */
4475 if (TREE_PURPOSE (list
) == error_mark_node
&& TREE_VALUE (list
)
4476 && decl_namespace (TREE_VALUE (list
)) == context
)
4477 if (add_function (k
, TREE_VALUE (list
)))
4480 /* Process template arguments. */
4481 if (CLASSTYPE_TEMPLATE_INFO (type
))
4483 list
= innermost_args (CLASSTYPE_TI_ARGS (type
));
4484 for (i
= 0; i
< TREE_VEC_LENGTH (list
); ++i
)
4485 arg_assoc (k
, TREE_VEC_ELT (list
, i
));
4491 /* Adds everything associated with a given type.
4492 Returns 1 on error. */
4495 arg_assoc_type (k
, type
)
4496 struct arg_lookup
*k
;
4499 switch (TREE_CODE (type
))
4509 if (TYPE_PTRMEMFUNC_P (type
))
4510 return arg_assoc_type (k
, TYPE_PTRMEMFUNC_FN_TYPE (type
));
4511 return arg_assoc_class (k
, type
);
4513 case REFERENCE_TYPE
:
4515 return arg_assoc_type (k
, TREE_TYPE (type
));
4518 return arg_assoc_namespace (k
, decl_namespace (TYPE_MAIN_DECL (type
)));
4520 /* Pointer to member: associate class type and value type. */
4521 if (arg_assoc_type (k
, TYPE_OFFSET_BASETYPE (type
)))
4523 return arg_assoc_type (k
, TREE_TYPE (type
));
4525 /* The basetype is referenced in the first arg type, so just
4528 /* Associate the parameter types. */
4529 if (arg_assoc_args (k
, TYPE_ARG_TYPES (type
)))
4531 /* Associate the return type. */
4532 return arg_assoc_type (k
, TREE_TYPE (type
));
4533 case TEMPLATE_TYPE_PARM
:
4536 if (type
== unknown_type_node
)
4538 /* else fall through */
4540 my_friendly_abort (390);
4545 /* Adds everything associated with arguments. Returns 1 on error. */
4548 arg_assoc_args (k
, args
)
4549 struct arg_lookup
* k
;
4552 for (; args
; args
= TREE_CHAIN (args
))
4553 if (arg_assoc (k
, TREE_VALUE (args
)))
4558 /* Adds everything associated with a given tree_node. Returns 1 on error. */
4562 struct arg_lookup
* k
;
4565 if (n
== error_mark_node
)
4568 if (TREE_CODE_CLASS (TREE_CODE (n
)) == 't')
4569 return arg_assoc_type (k
, n
);
4571 if (! type_unknown_p (n
))
4572 return arg_assoc_type (k
, TREE_TYPE (n
));
4574 if (TREE_CODE (n
) == ADDR_EXPR
)
4575 n
= TREE_OPERAND (n
, 0);
4576 if (TREE_CODE (n
) == COMPONENT_REF
)
4577 n
= TREE_OPERAND (n
, 1);
4578 while (TREE_CODE (n
) == TREE_LIST
)
4581 if (TREE_CODE (n
) == FUNCTION_DECL
)
4582 return arg_assoc_type (k
, TREE_TYPE (n
));
4583 if (TREE_CODE (n
) == TEMPLATE_ID_EXPR
)
4585 /* [basic.lookup.koenig]
4587 If T is a template-id, its associated namespaces and classes
4588 are the namespace in which the template is defined; for
4589 member templates, the member template's class; the namespaces
4590 and classes associated with the types of the template
4591 arguments provided for template type parameters (excluding
4592 template template parameters); the namespaces in which any
4593 template template arguments are defined; and the classes in
4594 which any member templates used as template template
4595 arguments are defined. [Note: non-type template arguments do
4596 not contribute to the set of associated namespaces. ] */
4597 tree
template = TREE_OPERAND (n
, 0);
4598 tree args
= TREE_OPERAND (n
, 1);
4602 /* First, the template. There may actually be more than one if
4603 this is an overloaded function template. But, in that case,
4604 we only need the first; all the functions will be in the same
4606 template = OVL_CURRENT (template);
4608 ctx
= CP_DECL_CONTEXT (template);
4610 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
4612 if (arg_assoc_namespace (k
, ctx
) == 1)
4615 /* It must be a member template. */
4616 else if (arg_assoc_class (k
, ctx
) == 1)
4619 /* Now the arguments. */
4620 for (arg
= args
; arg
!= NULL_TREE
; arg
= TREE_CHAIN (arg
))
4622 tree t
= TREE_VALUE (arg
);
4624 if (TREE_CODE (t
) == TEMPLATE_DECL
)
4626 ctx
= CP_DECL_CONTEXT (t
);
4627 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
4629 if (arg_assoc_namespace (k
, ctx
) == 1)
4632 else if (arg_assoc_class (k
, ctx
) == 1)
4635 else if (TREE_CODE_CLASS (TREE_CODE (t
)) == 't'
4636 && arg_assoc_type (k
, t
) == 1)
4642 my_friendly_assert (TREE_CODE (n
) == OVERLOAD
, 980715);
4644 for (; n
; n
= OVL_CHAIN (n
))
4645 if (arg_assoc_type (k
, TREE_TYPE (OVL_FUNCTION (n
))))
4652 /* Performs Koenig lookup depending on arguments, where fns
4653 are the functions found in normal lookup. */
4656 lookup_arg_dependent (name
, fns
, args
)
4661 struct arg_lookup k
;
4664 k
.namespaces
= NULL_TREE
;
4665 k
.classes
= NULL_TREE
;
4667 push_scratch_obstack ();
4668 arg_assoc_args (&k
, args
);
4673 /* Process a namespace-alias declaration. */
4676 do_namespace_alias (alias
, namespace)
4677 tree alias
, namespace;
4679 if (TREE_CODE (namespace) != NAMESPACE_DECL
)
4681 /* The parser did not find it, so it's not there. */
4682 cp_error ("unknown namespace `%D'", namespace);
4686 namespace = ORIGINAL_NAMESPACE (namespace);
4688 /* Build the alias. */
4689 alias
= build_lang_decl (NAMESPACE_DECL
, alias
, void_type_node
);
4690 DECL_NAMESPACE_ALIAS (alias
) = namespace;
4694 /* Check a non-member using-declaration. Return the name and scope
4695 being used, and the USING_DECL, or NULL_TREE on failure. */
4698 validate_nonmember_using_decl (decl
, scope
, name
)
4703 if (TREE_CODE (decl
) == SCOPE_REF
4704 && TREE_OPERAND (decl
, 0) == std_node
)
4706 *scope
= global_namespace
;
4707 *name
= TREE_OPERAND (decl
, 1);
4709 else if (TREE_CODE (decl
) == SCOPE_REF
)
4711 *scope
= TREE_OPERAND (decl
, 0);
4712 *name
= TREE_OPERAND (decl
, 1);
4714 /* [namespace.udecl]
4716 A using-declaration for a class member shall be a
4717 member-declaration. */
4718 if (TREE_CODE (*scope
) != NAMESPACE_DECL
)
4720 cp_error ("`%D' is not a namespace", *scope
);
4724 else if (TREE_CODE (decl
) == IDENTIFIER_NODE
4725 || TREE_CODE (decl
) == TYPE_DECL
4726 || TREE_CODE (decl
) == TEMPLATE_DECL
)
4728 *scope
= global_namespace
;
4732 my_friendly_abort (382);
4733 if (TREE_CODE_CLASS (TREE_CODE (*name
)) == 'd')
4734 *name
= DECL_NAME (*name
);
4735 /* Make a USING_DECL. */
4736 return push_using_decl (*scope
, *name
);
4739 /* Process local and global using-declarations. */
4742 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, newval
, newtype
)
4744 tree oldval
, oldtype
;
4745 tree
*newval
, *newtype
;
4748 struct tree_binding _decls
;
4750 *newval
= *newtype
= NULL_TREE
;
4751 decls
= binding_init (&_decls
);
4752 if (!qualified_lookup_using_namespace (name
, scope
, decls
, 0))
4756 if (!BINDING_VALUE (decls
) && !BINDING_TYPE (decls
))
4758 cp_error ("`%D' not declared", name
);
4762 /* Check for using functions. */
4763 if (BINDING_VALUE (decls
) && is_overloaded_fn (BINDING_VALUE (decls
)))
4767 if (oldval
&& !is_overloaded_fn (oldval
))
4769 duplicate_decls (OVL_CURRENT (BINDING_VALUE (decls
)), oldval
);
4774 for (tmp
= BINDING_VALUE (decls
); tmp
; tmp
= OVL_NEXT (tmp
))
4776 /* Compare each new function with each old one.
4777 If the old function was also used, there is no conflict. */
4778 for (tmp1
= oldval
; tmp1
; tmp1
= OVL_NEXT (tmp1
))
4779 if (OVL_CURRENT (tmp
) == OVL_CURRENT (tmp1
))
4781 else if (OVL_USED (tmp1
))
4783 else if (duplicate_decls (OVL_CURRENT (tmp
), OVL_CURRENT (tmp1
)))
4786 /* Duplicate use, ignore */
4790 *newval
= build_overload (OVL_CURRENT (tmp
), *newval
);
4791 if (TREE_CODE (*newval
) != OVERLOAD
)
4792 *newval
= ovl_cons (*newval
, NULL_TREE
);
4793 OVL_USED (*newval
) = 1;
4798 *newval
= BINDING_VALUE (decls
);
4800 duplicate_decls (*newval
, oldval
);
4803 *newtype
= BINDING_TYPE (decls
);
4804 if (oldtype
&& *newtype
&& oldtype
!= *newtype
)
4806 cp_error ("using directive `%D' introduced ambiguous type `%T'",
4812 /* Process a using-declaration not appearing in class or local scope. */
4815 do_toplevel_using_decl (decl
)
4818 tree scope
, name
, binding
;
4819 tree oldval
, oldtype
, newval
, newtype
;
4821 decl
= validate_nonmember_using_decl (decl
, &scope
, &name
);
4822 if (decl
== NULL_TREE
)
4825 binding
= binding_for_name (name
, current_namespace
);
4827 oldval
= BINDING_VALUE (binding
);
4828 oldtype
= BINDING_TYPE (binding
);
4830 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
4832 /* Copy declarations found. */
4834 BINDING_VALUE (binding
) = newval
;
4836 BINDING_TYPE (binding
) = newtype
;
4840 /* Process a using-declaration at function scope. */
4843 do_local_using_decl (decl
)
4847 tree oldval
, oldtype
, newval
, newtype
;
4849 decl
= validate_nonmember_using_decl (decl
, &scope
, &name
);
4850 if (decl
== NULL_TREE
)
4853 oldval
= lookup_name_current_level (name
);
4854 oldtype
= lookup_type_current_level (name
);
4856 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
4859 push_local_binding (name
, newval
);
4861 set_identifier_type_value (name
, newtype
);
4865 do_class_using_decl (decl
)
4870 if (TREE_CODE (decl
) != SCOPE_REF
4871 || TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (decl
, 0))) != 't')
4873 cp_error ("using-declaration for non-member at class scope");
4876 name
= TREE_OPERAND (decl
, 1);
4877 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
4879 cp_error ("using-declaration for destructor");
4882 if (TREE_CODE (name
) == TYPE_DECL
)
4883 name
= DECL_NAME (name
);
4885 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 980716);
4887 value
= build_lang_field_decl (USING_DECL
, name
, void_type_node
);
4888 DECL_INITIAL (value
) = TREE_OPERAND (decl
, 0);
4892 /* Process a using-directive. */
4895 do_using_directive (namespace)
4898 if (namespace == std_node
)
4900 /* using namespace A::B::C; */
4901 if (TREE_CODE (namespace) == SCOPE_REF
)
4902 namespace = TREE_OPERAND (namespace, 1);
4903 if (TREE_CODE (namespace) == IDENTIFIER_NODE
)
4905 /* Lookup in lexer did not find a namespace. */
4906 cp_error ("namespace `%T' undeclared", namespace);
4909 if (TREE_CODE (namespace) != NAMESPACE_DECL
)
4911 cp_error ("`%T' is not a namespace", namespace);
4914 namespace = ORIGINAL_NAMESPACE (namespace);
4915 if (!toplevel_bindings_p ())
4916 push_using_directive (namespace);
4919 add_using_namespace (current_namespace
, namespace, 0);
4923 check_default_args (x
)
4926 tree arg
= TYPE_ARG_TYPES (TREE_TYPE (x
));
4927 int saw_def
= 0, i
= 0 - (TREE_CODE (TREE_TYPE (x
)) == METHOD_TYPE
);
4928 for (; arg
&& arg
!= void_list_node
; arg
= TREE_CHAIN (arg
), ++i
)
4930 if (TREE_PURPOSE (arg
))
4934 cp_error_at ("default argument missing for parameter %P of `%+#D'",
4945 TREE_USED (decl
) = 1;
4946 if (processing_template_decl
)
4948 assemble_external (decl
);
4950 /* Is it a synthesized method that needs to be synthesized? */
4951 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_CLASS_CONTEXT (decl
)
4952 && DECL_ARTIFICIAL (decl
) && ! DECL_INITIAL (decl
)
4953 /* Kludge: don't synthesize for default args. */
4954 && current_function_decl
)
4955 synthesize_method (decl
);
4957 /* If this is a function or variable that is an instance of some
4958 template, we now know that we will need to actually do the
4959 instantiation. A TEMPLATE_DECL may also have DECL_TEMPLATE_INFO,
4960 if it's a partial instantiation, but there's no need to
4961 instantiate such a thing. We check that DECL is not an explicit
4962 instantiation because that is not checked in instantiate_decl. */
4963 if (TREE_CODE (decl
) != TEMPLATE_DECL
4964 && DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
4965 && !DECL_EXPLICIT_INSTANTIATION (decl
))
4966 instantiate_decl (decl
);
4969 /* Helper function for named_class_head_sans_basetype nonterminal. */
4972 handle_class_head (aggr
, scope
, id
)
4973 tree aggr
, scope
, id
;
4975 if (TREE_CODE (id
) == TYPE_DECL
)
4977 if (DECL_CLASS_TEMPLATE_P (id
))
4978 return DECL_TEMPLATE_RESULT (id
);
4981 cp_error ("`%T' does not have a nested type named `%D'", scope
, id
);
4983 cp_error ("no file-scope type named `%D'", id
);
4986 (aggr
, make_anon_name (), 1);
4987 return TYPE_MAIN_DECL (id
);