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"
49 extern cpp_reader parse_in
;
52 /* This structure contains information about the initializations
53 and/or destructions required for a particular priority level. */
54 typedef struct priority_info_s
{
55 /* Non-zero if there have been any initializations at this priority
56 throughout the translation unit. */
57 int initializations_p
;
58 /* Non-zero if there have been any destructions at this priority
59 throughout the translation unit. */
63 static tree get_sentry
PROTO((tree
));
64 static void mark_vtable_entries
PROTO((tree
));
65 static void grok_function_init
PROTO((tree
, tree
));
66 static int finish_vtable_vardecl
PROTO((tree
*, void *));
67 static int prune_vtable_vardecl
PROTO((tree
*, void *));
68 static int is_namespace_ancestor
PROTO((tree
, tree
));
69 static void add_using_namespace
PROTO((tree
, tree
, int));
70 static tree ambiguous_decl
PROTO((tree
, tree
, tree
,int));
71 static tree build_anon_union_vars
PROTO((tree
, tree
*, int, int));
72 static int acceptable_java_type
PROTO((tree
));
73 static void output_vtable_inherit
PROTO((tree
));
74 static tree start_objects
PROTO((int, int));
75 static void finish_objects
PROTO((int, int, tree
));
76 static tree merge_functions
PROTO((tree
, tree
));
77 static tree decl_namespace
PROTO((tree
));
78 static tree validate_nonmember_using_decl
PROTO((tree
, tree
*, tree
*));
79 static void do_nonmember_using_decl
PROTO((tree
, tree
, tree
, tree
,
81 static tree start_static_storage_duration_function
PROTO((void));
82 static void finish_static_storage_duration_function
PROTO((tree
));
83 static priority_info get_priority_info
PROTO((int));
84 static void do_static_initialization
PROTO((tree
, tree
));
85 static void do_static_destruction
PROTO((tree
));
86 static tree start_static_initialization_or_destruction
PROTO((tree
, int));
87 static void finish_static_initialization_or_destruction
PROTO((tree
));
88 static void generate_ctor_or_dtor_function
PROTO((int, int));
89 static int generate_ctor_and_dtor_functions_for_priority
90 PROTO((splay_tree_node
, void *));
91 static tree prune_vars_needing_no_initialization
PROTO((tree
));
92 static void write_out_vars
PROTO((tree
));
94 extern int current_class_depth
;
96 /* A list of virtual function tables we must make sure to write out. */
99 /* A list of static class variables. This is needed, because a
100 static class variable can be declared inside the class without
101 an initializer, and then initialized, staticly, outside the class. */
102 static varray_type pending_statics
;
103 #define pending_statics_used \
104 (pending_statics ? pending_statics->elements_used : 0)
106 /* A list of functions which were declared inline, but which we
107 may need to emit outline anyway. */
108 static varray_type saved_inlines
;
109 #define saved_inlines_used \
110 (saved_inlines ? saved_inlines->elements_used : 0)
112 /* Same, but not reset. Local temp variables and global temp variables
113 can have the same name. */
114 static int global_temp_name_counter
;
116 /* Flag used when debugging spew.c */
118 extern int spew_debug
;
120 /* Nonzero if we're done parsing and into end-of-file activities. */
124 /* Functions called along with real static constructors and destructors. */
126 tree static_ctors
, static_dtors
;
128 /* The :: namespace. */
130 tree global_namespace
;
132 /* The stack for namespaces of current declarations. */
134 static tree decl_namespace_list
;
137 /* C (and C++) language-specific option variables. */
139 /* Nonzero means allow type mismatches in conditional expressions;
140 just make their values `void'. */
142 int flag_cond_mismatch
;
144 /* Nonzero means give `double' the same size as `float'. */
146 int flag_short_double
;
148 /* Nonzero means don't recognize the keyword `asm'. */
152 /* Nonzero means don't recognize any extension keywords. */
154 int flag_no_gnu_keywords
;
156 /* Nonzero means don't recognize the non-ANSI builtin functions. */
160 /* Nonzero means don't recognize the non-ANSI builtin functions.
163 int flag_no_nonansi_builtin
;
165 /* Nonzero means do some things the same way PCC does. Only provided so
166 the compiler will link. */
168 int flag_traditional
;
170 /* Nonzero means to treat bitfields as unsigned unless they say `signed'. */
172 int flag_signed_bitfields
= 1;
174 /* Nonzero means enable obscure ANSI features and disable GNU extensions
175 that might cause ANSI-compliant code to be miscompiled. */
179 /* Nonzero means do emit exported implementations of functions even if
180 they can be inlined. */
182 int flag_implement_inlines
= 1;
184 /* Nonzero means do emit exported implementations of templates, instead of
185 multiple static copies in each file that needs a definition. */
187 int flag_external_templates
;
189 /* Nonzero means that the decision to emit or not emit the implementation of a
190 template depends on where the template is instantiated, rather than where
193 int flag_alt_external_templates
;
195 /* Nonzero means that implicit instantiations will be emitted if needed. */
197 int flag_implicit_templates
= 1;
199 /* Nonzero means that implicit instantiations of inline templates will be
200 emitted if needed, even if instantiations of non-inline templates
203 int flag_implicit_inline_templates
= 1;
205 /* Nonzero means warn about implicit declarations. */
207 int warn_implicit
= 1;
209 /* Nonzero means warn about usage of long long when `-pedantic'. */
211 int warn_long_long
= 1;
213 /* Nonzero means warn when all ctors or dtors are private, and the class
216 int warn_ctor_dtor_privacy
= 1;
218 /* True if we want to implement vtables using "thunks".
219 The default is off. */
221 #ifndef DEFAULT_VTABLE_THUNKS
222 #define DEFAULT_VTABLE_THUNKS 0
224 int flag_vtable_thunks
= DEFAULT_VTABLE_THUNKS
;
226 /* Nonzero means generate separate instantiation control files and juggle
227 them at link time. */
229 int flag_use_repository
;
231 /* Nonzero if we want to issue diagnostics that the standard says are not
234 int flag_optional_diags
= 1;
236 /* Nonzero means give string constants the type `const char *', as mandated
239 int flag_const_strings
= 1;
241 /* If non-NULL, dump the tree structure for the entire translation
242 unit to this file. */
244 char *flag_dump_translation_unit
= 0;
246 /* Nonzero means warn about deprecated conversion from string constant to
249 int warn_write_strings
;
251 /* Nonzero means warn about pointer casts that can drop a type qualifier
252 from the pointer target type. */
256 /* Nonzero means warn about sizeof(function) or addition/subtraction
257 of function pointers. */
259 int warn_pointer_arith
= 1;
261 /* Nonzero means warn for any function def without prototype decl. */
263 int warn_missing_prototypes
;
265 /* Nonzero means warn about multiple (redundant) decls for the same single
266 variable or function. */
268 int warn_redundant_decls
;
270 /* Warn if initializer is not completely bracketed. */
272 int warn_missing_braces
;
274 /* Warn about comparison of signed and unsigned values. */
276 int warn_sign_compare
;
278 /* Warn about testing equality of floating point numbers. */
280 int warn_float_equal
= 0;
282 /* Warn about *printf or *scanf format/argument anomalies. */
286 /* Warn about a subscript that has type char. */
288 int warn_char_subscripts
;
290 /* Warn if a type conversion is done that might have confusing results. */
294 /* Warn if adding () is suggested. */
296 int warn_parentheses
;
298 /* Non-zero means warn in function declared in derived class has the
299 same name as a virtual in the base class, but fails to match the
300 type signature of any virtual function in the base class. */
301 int warn_overloaded_virtual
;
303 /* Non-zero means warn when declaring a class that has a non virtual
304 destructor, when it really ought to have a virtual one. */
307 /* Non-zero means warn when a function is declared extern and later inline. */
308 int warn_extern_inline
;
310 /* Non-zero means warn when the compiler will reorder code. */
313 /* Non-zero means warn when synthesis behavior differs from Cfront's. */
316 /* Non-zero means warn when we convert a pointer to member function
317 into a pointer to (void or function). */
318 int warn_pmf2ptr
= 1;
320 /* Nonzero means warn about violation of some Effective C++ style rules. */
324 /* Nonzero means warn where overload resolution chooses a promotion from
325 unsigned to signed over a conversion to an unsigned of the same size. */
329 /* Nonzero means warn when an old-style cast is used. */
331 int warn_old_style_cast
;
333 /* Warn about #pragma directives that are not recognised. */
335 int warn_unknown_pragmas
; /* Tri state variable. */
337 /* Nonzero means warn about use of multicharacter literals. */
339 int warn_multichar
= 1;
341 /* Nonzero means warn when non-templatized friend functions are
342 declared within a template */
344 int warn_nontemplate_friend
= 1;
346 /* Nonzero means complain about deprecated features. */
348 int warn_deprecated
= 1;
350 /* Nonzero means `$' can be in an identifier. */
352 #ifndef DOLLARS_IN_IDENTIFIERS
353 #define DOLLARS_IN_IDENTIFIERS 1
355 int dollars_in_ident
= DOLLARS_IN_IDENTIFIERS
;
357 /* Nonzero for -fno-strict-prototype switch: do not consider empty
358 argument prototype to mean function takes no arguments. */
360 int flag_strict_prototype
= 2;
361 int strict_prototype
= 1;
362 int strict_prototypes_lang_c
, strict_prototypes_lang_cplusplus
= 1;
364 /* Nonzero means that labels can be used as first-class objects */
368 /* Nonzero means allow Microsoft extensions without a pedwarn. */
370 int flag_ms_extensions
;
372 /* Non-zero means to collect statistics which might be expensive
373 and to print them when we are done. */
374 int flag_detailed_statistics
;
376 /* C++ specific flags. */
377 /* Zero means that `this' is a *const. This gives nice behavior in the
378 2.0 world. 1 gives 1.2-compatible behavior. 2 gives Spring behavior.
379 -2 means we're constructing an object and it has fixed type. */
381 int flag_this_is_variable
;
383 /* Nonzero means we should attempt to elide constructors when possible. */
385 int flag_elide_constructors
= 1;
387 /* Nonzero means that member functions defined in class scope are
388 inline by default. */
390 int flag_default_inline
= 1;
392 /* Controls whether compiler generates 'type descriptor' that give
393 run-time type information. */
396 /* Nonzero if we wish to output cross-referencing information
397 for the GNU class browser. */
398 extern int flag_gnu_xref
;
400 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
403 int flag_huge_objects
;
405 /* Nonzero if we want to conserve space in the .o files. We do this
406 by putting uninitialized data and runtime initialized data into
407 .common instead of .data at the expense of not flagging multiple
410 int flag_conserve_space
;
412 /* Nonzero if we want to obey access control semantics. */
414 int flag_access_control
= 1;
416 /* Nonzero if we want to understand the operator names, i.e. 'bitand'. */
418 int flag_operator_names
;
420 /* Nonzero if we want to check the return value of new and avoid calling
421 constructors if it is a null pointer. */
425 /* Nonzero if we want the new ANSI rules for pushing a new scope for `for'
426 initialization variables.
427 0: Old rules, set by -fno-for-scope.
428 2: New ANSI rules, set by -ffor-scope.
429 1: Try to implement new ANSI rules, but with backup compatibility
430 (and warnings). This is the default, for now. */
432 int flag_new_for_scope
= 1;
434 /* Nonzero if we want to emit defined symbols with common-like linkage as
435 weak symbols where possible, in order to conform to C++ semantics.
436 Otherwise, emit them as local symbols. */
440 /* Nonzero to enable experimental ABI changes. */
444 /* Nonzero to not ignore namespace std. */
448 /* Nonzero if we should expand functions calls inline at the tree
449 level, rather than at the RTL level. */
451 int flag_inline_trees
= 0;
453 /* Maximum template instantiation depth. Must be at least 17 for ANSI
456 int max_tinst_depth
= 17;
458 /* The name-mangling scheme to use. Must be 1 or greater to support
459 template functions with identical types, but different template
461 int name_mangling_version
= 2;
463 /* Nonzero means that guiding declarations are allowed. */
464 int flag_guiding_decls
;
466 /* Nonzero if wchar_t should be `unsigned short' instead of whatever it
467 would normally be, for use with WINE. */
468 int flag_short_wchar
;
470 /* Nonzero if squashed mangling is to be performed.
471 This uses the B and K codes to reference previously seen class types
472 and class qualifiers. */
473 int flag_do_squangling
;
475 /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */
479 /* Nonzero means make the default pedwarns warnings instead of errors.
480 The value of this flag is ignored if -pedantic is specified. */
484 /* If this variable is defined to a non-NULL value, it will be called
485 after the file has been completely parsed. */
487 void (*back_end_hook
) PROTO((tree
));
489 /* Table of language-dependent -f options.
490 STRING is the option name. VARIABLE is the address of the variable.
491 ON_VALUE is the value to store in VARIABLE
492 if `-fSTRING' is seen as an option.
493 (If `-fno-STRING' is seen as an option, the opposite value is stored.) */
495 static struct { const char *string
; int *variable
; int on_value
;}
499 {"signed-char", &flag_signed_char
, 1},
500 {"unsigned-char", &flag_signed_char
, 0},
501 {"signed-bitfields", &flag_signed_bitfields
, 1},
502 {"unsigned-bitfields", &flag_signed_bitfields
, 0},
503 {"short-enums", &flag_short_enums
, 1},
504 {"short-double", &flag_short_double
, 1},
505 {"short-wchar", &flag_short_wchar
, 1},
506 {"cond-mismatch", &flag_cond_mismatch
, 1},
507 {"asm", &flag_no_asm
, 0},
508 {"builtin", &flag_no_builtin
, 0},
510 /* C++-only options. */
511 {"access-control", &flag_access_control
, 1},
512 {"check-new", &flag_check_new
, 1},
513 {"conserve-space", &flag_conserve_space
, 1},
514 {"const-strings", &flag_const_strings
, 1},
515 {"default-inline", &flag_default_inline
, 1},
516 {"dollars-in-identifiers", &dollars_in_ident
, 1},
517 {"elide-constructors", &flag_elide_constructors
, 1},
518 {"external-templates", &flag_external_templates
, 1},
519 {"for-scope", &flag_new_for_scope
, 2},
520 {"gnu-keywords", &flag_no_gnu_keywords
, 0},
521 {"handle-exceptions", &flag_exceptions
, 1},
522 {"honor-std", &flag_honor_std
, 1},
523 {"huge-objects", &flag_huge_objects
, 1},
524 {"implement-inlines", &flag_implement_inlines
, 1},
525 {"implicit-inline-templates", &flag_implicit_inline_templates
, 1},
526 {"implicit-templates", &flag_implicit_templates
, 1},
527 {"labels-ok", &flag_labels_ok
, 1},
528 {"ms-extensions", &flag_ms_extensions
, 1},
529 {"nonansi-builtins", &flag_no_nonansi_builtin
, 0},
530 {"operator-names", &flag_operator_names
, 1},
531 {"optional-diags", &flag_optional_diags
, 1},
532 {"permissive", &flag_permissive
, 1},
533 {"repo", &flag_use_repository
, 1},
534 {"rtti", &flag_rtti
, 1},
535 {"squangle", &flag_do_squangling
, 1},
536 {"stats", &flag_detailed_statistics
, 1},
537 {"strict-prototype", &flag_strict_prototype
, 1},
538 {"vtable-gc", &flag_vtable_gc
, 1},
539 {"vtable-thunks", &flag_vtable_thunks
, 1},
540 {"weak", &flag_weak
, 1},
541 {"xref", &flag_gnu_xref
, 1}
544 /* Decode the string P as a language-specific option.
545 Return the number of strings consumed for a valid option.
546 Otherwise return 0. Should not complain if it does not
547 recognise the option. */
550 lang_decode_option (argc
, argv
)
559 int strings_processed
;
562 strings_processed
= cpp_handle_option (&parse_in
, argc
, argv
);
564 strings_processed
= 0;
565 #endif /* ! USE_CPPLIB */
567 if (!strcmp (p
, "-ftraditional") || !strcmp (p
, "-traditional"))
569 else if (p
[0] == '-' && p
[1] == 'f')
571 /* Some kind of -f option.
572 P's value is the option sans `-f'.
573 Search for it in the table of options. */
577 /* Try special -f options. */
579 if (!strcmp (p
, "handle-exceptions")
580 || !strcmp (p
, "no-handle-exceptions"))
581 warning ("-fhandle-exceptions has been renamed to -fexceptions (and is now on by default)");
582 else if (!strcmp (p
, "all-virtual")
583 || !strcmp (p
, "enum-int-equiv")
584 || !strcmp (p
, "no-nonnull-objects")
585 || !strcmp (p
, "this-is-variable"))
586 warning ("-f%s is no longer supported", p
);
587 else if (! strcmp (p
, "alt-external-templates"))
589 flag_external_templates
= 1;
590 flag_alt_external_templates
= 1;
591 cp_deprecated ("-falt-external-templates");
593 else if (! strcmp (p
, "no-alt-external-templates"))
594 flag_alt_external_templates
= 0;
595 else if (!strcmp (p
, "repo"))
597 flag_use_repository
= 1;
598 flag_implicit_templates
= 0;
600 else if (!strcmp (p
, "guiding-decls"))
602 flag_guiding_decls
= 1;
603 name_mangling_version
= 0;
605 else if (!strcmp (p
, "no-guiding-decls"))
606 flag_guiding_decls
= 0;
607 else if (!strcmp (p
, "external-templates"))
609 flag_external_templates
= 1;
610 cp_deprecated ("-fexternal-templates");
612 else if (!strcmp (p
, "new-abi"))
615 flag_do_squangling
= 1;
617 flag_vtable_thunks
= 1;
619 else if (!strcmp (p
, "no-new-abi"))
622 flag_do_squangling
= 0;
625 else if (!strncmp (p
, "template-depth-", 15))
627 = read_integral_parameter (p
+ 15, p
- 2, max_tinst_depth
);
628 else if (!strncmp (p
, "name-mangling-version-", 22))
629 name_mangling_version
630 = read_integral_parameter (p
+ 22, p
- 2, name_mangling_version
);
631 else if (!strncmp (p
, "dump-translation-unit-", 22))
634 error ("no file specified with -fdump-translation-unit");
636 flag_dump_translation_unit
= p
+ 22;
643 !found
&& j
< (sizeof (lang_f_options
)
644 / sizeof (lang_f_options
[0]));
647 if (!strcmp (p
, lang_f_options
[j
].string
))
649 *lang_f_options
[j
].variable
= lang_f_options
[j
].on_value
;
650 /* A goto here would be cleaner,
651 but breaks the vax pcc. */
654 if (p
[0] == 'n' && p
[1] == 'o' && p
[2] == '-'
655 && ! strcmp (p
+3, lang_f_options
[j
].string
))
657 *lang_f_options
[j
].variable
= ! lang_f_options
[j
].on_value
;
665 else if (p
[0] == '-' && p
[1] == 'W')
669 /* The -W options control the warning behavior of the compiler. */
672 if (p
[0] == 'n' && p
[1] == 'o' && p
[2] == '-')
675 if (!strcmp (p
, "implicit"))
676 warn_implicit
= setting
;
677 else if (!strcmp (p
, "long-long"))
678 warn_long_long
= setting
;
679 else if (!strcmp (p
, "return-type"))
680 warn_return_type
= setting
;
681 else if (!strcmp (p
, "ctor-dtor-privacy"))
682 warn_ctor_dtor_privacy
= setting
;
683 else if (!strcmp (p
, "write-strings"))
684 warn_write_strings
= setting
;
685 else if (!strcmp (p
, "cast-qual"))
686 warn_cast_qual
= setting
;
687 else if (!strcmp (p
, "char-subscripts"))
688 warn_char_subscripts
= setting
;
689 else if (!strcmp (p
, "pointer-arith"))
690 warn_pointer_arith
= setting
;
691 else if (!strcmp (p
, "missing-prototypes"))
692 warn_missing_prototypes
= setting
;
693 else if (!strcmp (p
, "redundant-decls"))
694 warn_redundant_decls
= setting
;
695 else if (!strcmp (p
, "missing-braces"))
696 warn_missing_braces
= setting
;
697 else if (!strcmp (p
, "sign-compare"))
698 warn_sign_compare
= setting
;
699 else if (!strcmp (p
, "float-equal"))
700 warn_float_equal
= setting
;
701 else if (!strcmp (p
, "format"))
702 warn_format
= setting
;
703 else if (!strcmp (p
, "conversion"))
704 warn_conversion
= setting
;
705 else if (!strcmp (p
, "parentheses"))
706 warn_parentheses
= setting
;
707 else if (!strcmp (p
, "non-virtual-dtor"))
708 warn_nonvdtor
= setting
;
709 else if (!strcmp (p
, "extern-inline"))
710 warn_extern_inline
= setting
;
711 else if (!strcmp (p
, "reorder"))
712 warn_reorder
= setting
;
713 else if (!strcmp (p
, "synth"))
714 warn_synth
= setting
;
715 else if (!strcmp (p
, "pmf-conversions"))
716 warn_pmf2ptr
= setting
;
717 else if (!strcmp (p
, "effc++"))
719 else if (!strcmp (p
, "sign-promo"))
720 warn_sign_promo
= setting
;
721 else if (!strcmp (p
, "old-style-cast"))
722 warn_old_style_cast
= setting
;
723 else if (!strcmp (p
, "overloaded-virtual"))
724 warn_overloaded_virtual
= setting
;
725 else if (!strcmp (p
, "multichar"))
726 warn_multichar
= setting
;
727 else if (!strcmp (p
, "unknown-pragmas"))
728 /* Set to greater than 1, so that even unknown pragmas in
729 system headers will be warned about. */
730 warn_unknown_pragmas
= setting
* 2;
731 else if (!strcmp (p
, "non-template-friend"))
732 warn_nontemplate_friend
= setting
;
733 else if (!strcmp (p
, "deprecated"))
734 warn_deprecated
= setting
;
735 else if (!strcmp (p
, "comment"))
736 ; /* cpp handles this one. */
737 else if (!strcmp (p
, "comments"))
738 ; /* cpp handles this one. */
739 else if (!strcmp (p
, "trigraphs"))
740 ; /* cpp handles this one. */
741 else if (!strcmp (p
, "import"))
742 ; /* cpp handles this one. */
743 else if (!strcmp (p
, "all"))
745 warn_return_type
= setting
;
746 warn_unused
= setting
;
747 warn_implicit
= setting
;
748 warn_switch
= setting
;
749 warn_format
= setting
;
750 warn_parentheses
= setting
;
751 warn_missing_braces
= setting
;
752 warn_sign_compare
= setting
;
753 warn_multichar
= setting
;
754 /* We save the value of warn_uninitialized, since if they put
755 -Wuninitialized on the command line, we need to generate a
756 warning about not using it without also specifying -O. */
757 if (warn_uninitialized
!= 1)
758 warn_uninitialized
= (setting
? 2 : 0);
759 /* Only warn about unknown pragmas that are not in system
761 warn_unknown_pragmas
= 1;
763 /* C++-specific warnings. */
764 warn_ctor_dtor_privacy
= setting
;
765 warn_nonvdtor
= setting
;
766 warn_reorder
= setting
;
767 warn_nontemplate_friend
= setting
;
769 else return strings_processed
;
771 else if (!strcmp (p
, "-ansi"))
772 flag_no_nonansi_builtin
= 1, flag_ansi
= 1,
773 flag_no_gnu_keywords
= 1, flag_operator_names
= 1;
775 /* Undocumented, only ever used when you're invoking cc1plus by hand, since
776 it's probably safe to assume no sane person would ever want to use this
777 under normal circumstances. */
778 else if (!strcmp (p
, "-spew-debug"))
782 return strings_processed
;
787 /* Incorporate `const' and `volatile' qualifiers for member functions.
788 FUNCTION is a TYPE_DECL or a FUNCTION_DECL.
789 QUALS is a list of qualifiers. Returns any explicit
790 top-level qualifiers of the method's this pointer, anything other than
791 TYPE_UNQUALIFIED will be an extension. */
794 grok_method_quals (ctype
, function
, quals
)
795 tree ctype
, function
, quals
;
797 tree fntype
= TREE_TYPE (function
);
798 tree raises
= TYPE_RAISES_EXCEPTIONS (fntype
);
799 int type_quals
= TYPE_UNQUALIFIED
;
800 int dup_quals
= TYPE_UNQUALIFIED
;
801 int this_quals
= TYPE_UNQUALIFIED
;
805 int tq
= cp_type_qual_from_rid (TREE_VALUE (quals
));
807 if ((type_quals
| this_quals
) & tq
)
809 else if (tq
& TYPE_QUAL_RESTRICT
)
813 quals
= TREE_CHAIN (quals
);
817 if (dup_quals
!= TYPE_UNQUALIFIED
)
818 cp_error ("duplicate type qualifiers in %s declaration",
819 TREE_CODE (function
) == FUNCTION_DECL
820 ? "member function" : "type");
822 ctype
= cp_build_qualified_type (ctype
, type_quals
);
823 fntype
= build_cplus_method_type (ctype
, TREE_TYPE (fntype
),
824 (TREE_CODE (fntype
) == METHOD_TYPE
825 ? TREE_CHAIN (TYPE_ARG_TYPES (fntype
))
826 : TYPE_ARG_TYPES (fntype
)));
828 fntype
= build_exception_variant (fntype
, raises
);
830 TREE_TYPE (function
) = fntype
;
834 /* Warn when -fexternal-templates is used and #pragma
835 interface/implementation is not used all the times it should be,
839 warn_if_unknown_interface (decl
)
842 static int already_warned
= 0;
843 if (already_warned
++)
846 if (flag_alt_external_templates
)
848 struct tinst_level
*til
= tinst_for_decl ();
850 char *sf
= input_filename
;
855 input_filename
= til
->file
;
857 cp_warning ("template `%#D' instantiated in file without #pragma interface",
863 cp_warning_at ("template `%#D' defined in file without #pragma interface",
867 /* A subroutine of the parser, to handle a component list. */
870 grok_x_components (specs
)
873 struct pending_inline
**p
;
876 specs
= strip_attrs (specs
);
878 check_tag_decl (specs
);
879 t
= groktypename (build_decl_list (specs
, NULL_TREE
));
881 /* The only case where we need to do anything additional here is an
882 anonymous union field, e.g.: `struct S { union { int i; }; };'. */
883 if (t
== NULL_TREE
|| !ANON_AGGR_TYPE_P (t
))
886 fixup_anonymous_aggr (t
);
887 finish_member_declaration (build_lang_decl (FIELD_DECL
, NULL_TREE
, t
));
889 /* Ignore any inline function definitions in the anonymous union
890 since an anonymous union may not have function members. */
891 p
= &pending_inlines
;
892 for (; *p
; *p
= (*p
)->next
)
893 if (DECL_CONTEXT ((*p
)->fndecl
) != t
)
897 /* Constructors for types with virtual baseclasses need an "in-charge" flag
898 saying whether this constructor is responsible for initialization of
899 virtual baseclasses or not. All destructors also need this "in-charge"
900 flag, which additionally determines whether or not the destructor should
901 free the memory for the object.
903 This function adds the "in-charge" flag to member function FN if
904 appropriate. It is called from grokclassfn and tsubst.
905 FN must be either a constructor or destructor. */
908 maybe_retrofit_in_chrg (fn
)
911 tree basetype
, arg_types
, parms
, parm
, fntype
;
913 if (DECL_CONSTRUCTOR_P (fn
)
914 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CLASS_CONTEXT (fn
))
915 && ! DECL_CONSTRUCTOR_FOR_VBASE_P (fn
))
917 else if (! DECL_CONSTRUCTOR_P (fn
)
918 && TREE_CHAIN (DECL_ARGUMENTS (fn
)) == NULL_TREE
)
923 if (DECL_CONSTRUCTOR_P (fn
))
924 DECL_CONSTRUCTOR_FOR_VBASE_P (fn
) = 1;
926 /* First add it to DECL_ARGUMENTS... */
927 parm
= build_decl (PARM_DECL
, in_charge_identifier
, integer_type_node
);
928 /* Mark the artificial `__in_chrg' parameter as "artificial". */
929 SET_DECL_ARTIFICIAL (parm
);
930 DECL_ARG_TYPE (parm
) = integer_type_node
;
931 TREE_READONLY (parm
) = 1;
932 parms
= DECL_ARGUMENTS (fn
);
933 TREE_CHAIN (parm
) = TREE_CHAIN (parms
);
934 TREE_CHAIN (parms
) = parm
;
936 /* ...and then to TYPE_ARG_TYPES. */
937 arg_types
= TYPE_ARG_TYPES (TREE_TYPE (fn
));
938 basetype
= TREE_TYPE (TREE_VALUE (arg_types
));
939 arg_types
= hash_tree_chain (integer_type_node
, TREE_CHAIN (arg_types
));
940 fntype
= build_cplus_method_type (basetype
, TREE_TYPE (TREE_TYPE (fn
)),
942 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
)))
943 fntype
= build_exception_variant (fntype
,
944 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn
)));
945 TREE_TYPE (fn
) = fntype
;
948 /* Classes overload their constituent function names automatically.
949 When a function name is declared in a record structure,
950 its name is changed to it overloaded name. Since names for
951 constructors and destructors can conflict, we place a leading
954 CNAME is the name of the class we are grokking for.
956 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
958 FLAGS contains bits saying what's special about today's
959 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
961 If FUNCTION is a destructor, then we must add the `auto-delete' field
962 as a second parameter. There is some hair associated with the fact
963 that we must "declare" this variable in the manner consistent with the
964 way the rest of the arguments were declared.
966 QUALS are the qualifiers for the this pointer. */
969 grokclassfn (ctype
, function
, flags
, quals
)
970 tree ctype
, function
;
971 enum overload_flags flags
;
974 tree fn_name
= DECL_NAME (function
);
975 int this_quals
= TYPE_UNQUALIFIED
;
977 if (fn_name
== NULL_TREE
)
979 error ("name missing for member function");
980 fn_name
= get_identifier ("<anonymous>");
981 DECL_NAME (function
) = fn_name
;
985 this_quals
= grok_method_quals (ctype
, function
, quals
);
987 if (TREE_CODE (TREE_TYPE (function
)) == METHOD_TYPE
)
989 /* Must add the class instance variable up front. */
990 /* Right now we just make this a pointer. But later
991 we may wish to make it special. */
992 tree type
= TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (function
)));
994 tree parm
= build_decl (PARM_DECL
, this_identifier
,
995 cp_build_qualified_type (type
, this_quals
| TYPE_QUAL_CONST
));
996 /* Mark the artificial `this' parameter as "artificial". */
997 SET_DECL_ARTIFICIAL (parm
);
998 DECL_ARG_TYPE (parm
) = type
;
999 /* We can make this a register, so long as we don't
1000 accidentally complain if someone tries to take its address. */
1001 DECL_REGISTER (parm
) = 1;
1002 TREE_CHAIN (parm
) = last_function_parms
;
1003 last_function_parms
= parm
;
1006 DECL_ARGUMENTS (function
) = last_function_parms
;
1007 /* First approximations. */
1008 DECL_CONTEXT (function
) = ctype
;
1009 DECL_CLASS_CONTEXT (function
) = ctype
;
1011 if (flags
== DTOR_FLAG
|| DECL_CONSTRUCTOR_P (function
))
1012 maybe_retrofit_in_chrg (function
);
1014 if (flags
== DTOR_FLAG
)
1016 DECL_ASSEMBLER_NAME (function
) = build_destructor_name (ctype
);
1017 TYPE_HAS_DESTRUCTOR (ctype
) = 1;
1020 set_mangled_name_for_decl (function
);
1023 /* Work on the expr used by alignof (this is only called by the parser). */
1032 if (processing_template_decl
)
1033 return build_min (ALIGNOF_EXPR
, sizetype
, expr
);
1035 if (TREE_CODE (expr
) == COMPONENT_REF
1036 && DECL_C_BIT_FIELD (TREE_OPERAND (expr
, 1)))
1037 error ("`__alignof__' applied to a bit-field");
1039 if (TREE_CODE (expr
) == INDIRECT_REF
)
1041 best
= t
= TREE_OPERAND (expr
, 0);
1042 bestalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
1044 while (TREE_CODE (t
) == NOP_EXPR
1045 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == POINTER_TYPE
)
1048 t
= TREE_OPERAND (t
, 0);
1049 thisalign
= TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t
)));
1050 if (thisalign
> bestalign
)
1051 best
= t
, bestalign
= thisalign
;
1053 return c_alignof (TREE_TYPE (TREE_TYPE (best
)));
1056 return c_alignof (TREE_TYPE (expr
));
1059 /* Create an ARRAY_REF, checking for the user doing things backwards
1063 grok_array_decl (array_expr
, index_exp
)
1064 tree array_expr
, index_exp
;
1066 tree type
= TREE_TYPE (array_expr
);
1067 tree p1
, p2
, i1
, i2
;
1069 if (type
== error_mark_node
|| index_exp
== error_mark_node
)
1070 return error_mark_node
;
1071 if (processing_template_decl
)
1072 return build_min (ARRAY_REF
, type
? TREE_TYPE (type
) : NULL_TREE
,
1073 array_expr
, index_exp
);
1075 if (type
== NULL_TREE
)
1077 /* Something has gone very wrong. Assume we are mistakenly reducing
1078 an expression instead of a declaration. */
1079 error ("parser may be lost: is there a '{' missing somewhere?");
1083 if (TREE_CODE (type
) == OFFSET_TYPE
1084 || TREE_CODE (type
) == REFERENCE_TYPE
)
1085 type
= TREE_TYPE (type
);
1087 /* If they have an `operator[]', use that. */
1088 if (IS_AGGR_TYPE (type
) || IS_AGGR_TYPE (TREE_TYPE (index_exp
)))
1089 return build_opfncall (ARRAY_REF
, LOOKUP_NORMAL
,
1090 array_expr
, index_exp
, NULL_TREE
);
1092 /* Otherwise, create an ARRAY_REF for a pointer or array type. It
1093 is a little-known fact that, if `a' is an array and `i' is an
1094 int, you can write `i[a]', which means the same thing as `a[i]'. */
1096 if (TREE_CODE (type
) == ARRAY_TYPE
)
1099 p1
= build_expr_type_conversion (WANT_POINTER
, array_expr
, 0);
1101 if (TREE_CODE (TREE_TYPE (index_exp
)) == ARRAY_TYPE
)
1104 p2
= build_expr_type_conversion (WANT_POINTER
, index_exp
, 0);
1106 i1
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, array_expr
, 0);
1107 i2
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, index_exp
, 0);
1109 if ((p1
&& i2
) && (i1
&& p2
))
1110 error ("ambiguous conversion for array subscript");
1113 array_expr
= p1
, index_exp
= i2
;
1115 array_expr
= p2
, index_exp
= i1
;
1118 cp_error ("invalid types `%T[%T]' for array subscript",
1119 type
, TREE_TYPE (index_exp
));
1120 return error_mark_node
;
1123 if (array_expr
== error_mark_node
|| index_exp
== error_mark_node
)
1124 error ("ambiguous conversion for array subscript");
1126 return build_array_ref (array_expr
, index_exp
);
1129 /* Given the cast expression EXP, checking out its validity. Either return
1130 an error_mark_node if there was an unavoidable error, return a cast to
1131 void for trying to delete a pointer w/ the value 0, or return the
1132 call to delete. If DOING_VEC is 1, we handle things differently
1133 for doing an array delete. If DOING_VEC is 2, they gave us the
1134 array size as an argument to delete.
1135 Implements ARM $5.3.4. This is called from the parser. */
1138 delete_sanity (exp
, size
, doing_vec
, use_global_delete
)
1140 int doing_vec
, use_global_delete
;
1143 /* For a regular vector delete (aka, no size argument) we will pass
1144 this down as a NULL_TREE into build_vec_delete. */
1145 tree maxindex
= NULL_TREE
;
1147 if (exp
== error_mark_node
)
1150 if (processing_template_decl
)
1152 t
= build_min (DELETE_EXPR
, void_type_node
, exp
, size
);
1153 DELETE_EXPR_USE_GLOBAL (t
) = use_global_delete
;
1154 DELETE_EXPR_USE_VEC (t
) = doing_vec
;
1158 if (TREE_CODE (exp
) == OFFSET_REF
)
1159 exp
= resolve_offset_ref (exp
);
1160 exp
= convert_from_reference (exp
);
1161 t
= stabilize_reference (exp
);
1162 t
= build_expr_type_conversion (WANT_POINTER
, t
, 1);
1164 if (t
== NULL_TREE
|| t
== error_mark_node
)
1166 cp_error ("type `%#T' argument given to `delete', expected pointer",
1168 return error_mark_node
;
1173 maxindex
= build_binary_op (MINUS_EXPR
, size
, integer_one_node
);
1174 pedwarn ("anachronistic use of array size in vector delete");
1177 type
= TREE_TYPE (t
);
1179 /* As of Valley Forge, you can delete a pointer to const. */
1181 /* You can't delete functions. */
1182 if (TREE_CODE (TREE_TYPE (type
)) == FUNCTION_TYPE
)
1184 error ("cannot delete a function");
1185 return error_mark_node
;
1188 /* Deleting ptr to void is undefined behaviour [expr.delete/3]. */
1189 if (TREE_CODE (TREE_TYPE (type
)) == VOID_TYPE
)
1190 cp_warning ("`%T' is not a pointer-to-object type", type
);
1192 /* An array can't have been allocated by new, so complain. */
1193 if (TREE_CODE (t
) == ADDR_EXPR
1194 && TREE_CODE (TREE_OPERAND (t
, 0)) == VAR_DECL
1195 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t
, 0))) == ARRAY_TYPE
)
1196 cp_warning ("deleting array `%#D'", TREE_OPERAND (t
, 0));
1198 /* Deleting a pointer with the value zero is valid and has no effect. */
1199 if (integer_zerop (t
))
1200 return build1 (NOP_EXPR
, void_type_node
, t
);
1203 return build_vec_delete (t
, maxindex
, integer_one_node
, use_global_delete
);
1206 if (IS_AGGR_TYPE (TREE_TYPE (type
))
1207 && TYPE_GETS_REG_DELETE (TREE_TYPE (type
)))
1209 /* Only do access checking here; we'll be calling op delete
1210 from the destructor. */
1211 tree tmp
= build_op_delete_call (DELETE_EXPR
, t
, size_zero_node
,
1212 LOOKUP_NORMAL
, NULL_TREE
);
1213 if (tmp
== error_mark_node
)
1214 return error_mark_node
;
1217 return build_delete (type
, t
, integer_three_node
,
1218 LOOKUP_NORMAL
, use_global_delete
);
1222 /* Report an error if the indicated template declaration is not the
1223 sort of thing that should be a member template. */
1226 check_member_template (tmpl
)
1231 my_friendly_assert (TREE_CODE (tmpl
) == TEMPLATE_DECL
, 0);
1232 decl
= DECL_TEMPLATE_RESULT (tmpl
);
1234 if (TREE_CODE (decl
) == FUNCTION_DECL
1235 || (TREE_CODE (decl
) == TYPE_DECL
1236 && IS_AGGR_TYPE (TREE_TYPE (decl
))))
1238 if (current_function_decl
)
1239 /* 14.5.2.2 [temp.mem]
1241 A local class shall not have member templates. */
1242 cp_error ("declaration of member template `%#D' in local class",
1245 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_VIRTUAL_P (decl
))
1247 /* 14.5.2.3 [temp.mem]
1249 A member function template shall not be virtual. */
1251 ("invalid use of `virtual' in template declaration of `%#D'",
1253 DECL_VIRTUAL_P (decl
) = 0;
1256 /* The debug-information generating code doesn't know what to do
1257 with member templates. */
1258 DECL_IGNORED_P (tmpl
) = 1;
1261 cp_error ("template declaration of `%#D'", decl
);
1264 /* Return true iff TYPE is a valid Java parameter or return type. */
1267 acceptable_java_type (type
)
1270 if (TREE_CODE (type
) == VOID_TYPE
|| TYPE_FOR_JAVA (type
))
1272 if (TREE_CODE (type
) == POINTER_TYPE
)
1274 type
= TREE_TYPE (type
);
1275 if (TREE_CODE (type
) == RECORD_TYPE
)
1278 if (! TYPE_FOR_JAVA (type
))
1280 if (! CLASSTYPE_TEMPLATE_INFO (type
))
1282 args
= CLASSTYPE_TI_ARGS (type
);
1283 i
= TREE_VEC_LENGTH (args
);
1286 type
= TREE_VEC_ELT (args
, i
);
1287 if (TREE_CODE (type
) == POINTER_TYPE
)
1288 type
= TREE_TYPE (type
);
1289 if (! TYPE_FOR_JAVA (type
))
1298 /* For a METHOD in a Java class CTYPE, return 1 if
1299 the parameter and return types are valid Java types.
1300 Otherwise, print appropriate error messages, and return 0. */
1303 check_java_method (method
)
1307 tree arg_types
= TYPE_ARG_TYPES (TREE_TYPE (method
));
1308 tree ret_type
= TREE_TYPE (TREE_TYPE (method
));
1309 if (! acceptable_java_type (ret_type
))
1311 cp_error ("Java method '%D' has non-Java return type `%T'",
1315 for (; arg_types
!= NULL_TREE
; arg_types
= TREE_CHAIN (arg_types
))
1317 tree type
= TREE_VALUE (arg_types
);
1318 if (! acceptable_java_type (type
))
1320 cp_error ("Java method '%D' has non-Java parameter type `%T'",
1325 return jerr
? 0 : 1;
1328 /* Sanity check: report error if this function FUNCTION is not
1329 really a member of the class (CTYPE) it is supposed to belong to.
1330 CNAME is the same here as it is for grokclassfn above. */
1333 check_classfn (ctype
, function
)
1334 tree ctype
, function
;
1336 tree fn_name
= DECL_NAME (function
);
1337 tree fndecl
, fndecls
;
1338 tree method_vec
= CLASSTYPE_METHOD_VEC (complete_type (ctype
));
1342 if (DECL_USE_TEMPLATE (function
)
1343 && is_member_template (DECL_TI_TEMPLATE (function
)))
1344 /* Since this is a specialization of a member template,
1345 we're not going to find the declaration in the class.
1348 struct S { template <typename T> void f(T); };
1349 template <> void S::f(int);
1351 we're not going to find `S::f(int)', but there's no
1352 reason we should, either. We let our callers know we didn't
1353 find the method, but we don't complain. */
1356 if (method_vec
!= 0)
1358 methods
= &TREE_VEC_ELT (method_vec
, 0);
1359 end
= TREE_VEC_END (method_vec
);
1361 /* First suss out ctors and dtors. */
1362 if (*methods
&& fn_name
== DECL_NAME (OVL_CURRENT (*methods
))
1363 && DECL_CONSTRUCTOR_P (function
))
1365 if (*++methods
&& fn_name
== DECL_NAME (OVL_CURRENT (*methods
))
1366 && DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function
)))
1369 while (++methods
!= end
&& *methods
)
1372 if (fn_name
== DECL_NAME (OVL_CURRENT (*methods
)))
1375 for (fndecls
= *methods
; fndecls
!= NULL_TREE
;
1376 fndecls
= OVL_NEXT (fndecls
))
1378 fndecl
= OVL_CURRENT (fndecls
);
1379 /* The DECL_ASSEMBLER_NAME for a TEMPLATE_DECL, or
1380 for a for member function of a template class, is
1381 not mangled, so the check below does not work
1382 correctly in that case. Since mangled destructor
1383 names do not include the type of the arguments,
1384 we can't use this short-cut for them, either.
1385 (It's not legal to declare arguments for a
1386 destructor, but some people try.) */
1387 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function
))
1388 && (DECL_ASSEMBLER_NAME (function
)
1389 != DECL_NAME (function
))
1390 && (DECL_ASSEMBLER_NAME (fndecl
)
1391 != DECL_NAME (fndecl
))
1392 && (DECL_ASSEMBLER_NAME (function
)
1393 == DECL_ASSEMBLER_NAME (fndecl
)))
1396 /* We cannot simply call decls_match because this
1397 doesn't work for static member functions that are
1398 pretending to be methods, and because the name
1399 may have been changed by asm("new_name"). */
1400 if (DECL_NAME (function
) == DECL_NAME (fndecl
))
1402 tree p1
= TYPE_ARG_TYPES (TREE_TYPE (function
));
1403 tree p2
= TYPE_ARG_TYPES (TREE_TYPE (fndecl
));
1405 /* Get rid of the this parameter on functions that become
1407 if (DECL_STATIC_FUNCTION_P (fndecl
)
1408 && TREE_CODE (TREE_TYPE (function
)) == METHOD_TYPE
)
1409 p1
= TREE_CHAIN (p1
);
1411 if (same_type_p (TREE_TYPE (TREE_TYPE (function
)),
1412 TREE_TYPE (TREE_TYPE (fndecl
)))
1413 && compparms (p1
, p2
)
1414 && (DECL_TEMPLATE_SPECIALIZATION (function
)
1415 == DECL_TEMPLATE_SPECIALIZATION (fndecl
))
1416 && (!DECL_TEMPLATE_SPECIALIZATION (function
)
1417 || (DECL_TI_TEMPLATE (function
)
1418 == DECL_TI_TEMPLATE (fndecl
))))
1427 if (methods
!= end
&& *methods
)
1429 tree fndecl
= *methods
;
1430 cp_error ("prototype for `%#D' does not match any in class `%T'",
1432 cp_error_at ("candidate%s: %+#D", OVL_NEXT (fndecl
) ? "s are" : " is",
1433 OVL_CURRENT (fndecl
));
1434 while (fndecl
= OVL_NEXT (fndecl
), fndecl
)
1435 cp_error_at (" %#D", OVL_CURRENT(fndecl
));
1440 if (TYPE_SIZE (ctype
) == 0)
1441 incomplete_type_error (function
, ctype
);
1443 cp_error ("no `%#D' member function declared in class `%T'",
1447 /* If we did not find the method in the class, add it to avoid
1448 spurious errors (unless the CTYPE is not yet defined, in which
1449 case we'll only confuse ourselves when the function is declared
1450 properly within the class. */
1451 if (TYPE_SIZE (ctype
))
1452 add_method (ctype
, methods
, function
);
1456 /* We have just processed the DECL, which is a static data member.
1457 Its initializer, if present, is INIT. The ASMSPEC_TREE, if
1458 present, is the assembly-language name for the data member.
1459 FLAGS is as for cp_finish_decl. */
1462 finish_static_data_member_decl (decl
, init
, asmspec_tree
, flags
)
1468 const char *asmspec
= 0;
1471 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
1473 my_friendly_assert (TREE_PUBLIC (decl
), 0);
1475 /* We cannot call pushdecl here, because that would fill in the
1476 decl of our TREE_CHAIN. Instead, we modify cp_finish_decl to do
1477 the right thing, namely, to put this decl out straight away. */
1478 /* current_class_type can be NULL_TREE in case of error. */
1479 if (!asmspec
&& current_class_type
)
1481 DECL_INITIAL (decl
) = error_mark_node
;
1482 DECL_ASSEMBLER_NAME (decl
)
1483 = build_static_name (current_class_type
, DECL_NAME (decl
));
1485 if (! processing_template_decl
)
1487 if (!pending_statics
)
1488 VARRAY_TREE_INIT (pending_statics
, 32, "pending_statics");
1489 VARRAY_PUSH_TREE (pending_statics
, decl
);
1492 /* Static consts need not be initialized in the class definition. */
1493 if (init
!= NULL_TREE
&& TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl
)))
1495 static int explanation
= 0;
1497 error ("initializer invalid for static member with constructor");
1498 if (explanation
++ == 0)
1499 error ("(you really want to initialize it separately)");
1502 /* Force the compiler to know when an uninitialized static const
1503 member is being used. */
1504 if (CP_TYPE_CONST_P (TREE_TYPE (decl
)) && init
== 0)
1505 TREE_USED (decl
) = 1;
1506 DECL_INITIAL (decl
) = init
;
1507 DECL_IN_AGGR_P (decl
) = 1;
1508 DECL_CONTEXT (decl
) = current_class_type
;
1509 DECL_CLASS_CONTEXT (decl
) = current_class_type
;
1511 cp_finish_decl (decl
, init
, asmspec_tree
, flags
);
1514 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
1515 of a structure component, returning a FIELD_DECL node.
1516 QUALS is a list of type qualifiers for this decl (such as for declaring
1517 const member functions).
1519 This is done during the parsing of the struct declaration.
1520 The FIELD_DECL nodes are chained together and the lot of them
1521 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
1525 If class A defines that certain functions in class B are friends, then
1526 the way I have set things up, it is B who is interested in permission
1527 granted by A. However, it is in A's context that these declarations
1528 are parsed. By returning a void_type_node, class A does not attempt
1529 to incorporate the declarations of the friends within its structure.
1531 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
1532 CHANGES TO CODE IN `start_method'. */
1535 grokfield (declarator
, declspecs
, init
, asmspec_tree
, attrlist
)
1536 tree declarator
, declspecs
, init
, asmspec_tree
, attrlist
;
1538 register tree value
;
1539 const char *asmspec
= 0;
1540 int flags
= LOOKUP_ONLYCONVERTING
;
1542 /* Convert () initializers to = initializers. */
1543 if (init
== NULL_TREE
&& declarator
!= NULL_TREE
1544 && TREE_CODE (declarator
) == CALL_EXPR
1545 && TREE_OPERAND (declarator
, 0)
1546 && (TREE_CODE (TREE_OPERAND (declarator
, 0)) == IDENTIFIER_NODE
1547 || TREE_CODE (TREE_OPERAND (declarator
, 0)) == SCOPE_REF
)
1548 && parmlist_is_exprlist (CALL_DECLARATOR_PARMS (declarator
)))
1550 init
= TREE_OPERAND (declarator
, 1);
1551 declarator
= TREE_OPERAND (declarator
, 0);
1555 if (declspecs
== NULL_TREE
1556 && TREE_CODE (declarator
) == SCOPE_REF
1557 && TREE_CODE (TREE_OPERAND (declarator
, 1)) == IDENTIFIER_NODE
)
1559 /* Access declaration */
1560 if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator
, 0))))
1562 else if (TREE_COMPLEXITY (declarator
) == current_class_depth
)
1563 pop_nested_class ();
1564 return do_class_using_decl (declarator
);
1568 && TREE_CODE (init
) == TREE_LIST
1569 && TREE_VALUE (init
) == error_mark_node
1570 && TREE_CHAIN (init
) == NULL_TREE
)
1573 value
= grokdeclarator (declarator
, declspecs
, FIELD
, init
!= 0, attrlist
);
1574 if (! value
|| value
== error_mark_node
)
1575 /* friend or constructor went bad. */
1578 /* Pass friendly classes back. */
1579 if (TREE_CODE (value
) == VOID_TYPE
)
1580 return void_type_node
;
1582 if (DECL_NAME (value
) != NULL_TREE
1583 && IDENTIFIER_POINTER (DECL_NAME (value
))[0] == '_'
1584 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value
)), "_vptr"))
1585 cp_error ("member `%D' conflicts with virtual function table field name",
1588 /* Stash away type declarations. */
1589 if (TREE_CODE (value
) == TYPE_DECL
)
1591 DECL_NONLOCAL (value
) = 1;
1592 DECL_CONTEXT (value
) = current_class_type
;
1593 DECL_CLASS_CONTEXT (value
) = current_class_type
;
1595 /* Now that we've updated the context, we need to remangle the
1596 name for this TYPE_DECL. */
1597 DECL_ASSEMBLER_NAME (value
) = DECL_NAME (value
);
1598 if (!uses_template_parms (value
))
1599 DECL_ASSEMBLER_NAME (value
) =
1600 get_identifier (build_overload_name (TREE_TYPE (value
), 1, 1));
1602 if (processing_template_decl
)
1603 value
= push_template_decl (value
);
1608 if (DECL_IN_AGGR_P (value
))
1610 cp_error ("`%D' is already defined in `%T'", value
,
1611 DECL_CONTEXT (value
));
1612 return void_type_node
;
1616 asmspec
= TREE_STRING_POINTER (asmspec_tree
);
1620 if (TREE_CODE (value
) == FUNCTION_DECL
)
1622 grok_function_init (value
, init
);
1625 else if (pedantic
&& TREE_CODE (value
) != VAR_DECL
)
1626 /* Already complained in grokdeclarator. */
1630 /* We allow initializers to become parameters to base
1632 if (TREE_CODE (init
) == TREE_LIST
)
1634 if (TREE_CHAIN (init
) == NULL_TREE
)
1635 init
= TREE_VALUE (init
);
1637 init
= digest_init (TREE_TYPE (value
), init
, (tree
*)0);
1640 if (TREE_CODE (init
) == CONST_DECL
)
1641 init
= DECL_INITIAL (init
);
1642 else if (TREE_READONLY_DECL_P (init
))
1643 init
= decl_constant_value (init
);
1644 else if (TREE_CODE (init
) == CONSTRUCTOR
)
1645 init
= digest_init (TREE_TYPE (value
), init
, (tree
*)0);
1646 if (init
== error_mark_node
)
1647 /* We must make this look different than `error_mark_node'
1648 because `decl_const_value' would mis-interpret it
1649 as only meaning that this VAR_DECL is defined. */
1650 init
= build1 (NOP_EXPR
, TREE_TYPE (value
), init
);
1651 else if (processing_template_decl
)
1653 else if (! TREE_CONSTANT (init
))
1655 /* We can allow references to things that are effectively
1656 static, since references are initialized with the address. */
1657 if (TREE_CODE (TREE_TYPE (value
)) != REFERENCE_TYPE
1658 || (TREE_STATIC (init
) == 0
1659 && (TREE_CODE_CLASS (TREE_CODE (init
)) != 'd'
1660 || DECL_EXTERNAL (init
) == 0)))
1662 error ("field initializer is not constant");
1663 init
= error_mark_node
;
1669 if (processing_template_decl
&& ! current_function_decl
1670 && (TREE_CODE (value
) == VAR_DECL
|| TREE_CODE (value
) == FUNCTION_DECL
))
1671 value
= push_template_decl (value
);
1674 cplus_decl_attributes (value
, TREE_PURPOSE (attrlist
),
1675 TREE_VALUE (attrlist
));
1677 if (TREE_CODE (value
) == VAR_DECL
)
1679 finish_static_data_member_decl (value
, init
, asmspec_tree
,
1683 if (TREE_CODE (value
) == FIELD_DECL
)
1687 /* This must override the asm specifier which was placed
1688 by grokclassfn. Lay this out fresh. */
1689 DECL_RTL (value
) = NULL_RTX
;
1690 DECL_ASSEMBLER_NAME (value
) = get_identifier (asmspec
);
1692 if (DECL_INITIAL (value
) == error_mark_node
)
1693 init
= error_mark_node
;
1694 cp_finish_decl (value
, init
, asmspec_tree
, flags
);
1695 DECL_INITIAL (value
) = init
;
1696 DECL_IN_AGGR_P (value
) = 1;
1699 if (TREE_CODE (value
) == FUNCTION_DECL
)
1703 /* This must override the asm specifier which was placed
1704 by grokclassfn. Lay this out fresh. */
1705 DECL_RTL (value
) = NULL_RTX
;
1706 DECL_ASSEMBLER_NAME (value
) = get_identifier (asmspec
);
1708 cp_finish_decl (value
, init
, asmspec_tree
, flags
);
1710 /* Pass friends back this way. */
1711 if (DECL_FRIEND_P (value
))
1712 return void_type_node
;
1714 DECL_IN_AGGR_P (value
) = 1;
1717 my_friendly_abort (21);
1722 /* Like `grokfield', but for bitfields.
1723 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
1726 grokbitfield (declarator
, declspecs
, width
)
1727 tree declarator
, declspecs
, width
;
1729 register tree value
= grokdeclarator (declarator
, declspecs
, BITFIELD
,
1732 if (! value
) return NULL_TREE
; /* friends went bad. */
1734 /* Pass friendly classes back. */
1735 if (TREE_CODE (value
) == VOID_TYPE
)
1736 return void_type_node
;
1738 if (TREE_CODE (value
) == TYPE_DECL
)
1740 cp_error ("cannot declare `%D' to be a bitfield type", value
);
1744 /* Usually, finish_struct_1 catches bitifields with invalid types.
1745 But, in the case of bitfields with function type, we confuse
1746 ourselves into thinking they are member functions, so we must
1748 if (TREE_CODE (value
) == FUNCTION_DECL
)
1750 cp_error ("cannot declare bitfield `%D' with funcion type",
1755 if (DECL_IN_AGGR_P (value
))
1757 cp_error ("`%D' is already defined in the class %T", value
,
1758 DECL_CONTEXT (value
));
1759 return void_type_node
;
1762 GNU_xref_member (current_class_name
, value
);
1764 if (TREE_STATIC (value
))
1766 cp_error ("static member `%D' cannot be a bitfield", value
);
1769 cp_finish_decl (value
, NULL_TREE
, NULL_TREE
, 0);
1771 if (width
!= error_mark_node
)
1773 constant_expression_warning (width
);
1774 DECL_INITIAL (value
) = width
;
1775 SET_DECL_C_BIT_FIELD (value
);
1778 DECL_IN_AGGR_P (value
) = 1;
1783 grokoptypename (declspecs
, declarator
)
1784 tree declspecs
, declarator
;
1786 tree t
= grokdeclarator (declarator
, declspecs
, TYPENAME
, 0, NULL_TREE
);
1787 return build_typename_overload (t
);
1790 /* When a function is declared with an initializer,
1791 do the right thing. Currently, there are two possibilities:
1796 // initialization possibility #1.
1797 virtual void f () = 0;
1819 // initialization possibility #2
1826 copy_assignment_arg_p (parmtype
, virtualp
)
1828 int virtualp ATTRIBUTE_UNUSED
;
1830 if (current_class_type
== NULL_TREE
)
1833 if (TREE_CODE (parmtype
) == REFERENCE_TYPE
)
1834 parmtype
= TREE_TYPE (parmtype
);
1836 if ((TYPE_MAIN_VARIANT (parmtype
) == current_class_type
)
1838 /* Non-standard hack to support old Booch components. */
1839 || (! virtualp
&& DERIVED_FROM_P (parmtype
, current_class_type
))
1848 grok_function_init (decl
, init
)
1852 /* An initializer for a function tells how this function should
1854 tree type
= TREE_TYPE (decl
);
1856 if (TREE_CODE (type
) == FUNCTION_TYPE
)
1857 cp_error ("initializer specified for non-member function `%D'", decl
);
1859 /* We'll check for this in finish_struct_1. */
1860 else if (DECL_VINDEX (decl
) == NULL_TREE
)
1861 cp_error ("initializer specified for non-virtual method `%D'", decl
);
1863 else if (integer_zerop (init
))
1866 /* Mark this function as being "defined". */
1867 DECL_INITIAL (decl
) = error_mark_node
;
1868 /* pure virtual destructors must be defined. */
1869 /* pure virtual needs to be defined (as abort) only when put in
1870 vtbl. For wellformed call, it should be itself. pr4737 */
1871 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl
)))
1873 /* Give this node rtl from `abort'. */
1874 DECL_RTL (decl
) = DECL_RTL (abort_fndecl
);
1877 DECL_ABSTRACT_VIRTUAL_P (decl
) = 1;
1878 if (DECL_NAME (decl
) == ansi_opname
[(int) MODIFY_EXPR
])
1881 = TREE_VALUE (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl
))));
1883 if (copy_assignment_arg_p (parmtype
, 1))
1884 TYPE_HAS_ABSTRACT_ASSIGN_REF (current_class_type
) = 1;
1888 cp_error ("invalid initializer for virtual method `%D'", decl
);
1892 cplus_decl_attributes (decl
, attributes
, prefix_attributes
)
1893 tree decl
, attributes
, prefix_attributes
;
1895 if (decl
== NULL_TREE
|| decl
== void_type_node
)
1898 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
1899 decl
= DECL_TEMPLATE_RESULT (decl
);
1901 decl_attributes (decl
, attributes
, prefix_attributes
);
1903 if (TREE_CODE (decl
) == TYPE_DECL
)
1904 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (decl
), TREE_TYPE (decl
));
1907 /* CONSTRUCTOR_NAME:
1908 Return the name for the constructor (or destructor) for the
1909 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1910 IDENTIFIER_NODE. When given a template, this routine doesn't
1911 lose the specialization. */
1914 constructor_name_full (thing
)
1917 if (TREE_CODE (thing
) == TEMPLATE_TYPE_PARM
1918 || TREE_CODE (thing
) == TEMPLATE_TEMPLATE_PARM
1919 || TREE_CODE (thing
) == TYPENAME_TYPE
)
1920 thing
= TYPE_NAME (thing
);
1921 else if (IS_AGGR_TYPE_CODE (TREE_CODE (thing
)))
1923 if (TYPE_WAS_ANONYMOUS (thing
) && TYPE_HAS_CONSTRUCTOR (thing
))
1924 thing
= DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (thing
), 0)));
1926 thing
= TYPE_NAME (thing
);
1928 if (TREE_CODE (thing
) == TYPE_DECL
1929 || (TREE_CODE (thing
) == TEMPLATE_DECL
1930 && TREE_CODE (DECL_TEMPLATE_RESULT (thing
)) == TYPE_DECL
))
1931 thing
= DECL_NAME (thing
);
1932 my_friendly_assert (TREE_CODE (thing
) == IDENTIFIER_NODE
, 197);
1936 /* CONSTRUCTOR_NAME:
1937 Return the name for the constructor (or destructor) for the
1938 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1939 IDENTIFIER_NODE. When given a template, return the plain
1940 unspecialized name. */
1943 constructor_name (thing
)
1947 thing
= constructor_name_full (thing
);
1948 t
= IDENTIFIER_TEMPLATE (thing
);
1954 /* Record the existence of an addressable inline function. */
1957 mark_inline_for_output (decl
)
1960 decl
= DECL_MAIN_VARIANT (decl
);
1961 if (DECL_SAVED_INLINE (decl
))
1963 DECL_SAVED_INLINE (decl
) = 1;
1965 VARRAY_TREE_INIT (saved_inlines
, 32, "saved_inlines");
1967 VARRAY_PUSH_TREE (saved_inlines
, decl
);
1970 /* Hand off a unique name which can be used for variable we don't really
1971 want to know about anyway, for example, the anonymous variables which
1972 are needed to make references work. Declare this thing so we can use it.
1973 The variable created will be of type TYPE.
1975 STATICP is nonzero if this variable should be static. */
1978 get_temp_name (type
, staticp
)
1982 char buf
[sizeof (AUTO_TEMP_FORMAT
) + 20];
1984 int toplev
= toplevel_bindings_p ();
1986 if (toplev
|| staticp
)
1988 sprintf (buf
, AUTO_TEMP_FORMAT
, global_temp_name_counter
++);
1989 decl
= pushdecl_top_level (build_decl (VAR_DECL
, get_identifier (buf
), type
));
1993 sprintf (buf
, AUTO_TEMP_FORMAT
, temp_name_counter
++);
1994 decl
= pushdecl (build_decl (VAR_DECL
, get_identifier (buf
), type
));
1996 TREE_USED (decl
) = 1;
1997 TREE_STATIC (decl
) = staticp
;
1998 DECL_ARTIFICIAL (decl
) = 1;
2000 /* If this is a local variable, then lay out its rtl now.
2001 Otherwise, callers of this function are responsible for dealing
2002 with this variable's rtl. */
2006 my_friendly_assert (DECL_INITIAL (decl
) == NULL_TREE
,
2013 /* Hunts through the global anonymous union ANON_DECL, building
2014 appropriate VAR_DECLs. Stores cleanups on the list of ELEMS, and
2015 returns a VAR_DECL whose size is the same as the size of the
2016 ANON_DECL, if one is available. */
2019 build_anon_union_vars (anon_decl
, elems
, static_p
, external_p
)
2025 tree type
= TREE_TYPE (anon_decl
);
2026 tree main_decl
= NULL_TREE
;
2029 /* Rather than write the code to handle the non-union case,
2030 just give an error. */
2031 if (TREE_CODE (type
) != UNION_TYPE
)
2032 error ("anonymous struct not inside named type");
2034 for (field
= TYPE_FIELDS (type
);
2036 field
= TREE_CHAIN (field
))
2040 if (DECL_ARTIFICIAL (field
))
2042 if (TREE_CODE (field
) != FIELD_DECL
)
2044 cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members",
2049 if (TREE_PRIVATE (field
))
2050 cp_pedwarn_at ("private member `%#D' in anonymous union", field
);
2051 else if (TREE_PROTECTED (field
))
2052 cp_pedwarn_at ("protected member `%#D' in anonymous union", field
);
2054 if (DECL_NAME (field
) == NULL_TREE
2055 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2057 decl
= build_anon_union_vars (field
, elems
, static_p
, external_p
);
2061 else if (DECL_NAME (field
) == NULL_TREE
)
2065 decl
= build_decl (VAR_DECL
, DECL_NAME (field
), TREE_TYPE (field
));
2066 /* tell `pushdecl' that this is not tentative. */
2067 DECL_INITIAL (decl
) = error_mark_node
;
2068 TREE_PUBLIC (decl
) = 0;
2069 TREE_STATIC (decl
) = static_p
;
2070 DECL_EXTERNAL (decl
) = external_p
;
2071 decl
= pushdecl (decl
);
2072 DECL_INITIAL (decl
) = NULL_TREE
;
2075 /* Only write out one anon union element--choose the one that
2076 can hold them all. */
2077 if (main_decl
== NULL_TREE
2078 && simple_cst_equal (DECL_SIZE (decl
),
2079 DECL_SIZE (anon_decl
)) == 1)
2082 /* ??? This causes there to be no debug info written out
2084 TREE_ASM_WRITTEN (decl
) = 1;
2086 if (DECL_NAME (field
) == NULL_TREE
2087 && ANON_AGGR_TYPE_P (TREE_TYPE (field
)))
2088 /* The remainder of the processing was already done in the
2092 /* If there's a cleanup to do, it belongs in the
2093 TREE_PURPOSE of the following TREE_LIST. */
2094 *elems
= tree_cons (NULL_TREE
, decl
, *elems
);
2095 TREE_TYPE (*elems
) = type
;
2101 /* Finish off the processing of a UNION_TYPE structure.
2102 If there are static members, then all members are
2103 static, and must be laid out together. If the
2104 union is an anonymous union, we arrange for that
2105 as well. PUBLIC_P is nonzero if this union is
2106 not declared static. */
2109 finish_anon_union (anon_union_decl
)
2110 tree anon_union_decl
;
2112 tree type
= TREE_TYPE (anon_union_decl
);
2114 int public_p
= TREE_PUBLIC (anon_union_decl
);
2115 int static_p
= TREE_STATIC (anon_union_decl
);
2116 int external_p
= DECL_EXTERNAL (anon_union_decl
);
2118 if (TYPE_FIELDS (type
) == NULL_TREE
)
2123 error ("global anonymous unions must be declared static");
2127 main_decl
= build_anon_union_vars (anon_union_decl
,
2128 &DECL_ANON_UNION_ELEMS (anon_union_decl
),
2129 static_p
, external_p
);
2131 if (main_decl
== NULL_TREE
)
2133 warning ("anonymous union with no members");
2139 make_decl_rtl (main_decl
, 0, toplevel_bindings_p ());
2140 DECL_RTL (anon_union_decl
) = DECL_RTL (main_decl
);
2141 expand_anon_union_decl (anon_union_decl
,
2143 DECL_ANON_UNION_ELEMS (anon_union_decl
));
2146 add_decl_stmt (anon_union_decl
);
2149 /* Finish processing a builtin type TYPE. It's name is NAME,
2150 its fields are in the array FIELDS. LEN is the number of elements
2151 in FIELDS minus one, or put another way, it is the maximum subscript
2154 It is given the same alignment as ALIGN_TYPE. */
2157 finish_builtin_type (type
, name
, fields
, len
, align_type
)
2166 TYPE_FIELDS (type
) = fields
[0];
2167 for (i
= 0; i
< len
; i
++)
2169 layout_type (TREE_TYPE (fields
[i
]));
2170 DECL_FIELD_CONTEXT (fields
[i
]) = type
;
2171 TREE_CHAIN (fields
[i
]) = fields
[i
+1];
2173 DECL_FIELD_CONTEXT (fields
[i
]) = type
;
2174 DECL_CLASS_CONTEXT (fields
[i
]) = type
;
2175 TYPE_ALIGN (type
) = TYPE_ALIGN (align_type
);
2177 #if 0 /* not yet, should get fixed properly later */
2178 TYPE_NAME (type
) = make_type_decl (get_identifier (name
), type
);
2180 TYPE_NAME (type
) = build_decl (TYPE_DECL
, get_identifier (name
), type
);
2182 TYPE_STUB_DECL (type
) = TYPE_NAME (type
);
2183 layout_decl (TYPE_NAME (type
), 0);
2186 /* Auxiliary functions to make type signatures for
2187 `operator new' and `operator delete' correspond to
2188 what compiler will be expecting. */
2191 coerce_new_type (type
)
2196 if (TREE_CODE (type
) == METHOD_TYPE
)
2197 type
= build_function_type (TREE_TYPE (type
), TREE_CHAIN (TYPE_ARG_TYPES (type
)));
2198 if (! same_type_p (TREE_TYPE (type
), ptr_type_node
))
2199 e1
= 1, error ("`operator new' must return type `void *'");
2201 /* Technically the type must be `size_t', but we may not know
2203 if (TYPE_ARG_TYPES (type
) == NULL_TREE
)
2204 e1
= 1, error ("`operator new' takes type `size_t' parameter");
2205 else if (! same_type_p (TREE_VALUE (TYPE_ARG_TYPES (type
)), sizetype
))
2206 e2
= 1, error ("`operator new' takes type `size_t' as first parameter");
2208 type
= build_function_type (ptr_type_node
, tree_cons (NULL_TREE
, sizetype
, TREE_CHAIN (TYPE_ARG_TYPES (type
))));
2210 type
= build_function_type (ptr_type_node
, TYPE_ARG_TYPES (type
));
2215 coerce_delete_type (type
)
2222 tree arg_types
= TYPE_ARG_TYPES (type
);
2224 if (TREE_CODE (type
) == METHOD_TYPE
)
2226 type
= build_function_type (TREE_TYPE (type
), TREE_CHAIN (arg_types
));
2227 arg_types
= TREE_CHAIN (arg_types
);
2230 if (TREE_TYPE (type
) != void_type_node
)
2231 e1
= 1, error ("`operator delete' must return type `void'");
2233 if (arg_types
== NULL_TREE
2234 || ! same_type_p (TREE_VALUE (arg_types
), ptr_type_node
))
2235 e2
= 1, error ("`operator delete' takes type `void *' as first parameter");
2239 && TREE_CHAIN (arg_types
)
2240 && TREE_CHAIN (arg_types
) != void_list_node
)
2242 /* Again, technically this argument must be `size_t', but again
2243 we may not know what that is. */
2244 tree t2
= TREE_VALUE (TREE_CHAIN (arg_types
));
2245 if (! same_type_p (t2
, sizetype
))
2246 e3
= 1, error ("second argument to `operator delete' must be of type `size_t'");
2247 else if (TREE_CHAIN (TREE_CHAIN (arg_types
)) != void_list_node
)
2250 if (TREE_CHAIN (TREE_CHAIN (arg_types
)))
2251 error ("too many arguments in declaration of `operator delete'");
2253 error ("`...' invalid in specification of `operator delete'");
2258 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
,
2259 build_tree_list (NULL_TREE
, sizetype
));
2262 if (arg_types
== NULL_TREE
)
2263 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, void_list_node
);
2265 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
, TREE_CHAIN (arg_types
));
2271 arg_types
= tree_cons (NULL_TREE
, ptr_type_node
,
2272 arg_types
? TREE_CHAIN (arg_types
): NULL_TREE
);
2274 type
= build_function_type (void_type_node
, arg_types
);
2280 mark_vtable_entries (decl
)
2283 tree entries
= CONSTRUCTOR_ELTS (DECL_INITIAL (decl
));
2285 for (; entries
; entries
= TREE_CHAIN (entries
))
2290 fnaddr
= (flag_vtable_thunks
? TREE_VALUE (entries
)
2291 : FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (entries
)));
2293 if (TREE_CODE (fnaddr
) == NOP_EXPR
)
2297 fn
= TREE_OPERAND (fnaddr
, 0);
2298 TREE_ADDRESSABLE (fn
) = 1;
2299 if (TREE_CODE (fn
) == THUNK_DECL
&& DECL_EXTERNAL (fn
))
2301 DECL_EXTERNAL (fn
) = 0;
2308 /* Set DECL up to have the closest approximation of "initialized common"
2309 linkage available. */
2312 comdat_linkage (decl
)
2316 make_decl_one_only (decl
);
2317 else if (TREE_CODE (decl
) == FUNCTION_DECL
|| DECL_VIRTUAL_P (decl
))
2318 /* We can just emit functions and vtables statically; it doesn't really
2319 matter if we have multiple copies. */
2320 TREE_PUBLIC (decl
) = 0;
2323 /* Static data member template instantiations, however, cannot
2324 have multiple copies. */
2325 if (DECL_INITIAL (decl
) == 0
2326 || DECL_INITIAL (decl
) == error_mark_node
)
2327 DECL_COMMON (decl
) = 1;
2328 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl
)))
2330 DECL_COMMON (decl
) = 1;
2331 DECL_INITIAL (decl
) = error_mark_node
;
2335 /* We can't do anything useful; leave vars for explicit
2337 DECL_EXTERNAL (decl
) = 1;
2338 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2342 if (DECL_LANG_SPECIFIC (decl
))
2343 DECL_COMDAT (decl
) = 1;
2345 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2346 DECL_DEFER_OUTPUT (decl
) = 1;
2349 /* For win32 we also want to put explicit instantiations in
2350 linkonce sections, so that they will be merged with implicit
2351 instantiations; otherwise we get duplicate symbol errors. */
2354 maybe_make_one_only (decl
)
2357 /* We used to say that this was not necessary on targets that support weak
2358 symbols, because the implicit instantiations will defer to the explicit
2359 one. However, that's not actually the case in SVR4; a strong definition
2360 after a weak one is an error. Also, not making explicit
2361 instantiations one_only means that we can end up with two copies of
2362 some template instantiations. */
2363 if (! supports_one_only ())
2366 /* We can't set DECL_COMDAT on functions, or finish_file will think
2367 we can get away with not emitting them if they aren't used. We need
2368 to for variables so that cp_finish_decl will update their linkage,
2369 because their DECL_INITIAL may not have been set properly yet. */
2371 make_decl_one_only (decl
);
2373 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_LANG_SPECIFIC (decl
))
2374 DECL_COMDAT (decl
) = 1;
2377 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
2378 based on TYPE and other static flags.
2380 Note that anything public is tagged TREE_PUBLIC, whether
2381 it's public in this file or in another one. */
2384 import_export_vtable (decl
, type
, final
)
2388 if (DECL_INTERFACE_KNOWN (decl
))
2391 if (TYPE_FOR_JAVA (type
))
2393 TREE_PUBLIC (decl
) = 1;
2394 DECL_EXTERNAL (decl
) = 1;
2395 DECL_INTERFACE_KNOWN (decl
) = 1;
2397 else if (CLASSTYPE_INTERFACE_KNOWN (type
))
2399 TREE_PUBLIC (decl
) = 1;
2400 DECL_EXTERNAL (decl
) = ! CLASSTYPE_VTABLE_NEEDS_WRITING (type
);
2401 DECL_INTERFACE_KNOWN (decl
) = 1;
2405 /* We can only wait to decide if we have real non-inline virtual
2406 functions in our class, or if we come from a template. */
2408 int found
= CLASSTYPE_TEMPLATE_INSTANTIATION (type
);
2410 if (! found
&& ! final
)
2413 for (method
= TYPE_METHODS (type
); method
!= NULL_TREE
;
2414 method
= TREE_CHAIN (method
))
2415 if (DECL_VINDEX (method
) != NULL_TREE
2416 && ! DECL_THIS_INLINE (method
)
2417 && ! DECL_ABSTRACT_VIRTUAL_P (method
))
2424 if (final
|| ! found
)
2426 comdat_linkage (decl
);
2427 DECL_EXTERNAL (decl
) = 0;
2431 TREE_PUBLIC (decl
) = 1;
2432 DECL_EXTERNAL (decl
) = 1;
2437 /* Determine whether or not we want to specifically import or export CTYPE,
2438 using various heuristics. */
2441 import_export_class (ctype
)
2444 /* -1 for imported, 1 for exported. */
2445 int import_export
= 0;
2447 if (CLASSTYPE_INTERFACE_KNOWN (ctype
))
2450 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
2451 we will have CLASSTYPE_INTERFACE_ONLY set but not
2452 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
2453 heuristic because someone will supply a #pragma implementation
2454 elsewhere, and deducing it here would produce a conflict. */
2455 if (CLASSTYPE_INTERFACE_ONLY (ctype
))
2458 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
2459 /* FIXME this should really use some sort of target-independent macro. */
2460 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype
)))
2461 /* Use -2 so we survive the MULTIPLE_SYMBOL_SPACES check below. */
2463 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype
)))
2467 /* If we got -fno-implicit-templates, we import template classes that
2468 weren't explicitly instantiated. */
2469 if (import_export
== 0
2470 && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype
)
2471 && ! flag_implicit_templates
)
2474 /* Base our import/export status on that of the first non-inline,
2475 non-abstract virtual function, if any. */
2476 if (import_export
== 0
2477 && TYPE_VIRTUAL_P (ctype
)
2478 && ! CLASSTYPE_TEMPLATE_INSTANTIATION (ctype
))
2481 for (method
= TYPE_METHODS (ctype
); method
!= NULL_TREE
;
2482 method
= TREE_CHAIN (method
))
2484 if (DECL_VINDEX (method
) != NULL_TREE
2485 && !DECL_THIS_INLINE (method
)
2486 && !DECL_ABSTRACT_VIRTUAL_P (method
))
2488 import_export
= (DECL_REALLY_EXTERN (method
) ? -1 : 1);
2494 #ifdef MULTIPLE_SYMBOL_SPACES
2495 if (import_export
== -1)
2501 SET_CLASSTYPE_INTERFACE_KNOWN (ctype
);
2502 CLASSTYPE_VTABLE_NEEDS_WRITING (ctype
) = (import_export
> 0);
2503 CLASSTYPE_INTERFACE_ONLY (ctype
) = (import_export
< 0);
2507 /* We need to describe to the assembler the relationship between
2508 a vtable and the vtable of the parent class. */
2511 output_vtable_inherit (vars
)
2517 op
[0] = XEXP (DECL_RTL (vars
), 0); /* strip the mem ref */
2519 parent
= binfo_for_vtable (vars
);
2521 if (parent
== TYPE_BINFO (DECL_CONTEXT (vars
)))
2525 parent
= TYPE_BINFO_VTABLE (BINFO_TYPE (parent
));
2526 op
[1] = XEXP (DECL_RTL (parent
), 0); /* strip the mem ref */
2529 my_friendly_abort (980826);
2531 output_asm_insn (".vtable_inherit %c0, %c1", op
);
2535 finish_vtable_vardecl (t
, data
)
2537 void *data ATTRIBUTE_UNUSED
;
2540 tree ctype
= DECL_CONTEXT (vars
);
2541 import_export_class (ctype
);
2542 import_export_vtable (vars
, ctype
, 1);
2544 if (! DECL_EXTERNAL (vars
)
2545 && (DECL_INTERFACE_KNOWN (vars
)
2546 || DECL_NEEDED_P (vars
)
2547 || (hack_decl_function_context (vars
) && TREE_USED (vars
)))
2548 && ! TREE_ASM_WRITTEN (vars
))
2551 mark_vtable_entries (vars
);
2552 if (TREE_TYPE (DECL_INITIAL (vars
)) == 0)
2553 store_init_value (vars
, DECL_INITIAL (vars
));
2555 if (write_symbols
== DWARF_DEBUG
|| write_symbols
== DWARF2_DEBUG
)
2557 /* Mark the VAR_DECL node representing the vtable itself as a
2558 "gratuitous" one, thereby forcing dwarfout.c to ignore it.
2559 It is rather important that such things be ignored because
2560 any effort to actually generate DWARF for them will run
2561 into trouble when/if we encounter code like:
2564 struct S { virtual void member (); };
2566 because the artificial declaration of the vtable itself (as
2567 manufactured by the g++ front end) will say that the vtable
2568 is a static member of `S' but only *after* the debug output
2569 for the definition of `S' has already been output. This causes
2570 grief because the DWARF entry for the definition of the vtable
2571 will try to refer back to an earlier *declaration* of the
2572 vtable as a static member of `S' and there won't be one.
2573 We might be able to arrange to have the "vtable static member"
2574 attached to the member list for `S' before the debug info for
2575 `S' get written (which would solve the problem) but that would
2576 require more intrusive changes to the g++ front end. */
2578 DECL_IGNORED_P (vars
) = 1;
2581 /* Always make vtables weak. */
2583 comdat_linkage (vars
);
2585 rest_of_decl_compilation (vars
, NULL_PTR
, 1, 1);
2588 output_vtable_inherit (vars
);
2590 /* Because we're only doing syntax-checking, we'll never end up
2591 actually marking the variable as written. */
2592 if (flag_syntax_only
)
2593 TREE_ASM_WRITTEN (vars
) = 1;
2595 /* Since we're writing out the vtable here, also write the debug
2597 if (TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (ctype
)))
2599 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (ctype
)) = 0;
2600 rest_of_type_compilation (ctype
, toplevel_bindings_p ());
2605 else if (!DECL_NEEDED_P (vars
))
2606 /* We don't know what to do with this one yet. */
2613 prune_vtable_vardecl (t
, data
)
2615 void *data ATTRIBUTE_UNUSED
;
2617 *t
= TREE_CHAIN (*t
);
2621 /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an
2622 inline function or template instantiation at end-of-file. */
2625 import_export_decl (decl
)
2628 if (DECL_INTERFACE_KNOWN (decl
))
2631 if (DECL_TEMPLATE_INSTANTIATION (decl
)
2632 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl
))
2634 DECL_NOT_REALLY_EXTERN (decl
) = 1;
2635 if ((DECL_IMPLICIT_INSTANTIATION (decl
)
2636 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl
))
2637 && (flag_implicit_templates
2638 || (flag_implicit_inline_templates
&& DECL_THIS_INLINE (decl
))))
2640 if (!TREE_PUBLIC (decl
))
2641 /* Templates are allowed to have internal linkage. See
2645 comdat_linkage (decl
);
2648 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2650 else if (DECL_FUNCTION_MEMBER_P (decl
))
2652 tree ctype
= DECL_CLASS_CONTEXT (decl
);
2653 import_export_class (ctype
);
2654 if (CLASSTYPE_INTERFACE_KNOWN (ctype
)
2656 ? (! DECL_THIS_INLINE (decl
))
2657 : (! DECL_ARTIFICIAL (decl
) || DECL_VINDEX (decl
))))
2659 DECL_NOT_REALLY_EXTERN (decl
)
2660 = ! (CLASSTYPE_INTERFACE_ONLY (ctype
)
2661 || (DECL_THIS_INLINE (decl
) && ! flag_implement_inlines
2662 && !DECL_VINDEX (decl
)));
2664 /* Always make artificials weak. */
2665 if (DECL_ARTIFICIAL (decl
) && flag_weak
)
2666 comdat_linkage (decl
);
2668 maybe_make_one_only (decl
);
2671 comdat_linkage (decl
);
2673 else if (DECL_TINFO_FN_P (decl
))
2675 tree ctype
= TREE_TYPE (DECL_NAME (decl
));
2677 if (IS_AGGR_TYPE (ctype
))
2678 import_export_class (ctype
);
2680 if (IS_AGGR_TYPE (ctype
) && CLASSTYPE_INTERFACE_KNOWN (ctype
)
2681 && TYPE_VIRTUAL_P (ctype
)
2682 /* If -fno-rtti, we're not necessarily emitting this stuff with
2683 the class, so go ahead and emit it now. This can happen
2684 when a class is used in exception handling. */
2686 /* If the type is a cv-qualified variant of a type, then we
2687 must emit the tinfo function in this translation unit
2688 since it will not be emitted when the vtable for the type
2689 is output (which is when the unqualified version is
2691 && same_type_p (ctype
, TYPE_MAIN_VARIANT (ctype
)))
2693 DECL_NOT_REALLY_EXTERN (decl
)
2694 = ! (CLASSTYPE_INTERFACE_ONLY (ctype
)
2695 || (DECL_THIS_INLINE (decl
) && ! flag_implement_inlines
2696 && !DECL_VINDEX (decl
)));
2698 /* Always make artificials weak. */
2700 comdat_linkage (decl
);
2702 else if (TYPE_BUILT_IN (ctype
)
2703 && same_type_p (ctype
, TYPE_MAIN_VARIANT (ctype
)))
2704 DECL_NOT_REALLY_EXTERN (decl
) = 0;
2706 comdat_linkage (decl
);
2709 comdat_linkage (decl
);
2711 DECL_INTERFACE_KNOWN (decl
) = 1;
2715 build_cleanup (decl
)
2719 tree type
= TREE_TYPE (decl
);
2721 if (TREE_CODE (type
) == ARRAY_TYPE
)
2725 mark_addressable (decl
);
2726 temp
= build1 (ADDR_EXPR
, build_pointer_type (type
), decl
);
2728 temp
= build_delete (TREE_TYPE (temp
), temp
,
2730 LOOKUP_NORMAL
|LOOKUP_NONVIRTUAL
|LOOKUP_DESTRUCTOR
, 0);
2734 extern int parse_time
, varconst_time
;
2740 tree sname
= get_id_2 ("__sn", base
);
2741 /* For struct X foo __attribute__((weak)), there is a counter
2742 __snfoo. Since base is already an assembler name, sname should
2743 be globally unique */
2744 tree sentry
= IDENTIFIER_GLOBAL_VALUE (sname
);
2747 sentry
= build_decl (VAR_DECL
, sname
, integer_type_node
);
2748 TREE_PUBLIC (sentry
) = 1;
2749 DECL_ARTIFICIAL (sentry
) = 1;
2750 TREE_STATIC (sentry
) = 1;
2751 TREE_USED (sentry
) = 1;
2752 DECL_COMMON (sentry
) = 1;
2753 pushdecl_top_level (sentry
);
2754 cp_finish_decl (sentry
, NULL_TREE
, NULL_TREE
, 0);
2759 /* Start the process of running a particular set of global constructors
2760 or destructors. Subroutine of do_[cd]tors. */
2763 start_objects (method_type
, initp
)
2764 int method_type
, initp
;
2770 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
2772 if (initp
!= DEFAULT_INIT_PRIORITY
)
2782 sprintf (type
, "%c%c%.5u", method_type
, joiner
, initp
);
2785 sprintf (type
, "%c", method_type
);
2787 fnname
= get_file_function_name_long (type
);
2789 start_function (void_list_node
,
2790 make_call_declarator (fnname
, void_list_node
, NULL_TREE
,
2792 NULL_TREE
, SF_DEFAULT
);
2794 #if defined(ASM_OUTPUT_CONSTRUCTOR) && defined(ASM_OUTPUT_DESTRUCTOR)
2795 /* It can be a static function as long as collect2 does not have
2796 to scan the object file to find its ctor/dtor routine. */
2797 TREE_PUBLIC (current_function_decl
) = 0;
2800 /* Mark this declaration as used to avoid spurious warnings. */
2801 TREE_USED (current_function_decl
) = 1;
2803 /* Mark this function as a global constructor or destructor. */
2804 if (method_type
== 'I')
2805 DECL_GLOBAL_CTOR_P (current_function_decl
) = 1;
2807 DECL_GLOBAL_DTOR_P (current_function_decl
) = 1;
2808 GLOBAL_INIT_PRIORITY (current_function_decl
) = initp
;
2810 body
= begin_compound_stmt (/*has_no_scope=*/0);
2812 /* We cannot allow these functions to be elided, even if they do not
2813 have external linkage. And, there's no point in deferring
2814 copmilation of thes functions; they're all going to have to be
2816 current_function_cannot_inline
2817 = "static constructors and destructors cannot be inlined";
2822 /* Finish the process of running a particular set of global constructors
2823 or destructors. Subroutine of do_[cd]tors. */
2826 finish_objects (method_type
, initp
, body
)
2827 int method_type
, initp
;
2834 finish_compound_stmt(/*has_no_scope=*/0, body
);
2835 fn
= finish_function (lineno
, 0);
2838 /* When only doing semantic analysis, and no RTL generation, we
2839 can't call functions that directly emit assembly code; there is
2840 no assembly file in which to put the code. */
2841 if (flag_syntax_only
)
2844 fnname
= XSTR (XEXP (DECL_RTL (fn
), 0), 0);
2845 if (initp
== DEFAULT_INIT_PRIORITY
)
2847 if (method_type
== 'I')
2848 assemble_constructor (fnname
);
2850 assemble_destructor (fnname
);
2852 #if defined (ASM_OUTPUT_SECTION_NAME) && defined (ASM_OUTPUT_CONSTRUCTOR)
2853 /* If we're using init priority we can't use assemble_*tor, but on ELF
2854 targets we can stick the references into named sections for GNU ld
2859 sprintf (buf
, ".%ctors.%.5u", method_type
== 'I' ? 'c' : 'd',
2860 /* invert the numbering so the linker puts us in the proper
2861 order; constructors are run from right to left, and the
2862 linker sorts in increasing order. */
2863 MAX_INIT_PRIORITY
- initp
);
2864 named_section (NULL_TREE
, buf
, 0);
2865 assemble_integer (gen_rtx_SYMBOL_REF (Pmode
, fnname
),
2866 POINTER_SIZE
/ BITS_PER_UNIT
, 1);
2871 /* The names of the parameters to the function created to handle
2872 initializations and destructions for objects with static storage
2874 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
2875 #define PRIORITY_IDENTIFIER "__priority"
2877 /* The name of the function we create to handle initializations and
2878 destructions for objects with static storage duration. */
2879 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
2881 /* The declaration for the __INITIALIZE_P argument. */
2882 static tree initialize_p_decl
;
2884 /* The declaration for the __PRIORITY argument. */
2885 static tree priority_decl
;
2887 /* The declaration for the static storage duration function. */
2888 static tree ssdf_decl
;
2890 /* All the static storage duration functions created in this
2891 translation unit. */
2892 static varray_type ssdf_decls
;
2894 /* A map from priority levels to information about that priority
2895 level. There may be many such levels, so efficient lookup is
2897 static splay_tree priority_info_map
;
2899 /* Begins the generation of the function that will handle all
2900 initialization and destruction of objects with static storage
2901 duration. The function generated takes two parameters of type
2902 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
2903 non-zero, it performs initializations. Otherwise, it performs
2904 destructions. It only performs those initializations or
2905 destructions with the indicated __PRIORITY. The generated function
2908 It is assumed that this function will only be called once per
2909 translation unit. */
2912 start_static_storage_duration_function ()
2914 static unsigned ssdf_number
;
2919 char id
[sizeof (SSDF_IDENTIFIER
) + 1 /* '\0' */ + 32];
2921 /* Create the identifier for this function. It will be of the form
2922 SSDF_IDENTIFIER_<number>. */
2923 sprintf (id
, "%s_%u", SSDF_IDENTIFIER
, ssdf_number
++);
2924 if (ssdf_number
== 0)
2926 /* Overflow occurred. That means there are at least 4 billion
2927 initialization functions. */
2928 sorry ("too many initialization functions required");
2929 my_friendly_abort (19990430);
2932 /* Create the parameters. */
2933 parm_types
= void_list_node
;
2934 parm_types
= tree_cons (NULL_TREE
, integer_type_node
, parm_types
);
2935 parm_types
= tree_cons (NULL_TREE
, integer_type_node
, parm_types
);
2936 type
= build_function_type (void_type_node
, parm_types
);
2938 /* Create the FUNCTION_DECL itself. */
2939 ssdf_decl
= build_lang_decl (FUNCTION_DECL
,
2940 get_identifier (id
),
2942 TREE_PUBLIC (ssdf_decl
) = 0;
2943 DECL_ARTIFICIAL (ssdf_decl
) = 1;
2945 /* Put this function in the list of functions to be called from the
2946 static constructors and destructors. */
2949 VARRAY_TREE_INIT (ssdf_decls
, 32, "ssdf_decls");
2951 /* Take this opportunity to initialize the map from priority
2952 numbers to information about that priority level. */
2953 priority_info_map
= splay_tree_new (splay_tree_compare_ints
,
2954 /*delete_key_fn=*/0,
2955 /*delete_value_fn=*/
2956 (splay_tree_delete_value_fn
) &free
);
2958 /* We always need to generate functions for the
2959 DEFAULT_INIT_PRIORITY so enter it now. That way when we walk
2960 priorities later, we'll be sure to find the
2961 DEFAULT_INIT_PRIORITY. */
2962 get_priority_info (DEFAULT_INIT_PRIORITY
);
2965 VARRAY_PUSH_TREE (ssdf_decls
, ssdf_decl
);
2967 /* Create the argument list. */
2968 initialize_p_decl
= build_decl (PARM_DECL
,
2969 get_identifier (INITIALIZE_P_IDENTIFIER
),
2971 DECL_CONTEXT (initialize_p_decl
) = ssdf_decl
;
2972 DECL_ARG_TYPE (initialize_p_decl
) = integer_type_node
;
2973 TREE_USED (initialize_p_decl
) = 1;
2974 priority_decl
= build_decl (PARM_DECL
, get_identifier (PRIORITY_IDENTIFIER
),
2976 DECL_CONTEXT (priority_decl
) = ssdf_decl
;
2977 DECL_ARG_TYPE (priority_decl
) = integer_type_node
;
2978 TREE_USED (priority_decl
) = 1;
2980 TREE_CHAIN (initialize_p_decl
) = priority_decl
;
2981 DECL_ARGUMENTS (ssdf_decl
) = initialize_p_decl
;
2983 /* Put the function in the global scope. */
2984 pushdecl (ssdf_decl
);
2986 /* Start the function itself. This is equivalent to declarating the
2989 static void __ssdf (int __initialize_p, init __priority_p);
2991 It is static because we only need to call this function from the
2992 various constructor and destructor functions for this module. */
2993 start_function (/*specs=*/NULL_TREE
,
2995 /*attrs=*/NULL_TREE
,
2998 /* Set up the scope of the outermost block in the function. */
2999 body
= begin_compound_stmt (/*has_no_scope=*/0);
3001 /* This function must not be deferred because we are depending on
3002 its compilation to tell us what is TREE_SYMBOL_REFERENCED. */
3003 current_function_cannot_inline
3004 = "static storage duration functions cannot be inlined";
3009 /* Finish the generation of the function which performs initialization
3010 and destruction of objects with static storage duration. After
3011 this point, no more such objects can be created. */
3014 finish_static_storage_duration_function (body
)
3017 /* Close out the function. */
3018 finish_compound_stmt (/*has_no_scope=*/0, body
);
3019 expand_body (finish_function (lineno
, 0));
3022 /* Return the information about the indicated PRIORITY level. If no
3023 code to handle this level has yet been generated, generate the
3024 appropriate prologue. */
3026 static priority_info
3027 get_priority_info (priority
)
3033 n
= splay_tree_lookup (priority_info_map
,
3034 (splay_tree_key
) priority
);
3037 /* Create a new priority information structure, and insert it
3039 pi
= (priority_info
) xmalloc (sizeof (struct priority_info_s
));
3040 pi
->initializations_p
= 0;
3041 pi
->destructions_p
= 0;
3042 splay_tree_insert (priority_info_map
,
3043 (splay_tree_key
) priority
,
3044 (splay_tree_value
) pi
);
3047 pi
= (priority_info
) n
->value
;
3052 /* Set up to handle the initialization or destruction of DECL. If
3053 INITP is non-zero, we are initializing the variable. Otherwise, we
3054 are destroying it. */
3057 start_static_initialization_or_destruction (decl
, initp
)
3061 tree sentry_if_stmt
= NULL_TREE
;
3067 /* Figure out the priority for this declaration. */
3068 priority
= DECL_INIT_PRIORITY (decl
);
3070 priority
= DEFAULT_INIT_PRIORITY
;
3072 /* Remember that we had an initialization or finalization at this
3074 pi
= get_priority_info (priority
);
3076 pi
->initializations_p
= 1;
3078 pi
->destructions_p
= 1;
3080 /* Trick the compiler into thinking we are at the file and line
3081 where DECL was declared so that error-messages make sense, and so
3082 that the debugger will show somewhat sensible file and line
3084 input_filename
= DECL_SOURCE_FILE (decl
);
3085 lineno
= DECL_SOURCE_LINE (decl
);
3091 Access control for implicit calls to the constructors,
3092 the conversion functions, or the destructor called to
3093 create and destroy a static data member is performed as
3094 if these calls appeared in the scope of the member's
3097 we pretend we are in a static member function of the class of
3098 which the DECL is a member. */
3099 if (member_p (decl
))
3101 DECL_CLASS_CONTEXT (current_function_decl
) = DECL_CONTEXT (decl
);
3102 DECL_STATIC_FUNCTION_P (current_function_decl
) = 1;
3105 /* Conditionalize this initialization on being in the right priority
3106 and being initializing/finalizing appropriately. */
3107 sentry_if_stmt
= begin_if_stmt ();
3108 cond
= build_binary_op (EQ_EXPR
,
3110 build_int_2 (priority
, 0));
3111 init_cond
= initp
? integer_one_node
: integer_zero_node
;
3112 init_cond
= build_binary_op (EQ_EXPR
,
3115 cond
= build_binary_op (TRUTH_ANDIF_EXPR
, cond
, init_cond
);
3117 /* We need a sentry if this is an object with external linkage that
3118 might be initialized in more than one place. */
3119 if (TREE_PUBLIC (decl
) && (DECL_COMMON (decl
)
3120 || DECL_ONE_ONLY (decl
)
3121 || DECL_WEAK (decl
)))
3126 sentry
= get_sentry (DECL_ASSEMBLER_NAME (decl
));
3128 /* We do initializations only if the SENTRY is zero, i.e., if we
3129 are the first to initialize the variable. We do destructions
3130 only if the SENTRY is one, i.e., if we are the last to
3131 destroy the variable. */
3133 sentry_cond
= build_binary_op (EQ_EXPR
,
3134 build_unary_op (PREINCREMENT_EXPR
,
3139 sentry_cond
= build_binary_op (EQ_EXPR
,
3140 build_unary_op (PREDECREMENT_EXPR
,
3145 cond
= build_binary_op (TRUTH_ANDIF_EXPR
, cond
, sentry_cond
);
3148 finish_if_stmt_cond (cond
, sentry_if_stmt
);
3150 return sentry_if_stmt
;
3153 /* We've just finished generating code to do an initialization or
3154 finalization. SENTRY_IF_STMT is the if-statement we used to guard
3155 the initialization. */
3158 finish_static_initialization_or_destruction (sentry_if_stmt
)
3159 tree sentry_if_stmt
;
3161 finish_then_clause (sentry_if_stmt
);
3164 /* Now that we're done with DECL we don't need to pretend to be a
3165 member of its class any longer. */
3166 DECL_CLASS_CONTEXT (current_function_decl
) = NULL_TREE
;
3167 DECL_STATIC_FUNCTION_P (current_function_decl
) = 0;
3170 /* Generate code to do the static initialization of DECL. The
3171 initialization is INIT. If DECL may be initialized more than once
3172 in different object files, SENTRY is the guard variable to
3173 check. PRIORITY is the priority for the initialization. */
3176 do_static_initialization (decl
, init
)
3181 tree sentry_if_stmt
;
3183 /* Set up for the initialization. */
3185 = start_static_initialization_or_destruction (decl
,
3188 /* Do the initialization itself. */
3189 if (IS_AGGR_TYPE (TREE_TYPE (decl
))
3190 || TREE_CODE (TREE_TYPE (decl
)) == ARRAY_TYPE
)
3191 expr
= build_aggr_init (decl
, init
, 0);
3192 else if (TREE_CODE (init
) == TREE_VEC
)
3193 expr
= build_vec_init (decl
, TREE_VEC_ELT (init
, 0),
3194 TREE_VEC_ELT (init
, 1),
3195 TREE_VEC_ELT (init
, 2), 0);
3198 expr
= build (INIT_EXPR
, TREE_TYPE (decl
), decl
, init
);
3199 TREE_SIDE_EFFECTS (expr
) = 1;
3201 finish_expr_stmt (expr
);
3204 finish_static_initialization_or_destruction (sentry_if_stmt
);
3207 /* Generate code to do the static destruction of DECL. If DECL may be
3208 initialized more than once in different object files, SENTRY is the
3209 guard variable to check. PRIORITY is the priority for the
3213 do_static_destruction (decl
)
3216 tree sentry_if_stmt
;
3218 /* If we don't need a destructor, there's nothing to do. */
3219 if (!TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl
)))
3222 /* Actually do the destruction. */
3223 sentry_if_stmt
= start_static_initialization_or_destruction (decl
,
3225 finish_expr_stmt (build_cleanup (decl
));
3226 finish_static_initialization_or_destruction (sentry_if_stmt
);
3229 /* VARS is a list of variables with static storage duration which may
3230 need initialization and/or finalization. Remove those variables
3231 that don't really need to be initialized or finalized, and return
3232 the resulting list. The order in which the variables appear in
3233 VARS is in reverse order of the order in which they should actually
3234 be initialized. The list we return is in the unreversed order;
3235 i.e., the first variable should be initialized first. */
3238 prune_vars_needing_no_initialization (vars
)
3244 for (var
= vars
, result
= NULL_TREE
;
3246 var
= TREE_CHAIN (var
))
3248 tree decl
= TREE_VALUE (var
);
3249 tree init
= TREE_PURPOSE (var
);
3251 /* Deal gracefully with error. */
3252 if (decl
== error_mark_node
)
3255 /* The only things that can be initialized are variables. */
3256 my_friendly_assert (TREE_CODE (decl
) == VAR_DECL
, 19990420);
3258 /* If this object is not defined, we don't need to do anything
3260 if (DECL_EXTERNAL (decl
))
3263 /* Also, if the initializer already contains errors, we can bail
3265 if (init
&& TREE_CODE (init
) == TREE_LIST
3266 && value_member (error_mark_node
, init
))
3269 /* This variable is going to need initialization and/or
3270 finalization, so we add it to the list. */
3271 result
= tree_cons (init
, decl
, result
);
3277 /* Make sure we have told the back end about all the variables in
3281 write_out_vars (vars
)
3286 for (v
= vars
; v
; v
= TREE_CHAIN (v
))
3287 if (! TREE_ASM_WRITTEN (TREE_VALUE (v
)))
3288 rest_of_decl_compilation (TREE_VALUE (v
), 0, 1, 1);
3291 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
3292 (otherwise) that will initialize all gobal objects with static
3293 storage duration having the indicated PRIORITY. */
3296 generate_ctor_or_dtor_function (constructor_p
, priority
)
3305 /* We use `I' to indicate initialization and `D' to indicate
3312 /* Begin the function. */
3313 body
= start_objects (function_key
, priority
);
3315 /* Call the static storage duration function with appropriate
3317 for (i
= 0; i
< ssdf_decls
->elements_used
; ++i
)
3319 arguments
= tree_cons (NULL_TREE
, build_int_2 (priority
, 0),
3321 arguments
= tree_cons (NULL_TREE
, build_int_2 (constructor_p
, 0),
3323 finish_expr_stmt (build_function_call (VARRAY_TREE (ssdf_decls
, i
),
3327 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
3328 calls to any functions marked with attributes indicating that
3329 they should be called at initialization- or destruction-time. */
3330 if (priority
== DEFAULT_INIT_PRIORITY
)
3334 for (fns
= constructor_p
? static_ctors
: static_dtors
;
3336 fns
= TREE_CHAIN (fns
))
3337 finish_expr_stmt (build_function_call (TREE_VALUE (fns
), NULL_TREE
));
3340 /* Close out the function. */
3341 finish_objects (function_key
, priority
, body
);
3344 /* Generate constructor and destructor functions for the priority
3348 generate_ctor_and_dtor_functions_for_priority (n
, data
)
3350 void *data ATTRIBUTE_UNUSED
;
3352 int priority
= (int) n
->key
;
3353 priority_info pi
= (priority_info
) n
->value
;
3355 /* Generate the functions themselves, but only if they are really
3357 if (pi
->initializations_p
3358 || (priority
== DEFAULT_INIT_PRIORITY
&& static_ctors
))
3359 generate_ctor_or_dtor_function (/*constructor_p=*/1,
3361 if (pi
->destructions_p
3362 || (priority
== DEFAULT_INIT_PRIORITY
&& static_dtors
))
3363 generate_ctor_or_dtor_function (/*constructor_p=*/0,
3366 /* Keep iterating. */
3370 /* This routine is called from the last rule in yyparse ().
3371 Its job is to create all the code needed to initialize and
3372 destroy the global aggregates. We do the destruction
3373 first, since that way we only need to reverse the decls once. */
3379 int start_time
, this_time
;
3386 /* Bad parse errors. Just forget about it. */
3387 if (! global_bindings_p () || current_class_type
|| decl_namespace_list
)
3390 start_time
= get_run_time ();
3392 /* Otherwise, GDB can get confused, because in only knows
3393 about source for LINENO-1 lines. */
3396 interface_unknown
= 1;
3399 /* We now have to write out all the stuff we put off writing out.
3402 o Template specializations that we have not yet instantiated,
3403 but which are needed.
3404 o Initialization and destruction for non-local objects with
3405 static storage duration. (Local objects with static storage
3406 duration are initialized when their scope is first entered,
3407 and are cleaned up via atexit.)
3408 o Virtual function tables.
3410 All of these may cause others to be needed. For example,
3411 instantiating one function may cause another to be needed, and
3412 generating the intiailzer for an object may cause templates to be
3413 instantiated, etc., etc. */
3415 this_time
= get_run_time ();
3416 parse_time
-= this_time
- start_time
;
3417 varconst_time
+= this_time
- start_time
;
3418 start_time
= get_run_time ();
3424 /* If there are templates that we've put off instantiating, do
3426 instantiate_pending_templates ();
3428 /* Write out virtual tables as required. Note that writing out
3429 the virtual table for a template class may cause the
3430 instantiation of members of that class. */
3431 if (walk_globals (vtable_decl_p
,
3432 finish_vtable_vardecl
,
3436 /* The list of objects with static storage duration is built up
3437 in reverse order. We clear STATIC_AGGREGATES so that any new
3438 aggregates added during the initialization of these will be
3439 initialized in the correct order when we next come around the
3441 vars
= prune_vars_needing_no_initialization (static_aggregates
);
3442 static_aggregates
= NULL_TREE
;
3448 /* We need to start a new initialization function each time
3449 through the loop. That's because we need to know which
3450 vtables have been referenced, and TREE_SYMBOL_REFERENCED
3451 isn't computed until a function is finished, and written
3452 out. That's a deficiency in the back-end. When this is
3453 fixed, these initialization functions could all become
3454 inline, with resulting performance improvements. */
3455 tree ssdf_body
= start_static_storage_duration_function ();
3457 /* Make sure the back end knows about all the variables. */
3458 write_out_vars (vars
);
3460 /* First generate code to do all the initializations. */
3461 for (v
= vars
; v
; v
= TREE_CHAIN (v
))
3462 do_static_initialization (TREE_VALUE (v
),
3465 /* Then, generate code to do all the destructions. Do these
3466 in reverse order so that the most recently constructed
3467 variable is the first destroyed. */
3468 vars
= nreverse (vars
);
3469 for (v
= vars
; v
; v
= TREE_CHAIN (v
))
3470 do_static_destruction (TREE_VALUE (v
));
3472 /* Finish up the static storage duration function for this
3474 finish_static_storage_duration_function (ssdf_body
);
3476 /* All those initializations and finalizations might cause
3477 us to need more inline functions, more template
3478 instantiations, etc. */
3482 /* Go through the various inline functions, and see if any need
3484 for (i
= 0; i
< saved_inlines_used
; ++i
)
3486 tree decl
= VARRAY_TREE (saved_inlines
, i
);
3487 import_export_decl (decl
);
3488 if (DECL_ARTIFICIAL (decl
) && ! DECL_INITIAL (decl
)
3490 && (! DECL_REALLY_EXTERN (decl
) || DECL_INLINE (decl
)))
3492 /* Even though we're already at the top-level, we push
3493 there again. That way, when we pop back a few lines
3494 hence, all of our state is restored. Otherwise,
3495 finish_function doesn't clean things up, and we end
3496 up with CURRENT_FUNCTION_DECL set. */
3497 push_to_top_level ();
3498 if (DECL_TINFO_FN_P (decl
))
3499 synthesize_tinfo_fn (decl
);
3501 synthesize_method (decl
);
3502 pop_from_top_level ();
3507 /* Mark all functions that might deal with exception-handling as
3509 mark_all_runtime_matches ();
3511 /* We lie to the back-end, pretending that some functions are
3512 not defined when they really are. This keeps these functions
3513 from being put out unncessarily. But, we must stop lying
3514 when the functions are referenced, or if they are not comdat
3515 since they need to be put out now. */
3516 for (i
= 0; i
< saved_inlines_used
; ++i
)
3518 tree decl
= VARRAY_TREE (saved_inlines
, i
);
3520 if (DECL_NOT_REALLY_EXTERN (decl
)
3521 && DECL_INITIAL (decl
)
3522 && (DECL_NEEDED_P (decl
) || !DECL_COMDAT (decl
)))
3523 DECL_EXTERNAL (decl
) = 0;
3525 /* If we're going to need to write this function out, and
3526 there's already a body for it, create RTL for it now.
3527 (There might be no body if this is a method we haven't
3528 gotten around to synthesizing yet.) */
3529 if (!DECL_EXTERNAL (decl
)
3530 && (DECL_NEEDED_P (decl
) || !DECL_COMDAT (decl
))
3531 && DECL_SAVED_TREE (decl
)
3532 && !DECL_SAVED_INSNS (decl
)
3533 && !TREE_ASM_WRITTEN (decl
))
3535 int saved_not_really_extern
;
3537 /* When we call finish_function in expand_body, it will
3538 try to reset DECL_NOT_REALLY_EXTERN so we save and
3540 saved_not_really_extern
= DECL_NOT_REALLY_EXTERN (decl
);
3541 /* Generate RTL for this function now that we know we
3544 /* Undo the damage done by finish_function. */
3545 DECL_EXTERNAL (decl
) = 0;
3546 DECL_NOT_REALLY_EXTERN (decl
) = saved_not_really_extern
;
3547 /* If we're compiling -fsyntax-only pretend that this
3548 function has been written out so that we don't try to
3550 if (flag_syntax_only
)
3551 TREE_ASM_WRITTEN (decl
) = 1;
3556 if (saved_inlines_used
3557 && wrapup_global_declarations (&VARRAY_TREE (saved_inlines
, 0),
3558 saved_inlines_used
))
3560 if (walk_namespaces (wrapup_globals_for_namespace
, /*data=*/0))
3563 /* Static data members are just like namespace-scope globals. */
3564 for (i
= 0; i
< pending_statics_used
; ++i
)
3566 tree decl
= VARRAY_TREE (pending_statics
, i
);
3567 if (TREE_ASM_WRITTEN (decl
))
3569 import_export_decl (decl
);
3570 if (DECL_NOT_REALLY_EXTERN (decl
) && ! DECL_IN_AGGR_P (decl
))
3571 DECL_EXTERNAL (decl
) = 0;
3574 && wrapup_global_declarations (&VARRAY_TREE (pending_statics
, 0),
3575 pending_statics_used
))
3580 /* We give C linkage to static constructors and destructors. */
3581 push_lang_context (lang_name_c
);
3583 /* Generate initialization and destruction functions for all
3584 priorities for which they are required. */
3585 if (priority_info_map
)
3586 splay_tree_foreach (priority_info_map
,
3587 generate_ctor_and_dtor_functions_for_priority
,
3590 /* We're done with the splay-tree now. */
3591 if (priority_info_map
)
3592 splay_tree_delete (priority_info_map
);
3594 /* We're done with static constructors, so we can go back to "C++"
3596 pop_lang_context ();
3598 /* Now delete from the chain of variables all virtual function tables.
3599 We output them all ourselves, because each will be treated
3600 specially. We don't do this if we're just doing semantic
3601 analysis, and not code-generation. */
3602 if (!flag_syntax_only
)
3603 walk_globals (vtable_decl_p
, prune_vtable_vardecl
, /*data=*/0);
3605 /* Now, issue warnings about static, but not defined, functions,
3606 etc., and emit debugging information. */
3607 walk_namespaces (wrapup_globals_for_namespace
, /*data=*/&reconsider
);
3608 if (pending_statics
)
3609 check_global_declarations (&VARRAY_TREE (pending_statics
, 0),
3610 pending_statics_used
);
3614 /* The entire file is now complete. If requested, dump everything
3616 if (flag_dump_translation_unit
)
3617 dump_node_to_file (global_namespace
, flag_dump_translation_unit
);
3619 /* If there's some tool that wants to examine the entire translation
3620 unit, let it do so now. */
3622 (*back_end_hook
) (global_namespace
);
3624 this_time
= get_run_time ();
3625 parse_time
-= this_time
- start_time
;
3626 varconst_time
+= this_time
- start_time
;
3628 if (flag_detailed_statistics
)
3630 dump_tree_statistics ();
3631 dump_time_statistics ();
3635 /* This is something of the form 'A()()()()()+1' that has turned out to be an
3636 expr. Since it was parsed like a type, we need to wade through and fix
3637 that. Unfortunately, since operator() is left-associative, we can't use
3638 tail recursion. In the above example, TYPE is `A', and DECL is
3641 Maybe this shouldn't be recursive, but how often will it actually be
3645 reparse_absdcl_as_expr (type
, decl
)
3648 /* do build_functional_cast (type, NULL_TREE) at bottom */
3649 if (TREE_OPERAND (decl
, 0) == NULL_TREE
)
3650 return build_functional_cast (type
, NULL_TREE
);
3653 decl
= reparse_absdcl_as_expr (type
, TREE_OPERAND (decl
, 0));
3655 decl
= build_x_function_call (decl
, NULL_TREE
, current_class_ref
);
3657 if (TREE_CODE (decl
) == CALL_EXPR
3658 && (! TREE_TYPE (decl
)
3659 || TREE_CODE (TREE_TYPE (decl
)) != VOID_TYPE
))
3660 decl
= require_complete_type (decl
);
3665 /* This is something of the form `int ((int)(int)(int)1)' that has turned
3666 out to be an expr. Since it was parsed like a type, we need to wade
3667 through and fix that. Since casts are right-associative, we are
3668 reversing the order, so we don't have to recurse.
3670 In the above example, DECL is the `(int)(int)(int)', and EXPR is the
3674 reparse_absdcl_as_casts (decl
, expr
)
3679 if (TREE_CODE (expr
) == CONSTRUCTOR
3680 && TREE_TYPE (expr
) == 0)
3682 type
= groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl
)));
3683 decl
= TREE_OPERAND (decl
, 0);
3685 expr
= digest_init (type
, expr
, (tree
*) 0);
3686 if (TREE_CODE (type
) == ARRAY_TYPE
&& TYPE_SIZE (type
) == 0)
3688 int failure
= complete_array_type (type
, expr
, 1);
3690 my_friendly_abort (78);
3696 type
= groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl
)));
3697 decl
= TREE_OPERAND (decl
, 0);
3698 expr
= build_c_cast (type
, expr
);
3701 if (warn_old_style_cast
&& ! in_system_header
3702 && current_lang_name
!= lang_name_c
)
3703 warning ("use of old-style cast");
3708 /* Given plain tree nodes for an expression, build up the full semantics. */
3711 build_expr_from_tree (t
)
3714 if (t
== NULL_TREE
|| t
== error_mark_node
)
3717 switch (TREE_CODE (t
))
3719 case IDENTIFIER_NODE
:
3720 return do_identifier (t
, 0, NULL_TREE
);
3723 if (LOOKUP_EXPR_GLOBAL (t
))
3724 return do_scoped_id (TREE_OPERAND (t
, 0), 0);
3726 return do_identifier (TREE_OPERAND (t
, 0), 0, NULL_TREE
);
3728 case TEMPLATE_ID_EXPR
:
3729 return (lookup_template_function
3730 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3731 build_expr_from_tree (TREE_OPERAND (t
, 1))));
3734 return build_x_indirect_ref
3735 (build_expr_from_tree (TREE_OPERAND (t
, 0)), "unary *");
3738 return build_functional_cast
3739 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3741 case REINTERPRET_CAST_EXPR
:
3742 return build_reinterpret_cast
3743 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3745 case CONST_CAST_EXPR
:
3746 return build_const_cast
3747 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3749 case DYNAMIC_CAST_EXPR
:
3750 return build_dynamic_cast
3751 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3753 case STATIC_CAST_EXPR
:
3754 return build_static_cast
3755 (TREE_TYPE (t
), build_expr_from_tree (TREE_OPERAND (t
, 0)));
3757 case PREDECREMENT_EXPR
:
3758 case PREINCREMENT_EXPR
:
3759 case POSTDECREMENT_EXPR
:
3760 case POSTINCREMENT_EXPR
:
3764 case TRUTH_NOT_EXPR
:
3766 case CONVERT_EXPR
: /* Unary + */
3771 return build_x_unary_op (TREE_CODE (t
),
3772 build_expr_from_tree (TREE_OPERAND (t
, 0)));
3777 case TRUNC_DIV_EXPR
:
3779 case FLOOR_DIV_EXPR
:
3780 case ROUND_DIV_EXPR
:
3781 case EXACT_DIV_EXPR
:
3783 case BIT_ANDTC_EXPR
:
3786 case TRUNC_MOD_EXPR
:
3787 case FLOOR_MOD_EXPR
:
3788 case TRUTH_ANDIF_EXPR
:
3789 case TRUTH_ORIF_EXPR
:
3790 case TRUTH_AND_EXPR
:
3805 return build_x_binary_op
3807 build_expr_from_tree (TREE_OPERAND (t
, 0)),
3808 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3811 return build_m_component_ref
3812 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3813 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3816 return build_offset_ref (TREE_OPERAND (t
, 0), TREE_OPERAND (t
, 1));
3819 if (TREE_OPERAND (t
, 0) == NULL_TREE
)
3821 return build_parse_node (ARRAY_REF
, NULL_TREE
,
3822 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3823 return grok_array_decl (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3824 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3829 tree r
= build_expr_from_tree (TREE_OPERAND (t
, 0));
3830 if (TREE_CODE_CLASS (TREE_CODE (r
)) != 't')
3832 return TREE_CODE (t
) == SIZEOF_EXPR
? c_sizeof (r
) : c_alignof (r
);
3836 return build_x_modify_expr
3837 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3838 TREE_CODE (TREE_OPERAND (t
, 1)),
3839 build_expr_from_tree (TREE_OPERAND (t
, 2)));
3842 return build_x_arrow
3843 (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3847 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3848 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3849 build_expr_from_tree (TREE_OPERAND (t
, 2)),
3850 NEW_EXPR_USE_GLOBAL (t
));
3853 return delete_sanity
3854 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3855 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3856 DELETE_EXPR_USE_VEC (t
), DELETE_EXPR_USE_GLOBAL (t
));
3859 if (TREE_OPERAND (t
, 1) == NULL_TREE
)
3860 return build_x_compound_expr
3861 (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3863 my_friendly_abort (42);
3865 case METHOD_CALL_EXPR
:
3866 if (TREE_CODE (TREE_OPERAND (t
, 0)) == SCOPE_REF
)
3868 tree ref
= TREE_OPERAND (t
, 0);
3869 return build_scoped_method_call
3870 (build_expr_from_tree (TREE_OPERAND (t
, 1)),
3871 build_expr_from_tree (TREE_OPERAND (ref
, 0)),
3872 TREE_OPERAND (ref
, 1),
3873 build_expr_from_tree (TREE_OPERAND (t
, 2)));
3877 tree fn
= TREE_OPERAND (t
, 0);
3879 /* We can get a TEMPLATE_ID_EXPR here on code like:
3883 so we must resolve that. However, we can also get things
3884 like a BIT_NOT_EXPR here, when referring to a destructor,
3885 and things like that are not correctly resolved by
3886 build_expr_from_tree. So, just use build_expr_from_tree
3887 when we really need it. */
3888 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
3889 fn
= lookup_template_function
3890 (TREE_OPERAND (fn
, 0),
3891 build_expr_from_tree (TREE_OPERAND (fn
, 1)));
3893 return build_method_call
3894 (build_expr_from_tree (TREE_OPERAND (t
, 1)),
3896 build_expr_from_tree (TREE_OPERAND (t
, 2)),
3897 NULL_TREE
, LOOKUP_NORMAL
);
3901 if (TREE_CODE (TREE_OPERAND (t
, 0)) == SCOPE_REF
)
3903 tree ref
= TREE_OPERAND (t
, 0);
3904 return build_member_call
3905 (build_expr_from_tree (TREE_OPERAND (ref
, 0)),
3906 TREE_OPERAND (ref
, 1),
3907 build_expr_from_tree (TREE_OPERAND (t
, 1)));
3911 tree name
= TREE_OPERAND (t
, 0);
3913 tree args
= build_expr_from_tree (TREE_OPERAND (t
, 1));
3914 if (args
!= NULL_TREE
&& TREE_CODE (name
) == LOOKUP_EXPR
3915 && !LOOKUP_EXPR_GLOBAL (name
)
3916 && TREE_CODE ((id
= TREE_OPERAND (name
, 0))) == IDENTIFIER_NODE
3917 && (!current_class_type
3918 || !lookup_member (current_class_type
, id
, 0, 0)))
3920 /* Do Koenig lookup if there are no class members. */
3921 name
= do_identifier (id
, 0, args
);
3923 else if (TREE_CODE (name
) == TEMPLATE_ID_EXPR
3924 || ! really_overloaded_fn (name
))
3925 name
= build_expr_from_tree (name
);
3926 return build_x_function_call (name
, args
, current_class_ref
);
3930 return build_x_conditional_expr
3931 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3932 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3933 build_expr_from_tree (TREE_OPERAND (t
, 2)));
3935 case PSEUDO_DTOR_EXPR
:
3936 return (finish_pseudo_destructor_call_expr
3937 (build_expr_from_tree (TREE_OPERAND (t
, 0)),
3938 build_expr_from_tree (TREE_OPERAND (t
, 1)),
3939 build_expr_from_tree (TREE_OPERAND (t
, 2))));
3943 tree purpose
, value
, chain
;
3945 if (t
== void_list_node
)
3948 purpose
= TREE_PURPOSE (t
);
3950 purpose
= build_expr_from_tree (purpose
);
3951 value
= TREE_VALUE (t
);
3953 value
= build_expr_from_tree (value
);
3954 chain
= TREE_CHAIN (t
);
3955 if (chain
&& chain
!= void_type_node
)
3956 chain
= build_expr_from_tree (chain
);
3957 return tree_cons (purpose
, value
, chain
);
3962 tree object
= build_expr_from_tree (TREE_OPERAND (t
, 0));
3963 tree field
= TREE_OPERAND (t
, 1);
3965 /* We use a COMPONENT_REF to indicate things of the form `x.b'
3966 and `x.A::b'. We must distinguish between those cases
3968 if (TREE_CODE (field
) == SCOPE_REF
)
3969 return build_object_ref (object
,
3970 TREE_OPERAND (field
, 0),
3971 TREE_OPERAND (field
, 1));
3973 return build_x_component_ref (object
, field
,
3978 return build_throw (build_expr_from_tree (TREE_OPERAND (t
, 0)));
3984 /* digest_init will do the wrong thing if we let it. */
3985 if (TREE_TYPE (t
) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t
)))
3988 r
= build_nt (CONSTRUCTOR
, NULL_TREE
,
3989 build_expr_from_tree (CONSTRUCTOR_ELTS (t
)));
3990 TREE_HAS_CONSTRUCTOR (r
) = TREE_HAS_CONSTRUCTOR (t
);
3993 return digest_init (TREE_TYPE (t
), r
, 0);
3998 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (t
, 0))) == 't')
3999 return get_typeid (TREE_OPERAND (t
, 0));
4000 return build_x_typeid (build_expr_from_tree (TREE_OPERAND (t
, 0)));
4003 return convert_from_reference (t
);
4006 return build_va_arg (build_expr_from_tree (TREE_OPERAND (t
, 0)),
4014 /* This is something of the form `int (*a)++' that has turned out to be an
4015 expr. It was only converted into parse nodes, so we need to go through
4016 and build up the semantics. Most of the work is done by
4017 build_expr_from_tree, above.
4019 In the above example, TYPE is `int' and DECL is `*a'. */
4022 reparse_decl_as_expr (type
, decl
)
4025 decl
= build_expr_from_tree (decl
);
4027 return build_functional_cast (type
, build_expr_list (NULL_TREE
, decl
));
4032 /* This is something of the form `int (*a)' that has turned out to be a
4033 decl. It was only converted into parse nodes, so we need to do the
4034 checking that make_{pointer,reference}_declarator do. */
4037 finish_decl_parsing (decl
)
4040 extern int current_class_depth
;
4042 switch (TREE_CODE (decl
))
4044 case IDENTIFIER_NODE
:
4047 return make_pointer_declarator
4048 (NULL_TREE
, finish_decl_parsing (TREE_OPERAND (decl
, 0)));
4050 return make_reference_declarator
4051 (NULL_TREE
, finish_decl_parsing (TREE_OPERAND (decl
, 0)));
4053 TREE_OPERAND (decl
, 0) = finish_decl_parsing (TREE_OPERAND (decl
, 0));
4056 push_nested_class (TREE_TYPE (TREE_OPERAND (decl
, 0)), 3);
4057 TREE_COMPLEXITY (decl
) = current_class_depth
;
4060 TREE_OPERAND (decl
, 0) = finish_decl_parsing (TREE_OPERAND (decl
, 0));
4063 /* For attribute handling. */
4064 TREE_VALUE (decl
) = finish_decl_parsing (TREE_VALUE (decl
));
4067 my_friendly_abort (5);
4073 check_cp_case_value (value
)
4076 if (value
== NULL_TREE
)
4079 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4080 STRIP_TYPE_NOPS (value
);
4082 if (TREE_READONLY_DECL_P (value
))
4084 value
= decl_constant_value (value
);
4085 STRIP_TYPE_NOPS (value
);
4087 value
= fold (value
);
4089 if (TREE_CODE (value
) != INTEGER_CST
4090 && value
!= error_mark_node
)
4092 cp_error ("case label `%E' does not reduce to an integer constant",
4094 value
= error_mark_node
;
4097 /* Promote char or short to int. */
4098 value
= default_conversion (value
);
4100 constant_expression_warning (value
);
4105 /* Return 1 if root encloses child. */
4108 is_namespace_ancestor (root
, child
)
4113 if (root
== global_namespace
)
4115 if (child
== global_namespace
)
4117 return is_namespace_ancestor (root
, CP_DECL_CONTEXT (child
));
4121 /* Return the namespace that is the common ancestor
4122 of two given namespaces. */
4125 namespace_ancestor (ns1
, ns2
)
4128 if (is_namespace_ancestor (ns1
, ns2
))
4130 return namespace_ancestor (CP_DECL_CONTEXT (ns1
), ns2
);
4133 /* Insert used into the using list of user. Set indirect_flag if this
4134 directive is not directly from the source. Also find the common
4135 ancestor and let our users know about the new namespace */
4137 add_using_namespace (user
, used
, indirect
)
4143 /* Using oneself is a no-op. */
4146 my_friendly_assert (TREE_CODE (user
) == NAMESPACE_DECL
, 380);
4147 my_friendly_assert (TREE_CODE (used
) == NAMESPACE_DECL
, 380);
4148 /* Check if we already have this. */
4149 t
= purpose_member (used
, DECL_NAMESPACE_USING (user
));
4153 /* Promote to direct usage. */
4154 TREE_INDIRECT_USING (t
) = 0;
4158 /* Add used to the user's using list. */
4159 DECL_NAMESPACE_USING (user
)
4160 = tree_cons (used
, namespace_ancestor (user
, used
),
4161 DECL_NAMESPACE_USING (user
));
4163 TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user
)) = indirect
;
4165 /* Add user to the used's users list. */
4166 DECL_NAMESPACE_USERS (used
)
4167 = tree_cons (user
, 0, DECL_NAMESPACE_USERS (used
));
4169 /* Recursively add all namespaces used. */
4170 for (t
= DECL_NAMESPACE_USING (used
); t
; t
= TREE_CHAIN (t
))
4171 /* indirect usage */
4172 add_using_namespace (user
, TREE_PURPOSE (t
), 1);
4174 /* Tell everyone using us about the new used namespaces. */
4175 for (t
= DECL_NAMESPACE_USERS (user
); t
; t
= TREE_CHAIN (t
))
4176 add_using_namespace (TREE_PURPOSE (t
), used
, 1);
4179 /* Combines two sets of overloaded functions into an OVERLOAD chain, removing
4180 duplicates. The first list becomes the tail of the result.
4182 The algorithm is O(n^2). We could get this down to O(n log n) by
4183 doing a sort on the addresses of the functions, if that becomes
4187 merge_functions (s1
, s2
)
4191 for (; s2
; s2
= OVL_NEXT (s2
))
4193 tree fn
= OVL_CURRENT (s2
);
4194 if (! ovl_member (fn
, s1
))
4195 s1
= build_overload (fn
, s1
);
4200 /* This should return an error not all definitions define functions.
4201 It is not an error if we find two functions with exactly the
4202 same signature, only if these are selected in overload resolution.
4203 old is the current set of bindings, new the freshly-found binding.
4204 XXX Do we want to give *all* candidates in case of ambiguity?
4205 XXX In what way should I treat extern declarations?
4206 XXX I don't want to repeat the entire duplicate_decls here */
4209 ambiguous_decl (name
, old
, new, flags
)
4216 my_friendly_assert (old
!= NULL_TREE
, 393);
4217 /* Copy the value. */
4218 val
= BINDING_VALUE (new);
4220 switch (TREE_CODE (val
))
4223 /* If we expect types or namespaces, and not templates,
4224 or this is not a template class. */
4225 if (LOOKUP_QUALIFIERS_ONLY (flags
)
4226 && !DECL_CLASS_TEMPLATE_P (val
))
4230 if (LOOKUP_NAMESPACES_ONLY (flags
))
4233 case NAMESPACE_DECL
:
4234 if (LOOKUP_TYPES_ONLY (flags
))
4238 if (LOOKUP_QUALIFIERS_ONLY (flags
))
4242 if (!BINDING_VALUE (old
))
4243 BINDING_VALUE (old
) = val
;
4244 else if (val
&& val
!= BINDING_VALUE (old
))
4246 if (is_overloaded_fn (BINDING_VALUE (old
))
4247 && is_overloaded_fn (val
))
4249 BINDING_VALUE (old
) = merge_functions (BINDING_VALUE (old
),
4254 /* Some declarations are functions, some are not. */
4255 if (flags
& LOOKUP_COMPLAIN
)
4257 /* If we've already given this error for this lookup,
4258 BINDING_VALUE (old) is error_mark_node, so let's not
4259 repeat ourselves. */
4260 if (BINDING_VALUE (old
) != error_mark_node
)
4262 cp_error ("use of `%D' is ambiguous", name
);
4263 cp_error_at (" first declared as `%#D' here",
4264 BINDING_VALUE (old
));
4266 cp_error_at (" also declared as `%#D' here", val
);
4268 BINDING_VALUE (old
) = error_mark_node
;
4271 /* ... and copy the type. */
4272 type
= BINDING_TYPE (new);
4273 if (LOOKUP_NAMESPACES_ONLY (flags
))
4275 if (!BINDING_TYPE (old
))
4276 BINDING_TYPE (old
) = type
;
4277 else if (type
&& BINDING_TYPE (old
) != type
)
4279 if (flags
& LOOKUP_COMPLAIN
)
4281 cp_error ("`%D' denotes an ambiguous type",name
);
4282 cp_error_at (" first type here", BINDING_TYPE (old
));
4283 cp_error_at (" other type here", type
);
4289 /* Subroutine of unualified_namespace_lookup:
4290 Add the bindings of NAME in used namespaces to VAL.
4291 We are currently looking for names in namespace SCOPE, so we
4292 look through USINGS for using-directives of namespaces
4293 which have SCOPE as a common ancestor with the current scope.
4294 Returns zero on errors. */
4297 lookup_using_namespace (name
, val
, usings
, scope
, flags
, spacesp
)
4298 tree name
, val
, usings
, scope
;
4304 /* Iterate over all used namespaces in current, searching for using
4305 directives of scope. */
4306 for (iter
= usings
; iter
; iter
= TREE_CHAIN (iter
))
4307 if (TREE_VALUE (iter
) == scope
)
4310 *spacesp
= tree_cons (TREE_PURPOSE (iter
), NULL_TREE
,
4312 val1
= binding_for_name (name
, TREE_PURPOSE (iter
));
4313 /* Resolve ambiguities. */
4314 val
= ambiguous_decl (name
, val
, val1
, flags
);
4316 return BINDING_VALUE (val
) != error_mark_node
;
4320 Accepts the NAME to lookup and its qualifying SCOPE.
4321 Returns the name/type pair found into the CPLUS_BINDING RESULT,
4325 qualified_lookup_using_namespace (name
, scope
, result
, flags
)
4331 /* Maintain a list of namespaces visited... */
4332 tree seen
= NULL_TREE
;
4333 /* ... and a list of namespace yet to see. */
4334 tree todo
= NULL_TREE
;
4336 while (scope
&& (result
!= error_mark_node
))
4338 seen
= temp_tree_cons (scope
, NULL_TREE
, seen
);
4339 result
= ambiguous_decl (name
, result
,
4340 binding_for_name (name
, scope
), flags
);
4341 if (!BINDING_VALUE (result
) && !BINDING_TYPE (result
))
4342 /* Consider using directives. */
4343 for (usings
= DECL_NAMESPACE_USING (scope
); usings
;
4344 usings
= TREE_CHAIN (usings
))
4345 /* If this was a real directive, and we have not seen it. */
4346 if (!TREE_INDIRECT_USING (usings
)
4347 && !purpose_member (TREE_PURPOSE (usings
), seen
))
4348 todo
= temp_tree_cons (TREE_PURPOSE (usings
), NULL_TREE
, todo
);
4351 scope
= TREE_PURPOSE (todo
);
4352 todo
= TREE_CHAIN (todo
);
4355 scope
= NULL_TREE
; /* If there never was a todo list. */
4357 return result
!= error_mark_node
;
4360 /* [namespace.memdef]/2 */
4362 /* Set the context of a declaration to scope. Complain if we are not
4366 set_decl_namespace (decl
, scope
, friendp
)
4372 if (scope
== std_node
)
4373 scope
= global_namespace
;
4374 /* Get rid of namespace aliases. */
4375 scope
= ORIGINAL_NAMESPACE (scope
);
4377 /* It is ok for friends to be qualified in parallel space. */
4378 if (!friendp
&& !is_namespace_ancestor (current_namespace
, scope
))
4379 cp_error ("declaration of `%D' not in a namespace surrounding `%D'",
4381 DECL_CONTEXT (decl
) = FROB_CONTEXT (scope
);
4382 if (scope
!= current_namespace
)
4384 /* See whether this has been declared in the namespace. */
4385 old
= namespace_binding (DECL_NAME (decl
), scope
);
4387 /* No old declaration at all. */
4389 if (!is_overloaded_fn (decl
))
4390 /* Don't compare non-function decls with decls_match here,
4391 since it can't check for the correct constness at this
4392 point. pushdecl will find those errors later. */
4394 /* Since decl is a function, old should contain a function decl. */
4395 if (!is_overloaded_fn (old
))
4397 if (processing_template_decl
|| processing_specialization
)
4398 /* We have not yet called push_template_decl to turn the
4399 FUNCTION_DECL into a TEMPLATE_DECL, so the declarations
4400 won't match. But, we'll check later, when we construct the
4403 for (; old
; old
= OVL_NEXT (old
))
4404 if (decls_match (decl
, OVL_CURRENT (old
)))
4410 cp_error ("`%D' should have been declared inside `%D'",
4414 /* Compute the namespace where a declaration is defined. */
4417 decl_namespace (decl
)
4420 while (DECL_CONTEXT (decl
))
4422 decl
= DECL_CONTEXT (decl
);
4423 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
4425 if (TREE_CODE_CLASS (TREE_CODE (decl
)) == 't')
4426 decl
= TYPE_STUB_DECL (decl
);
4427 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl
)) == 'd', 390);
4430 return global_namespace
;
4433 /* Return the namespace where the current declaration is declared. */
4436 current_decl_namespace ()
4439 /* If we have been pushed into a different namespace, use it. */
4440 if (decl_namespace_list
)
4441 return TREE_PURPOSE (decl_namespace_list
);
4443 if (current_class_type
)
4444 result
= decl_namespace (TYPE_STUB_DECL (current_class_type
));
4445 else if (current_function_decl
)
4446 result
= decl_namespace (current_function_decl
);
4448 result
= current_namespace
;
4452 /* Temporarily set the namespace for the current declaration. */
4455 push_decl_namespace (decl
)
4458 if (TREE_CODE (decl
) != NAMESPACE_DECL
)
4459 decl
= decl_namespace (decl
);
4460 decl_namespace_list
= tree_cons (decl
, NULL_TREE
, decl_namespace_list
);
4464 pop_decl_namespace ()
4466 decl_namespace_list
= TREE_CHAIN (decl_namespace_list
);
4469 /* Enter a class or namespace scope. */
4475 if (TREE_CODE (t
) == NAMESPACE_DECL
)
4476 push_decl_namespace (t
);
4481 /* Leave scope pushed by push_scope. */
4487 if (TREE_CODE (t
) == NAMESPACE_DECL
)
4488 pop_decl_namespace ();
4493 /* [basic.lookup.koenig] */
4494 /* A non-zero return value in the functions below indicates an error.
4495 All nodes allocated in the procedure are on the scratch obstack. */
4505 static int arg_assoc
PROTO((struct arg_lookup
*, tree
));
4506 static int arg_assoc_args
PROTO((struct arg_lookup
*, tree
));
4507 static int arg_assoc_type
PROTO((struct arg_lookup
*, tree
));
4508 static int add_function
PROTO((struct arg_lookup
*, tree
));
4509 static int arg_assoc_namespace
PROTO((struct arg_lookup
*, tree
));
4510 static int arg_assoc_class
PROTO((struct arg_lookup
*, tree
));
4511 static int arg_assoc_template_arg
PROTO((struct arg_lookup
*, tree
));
4513 /* Add a function to the lookup structure.
4514 Returns 1 on error. */
4517 add_function (k
, fn
)
4518 struct arg_lookup
*k
;
4521 /* We used to check here to see if the function was already in the list,
4522 but that's O(n^2), which is just too expensive for function lookup.
4523 Now we deal with the occasional duplicate in joust. In doing this, we
4524 assume that the number of duplicates will be small compared to the
4525 total number of functions being compared, which should usually be the
4528 /* We must find only functions, or exactly one non-function. */
4529 if (k
->functions
&& is_overloaded_fn (k
->functions
)
4530 && is_overloaded_fn (fn
))
4531 k
->functions
= build_overload (fn
, k
->functions
);
4532 else if (k
->functions
)
4534 tree f1
= OVL_CURRENT (k
->functions
);
4536 if (is_overloaded_fn (f1
))
4538 fn
= f1
; f1
= f2
; f2
= fn
;
4540 cp_error_at ("`%D' is not a function,", f1
);
4541 cp_error_at (" conflict with `%D'", f2
);
4542 cp_error (" in call to `%D'", k
->name
);
4550 /* Add functions of a namespace to the lookup structure.
4551 Returns 1 on error. */
4554 arg_assoc_namespace (k
, scope
)
4555 struct arg_lookup
*k
;
4560 if (purpose_member (scope
, k
->namespaces
))
4562 k
->namespaces
= tree_cons (scope
, NULL_TREE
, k
->namespaces
);
4564 value
= namespace_binding (k
->name
, scope
);
4568 for (; value
; value
= OVL_NEXT (value
))
4569 if (add_function (k
, OVL_CURRENT (value
)))
4575 /* Adds everything associated with a template argument to the lookup
4576 structure. Returns 1 on error. */
4579 arg_assoc_template_arg (k
, arg
)
4580 struct arg_lookup
* k
;
4583 /* [basic.lookup.koenig]
4585 If T is a template-id, its associated namespaces and classes are
4586 ... the namespaces and classes associated with the types of the
4587 template arguments provided for template type parameters
4588 (excluding template template parameters); the namespaces in which
4589 any template template arguments are defined; and the classes in
4590 which any member templates used as template template arguments
4591 are defined. [Note: non-type template arguments do not
4592 contribute to the set of associated namespaces. ] */
4594 /* Consider first template template arguments. */
4595 if (TREE_CODE (arg
) == TEMPLATE_DECL
)
4597 tree ctx
= CP_DECL_CONTEXT (arg
);
4599 /* It's not a member template. */
4600 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
4601 return arg_assoc_namespace (k
, ctx
);
4602 /* Otherwise, it must be member template. */
4604 return arg_assoc_class (k
, ctx
);
4606 /* It's not a template template argument, but it is a type template
4608 else if (TREE_CODE_CLASS (TREE_CODE (arg
)) == 't')
4609 return arg_assoc_type (k
, arg
);
4610 /* It's a non-type template argument. */
4615 /* Adds everything associated with class to the lookup structure.
4616 Returns 1 on error. */
4619 arg_assoc_class (k
, type
)
4620 struct arg_lookup
* k
;
4623 tree list
, friends
, context
;
4626 /* Backend build structures, such as __builtin_va_list, aren't
4627 affected by all this. */
4628 if (!CLASS_TYPE_P (type
))
4631 if (purpose_member (type
, k
->classes
))
4633 k
->classes
= tree_cons (type
, NULL_TREE
, k
->classes
);
4635 context
= decl_namespace (TYPE_MAIN_DECL (type
));
4636 if (arg_assoc_namespace (k
, context
))
4639 /* Process baseclasses. */
4640 for (i
= 0; i
< CLASSTYPE_N_BASECLASSES (type
); i
++)
4641 if (arg_assoc_class (k
, TYPE_BINFO_BASETYPE (type
, i
)))
4644 /* Process friends. */
4645 for (list
= DECL_FRIENDLIST (TYPE_MAIN_DECL (type
)); list
;
4646 list
= TREE_CHAIN (list
))
4647 if (k
->name
== TREE_PURPOSE (list
))
4648 for (friends
= TREE_VALUE (list
); friends
;
4649 friends
= TREE_CHAIN (friends
))
4650 /* Only interested in global functions with potentially hidden
4651 (i.e. unqualified) declarations. */
4652 if (TREE_PURPOSE (list
) == error_mark_node
&& TREE_VALUE (list
)
4653 && decl_namespace (TREE_VALUE (list
)) == context
)
4654 if (add_function (k
, TREE_VALUE (list
)))
4657 /* Process template arguments. */
4658 if (CLASSTYPE_TEMPLATE_INFO (type
))
4660 list
= innermost_args (CLASSTYPE_TI_ARGS (type
));
4661 for (i
= 0; i
< TREE_VEC_LENGTH (list
); ++i
)
4662 arg_assoc_template_arg (k
, TREE_VEC_ELT (list
, i
));
4668 /* Adds everything associated with a given type.
4669 Returns 1 on error. */
4672 arg_assoc_type (k
, type
)
4673 struct arg_lookup
*k
;
4676 switch (TREE_CODE (type
))
4686 if (TYPE_PTRMEMFUNC_P (type
))
4687 return arg_assoc_type (k
, TYPE_PTRMEMFUNC_FN_TYPE (type
));
4688 return arg_assoc_class (k
, type
);
4690 case REFERENCE_TYPE
:
4692 return arg_assoc_type (k
, TREE_TYPE (type
));
4695 return arg_assoc_namespace (k
, decl_namespace (TYPE_MAIN_DECL (type
)));
4697 /* Pointer to member: associate class type and value type. */
4698 if (arg_assoc_type (k
, TYPE_OFFSET_BASETYPE (type
)))
4700 return arg_assoc_type (k
, TREE_TYPE (type
));
4702 /* The basetype is referenced in the first arg type, so just
4705 /* Associate the parameter types. */
4706 if (arg_assoc_args (k
, TYPE_ARG_TYPES (type
)))
4708 /* Associate the return type. */
4709 return arg_assoc_type (k
, TREE_TYPE (type
));
4710 case TEMPLATE_TYPE_PARM
:
4711 case TEMPLATE_TEMPLATE_PARM
:
4714 if (type
== unknown_type_node
)
4716 /* else fall through */
4718 my_friendly_abort (390);
4723 /* Adds everything associated with arguments. Returns 1 on error. */
4726 arg_assoc_args (k
, args
)
4727 struct arg_lookup
* k
;
4730 for (; args
; args
= TREE_CHAIN (args
))
4731 if (arg_assoc (k
, TREE_VALUE (args
)))
4736 /* Adds everything associated with a given tree_node. Returns 1 on error. */
4740 struct arg_lookup
* k
;
4743 if (n
== error_mark_node
)
4746 if (TREE_CODE_CLASS (TREE_CODE (n
)) == 't')
4747 return arg_assoc_type (k
, n
);
4749 if (! type_unknown_p (n
))
4750 return arg_assoc_type (k
, TREE_TYPE (n
));
4752 if (TREE_CODE (n
) == ADDR_EXPR
)
4753 n
= TREE_OPERAND (n
, 0);
4754 if (TREE_CODE (n
) == COMPONENT_REF
)
4755 n
= TREE_OPERAND (n
, 1);
4756 if (TREE_CODE (n
) == OFFSET_REF
)
4757 n
= TREE_OPERAND (n
, 1);
4758 while (TREE_CODE (n
) == TREE_LIST
)
4761 if (TREE_CODE (n
) == FUNCTION_DECL
)
4762 return arg_assoc_type (k
, TREE_TYPE (n
));
4763 if (TREE_CODE (n
) == TEMPLATE_ID_EXPR
)
4765 /* [basic.lookup.koenig]
4767 If T is a template-id, its associated namespaces and classes
4768 are the namespace in which the template is defined; for
4769 member templates, the member template's class... */
4770 tree
template = TREE_OPERAND (n
, 0);
4771 tree args
= TREE_OPERAND (n
, 1);
4775 /* First, the template. There may actually be more than one if
4776 this is an overloaded function template. But, in that case,
4777 we only need the first; all the functions will be in the same
4779 template = OVL_CURRENT (template);
4781 ctx
= CP_DECL_CONTEXT (template);
4783 if (TREE_CODE (ctx
) == NAMESPACE_DECL
)
4785 if (arg_assoc_namespace (k
, ctx
) == 1)
4788 /* It must be a member template. */
4789 else if (arg_assoc_class (k
, ctx
) == 1)
4792 /* Now the arguments. */
4793 for (arg
= args
; arg
!= NULL_TREE
; arg
= TREE_CHAIN (arg
))
4794 if (arg_assoc_template_arg (k
, TREE_VALUE (arg
)) == 1)
4799 my_friendly_assert (TREE_CODE (n
) == OVERLOAD
, 980715);
4801 for (; n
; n
= OVL_CHAIN (n
))
4802 if (arg_assoc_type (k
, TREE_TYPE (OVL_FUNCTION (n
))))
4809 /* Performs Koenig lookup depending on arguments, where fns
4810 are the functions found in normal lookup. */
4813 lookup_arg_dependent (name
, fns
, args
)
4818 struct arg_lookup k
;
4822 k
.classes
= NULL_TREE
;
4824 /* Note that we've already looked at some namespaces during normal
4825 unqualified lookup, unless we found a decl in function scope. */
4826 if (fns
&& DECL_LOCAL_FUNCTION_P (OVL_CURRENT (fns
)))
4827 k
.namespaces
= NULL_TREE
;
4829 unqualified_namespace_lookup (name
, 0, &k
.namespaces
);
4831 arg_assoc_args (&k
, args
);
4835 /* Process a namespace-alias declaration. */
4838 do_namespace_alias (alias
, namespace)
4839 tree alias
, namespace;
4841 if (TREE_CODE (namespace) != NAMESPACE_DECL
)
4843 /* The parser did not find it, so it's not there. */
4844 cp_error ("unknown namespace `%D'", namespace);
4848 namespace = ORIGINAL_NAMESPACE (namespace);
4850 /* Build the alias. */
4851 alias
= build_lang_decl (NAMESPACE_DECL
, alias
, void_type_node
);
4852 DECL_NAMESPACE_ALIAS (alias
) = namespace;
4856 /* Check a non-member using-declaration. Return the name and scope
4857 being used, and the USING_DECL, or NULL_TREE on failure. */
4860 validate_nonmember_using_decl (decl
, scope
, name
)
4865 if (TREE_CODE (decl
) == SCOPE_REF
4866 && TREE_OPERAND (decl
, 0) == std_node
)
4868 if (namespace_bindings_p ()
4869 && current_namespace
== global_namespace
)
4870 /* There's no need for a using declaration at all, here,
4871 since `std' is the same as `::'. We can't just pass this
4872 on because we'll complain later about declaring something
4873 in the same scope as a using declaration with the same
4874 name. We return NULL_TREE which indicates to the caller
4875 that there's no need to do any further processing. */
4878 *scope
= global_namespace
;
4879 *name
= TREE_OPERAND (decl
, 1);
4881 else if (TREE_CODE (decl
) == SCOPE_REF
)
4883 *scope
= TREE_OPERAND (decl
, 0);
4884 *name
= TREE_OPERAND (decl
, 1);
4886 /* [namespace.udecl]
4888 A using-declaration for a class member shall be a
4889 member-declaration. */
4890 if (TREE_CODE (*scope
) != NAMESPACE_DECL
)
4892 if (TYPE_P (*scope
))
4893 cp_error ("`%T' is not a namespace", *scope
);
4895 cp_error ("`%D' is not a namespace", *scope
);
4899 else if (TREE_CODE (decl
) == IDENTIFIER_NODE
4900 || TREE_CODE (decl
) == TYPE_DECL
4901 || TREE_CODE (decl
) == TEMPLATE_DECL
)
4903 *scope
= global_namespace
;
4907 my_friendly_abort (382);
4908 if (TREE_CODE_CLASS (TREE_CODE (*name
)) == 'd')
4909 *name
= DECL_NAME (*name
);
4910 /* Make a USING_DECL. */
4911 return push_using_decl (*scope
, *name
);
4914 /* Process local and global using-declarations. */
4917 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, newval
, newtype
)
4919 tree oldval
, oldtype
;
4920 tree
*newval
, *newtype
;
4924 *newval
= *newtype
= NULL_TREE
;
4925 decls
= make_node (CPLUS_BINDING
);
4926 if (!qualified_lookup_using_namespace (name
, scope
, decls
, 0))
4930 if (!BINDING_VALUE (decls
) && !BINDING_TYPE (decls
))
4932 cp_error ("`%D' not declared", name
);
4936 /* Check for using functions. */
4937 if (BINDING_VALUE (decls
) && is_overloaded_fn (BINDING_VALUE (decls
)))
4941 if (oldval
&& !is_overloaded_fn (oldval
))
4943 duplicate_decls (OVL_CURRENT (BINDING_VALUE (decls
)), oldval
);
4948 for (tmp
= BINDING_VALUE (decls
); tmp
; tmp
= OVL_NEXT (tmp
))
4950 tree new_fn
= OVL_CURRENT (tmp
);
4952 /* [namespace.udecl]
4954 If a function declaration in namespace scope or block
4955 scope has the same name and the same parameter types as a
4956 function introduced by a using declaration the program is
4958 for (tmp1
= oldval
; tmp1
; tmp1
= OVL_NEXT (tmp1
))
4960 tree old_fn
= OVL_CURRENT (tmp1
);
4962 if (!OVL_USED (tmp1
)
4963 && compparms (TYPE_ARG_TYPES (TREE_TYPE (new_fn
)),
4964 TYPE_ARG_TYPES (TREE_TYPE (old_fn
))))
4966 /* There was already a non-using declaration in
4967 this scope with the same parameter types. */
4968 cp_error ("`%D' is already declared in this scope",
4972 else if (duplicate_decls (new_fn
, old_fn
))
4973 /* We're re-using something we already used
4974 before. We don't need to add it again. */
4978 /* If we broke out of the loop, there's no reason to add
4979 this function to the using declarations for this
4984 *newval
= build_overload (OVL_CURRENT (tmp
), *newval
);
4985 if (TREE_CODE (*newval
) != OVERLOAD
)
4986 *newval
= ovl_cons (*newval
, NULL_TREE
);
4987 OVL_USED (*newval
) = 1;
4992 *newval
= BINDING_VALUE (decls
);
4994 duplicate_decls (*newval
, oldval
);
4997 *newtype
= BINDING_TYPE (decls
);
4998 if (oldtype
&& *newtype
&& oldtype
!= *newtype
)
5000 cp_error ("using directive `%D' introduced ambiguous type `%T'",
5006 /* Process a using-declaration not appearing in class or local scope. */
5009 do_toplevel_using_decl (decl
)
5012 tree scope
, name
, binding
;
5013 tree oldval
, oldtype
, newval
, newtype
;
5015 decl
= validate_nonmember_using_decl (decl
, &scope
, &name
);
5016 if (decl
== NULL_TREE
)
5019 binding
= binding_for_name (name
, current_namespace
);
5021 oldval
= BINDING_VALUE (binding
);
5022 oldtype
= BINDING_TYPE (binding
);
5024 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
5026 /* Copy declarations found. */
5028 BINDING_VALUE (binding
) = newval
;
5030 BINDING_TYPE (binding
) = newtype
;
5034 /* Process a using-declaration at function scope. */
5037 do_local_using_decl (decl
)
5041 tree oldval
, oldtype
, newval
, newtype
;
5043 decl
= validate_nonmember_using_decl (decl
, &scope
, &name
);
5044 if (decl
== NULL_TREE
)
5047 oldval
= lookup_name_current_level (name
);
5048 oldtype
= lookup_type_current_level (name
);
5050 do_nonmember_using_decl (scope
, name
, oldval
, oldtype
, &newval
, &newtype
);
5054 if (is_overloaded_fn (newval
))
5058 /* We only need to push declarations for those functions
5059 that were not already bound in the current level.
5060 The old value might be NULL_TREE, it might be a single
5061 function, or an OVERLOAD. */
5062 if (oldval
&& TREE_CODE (oldval
) == OVERLOAD
)
5063 term
= OVL_FUNCTION (oldval
);
5066 for (fn
= newval
; fn
&& OVL_CURRENT (fn
) != term
;
5068 push_overloaded_decl (OVL_CURRENT (fn
),
5069 PUSH_LOCAL
| PUSH_USING
);
5072 push_local_binding (name
, newval
, PUSH_USING
);
5075 set_identifier_type_value (name
, newtype
);
5079 do_class_using_decl (decl
)
5084 if (TREE_CODE (decl
) != SCOPE_REF
5085 || TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (decl
, 0))) != 't')
5087 cp_error ("using-declaration for non-member at class scope");
5090 name
= TREE_OPERAND (decl
, 1);
5091 if (TREE_CODE (name
) == BIT_NOT_EXPR
)
5093 cp_error ("using-declaration for destructor");
5096 if (TREE_CODE (name
) == TYPE_DECL
)
5097 name
= DECL_NAME (name
);
5099 my_friendly_assert (TREE_CODE (name
) == IDENTIFIER_NODE
, 980716);
5101 value
= build_lang_decl (USING_DECL
, name
, void_type_node
);
5102 DECL_INITIAL (value
) = TREE_OPERAND (decl
, 0);
5106 /* Process a using-directive. */
5109 do_using_directive (namespace)
5112 if (namespace == std_node
)
5114 /* using namespace A::B::C; */
5115 if (TREE_CODE (namespace) == SCOPE_REF
)
5116 namespace = TREE_OPERAND (namespace, 1);
5117 if (TREE_CODE (namespace) == IDENTIFIER_NODE
)
5119 /* Lookup in lexer did not find a namespace. */
5120 cp_error ("namespace `%T' undeclared", namespace);
5123 if (TREE_CODE (namespace) != NAMESPACE_DECL
)
5125 cp_error ("`%T' is not a namespace", namespace);
5128 namespace = ORIGINAL_NAMESPACE (namespace);
5129 if (!toplevel_bindings_p ())
5130 push_using_directive (namespace);
5133 add_using_namespace (current_namespace
, namespace, 0);
5137 check_default_args (x
)
5140 tree arg
= TYPE_ARG_TYPES (TREE_TYPE (x
));
5141 int saw_def
= 0, i
= 0 - (TREE_CODE (TREE_TYPE (x
)) == METHOD_TYPE
);
5142 for (; arg
&& arg
!= void_list_node
; arg
= TREE_CHAIN (arg
), ++i
)
5144 if (TREE_PURPOSE (arg
))
5148 cp_error_at ("default argument missing for parameter %P of `%+#D'",
5159 TREE_USED (decl
) = 1;
5160 if (processing_template_decl
)
5162 assemble_external (decl
);
5164 /* Is it a synthesized method that needs to be synthesized? */
5165 if (TREE_CODE (decl
) == FUNCTION_DECL
&& DECL_CLASS_CONTEXT (decl
)
5166 && DECL_ARTIFICIAL (decl
) && ! DECL_INITIAL (decl
)
5167 /* Kludge: don't synthesize for default args. */
5168 && current_function_decl
)
5169 synthesize_method (decl
);
5171 /* If this is a function or variable that is an instance of some
5172 template, we now know that we will need to actually do the
5173 instantiation. We check that DECL is not an explicit
5174 instantiation because that is not checked in instantiate_decl. */
5175 if ((TREE_CODE (decl
) == FUNCTION_DECL
|| TREE_CODE (decl
) == VAR_DECL
)
5176 && DECL_LANG_SPECIFIC (decl
) && DECL_TEMPLATE_INFO (decl
)
5177 && !DECL_EXPLICIT_INSTANTIATION (decl
))
5178 instantiate_decl (decl
);
5181 /* Helper function for named_class_head_sans_basetype nonterminal. We
5182 have just seen something of the form `AGGR SCOPE::ID'. Return a
5183 TYPE_DECL for the type declared by ID in SCOPE. */
5186 handle_class_head (aggr
, scope
, id
)
5187 tree aggr
, scope
, id
;
5191 if (TREE_CODE (id
) == TYPE_DECL
)
5193 else if (DECL_CLASS_TEMPLATE_P (id
))
5194 decl
= DECL_TEMPLATE_RESULT (id
);
5197 tree current
= current_scope();
5199 if (current
== NULL_TREE
)
5200 current
= current_namespace
;
5201 if (scope
== std_node
)
5202 scope
= global_namespace
;
5203 if (scope
== NULL_TREE
)
5204 scope
= global_namespace
;
5205 if (scope
== current
)
5207 /* We've been given AGGR SCOPE::ID, when we're already inside SCOPE.
5208 Be nice about it. */
5210 cp_pedwarn ("extra qualification `%T::' on member `%D' ignored",
5211 FROB_CONTEXT (scope
), id
);
5213 else if (scope
!= global_namespace
)
5214 cp_error ("`%T' does not have a nested type named `%D'", scope
, id
);
5216 cp_error ("no file-scope type named `%D'", id
);
5218 /* Inject it at the current scope. */
5219 decl
= TYPE_MAIN_DECL (xref_tag (aggr
, id
, 1));
5222 /* Enter the SCOPE. If this turns out not to be a definition, the
5223 parser must leave the scope. */
5224 push_scope (CP_DECL_CONTEXT (decl
));
5226 /* If we see something like:
5228 template <typename T> struct S::I ....
5230 we must create a TEMPLATE_DECL for the nested type. */
5231 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
5232 decl
= push_template_decl (decl
);
5237 /* Initialize decl2.c. */
5242 ggc_add_tree_root (&decl_namespace_list
, 1);
5243 ggc_add_tree_varray_root (&saved_inlines
, 1);
5244 ggc_add_tree_varray_root (&pending_statics
, 1);
5245 ggc_add_tree_varray_root (&ssdf_decls
, 1);
5246 ggc_add_tree_root (&ssdf_decl
, 1);
5247 ggc_add_tree_root (&priority_decl
, 1);
5248 ggc_add_tree_root (&initialize_p_decl
, 1);
5249 ggc_add_tree_root (&pending_vtables
, 1);