1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 92-98, 1999 Free Software Foundation, Inc.
3 Hacked by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* Process declarations and symbol lookup for C front end.
24 Also constructs types; the standard scalar types at initialization,
25 and structure, union, array and enum types when they are declared. */
27 /* ??? not all decl nodes are given the most useful possible
28 line numbers. For example, the CONST_DECLs for enum values. */
43 #include "dwarf2out.h"
45 #include "splay-tree.h"
50 extern cpp_reader parse_in;
53 /* This structure contains information about the initializations
54 and/or destructions required for a particular priority level. */
55 typedef struct priority_info_s {
56 /* A label indicating where we should generate the next
57 initialization with this priority. */
58 rtx initialization_sequence;
59 /* A label indicating where we should generate the next destruction
60 with this priority. */
61 rtx destruction_sequence;
62 /* Non-zero if there have been any initializations at this priority
63 throughout the translation unit. */
64 int initializations_p;
65 /* Non-zero if there have been any destructions at this priority
66 throughout the translation unit. */
70 static tree get_sentry PROTO((tree));
71 static void mark_vtable_entries PROTO((tree));
72 static void grok_function_init PROTO((tree, tree));
73 static int finish_vtable_vardecl PROTO((tree *, void *));
74 static int prune_vtable_vardecl PROTO((tree *, void *));
75 static int finish_sigtable_vardecl PROTO((tree *, void *));
76 static int is_namespace_ancestor PROTO((tree, tree));
77 static void add_using_namespace PROTO((tree, tree, int));
78 static tree ambiguous_decl PROTO((tree, tree, tree,int));
79 static tree build_anon_union_vars PROTO((tree, tree*, int, int));
80 static int acceptable_java_type PROTO((tree));
81 static void output_vtable_inherit PROTO((tree));
82 static void start_objects PROTO((int, int));
83 static void finish_objects PROTO((int, int));
84 static tree merge_functions PROTO((tree, tree));
85 static tree decl_namespace PROTO((tree));
86 static tree validate_nonmember_using_decl PROTO((tree, tree *, tree *));
87 static void do_nonmember_using_decl PROTO((tree, tree, tree, tree,
89 static void start_static_storage_duration_function PROTO((void));
90 static int generate_inits_for_priority PROTO((splay_tree_node, void *));
91 static void finish_static_storage_duration_function PROTO((void));
92 static priority_info get_priority_info PROTO((int));
93 static void do_static_initialization PROTO((tree, tree, tree, int));
94 static void do_static_destruction PROTO((tree, tree, int));
95 static void do_static_initialization_and_destruction PROTO((tree, tree));
96 static void generate_ctor_or_dtor_function PROTO((int, int));
97 static int generate_ctor_and_dtor_functions_for_priority
98 PROTO((splay_tree_node, void *));
99 extern int current_class_depth;
101 /* A list of virtual function tables we must make sure to write out. */
102 tree pending_vtables;
104 /* A list of static class variables. This is needed, because a
105 static class variable can be declared inside the class without
106 an initializer, and then initialized, staticly, outside the class. */
107 static varray_type pending_statics;
108 static size_t pending_statics_used;
110 /* A list of functions which were declared inline, but which we
111 may need to emit outline anyway. */
112 static varray_type saved_inlines;
113 static size_t saved_inlines_used;
115 /* Used to help generate temporary names which are unique within
116 a function. Reset to 0 by start_function. */
118 int temp_name_counter;
120 /* Same, but not reset. Local temp variables and global temp variables
121 can have the same name. */
122 static int global_temp_name_counter;
124 /* Flag used when debugging spew.c */
126 extern int spew_debug;
128 /* Nonzero if we're done parsing and into end-of-file activities. */
132 /* Functions called along with real static constructors and destructors. */
134 tree static_ctors, static_dtors;
136 /* The current open namespace, and ::. */
138 tree current_namespace;
139 tree global_namespace;
141 /* The stack for namespaces of current declarations. */
143 static tree decl_namespace_list;
146 /* C (and C++) language-specific option variables. */
148 /* Nonzero means allow type mismatches in conditional expressions;
149 just make their values `void'. */
151 int flag_cond_mismatch;
153 /* Nonzero means give `double' the same size as `float'. */
155 int flag_short_double;
157 /* Nonzero means don't recognize the keyword `asm'. */
161 /* Nonzero means don't recognize any extension keywords. */
163 int flag_no_gnu_keywords;
165 /* Nonzero means don't recognize the non-ANSI builtin functions. */
169 /* Nonzero means don't recognize the non-ANSI builtin functions.
172 int flag_no_nonansi_builtin;
174 /* Nonzero means do some things the same way PCC does. Only provided so
175 the compiler will link. */
177 int flag_traditional;
179 /* Nonzero means to treat bitfields as unsigned unless they say `signed'. */
181 int flag_signed_bitfields = 1;
183 /* Nonzero means enable obscure ANSI features and disable GNU extensions
184 that might cause ANSI-compliant code to be miscompiled. */
188 /* Nonzero means do emit exported implementations of functions even if
189 they can be inlined. */
191 int flag_implement_inlines = 1;
193 /* Nonzero means do emit exported implementations of templates, instead of
194 multiple static copies in each file that needs a definition. */
196 int flag_external_templates;
198 /* Nonzero means that the decision to emit or not emit the implementation of a
199 template depends on where the template is instantiated, rather than where
202 int flag_alt_external_templates;
204 /* Nonzero means that implicit instantiations will be emitted if needed. */
206 int flag_implicit_templates = 1;
208 /* Nonzero means that implicit instantiations of inline templates will be
209 emitted if needed, even if instantiations of non-inline templates
212 int flag_implicit_inline_templates = 1;
214 /* Nonzero means warn about implicit declarations. */
216 int warn_implicit = 1;
218 /* Nonzero means warn about usage of long long when `-pedantic'. */
220 int warn_long_long = 1;
222 /* Nonzero means warn when all ctors or dtors are private, and the class
225 int warn_ctor_dtor_privacy = 1;
227 /* True if we want to implement vtables using "thunks".
228 The default is off. */
230 #ifndef DEFAULT_VTABLE_THUNKS
231 #define DEFAULT_VTABLE_THUNKS 0
233 int flag_vtable_thunks = DEFAULT_VTABLE_THUNKS;
235 /* True if we want to deal with repository information. */
237 int flag_use_repository;
239 /* Nonzero if we want to issue diagnostics that the standard says are not
242 int flag_optional_diags = 1;
244 /* Nonzero means give string constants the type `const char *', as mandated
247 int flag_const_strings = 1;
249 /* Nonzero means warn about deprecated conversion from string constant to
252 int warn_write_strings;
254 /* Nonzero means warn about pointer casts that can drop a type qualifier
255 from the pointer target type. */
259 /* Nonzero means warn about sizeof(function) or addition/subtraction
260 of function pointers. */
262 int warn_pointer_arith = 1;
264 /* Nonzero means warn for any function def without prototype decl. */
266 int warn_missing_prototypes;
268 /* Nonzero means warn about multiple (redundant) decls for the same single
269 variable or function. */
271 int warn_redundant_decls;
273 /* Warn if initializer is not completely bracketed. */
275 int warn_missing_braces;
277 /* Warn about comparison of signed and unsigned values. */
279 int warn_sign_compare;
281 /* Warn about *printf or *scanf format/argument anomalies. */
285 /* Warn about a subscript that has type char. */
287 int warn_char_subscripts;
289 /* Warn if a type conversion is done that might have confusing results. */
293 /* Warn if adding () is suggested. */
295 int warn_parentheses;
297 /* Non-zero means warn in function declared in derived class has the
298 same name as a virtual in the base class, but fails to match the
299 type signature of any virtual function in the base class. */
300 int warn_overloaded_virtual;
302 /* Non-zero means warn when declaring a class that has a non virtual
303 destructor, when it really ought to have a virtual one. */
306 /* Non-zero means warn when a function is declared extern and later inline. */
307 int warn_extern_inline;
309 /* Non-zero means warn when the compiler will reorder code. */
312 /* Non-zero means warn when synthesis behavior differs from Cfront's. */
315 /* Non-zero means warn when we convert a pointer to member function
316 into a pointer to (void or function). */
317 int warn_pmf2ptr = 1;
319 /* Nonzero means warn about violation of some Effective C++ style rules. */
323 /* Nonzero means warn where overload resolution chooses a promotion from
324 unsigned to signed over a conversion to an unsigned of the same size. */
328 /* Nonzero means warn when an old-style cast is used. */
330 int warn_old_style_cast;
332 /* Warn about #pragma directives that are not recognised. */
334 int warn_unknown_pragmas; /* Tri state variable. */
336 /* Nonzero means warn about use of multicharacter literals. */
338 int warn_multichar = 1;
340 /* Nonzero means warn when non-templatized friend functions are
341 declared within a template */
343 int warn_nontemplate_friend = 1;
345 /* Nonzero means complain about deprecated features. */
347 int warn_deprecated = 1;
349 /* Nonzero means `$' can be in an identifier. */
351 #ifndef DOLLARS_IN_IDENTIFIERS
352 #define DOLLARS_IN_IDENTIFIERS 1
354 int dollars_in_ident = DOLLARS_IN_IDENTIFIERS;
356 /* Nonzero for -fno-strict-prototype switch: do not consider empty
357 argument prototype to mean function takes no arguments. */
359 int flag_strict_prototype = 2;
360 int strict_prototype = 1;
361 int strict_prototypes_lang_c, strict_prototypes_lang_cplusplus = 1;
363 /* Nonzero means that labels can be used as first-class objects */
367 /* Non-zero means to collect statistics which might be expensive
368 and to print them when we are done. */
369 int flag_detailed_statistics;
371 /* C++ specific flags. */
372 /* Zero means that `this' is a *const. This gives nice behavior in the
373 2.0 world. 1 gives 1.2-compatible behavior. 2 gives Spring behavior.
374 -2 means we're constructing an object and it has fixed type. */
376 int flag_this_is_variable;
378 /* 3 means write out only virtuals function tables `defined'
379 in this implementation file.
380 0 means write out virtual function tables and give them
381 (C) static access (default). */
385 /* Nonzero means we should attempt to elide constructors when possible. */
387 int flag_elide_constructors = 1;
389 /* Nonzero means recognize and handle signature language constructs. */
391 int flag_handle_signatures;
393 /* Nonzero means that member functions defined in class scope are
394 inline by default. */
396 int flag_default_inline = 1;
398 /* Controls whether compiler generates 'type descriptor' that give
399 run-time type information. */
402 /* Nonzero if we wish to output cross-referencing information
403 for the GNU class browser. */
404 extern int flag_gnu_xref;
406 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
409 int flag_huge_objects;
411 /* Nonzero if we want to conserve space in the .o files. We do this
412 by putting uninitialized data and runtime initialized data into
413 .common instead of .data at the expense of not flagging multiple
416 int flag_conserve_space;
418 /* Nonzero if we want to obey access control semantics. */
420 int flag_access_control = 1;
422 /* Nonzero if we want to understand the operator names, i.e. 'bitand'. */
424 int flag_operator_names;
426 /* Nonzero if we want to check the return value of new and avoid calling
427 constructors if it is a null pointer. */
431 /* Nonzero if we want the new ANSI rules for pushing a new scope for `for'
432 initialization variables.
433 0: Old rules, set by -fno-for-scope.
434 2: New ANSI rules, set by -ffor-scope.
435 1: Try to implement new ANSI rules, but with backup compatibility
436 (and warnings). This is the default, for now. */
438 int flag_new_for_scope = 1;
440 /* Nonzero if we want to emit defined symbols with common-like linkage as
441 weak symbols where possible, in order to conform to C++ semantics.
442 Otherwise, emit them as local symbols. */
446 /* Nonzero to enable experimental ABI changes. */
450 /* Nonzero to not ignore namespace std. */
454 /* Maximum template instantiation depth. Must be at least 17 for ANSI
457 int max_tinst_depth = 17;
459 /* The name-mangling scheme to use. Must be 1 or greater to support
460 template functions with identical types, but different template
462 int name_mangling_version = 2;
464 /* Nonzero means that guiding declarations are allowed. */
465 int flag_guiding_decls;
467 /* Nonzero if squashed mangling is to be performed.
468 This uses the B and K codes to reference previously seen class types
469 and class qualifiers. */
470 int flag_do_squangling;
472 /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */
476 /* Nonzero means make the default pedwarns warnings instead of errors.
477 The value of this flag is ignored if -pedantic is specified. */
481 /* Table of language-dependent -f options.
482 STRING is the option name. VARIABLE is the address of the variable.
483 ON_VALUE is the value to store in VARIABLE
484 if `-fSTRING' is seen as an option.
485 (If `-fno-STRING' is seen as an option, the opposite value is stored.) */
487 static struct { const char *string; int *variable; int on_value;}
491 {"signed-char", &flag_signed_char, 1},
492 {"unsigned-char", &flag_signed_char, 0},
493 {"signed-bitfields", &flag_signed_bitfields, 1},
494 {"unsigned-bitfields", &flag_signed_bitfields, 0},
495 {"short-enums", &flag_short_enums, 1},
496 {"short-double", &flag_short_double, 1},
497 {"cond-mismatch", &flag_cond_mismatch, 1},
498 {"asm", &flag_no_asm, 0},
499 {"builtin", &flag_no_builtin, 0},
501 /* C++-only options. */
502 {"access-control", &flag_access_control, 1},
503 {"check-new", &flag_check_new, 1},
504 {"conserve-space", &flag_conserve_space, 1},
505 {"const-strings", &flag_const_strings, 1},
506 {"default-inline", &flag_default_inline, 1},
507 {"dollars-in-identifiers", &dollars_in_ident, 1},
508 {"elide-constructors", &flag_elide_constructors, 1},
509 {"external-templates", &flag_external_templates, 1},
510 {"for-scope", &flag_new_for_scope, 2},
511 {"gnu-keywords", &flag_no_gnu_keywords, 0},
512 {"handle-exceptions", &flag_exceptions, 1},
513 {"handle-signatures", &flag_handle_signatures, 1},
514 {"honor-std", &flag_honor_std, 1},
515 {"huge-objects", &flag_huge_objects, 1},
516 {"implement-inlines", &flag_implement_inlines, 1},
517 {"implicit-inline-templates", &flag_implicit_inline_templates, 1},
518 {"implicit-templates", &flag_implicit_templates, 1},
519 {"labels-ok", &flag_labels_ok, 1},
520 {"nonansi-builtins", &flag_no_nonansi_builtin, 0},
521 {"operator-names", &flag_operator_names, 1},
522 {"optional-diags", &flag_optional_diags, 1},
523 {"permissive", &flag_permissive, 1},
524 {"repo", &flag_use_repository, 1},
525 {"rtti", &flag_rtti, 1},
526 {"squangle", &flag_do_squangling, 1},
527 {"stats", &flag_detailed_statistics, 1},
528 {"strict-prototype", &flag_strict_prototype, 1},
529 {"this-is-variable", &flag_this_is_variable, 1},
530 {"vtable-gc", &flag_vtable_gc, 1},
531 {"vtable-thunks", &flag_vtable_thunks, 1},
532 {"weak", &flag_weak, 1},
533 {"xref", &flag_gnu_xref, 1}
536 /* Decode the string P as a language-specific option.
537 Return the number of strings consumed for a valid option.
538 Otherwise return 0. */
541 lang_decode_option (argc, argv)
550 int strings_processed;
553 strings_processed = cpp_handle_option (&parse_in, argc, argv);
555 strings_processed = 0;
556 #endif /* ! USE_CPPLIB */
558 if (!strcmp (p, "-ftraditional") || !strcmp (p, "-traditional"))
560 else if (p[0] == '-' && p[1] == 'f')
562 /* Some kind of -f option.
563 P's value is the option sans `-f'.
564 Search for it in the table of options. */
569 /* Try special -f options. */
571 if (!strcmp (p, "handle-exceptions")
572 || !strcmp (p, "no-handle-exceptions"))
573 warning ("-fhandle-exceptions has been renamed to -fexceptions (and is now on by default)");
575 if (!strcmp (p, "memoize-lookups")
576 || !strcmp (p, "no-memoize-lookups")
577 || !strcmp (p, "save-memoized")
578 || !strcmp (p, "no-save-memoized")
579 || !strcmp (p, "no-all-virtual")
580 || !strcmp (p, "no-enum-int-equiv")
581 || !strcmp (p, "nonnull-objects")
582 || !strcmp (p, "ansi-overloading"))
587 else if (!strcmp (p, "all-virtual")
588 || !strcmp (p, "enum-int-equiv")
589 || !strcmp (p, "no-nonnull-objects")
590 || !strcmp (p, "no-ansi-overloading"))
592 warning ("-f%s is no longer supported", p);
595 else if (! strcmp (p, "alt-external-templates"))
597 flag_external_templates = 1;
598 flag_alt_external_templates = 1;
600 cp_deprecated ("-falt-external-templates");
602 else if (! strcmp (p, "no-alt-external-templates"))
604 flag_alt_external_templates = 0;
607 else if (!strcmp (p, "repo"))
609 flag_use_repository = 1;
610 flag_implicit_templates = 0;
613 else if (!strcmp (p, "guiding-decls"))
615 flag_guiding_decls = 1;
616 name_mangling_version = 0;
619 else if (!strcmp (p, "no-guiding-decls"))
621 flag_guiding_decls = 0;
624 else if (!strcmp (p, "this-is-variable"))
626 flag_this_is_variable = 1;
628 cp_deprecated ("-fthis-is-variable");
630 else if (!strcmp (p, "external-templates"))
632 flag_external_templates = 1;
634 cp_deprecated ("-fexternal-templates");
636 else if (!strcmp (p, "handle-signatures"))
638 flag_handle_signatures = 1;
640 cp_deprecated ("-fhandle-signatures");
642 else if (!strcmp (p, "new-abi"))
645 flag_do_squangling = 1;
647 flag_vtable_thunks = 1;
649 else if (!strcmp (p, "no-new-abi"))
652 flag_do_squangling = 0;
655 else if (!strncmp (p, "template-depth-", 15))
658 read_integral_parameter (p + 15, p - 2, max_tinst_depth);
660 else if (!strncmp (p, "name-mangling-version-", 22))
662 name_mangling_version =
663 read_integral_parameter (p + 22, p - 2, name_mangling_version);
666 !found && j < sizeof (lang_f_options) / sizeof (lang_f_options[0]);
669 if (!strcmp (p, lang_f_options[j].string))
671 *lang_f_options[j].variable = lang_f_options[j].on_value;
672 /* A goto here would be cleaner,
673 but breaks the vax pcc. */
676 if (p[0] == 'n' && p[1] == 'o' && p[2] == '-'
677 && ! strcmp (p+3, lang_f_options[j].string))
679 *lang_f_options[j].variable = ! lang_f_options[j].on_value;
685 else if (p[0] == '-' && p[1] == 'W')
689 /* The -W options control the warning behavior of the compiler. */
692 if (p[0] == 'n' && p[1] == 'o' && p[2] == '-')
695 if (!strcmp (p, "implicit"))
696 warn_implicit = setting;
697 else if (!strcmp (p, "long-long"))
698 warn_long_long = setting;
699 else if (!strcmp (p, "return-type"))
700 warn_return_type = setting;
701 else if (!strcmp (p, "ctor-dtor-privacy"))
702 warn_ctor_dtor_privacy = setting;
703 else if (!strcmp (p, "write-strings"))
704 warn_write_strings = setting;
705 else if (!strcmp (p, "cast-qual"))
706 warn_cast_qual = setting;
707 else if (!strcmp (p, "char-subscripts"))
708 warn_char_subscripts = setting;
709 else if (!strcmp (p, "pointer-arith"))
710 warn_pointer_arith = setting;
711 else if (!strcmp (p, "missing-prototypes"))
712 warn_missing_prototypes = setting;
713 else if (!strcmp (p, "redundant-decls"))
714 warn_redundant_decls = setting;
715 else if (!strcmp (p, "missing-braces"))
716 warn_missing_braces = setting;
717 else if (!strcmp (p, "sign-compare"))
718 warn_sign_compare = setting;
719 else if (!strcmp (p, "format"))
720 warn_format = setting;
721 else if (!strcmp (p, "conversion"))
722 warn_conversion = setting;
723 else if (!strcmp (p, "parentheses"))
724 warn_parentheses = setting;
725 else if (!strcmp (p, "non-virtual-dtor"))
726 warn_nonvdtor = setting;
727 else if (!strcmp (p, "extern-inline"))
728 warn_extern_inline = setting;
729 else if (!strcmp (p, "reorder"))
730 warn_reorder = setting;
731 else if (!strcmp (p, "synth"))
732 warn_synth = setting;
733 else if (!strcmp (p, "pmf-conversions"))
734 warn_pmf2ptr = setting;
735 else if (!strcmp (p, "effc++"))
737 else if (!strcmp (p, "sign-promo"))
738 warn_sign_promo = setting;
739 else if (!strcmp (p, "old-style-cast"))
740 warn_old_style_cast = setting;
741 else if (!strcmp (p, "overloaded-virtual"))
742 warn_overloaded_virtual = setting;
743 else if (!strcmp (p, "multichar"))
744 warn_multichar = setting;
745 else if (!strcmp (p, "unknown-pragmas"))
746 /* Set to greater than 1, so that even unknown pragmas in
747 system headers will be warned about. */
748 warn_unknown_pragmas = setting * 2;
749 else if (!strcmp (p, "non-template-friend"))
750 warn_nontemplate_friend = setting;
751 else if (!strcmp (p, "deprecated"))
752 warn_deprecated = setting;
753 else if (!strcmp (p, "comment"))
754 ; /* cpp handles this one. */
755 else if (!strcmp (p, "comments"))
756 ; /* cpp handles this one. */
757 else if (!strcmp (p, "trigraphs"))
758 ; /* cpp handles this one. */
759 else if (!strcmp (p, "import"))
760 ; /* cpp handles this one. */
761 else if (!strcmp (p, "all"))
763 warn_return_type = setting;
764 warn_unused = setting;
765 warn_implicit = setting;
766 warn_switch = setting;
767 warn_format = setting;
768 warn_parentheses = setting;
769 warn_missing_braces = setting;
770 warn_sign_compare = setting;
771 warn_multichar = setting;
772 /* We save the value of warn_uninitialized, since if they put
773 -Wuninitialized on the command line, we need to generate a
774 warning about not using it without also specifying -O. */
775 if (warn_uninitialized != 1)
776 warn_uninitialized = (setting ? 2 : 0);
777 /* Only warn about unknown pragmas that are not in system
779 warn_unknown_pragmas = 1;
781 /* C++-specific warnings. */
782 warn_ctor_dtor_privacy = setting;
783 warn_nonvdtor = setting;
784 warn_reorder = setting;
785 warn_nontemplate_friend = setting;
787 else return strings_processed;
789 else if (!strcmp (p, "-ansi"))
790 flag_no_nonansi_builtin = 1, flag_ansi = 1,
791 flag_no_gnu_keywords = 1, flag_operator_names = 1;
793 /* Undocumented, only ever used when you're invoking cc1plus by hand, since
794 it's probably safe to assume no sane person would ever want to use this
795 under normal circumstances. */
796 else if (!strcmp (p, "-spew-debug"))
800 return strings_processed;
805 /* Incorporate `const' and `volatile' qualifiers for member functions.
806 FUNCTION is a TYPE_DECL or a FUNCTION_DECL.
807 QUALS is a list of qualifiers. */
810 grok_method_quals (ctype, function, quals)
811 tree ctype, function, quals;
813 tree fntype = TREE_TYPE (function);
814 tree raises = TYPE_RAISES_EXCEPTIONS (fntype);
815 int type_quals = TYPE_UNQUALIFIED;
816 int dup_quals = TYPE_UNQUALIFIED;
820 int tq = cp_type_qual_from_rid (TREE_VALUE (quals));
826 quals = TREE_CHAIN (quals);
830 if (dup_quals != TYPE_UNQUALIFIED)
831 cp_error ("duplicate type qualifiers in %s declaration",
832 TREE_CODE (function) == FUNCTION_DECL
833 ? "member function" : "type");
835 ctype = cp_build_qualified_type (ctype, type_quals);
836 fntype = build_cplus_method_type (ctype, TREE_TYPE (fntype),
837 (TREE_CODE (fntype) == METHOD_TYPE
838 ? TREE_CHAIN (TYPE_ARG_TYPES (fntype))
839 : TYPE_ARG_TYPES (fntype)));
841 fntype = build_exception_variant (fntype, raises);
843 TREE_TYPE (function) = fntype;
847 /* Warn when -fexternal-templates is used and #pragma
848 interface/implementation is not used all the times it should be,
852 warn_if_unknown_interface (decl)
855 static int already_warned = 0;
856 if (already_warned++)
859 if (flag_alt_external_templates)
861 struct tinst_level *til = tinst_for_decl ();
863 char *sf = input_filename;
868 input_filename = til->file;
870 cp_warning ("template `%#D' instantiated in file without #pragma interface",
876 cp_warning_at ("template `%#D' defined in file without #pragma interface",
880 /* A subroutine of the parser, to handle a component list. */
883 grok_x_components (specs)
886 struct pending_inline **p;
889 specs = strip_attrs (specs);
891 check_tag_decl (specs);
892 t = groktypename (build_decl_list (specs, NULL_TREE));
894 /* The only case where we need to do anything additional here is an
895 anonymous union field, e.g.: `struct S { union { int i; }; };'. */
896 if (t == NULL_TREE || !ANON_UNION_TYPE_P (t))
899 fixup_anonymous_union (t);
900 finish_member_declaration (build_lang_field_decl (FIELD_DECL,
904 /* Ignore any inline function definitions in the anonymous union
905 since an anonymous union may not have function members. */
906 p = &pending_inlines;
907 for (; *p; *p = (*p)->next)
908 if (DECL_CONTEXT ((*p)->fndecl) != t)
912 /* Constructors for types with virtual baseclasses need an "in-charge" flag
913 saying whether this constructor is responsible for initialization of
914 virtual baseclasses or not. All destructors also need this "in-charge"
915 flag, which additionally determines whether or not the destructor should
916 free the memory for the object.
918 This function adds the "in-charge" flag to member function FN if
919 appropriate. It is called from grokclassfn and tsubst.
920 FN must be either a constructor or destructor. */
923 maybe_retrofit_in_chrg (fn)
926 tree basetype, arg_types, parms, parm, fntype;
928 if (DECL_CONSTRUCTOR_P (fn)
929 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CLASS_CONTEXT (fn))
930 && ! DECL_CONSTRUCTOR_FOR_VBASE_P (fn))
932 else if (! DECL_CONSTRUCTOR_P (fn)
933 && TREE_CHAIN (DECL_ARGUMENTS (fn)) == NULL_TREE)
938 if (DECL_CONSTRUCTOR_P (fn))
939 DECL_CONSTRUCTOR_FOR_VBASE_P (fn) = 1;
941 /* First add it to DECL_ARGUMENTS... */
942 parm = build_decl (PARM_DECL, in_charge_identifier, integer_type_node);
943 /* Mark the artificial `__in_chrg' parameter as "artificial". */
944 SET_DECL_ARTIFICIAL (parm);
945 DECL_ARG_TYPE (parm) = integer_type_node;
946 TREE_READONLY (parm) = 1;
947 parms = DECL_ARGUMENTS (fn);
948 TREE_CHAIN (parm) = TREE_CHAIN (parms);
949 TREE_CHAIN (parms) = parm;
951 /* ...and then to TYPE_ARG_TYPES. */
952 arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
953 basetype = TREE_TYPE (TREE_VALUE (arg_types));
954 arg_types = hash_tree_chain (integer_type_node, TREE_CHAIN (arg_types));
955 fntype = build_cplus_method_type (basetype, TREE_TYPE (TREE_TYPE (fn)),
957 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)))
958 fntype = build_exception_variant (fntype,
959 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)));
960 TREE_TYPE (fn) = fntype;
963 /* Classes overload their constituent function names automatically.
964 When a function name is declared in a record structure,
965 its name is changed to it overloaded name. Since names for
966 constructors and destructors can conflict, we place a leading
969 CNAME is the name of the class we are grokking for.
971 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
973 FLAGS contains bits saying what's special about today's
974 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
976 If FUNCTION is a destructor, then we must add the `auto-delete' field
977 as a second parameter. There is some hair associated with the fact
978 that we must "declare" this variable in the manner consistent with the
979 way the rest of the arguments were declared.
981 QUALS are the qualifiers for the this pointer. */
984 grokclassfn (ctype, function, flags, quals)
985 tree ctype, function;
986 enum overload_flags flags;
989 tree fn_name = DECL_NAME (function);
994 if (fn_name == NULL_TREE)
996 error ("name missing for member function");
997 fn_name = get_identifier ("<anonymous>");
998 DECL_NAME (function) = fn_name;
1002 qualtype = grok_method_quals (ctype, function, quals);
1006 arg_types = TYPE_ARG_TYPES (TREE_TYPE (function));
1007 if (TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
1009 /* Must add the class instance variable up front. */
1010 /* Right now we just make this a pointer. But later
1011 we may wish to make it special. */
1012 tree type = TREE_VALUE (arg_types);
1015 if ((flag_this_is_variable > 0)
1016 && (flags == DTOR_FLAG || DECL_CONSTRUCTOR_P (function)))
1019 parm = build_decl (PARM_DECL, this_identifier, type);
1020 /* Mark the artificial `this' parameter as "artificial". */
1021 SET_DECL_ARTIFICIAL (parm);
1022 DECL_ARG_TYPE (parm) = type;
1023 /* We can make this a register, so long as we don't
1024 accidentally complain if someone tries to take its address. */
1025 DECL_REGISTER (parm) = 1;
1027 TREE_READONLY (parm) = 1;
1028 TREE_CHAIN (parm) = last_function_parms;
1029 last_function_parms = parm;
1032 DECL_ARGUMENTS (function) = last_function_parms;
1033 /* First approximations. */
1034 DECL_CONTEXT (function) = ctype;
1035 DECL_CLASS_CONTEXT (function) = ctype;
1037 if (flags == DTOR_FLAG || DECL_CONSTRUCTOR_P (function))
1039 maybe_retrofit_in_chrg (function);
1040 arg_types = TYPE_ARG_TYPES (TREE_TYPE (function));
1043 if (flags == DTOR_FLAG)
1045 DECL_ASSEMBLER_NAME (function) = build_destructor_name (ctype);
1046 TYPE_HAS_DESTRUCTOR (ctype) = 1;
1049 set_mangled_name_for_decl (function);
1052 /* Work on the expr used by alignof (this is only called by the parser). */
1061 if (processing_template_decl)
1062 return build_min (ALIGNOF_EXPR, sizetype, expr);
1064 if (TREE_CODE (expr) == COMPONENT_REF
1065 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
1066 error ("`__alignof__' applied to a bit-field");
1068 if (TREE_CODE (expr) == INDIRECT_REF)
1070 best = t = TREE_OPERAND (expr, 0);
1071 bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
1073 while (TREE_CODE (t) == NOP_EXPR
1074 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
1077 t = TREE_OPERAND (t, 0);
1078 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
1079 if (thisalign > bestalign)
1080 best = t, bestalign = thisalign;
1082 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
1086 /* ANSI says arrays and fns are converted inside comma.
1087 But we can't convert them in build_compound_expr
1088 because that would break commas in lvalues.
1089 So do the conversion here if operand was a comma. */
1090 if (TREE_CODE (expr) == COMPOUND_EXPR
1091 && (TREE_CODE (TREE_TYPE (expr)) == ARRAY_TYPE
1092 || TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE))
1093 expr = default_conversion (expr);
1094 return c_alignof (TREE_TYPE (expr));
1098 /* Create an ARRAY_REF, checking for the user doing things backwards
1102 grok_array_decl (array_expr, index_exp)
1103 tree array_expr, index_exp;
1105 tree type = TREE_TYPE (array_expr);
1106 tree p1, p2, i1, i2;
1108 if (type == error_mark_node || index_exp == error_mark_node)
1109 return error_mark_node;
1110 if (processing_template_decl)
1111 return build_min (ARRAY_REF, type ? TREE_TYPE (type) : NULL_TREE,
1112 array_expr, index_exp);
1114 if (type == NULL_TREE)
1116 /* Something has gone very wrong. Assume we are mistakenly reducing
1117 an expression instead of a declaration. */
1118 error ("parser may be lost: is there a '{' missing somewhere?");
1122 if (TREE_CODE (type) == OFFSET_TYPE
1123 || TREE_CODE (type) == REFERENCE_TYPE)
1124 type = TREE_TYPE (type);
1126 /* If they have an `operator[]', use that. */
1127 if (IS_AGGR_TYPE (type) || IS_AGGR_TYPE (TREE_TYPE (index_exp)))
1128 return build_opfncall (ARRAY_REF, LOOKUP_NORMAL,
1129 array_expr, index_exp, NULL_TREE);
1131 /* Otherwise, create an ARRAY_REF for a pointer or array type. It
1132 is a little-known fact that, if `a' is an array and `i' is an
1133 int, you can write `i[a]', which means the same thing as `a[i]'. */
1135 if (TREE_CODE (type) == ARRAY_TYPE)
1138 p1 = build_expr_type_conversion (WANT_POINTER, array_expr, 0);
1140 if (TREE_CODE (TREE_TYPE (index_exp)) == ARRAY_TYPE)
1143 p2 = build_expr_type_conversion (WANT_POINTER, index_exp, 0);
1145 i1 = build_expr_type_conversion (WANT_INT | WANT_ENUM, array_expr, 0);
1146 i2 = build_expr_type_conversion (WANT_INT | WANT_ENUM, index_exp, 0);
1148 if ((p1 && i2) && (i1 && p2))
1149 error ("ambiguous conversion for array subscript");
1152 array_expr = p1, index_exp = i2;
1154 array_expr = p2, index_exp = i1;
1157 cp_error ("invalid types `%T[%T]' for array subscript",
1158 type, TREE_TYPE (index_exp));
1159 return error_mark_node;
1162 if (array_expr == error_mark_node || index_exp == error_mark_node)
1163 error ("ambiguous conversion for array subscript");
1165 return build_array_ref (array_expr, index_exp);
1168 /* Given the cast expression EXP, checking out its validity. Either return
1169 an error_mark_node if there was an unavoidable error, return a cast to
1170 void for trying to delete a pointer w/ the value 0, or return the
1171 call to delete. If DOING_VEC is 1, we handle things differently
1172 for doing an array delete. If DOING_VEC is 2, they gave us the
1173 array size as an argument to delete.
1174 Implements ARM $5.3.4. This is called from the parser. */
1177 delete_sanity (exp, size, doing_vec, use_global_delete)
1179 int doing_vec, use_global_delete;
1182 /* For a regular vector delete (aka, no size argument) we will pass
1183 this down as a NULL_TREE into build_vec_delete. */
1184 tree maxindex = NULL_TREE;
1186 if (exp == error_mark_node)
1189 if (processing_template_decl)
1191 t = build_min (DELETE_EXPR, void_type_node, exp, size);
1192 DELETE_EXPR_USE_GLOBAL (t) = use_global_delete;
1193 DELETE_EXPR_USE_VEC (t) = doing_vec;
1197 if (TREE_CODE (exp) == OFFSET_REF)
1198 exp = resolve_offset_ref (exp);
1199 exp = convert_from_reference (exp);
1200 t = stabilize_reference (exp);
1201 t = build_expr_type_conversion (WANT_POINTER, t, 1);
1203 if (t == NULL_TREE || t == error_mark_node)
1205 cp_error ("type `%#T' argument given to `delete', expected pointer",
1207 return error_mark_node;
1212 maxindex = build_binary_op (MINUS_EXPR, size, integer_one_node);
1213 pedwarn ("anachronistic use of array size in vector delete");
1216 type = TREE_TYPE (t);
1218 /* As of Valley Forge, you can delete a pointer to const. */
1220 /* You can't delete functions. */
1221 if (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
1223 error ("cannot delete a function");
1224 return error_mark_node;
1227 /* Deleting ptr to void is undefined behaviour [expr.delete/3]. */
1228 if (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE)
1229 cp_warning ("`%T' is not a pointer-to-object type", type);
1231 /* An array can't have been allocated by new, so complain. */
1232 if (TREE_CODE (t) == ADDR_EXPR
1233 && TREE_CODE (TREE_OPERAND (t, 0)) == VAR_DECL
1234 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == ARRAY_TYPE)
1235 cp_warning ("deleting array `%#D'", TREE_OPERAND (t, 0));
1237 /* Deleting a pointer with the value zero is valid and has no effect. */
1238 if (integer_zerop (t))
1239 return build1 (NOP_EXPR, void_type_node, t);
1242 return build_vec_delete (t, maxindex, integer_one_node,
1243 integer_zero_node, use_global_delete);
1246 if (IS_AGGR_TYPE (TREE_TYPE (type))
1247 && TYPE_GETS_REG_DELETE (TREE_TYPE (type)))
1249 /* Only do access checking here; we'll be calling op delete
1250 from the destructor. */
1251 tree tmp = build_op_delete_call (DELETE_EXPR, t, size_zero_node,
1252 LOOKUP_NORMAL, NULL_TREE);
1253 if (tmp == error_mark_node)
1254 return error_mark_node;
1257 return build_delete (type, t, integer_three_node,
1258 LOOKUP_NORMAL, use_global_delete);
1262 /* Report an error if the indicated template declaration is not the
1263 sort of thing that should be a member template. */
1266 check_member_template (tmpl)
1271 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0);
1272 decl = DECL_TEMPLATE_RESULT (tmpl);
1274 if (TREE_CODE (decl) == FUNCTION_DECL
1275 || (TREE_CODE (decl) == TYPE_DECL
1276 && IS_AGGR_TYPE (TREE_TYPE (decl))))
1278 if (current_function_decl)
1279 /* 14.5.2.2 [temp.mem]
1281 A local class shall not have member templates. */
1282 cp_error ("declaration of member template `%#D' in local class",
1285 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VIRTUAL_P (decl))
1287 /* 14.5.2.3 [temp.mem]
1289 A member function template shall not be virtual. */
1291 ("invalid use of `virtual' in template declaration of `%#D'",
1293 DECL_VIRTUAL_P (decl) = 0;
1296 /* The debug-information generating code doesn't know what to do
1297 with member templates. */
1298 DECL_IGNORED_P (tmpl) = 1;
1301 cp_error ("template declaration of `%#D'", decl);
1304 /* Return true iff TYPE is a valid Java parameter or return type. */
1307 acceptable_java_type (type)
1310 if (TREE_CODE (type) == VOID_TYPE || TYPE_FOR_JAVA (type))
1312 if (TREE_CODE (type) == POINTER_TYPE)
1314 type = TREE_TYPE (type);
1315 if (TREE_CODE (type) == RECORD_TYPE)
1318 if (! TYPE_FOR_JAVA (type))
1320 if (! CLASSTYPE_TEMPLATE_INFO (type))
1322 args = CLASSTYPE_TI_ARGS (type);
1323 i = TREE_VEC_LENGTH (args);
1326 type = TREE_VEC_ELT (args, i);
1327 if (TREE_CODE (type) == POINTER_TYPE)
1328 type = TREE_TYPE (type);
1329 if (! TYPE_FOR_JAVA (type))
1338 /* For a METHOD in a Java class CTYPE, return 1 if
1339 the parameter and return types are valid Java types.
1340 Otherwise, print appropriate error messages, and return 0. */
1343 check_java_method (method)
1347 tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (method));
1348 tree ret_type = TREE_TYPE (TREE_TYPE (method));
1349 if (! acceptable_java_type (ret_type))
1351 cp_error ("Java method '%D' has non-Java return type `%T'",
1355 for (; arg_types != NULL_TREE; arg_types = TREE_CHAIN (arg_types))
1357 tree type = TREE_VALUE (arg_types);
1358 if (! acceptable_java_type (type))
1360 cp_error ("Java method '%D' has non-Java parameter type `%T'",
1365 return jerr ? 0 : 1;
1368 /* Sanity check: report error if this function FUNCTION is not
1369 really a member of the class (CTYPE) it is supposed to belong to.
1370 CNAME is the same here as it is for grokclassfn above. */
1373 check_classfn (ctype, function)
1374 tree ctype, function;
1376 tree fn_name = DECL_NAME (function);
1377 tree fndecl, fndecls;
1378 tree method_vec = CLASSTYPE_METHOD_VEC (complete_type (ctype));
1382 if (DECL_USE_TEMPLATE (function)
1383 && is_member_template (DECL_TI_TEMPLATE (function)))
1384 /* Since this is a specialization of a member template,
1385 we're not going to find the declaration in the class.
1388 struct S { template <typename T> void f(T); };
1389 template <> void S::f(int);
1391 we're not going to find `S::f(int)', but there's no
1392 reason we should, either. We let our callers know we didn't
1393 find the method, but we don't complain. */
1396 if (method_vec != 0)
1398 methods = &TREE_VEC_ELT (method_vec, 0);
1399 end = TREE_VEC_END (method_vec);
1401 /* First suss out ctors and dtors. */
1402 if (*methods && fn_name == DECL_NAME (OVL_CURRENT (*methods))
1403 && DECL_CONSTRUCTOR_P (function))
1405 if (*++methods && fn_name == DECL_NAME (OVL_CURRENT (*methods))
1406 && DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function)))
1409 while (++methods != end && *methods)
1412 if (fn_name == DECL_NAME (OVL_CURRENT (*methods)))
1415 for (fndecls = *methods; fndecls != NULL_TREE;
1416 fndecls = OVL_NEXT (fndecls))
1418 fndecl = OVL_CURRENT (fndecls);
1419 /* The DECL_ASSEMBLER_NAME for a TEMPLATE_DECL, or
1420 for a for member function of a template class, is
1421 not mangled, so the check below does not work
1422 correctly in that case. Since mangled destructor
1423 names do not include the type of the arguments,
1424 we can't use this short-cut for them, either.
1425 (It's not legal to declare arguments for a
1426 destructor, but some people try.) */
1427 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function))
1428 && (DECL_ASSEMBLER_NAME (function)
1429 != DECL_NAME (function))
1430 && (DECL_ASSEMBLER_NAME (fndecl)
1431 != DECL_NAME (fndecl))
1432 && (DECL_ASSEMBLER_NAME (function)
1433 == DECL_ASSEMBLER_NAME (fndecl)))
1436 /* We cannot simply call decls_match because this
1437 doesn't work for static member functions that are
1438 pretending to be methods, and because the name
1439 may have been changed by asm("new_name"). */
1440 if (DECL_NAME (function) == DECL_NAME (fndecl))
1442 tree p1 = TYPE_ARG_TYPES (TREE_TYPE (function));
1443 tree p2 = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
1445 /* Get rid of the this parameter on functions that become
1447 if (DECL_STATIC_FUNCTION_P (fndecl)
1448 && TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
1449 p1 = TREE_CHAIN (p1);
1451 if (same_type_p (TREE_TYPE (TREE_TYPE (function)),
1452 TREE_TYPE (TREE_TYPE (fndecl)))
1453 && compparms (p1, p2)
1454 && (DECL_TEMPLATE_SPECIALIZATION (function)
1455 == DECL_TEMPLATE_SPECIALIZATION (fndecl))
1456 && (!DECL_TEMPLATE_SPECIALIZATION (function)
1457 || (DECL_TI_TEMPLATE (function)
1458 == DECL_TI_TEMPLATE (fndecl))))
1467 if (methods != end && *methods)
1469 tree fndecl = *methods;
1470 cp_error ("prototype for `%#D' does not match any in class `%T'",
1472 cp_error_at ("candidate%s: %+#D", OVL_NEXT (fndecl) ? "s are" : " is",
1473 OVL_CURRENT (fndecl));
1474 while (fndecl = OVL_NEXT (fndecl), fndecl)
1475 cp_error_at (" %#D", OVL_CURRENT(fndecl));
1480 if (TYPE_SIZE (ctype) == 0)
1481 incomplete_type_error (function, ctype);
1483 cp_error ("no `%#D' member function declared in class `%T'",
1487 /* If we did not find the method in the class, add it to avoid
1488 spurious errors (unless the CTYPE is not yet defined, in which
1489 case we'll only confuse ourselves when the function is declared
1490 properly within the class. */
1491 if (TYPE_SIZE (ctype))
1492 add_method (ctype, methods, function);
1496 /* We have just processed the DECL, which is a static data member.
1497 Its initializer, if present, is INIT. The ASMSPEC_TREE, if
1498 present, is the assembly-language name for the data member.
1499 NEED_POP and FLAGS are as for cp_finish_decl. */
1502 finish_static_data_member_decl (decl, init, asmspec_tree, need_pop, flags)
1512 asmspec = TREE_STRING_POINTER (asmspec_tree);
1514 my_friendly_assert (TREE_PUBLIC (decl), 0);
1516 /* We cannot call pushdecl here, because that would fill in the
1517 decl of our TREE_CHAIN. Instead, we modify cp_finish_decl to do
1518 the right thing, namely, to put this decl out straight away. */
1519 /* current_class_type can be NULL_TREE in case of error. */
1520 if (!asmspec && current_class_type)
1522 DECL_INITIAL (decl) = error_mark_node;
1523 DECL_ASSEMBLER_NAME (decl)
1524 = build_static_name (current_class_type, DECL_NAME (decl));
1526 if (! processing_template_decl)
1528 if (!pending_statics)
1529 VARRAY_TREE_INIT (pending_statics, 32, "pending_statics");
1531 if (pending_statics_used == pending_statics->num_elements)
1532 VARRAY_GROW (pending_statics,
1533 2 * pending_statics->num_elements);
1534 VARRAY_TREE (pending_statics, pending_statics_used) = decl;
1535 ++pending_statics_used;
1538 /* Static consts need not be initialized in the class definition. */
1539 if (init != NULL_TREE && TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
1541 static int explanation = 0;
1543 error ("initializer invalid for static member with constructor");
1544 if (explanation++ == 0)
1545 error ("(you really want to initialize it separately)");
1548 /* Force the compiler to know when an uninitialized static const
1549 member is being used. */
1550 if (CP_TYPE_CONST_P (TREE_TYPE (decl)) && init == 0)
1551 TREE_USED (decl) = 1;
1552 DECL_INITIAL (decl) = init;
1553 DECL_IN_AGGR_P (decl) = 1;
1554 DECL_CONTEXT (decl) = current_class_type;
1555 DECL_CLASS_CONTEXT (decl) = current_class_type;
1557 cp_finish_decl (decl, init, asmspec_tree, need_pop, flags);
1560 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
1561 of a structure component, returning a FIELD_DECL node.
1562 QUALS is a list of type qualifiers for this decl (such as for declaring
1563 const member functions).
1565 This is done during the parsing of the struct declaration.
1566 The FIELD_DECL nodes are chained together and the lot of them
1567 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
1571 If class A defines that certain functions in class B are friends, then
1572 the way I have set things up, it is B who is interested in permission
1573 granted by A. However, it is in A's context that these declarations
1574 are parsed. By returning a void_type_node, class A does not attempt
1575 to incorporate the declarations of the friends within its structure.
1577 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
1578 CHANGES TO CODE IN `start_method'. */
1581 grokfield (declarator, declspecs, init, asmspec_tree, attrlist)
1582 tree declarator, declspecs, init, asmspec_tree, attrlist;
1584 register tree value;
1586 int flags = LOOKUP_ONLYCONVERTING;
1588 /* Convert () initializers to = initializers. */
1589 if (init == NULL_TREE && declarator != NULL_TREE
1590 && TREE_CODE (declarator) == CALL_EXPR
1591 && TREE_OPERAND (declarator, 0)
1592 && (TREE_CODE (TREE_OPERAND (declarator, 0)) == IDENTIFIER_NODE
1593 || TREE_CODE (TREE_OPERAND (declarator, 0)) == SCOPE_REF)
1594 && parmlist_is_exprlist (TREE_OPERAND (declarator, 1)))
1596 init = TREE_OPERAND (declarator, 1);
1597 declarator = TREE_OPERAND (declarator, 0);
1601 if (declspecs == NULL_TREE
1602 && TREE_CODE (declarator) == SCOPE_REF
1603 && TREE_CODE (TREE_OPERAND (declarator, 1)) == IDENTIFIER_NODE)
1605 /* Access declaration */
1606 if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator, 0))))
1608 else if (TREE_COMPLEXITY (declarator) == current_class_depth)
1609 pop_nested_class ();
1610 return do_class_using_decl (declarator);
1614 && TREE_CODE (init) == TREE_LIST
1615 && TREE_VALUE (init) == error_mark_node
1616 && TREE_CHAIN (init) == NULL_TREE)
1619 value = grokdeclarator (declarator, declspecs, FIELD, init != 0, attrlist);
1620 if (! value || value == error_mark_node)
1621 /* friend or constructor went bad. */
1624 /* Pass friendly classes back. */
1625 if (TREE_CODE (value) == VOID_TYPE)
1626 return void_type_node;
1628 if (DECL_NAME (value) != NULL_TREE
1629 && IDENTIFIER_POINTER (DECL_NAME (value))[0] == '_'
1630 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value)), "_vptr"))
1631 cp_error ("member `%D' conflicts with virtual function table field name",
1634 /* Stash away type declarations. */
1635 if (TREE_CODE (value) == TYPE_DECL)
1637 DECL_NONLOCAL (value) = 1;
1638 DECL_CONTEXT (value) = current_class_type;
1639 DECL_CLASS_CONTEXT (value) = current_class_type;
1641 /* Now that we've updated the context, we need to remangle the
1642 name for this TYPE_DECL. */
1643 DECL_ASSEMBLER_NAME (value) = DECL_NAME (value);
1644 if (!uses_template_parms (value))
1645 DECL_ASSEMBLER_NAME (value) =
1646 get_identifier (build_overload_name (TREE_TYPE (value), 1, 1));
1651 if (IS_SIGNATURE (current_class_type)
1652 && TREE_CODE (value) != FUNCTION_DECL)
1654 error ("field declaration not allowed in signature");
1655 return void_type_node;
1658 if (DECL_IN_AGGR_P (value))
1660 cp_error ("`%D' is already defined in `%T'", value,
1661 DECL_CONTEXT (value));
1662 return void_type_node;
1666 asmspec = TREE_STRING_POINTER (asmspec_tree);
1670 if (IS_SIGNATURE (current_class_type)
1671 && TREE_CODE (value) == FUNCTION_DECL)
1673 error ("function declarations cannot have initializers in signature");
1676 else if (TREE_CODE (value) == FUNCTION_DECL)
1678 grok_function_init (value, init);
1681 else if (pedantic && TREE_CODE (value) != VAR_DECL)
1682 /* Already complained in grokdeclarator. */
1686 /* We allow initializers to become parameters to base
1688 if (TREE_CODE (init) == TREE_LIST)
1690 if (TREE_CHAIN (init) == NULL_TREE)
1691 init = TREE_VALUE (init);
1693 init = digest_init (TREE_TYPE (value), init, (tree *)0);
1696 if (TREE_CODE (init) == CONST_DECL)
1697 init = DECL_INITIAL (init);
1698 else if (TREE_READONLY_DECL_P (init))
1699 init = decl_constant_value (init);
1700 else if (TREE_CODE (init) == CONSTRUCTOR)
1701 init = digest_init (TREE_TYPE (value), init, (tree *)0);
1702 my_friendly_assert (TREE_PERMANENT (init), 192);
1703 if (init == error_mark_node)
1704 /* We must make this look different than `error_mark_node'
1705 because `decl_const_value' would mis-interpret it
1706 as only meaning that this VAR_DECL is defined. */
1707 init = build1 (NOP_EXPR, TREE_TYPE (value), init);
1708 else if (processing_template_decl)
1710 else if (! TREE_CONSTANT (init))
1712 /* We can allow references to things that are effectively
1713 static, since references are initialized with the address. */
1714 if (TREE_CODE (TREE_TYPE (value)) != REFERENCE_TYPE
1715 || (TREE_STATIC (init) == 0
1716 && (TREE_CODE_CLASS (TREE_CODE (init)) != 'd'
1717 || DECL_EXTERNAL (init) == 0)))
1719 error ("field initializer is not constant");
1720 init = error_mark_node;
1726 /* The corresponding pop_obstacks is in cp_finish_decl. */
1727 push_obstacks_nochange ();
1729 if (processing_template_decl && ! current_function_decl
1730 && (TREE_CODE (value) == VAR_DECL || TREE_CODE (value) == FUNCTION_DECL))
1731 value = push_template_decl (value);
1734 cplus_decl_attributes (value, TREE_PURPOSE (attrlist),
1735 TREE_VALUE (attrlist));
1737 if (TREE_CODE (value) == VAR_DECL)
1739 finish_static_data_member_decl (value, init, asmspec_tree,
1740 /*need_pop=*/1, flags);
1743 if (TREE_CODE (value) == FIELD_DECL)
1747 /* This must override the asm specifier which was placed
1748 by grokclassfn. Lay this out fresh. */
1749 DECL_RTL (value) = NULL_RTX;
1750 DECL_ASSEMBLER_NAME (value) = get_identifier (asmspec);
1752 if (DECL_INITIAL (value) == error_mark_node)
1753 init = error_mark_node;
1754 cp_finish_decl (value, init, asmspec_tree, 1, flags);
1755 DECL_INITIAL (value) = init;
1756 DECL_IN_AGGR_P (value) = 1;
1759 if (TREE_CODE (value) == FUNCTION_DECL)
1763 /* This must override the asm specifier which was placed
1764 by grokclassfn. Lay this out fresh. */
1765 DECL_RTL (value) = NULL_RTX;
1766 DECL_ASSEMBLER_NAME (value) = get_identifier (asmspec);
1768 cp_finish_decl (value, init, asmspec_tree, 1, flags);
1770 /* Pass friends back this way. */
1771 if (DECL_FRIEND_P (value))
1772 return void_type_node;
1774 #if 0 /* Just because a fn is declared doesn't mean we'll try to define it. */
1775 if (current_function_decl && ! IS_SIGNATURE (current_class_type))
1776 cp_error ("method `%#D' of local class must be defined in class body",
1780 DECL_IN_AGGR_P (value) = 1;
1783 my_friendly_abort (21);
1788 /* Like `grokfield', but for bitfields.
1789 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
1792 grokbitfield (declarator, declspecs, width)
1793 tree declarator, declspecs, width;
1795 register tree value = grokdeclarator (declarator, declspecs, BITFIELD,
1798 if (! value) return NULL_TREE; /* friends went bad. */
1800 /* Pass friendly classes back. */
1801 if (TREE_CODE (value) == VOID_TYPE)
1802 return void_type_node;
1804 if (TREE_CODE (value) == TYPE_DECL)
1806 cp_error ("cannot declare `%D' to be a bitfield type", value);
1810 /* Usually, finish_struct_1 catches bitifields with invalid types.
1811 But, in the case of bitfields with function type, we confuse
1812 ourselves into thinking they are member functions, so we must
1814 if (TREE_CODE (value) == FUNCTION_DECL)
1816 cp_error ("cannot declare bitfield `%D' with funcion type",
1821 if (IS_SIGNATURE (current_class_type))
1823 error ("field declaration not allowed in signature");
1824 return void_type_node;
1827 if (DECL_IN_AGGR_P (value))
1829 cp_error ("`%D' is already defined in the class %T", value,
1830 DECL_CONTEXT (value));
1831 return void_type_node;
1834 GNU_xref_member (current_class_name, value);
1836 if (TREE_STATIC (value))
1838 cp_error ("static member `%D' cannot be a bitfield", value);
1841 cp_finish_decl (value, NULL_TREE, NULL_TREE, 0, 0);
1843 if (width != error_mark_node)
1845 constant_expression_warning (width);
1846 DECL_INITIAL (value) = width;
1847 SET_DECL_C_BIT_FIELD (value);
1850 DECL_IN_AGGR_P (value) = 1;
1855 grokoptypename (declspecs, declarator)
1856 tree declspecs, declarator;
1858 tree t = grokdeclarator (declarator, declspecs, TYPENAME, 0, NULL_TREE);
1859 return build_typename_overload (t);
1862 /* When a function is declared with an initializer,
1863 do the right thing. Currently, there are two possibilities:
1868 // initialization possibility #1.
1869 virtual void f () = 0;
1891 // initialization possibility #2
1898 copy_assignment_arg_p (parmtype, virtualp)
1900 int virtualp ATTRIBUTE_UNUSED;
1902 if (current_class_type == NULL_TREE)
1905 if (TREE_CODE (parmtype) == REFERENCE_TYPE)
1906 parmtype = TREE_TYPE (parmtype);
1908 if ((TYPE_MAIN_VARIANT (parmtype) == current_class_type)
1910 /* Non-standard hack to support old Booch components. */
1911 || (! virtualp && DERIVED_FROM_P (parmtype, current_class_type))
1920 grok_function_init (decl, init)
1924 /* An initializer for a function tells how this function should
1926 tree type = TREE_TYPE (decl);
1928 if (TREE_CODE (type) == FUNCTION_TYPE)
1929 cp_error ("initializer specified for non-member function `%D'", decl);
1931 /* We'll check for this in finish_struct_1. */
1932 else if (DECL_VINDEX (decl) == NULL_TREE)
1933 cp_error ("initializer specified for non-virtual method `%D'", decl);
1935 else if (integer_zerop (init))
1938 /* Mark this function as being "defined". */
1939 DECL_INITIAL (decl) = error_mark_node;
1940 /* pure virtual destructors must be defined. */
1941 /* pure virtual needs to be defined (as abort) only when put in
1942 vtbl. For wellformed call, it should be itself. pr4737 */
1943 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl)))
1945 extern tree abort_fndecl;
1946 /* Give this node rtl from `abort'. */
1947 DECL_RTL (decl) = DECL_RTL (abort_fndecl);
1950 DECL_ABSTRACT_VIRTUAL_P (decl) = 1;
1951 if (DECL_NAME (decl) == ansi_opname [(int) MODIFY_EXPR])
1954 = TREE_VALUE (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl))));
1956 if (copy_assignment_arg_p (parmtype, 1))
1957 TYPE_HAS_ABSTRACT_ASSIGN_REF (current_class_type) = 1;
1961 cp_error ("invalid initializer for virtual method `%D'", decl);
1965 cplus_decl_attributes (decl, attributes, prefix_attributes)
1966 tree decl, attributes, prefix_attributes;
1968 if (decl == NULL_TREE || decl == void_type_node)
1971 if (TREE_CODE (decl) == TEMPLATE_DECL)
1972 decl = DECL_TEMPLATE_RESULT (decl);
1974 decl_attributes (decl, attributes, prefix_attributes);
1976 if (TREE_CODE (decl) == TYPE_DECL)
1977 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (decl), TREE_TYPE (decl));
1980 /* CONSTRUCTOR_NAME:
1981 Return the name for the constructor (or destructor) for the
1982 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1983 IDENTIFIER_NODE. When given a template, this routine doesn't
1984 lose the specialization. */
1987 constructor_name_full (thing)
1990 if (TREE_CODE (thing) == TEMPLATE_TYPE_PARM
1991 || TREE_CODE (thing) == TEMPLATE_TEMPLATE_PARM
1992 || TREE_CODE (thing) == TYPENAME_TYPE)
1993 thing = TYPE_NAME (thing);
1994 else if (IS_AGGR_TYPE_CODE (TREE_CODE (thing)))
1996 if (TYPE_WAS_ANONYMOUS (thing) && TYPE_HAS_CONSTRUCTOR (thing))
1997 thing = DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (thing), 0)));
1999 thing = TYPE_NAME (thing);
2001 if (TREE_CODE (thing) == TYPE_DECL
2002 || (TREE_CODE (thing) == TEMPLATE_DECL
2003 && TREE_CODE (DECL_TEMPLATE_RESULT (thing)) == TYPE_DECL))
2004 thing = DECL_NAME (thing);
2005 my_friendly_assert (TREE_CODE (thing) == IDENTIFIER_NODE, 197);
2009 /* CONSTRUCTOR_NAME:
2010 Return the name for the constructor (or destructor) for the
2011 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
2012 IDENTIFIER_NODE. When given a template, return the plain
2013 unspecialized name. */
2016 constructor_name (thing)
2020 thing = constructor_name_full (thing);
2021 t = IDENTIFIER_TEMPLATE (thing);
2027 /* Cache the value of this class's main virtual function table pointer
2028 in a register variable. This will save one indirection if a
2029 more than one virtual function call is made this function. */
2034 extern tree base_init_expr;
2036 if (base_init_expr == 0
2037 && DECL_CONSTRUCTOR_P (current_function_decl))
2039 if (processing_template_decl)
2040 add_tree (build_min_nt
2042 current_member_init_list, current_base_init_list));
2044 emit_base_init (current_class_type, 0);
2048 /* Record the existence of an addressable inline function. */
2051 mark_inline_for_output (decl)
2054 decl = DECL_MAIN_VARIANT (decl);
2055 if (DECL_SAVED_INLINE (decl))
2057 my_friendly_assert (TREE_PERMANENT (decl), 363);
2058 DECL_SAVED_INLINE (decl) = 1;
2060 VARRAY_TREE_INIT (saved_inlines, 32, "saved_inlines");
2062 if (saved_inlines_used == saved_inlines->num_elements)
2063 VARRAY_GROW (saved_inlines,
2064 2 * saved_inlines->num_elements);
2065 VARRAY_TREE (saved_inlines, saved_inlines_used) = decl;
2066 ++saved_inlines_used;
2072 temp_name_counter = 0;
2075 /* Hand off a unique name which can be used for variable we don't really
2076 want to know about anyway, for example, the anonymous variables which
2077 are needed to make references work. Declare this thing so we can use it.
2078 The variable created will be of type TYPE.
2080 STATICP is nonzero if this variable should be static. */
2083 get_temp_name (type, staticp)
2087 char buf[sizeof (AUTO_TEMP_FORMAT) + 20];
2089 int toplev = toplevel_bindings_p ();
2091 push_obstacks_nochange ();
2092 if (toplev || staticp)
2094 end_temporary_allocation ();
2095 sprintf (buf, AUTO_TEMP_FORMAT, global_temp_name_counter++);
2096 decl = pushdecl_top_level (build_decl (VAR_DECL, get_identifier (buf), type));
2100 sprintf (buf, AUTO_TEMP_FORMAT, temp_name_counter++);
2101 decl = pushdecl (build_decl (VAR_DECL, get_identifier (buf), type));
2103 TREE_USED (decl) = 1;
2104 TREE_STATIC (decl) = staticp;
2105 DECL_ARTIFICIAL (decl) = 1;
2107 /* If this is a local variable, then lay out its rtl now.
2108 Otherwise, callers of this function are responsible for dealing
2109 with this variable's rtl. */
2113 expand_decl_init (decl);
2120 /* Get a variable which we can use for multiple assignments.
2121 It is not entered into current_binding_level, because
2122 that breaks things when it comes time to do final cleanups
2123 (which take place "outside" the binding contour of the function). */
2126 get_temp_regvar (type, init)
2131 decl = build_decl (VAR_DECL, NULL_TREE, type);
2132 TREE_USED (decl) = 1;
2133 DECL_REGISTER (decl) = 1;
2134 DECL_ARTIFICIAL (decl) = 1;
2136 DECL_RTL (decl) = assign_temp (type, 2, 0, 1);
2137 /* We can expand these without fear, since they cannot need
2138 constructors or destructors. */
2139 expand_expr (build_modify_expr (decl, INIT_EXPR, init),
2140 NULL_RTX, VOIDmode, 0);
2145 /* Hunts through the global anonymous union ANON_DECL, building
2146 appropriate VAR_DECLs. Stores cleanups on the list of ELEMS, and
2147 returns a VAR_DECL whose size is the same as the size of the
2148 ANON_DECL, if one is available. */
2151 build_anon_union_vars (anon_decl, elems, static_p, external_p)
2157 tree type = TREE_TYPE (anon_decl);
2158 tree main_decl = NULL_TREE;
2161 for (field = TYPE_FIELDS (type);
2163 field = TREE_CHAIN (field))
2167 if (DECL_ARTIFICIAL (field))
2169 if (TREE_CODE (field) != FIELD_DECL)
2171 cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members",
2176 if (TREE_PRIVATE (field))
2177 cp_pedwarn_at ("private member `%#D' in anonymous union", field);
2178 else if (TREE_PROTECTED (field))
2179 cp_pedwarn_at ("protected member `%#D' in anonymous union", field);
2181 if (DECL_NAME (field) == NULL_TREE
2182 && TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
2184 decl = build_anon_union_vars (field, elems, static_p, external_p);
2188 else if (DECL_NAME (field) == NULL_TREE)
2192 decl = build_decl (VAR_DECL, DECL_NAME (field), TREE_TYPE (field));
2193 /* tell `pushdecl' that this is not tentative. */
2194 DECL_INITIAL (decl) = error_mark_node;
2195 TREE_PUBLIC (decl) = 0;
2196 TREE_STATIC (decl) = static_p;
2197 DECL_EXTERNAL (decl) = external_p;
2198 decl = pushdecl (decl);
2199 DECL_INITIAL (decl) = NULL_TREE;
2202 /* Only write out one anon union element--choose the one that
2203 can hold them all. */
2204 if (main_decl == NULL_TREE
2205 && simple_cst_equal (DECL_SIZE (decl),
2206 DECL_SIZE (anon_decl)) == 1)
2209 /* ??? This causes there to be no debug info written out
2211 TREE_ASM_WRITTEN (decl) = 1;
2213 if (DECL_NAME (field) == NULL_TREE
2214 && TREE_CODE (TREE_TYPE (field)) == UNION_TYPE)
2215 /* The remainder of the processing was already done in the
2219 /* If there's a cleanup to do, it belongs in the
2220 TREE_PURPOSE of the following TREE_LIST. */
2221 *elems = scratch_tree_cons (NULL_TREE, decl, *elems);
2222 TREE_TYPE (*elems) = type;
2228 /* Finish off the processing of a UNION_TYPE structure.
2229 If there are static members, then all members are
2230 static, and must be laid out together. If the
2231 union is an anonymous union, we arrange for that
2232 as well. PUBLIC_P is nonzero if this union is
2233 not declared static. */
2236 finish_anon_union (anon_union_decl)
2237 tree anon_union_decl;
2239 tree type = TREE_TYPE (anon_union_decl);
2240 tree elems = NULL_TREE;
2242 int public_p = TREE_PUBLIC (anon_union_decl);
2243 int static_p = TREE_STATIC (anon_union_decl);
2244 int external_p = DECL_EXTERNAL (anon_union_decl);
2246 if (TYPE_FIELDS (type) == NULL_TREE)
2251 error ("global anonymous unions must be declared static");
2255 main_decl = build_anon_union_vars (anon_union_decl, &elems,
2256 static_p, external_p);
2258 if (main_decl == NULL_TREE)
2260 warning ("anonymous union with no members");
2266 make_decl_rtl (main_decl, 0, toplevel_bindings_p ());
2267 DECL_RTL (anon_union_decl) = DECL_RTL (main_decl);
2270 /* The following call assumes that there are never any cleanups
2271 for anonymous unions--a reasonable assumption. */
2272 expand_anon_union_decl (anon_union_decl, NULL_TREE, elems);
2275 /* Finish processing a builtin type TYPE. It's name is NAME,
2276 its fields are in the array FIELDS. LEN is the number of elements
2277 in FIELDS minus one, or put another way, it is the maximum subscript
2280 It is given the same alignment as ALIGN_TYPE. */
2283 finish_builtin_type (type, name, fields, len, align_type)
2292 TYPE_FIELDS (type) = fields[0];
2293 for (i = 0; i < len; i++)
2295 layout_type (TREE_TYPE (fields[i]));
2296 DECL_FIELD_CONTEXT (fields[i]) = type;
2297 TREE_CHAIN (fields[i]) = fields[i+1];
2299 DECL_FIELD_CONTEXT (fields[i]) = type;
2300 DECL_CLASS_CONTEXT (fields[i]) = type;
2301 TYPE_ALIGN (type) = TYPE_ALIGN (align_type);
2303 #if 0 /* not yet, should get fixed properly later */
2304 TYPE_NAME (type) = make_type_decl (get_identifier (name), type);
2306 TYPE_NAME (type) = build_decl (TYPE_DECL, get_identifier (name), type);
2308 TYPE_STUB_DECL (type) = TYPE_NAME (type);
2309 layout_decl (TYPE_NAME (type), 0);
2312 /* Auxiliary functions to make type signatures for
2313 `operator new' and `operator delete' correspond to
2314 what compiler will be expecting. */
2317 coerce_new_type (type)
2322 if (TREE_CODE (type) == METHOD_TYPE)
2323 type = build_function_type (TREE_TYPE (type), TREE_CHAIN (TYPE_ARG_TYPES (type)));
2324 if (! same_type_p (TREE_TYPE (type), ptr_type_node))
2325 e1 = 1, error ("`operator new' must return type `void *'");
2327 /* Technically the type must be `size_t', but we may not know
2329 if (TYPE_ARG_TYPES (type) == NULL_TREE)
2330 e1 = 1, error ("`operator new' takes type `size_t' parameter");
2331 else if (! same_type_p (TREE_VALUE (TYPE_ARG_TYPES (type)), sizetype))
2332 e2 = 1, error ("`operator new' takes type `size_t' as first parameter");
2334 type = build_function_type (ptr_type_node, tree_cons (NULL_TREE, sizetype, TREE_CHAIN (TYPE_ARG_TYPES (type))));
2336 type = build_function_type (ptr_type_node, TYPE_ARG_TYPES (type));
2341 coerce_delete_type (type)
2348 tree arg_types = TYPE_ARG_TYPES (type);
2350 if (TREE_CODE (type) == METHOD_TYPE)
2352 type = build_function_type (TREE_TYPE (type), TREE_CHAIN (arg_types));
2353 arg_types = TREE_CHAIN (arg_types);
2356 if (TREE_TYPE (type) != void_type_node)
2357 e1 = 1, error ("`operator delete' must return type `void'");
2359 if (arg_types == NULL_TREE
2360 || ! same_type_p (TREE_VALUE (arg_types), ptr_type_node))
2361 e2 = 1, error ("`operator delete' takes type `void *' as first parameter");
2365 && TREE_CHAIN (arg_types)
2366 && TREE_CHAIN (arg_types) != void_list_node)
2368 /* Again, technically this argument must be `size_t', but again
2369 we may not know what that is. */
2370 tree t2 = TREE_VALUE (TREE_CHAIN (arg_types));
2371 if (! same_type_p (t2, sizetype))
2372 e3 = 1, error ("second argument to `operator delete' must be of type `size_t'");
2373 else if (TREE_CHAIN (TREE_CHAIN (arg_types)) != void_list_node)
2376 if (TREE_CHAIN (TREE_CHAIN (arg_types)))
2377 error ("too many arguments in declaration of `operator delete'");
2379 error ("`...' invalid in specification of `operator delete'");
2384 arg_types = tree_cons (NULL_TREE, ptr_type_node,
2385 build_tree_list (NULL_TREE, sizetype));
2388 if (arg_types == NULL_TREE)
2389 arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
2391 arg_types = tree_cons (NULL_TREE, ptr_type_node, TREE_CHAIN (arg_types));
2397 arg_types = tree_cons (NULL_TREE, ptr_type_node,
2398 arg_types ? TREE_CHAIN (arg_types): NULL_TREE);
2400 type = build_function_type (void_type_node, arg_types);
2405 extern tree abort_fndecl;
2408 mark_vtable_entries (decl)
2411 tree entries = CONSTRUCTOR_ELTS (DECL_INITIAL (decl));
2413 for (; entries; entries = TREE_CHAIN (entries))
2418 fnaddr = (flag_vtable_thunks ? TREE_VALUE (entries)
2419 : FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (entries)));
2421 if (TREE_CODE (fnaddr) == NOP_EXPR)
2425 fn = TREE_OPERAND (fnaddr, 0);
2426 TREE_ADDRESSABLE (fn) = 1;
2427 if (DECL_LANG_SPECIFIC (fn) && DECL_ABSTRACT_VIRTUAL_P (fn))
2429 TREE_OPERAND (fnaddr, 0) = fn = copy_node (fn);
2430 DECL_RTL (fn) = DECL_RTL (abort_fndecl);
2431 mark_used (abort_fndecl);
2433 if (TREE_CODE (fn) == THUNK_DECL && DECL_EXTERNAL (fn))
2435 DECL_EXTERNAL (fn) = 0;
2442 /* Set DECL up to have the closest approximation of "initialized common"
2443 linkage available. */
2446 comdat_linkage (decl)
2450 make_decl_one_only (decl);
2451 else if (TREE_CODE (decl) == FUNCTION_DECL || DECL_VIRTUAL_P (decl))
2452 /* We can just emit functions and vtables statically; it doesn't really
2453 matter if we have multiple copies. */
2454 TREE_PUBLIC (decl) = 0;
2457 /* Static data member template instantiations, however, cannot
2458 have multiple copies. */
2459 if (DECL_INITIAL (decl) == 0
2460 || DECL_INITIAL (decl) == error_mark_node)
2461 DECL_COMMON (decl) = 1;
2462 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
2464 DECL_COMMON (decl) = 1;
2465 DECL_INITIAL (decl) = error_mark_node;
2469 /* We can't do anything useful; leave vars for explicit
2471 DECL_EXTERNAL (decl) = 1;
2472 DECL_NOT_REALLY_EXTERN (decl) = 0;
2476 if (DECL_LANG_SPECIFIC (decl))
2477 DECL_COMDAT (decl) = 1;
2480 /* For win32 we also want to put explicit instantiations in
2481 linkonce sections, so that they will be merged with implicit
2482 instantiations; otherwise we get duplicate symbol errors. */
2485 maybe_make_one_only (decl)
2488 /* This is not necessary on targets that support weak symbols, because
2489 the implicit instantiations will defer to the explicit one. */
2490 if (! supports_one_only () || SUPPORTS_WEAK)
2493 /* We can't set DECL_COMDAT on functions, or finish_file will think
2494 we can get away with not emitting them if they aren't used. We need
2495 to for variables so that cp_finish_decl will update their linkage,
2496 because their DECL_INITIAL may not have been set properly yet. */
2498 make_decl_one_only (decl);
2500 if (TREE_CODE (decl) == VAR_DECL && DECL_LANG_SPECIFIC (decl))
2501 DECL_COMDAT (decl) = 1;
2504 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
2505 based on TYPE and other static flags.
2507 Note that anything public is tagged TREE_PUBLIC, whether
2508 it's public in this file or in another one. */
2511 import_export_vtable (decl, type, final)
2515 if (DECL_INTERFACE_KNOWN (decl))
2518 if (TYPE_FOR_JAVA (type))
2520 TREE_PUBLIC (decl) = 1;
2521 DECL_EXTERNAL (decl) = 1;
2522 DECL_INTERFACE_KNOWN (decl) = 1;
2524 else if (CLASSTYPE_INTERFACE_KNOWN (type))
2526 TREE_PUBLIC (decl) = 1;
2527 DECL_EXTERNAL (decl) = ! CLASSTYPE_VTABLE_NEEDS_WRITING (type);
2528 DECL_INTERFACE_KNOWN (decl) = 1;
2532 /* We can only wait to decide if we have real non-inline virtual
2533 functions in our class, or if we come from a template. */
2535 int found = CLASSTYPE_TEMPLATE_INSTANTIATION (type);
2537 if (! found && ! final)
2540 for (method = TYPE_METHODS (type); method != NULL_TREE;
2541 method = TREE_CHAIN (method))
2542 if (DECL_VINDEX (method) != NULL_TREE
2543 && ! DECL_THIS_INLINE (method)
2544 && ! DECL_ABSTRACT_VIRTUAL_P (method))
2551 if (final || ! found)
2553 comdat_linkage (decl);
2554 DECL_EXTERNAL (decl) = 0;
2558 TREE_PUBLIC (decl) = 1;
2559 DECL_EXTERNAL (decl) = 1;
2564 /* Determine whether or not we want to specifically import or export CTYPE,
2565 using various heuristics. */
2568 import_export_class (ctype)
2571 /* -1 for imported, 1 for exported. */
2572 int import_export = 0;
2574 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
2577 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
2578 we will have CLASSTYPE_INTERFACE_ONLY set but not
2579 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
2580 heuristic because someone will supply a #pragma implementation
2581 elsewhere, and deducing it here would produce a conflict. */
2582 if (CLASSTYPE_INTERFACE_ONLY (ctype))
2585 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
2586 /* FIXME this should really use some sort of target-independent macro. */
2587 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype)))
2589 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype)))
2593 /* If we got -fno-implicit-templates, we import template classes that
2594 weren't explicitly instantiated. */
2595 if (import_export == 0
2596 && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype)
2597 && ! flag_implicit_templates)
2600 /* Base our import/export status on that of the first non-inline,
2601 non-abstract virtual function, if any. */
2602 if (import_export == 0
2603 && TYPE_VIRTUAL_P (ctype)
2604 && ! CLASSTYPE_TEMPLATE_INSTANTIATION (ctype))
2607 for (method = TYPE_METHODS (ctype); method != NULL_TREE;
2608 method = TREE_CHAIN (method))
2610 if (DECL_VINDEX (method) != NULL_TREE
2611 && !DECL_THIS_INLINE (method)
2612 && !DECL_ABSTRACT_VIRTUAL_P (method))
2614 import_export = (DECL_REALLY_EXTERN (method) ? -1 : 1);
2620 #ifdef MULTIPLE_SYMBOL_SPACES
2621 if (import_export == -1)
2627 SET_CLASSTYPE_INTERFACE_KNOWN (ctype);
2628 CLASSTYPE_VTABLE_NEEDS_WRITING (ctype) = (import_export > 0);
2629 CLASSTYPE_INTERFACE_ONLY (ctype) = (import_export < 0);
2633 /* We need to describe to the assembler the relationship between
2634 a vtable and the vtable of the parent class. */
2637 output_vtable_inherit (vars)
2643 op[0] = XEXP (DECL_RTL (vars), 0); /* strip the mem ref */
2645 parent = binfo_for_vtable (vars);
2647 if (parent == TYPE_BINFO (DECL_CONTEXT (vars)))
2651 parent = TYPE_BINFO_VTABLE (BINFO_TYPE (parent));
2652 op[1] = XEXP (DECL_RTL (parent), 0); /* strip the mem ref */
2655 my_friendly_abort (980826);
2657 output_asm_insn (".vtable_inherit %c0, %c1", op);
2661 finish_vtable_vardecl (t, data)
2663 void *data ATTRIBUTE_UNUSED;
2666 tree ctype = DECL_CONTEXT (vars);
2667 import_export_class (ctype);
2668 import_export_vtable (vars, ctype, 1);
2670 if (! DECL_EXTERNAL (vars)
2671 && (DECL_INTERFACE_KNOWN (vars)
2672 || TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (vars))
2673 || (hack_decl_function_context (vars) && TREE_USED (vars)))
2674 && ! TREE_ASM_WRITTEN (vars))
2677 mark_vtable_entries (vars);
2678 if (TREE_TYPE (DECL_INITIAL (vars)) == 0)
2679 store_init_value (vars, DECL_INITIAL (vars));
2681 if (write_symbols == DWARF_DEBUG || write_symbols == DWARF2_DEBUG)
2683 /* Mark the VAR_DECL node representing the vtable itself as a
2684 "gratuitous" one, thereby forcing dwarfout.c to ignore it.
2685 It is rather important that such things be ignored because
2686 any effort to actually generate DWARF for them will run
2687 into trouble when/if we encounter code like:
2690 struct S { virtual void member (); };
2692 because the artificial declaration of the vtable itself (as
2693 manufactured by the g++ front end) will say that the vtable
2694 is a static member of `S' but only *after* the debug output
2695 for the definition of `S' has already been output. This causes
2696 grief because the DWARF entry for the definition of the vtable
2697 will try to refer back to an earlier *declaration* of the
2698 vtable as a static member of `S' and there won't be one.
2699 We might be able to arrange to have the "vtable static member"
2700 attached to the member list for `S' before the debug info for
2701 `S' get written (which would solve the problem) but that would
2702 require more intrusive changes to the g++ front end. */
2704 DECL_IGNORED_P (vars) = 1;
2707 /* Always make vtables weak. */
2709 comdat_linkage (vars);
2711 rest_of_decl_compilation (vars, NULL_PTR, 1, 1);
2714 output_vtable_inherit (vars);
2718 else if (! TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (vars)))
2719 /* We don't know what to do with this one yet. */
2722 *t = TREE_CHAIN (vars);
2727 prune_vtable_vardecl (t, data)
2729 void *data ATTRIBUTE_UNUSED;
2731 *t = TREE_CHAIN (*t);
2736 finish_sigtable_vardecl (t, data)
2738 void *data ATTRIBUTE_UNUSED;
2740 /* We don't need to mark sigtable entries as addressable here as is done
2741 for vtables. Since sigtables, unlike vtables, are always written out,
2742 that was already done in build_signature_table_constructor. */
2744 rest_of_decl_compilation (*t, NULL_PTR, 1, 1);
2745 *t = TREE_CHAIN (*t);
2749 /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an
2750 inline function or template instantiation at end-of-file. */
2753 import_export_decl (decl)
2756 if (DECL_INTERFACE_KNOWN (decl))
2759 if (DECL_TEMPLATE_INSTANTIATION (decl)
2760 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
2762 DECL_NOT_REALLY_EXTERN (decl) = 1;
2763 if ((DECL_IMPLICIT_INSTANTIATION (decl)
2764 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
2765 && (flag_implicit_templates
2766 || (flag_implicit_inline_templates && DECL_THIS_INLINE (decl))))
2768 if (!TREE_PUBLIC (decl))
2769 /* Templates are allowed to have internal linkage. See
2773 comdat_linkage (decl);
2776 DECL_NOT_REALLY_EXTERN (decl) = 0;
2778 else if (DECL_FUNCTION_MEMBER_P (decl))
2780 tree ctype = DECL_CLASS_CONTEXT (decl);
2781 import_export_class (ctype);
2782 if (CLASSTYPE_INTERFACE_KNOWN (ctype)
2783 && (! DECL_ARTIFICIAL (decl) || DECL_VINDEX (decl)))
2785 DECL_NOT_REALLY_EXTERN (decl)
2786 = ! (CLASSTYPE_INTERFACE_ONLY (ctype)
2787 || (DECL_THIS_INLINE (decl) && ! flag_implement_inlines
2788 && !DECL_VINDEX (decl)));
2790 /* Always make artificials weak. */
2791 if (DECL_ARTIFICIAL (decl) && flag_weak)
2792 comdat_linkage (decl);
2794 maybe_make_one_only (decl);
2797 comdat_linkage (decl);
2799 else if (DECL_TINFO_FN_P (decl))
2801 tree ctype = TREE_TYPE (DECL_NAME (decl));
2803 if (IS_AGGR_TYPE (ctype))
2804 import_export_class (ctype);
2806 if (IS_AGGR_TYPE (ctype) && CLASSTYPE_INTERFACE_KNOWN (ctype)
2807 && TYPE_VIRTUAL_P (ctype)
2808 /* If the type is a cv-qualified variant of a type, then we
2809 must emit the tinfo function in this translation unit
2810 since it will not be emitted when the vtable for the type
2811 is output (which is when the unqualified version is
2813 && same_type_p (ctype, TYPE_MAIN_VARIANT (ctype)))
2815 DECL_NOT_REALLY_EXTERN (decl)
2816 = ! (CLASSTYPE_INTERFACE_ONLY (ctype)
2817 || (DECL_THIS_INLINE (decl) && ! flag_implement_inlines
2818 && !DECL_VINDEX (decl)));
2820 /* Always make artificials weak. */
2822 comdat_linkage (decl);
2824 else if (TYPE_BUILT_IN (ctype)
2825 && same_type_p (ctype, TYPE_MAIN_VARIANT (ctype)))
2826 DECL_NOT_REALLY_EXTERN (decl) = 0;
2828 comdat_linkage (decl);
2831 comdat_linkage (decl);
2833 DECL_INTERFACE_KNOWN (decl) = 1;
2837 build_cleanup (decl)
2841 tree type = TREE_TYPE (decl);
2843 if (TREE_CODE (type) == ARRAY_TYPE)
2847 mark_addressable (decl);
2848 temp = build1 (ADDR_EXPR, build_pointer_type (type), decl);
2850 temp = build_delete (TREE_TYPE (temp), temp,
2852 LOOKUP_NORMAL|LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
2856 extern int parse_time, varconst_time;
2862 tree sname = get_id_2 ("__sn", base);
2863 /* For struct X foo __attribute__((weak)), there is a counter
2864 __snfoo. Since base is already an assembler name, sname should
2865 be globally unique */
2866 tree sentry = IDENTIFIER_GLOBAL_VALUE (sname);
2869 push_obstacks_nochange ();
2870 end_temporary_allocation ();
2871 sentry = build_decl (VAR_DECL, sname, integer_type_node);
2872 TREE_PUBLIC (sentry) = 1;
2873 DECL_ARTIFICIAL (sentry) = 1;
2874 TREE_STATIC (sentry) = 1;
2875 TREE_USED (sentry) = 1;
2876 DECL_COMMON (sentry) = 1;
2877 pushdecl_top_level (sentry);
2878 cp_finish_decl (sentry, NULL_TREE, NULL_TREE, 0, 0);
2884 /* Start the process of running a particular set of global constructors
2885 or destructors. Subroutine of do_[cd]tors. */
2888 start_objects (method_type, initp)
2889 int method_type, initp;
2894 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
2896 if (initp != DEFAULT_INIT_PRIORITY)
2906 sprintf (type, "%c%c%.5u", method_type, joiner, initp);
2909 sprintf (type, "%c", method_type);
2911 fnname = get_file_function_name_long (type);
2913 start_function (void_list_node,
2914 make_call_declarator (fnname, void_list_node, NULL_TREE,
2918 #if defined(ASM_OUTPUT_CONSTRUCTOR) && defined(ASM_OUTPUT_DESTRUCTOR)
2919 /* It can be a static function as long as collect2 does not have
2920 to scan the object file to find its ctor/dtor routine. */
2921 TREE_PUBLIC (current_function_decl) = 0;
2924 store_parm_decls ();
2928 expand_start_bindings (0);
2930 /* We cannot allow these functions to be elided, even if they do not
2931 have external linkage. And, there's no point in deferring
2932 copmilation of thes functions; they're all going to have to be
2934 current_function_cannot_inline
2935 = "static constructors and destructors cannot be inlined";
2938 /* Finish the process of running a particular set of global constructors
2939 or destructors. Subroutine of do_[cd]tors. */
2942 finish_objects (method_type, initp)
2943 int method_type, initp;
2945 char *fnname = XSTR (XEXP (DECL_RTL (current_function_decl), 0), 0);
2948 expand_end_bindings (getdecls (), 1, 0);
2951 finish_function (lineno, 0, 0);
2953 if (initp == DEFAULT_INIT_PRIORITY)
2955 if (method_type == 'I')
2956 assemble_constructor (fnname);
2958 assemble_destructor (fnname);
2961 #if defined (ASM_OUTPUT_SECTION_NAME) && defined (ASM_OUTPUT_CONSTRUCTOR)
2962 /* If we're using init priority we can't use assemble_*tor, but on ELF
2963 targets we can stick the references into named sections for GNU ld
2968 sprintf (buf, ".%ctors.%.5u", method_type == 'I' ? 'c' : 'd',
2969 /* invert the numbering so the linker puts us in the proper
2970 order; constructors are run from right to left, and the
2971 linker sorts in increasing order. */
2972 MAX_INIT_PRIORITY - initp);
2973 named_section (NULL_TREE, buf, 0);
2974 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, fnname),
2975 POINTER_SIZE / BITS_PER_UNIT, 1);
2980 /* The names of the parameters to the function created to handle
2981 initializations and destructions for objects with static storage
2983 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
2984 #define PRIORITY_IDENTIFIER "__priority"
2986 /* The name of the function we create to handle initializations and
2987 destructions for objects with static storage duration. */
2988 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
2990 /* The declaration for the __INITIALIZE_P argument. */
2991 static tree initialize_p_decl;
2993 /* The declaration for the __PRIORITY argument. */
2994 static tree priority_decl;
2996 /* The declaration for the static storage duration function. */
2997 static tree ssdf_decl;
2999 /* All the static storage duration functions created in this
3000 translation unit. */
3001 static varray_type ssdf_decls;
3002 static size_t ssdf_decls_used;
3004 /* A map from priority levels to information about that priority
3005 level. There may be many such levels, so efficient lookup is
3007 static splay_tree priority_info_map;
3009 /* Begins the generation of the function that will handle all
3010 initialization and destruction of objects with static storage
3011 duration. The function generated takes two parameters of type
3012 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
3013 non-zero, it performs initializations. Otherwise, it performs
3014 destructions. It only performs those initializations or
3015 destructions with the indicated __PRIORITY. The generated function
3018 It is assumed that this function will only be called once per
3019 translation unit. */
3022 start_static_storage_duration_function ()
3024 static unsigned ssdf_number;
3028 char id[sizeof (SSDF_IDENTIFIER) + 1 /* '\0' */ + 32];
3030 /* Create the identifier for this function. It will be of the form
3031 SSDF_IDENTIFIER_<number>. */
3032 sprintf (id, "%s_%u", SSDF_IDENTIFIER, ssdf_number++);
3033 if (ssdf_number == 0)
3035 /* Overflow occurred. That means there are at least 4 billion
3036 initialization functions. */
3037 sorry ("too many initialization functions required");
3038 my_friendly_abort (19990430);
3041 /* Create the parameters. */
3042 parm_types = void_list_node;
3043 parm_types = perm_tree_cons (NULL_TREE, integer_type_node, parm_types);
3044 parm_types = perm_tree_cons (NULL_TREE, integer_type_node, parm_types);
3045 type = build_function_type (void_type_node, parm_types);
3047 /* Create the FUNCTION_DECL itself. */
3048 ssdf_decl = build_lang_decl (FUNCTION_DECL,
3049 get_identifier (id),
3051 TREE_PUBLIC (ssdf_decl) = 0;
3052 DECL_ARTIFICIAL (ssdf_decl) = 1;
3054 /* Put this function in the list of functions to be called from the
3055 static constructors and destructors. */
3058 VARRAY_TREE_INIT (ssdf_decls, 32, "ssdf_decls");
3060 /* Take this opportunity to initialize the map from priority
3061 numbers to information about that priority level. */
3062 priority_info_map = splay_tree_new (splay_tree_compare_ints,
3063 /*delete_key_fn=*/0,
3064 /*delete_value_fn=*/
3065 (splay_tree_delete_value_fn) &free);
3067 /* We always need to generate functions for the
3068 DEFAULT_INIT_PRIORITY so enter it now. That way when we walk
3069 priorities later, we'll be sure to find the
3070 DEFAULT_INIT_PRIORITY. */
3071 get_priority_info (DEFAULT_INIT_PRIORITY);
3074 if (ssdf_decls_used == ssdf_decls->num_elements)
3075 VARRAY_GROW (ssdf_decls, 2 * ssdf_decls_used);
3076 VARRAY_TREE (ssdf_decls, ssdf_decls_used) = ssdf_decl;
3079 /* Create the argument list. */
3080 initialize_p_decl = build_decl (PARM_DECL,
3081 get_identifier (INITIALIZE_P_IDENTIFIER),
3083 DECL_CONTEXT (initialize_p_decl) = ssdf_decl;
3084 DECL_ARG_TYPE (initialize_p_decl) = integer_type_node;
3085 TREE_USED (initialize_p_decl) = 1;
3086 priority_decl = build_decl (PARM_DECL, get_identifier (PRIORITY_IDENTIFIER),
3088 DECL_CONTEXT (priority_decl) = ssdf_decl;
3089 DECL_ARG_TYPE (priority_decl) = integer_type_node;
3090 TREE_USED (priority_decl) = 1;
3092 TREE_CHAIN (initialize_p_decl) = priority_decl;
3093 DECL_ARGUMENTS (ssdf_decl) = initialize_p_decl;
3095 /* Start the function itself. This is equivalent to declarating the
3098 static void __ssdf (int __initialize_p, init __priority_p);
3100 It is static because we only need to call this function from the
3101 various constructor and destructor functions for this module. */
3102 start_function (/*specs=*/NULL_TREE,
3104 /*attrs=*/NULL_TREE,
3105 /*pre_parsed_p=*/1);
3107 /* Set up the scope of the outermost block in the function. */
3108 store_parm_decls ();
3112 expand_start_bindings (0);
3114 /* This function must not be deferred because we are depending on
3115 its compilation to tell us what is TREE_SYMBOL_REFERENCED. */
3116 current_function_cannot_inline
3117 = "static storage duration functions cannot be inlined";
3120 /* Generate the initialization code for the priority indicated in N. */
3123 generate_inits_for_priority (n, data)
3125 void *data ATTRIBUTE_UNUSED;
3127 int priority = (int) n->key;
3128 priority_info pi = (priority_info) n->value;
3130 /* For each priority N which has been used generate code which looks
3133 if (__priority == N) {
3140 We use the sequences we've accumulated to fill in the `...'s. */
3141 expand_start_cond (build_binary_op (EQ_EXPR,
3143 build_int_2 (priority, 0)),
3146 /* Do the initializations. */
3147 expand_start_cond (build_binary_op (NE_EXPR,
3151 if (pi->initialization_sequence)
3155 push_to_sequence (pi->initialization_sequence);
3156 insns = gen_sequence ();
3160 pi->initialization_sequence = NULL_RTX;
3161 pi->initializations_p = 1;
3164 /* Do the destructions. */
3165 expand_start_else ();
3166 if (pi->destruction_sequence)
3170 push_to_sequence (pi->destruction_sequence);
3171 insns = gen_sequence ();
3175 pi->destruction_sequence = NULL_RTX;
3176 pi->destructions_p = 1;
3179 /* Close out the conditionals. */
3183 /* Don't stop iterating. */
3187 /* Finish the generation of the function which performs initialization
3188 and destruction of objects with static storage duration. After
3189 this point, no more such objects can be created. */
3192 finish_static_storage_duration_function ()
3194 splay_tree_foreach (priority_info_map,
3195 generate_inits_for_priority,
3198 /* Close out the function. */
3199 expand_end_bindings (getdecls (), 1, 0);
3202 finish_function (lineno, 0, 0);
3205 /* Return the information about the indicated PRIORITY level. If no
3206 code to handle this level has yet been generated, generate the
3207 appropriate prologue. */
3209 static priority_info
3210 get_priority_info (priority)
3216 n = splay_tree_lookup (priority_info_map,
3217 (splay_tree_key) priority);
3220 /* Create a new priority information structure, and insert it
3222 pi = (priority_info) xmalloc (sizeof (struct priority_info_s));
3223 pi->initialization_sequence = NULL_RTX;
3224 pi->destruction_sequence = NULL_RTX;
3225 pi->initializations_p = 0;
3226 pi->destructions_p = 0;
3227 splay_tree_insert (priority_info_map,
3228 (splay_tree_key) priority,
3229 (splay_tree_value) pi);
3232 pi = (priority_info) n->value;
3237 /* Generate code to do the static initialization of DECL. The
3238 initialization is INIT. If DECL may be initialized more than once
3239 in different object files, SENTRY is the guard variable to
3240 check. PRIORITY is the priority for the initialization. */
3243 do_static_initialization (decl, init, sentry, priority)
3251 /* Get the priority information for this PRIORITY, */
3252 pi = get_priority_info (priority);
3253 if (!pi->initialization_sequence)
3256 push_to_sequence (pi->initialization_sequence);
3258 /* Tell the debugger that we are at the location of the static
3259 variable in question. */
3260 emit_note (input_filename, lineno);
3262 /* If there's a SENTRY, we only do the initialization if it is
3263 zero, i.e., if we are the first to initialize it. */
3265 expand_start_cond (build_binary_op (EQ_EXPR,
3266 build_unary_op (PREINCREMENT_EXPR,
3272 /* Prepare a binding level for temporaries created during the
3274 expand_start_target_temps ();
3276 if (IS_AGGR_TYPE (TREE_TYPE (decl))
3277 || TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
3278 expand_aggr_init (decl, init, 0);
3279 else if (TREE_CODE (init) == TREE_VEC)
3280 expand_expr (expand_vec_init (decl, TREE_VEC_ELT (init, 0),
3281 TREE_VEC_ELT (init, 1),
3282 TREE_VEC_ELT (init, 2), 0),
3283 const0_rtx, VOIDmode, EXPAND_NORMAL);
3285 expand_assignment (decl, init, 0, 0);
3287 /* The expression might have involved increments and decrements. */
3290 /* Cleanup any temporaries needed for the initial value. */
3291 expand_end_target_temps ();
3293 /* Cleanup any deferred pops from function calls. This would be done
3294 by expand_end_cond, but we also need it when !SENTRY, since we are
3295 constructing these sequences by parts. */
3296 do_pending_stack_adjust ();
3298 /* Close the conditional opened above. */
3302 /* Save the sequence for later use. */
3303 pi->initialization_sequence = get_insns ();
3307 /* Generate code to do the static destruction of DECL. If DECL may be
3308 initialized more than once in different object files, SENTRY is the
3309 guard variable to check. PRIORITY is the priority for the
3313 do_static_destruction (decl, sentry, priority)
3321 /* If we don't need a destructor, there's nothing to do. */
3322 if (!TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl)))
3325 /* Get the priority information for this PRIORITY, */
3326 pi = get_priority_info (priority);
3327 if (!pi->destruction_sequence)
3330 push_to_sequence (pi->destruction_sequence);
3332 /* Start a new sequence to handle just this destruction. */
3335 /* Tell the debugger that we are at the location of the static
3336 variable in question. */
3337 emit_note (input_filename, lineno);
3339 /* If there's a SENTRY, we only do the destruction if it is one,
3340 i.e., if we are the last to destroy it. */
3342 expand_start_cond (build_binary_op (EQ_EXPR,
3343 build_unary_op (PREDECREMENT_EXPR,
3349 /* Actually to the destruction. */
3350 expand_expr_stmt (build_cleanup (decl));
3352 /* Cleanup any deferred pops from function calls. This would be done
3353 by expand_end_cond, but we also need it when !SENTRY, since we are
3354 constructing these sequences by parts. */
3355 do_pending_stack_adjust ();
3357 /* Close the conditional opened above. */
3361 /* Insert the NEW_INSNS before the current insns. (Destructions are
3362 run in reverse order of initializations.) */
3363 new_insns = gen_sequence ();
3365 if (pi->destruction_sequence)
3366 emit_insn_before (new_insns, pi->destruction_sequence);
3368 emit_insn (new_insns);
3370 /* Save the sequence for later use. */
3371 pi->destruction_sequence = get_insns ();
3375 /* Add code to the static storage duration function that will handle
3376 DECL (a static variable that needs initializing and/or destruction)
3377 with the indicated PRIORITY. If DECL needs initializing, INIT is
3381 do_static_initialization_and_destruction (decl, init)
3385 tree sentry = NULL_TREE;
3388 /* Deal gracefully with error. */
3389 if (decl == error_mark_node)
3392 /* The only things that can be initialized are variables. */
3393 my_friendly_assert (TREE_CODE (decl) == VAR_DECL, 19990420);
3395 /* If this object is not defined, we don't need to do anything
3397 if (DECL_EXTERNAL (decl))
3400 /* Also, if the initializer already contains errors, we can bail out
3402 if (init && TREE_CODE (init) == TREE_LIST
3403 && value_member (error_mark_node, init))
3406 /* Trick the compiler into thinking we are at the file and line
3407 where DECL was declared so that error-messages make sense, and so
3408 that the debugger will show somewhat sensible file and line
3410 input_filename = DECL_SOURCE_FILE (decl);
3411 lineno = DECL_SOURCE_LINE (decl);
3417 Access control for implicit calls to the constructors,
3418 the conversion functions, or the destructor called to
3419 create and destroy a static data member is performed as
3420 if these calls appeared in the scope of the member's
3423 we pretend we are in a static member function of the class of
3424 which the DECL is a member. */
3425 if (member_p (decl))
3427 DECL_CLASS_CONTEXT (current_function_decl) = DECL_CONTEXT (decl);
3428 DECL_STATIC_FUNCTION_P (current_function_decl) = 1;
3431 /* We need a sentry if this is an object with external linkage that
3432 might be initialized in more than one place. */
3433 if (TREE_PUBLIC (decl) && (DECL_COMMON (decl)
3434 || DECL_ONE_ONLY (decl)
3435 || DECL_WEAK (decl)))
3436 sentry = get_sentry (DECL_ASSEMBLER_NAME (decl));
3438 /* Generate the code to actually do the intialization and
3440 priority = DECL_INIT_PRIORITY (decl);
3442 priority = DEFAULT_INIT_PRIORITY;
3443 do_static_initialization (decl, init, sentry, priority);
3444 do_static_destruction (decl, sentry, priority);
3446 /* Now that we're done with DECL we don't need to pretend to be a
3447 member of its class any longer. */
3448 DECL_CLASS_CONTEXT (current_function_decl) = NULL_TREE;
3449 DECL_STATIC_FUNCTION_P (current_function_decl) = 0;
3452 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
3453 (otherwise) that will initialize all gobal objects with static
3454 storage duration having the indicated PRIORITY. */
3457 generate_ctor_or_dtor_function (constructor_p, priority)
3465 /* We use `I' to indicate initialization and `D' to indicate
3472 /* Begin the function. */
3473 start_objects (function_key, priority);
3475 /* Call the static storage duration function with appropriate
3477 for (i = 0; i < ssdf_decls_used; ++i)
3479 arguments = tree_cons (NULL_TREE, build_int_2 (priority, 0),
3481 arguments = tree_cons (NULL_TREE, build_int_2 (constructor_p, 0),
3483 expand_expr_stmt (build_function_call (VARRAY_TREE (ssdf_decls, i),
3487 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
3488 calls to any functions marked with attributes indicating that
3489 they should be called at initialization- or destruction-time. */
3490 if (priority == DEFAULT_INIT_PRIORITY)
3494 for (fns = constructor_p ? static_ctors : static_dtors;
3496 fns = TREE_CHAIN (fns))
3497 expand_expr_stmt (build_function_call (TREE_VALUE (fns), NULL_TREE));
3500 /* Close out the function. */
3501 finish_objects (function_key, priority);
3504 /* Generate constructor and destructor functions for the priority
3508 generate_ctor_and_dtor_functions_for_priority (n, data)
3510 void *data ATTRIBUTE_UNUSED;
3512 int priority = (int) n->key;
3513 priority_info pi = (priority_info) n->value;
3515 /* Generate the functions themselves, but only if they are really
3517 if (pi->initializations_p
3518 || (priority == DEFAULT_INIT_PRIORITY && static_ctors))
3519 generate_ctor_or_dtor_function (/*constructor_p=*/1,
3521 if (pi->destructions_p
3522 || (priority == DEFAULT_INIT_PRIORITY && static_dtors))
3523 generate_ctor_or_dtor_function (/*constructor_p=*/0,
3526 /* Keep iterating. */
3530 /* This routine is called from the last rule in yyparse ().
3531 Its job is to create all the code needed to initialize and
3532 destroy the global aggregates. We do the destruction
3533 first, since that way we only need to reverse the decls once. */
3539 int start_time, this_time;
3546 /* Bad parse errors. Just forget about it. */
3547 if (! global_bindings_p () || current_class_type || decl_namespace_list)
3550 start_time = get_run_time ();
3552 /* Otherwise, GDB can get confused, because in only knows
3553 about source for LINENO-1 lines. */
3556 interface_unknown = 1;
3559 /* We now have to write out all the stuff we put off writing out.
3562 o Template specializations that we have not yet instantiated,
3563 but which are needed.
3564 o Initialization and destruction for non-local objects with
3565 static storage duration. (Local objects with static storage
3566 duration are initialized when their scope is first entered,
3567 and are cleaned up via atexit.)
3568 o Virtual function tables.
3570 All of these may cause others to be needed. For example,
3571 instantiating one function may cause another to be needed, and
3572 generating the intiailzer for an object may cause templates to be
3573 instantiated, etc., etc. */
3575 this_time = get_run_time ();
3576 parse_time -= this_time - start_time;
3577 varconst_time += this_time - start_time;
3578 start_time = get_run_time ();
3579 permanent_allocation (1);
3583 /* Non-zero if we need a static storage duration function on
3584 this iteration through the loop. */
3585 int need_ssdf_p = 0;
3589 /* If there are templates that we've put off instantiating, do
3591 instantiate_pending_templates ();
3593 /* Write out signature-tables and virtual tables as required.
3594 Note that writing out the virtual table for a template class
3595 may cause the instantiation of members of that class. */
3596 if (flag_handle_signatures
3597 && walk_globals (sigtable_decl_p,
3598 finish_sigtable_vardecl,
3601 if (walk_globals (vtable_decl_p,
3602 finish_vtable_vardecl,
3606 /* The list of objects with static storage duration is built up
3607 in reverse order, so we reverse it here. We also clear
3608 STATIC_AGGREGATES so that any new aggregates added during the
3609 initialization of these will be initialized in the correct
3610 order when we next come around the loop. */
3611 vars = nreverse (static_aggregates);
3612 static_aggregates = NULL_TREE;
3615 if (! TREE_ASM_WRITTEN (TREE_VALUE (vars)))
3616 rest_of_decl_compilation (TREE_VALUE (vars), 0, 1, 1);
3619 /* We need to start a new initialization function each
3620 time through the loop. That's because we need to
3621 know which vtables have been referenced, and
3622 TREE_SYMBOL_REFERENCED isn't computed until a
3623 function is finished, and written out. That's a
3624 deficiency in the back-end. When this is fixed,
3625 these initialization functions could all become
3626 inline, with resulting performance improvements. */
3627 start_static_storage_duration_function ();
3631 do_static_initialization_and_destruction (TREE_VALUE (vars),
3632 TREE_PURPOSE (vars));
3634 vars = TREE_CHAIN (vars);
3637 /* Finish up the static storage duration function for this
3640 finish_static_storage_duration_function ();
3642 /* Go through the various inline functions, and see if any need
3644 for (i = 0; i < saved_inlines_used; ++i)
3646 tree decl = VARRAY_TREE (saved_inlines, i);
3647 import_export_decl (decl);
3648 if (DECL_ARTIFICIAL (decl) && ! DECL_INITIAL (decl)
3650 && (! DECL_REALLY_EXTERN (decl) || DECL_INLINE (decl)))
3652 /* Even though we're already at the top-level, we push
3653 there again. That way, when we pop back a few lines
3654 hence, all of our state is restored. Otherwise,
3655 finish_function doesn't clean things up, and we end
3656 up with CURRENT_FUNCTION_DECL set. */
3657 push_to_top_level ();
3658 if (DECL_TINFO_FN_P (decl))
3659 synthesize_tinfo_fn (decl);
3661 synthesize_method (decl);
3662 pop_from_top_level ();
3667 /* Mark all functions that might deal with exception-handling as
3669 mark_all_runtime_matches ();
3671 /* We lie to the back-end, pretending that some functions are
3672 not defined when they really are. This keeps these functions
3673 from being put out unncessarily. But, we must stop lying
3674 when the functions are referenced, or if they are not comdat
3675 since they need to be put out now. */
3676 for (i = 0; i < saved_inlines_used; ++i)
3678 tree decl = VARRAY_TREE (saved_inlines, i);
3680 if (DECL_NOT_REALLY_EXTERN (decl)
3681 && DECL_INITIAL (decl)
3682 && (TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl))
3683 || !DECL_COMDAT (decl)))
3684 DECL_EXTERNAL (decl) = 0;
3687 if (saved_inlines_used
3688 && wrapup_global_declarations (&VARRAY_TREE (saved_inlines, 0),
3689 saved_inlines_used))
3691 if (walk_namespaces (wrapup_globals_for_namespace, /*data=*/0))
3694 /* Static data members are just like namespace-scope globals. */
3695 for (i = 0; i < pending_statics_used; ++i)
3697 tree decl = VARRAY_TREE (pending_statics, i);
3698 if (TREE_ASM_WRITTEN (decl))
3700 import_export_decl (decl);
3701 if (DECL_NOT_REALLY_EXTERN (decl) && ! DECL_IN_AGGR_P (decl))
3702 DECL_EXTERNAL (decl) = 0;
3705 && wrapup_global_declarations (&VARRAY_TREE (pending_statics, 0),
3706 pending_statics_used))
3711 /* We give C linkage to static constructors and destructors. */
3712 push_lang_context (lang_name_c);
3714 /* Generate initialization and destruction functions for all
3715 priorities for which they are required. */
3716 if (priority_info_map)
3717 splay_tree_foreach (priority_info_map,
3718 generate_ctor_and_dtor_functions_for_priority,
3721 /* We're done with the splay-tree now. */
3722 if (priority_info_map)
3723 splay_tree_delete (priority_info_map);
3725 /* We're done with static constructors, so we can go back to "C++"
3727 pop_lang_context ();
3729 /* Now delete from the chain of variables all virtual function tables.
3730 We output them all ourselves, because each will be treated
3732 walk_globals (vtable_decl_p, prune_vtable_vardecl, /*data=*/0);
3734 /* Now, issue warnings about static, but not defined, functions,
3736 walk_namespaces (wrapup_globals_for_namespace, /*data=*/&reconsider);
3740 this_time = get_run_time ();
3741 parse_time -= this_time - start_time;
3742 varconst_time += this_time - start_time;
3744 if (flag_detailed_statistics)
3746 dump_tree_statistics ();
3747 dump_time_statistics ();
3751 /* This is something of the form 'A()()()()()+1' that has turned out to be an
3752 expr. Since it was parsed like a type, we need to wade through and fix
3753 that. Unfortunately, since operator() is left-associative, we can't use
3754 tail recursion. In the above example, TYPE is `A', and DECL is
3757 Maybe this shouldn't be recursive, but how often will it actually be
3761 reparse_absdcl_as_expr (type, decl)
3764 /* do build_functional_cast (type, NULL_TREE) at bottom */
3765 if (TREE_OPERAND (decl, 0) == NULL_TREE)
3766 return build_functional_cast (type, NULL_TREE);
3769 decl = reparse_absdcl_as_expr (type, TREE_OPERAND (decl, 0));
3771 decl = build_x_function_call (decl, NULL_TREE, current_class_ref);
3773 if (TREE_CODE (decl) == CALL_EXPR
3774 && (! TREE_TYPE (decl)
3775 || TREE_CODE (TREE_TYPE (decl)) != VOID_TYPE))
3776 decl = require_complete_type (decl);
3781 /* This is something of the form `int ((int)(int)(int)1)' that has turned
3782 out to be an expr. Since it was parsed like a type, we need to wade
3783 through and fix that. Since casts are right-associative, we are
3784 reversing the order, so we don't have to recurse.
3786 In the above example, DECL is the `(int)(int)(int)', and EXPR is the
3790 reparse_absdcl_as_casts (decl, expr)
3795 if (TREE_CODE (expr) == CONSTRUCTOR
3796 && TREE_TYPE (expr) == 0)
3798 type = groktypename (TREE_VALUE (TREE_OPERAND (decl, 1)));
3799 decl = TREE_OPERAND (decl, 0);
3801 if (IS_SIGNATURE (type))
3803 error ("cast specifies signature type");
3804 return error_mark_node;
3807 expr = digest_init (type, expr, (tree *) 0);
3808 if (TREE_CODE (type) == ARRAY_TYPE && TYPE_SIZE (type) == 0)
3810 int failure = complete_array_type (type, expr, 1);
3812 my_friendly_abort (78);
3818 type = groktypename (TREE_VALUE (TREE_OPERAND (decl, 1)));
3819 decl = TREE_OPERAND (decl, 0);
3820 expr = build_c_cast (type, expr);
3823 if (warn_old_style_cast && ! in_system_header
3824 && current_lang_name != lang_name_c)
3825 warning ("use of old-style cast");
3830 /* Given plain tree nodes for an expression, build up the full semantics. */
3833 build_expr_from_tree (t)
3836 if (t == NULL_TREE || t == error_mark_node)
3839 switch (TREE_CODE (t))
3841 case IDENTIFIER_NODE:
3842 return do_identifier (t, 0, NULL_TREE);
3845 if (LOOKUP_EXPR_GLOBAL (t))
3846 return do_scoped_id (TREE_OPERAND (t, 0), 0);
3848 return do_identifier (TREE_OPERAND (t, 0), 0, NULL_TREE);
3850 case TEMPLATE_ID_EXPR:
3851 return (lookup_template_function
3852 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3853 build_expr_from_tree (TREE_OPERAND (t, 1))));
3856 return build_x_indirect_ref
3857 (build_expr_from_tree (TREE_OPERAND (t, 0)), "unary *");
3860 return build_functional_cast
3861 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3863 case REINTERPRET_CAST_EXPR:
3864 return build_reinterpret_cast
3865 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3867 case CONST_CAST_EXPR:
3868 return build_const_cast
3869 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3871 case DYNAMIC_CAST_EXPR:
3872 return build_dynamic_cast
3873 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3875 case STATIC_CAST_EXPR:
3876 return build_static_cast
3877 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3879 case PREDECREMENT_EXPR:
3880 case PREINCREMENT_EXPR:
3881 case POSTDECREMENT_EXPR:
3882 case POSTINCREMENT_EXPR:
3886 case TRUTH_NOT_EXPR:
3888 case CONVERT_EXPR: /* Unary + */
3891 return build_x_unary_op (TREE_CODE (t),
3892 build_expr_from_tree (TREE_OPERAND (t, 0)));
3897 case TRUNC_DIV_EXPR:
3899 case FLOOR_DIV_EXPR:
3900 case ROUND_DIV_EXPR:
3901 case EXACT_DIV_EXPR:
3903 case BIT_ANDTC_EXPR:
3906 case TRUNC_MOD_EXPR:
3907 case FLOOR_MOD_EXPR:
3908 case TRUTH_ANDIF_EXPR:
3909 case TRUTH_ORIF_EXPR:
3910 case TRUTH_AND_EXPR:
3925 return build_x_binary_op
3927 build_expr_from_tree (TREE_OPERAND (t, 0)),
3928 build_expr_from_tree (TREE_OPERAND (t, 1)));
3931 return build_m_component_ref
3932 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3933 build_expr_from_tree (TREE_OPERAND (t, 1)));
3936 return build_offset_ref (TREE_OPERAND (t, 0), TREE_OPERAND (t, 1));
3939 if (TREE_OPERAND (t, 0) == NULL_TREE)
3941 return build_parse_node (ARRAY_REF, NULL_TREE,
3942 build_expr_from_tree (TREE_OPERAND (t, 1)));
3943 return grok_array_decl (build_expr_from_tree (TREE_OPERAND (t, 0)),
3944 build_expr_from_tree (TREE_OPERAND (t, 1)));
3949 tree r = build_expr_from_tree (TREE_OPERAND (t, 0));
3950 if (TREE_CODE_CLASS (TREE_CODE (r)) != 't')
3952 return TREE_CODE (t) == SIZEOF_EXPR ? c_sizeof (r) : c_alignof (r);
3956 return build_x_modify_expr
3957 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3958 TREE_CODE (TREE_OPERAND (t, 1)),
3959 build_expr_from_tree (TREE_OPERAND (t, 2)));
3962 return build_x_arrow
3963 (build_expr_from_tree (TREE_OPERAND (t, 0)));
3967 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3968 build_expr_from_tree (TREE_OPERAND (t, 1)),
3969 build_expr_from_tree (TREE_OPERAND (t, 2)),
3970 NEW_EXPR_USE_GLOBAL (t));
3973 return delete_sanity
3974 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3975 build_expr_from_tree (TREE_OPERAND (t, 1)),
3976 DELETE_EXPR_USE_VEC (t), DELETE_EXPR_USE_GLOBAL (t));
3979 if (TREE_OPERAND (t, 1) == NULL_TREE)
3980 return build_x_compound_expr
3981 (build_expr_from_tree (TREE_OPERAND (t, 0)));
3983 my_friendly_abort (42);
3985 case METHOD_CALL_EXPR:
3986 if (TREE_CODE (TREE_OPERAND (t, 0)) == SCOPE_REF)
3988 tree ref = TREE_OPERAND (t, 0);
3989 return build_scoped_method_call
3990 (build_expr_from_tree (TREE_OPERAND (t, 1)),
3991 build_expr_from_tree (TREE_OPERAND (ref, 0)),
3992 TREE_OPERAND (ref, 1),
3993 build_expr_from_tree (TREE_OPERAND (t, 2)));
3997 tree fn = TREE_OPERAND (t, 0);
3999 /* We can get a TEMPLATE_ID_EXPR here on code like:
4003 so we must resolve that. However, we can also get things
4004 like a BIT_NOT_EXPR here, when referring to a destructor,
4005 and things like that are not correctly resolved by
4006 build_expr_from_tree. So, just use build_expr_from_tree
4007 when we really need it. */
4008 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
4009 fn = lookup_template_function
4010 (TREE_OPERAND (fn, 0),
4011 build_expr_from_tree (TREE_OPERAND (fn, 1)));
4013 return build_method_call
4014 (build_expr_from_tree (TREE_OPERAND (t, 1)),
4016 build_expr_from_tree (TREE_OPERAND (t, 2)),
4017 NULL_TREE, LOOKUP_NORMAL);
4021 if (TREE_CODE (TREE_OPERAND (t, 0)) == SCOPE_REF)
4023 tree ref = TREE_OPERAND (t, 0);
4024 return build_member_call
4025 (build_expr_from_tree (TREE_OPERAND (ref, 0)),
4026 TREE_OPERAND (ref, 1),
4027 build_expr_from_tree (TREE_OPERAND (t, 1)));
4031 tree name = TREE_OPERAND (t, 0);
4033 tree args = build_expr_from_tree (TREE_OPERAND (t, 1));
4034 if (args != NULL_TREE && TREE_CODE (name) == LOOKUP_EXPR
4035 && !LOOKUP_EXPR_GLOBAL (name)
4036 && TREE_CODE ((id = TREE_OPERAND (name, 0))) == IDENTIFIER_NODE
4037 && (!current_class_type
4038 || !lookup_member (current_class_type, id, 0, 0)))
4040 /* Do Koenig lookup if there are no class members. */
4041 name = do_identifier (id, 0, args);
4043 else if (TREE_CODE (name) == TEMPLATE_ID_EXPR
4044 || ! really_overloaded_fn (name))
4045 name = build_expr_from_tree (name);
4046 return build_x_function_call (name, args, current_class_ref);
4050 return build_x_conditional_expr
4051 (build_expr_from_tree (TREE_OPERAND (t, 0)),
4052 build_expr_from_tree (TREE_OPERAND (t, 1)),
4053 build_expr_from_tree (TREE_OPERAND (t, 2)));
4057 tree purpose, value, chain;
4059 if (t == void_list_node)
4062 purpose = TREE_PURPOSE (t);
4064 purpose = build_expr_from_tree (purpose);
4065 value = TREE_VALUE (t);
4067 value = build_expr_from_tree (value);
4068 chain = TREE_CHAIN (t);
4069 if (chain && chain != void_type_node)
4070 chain = build_expr_from_tree (chain);
4071 return expr_tree_cons (purpose, value, chain);
4076 tree object = build_expr_from_tree (TREE_OPERAND (t, 0));
4077 tree field = TREE_OPERAND (t, 1);
4079 /* We use a COMPONENT_REF to indicate things of the form `x.b'
4080 and `x.A::b'. We must distinguish between those cases
4082 if (TREE_CODE (field) == SCOPE_REF)
4083 return build_object_ref (object,
4084 TREE_OPERAND (field, 0),
4085 TREE_OPERAND (field, 1));
4087 return build_x_component_ref (object, field,
4092 return build_throw (build_expr_from_tree (TREE_OPERAND (t, 0)));
4098 /* digest_init will do the wrong thing if we let it. */
4099 if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t)))
4102 r = build_nt (CONSTRUCTOR, NULL_TREE,
4103 build_expr_from_tree (CONSTRUCTOR_ELTS (t)));
4104 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
4107 return digest_init (TREE_TYPE (t), r, 0);
4112 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (t, 0))) == 't')
4113 return get_typeid (TREE_OPERAND (t, 0));
4114 return build_x_typeid (build_expr_from_tree (TREE_OPERAND (t, 0)));
4117 return convert_from_reference (t);
4124 /* This is something of the form `int (*a)++' that has turned out to be an
4125 expr. It was only converted into parse nodes, so we need to go through
4126 and build up the semantics. Most of the work is done by
4127 build_expr_from_tree, above.
4129 In the above example, TYPE is `int' and DECL is `*a'. */
4132 reparse_decl_as_expr (type, decl)
4135 decl = build_expr_from_tree (decl);
4137 return build_functional_cast (type, build_expr_list (NULL_TREE, decl));
4142 /* This is something of the form `int (*a)' that has turned out to be a
4143 decl. It was only converted into parse nodes, so we need to do the
4144 checking that make_{pointer,reference}_declarator do. */
4147 finish_decl_parsing (decl)
4150 extern int current_class_depth;
4152 switch (TREE_CODE (decl))
4154 case IDENTIFIER_NODE:
4157 return make_pointer_declarator
4158 (NULL_TREE, finish_decl_parsing (TREE_OPERAND (decl, 0)));
4160 return make_reference_declarator
4161 (NULL_TREE, finish_decl_parsing (TREE_OPERAND (decl, 0)));
4163 TREE_OPERAND (decl, 0) = finish_decl_parsing (TREE_OPERAND (decl, 0));
4166 push_nested_class (TREE_TYPE (TREE_OPERAND (decl, 0)), 3);
4167 TREE_COMPLEXITY (decl) = current_class_depth;
4170 TREE_OPERAND (decl, 0) = finish_decl_parsing (TREE_OPERAND (decl, 0));
4173 /* For attribute handling. */
4174 TREE_VALUE (decl) = finish_decl_parsing (TREE_VALUE (decl));
4177 my_friendly_abort (5);
4183 check_cp_case_value (value)
4186 if (value == NULL_TREE)
4189 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4190 STRIP_TYPE_NOPS (value);
4192 if (TREE_READONLY_DECL_P (value))
4194 value = decl_constant_value (value);
4195 STRIP_TYPE_NOPS (value);
4197 value = fold (value);
4199 if (TREE_CODE (value) != INTEGER_CST
4200 && value != error_mark_node)
4202 cp_error ("case label `%E' does not reduce to an integer constant",
4204 value = error_mark_node;
4207 /* Promote char or short to int. */
4208 value = default_conversion (value);
4210 constant_expression_warning (value);
4215 /* Return 1 if root encloses child. */
4218 is_namespace_ancestor (root, child)
4223 if (root == global_namespace)
4225 if (child == global_namespace)
4227 return is_namespace_ancestor (root, CP_DECL_CONTEXT (child));
4231 /* Return the namespace that is the common ancestor
4232 of two given namespaces. */
4235 namespace_ancestor (ns1, ns2)
4238 if (is_namespace_ancestor (ns1, ns2))
4240 return namespace_ancestor (CP_DECL_CONTEXT (ns1), ns2);
4243 /* Insert used into the using list of user. Set indirect_flag if this
4244 directive is not directly from the source. Also find the common
4245 ancestor and let our users know about the new namespace */
4247 add_using_namespace (user, used, indirect)
4253 /* Using oneself is a no-op. */
4256 my_friendly_assert (TREE_CODE (user) == NAMESPACE_DECL, 380);
4257 my_friendly_assert (TREE_CODE (used) == NAMESPACE_DECL, 380);
4258 /* Check if we already have this. */
4259 t = purpose_member (used, DECL_NAMESPACE_USING (user));
4263 /* Promote to direct usage. */
4264 TREE_INDIRECT_USING (t) = 0;
4268 /* Add used to the user's using list. */
4269 DECL_NAMESPACE_USING (user)
4270 = perm_tree_cons (used, namespace_ancestor (user, used),
4271 DECL_NAMESPACE_USING (user));
4273 TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user)) = indirect;
4275 /* Add user to the used's users list. */
4276 DECL_NAMESPACE_USERS (used)
4277 = perm_tree_cons (user, 0, DECL_NAMESPACE_USERS (used));
4279 /* Recursively add all namespaces used. */
4280 for (t = DECL_NAMESPACE_USING (used); t; t = TREE_CHAIN (t))
4281 /* indirect usage */
4282 add_using_namespace (user, TREE_PURPOSE (t), 1);
4284 /* Tell everyone using us about the new used namespaces. */
4285 for (t = DECL_NAMESPACE_USERS (user); t; t = TREE_CHAIN (t))
4286 add_using_namespace (TREE_PURPOSE (t), used, 1);
4289 /* Combines two sets of overloaded functions into an OVERLOAD chain, removing
4290 duplicates. The first list becomes the tail of the result.
4292 The algorithm is O(n^2). We could get this down to O(n log n) by
4293 doing a sort on the addresses of the functions, if that becomes
4297 merge_functions (s1, s2)
4301 for (; s2; s2 = OVL_NEXT (s2))
4303 tree fn = OVL_CURRENT (s2);
4304 if (! ovl_member (fn, s1))
4305 s1 = build_overload (fn, s1);
4310 /* This should return an error not all definitions define functions.
4311 It is not an error if we find two functions with exactly the
4312 same signature, only if these are selected in overload resolution.
4313 old is the current set of bindings, new the freshly-found binding.
4314 XXX Do we want to give *all* candidates in case of ambiguity?
4315 XXX In what way should I treat extern declarations?
4316 XXX I don't want to repeat the entire duplicate_decls here */
4319 ambiguous_decl (name, old, new, flags)
4326 my_friendly_assert (old != NULL_TREE, 393);
4327 /* Copy the value. */
4328 val = BINDING_VALUE (new);
4330 switch (TREE_CODE (val))
4333 /* If we expect types or namespaces, and not templates,
4334 or this is not a template class. */
4335 if (LOOKUP_QUALIFIERS_ONLY (flags)
4336 && !DECL_CLASS_TEMPLATE_P (val))
4340 if (LOOKUP_NAMESPACES_ONLY (flags))
4343 case NAMESPACE_DECL:
4344 if (LOOKUP_TYPES_ONLY (flags))
4348 if (LOOKUP_QUALIFIERS_ONLY (flags))
4352 if (!BINDING_VALUE (old))
4353 BINDING_VALUE (old) = val;
4354 else if (val && val != BINDING_VALUE (old))
4356 if (is_overloaded_fn (BINDING_VALUE (old))
4357 && is_overloaded_fn (val))
4359 BINDING_VALUE (old) = merge_functions (BINDING_VALUE (old),
4364 /* Some declarations are functions, some are not. */
4365 if (flags & LOOKUP_COMPLAIN)
4367 /* If we've already given this error for this lookup,
4368 BINDING_VALUE (old) is error_mark_node, so let's not
4369 repeat ourselves. */
4370 if (BINDING_VALUE (old) != error_mark_node)
4372 cp_error ("use of `%D' is ambiguous", name);
4373 cp_error_at (" first declared as `%#D' here",
4374 BINDING_VALUE (old));
4376 cp_error_at (" also declared as `%#D' here", val);
4378 return error_mark_node;
4381 /* ... and copy the type. */
4382 type = BINDING_TYPE (new);
4383 if (LOOKUP_NAMESPACES_ONLY (flags))
4385 if (!BINDING_TYPE (old))
4386 BINDING_TYPE (old) = type;
4387 else if (type && BINDING_TYPE (old) != type)
4389 if (flags & LOOKUP_COMPLAIN)
4391 cp_error ("`%D' denotes an ambiguous type",name);
4392 cp_error_at (" first type here", BINDING_TYPE (old));
4393 cp_error_at (" other type here", type);
4399 /* Add the bindings of name in used namespaces to val.
4400 The using list is defined by usings, and the lookup goes to scope.
4401 Returns zero on errors. */
4404 lookup_using_namespace (name, val, usings, scope, flags)
4405 tree name, val, usings, scope;
4410 /* Iterate over all used namespaces in current, searching for using
4411 directives of scope. */
4412 for (iter = usings; iter; iter = TREE_CHAIN (iter))
4413 if (TREE_VALUE (iter) == scope)
4415 val1 = binding_for_name (name, TREE_PURPOSE (iter));
4416 /* Resolve ambiguities. */
4417 val = ambiguous_decl (name, val, val1, flags);
4419 return val != error_mark_node;
4423 Excepts the name to lookup and its qualifying scope.
4424 Returns the name/type pair found into the CPLUS_BINDING result,
4428 qualified_lookup_using_namespace (name, scope, result, flags)
4434 /* Maintain a list of namespaces visited... */
4435 tree seen = NULL_TREE;
4436 /* ... and a list of namespace yet to see. */
4437 tree todo = NULL_TREE;
4439 while (scope && (result != error_mark_node))
4441 seen = temp_tree_cons (scope, NULL_TREE, seen);
4442 result = ambiguous_decl (name, result,
4443 binding_for_name (name, scope), flags);
4444 if (!BINDING_VALUE (result) && !BINDING_TYPE (result))
4445 /* Consider using directives. */
4446 for (usings = DECL_NAMESPACE_USING (scope); usings;
4447 usings = TREE_CHAIN (usings))
4448 /* If this was a real directive, and we have not seen it. */
4449 if (!TREE_INDIRECT_USING (usings)
4450 && !purpose_member (TREE_PURPOSE (usings), seen))
4451 todo = temp_tree_cons (TREE_PURPOSE (usings), NULL_TREE, todo);
4454 scope = TREE_PURPOSE (todo);
4455 todo = TREE_CHAIN (todo);
4458 scope = NULL_TREE; /* If there never was a todo list. */
4460 return result != error_mark_node;
4463 /* [namespace.memdef]/2 */
4465 /* Set the context of a declaration to scope. Complain if we are not
4469 set_decl_namespace (decl, scope, friendp)
4475 if (scope == std_node)
4476 scope = global_namespace;
4477 /* Get rid of namespace aliases. */
4478 scope = ORIGINAL_NAMESPACE (scope);
4480 /* It is ok for friends to be qualified in parallel space. */
4481 if (!friendp && !is_namespace_ancestor (current_namespace, scope))
4482 cp_error ("declaration of `%D' not in a namespace surrounding `%D'",
4484 DECL_CONTEXT (decl) = FROB_CONTEXT (scope);
4485 if (scope != current_namespace)
4487 /* See whether this has been declared in the namespace. */
4488 old = namespace_binding (DECL_NAME (decl), scope);
4490 /* No old declaration at all. */
4492 if (!is_overloaded_fn (decl))
4493 /* Don't compare non-function decls with decls_match here,
4494 since it can't check for the correct constness at this
4495 point. pushdecl will find those errors later. */
4497 /* Since decl is a function, old should contain a function decl. */
4498 if (!is_overloaded_fn (old))
4500 if (processing_template_decl || processing_specialization)
4501 /* We have not yet called push_template_decl to turn the
4502 FUNCTION_DECL into a TEMPLATE_DECL, so the declarations
4503 won't match. But, we'll check later, when we construct the
4506 for (; old; old = OVL_NEXT (old))
4507 if (decls_match (decl, OVL_CURRENT (old)))
4513 cp_error ("`%D' should have been declared inside `%D'",
4517 /* Compute the namespace where a declaration is defined. */
4520 decl_namespace (decl)
4523 while (DECL_CONTEXT (decl))
4525 decl = DECL_CONTEXT (decl);
4526 if (TREE_CODE (decl) == NAMESPACE_DECL)
4528 if (TREE_CODE_CLASS (TREE_CODE (decl)) == 't')
4529 decl = TYPE_STUB_DECL (decl);
4530 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd', 390);
4533 return global_namespace;
4536 /* Return the namespace where the current declaration is declared. */
4539 current_decl_namespace ()
4542 /* If we have been pushed into a different namespace, use it. */
4543 if (decl_namespace_list)
4544 return TREE_PURPOSE (decl_namespace_list);
4546 if (current_class_type)
4547 result = decl_namespace (TYPE_STUB_DECL (current_class_type));
4548 else if (current_function_decl)
4549 result = decl_namespace (current_function_decl);
4551 result = current_namespace;
4555 /* Temporarily set the namespace for the current declaration. */
4558 push_decl_namespace (decl)
4561 if (TREE_CODE (decl) != NAMESPACE_DECL)
4562 decl = decl_namespace (decl);
4563 decl_namespace_list = tree_cons (decl, NULL_TREE, decl_namespace_list);
4567 pop_decl_namespace ()
4569 decl_namespace_list = TREE_CHAIN (decl_namespace_list);
4572 /* Enter a class or namespace scope. */
4578 if (TREE_CODE (t) == NAMESPACE_DECL)
4579 push_decl_namespace (t);
4584 /* Leave scope pushed by push_scope. */
4590 if (TREE_CODE (t) == NAMESPACE_DECL)
4591 pop_decl_namespace ();
4596 /* [basic.lookup.koenig] */
4597 /* A non-zero return value in the functions below indicates an error.
4598 All nodes allocated in the procedure are on the scratch obstack. */
4608 static int arg_assoc PROTO((struct arg_lookup*, tree));
4609 static int arg_assoc_args PROTO((struct arg_lookup*, tree));
4610 static int arg_assoc_type PROTO((struct arg_lookup*, tree));
4611 static int add_function PROTO((struct arg_lookup *, tree));
4612 static int arg_assoc_namespace PROTO((struct arg_lookup *, tree));
4613 static int arg_assoc_class PROTO((struct arg_lookup *, tree));
4615 /* Add a function to the lookup structure.
4616 Returns 1 on error. */
4619 add_function (k, fn)
4620 struct arg_lookup *k;
4623 if (ovl_member (fn, k->functions))
4625 /* We must find only functions, or exactly one non-function. */
4626 if (k->functions && is_overloaded_fn (k->functions)
4627 && is_overloaded_fn (fn))
4628 k->functions = build_overload (fn, k->functions);
4632 tree f1 = OVL_CURRENT (k->functions);
4634 if (is_overloaded_fn (f1))
4636 fn = f1; f1 = f2; f2 = fn;
4638 cp_error_at ("`%D' is not a function,", f1);
4639 cp_error_at (" conflict with `%D'", f2);
4640 cp_error (" in call to `%D'", k->name);
4648 /* Add functions of a namespace to the lookup structure.
4649 Returns 1 on error. */
4652 arg_assoc_namespace (k, scope)
4653 struct arg_lookup *k;
4658 if (purpose_member (scope, k->namespaces))
4660 k->namespaces = tree_cons (scope, NULL_TREE, k->namespaces);
4662 value = namespace_binding (k->name, scope);
4666 for (; value; value = OVL_NEXT (value))
4667 if (add_function (k, OVL_CURRENT (value)))
4673 /* Adds everything associated with class to the lookup structure.
4674 Returns 1 on error. */
4677 arg_assoc_class (k, type)
4678 struct arg_lookup* k;
4681 tree list, friends, context;
4684 if (purpose_member (type, k->classes))
4686 k->classes = tree_cons (type, NULL_TREE, k->classes);
4688 context = decl_namespace (TYPE_MAIN_DECL (type));
4689 if (arg_assoc_namespace (k, context))
4692 /* Process baseclasses. */
4693 for (i = 0; i < CLASSTYPE_N_BASECLASSES (type); i++)
4694 if (arg_assoc_class (k, TYPE_BINFO_BASETYPE (type, i)))
4697 /* Process friends. */
4698 for (list = DECL_FRIENDLIST (TYPE_MAIN_DECL (type)); list;
4699 list = TREE_CHAIN (list))
4700 if (k->name == TREE_PURPOSE (list))
4701 for (friends = TREE_VALUE (list); friends;
4702 friends = TREE_CHAIN (friends))
4703 /* Only interested in global functions with potentially hidden
4704 (i.e. unqualified) declarations. */
4705 if (TREE_PURPOSE (list) == error_mark_node && TREE_VALUE (list)
4706 && decl_namespace (TREE_VALUE (list)) == context)
4707 if (add_function (k, TREE_VALUE (list)))
4710 /* Process template arguments. */
4711 if (CLASSTYPE_TEMPLATE_INFO (type))
4713 list = innermost_args (CLASSTYPE_TI_ARGS (type));
4714 for (i = 0; i < TREE_VEC_LENGTH (list); ++i)
4715 arg_assoc (k, TREE_VEC_ELT (list, i));
4721 /* Adds everything associated with a given type.
4722 Returns 1 on error. */
4725 arg_assoc_type (k, type)
4726 struct arg_lookup *k;
4729 switch (TREE_CODE (type))
4739 if (TYPE_PTRMEMFUNC_P (type))
4740 return arg_assoc_type (k, TYPE_PTRMEMFUNC_FN_TYPE (type));
4741 return arg_assoc_class (k, type);
4743 case REFERENCE_TYPE:
4745 return arg_assoc_type (k, TREE_TYPE (type));
4748 return arg_assoc_namespace (k, decl_namespace (TYPE_MAIN_DECL (type)));
4750 /* Pointer to member: associate class type and value type. */
4751 if (arg_assoc_type (k, TYPE_OFFSET_BASETYPE (type)))
4753 return arg_assoc_type (k, TREE_TYPE (type));
4755 /* The basetype is referenced in the first arg type, so just
4758 /* Associate the parameter types. */
4759 if (arg_assoc_args (k, TYPE_ARG_TYPES (type)))
4761 /* Associate the return type. */
4762 return arg_assoc_type (k, TREE_TYPE (type));
4763 case TEMPLATE_TYPE_PARM:
4764 case TEMPLATE_TEMPLATE_PARM:
4767 if (type == unknown_type_node)
4769 /* else fall through */
4771 my_friendly_abort (390);
4776 /* Adds everything associated with arguments. Returns 1 on error. */
4779 arg_assoc_args (k, args)
4780 struct arg_lookup* k;
4783 for (; args; args = TREE_CHAIN (args))
4784 if (arg_assoc (k, TREE_VALUE (args)))
4789 /* Adds everything associated with a given tree_node. Returns 1 on error. */
4793 struct arg_lookup* k;
4796 if (n == error_mark_node)
4799 if (TREE_CODE_CLASS (TREE_CODE (n)) == 't')
4800 return arg_assoc_type (k, n);
4802 if (! type_unknown_p (n))
4803 return arg_assoc_type (k, TREE_TYPE (n));
4805 if (TREE_CODE (n) == ADDR_EXPR)
4806 n = TREE_OPERAND (n, 0);
4807 if (TREE_CODE (n) == COMPONENT_REF)
4808 n = TREE_OPERAND (n, 1);
4809 if (TREE_CODE (n) == OFFSET_REF)
4810 n = TREE_OPERAND (n, 1);
4811 while (TREE_CODE (n) == TREE_LIST)
4814 if (TREE_CODE (n) == FUNCTION_DECL)
4815 return arg_assoc_type (k, TREE_TYPE (n));
4816 if (TREE_CODE (n) == TEMPLATE_ID_EXPR)
4818 /* [basic.lookup.koenig]
4820 If T is a template-id, its associated namespaces and classes
4821 are the namespace in which the template is defined; for
4822 member templates, the member template's class; the namespaces
4823 and classes associated with the types of the template
4824 arguments provided for template type parameters (excluding
4825 template template parameters); the namespaces in which any
4826 template template arguments are defined; and the classes in
4827 which any member templates used as template template
4828 arguments are defined. [Note: non-type template arguments do
4829 not contribute to the set of associated namespaces. ] */
4830 tree template = TREE_OPERAND (n, 0);
4831 tree args = TREE_OPERAND (n, 1);
4835 /* First, the template. There may actually be more than one if
4836 this is an overloaded function template. But, in that case,
4837 we only need the first; all the functions will be in the same
4839 template = OVL_CURRENT (template);
4841 ctx = CP_DECL_CONTEXT (template);
4843 if (TREE_CODE (ctx) == NAMESPACE_DECL)
4845 if (arg_assoc_namespace (k, ctx) == 1)
4848 /* It must be a member template. */
4849 else if (arg_assoc_class (k, ctx) == 1)
4852 /* Now the arguments. */
4853 for (arg = args; arg != NULL_TREE; arg = TREE_CHAIN (arg))
4855 tree t = TREE_VALUE (arg);
4857 if (TREE_CODE (t) == TEMPLATE_DECL)
4859 ctx = CP_DECL_CONTEXT (t);
4860 if (TREE_CODE (ctx) == NAMESPACE_DECL)
4862 if (arg_assoc_namespace (k, ctx) == 1)
4865 else if (arg_assoc_class (k, ctx) == 1)
4868 else if (TREE_CODE_CLASS (TREE_CODE (t)) == 't'
4869 && arg_assoc_type (k, t) == 1)
4875 my_friendly_assert (TREE_CODE (n) == OVERLOAD, 980715);
4877 for (; n; n = OVL_CHAIN (n))
4878 if (arg_assoc_type (k, TREE_TYPE (OVL_FUNCTION (n))))
4885 /* Performs Koenig lookup depending on arguments, where fns
4886 are the functions found in normal lookup. */
4889 lookup_arg_dependent (name, fns, args)
4894 struct arg_lookup k;
4898 k.classes = NULL_TREE;
4900 /* Note that we've already looked at the current namespace during normal
4901 unqualified lookup, unless we found a decl in function scope. */
4902 if (fns && ! TREE_PERMANENT (OVL_CURRENT (fns)))
4903 k.namespaces = NULL_TREE;
4905 k.namespaces = scratch_tree_cons (current_decl_namespace (),
4906 NULL_TREE, NULL_TREE);
4908 push_scratch_obstack ();
4909 arg_assoc_args (&k, args);
4914 /* Process a namespace-alias declaration. */
4917 do_namespace_alias (alias, namespace)
4918 tree alias, namespace;
4920 if (TREE_CODE (namespace) != NAMESPACE_DECL)
4922 /* The parser did not find it, so it's not there. */
4923 cp_error ("unknown namespace `%D'", namespace);
4927 namespace = ORIGINAL_NAMESPACE (namespace);
4929 /* Build the alias. */
4930 alias = build_lang_decl (NAMESPACE_DECL, alias, void_type_node);
4931 DECL_NAMESPACE_ALIAS (alias) = namespace;
4935 /* Check a non-member using-declaration. Return the name and scope
4936 being used, and the USING_DECL, or NULL_TREE on failure. */
4939 validate_nonmember_using_decl (decl, scope, name)
4944 if (TREE_CODE (decl) == SCOPE_REF
4945 && TREE_OPERAND (decl, 0) == std_node)
4947 if (namespace_bindings_p ()
4948 && current_namespace == global_namespace)
4949 /* There's no need for a using declaration at all, here,
4950 since `std' is the same as `::'. We can't just pass this
4951 on because we'll complain later about declaring something
4952 in the same scope as a using declaration with the same
4953 name. We return NULL_TREE which indicates to the caller
4954 that there's no need to do any further processing. */
4957 *scope = global_namespace;
4958 *name = TREE_OPERAND (decl, 1);
4960 else if (TREE_CODE (decl) == SCOPE_REF)
4962 *scope = TREE_OPERAND (decl, 0);
4963 *name = TREE_OPERAND (decl, 1);
4965 /* [namespace.udecl]
4967 A using-declaration for a class member shall be a
4968 member-declaration. */
4969 if (TREE_CODE (*scope) != NAMESPACE_DECL)
4971 if (TYPE_P (*scope))
4972 cp_error ("`%T' is not a namespace", *scope);
4974 cp_error ("`%D' is not a namespace", *scope);
4978 else if (TREE_CODE (decl) == IDENTIFIER_NODE
4979 || TREE_CODE (decl) == TYPE_DECL
4980 || TREE_CODE (decl) == TEMPLATE_DECL)
4982 *scope = global_namespace;
4986 my_friendly_abort (382);
4987 if (TREE_CODE_CLASS (TREE_CODE (*name)) == 'd')
4988 *name = DECL_NAME (*name);
4989 /* Make a USING_DECL. */
4990 return push_using_decl (*scope, *name);
4993 /* Process local and global using-declarations. */
4996 do_nonmember_using_decl (scope, name, oldval, oldtype, newval, newtype)
4998 tree oldval, oldtype;
4999 tree *newval, *newtype;
5002 struct tree_binding _decls;
5004 *newval = *newtype = NULL_TREE;
5005 decls = binding_init (&_decls);
5006 if (!qualified_lookup_using_namespace (name, scope, decls, 0))
5010 if (!BINDING_VALUE (decls) && !BINDING_TYPE (decls))
5012 cp_error ("`%D' not declared", name);
5016 /* Check for using functions. */
5017 if (BINDING_VALUE (decls) && is_overloaded_fn (BINDING_VALUE (decls)))
5021 if (oldval && !is_overloaded_fn (oldval))
5023 duplicate_decls (OVL_CURRENT (BINDING_VALUE (decls)), oldval);
5028 for (tmp = BINDING_VALUE (decls); tmp; tmp = OVL_NEXT (tmp))
5030 tree new_fn = OVL_CURRENT (tmp);
5032 /* [namespace.udecl]
5034 If a function declaration in namespace scope or block
5035 scope has the same name and the same parameter types as a
5036 function introduced by a using declaration the program is
5038 for (tmp1 = oldval; tmp1; tmp1 = OVL_NEXT (tmp1))
5040 tree old_fn = OVL_CURRENT (tmp1);
5042 if (!OVL_USED (tmp1)
5043 && compparms (TYPE_ARG_TYPES (TREE_TYPE (new_fn)),
5044 TYPE_ARG_TYPES (TREE_TYPE (old_fn))))
5046 /* There was already a non-using declaration in
5047 this scope with the same parameter types. */
5048 cp_error ("`%D' is already declared in this scope",
5052 else if (duplicate_decls (new_fn, old_fn))
5053 /* We're re-using something we already used
5054 before. We don't need to add it again. */
5058 /* If we broke out of the loop, there's no reason to add
5059 this function to the using declarations for this
5064 *newval = build_overload (OVL_CURRENT (tmp), *newval);
5065 if (TREE_CODE (*newval) != OVERLOAD)
5066 *newval = ovl_cons (*newval, NULL_TREE);
5067 OVL_USED (*newval) = 1;
5072 *newval = BINDING_VALUE (decls);
5074 duplicate_decls (*newval, oldval);
5077 *newtype = BINDING_TYPE (decls);
5078 if (oldtype && *newtype && oldtype != *newtype)
5080 cp_error ("using directive `%D' introduced ambiguous type `%T'",
5086 /* Process a using-declaration not appearing in class or local scope. */
5089 do_toplevel_using_decl (decl)
5092 tree scope, name, binding;
5093 tree oldval, oldtype, newval, newtype;
5095 decl = validate_nonmember_using_decl (decl, &scope, &name);
5096 if (decl == NULL_TREE)
5099 binding = binding_for_name (name, current_namespace);
5101 oldval = BINDING_VALUE (binding);
5102 oldtype = BINDING_TYPE (binding);
5104 do_nonmember_using_decl (scope, name, oldval, oldtype, &newval, &newtype);
5106 /* Copy declarations found. */
5108 BINDING_VALUE (binding) = newval;
5110 BINDING_TYPE (binding) = newtype;
5114 /* Process a using-declaration at function scope. */
5117 do_local_using_decl (decl)
5121 tree oldval, oldtype, newval, newtype;
5123 decl = validate_nonmember_using_decl (decl, &scope, &name);
5124 if (decl == NULL_TREE)
5127 oldval = lookup_name_current_level (name);
5128 oldtype = lookup_type_current_level (name);
5130 do_nonmember_using_decl (scope, name, oldval, oldtype, &newval, &newtype);
5134 if (is_overloaded_fn (newval))
5138 /* We only need to push declarations for those functions
5139 that were not already bound in the current level.
5140 The old value might be NULL_TREE, it might be a single
5141 function, or an OVERLOAD. */
5142 if (oldval && TREE_CODE (oldval) == OVERLOAD)
5143 term = OVL_FUNCTION (oldval);
5146 for (fn = newval; fn && OVL_CURRENT (fn) != term;
5148 push_overloaded_decl (OVL_CURRENT (fn),
5149 PUSH_LOCAL | PUSH_USING);
5152 push_local_binding (name, newval, PUSH_USING);
5155 set_identifier_type_value (name, newtype);
5159 do_class_using_decl (decl)
5164 if (TREE_CODE (decl) != SCOPE_REF
5165 || TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (decl, 0))) != 't')
5167 cp_error ("using-declaration for non-member at class scope");
5170 name = TREE_OPERAND (decl, 1);
5171 if (TREE_CODE (name) == BIT_NOT_EXPR)
5173 cp_error ("using-declaration for destructor");
5176 if (TREE_CODE (name) == TYPE_DECL)
5177 name = DECL_NAME (name);
5179 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 980716);
5181 value = build_lang_field_decl (USING_DECL, name, void_type_node);
5182 DECL_INITIAL (value) = TREE_OPERAND (decl, 0);
5186 /* Process a using-directive. */
5189 do_using_directive (namespace)
5192 if (namespace == std_node)
5194 /* using namespace A::B::C; */
5195 if (TREE_CODE (namespace) == SCOPE_REF)
5196 namespace = TREE_OPERAND (namespace, 1);
5197 if (TREE_CODE (namespace) == IDENTIFIER_NODE)
5199 /* Lookup in lexer did not find a namespace. */
5200 cp_error ("namespace `%T' undeclared", namespace);
5203 if (TREE_CODE (namespace) != NAMESPACE_DECL)
5205 cp_error ("`%T' is not a namespace", namespace);
5208 namespace = ORIGINAL_NAMESPACE (namespace);
5209 if (!toplevel_bindings_p ())
5210 push_using_directive (namespace);
5213 add_using_namespace (current_namespace, namespace, 0);
5217 check_default_args (x)
5220 tree arg = TYPE_ARG_TYPES (TREE_TYPE (x));
5221 int saw_def = 0, i = 0 - (TREE_CODE (TREE_TYPE (x)) == METHOD_TYPE);
5222 for (; arg && arg != void_list_node; arg = TREE_CHAIN (arg), ++i)
5224 if (TREE_PURPOSE (arg))
5228 cp_error_at ("default argument missing for parameter %P of `%+#D'",
5239 TREE_USED (decl) = 1;
5240 if (processing_template_decl)
5242 assemble_external (decl);
5244 /* Is it a synthesized method that needs to be synthesized? */
5245 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_CLASS_CONTEXT (decl)
5246 && DECL_ARTIFICIAL (decl) && ! DECL_INITIAL (decl)
5247 /* Kludge: don't synthesize for default args. */
5248 && current_function_decl)
5249 synthesize_method (decl);
5251 /* If this is a function or variable that is an instance of some
5252 template, we now know that we will need to actually do the
5253 instantiation. A TEMPLATE_DECL may also have DECL_TEMPLATE_INFO,
5254 if it's a partial instantiation, but there's no need to
5255 instantiate such a thing. We check that DECL is not an explicit
5256 instantiation because that is not checked in instantiate_decl. */
5257 if (TREE_CODE (decl) != TEMPLATE_DECL
5258 && DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)
5259 && !DECL_EXPLICIT_INSTANTIATION (decl))
5260 instantiate_decl (decl);
5263 /* Helper function for named_class_head_sans_basetype nonterminal. We
5264 have just seen something of the form `AGGR SCOPE::ID'. Return a
5265 TYPE_DECL for the type declared by ID in SCOPE. */
5268 handle_class_head (aggr, scope, id)
5269 tree aggr, scope, id;
5273 if (TREE_CODE (id) == TYPE_DECL)
5275 else if (DECL_CLASS_TEMPLATE_P (id))
5276 decl = DECL_TEMPLATE_RESULT (id);
5280 cp_error ("`%T' does not have a nested type named `%D'", scope, id);
5282 cp_error ("no file-scope type named `%D'", id);
5284 decl = TYPE_MAIN_DECL (xref_tag (aggr, make_anon_name (), 1));
5287 /* This syntax is only allowed when we're defining a type, so we
5289 push_scope (CP_DECL_CONTEXT (decl));
5291 /* If we see something like:
5293 template <typename T> struct S::I ....
5295 we must create a TEMPLATE_DECL for the nested type. */
5296 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
5297 decl = push_template_decl (decl);