1 /* Process declarations and variables for C compiler.
2 Copyright (C) 1988, 92-99, 2000 Free Software Foundation, Inc.
3 Hacked by Michael Tiemann (tiemann@cygnus.com)
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* Process declarations and symbol lookup for C front end.
24 Also constructs types; the standard scalar types at initialization,
25 and structure, union, array and enum types when they are declared. */
27 /* ??? not all decl nodes are given the most useful possible
28 line numbers. For example, the CONST_DECLs for enum values. */
43 #include "dwarf2out.h"
49 extern cpp_reader parse_in;
52 /* This structure contains information about the initializations
53 and/or destructions required for a particular priority level. */
54 typedef struct priority_info_s {
55 /* Non-zero if there have been any initializations at this priority
56 throughout the translation unit. */
57 int initializations_p;
58 /* Non-zero if there have been any destructions at this priority
59 throughout the translation unit. */
63 static tree get_sentry PARAMS ((tree));
64 static void mark_vtable_entries PARAMS ((tree));
65 static void grok_function_init PARAMS ((tree, tree));
66 static int finish_vtable_vardecl PARAMS ((tree *, void *));
67 static int prune_vtable_vardecl PARAMS ((tree *, void *));
68 static int is_namespace_ancestor PARAMS ((tree, tree));
69 static void add_using_namespace PARAMS ((tree, tree, int));
70 static tree ambiguous_decl PARAMS ((tree, tree, tree,int));
71 static tree build_anon_union_vars PARAMS ((tree, tree*, int, int));
72 static int acceptable_java_type PARAMS ((tree));
73 static void output_vtable_inherit PARAMS ((tree));
74 static tree start_objects PARAMS ((int, int));
75 static void finish_objects PARAMS ((int, int, tree));
76 static tree merge_functions PARAMS ((tree, tree));
77 static tree decl_namespace PARAMS ((tree));
78 static tree validate_nonmember_using_decl PARAMS ((tree, tree *, tree *));
79 static void do_nonmember_using_decl PARAMS ((tree, tree, tree, tree,
81 static tree start_static_storage_duration_function PARAMS ((void));
82 static void finish_static_storage_duration_function PARAMS ((tree));
83 static priority_info get_priority_info PARAMS ((int));
84 static void do_static_initialization PARAMS ((tree, tree));
85 static void do_static_destruction PARAMS ((tree));
86 static tree start_static_initialization_or_destruction PARAMS ((tree, int));
87 static void finish_static_initialization_or_destruction PARAMS ((tree));
88 static void generate_ctor_or_dtor_function PARAMS ((int, int));
89 static int generate_ctor_and_dtor_functions_for_priority
90 PARAMS ((splay_tree_node, void *));
91 static tree prune_vars_needing_no_initialization PARAMS ((tree));
92 static void write_out_vars PARAMS ((tree));
94 extern int current_class_depth;
96 /* A list of virtual function tables we must make sure to write out. */
99 /* A list of static class variables. This is needed, because a
100 static class variable can be declared inside the class without
101 an initializer, and then initialized, staticly, outside the class. */
102 static varray_type pending_statics;
103 #define pending_statics_used \
104 (pending_statics ? pending_statics->elements_used : 0)
106 /* A list of functions which were declared inline, but which we
107 may need to emit outline anyway. */
108 static varray_type saved_inlines;
109 #define saved_inlines_used \
110 (saved_inlines ? saved_inlines->elements_used : 0)
112 /* Same, but not reset. Local temp variables and global temp variables
113 can have the same name. */
114 static int global_temp_name_counter;
116 /* Flag used when debugging spew.c */
118 extern int spew_debug;
120 /* Nonzero if we're done parsing and into end-of-file activities. */
124 /* Functions called along with real static constructors and destructors. */
126 tree static_ctors, static_dtors;
128 /* The :: namespace. */
130 tree global_namespace;
132 /* The stack for namespaces of current declarations. */
134 static tree decl_namespace_list;
137 /* C (and C++) language-specific option variables. */
139 /* Nonzero means allow type mismatches in conditional expressions;
140 just make their values `void'. */
142 int flag_cond_mismatch;
144 /* Nonzero means give `double' the same size as `float'. */
146 int flag_short_double;
148 /* Nonzero means don't recognize the keyword `asm'. */
152 /* Nonzero means don't recognize any extension keywords. */
154 int flag_no_gnu_keywords;
156 /* Nonzero means don't recognize the non-ANSI builtin functions. */
160 /* Nonzero means don't recognize the non-ANSI builtin functions.
163 int flag_no_nonansi_builtin;
165 /* Nonzero means do some things the same way PCC does. Only provided so
166 the compiler will link. */
168 int flag_traditional;
170 /* Nonzero means to treat bitfields as unsigned unless they say `signed'. */
172 int flag_signed_bitfields = 1;
174 /* Nonzero means enable obscure ANSI features and disable GNU extensions
175 that might cause ANSI-compliant code to be miscompiled. */
179 /* Nonzero means do emit exported implementations of functions even if
180 they can be inlined. */
182 int flag_implement_inlines = 1;
184 /* Nonzero means do emit exported implementations of templates, instead of
185 multiple static copies in each file that needs a definition. */
187 int flag_external_templates;
189 /* Nonzero means that the decision to emit or not emit the implementation of a
190 template depends on where the template is instantiated, rather than where
193 int flag_alt_external_templates;
195 /* Nonzero means that implicit instantiations will be emitted if needed. */
197 int flag_implicit_templates = 1;
199 /* Nonzero means that implicit instantiations of inline templates will be
200 emitted if needed, even if instantiations of non-inline templates
203 int flag_implicit_inline_templates = 1;
205 /* Nonzero means warn about implicit declarations. */
207 int warn_implicit = 1;
209 /* Nonzero means warn about usage of long long when `-pedantic'. */
211 int warn_long_long = 1;
213 /* Nonzero means warn when all ctors or dtors are private, and the class
216 int warn_ctor_dtor_privacy = 1;
218 /* True if we want to implement vtables using "thunks".
219 The default is off. */
221 #ifndef DEFAULT_VTABLE_THUNKS
222 #define DEFAULT_VTABLE_THUNKS 0
224 int flag_vtable_thunks = DEFAULT_VTABLE_THUNKS;
226 /* Nonzero means generate separate instantiation control files and juggle
227 them at link time. */
229 int flag_use_repository;
231 /* Nonzero if we want to issue diagnostics that the standard says are not
234 int flag_optional_diags = 1;
236 /* Nonzero means give string constants the type `const char *', as mandated
239 int flag_const_strings = 1;
241 /* If non-NULL, dump the tree structure for the entire translation
242 unit to this file. */
244 char *flag_dump_translation_unit = 0;
246 /* Nonzero means warn about deprecated conversion from string constant to
249 int warn_write_strings;
251 /* Nonzero means warn about pointer casts that can drop a type qualifier
252 from the pointer target type. */
256 /* Nonzero means warn about sizeof(function) or addition/subtraction
257 of function pointers. */
259 int warn_pointer_arith = 1;
261 /* Nonzero means warn for any function def without prototype decl. */
263 int warn_missing_prototypes;
265 /* Nonzero means warn about multiple (redundant) decls for the same single
266 variable or function. */
268 int warn_redundant_decls;
270 /* Warn if initializer is not completely bracketed. */
272 int warn_missing_braces;
274 /* Warn about comparison of signed and unsigned values. */
276 int warn_sign_compare;
278 /* Warn about testing equality of floating point numbers. */
280 int warn_float_equal = 0;
282 /* Warn about *printf or *scanf format/argument anomalies. */
286 /* Warn about a subscript that has type char. */
288 int warn_char_subscripts;
290 /* Warn if a type conversion is done that might have confusing results. */
294 /* Warn if adding () is suggested. */
296 int warn_parentheses;
298 /* Non-zero means warn in function declared in derived class has the
299 same name as a virtual in the base class, but fails to match the
300 type signature of any virtual function in the base class. */
301 int warn_overloaded_virtual;
303 /* Non-zero means warn when declaring a class that has a non virtual
304 destructor, when it really ought to have a virtual one. */
307 /* Non-zero means warn when a function is declared extern and later inline. */
308 int warn_extern_inline;
310 /* Non-zero means warn when the compiler will reorder code. */
313 /* Non-zero means warn when synthesis behavior differs from Cfront's. */
316 /* Non-zero means warn when we convert a pointer to member function
317 into a pointer to (void or function). */
318 int warn_pmf2ptr = 1;
320 /* Nonzero means warn about violation of some Effective C++ style rules. */
324 /* Nonzero means warn where overload resolution chooses a promotion from
325 unsigned to signed over a conversion to an unsigned of the same size. */
329 /* Nonzero means warn when an old-style cast is used. */
331 int warn_old_style_cast;
333 /* Warn about #pragma directives that are not recognised. */
335 int warn_unknown_pragmas; /* Tri state variable. */
337 /* Nonzero means warn about use of multicharacter literals. */
339 int warn_multichar = 1;
341 /* Nonzero means warn when non-templatized friend functions are
342 declared within a template */
344 int warn_nontemplate_friend = 1;
346 /* Nonzero means complain about deprecated features. */
348 int warn_deprecated = 1;
350 /* Nonzero means `$' can be in an identifier. */
352 #ifndef DOLLARS_IN_IDENTIFIERS
353 #define DOLLARS_IN_IDENTIFIERS 1
355 int dollars_in_ident = DOLLARS_IN_IDENTIFIERS;
357 /* Nonzero for -fno-strict-prototype switch: do not consider empty
358 argument prototype to mean function takes no arguments. */
360 int flag_strict_prototype = 2;
361 int strict_prototype = 1;
362 int strict_prototypes_lang_c, strict_prototypes_lang_cplusplus = 1;
364 /* Nonzero means that labels can be used as first-class objects */
368 /* Nonzero means allow Microsoft extensions without a pedwarn. */
370 int flag_ms_extensions;
372 /* Non-zero means to collect statistics which might be expensive
373 and to print them when we are done. */
374 int flag_detailed_statistics;
376 /* C++ specific flags. */
377 /* Zero means that `this' is a *const. This gives nice behavior in the
378 2.0 world. 1 gives 1.2-compatible behavior. 2 gives Spring behavior.
379 -2 means we're constructing an object and it has fixed type. */
381 int flag_this_is_variable;
383 /* Nonzero means we should attempt to elide constructors when possible. */
385 int flag_elide_constructors = 1;
387 /* Nonzero means that member functions defined in class scope are
388 inline by default. */
390 int flag_default_inline = 1;
392 /* Controls whether compiler generates 'type descriptor' that give
393 run-time type information. */
396 /* Nonzero if we wish to output cross-referencing information
397 for the GNU class browser. */
398 extern int flag_gnu_xref;
400 /* Nonzero if we want to support huge (> 2^(sizeof(short)*8-1) bytes)
403 int flag_huge_objects;
405 /* Nonzero if we want to conserve space in the .o files. We do this
406 by putting uninitialized data and runtime initialized data into
407 .common instead of .data at the expense of not flagging multiple
410 int flag_conserve_space;
412 /* Nonzero if we want to obey access control semantics. */
414 int flag_access_control = 1;
416 /* Nonzero if we want to understand the operator names, i.e. 'bitand'. */
418 int flag_operator_names;
420 /* Nonzero if we want to check the return value of new and avoid calling
421 constructors if it is a null pointer. */
425 /* Nonzero if we want the new ANSI rules for pushing a new scope for `for'
426 initialization variables.
427 0: Old rules, set by -fno-for-scope.
428 2: New ANSI rules, set by -ffor-scope.
429 1: Try to implement new ANSI rules, but with backup compatibility
430 (and warnings). This is the default, for now. */
432 int flag_new_for_scope = 1;
434 /* Nonzero if we want to emit defined symbols with common-like linkage as
435 weak symbols where possible, in order to conform to C++ semantics.
436 Otherwise, emit them as local symbols. */
440 /* Nonzero to enable experimental ABI changes. */
444 /* Nonzero to use __cxa_atexit, rather than atexit, to register
445 destructors for local statics and global objects. */
447 int flag_use_cxa_atexit;
449 /* Nonzero to not ignore namespace std. */
453 /* Nonzero if we should expand functions calls inline at the tree
454 level, rather than at the RTL level. */
456 int flag_inline_trees = 0;
458 /* Maximum template instantiation depth. Must be at least 17 for ANSI
461 int max_tinst_depth = 17;
463 /* The name-mangling scheme to use. Must be 1 or greater to support
464 template functions with identical types, but different template
466 int name_mangling_version = 2;
468 /* Nonzero means that guiding declarations are allowed. */
469 int flag_guiding_decls;
471 /* Nonzero if wchar_t should be `unsigned short' instead of whatever it
472 would normally be, for use with WINE. */
473 int flag_short_wchar;
475 /* Nonzero if squashed mangling is to be performed.
476 This uses the B and K codes to reference previously seen class types
477 and class qualifiers. */
478 int flag_do_squangling;
480 /* Nonzero means output .vtable_{entry,inherit} for use in doing vtable gc. */
484 /* Nonzero means make the default pedwarns warnings instead of errors.
485 The value of this flag is ignored if -pedantic is specified. */
489 /* If this variable is defined to a non-NULL value, it will be called
490 after the file has been completely parsed. */
492 void (*back_end_hook) PARAMS ((tree));
494 /* Table of language-dependent -f options.
495 STRING is the option name. VARIABLE is the address of the variable.
496 ON_VALUE is the value to store in VARIABLE
497 if `-fSTRING' is seen as an option.
498 (If `-fno-STRING' is seen as an option, the opposite value is stored.) */
500 static struct { const char *string; int *variable; int on_value;}
504 {"signed-char", &flag_signed_char, 1},
505 {"unsigned-char", &flag_signed_char, 0},
506 {"signed-bitfields", &flag_signed_bitfields, 1},
507 {"unsigned-bitfields", &flag_signed_bitfields, 0},
508 {"short-enums", &flag_short_enums, 1},
509 {"short-double", &flag_short_double, 1},
510 {"short-wchar", &flag_short_wchar, 1},
511 {"cond-mismatch", &flag_cond_mismatch, 1},
512 {"asm", &flag_no_asm, 0},
513 {"builtin", &flag_no_builtin, 0},
515 /* C++-only options. */
516 {"access-control", &flag_access_control, 1},
517 {"check-new", &flag_check_new, 1},
518 {"conserve-space", &flag_conserve_space, 1},
519 {"const-strings", &flag_const_strings, 1},
520 {"default-inline", &flag_default_inline, 1},
521 {"dollars-in-identifiers", &dollars_in_ident, 1},
522 {"elide-constructors", &flag_elide_constructors, 1},
523 {"external-templates", &flag_external_templates, 1},
524 {"for-scope", &flag_new_for_scope, 2},
525 {"gnu-keywords", &flag_no_gnu_keywords, 0},
526 {"handle-exceptions", &flag_exceptions, 1},
527 {"honor-std", &flag_honor_std, 1},
528 {"huge-objects", &flag_huge_objects, 1},
529 {"implement-inlines", &flag_implement_inlines, 1},
530 {"implicit-inline-templates", &flag_implicit_inline_templates, 1},
531 {"implicit-templates", &flag_implicit_templates, 1},
532 {"labels-ok", &flag_labels_ok, 1},
533 {"ms-extensions", &flag_ms_extensions, 1},
534 {"nonansi-builtins", &flag_no_nonansi_builtin, 0},
535 {"operator-names", &flag_operator_names, 1},
536 {"optional-diags", &flag_optional_diags, 1},
537 {"permissive", &flag_permissive, 1},
538 {"repo", &flag_use_repository, 1},
539 {"rtti", &flag_rtti, 1},
540 {"squangle", &flag_do_squangling, 1},
541 {"stats", &flag_detailed_statistics, 1},
542 {"strict-prototype", &flag_strict_prototype, 1},
543 {"use-cxa-atexit", &flag_use_cxa_atexit, 1},
544 {"vtable-gc", &flag_vtable_gc, 1},
545 {"vtable-thunks", &flag_vtable_thunks, 1},
546 {"weak", &flag_weak, 1},
547 {"xref", &flag_gnu_xref, 1}
550 /* Decode the string P as a language-specific option.
551 Return the number of strings consumed for a valid option.
552 Otherwise return 0. Should not complain if it does not
553 recognise the option. */
556 lang_decode_option (argc, argv)
565 int strings_processed;
568 strings_processed = cpp_handle_option (&parse_in, argc, argv);
570 strings_processed = 0;
571 #endif /* ! USE_CPPLIB */
573 /* Enable automatic line wrapping by default */
574 set_message_length (72);
576 if (!strcmp (p, "-ftraditional") || !strcmp (p, "-traditional"))
578 else if (p[0] == '-' && p[1] == 'f')
580 /* Some kind of -f option.
581 P's value is the option sans `-f'.
582 Search for it in the table of options. */
586 /* Try special -f options. */
588 if (!strcmp (p, "handle-exceptions")
589 || !strcmp (p, "no-handle-exceptions"))
590 warning ("-fhandle-exceptions has been renamed to -fexceptions (and is now on by default)");
591 else if (!strcmp (p, "all-virtual")
592 || !strcmp (p, "enum-int-equiv")
593 || !strcmp (p, "no-nonnull-objects")
594 || !strcmp (p, "this-is-variable"))
595 warning ("-f%s is no longer supported", p);
596 else if (! strcmp (p, "alt-external-templates"))
598 flag_external_templates = 1;
599 flag_alt_external_templates = 1;
600 cp_deprecated ("-falt-external-templates");
602 else if (! strcmp (p, "no-alt-external-templates"))
603 flag_alt_external_templates = 0;
604 else if (!strcmp (p, "repo"))
606 flag_use_repository = 1;
607 flag_implicit_templates = 0;
609 else if (!strcmp (p, "guiding-decls"))
611 flag_guiding_decls = 1;
612 name_mangling_version = 0;
614 else if (!strcmp (p, "no-guiding-decls"))
615 flag_guiding_decls = 0;
616 else if (!strcmp (p, "external-templates"))
618 flag_external_templates = 1;
619 cp_deprecated ("-fexternal-templates");
621 else if (!strcmp (p, "new-abi"))
624 flag_do_squangling = 1;
625 flag_vtable_thunks = 1;
627 else if (!strcmp (p, "no-new-abi"))
630 flag_do_squangling = 0;
632 else if (!strncmp (p, "template-depth-", 15))
634 = read_integral_parameter (p + 15, p - 2, max_tinst_depth);
635 else if (!strncmp (p, "name-mangling-version-", 22))
636 name_mangling_version
637 = read_integral_parameter (p + 22, p - 2, name_mangling_version);
638 else if (!strncmp (p, "message-length=", 15))
640 (read_integral_parameter (p + 15, p -2,
641 /* default line-wrap length */ 72));
642 else if (!strncmp (p, "dump-translation-unit-", 22))
645 error ("no file specified with -fdump-translation-unit");
647 flag_dump_translation_unit = p + 22;
654 !found && j < (sizeof (lang_f_options)
655 / sizeof (lang_f_options[0]));
658 if (!strcmp (p, lang_f_options[j].string))
660 *lang_f_options[j].variable = lang_f_options[j].on_value;
661 /* A goto here would be cleaner,
662 but breaks the vax pcc. */
665 if (p[0] == 'n' && p[1] == 'o' && p[2] == '-'
666 && ! strcmp (p+3, lang_f_options[j].string))
668 *lang_f_options[j].variable = ! lang_f_options[j].on_value;
676 else if (p[0] == '-' && p[1] == 'W')
680 /* The -W options control the warning behavior of the compiler. */
683 if (p[0] == 'n' && p[1] == 'o' && p[2] == '-')
686 if (!strcmp (p, "implicit"))
687 warn_implicit = setting;
688 else if (!strcmp (p, "long-long"))
689 warn_long_long = setting;
690 else if (!strcmp (p, "return-type"))
691 warn_return_type = setting;
692 else if (!strcmp (p, "ctor-dtor-privacy"))
693 warn_ctor_dtor_privacy = setting;
694 else if (!strcmp (p, "write-strings"))
695 warn_write_strings = setting;
696 else if (!strcmp (p, "cast-qual"))
697 warn_cast_qual = setting;
698 else if (!strcmp (p, "char-subscripts"))
699 warn_char_subscripts = setting;
700 else if (!strcmp (p, "pointer-arith"))
701 warn_pointer_arith = setting;
702 else if (!strcmp (p, "missing-prototypes"))
703 warn_missing_prototypes = setting;
704 else if (!strcmp (p, "redundant-decls"))
705 warn_redundant_decls = setting;
706 else if (!strcmp (p, "missing-braces"))
707 warn_missing_braces = setting;
708 else if (!strcmp (p, "sign-compare"))
709 warn_sign_compare = setting;
710 else if (!strcmp (p, "float-equal"))
711 warn_float_equal = setting;
712 else if (!strcmp (p, "format"))
713 warn_format = setting;
714 else if (!strcmp (p, "conversion"))
715 warn_conversion = setting;
716 else if (!strcmp (p, "parentheses"))
717 warn_parentheses = setting;
718 else if (!strcmp (p, "non-virtual-dtor"))
719 warn_nonvdtor = setting;
720 else if (!strcmp (p, "extern-inline"))
721 warn_extern_inline = setting;
722 else if (!strcmp (p, "reorder"))
723 warn_reorder = setting;
724 else if (!strcmp (p, "synth"))
725 warn_synth = setting;
726 else if (!strcmp (p, "pmf-conversions"))
727 warn_pmf2ptr = setting;
728 else if (!strcmp (p, "effc++"))
730 else if (!strcmp (p, "sign-promo"))
731 warn_sign_promo = setting;
732 else if (!strcmp (p, "old-style-cast"))
733 warn_old_style_cast = setting;
734 else if (!strcmp (p, "overloaded-virtual"))
735 warn_overloaded_virtual = setting;
736 else if (!strcmp (p, "multichar"))
737 warn_multichar = setting;
738 else if (!strcmp (p, "unknown-pragmas"))
739 /* Set to greater than 1, so that even unknown pragmas in
740 system headers will be warned about. */
741 warn_unknown_pragmas = setting * 2;
742 else if (!strcmp (p, "non-template-friend"))
743 warn_nontemplate_friend = setting;
744 else if (!strcmp (p, "deprecated"))
745 warn_deprecated = setting;
746 else if (!strcmp (p, "comment"))
747 ; /* cpp handles this one. */
748 else if (!strcmp (p, "comments"))
749 ; /* cpp handles this one. */
750 else if (!strcmp (p, "trigraphs"))
751 ; /* cpp handles this one. */
752 else if (!strcmp (p, "import"))
753 ; /* cpp handles this one. */
754 else if (!strcmp (p, "all"))
756 warn_return_type = setting;
757 warn_unused = setting;
758 warn_implicit = setting;
759 warn_switch = setting;
760 warn_format = setting;
761 warn_parentheses = setting;
762 warn_missing_braces = setting;
763 warn_sign_compare = setting;
764 warn_multichar = setting;
765 /* We save the value of warn_uninitialized, since if they put
766 -Wuninitialized on the command line, we need to generate a
767 warning about not using it without also specifying -O. */
768 if (warn_uninitialized != 1)
769 warn_uninitialized = (setting ? 2 : 0);
770 /* Only warn about unknown pragmas that are not in system
772 warn_unknown_pragmas = 1;
774 /* C++-specific warnings. */
775 warn_ctor_dtor_privacy = setting;
776 warn_nonvdtor = setting;
777 warn_reorder = setting;
778 warn_nontemplate_friend = setting;
780 else return strings_processed;
782 else if (!strcmp (p, "-ansi"))
783 flag_no_nonansi_builtin = 1, flag_ansi = 1,
784 flag_no_gnu_keywords = 1, flag_operator_names = 1;
786 /* Undocumented, only ever used when you're invoking cc1plus by hand, since
787 it's probably safe to assume no sane person would ever want to use this
788 under normal circumstances. */
789 else if (!strcmp (p, "-spew-debug"))
793 return strings_processed;
798 /* Incorporate `const' and `volatile' qualifiers for member functions.
799 FUNCTION is a TYPE_DECL or a FUNCTION_DECL.
800 QUALS is a list of qualifiers. Returns any explicit
801 top-level qualifiers of the method's this pointer, anything other than
802 TYPE_UNQUALIFIED will be an extension. */
805 grok_method_quals (ctype, function, quals)
806 tree ctype, function, quals;
808 tree fntype = TREE_TYPE (function);
809 tree raises = TYPE_RAISES_EXCEPTIONS (fntype);
810 int type_quals = TYPE_UNQUALIFIED;
811 int dup_quals = TYPE_UNQUALIFIED;
812 int this_quals = TYPE_UNQUALIFIED;
816 int tq = cp_type_qual_from_rid (TREE_VALUE (quals));
818 if ((type_quals | this_quals) & tq)
820 else if (tq & TYPE_QUAL_RESTRICT)
824 quals = TREE_CHAIN (quals);
828 if (dup_quals != TYPE_UNQUALIFIED)
829 cp_error ("duplicate type qualifiers in %s declaration",
830 TREE_CODE (function) == FUNCTION_DECL
831 ? "member function" : "type");
833 ctype = cp_build_qualified_type (ctype, type_quals);
834 fntype = build_cplus_method_type (ctype, TREE_TYPE (fntype),
835 (TREE_CODE (fntype) == METHOD_TYPE
836 ? TREE_CHAIN (TYPE_ARG_TYPES (fntype))
837 : TYPE_ARG_TYPES (fntype)));
839 fntype = build_exception_variant (fntype, raises);
841 TREE_TYPE (function) = fntype;
845 /* Warn when -fexternal-templates is used and #pragma
846 interface/implementation is not used all the times it should be,
850 warn_if_unknown_interface (decl)
853 static int already_warned = 0;
854 if (already_warned++)
857 if (flag_alt_external_templates)
859 struct tinst_level *til = tinst_for_decl ();
861 char *sf = input_filename;
866 input_filename = til->file;
868 cp_warning ("template `%#D' instantiated in file without #pragma interface",
874 cp_warning_at ("template `%#D' defined in file without #pragma interface",
878 /* A subroutine of the parser, to handle a component list. */
881 grok_x_components (specs)
884 struct pending_inline **p;
887 specs = strip_attrs (specs);
889 check_tag_decl (specs);
890 t = groktypename (build_decl_list (specs, NULL_TREE));
892 /* The only case where we need to do anything additional here is an
893 anonymous union field, e.g.: `struct S { union { int i; }; };'. */
894 if (t == NULL_TREE || !ANON_AGGR_TYPE_P (t))
897 fixup_anonymous_aggr (t);
898 finish_member_declaration (build_lang_decl (FIELD_DECL, NULL_TREE, t));
900 /* Ignore any inline function definitions in the anonymous union
901 since an anonymous union may not have function members. */
902 p = &pending_inlines;
903 for (; *p; *p = (*p)->next)
904 if (DECL_CONTEXT ((*p)->fndecl) != t)
908 /* Constructors for types with virtual baseclasses need an "in-charge" flag
909 saying whether this constructor is responsible for initialization of
910 virtual baseclasses or not. All destructors also need this "in-charge"
911 flag, which additionally determines whether or not the destructor should
912 free the memory for the object.
914 This function adds the "in-charge" flag to member function FN if
915 appropriate. It is called from grokclassfn and tsubst.
916 FN must be either a constructor or destructor. */
919 maybe_retrofit_in_chrg (fn)
922 tree basetype, arg_types, parms, parm, fntype;
924 if (DECL_CONSTRUCTOR_P (fn)
925 && TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (fn))
926 && ! DECL_CONSTRUCTOR_FOR_VBASE_P (fn))
928 else if (! DECL_CONSTRUCTOR_P (fn)
929 && TREE_CHAIN (DECL_ARGUMENTS (fn)) == NULL_TREE)
934 if (DECL_CONSTRUCTOR_P (fn))
935 DECL_CONSTRUCTOR_FOR_VBASE_P (fn) = 1;
937 /* First add it to DECL_ARGUMENTS... */
938 parm = build_decl (PARM_DECL, in_charge_identifier, integer_type_node);
939 /* Mark the artificial `__in_chrg' parameter as "artificial". */
940 SET_DECL_ARTIFICIAL (parm);
941 DECL_ARG_TYPE (parm) = integer_type_node;
942 TREE_READONLY (parm) = 1;
943 parms = DECL_ARGUMENTS (fn);
944 TREE_CHAIN (parm) = TREE_CHAIN (parms);
945 TREE_CHAIN (parms) = parm;
947 /* ...and then to TYPE_ARG_TYPES. */
948 arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
949 basetype = TREE_TYPE (TREE_VALUE (arg_types));
950 arg_types = hash_tree_chain (integer_type_node, TREE_CHAIN (arg_types));
951 fntype = build_cplus_method_type (basetype, TREE_TYPE (TREE_TYPE (fn)),
953 if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)))
954 fntype = build_exception_variant (fntype,
955 TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)));
956 TREE_TYPE (fn) = fntype;
959 /* Classes overload their constituent function names automatically.
960 When a function name is declared in a record structure,
961 its name is changed to it overloaded name. Since names for
962 constructors and destructors can conflict, we place a leading
965 CNAME is the name of the class we are grokking for.
967 FUNCTION is a FUNCTION_DECL. It was created by `grokdeclarator'.
969 FLAGS contains bits saying what's special about today's
970 arguments. 1 == DESTRUCTOR. 2 == OPERATOR.
972 If FUNCTION is a destructor, then we must add the `auto-delete' field
973 as a second parameter. There is some hair associated with the fact
974 that we must "declare" this variable in the manner consistent with the
975 way the rest of the arguments were declared.
977 QUALS are the qualifiers for the this pointer. */
980 grokclassfn (ctype, function, flags, quals)
981 tree ctype, function;
982 enum overload_flags flags;
985 tree fn_name = DECL_NAME (function);
986 int this_quals = TYPE_UNQUALIFIED;
988 if (fn_name == NULL_TREE)
990 error ("name missing for member function");
991 fn_name = get_identifier ("<anonymous>");
992 DECL_NAME (function) = fn_name;
996 this_quals = grok_method_quals (ctype, function, quals);
998 if (TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
1000 /* Must add the class instance variable up front. */
1001 /* Right now we just make this a pointer. But later
1002 we may wish to make it special. */
1003 tree type = TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (function)));
1005 tree parm = build_decl (PARM_DECL, this_identifier,
1006 cp_build_qualified_type (type, this_quals | TYPE_QUAL_CONST));
1007 /* Mark the artificial `this' parameter as "artificial". */
1008 SET_DECL_ARTIFICIAL (parm);
1009 DECL_ARG_TYPE (parm) = type;
1010 /* We can make this a register, so long as we don't
1011 accidentally complain if someone tries to take its address. */
1012 DECL_REGISTER (parm) = 1;
1013 TREE_CHAIN (parm) = last_function_parms;
1014 last_function_parms = parm;
1017 DECL_ARGUMENTS (function) = last_function_parms;
1018 /* First approximations. */
1019 DECL_CONTEXT (function) = ctype;
1020 DECL_VIRTUAL_CONTEXT (function) = ctype;
1022 if (flags == DTOR_FLAG || DECL_CONSTRUCTOR_P (function))
1023 maybe_retrofit_in_chrg (function);
1025 if (flags == DTOR_FLAG)
1027 DECL_ASSEMBLER_NAME (function) = build_destructor_name (ctype);
1028 TYPE_HAS_DESTRUCTOR (ctype) = 1;
1031 set_mangled_name_for_decl (function);
1034 /* Work on the expr used by alignof (this is only called by the parser). */
1043 if (processing_template_decl)
1044 return build_min (ALIGNOF_EXPR, sizetype, expr);
1046 if (TREE_CODE (expr) == COMPONENT_REF
1047 && DECL_C_BIT_FIELD (TREE_OPERAND (expr, 1)))
1048 error ("`__alignof__' applied to a bit-field");
1050 if (TREE_CODE (expr) == INDIRECT_REF)
1052 best = t = TREE_OPERAND (expr, 0);
1053 bestalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
1055 while (TREE_CODE (t) == NOP_EXPR
1056 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == POINTER_TYPE)
1059 t = TREE_OPERAND (t, 0);
1060 thisalign = TYPE_ALIGN (TREE_TYPE (TREE_TYPE (t)));
1061 if (thisalign > bestalign)
1062 best = t, bestalign = thisalign;
1064 return c_alignof (TREE_TYPE (TREE_TYPE (best)));
1067 return c_alignof (TREE_TYPE (expr));
1070 /* Create an ARRAY_REF, checking for the user doing things backwards
1074 grok_array_decl (array_expr, index_exp)
1075 tree array_expr, index_exp;
1077 tree type = TREE_TYPE (array_expr);
1078 tree p1, p2, i1, i2;
1080 if (type == error_mark_node || index_exp == error_mark_node)
1081 return error_mark_node;
1082 if (processing_template_decl)
1083 return build_min (ARRAY_REF, type ? TREE_TYPE (type) : NULL_TREE,
1084 array_expr, index_exp);
1086 if (type == NULL_TREE)
1088 /* Something has gone very wrong. Assume we are mistakenly reducing
1089 an expression instead of a declaration. */
1090 error ("parser may be lost: is there a '{' missing somewhere?");
1094 if (TREE_CODE (type) == OFFSET_TYPE
1095 || TREE_CODE (type) == REFERENCE_TYPE)
1096 type = TREE_TYPE (type);
1098 /* If they have an `operator[]', use that. */
1099 if (IS_AGGR_TYPE (type) || IS_AGGR_TYPE (TREE_TYPE (index_exp)))
1100 return build_opfncall (ARRAY_REF, LOOKUP_NORMAL,
1101 array_expr, index_exp, NULL_TREE);
1103 /* Otherwise, create an ARRAY_REF for a pointer or array type. It
1104 is a little-known fact that, if `a' is an array and `i' is an
1105 int, you can write `i[a]', which means the same thing as `a[i]'. */
1107 if (TREE_CODE (type) == ARRAY_TYPE)
1110 p1 = build_expr_type_conversion (WANT_POINTER, array_expr, 0);
1112 if (TREE_CODE (TREE_TYPE (index_exp)) == ARRAY_TYPE)
1115 p2 = build_expr_type_conversion (WANT_POINTER, index_exp, 0);
1117 i1 = build_expr_type_conversion (WANT_INT | WANT_ENUM, array_expr, 0);
1118 i2 = build_expr_type_conversion (WANT_INT | WANT_ENUM, index_exp, 0);
1120 if ((p1 && i2) && (i1 && p2))
1121 error ("ambiguous conversion for array subscript");
1124 array_expr = p1, index_exp = i2;
1126 array_expr = p2, index_exp = i1;
1129 cp_error ("invalid types `%T[%T]' for array subscript",
1130 type, TREE_TYPE (index_exp));
1131 return error_mark_node;
1134 if (array_expr == error_mark_node || index_exp == error_mark_node)
1135 error ("ambiguous conversion for array subscript");
1137 return build_array_ref (array_expr, index_exp);
1140 /* Given the cast expression EXP, checking out its validity. Either return
1141 an error_mark_node if there was an unavoidable error, return a cast to
1142 void for trying to delete a pointer w/ the value 0, or return the
1143 call to delete. If DOING_VEC is 1, we handle things differently
1144 for doing an array delete. If DOING_VEC is 2, they gave us the
1145 array size as an argument to delete.
1146 Implements ARM $5.3.4. This is called from the parser. */
1149 delete_sanity (exp, size, doing_vec, use_global_delete)
1151 int doing_vec, use_global_delete;
1154 /* For a regular vector delete (aka, no size argument) we will pass
1155 this down as a NULL_TREE into build_vec_delete. */
1156 tree maxindex = NULL_TREE;
1158 if (exp == error_mark_node)
1161 if (processing_template_decl)
1163 t = build_min (DELETE_EXPR, void_type_node, exp, size);
1164 DELETE_EXPR_USE_GLOBAL (t) = use_global_delete;
1165 DELETE_EXPR_USE_VEC (t) = doing_vec;
1169 if (TREE_CODE (exp) == OFFSET_REF)
1170 exp = resolve_offset_ref (exp);
1171 exp = convert_from_reference (exp);
1172 t = stabilize_reference (exp);
1173 t = build_expr_type_conversion (WANT_POINTER, t, 1);
1175 if (t == NULL_TREE || t == error_mark_node)
1177 cp_error ("type `%#T' argument given to `delete', expected pointer",
1179 return error_mark_node;
1184 maxindex = build_binary_op (MINUS_EXPR, size, integer_one_node);
1185 pedwarn ("anachronistic use of array size in vector delete");
1188 type = TREE_TYPE (t);
1190 /* As of Valley Forge, you can delete a pointer to const. */
1192 /* You can't delete functions. */
1193 if (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
1195 error ("cannot delete a function");
1196 return error_mark_node;
1199 /* Deleting ptr to void is undefined behaviour [expr.delete/3]. */
1200 if (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE)
1201 cp_warning ("`%T' is not a pointer-to-object type", type);
1203 /* An array can't have been allocated by new, so complain. */
1204 if (TREE_CODE (t) == ADDR_EXPR
1205 && TREE_CODE (TREE_OPERAND (t, 0)) == VAR_DECL
1206 && TREE_CODE (TREE_TYPE (TREE_OPERAND (t, 0))) == ARRAY_TYPE)
1207 cp_warning ("deleting array `%#D'", TREE_OPERAND (t, 0));
1209 /* Deleting a pointer with the value zero is valid and has no effect. */
1210 if (integer_zerop (t))
1211 return build1 (NOP_EXPR, void_type_node, t);
1214 return build_vec_delete (t, maxindex, integer_one_node, use_global_delete);
1217 if (IS_AGGR_TYPE (TREE_TYPE (type))
1218 && TYPE_GETS_REG_DELETE (TREE_TYPE (type)))
1220 /* Only do access checking here; we'll be calling op delete
1221 from the destructor. */
1222 tree tmp = build_op_delete_call (DELETE_EXPR, t, size_zero_node,
1223 LOOKUP_NORMAL, NULL_TREE);
1224 if (tmp == error_mark_node)
1225 return error_mark_node;
1228 return build_delete (type, t, integer_three_node,
1229 LOOKUP_NORMAL, use_global_delete);
1233 /* Report an error if the indicated template declaration is not the
1234 sort of thing that should be a member template. */
1237 check_member_template (tmpl)
1242 my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0);
1243 decl = DECL_TEMPLATE_RESULT (tmpl);
1245 if (TREE_CODE (decl) == FUNCTION_DECL
1246 || (TREE_CODE (decl) == TYPE_DECL
1247 && IS_AGGR_TYPE (TREE_TYPE (decl))))
1249 if (current_function_decl)
1250 /* 14.5.2.2 [temp.mem]
1252 A local class shall not have member templates. */
1253 cp_error ("declaration of member template `%#D' in local class",
1256 if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VIRTUAL_P (decl))
1258 /* 14.5.2.3 [temp.mem]
1260 A member function template shall not be virtual. */
1262 ("invalid use of `virtual' in template declaration of `%#D'",
1264 DECL_VIRTUAL_P (decl) = 0;
1267 /* The debug-information generating code doesn't know what to do
1268 with member templates. */
1269 DECL_IGNORED_P (tmpl) = 1;
1272 cp_error ("template declaration of `%#D'", decl);
1275 /* Return true iff TYPE is a valid Java parameter or return type. */
1278 acceptable_java_type (type)
1281 if (TREE_CODE (type) == VOID_TYPE || TYPE_FOR_JAVA (type))
1283 if (TREE_CODE (type) == POINTER_TYPE)
1285 type = TREE_TYPE (type);
1286 if (TREE_CODE (type) == RECORD_TYPE)
1289 if (! TYPE_FOR_JAVA (type))
1291 if (! CLASSTYPE_TEMPLATE_INFO (type))
1293 args = CLASSTYPE_TI_ARGS (type);
1294 i = TREE_VEC_LENGTH (args);
1297 type = TREE_VEC_ELT (args, i);
1298 if (TREE_CODE (type) == POINTER_TYPE)
1299 type = TREE_TYPE (type);
1300 if (! TYPE_FOR_JAVA (type))
1309 /* For a METHOD in a Java class CTYPE, return 1 if
1310 the parameter and return types are valid Java types.
1311 Otherwise, print appropriate error messages, and return 0. */
1314 check_java_method (method)
1318 tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (method));
1319 tree ret_type = TREE_TYPE (TREE_TYPE (method));
1320 if (! acceptable_java_type (ret_type))
1322 cp_error ("Java method '%D' has non-Java return type `%T'",
1326 for (; arg_types != NULL_TREE; arg_types = TREE_CHAIN (arg_types))
1328 tree type = TREE_VALUE (arg_types);
1329 if (! acceptable_java_type (type))
1331 cp_error ("Java method '%D' has non-Java parameter type `%T'",
1336 return jerr ? 0 : 1;
1339 /* Sanity check: report error if this function FUNCTION is not
1340 really a member of the class (CTYPE) it is supposed to belong to.
1341 CNAME is the same here as it is for grokclassfn above. */
1344 check_classfn (ctype, function)
1345 tree ctype, function;
1347 tree fn_name = DECL_NAME (function);
1348 tree fndecl, fndecls;
1349 tree method_vec = CLASSTYPE_METHOD_VEC (complete_type (ctype));
1353 if (DECL_USE_TEMPLATE (function)
1354 && is_member_template (DECL_TI_TEMPLATE (function)))
1355 /* Since this is a specialization of a member template,
1356 we're not going to find the declaration in the class.
1359 struct S { template <typename T> void f(T); };
1360 template <> void S::f(int);
1362 we're not going to find `S::f(int)', but there's no
1363 reason we should, either. We let our callers know we didn't
1364 find the method, but we don't complain. */
1367 if (method_vec != 0)
1369 methods = &TREE_VEC_ELT (method_vec, 0);
1370 end = TREE_VEC_END (method_vec);
1372 /* First suss out ctors and dtors. */
1373 if (*methods && fn_name == DECL_NAME (OVL_CURRENT (*methods))
1374 && DECL_CONSTRUCTOR_P (function))
1376 if (*++methods && fn_name == DECL_NAME (OVL_CURRENT (*methods))
1377 && DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function)))
1380 while (++methods != end && *methods)
1383 if (fn_name == DECL_NAME (OVL_CURRENT (*methods)))
1386 for (fndecls = *methods; fndecls != NULL_TREE;
1387 fndecls = OVL_NEXT (fndecls))
1389 fndecl = OVL_CURRENT (fndecls);
1390 /* The DECL_ASSEMBLER_NAME for a TEMPLATE_DECL, or
1391 for a for member function of a template class, is
1392 not mangled, so the check below does not work
1393 correctly in that case. Since mangled destructor
1394 names do not include the type of the arguments,
1395 we can't use this short-cut for them, either.
1396 (It's not legal to declare arguments for a
1397 destructor, but some people try.) */
1398 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (function))
1399 && (DECL_ASSEMBLER_NAME (function)
1400 != DECL_NAME (function))
1401 && (DECL_ASSEMBLER_NAME (fndecl)
1402 != DECL_NAME (fndecl))
1403 && (DECL_ASSEMBLER_NAME (function)
1404 == DECL_ASSEMBLER_NAME (fndecl)))
1407 /* We cannot simply call decls_match because this
1408 doesn't work for static member functions that are
1409 pretending to be methods, and because the name
1410 may have been changed by asm("new_name"). */
1411 if (DECL_NAME (function) == DECL_NAME (fndecl))
1413 tree p1 = TYPE_ARG_TYPES (TREE_TYPE (function));
1414 tree p2 = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
1416 /* Get rid of the this parameter on functions that become
1418 if (DECL_STATIC_FUNCTION_P (fndecl)
1419 && TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
1420 p1 = TREE_CHAIN (p1);
1422 if (same_type_p (TREE_TYPE (TREE_TYPE (function)),
1423 TREE_TYPE (TREE_TYPE (fndecl)))
1424 && compparms (p1, p2)
1425 && (DECL_TEMPLATE_SPECIALIZATION (function)
1426 == DECL_TEMPLATE_SPECIALIZATION (fndecl))
1427 && (!DECL_TEMPLATE_SPECIALIZATION (function)
1428 || (DECL_TI_TEMPLATE (function)
1429 == DECL_TI_TEMPLATE (fndecl))))
1438 if (methods != end && *methods)
1440 tree fndecl = *methods;
1441 cp_error ("prototype for `%#D' does not match any in class `%T'",
1443 cp_error_at ("candidate%s: %+#D", OVL_NEXT (fndecl) ? "s are" : " is",
1444 OVL_CURRENT (fndecl));
1445 while (fndecl = OVL_NEXT (fndecl), fndecl)
1446 cp_error_at (" %#D", OVL_CURRENT(fndecl));
1451 if (TYPE_SIZE (ctype) == 0)
1452 incomplete_type_error (function, ctype);
1454 cp_error ("no `%#D' member function declared in class `%T'",
1458 /* If we did not find the method in the class, add it to avoid
1459 spurious errors (unless the CTYPE is not yet defined, in which
1460 case we'll only confuse ourselves when the function is declared
1461 properly within the class. */
1462 if (TYPE_SIZE (ctype))
1463 add_method (ctype, methods, function);
1467 /* We have just processed the DECL, which is a static data member.
1468 Its initializer, if present, is INIT. The ASMSPEC_TREE, if
1469 present, is the assembly-language name for the data member.
1470 FLAGS is as for cp_finish_decl. */
1473 finish_static_data_member_decl (decl, init, asmspec_tree, flags)
1479 const char *asmspec = 0;
1482 asmspec = TREE_STRING_POINTER (asmspec_tree);
1484 my_friendly_assert (TREE_PUBLIC (decl), 0);
1486 /* We cannot call pushdecl here, because that would fill in the
1487 decl of our TREE_CHAIN. Instead, we modify cp_finish_decl to do
1488 the right thing, namely, to put this decl out straight away. */
1489 /* current_class_type can be NULL_TREE in case of error. */
1490 if (!asmspec && current_class_type)
1492 DECL_INITIAL (decl) = error_mark_node;
1493 DECL_ASSEMBLER_NAME (decl)
1494 = build_static_name (current_class_type, DECL_NAME (decl));
1496 if (! processing_template_decl)
1498 if (!pending_statics)
1499 VARRAY_TREE_INIT (pending_statics, 32, "pending_statics");
1500 VARRAY_PUSH_TREE (pending_statics, decl);
1503 /* Static consts need not be initialized in the class definition. */
1504 if (init != NULL_TREE && TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
1506 static int explanation = 0;
1508 error ("initializer invalid for static member with constructor");
1509 if (explanation++ == 0)
1510 error ("(you really want to initialize it separately)");
1513 /* Force the compiler to know when an uninitialized static const
1514 member is being used. */
1515 if (CP_TYPE_CONST_P (TREE_TYPE (decl)) && init == 0)
1516 TREE_USED (decl) = 1;
1517 DECL_INITIAL (decl) = init;
1518 DECL_IN_AGGR_P (decl) = 1;
1519 DECL_CONTEXT (decl) = current_class_type;
1521 cp_finish_decl (decl, init, asmspec_tree, flags);
1524 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
1525 of a structure component, returning a FIELD_DECL node.
1526 QUALS is a list of type qualifiers for this decl (such as for declaring
1527 const member functions).
1529 This is done during the parsing of the struct declaration.
1530 The FIELD_DECL nodes are chained together and the lot of them
1531 are ultimately passed to `build_struct' to make the RECORD_TYPE node.
1535 If class A defines that certain functions in class B are friends, then
1536 the way I have set things up, it is B who is interested in permission
1537 granted by A. However, it is in A's context that these declarations
1538 are parsed. By returning a void_type_node, class A does not attempt
1539 to incorporate the declarations of the friends within its structure.
1541 DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
1542 CHANGES TO CODE IN `start_method'. */
1545 grokfield (declarator, declspecs, init, asmspec_tree, attrlist)
1546 tree declarator, declspecs, init, asmspec_tree, attrlist;
1548 register tree value;
1549 const char *asmspec = 0;
1550 int flags = LOOKUP_ONLYCONVERTING;
1552 /* Convert () initializers to = initializers. */
1553 if (init == NULL_TREE && declarator != NULL_TREE
1554 && TREE_CODE (declarator) == CALL_EXPR
1555 && TREE_OPERAND (declarator, 0)
1556 && (TREE_CODE (TREE_OPERAND (declarator, 0)) == IDENTIFIER_NODE
1557 || TREE_CODE (TREE_OPERAND (declarator, 0)) == SCOPE_REF)
1558 && parmlist_is_exprlist (CALL_DECLARATOR_PARMS (declarator)))
1560 init = TREE_OPERAND (declarator, 1);
1561 declarator = TREE_OPERAND (declarator, 0);
1565 if (declspecs == NULL_TREE
1566 && TREE_CODE (declarator) == SCOPE_REF
1567 && TREE_CODE (TREE_OPERAND (declarator, 1)) == IDENTIFIER_NODE)
1569 /* Access declaration */
1570 if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator, 0))))
1572 else if (TREE_COMPLEXITY (declarator) == current_class_depth)
1573 pop_nested_class ();
1574 return do_class_using_decl (declarator);
1578 && TREE_CODE (init) == TREE_LIST
1579 && TREE_VALUE (init) == error_mark_node
1580 && TREE_CHAIN (init) == NULL_TREE)
1583 value = grokdeclarator (declarator, declspecs, FIELD, init != 0, attrlist);
1584 if (! value || value == error_mark_node)
1585 /* friend or constructor went bad. */
1588 /* Pass friendly classes back. */
1589 if (TREE_CODE (value) == VOID_TYPE)
1590 return void_type_node;
1592 if (DECL_NAME (value) != NULL_TREE
1593 && IDENTIFIER_POINTER (DECL_NAME (value))[0] == '_'
1594 && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value)), "_vptr"))
1595 cp_error ("member `%D' conflicts with virtual function table field name",
1598 /* Stash away type declarations. */
1599 if (TREE_CODE (value) == TYPE_DECL)
1601 DECL_NONLOCAL (value) = 1;
1602 DECL_CONTEXT (value) = current_class_type;
1604 /* Now that we've updated the context, we need to remangle the
1605 name for this TYPE_DECL. */
1606 DECL_ASSEMBLER_NAME (value) = DECL_NAME (value);
1607 if (!uses_template_parms (value))
1608 DECL_ASSEMBLER_NAME (value) =
1609 get_identifier (build_overload_name (TREE_TYPE (value), 1, 1));
1611 if (processing_template_decl)
1612 value = push_template_decl (value);
1617 if (DECL_IN_AGGR_P (value))
1619 cp_error ("`%D' is already defined in `%T'", value,
1620 DECL_CONTEXT (value));
1621 return void_type_node;
1625 asmspec = TREE_STRING_POINTER (asmspec_tree);
1629 if (TREE_CODE (value) == FUNCTION_DECL)
1631 grok_function_init (value, init);
1634 else if (pedantic && TREE_CODE (value) != VAR_DECL)
1635 /* Already complained in grokdeclarator. */
1639 /* We allow initializers to become parameters to base
1641 if (TREE_CODE (init) == TREE_LIST)
1643 if (TREE_CHAIN (init) == NULL_TREE)
1644 init = TREE_VALUE (init);
1646 init = digest_init (TREE_TYPE (value), init, (tree *)0);
1649 if (TREE_CODE (init) == CONST_DECL)
1650 init = DECL_INITIAL (init);
1651 else if (TREE_READONLY_DECL_P (init))
1652 init = decl_constant_value (init);
1653 else if (TREE_CODE (init) == CONSTRUCTOR)
1654 init = digest_init (TREE_TYPE (value), init, (tree *)0);
1655 if (init == error_mark_node)
1656 /* We must make this look different than `error_mark_node'
1657 because `decl_const_value' would mis-interpret it
1658 as only meaning that this VAR_DECL is defined. */
1659 init = build1 (NOP_EXPR, TREE_TYPE (value), init);
1660 else if (processing_template_decl)
1662 else if (! TREE_CONSTANT (init))
1664 /* We can allow references to things that are effectively
1665 static, since references are initialized with the address. */
1666 if (TREE_CODE (TREE_TYPE (value)) != REFERENCE_TYPE
1667 || (TREE_STATIC (init) == 0
1668 && (TREE_CODE_CLASS (TREE_CODE (init)) != 'd'
1669 || DECL_EXTERNAL (init) == 0)))
1671 error ("field initializer is not constant");
1672 init = error_mark_node;
1678 if (processing_template_decl && ! current_function_decl
1679 && (TREE_CODE (value) == VAR_DECL || TREE_CODE (value) == FUNCTION_DECL))
1680 value = push_template_decl (value);
1683 cplus_decl_attributes (value, TREE_PURPOSE (attrlist),
1684 TREE_VALUE (attrlist));
1686 if (TREE_CODE (value) == VAR_DECL)
1688 finish_static_data_member_decl (value, init, asmspec_tree,
1692 if (TREE_CODE (value) == FIELD_DECL)
1696 /* This must override the asm specifier which was placed
1697 by grokclassfn. Lay this out fresh. */
1698 DECL_RTL (value) = NULL_RTX;
1699 DECL_ASSEMBLER_NAME (value) = get_identifier (asmspec);
1701 if (DECL_INITIAL (value) == error_mark_node)
1702 init = error_mark_node;
1703 cp_finish_decl (value, init, asmspec_tree, flags);
1704 DECL_INITIAL (value) = init;
1705 DECL_IN_AGGR_P (value) = 1;
1708 if (TREE_CODE (value) == FUNCTION_DECL)
1712 /* This must override the asm specifier which was placed
1713 by grokclassfn. Lay this out fresh. */
1714 DECL_RTL (value) = NULL_RTX;
1715 DECL_ASSEMBLER_NAME (value) = get_identifier (asmspec);
1717 cp_finish_decl (value, init, asmspec_tree, flags);
1719 /* Pass friends back this way. */
1720 if (DECL_FRIEND_P (value))
1721 return void_type_node;
1723 DECL_IN_AGGR_P (value) = 1;
1726 my_friendly_abort (21);
1731 /* Like `grokfield', but for bitfields.
1732 WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node. */
1735 grokbitfield (declarator, declspecs, width)
1736 tree declarator, declspecs, width;
1738 register tree value = grokdeclarator (declarator, declspecs, BITFIELD,
1741 if (! value) return NULL_TREE; /* friends went bad. */
1743 /* Pass friendly classes back. */
1744 if (TREE_CODE (value) == VOID_TYPE)
1745 return void_type_node;
1747 if (TREE_CODE (value) == TYPE_DECL)
1749 cp_error ("cannot declare `%D' to be a bitfield type", value);
1753 /* Usually, finish_struct_1 catches bitifields with invalid types.
1754 But, in the case of bitfields with function type, we confuse
1755 ourselves into thinking they are member functions, so we must
1757 if (TREE_CODE (value) == FUNCTION_DECL)
1759 cp_error ("cannot declare bitfield `%D' with funcion type",
1764 if (DECL_IN_AGGR_P (value))
1766 cp_error ("`%D' is already defined in the class %T", value,
1767 DECL_CONTEXT (value));
1768 return void_type_node;
1771 GNU_xref_member (current_class_name, value);
1773 if (TREE_STATIC (value))
1775 cp_error ("static member `%D' cannot be a bitfield", value);
1778 cp_finish_decl (value, NULL_TREE, NULL_TREE, 0);
1780 if (width != error_mark_node)
1782 constant_expression_warning (width);
1783 DECL_INITIAL (value) = width;
1784 SET_DECL_C_BIT_FIELD (value);
1787 DECL_IN_AGGR_P (value) = 1;
1792 grokoptypename (declspecs, declarator)
1793 tree declspecs, declarator;
1795 tree t = grokdeclarator (declarator, declspecs, TYPENAME, 0, NULL_TREE);
1796 return build_typename_overload (t);
1799 /* When a function is declared with an initializer,
1800 do the right thing. Currently, there are two possibilities:
1805 // initialization possibility #1.
1806 virtual void f () = 0;
1828 // initialization possibility #2
1835 copy_assignment_arg_p (parmtype, virtualp)
1837 int virtualp ATTRIBUTE_UNUSED;
1839 if (current_class_type == NULL_TREE)
1842 if (TREE_CODE (parmtype) == REFERENCE_TYPE)
1843 parmtype = TREE_TYPE (parmtype);
1845 if ((TYPE_MAIN_VARIANT (parmtype) == current_class_type)
1847 /* Non-standard hack to support old Booch components. */
1848 || (! virtualp && DERIVED_FROM_P (parmtype, current_class_type))
1857 grok_function_init (decl, init)
1861 /* An initializer for a function tells how this function should
1863 tree type = TREE_TYPE (decl);
1865 if (TREE_CODE (type) == FUNCTION_TYPE)
1866 cp_error ("initializer specified for non-member function `%D'", decl);
1868 /* We'll check for this in finish_struct_1. */
1869 else if (DECL_VINDEX (decl) == NULL_TREE)
1870 cp_error ("initializer specified for non-virtual method `%D'", decl);
1872 else if (integer_zerop (init))
1875 /* Mark this function as being "defined". */
1876 DECL_INITIAL (decl) = error_mark_node;
1877 /* pure virtual destructors must be defined. */
1878 /* pure virtual needs to be defined (as abort) only when put in
1879 vtbl. For wellformed call, it should be itself. pr4737 */
1880 if (!DESTRUCTOR_NAME_P (DECL_ASSEMBLER_NAME (decl)))
1882 /* Give this node rtl from `abort'. */
1883 DECL_RTL (decl) = DECL_RTL (abort_fndecl);
1886 DECL_PURE_VIRTUAL_P (decl) = 1;
1887 if (DECL_NAME (decl) == ansi_opname [(int) MODIFY_EXPR])
1890 = TREE_VALUE (TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (decl))));
1892 if (copy_assignment_arg_p (parmtype, 1))
1893 TYPE_HAS_ABSTRACT_ASSIGN_REF (current_class_type) = 1;
1897 cp_error ("invalid initializer for virtual method `%D'", decl);
1901 cplus_decl_attributes (decl, attributes, prefix_attributes)
1902 tree decl, attributes, prefix_attributes;
1904 if (decl == NULL_TREE || decl == void_type_node)
1907 if (TREE_CODE (decl) == TEMPLATE_DECL)
1908 decl = DECL_TEMPLATE_RESULT (decl);
1910 decl_attributes (decl, attributes, prefix_attributes);
1912 if (TREE_CODE (decl) == TYPE_DECL)
1913 SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (decl), TREE_TYPE (decl));
1916 /* CONSTRUCTOR_NAME:
1917 Return the name for the constructor (or destructor) for the
1918 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1919 IDENTIFIER_NODE. When given a template, this routine doesn't
1920 lose the specialization. */
1923 constructor_name_full (thing)
1926 if (TREE_CODE (thing) == TEMPLATE_TYPE_PARM
1927 || TREE_CODE (thing) == TEMPLATE_TEMPLATE_PARM
1928 || TREE_CODE (thing) == TYPENAME_TYPE)
1929 thing = TYPE_NAME (thing);
1930 else if (IS_AGGR_TYPE_CODE (TREE_CODE (thing)))
1932 if (TYPE_WAS_ANONYMOUS (thing) && TYPE_HAS_CONSTRUCTOR (thing))
1933 thing = DECL_NAME (OVL_CURRENT (TREE_VEC_ELT (CLASSTYPE_METHOD_VEC (thing), 0)));
1935 thing = TYPE_NAME (thing);
1937 if (TREE_CODE (thing) == TYPE_DECL
1938 || (TREE_CODE (thing) == TEMPLATE_DECL
1939 && TREE_CODE (DECL_TEMPLATE_RESULT (thing)) == TYPE_DECL))
1940 thing = DECL_NAME (thing);
1941 my_friendly_assert (TREE_CODE (thing) == IDENTIFIER_NODE, 197);
1945 /* CONSTRUCTOR_NAME:
1946 Return the name for the constructor (or destructor) for the
1947 specified class. Argument can be RECORD_TYPE, TYPE_DECL, or
1948 IDENTIFIER_NODE. When given a template, return the plain
1949 unspecialized name. */
1952 constructor_name (thing)
1956 thing = constructor_name_full (thing);
1957 t = IDENTIFIER_TEMPLATE (thing);
1963 /* Record the existence of an addressable inline function. */
1966 mark_inline_for_output (decl)
1969 decl = DECL_MAIN_VARIANT (decl);
1970 if (DECL_SAVED_INLINE (decl))
1972 DECL_SAVED_INLINE (decl) = 1;
1974 VARRAY_TREE_INIT (saved_inlines, 32, "saved_inlines");
1976 VARRAY_PUSH_TREE (saved_inlines, decl);
1979 /* Hand off a unique name which can be used for variable we don't really
1980 want to know about anyway, for example, the anonymous variables which
1981 are needed to make references work. Declare this thing so we can use it.
1982 The variable created will be of type TYPE.
1984 STATICP is nonzero if this variable should be static. */
1987 get_temp_name (type, staticp)
1991 char buf[sizeof (AUTO_TEMP_FORMAT) + 20];
1993 int toplev = toplevel_bindings_p ();
1995 if (toplev || staticp)
1997 sprintf (buf, AUTO_TEMP_FORMAT, global_temp_name_counter++);
1998 decl = pushdecl_top_level (build_decl (VAR_DECL, get_identifier (buf), type));
2002 sprintf (buf, AUTO_TEMP_FORMAT, temp_name_counter++);
2003 decl = pushdecl (build_decl (VAR_DECL, get_identifier (buf), type));
2005 TREE_USED (decl) = 1;
2006 TREE_STATIC (decl) = staticp;
2007 DECL_ARTIFICIAL (decl) = 1;
2009 /* If this is a local variable, then lay out its rtl now.
2010 Otherwise, callers of this function are responsible for dealing
2011 with this variable's rtl. */
2015 my_friendly_assert (DECL_INITIAL (decl) == NULL_TREE,
2022 /* Hunts through the global anonymous union ANON_DECL, building
2023 appropriate VAR_DECLs. Stores cleanups on the list of ELEMS, and
2024 returns a VAR_DECL whose size is the same as the size of the
2025 ANON_DECL, if one is available. */
2028 build_anon_union_vars (anon_decl, elems, static_p, external_p)
2034 tree type = TREE_TYPE (anon_decl);
2035 tree main_decl = NULL_TREE;
2038 /* Rather than write the code to handle the non-union case,
2039 just give an error. */
2040 if (TREE_CODE (type) != UNION_TYPE)
2041 error ("anonymous struct not inside named type");
2043 for (field = TYPE_FIELDS (type);
2045 field = TREE_CHAIN (field))
2049 if (DECL_ARTIFICIAL (field))
2051 if (TREE_CODE (field) != FIELD_DECL)
2053 cp_pedwarn_at ("`%#D' invalid; an anonymous union can only have non-static data members",
2058 if (TREE_PRIVATE (field))
2059 cp_pedwarn_at ("private member `%#D' in anonymous union", field);
2060 else if (TREE_PROTECTED (field))
2061 cp_pedwarn_at ("protected member `%#D' in anonymous union", field);
2063 if (DECL_NAME (field) == NULL_TREE
2064 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2066 decl = build_anon_union_vars (field, elems, static_p, external_p);
2070 else if (DECL_NAME (field) == NULL_TREE)
2074 decl = build_decl (VAR_DECL, DECL_NAME (field), TREE_TYPE (field));
2075 /* tell `pushdecl' that this is not tentative. */
2076 DECL_INITIAL (decl) = error_mark_node;
2077 TREE_PUBLIC (decl) = 0;
2078 TREE_STATIC (decl) = static_p;
2079 DECL_EXTERNAL (decl) = external_p;
2080 decl = pushdecl (decl);
2081 DECL_INITIAL (decl) = NULL_TREE;
2084 /* Only write out one anon union element--choose the one that
2085 can hold them all. */
2086 if (main_decl == NULL_TREE
2087 && simple_cst_equal (DECL_SIZE (decl),
2088 DECL_SIZE (anon_decl)) == 1)
2091 /* ??? This causes there to be no debug info written out
2093 TREE_ASM_WRITTEN (decl) = 1;
2095 if (DECL_NAME (field) == NULL_TREE
2096 && ANON_AGGR_TYPE_P (TREE_TYPE (field)))
2097 /* The remainder of the processing was already done in the
2101 /* If there's a cleanup to do, it belongs in the
2102 TREE_PURPOSE of the following TREE_LIST. */
2103 *elems = tree_cons (NULL_TREE, decl, *elems);
2104 TREE_TYPE (*elems) = type;
2110 /* Finish off the processing of a UNION_TYPE structure.
2111 If there are static members, then all members are
2112 static, and must be laid out together. If the
2113 union is an anonymous union, we arrange for that
2114 as well. PUBLIC_P is nonzero if this union is
2115 not declared static. */
2118 finish_anon_union (anon_union_decl)
2119 tree anon_union_decl;
2121 tree type = TREE_TYPE (anon_union_decl);
2123 int public_p = TREE_PUBLIC (anon_union_decl);
2124 int static_p = TREE_STATIC (anon_union_decl);
2125 int external_p = DECL_EXTERNAL (anon_union_decl);
2127 if (TYPE_FIELDS (type) == NULL_TREE)
2132 error ("global anonymous unions must be declared static");
2136 main_decl = build_anon_union_vars (anon_union_decl,
2137 &DECL_ANON_UNION_ELEMS (anon_union_decl),
2138 static_p, external_p);
2140 if (main_decl == NULL_TREE)
2142 warning ("anonymous union with no members");
2148 make_decl_rtl (main_decl, 0, toplevel_bindings_p ());
2149 DECL_RTL (anon_union_decl) = DECL_RTL (main_decl);
2150 expand_anon_union_decl (anon_union_decl,
2152 DECL_ANON_UNION_ELEMS (anon_union_decl));
2155 add_decl_stmt (anon_union_decl);
2158 /* Finish processing a builtin type TYPE. It's name is NAME,
2159 its fields are in the array FIELDS. LEN is the number of elements
2160 in FIELDS minus one, or put another way, it is the maximum subscript
2163 It is given the same alignment as ALIGN_TYPE. */
2166 finish_builtin_type (type, name, fields, len, align_type)
2175 TYPE_FIELDS (type) = fields[0];
2176 for (i = 0; i < len; i++)
2178 layout_type (TREE_TYPE (fields[i]));
2179 DECL_FIELD_CONTEXT (fields[i]) = type;
2180 TREE_CHAIN (fields[i]) = fields[i+1];
2182 DECL_FIELD_CONTEXT (fields[i]) = type;
2183 TYPE_ALIGN (type) = TYPE_ALIGN (align_type);
2185 #if 0 /* not yet, should get fixed properly later */
2186 TYPE_NAME (type) = make_type_decl (get_identifier (name), type);
2188 TYPE_NAME (type) = build_decl (TYPE_DECL, get_identifier (name), type);
2190 TYPE_STUB_DECL (type) = TYPE_NAME (type);
2191 layout_decl (TYPE_NAME (type), 0);
2194 /* Auxiliary functions to make type signatures for
2195 `operator new' and `operator delete' correspond to
2196 what compiler will be expecting. */
2199 coerce_new_type (type)
2204 if (TREE_CODE (type) == METHOD_TYPE)
2205 type = build_function_type (TREE_TYPE (type), TREE_CHAIN (TYPE_ARG_TYPES (type)));
2206 if (! same_type_p (TREE_TYPE (type), ptr_type_node))
2207 e1 = 1, error ("`operator new' must return type `void *'");
2209 /* Technically the type must be `size_t', but we may not know
2211 if (TYPE_ARG_TYPES (type) == NULL_TREE)
2212 e1 = 1, error ("`operator new' takes type `size_t' parameter");
2213 else if (! same_type_p (TREE_VALUE (TYPE_ARG_TYPES (type)), sizetype))
2214 e2 = 1, error ("`operator new' takes type `size_t' as first parameter");
2216 type = build_function_type (ptr_type_node, tree_cons (NULL_TREE, sizetype, TREE_CHAIN (TYPE_ARG_TYPES (type))));
2218 type = build_function_type (ptr_type_node, TYPE_ARG_TYPES (type));
2223 coerce_delete_type (type)
2230 tree arg_types = TYPE_ARG_TYPES (type);
2232 if (TREE_CODE (type) == METHOD_TYPE)
2234 type = build_function_type (TREE_TYPE (type), TREE_CHAIN (arg_types));
2235 arg_types = TREE_CHAIN (arg_types);
2238 if (TREE_TYPE (type) != void_type_node)
2239 e1 = 1, error ("`operator delete' must return type `void'");
2241 if (arg_types == NULL_TREE
2242 || ! same_type_p (TREE_VALUE (arg_types), ptr_type_node))
2243 e2 = 1, error ("`operator delete' takes type `void *' as first parameter");
2247 && TREE_CHAIN (arg_types)
2248 && TREE_CHAIN (arg_types) != void_list_node)
2250 /* Again, technically this argument must be `size_t', but again
2251 we may not know what that is. */
2252 tree t2 = TREE_VALUE (TREE_CHAIN (arg_types));
2253 if (! same_type_p (t2, sizetype))
2254 e3 = 1, error ("second argument to `operator delete' must be of type `size_t'");
2255 else if (TREE_CHAIN (TREE_CHAIN (arg_types)) != void_list_node)
2258 if (TREE_CHAIN (TREE_CHAIN (arg_types)))
2259 error ("too many arguments in declaration of `operator delete'");
2261 error ("`...' invalid in specification of `operator delete'");
2266 arg_types = tree_cons (NULL_TREE, ptr_type_node,
2267 build_tree_list (NULL_TREE, sizetype));
2270 if (arg_types == NULL_TREE)
2271 arg_types = tree_cons (NULL_TREE, ptr_type_node, void_list_node);
2273 arg_types = tree_cons (NULL_TREE, ptr_type_node, TREE_CHAIN (arg_types));
2279 arg_types = tree_cons (NULL_TREE, ptr_type_node,
2280 arg_types ? TREE_CHAIN (arg_types): NULL_TREE);
2282 type = build_function_type (void_type_node, arg_types);
2288 mark_vtable_entries (decl)
2291 tree entries = CONSTRUCTOR_ELTS (DECL_INITIAL (decl));
2293 for (; entries; entries = TREE_CHAIN (entries))
2298 fnaddr = (flag_vtable_thunks ? TREE_VALUE (entries)
2299 : FNADDR_FROM_VTABLE_ENTRY (TREE_VALUE (entries)));
2301 if (TREE_CODE (fnaddr) != ADDR_EXPR)
2302 /* This entry is an offset: a virtual base class offset, a
2303 virtual call offset, and RTTI offset, etc. */
2306 fn = TREE_OPERAND (fnaddr, 0);
2307 TREE_ADDRESSABLE (fn) = 1;
2308 if (TREE_CODE (fn) == THUNK_DECL && DECL_EXTERNAL (fn))
2310 DECL_EXTERNAL (fn) = 0;
2317 /* Set DECL up to have the closest approximation of "initialized common"
2318 linkage available. */
2321 comdat_linkage (decl)
2325 make_decl_one_only (decl);
2326 else if (TREE_CODE (decl) == FUNCTION_DECL || DECL_VIRTUAL_P (decl))
2327 /* We can just emit functions and vtables statically; it doesn't really
2328 matter if we have multiple copies. */
2329 TREE_PUBLIC (decl) = 0;
2332 /* Static data member template instantiations, however, cannot
2333 have multiple copies. */
2334 if (DECL_INITIAL (decl) == 0
2335 || DECL_INITIAL (decl) == error_mark_node)
2336 DECL_COMMON (decl) = 1;
2337 else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
2339 DECL_COMMON (decl) = 1;
2340 DECL_INITIAL (decl) = error_mark_node;
2344 /* We can't do anything useful; leave vars for explicit
2346 DECL_EXTERNAL (decl) = 1;
2347 DECL_NOT_REALLY_EXTERN (decl) = 0;
2351 if (DECL_LANG_SPECIFIC (decl))
2352 DECL_COMDAT (decl) = 1;
2355 /* For win32 we also want to put explicit instantiations in
2356 linkonce sections, so that they will be merged with implicit
2357 instantiations; otherwise we get duplicate symbol errors. */
2360 maybe_make_one_only (decl)
2363 /* We used to say that this was not necessary on targets that support weak
2364 symbols, because the implicit instantiations will defer to the explicit
2365 one. However, that's not actually the case in SVR4; a strong definition
2366 after a weak one is an error. Also, not making explicit
2367 instantiations one_only means that we can end up with two copies of
2368 some template instantiations. */
2369 if (! supports_one_only ())
2372 /* We can't set DECL_COMDAT on functions, or finish_file will think
2373 we can get away with not emitting them if they aren't used. We need
2374 to for variables so that cp_finish_decl will update their linkage,
2375 because their DECL_INITIAL may not have been set properly yet. */
2377 make_decl_one_only (decl);
2379 if (TREE_CODE (decl) == VAR_DECL && DECL_LANG_SPECIFIC (decl))
2380 DECL_COMDAT (decl) = 1;
2383 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
2384 based on TYPE and other static flags.
2386 Note that anything public is tagged TREE_PUBLIC, whether
2387 it's public in this file or in another one. */
2390 import_export_vtable (decl, type, final)
2394 if (DECL_INTERFACE_KNOWN (decl))
2397 if (TYPE_FOR_JAVA (type))
2399 TREE_PUBLIC (decl) = 1;
2400 DECL_EXTERNAL (decl) = 1;
2401 DECL_INTERFACE_KNOWN (decl) = 1;
2403 else if (CLASSTYPE_INTERFACE_KNOWN (type))
2405 TREE_PUBLIC (decl) = 1;
2406 DECL_EXTERNAL (decl) = ! CLASSTYPE_VTABLE_NEEDS_WRITING (type);
2407 DECL_INTERFACE_KNOWN (decl) = 1;
2411 /* We can only wait to decide if we have real non-inline virtual
2412 functions in our class, or if we come from a template. */
2414 int found = CLASSTYPE_TEMPLATE_INSTANTIATION (type);
2416 if (! found && ! final)
2419 for (method = TYPE_METHODS (type); method != NULL_TREE;
2420 method = TREE_CHAIN (method))
2421 if (DECL_VINDEX (method) != NULL_TREE
2422 && ! DECL_THIS_INLINE (method)
2423 && ! DECL_PURE_VIRTUAL_P (method))
2430 if (final || ! found)
2432 comdat_linkage (decl);
2433 DECL_EXTERNAL (decl) = 0;
2437 TREE_PUBLIC (decl) = 1;
2438 DECL_EXTERNAL (decl) = 1;
2443 /* Determine whether or not we want to specifically import or export CTYPE,
2444 using various heuristics. */
2447 import_export_class (ctype)
2450 /* -1 for imported, 1 for exported. */
2451 int import_export = 0;
2453 if (CLASSTYPE_INTERFACE_KNOWN (ctype))
2456 /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
2457 we will have CLASSTYPE_INTERFACE_ONLY set but not
2458 CLASSTYPE_INTERFACE_KNOWN. In that case, we don't want to use this
2459 heuristic because someone will supply a #pragma implementation
2460 elsewhere, and deducing it here would produce a conflict. */
2461 if (CLASSTYPE_INTERFACE_ONLY (ctype))
2464 #ifdef VALID_MACHINE_TYPE_ATTRIBUTE
2465 /* FIXME this should really use some sort of target-independent macro. */
2466 if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype)))
2468 else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype)))
2472 /* If we got -fno-implicit-templates, we import template classes that
2473 weren't explicitly instantiated. */
2474 if (import_export == 0
2475 && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype)
2476 && ! flag_implicit_templates)
2479 /* Base our import/export status on that of the first non-inline,
2480 non-abstract virtual function, if any. */
2481 if (import_export == 0
2482 && TYPE_POLYMORPHIC_P (ctype)
2483 && ! CLASSTYPE_TEMPLATE_INSTANTIATION (ctype))
2486 for (method = TYPE_METHODS (ctype); method != NULL_TREE;
2487 method = TREE_CHAIN (method))
2489 if (DECL_VINDEX (method) != NULL_TREE
2490 && !DECL_THIS_INLINE (method)
2491 && !DECL_PURE_VIRTUAL_P (method))
2493 import_export = (DECL_REALLY_EXTERN (method) ? -1 : 1);
2499 #ifdef MULTIPLE_SYMBOL_SPACES
2500 if (import_export == -1)
2506 SET_CLASSTYPE_INTERFACE_KNOWN (ctype);
2507 CLASSTYPE_VTABLE_NEEDS_WRITING (ctype) = (import_export > 0);
2508 CLASSTYPE_INTERFACE_ONLY (ctype) = (import_export < 0);
2512 /* We need to describe to the assembler the relationship between
2513 a vtable and the vtable of the parent class. */
2516 output_vtable_inherit (vars)
2522 op[0] = XEXP (DECL_RTL (vars), 0); /* strip the mem ref */
2524 parent = binfo_for_vtable (vars);
2526 if (parent == TYPE_BINFO (DECL_CONTEXT (vars)))
2530 parent = TYPE_BINFO_VTABLE (BINFO_TYPE (parent));
2531 op[1] = XEXP (DECL_RTL (parent), 0); /* strip the mem ref */
2534 my_friendly_abort (980826);
2536 output_asm_insn (".vtable_inherit %c0, %c1", op);
2540 finish_vtable_vardecl (t, data)
2542 void *data ATTRIBUTE_UNUSED;
2545 tree ctype = DECL_CONTEXT (vars);
2546 import_export_class (ctype);
2547 import_export_vtable (vars, ctype, 1);
2549 if (! DECL_EXTERNAL (vars)
2550 && (DECL_NEEDED_P (vars)
2551 || (decl_function_context (vars) && TREE_USED (vars)))
2552 && ! TREE_ASM_WRITTEN (vars))
2554 if (TREE_TYPE (vars) == void_type_node)
2555 /* It is a dummy vtable made by get_vtable_decl. Ignore it. */
2559 mark_vtable_entries (vars);
2560 if (TREE_TYPE (DECL_INITIAL (vars)) == 0)
2561 store_init_value (vars, DECL_INITIAL (vars));
2563 if (write_symbols == DWARF_DEBUG || write_symbols == DWARF2_DEBUG)
2565 /* Mark the VAR_DECL node representing the vtable itself as a
2566 "gratuitous" one, thereby forcing dwarfout.c to ignore it.
2567 It is rather important that such things be ignored because
2568 any effort to actually generate DWARF for them will run
2569 into trouble when/if we encounter code like:
2572 struct S { virtual void member (); };
2574 because the artificial declaration of the vtable itself (as
2575 manufactured by the g++ front end) will say that the vtable
2576 is a static member of `S' but only *after* the debug output
2577 for the definition of `S' has already been output. This causes
2578 grief because the DWARF entry for the definition of the vtable
2579 will try to refer back to an earlier *declaration* of the
2580 vtable as a static member of `S' and there won't be one.
2581 We might be able to arrange to have the "vtable static member"
2582 attached to the member list for `S' before the debug info for
2583 `S' get written (which would solve the problem) but that would
2584 require more intrusive changes to the g++ front end. */
2586 DECL_IGNORED_P (vars) = 1;
2589 /* Always make vtables weak. */
2591 comdat_linkage (vars);
2593 rest_of_decl_compilation (vars, NULL_PTR, 1, 1);
2596 output_vtable_inherit (vars);
2598 /* Because we're only doing syntax-checking, we'll never end up
2599 actually marking the variable as written. */
2600 if (flag_syntax_only)
2601 TREE_ASM_WRITTEN (vars) = 1;
2603 /* Since we're writing out the vtable here, also write the debug
2605 if (TYPE_DECL_SUPPRESS_DEBUG (TYPE_MAIN_DECL (ctype)))
2607 TYPE_DECL_SUPPRESS_DEBUG (TYPE_NAME (ctype)) = 0;
2608 rest_of_type_compilation (ctype, toplevel_bindings_p ());
2613 else if (!DECL_NEEDED_P (vars))
2614 /* We don't know what to do with this one yet. */
2621 prune_vtable_vardecl (t, data)
2623 void *data ATTRIBUTE_UNUSED;
2625 *t = TREE_CHAIN (*t);
2629 /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an
2630 inline function or template instantiation at end-of-file. */
2633 import_export_decl (decl)
2636 if (DECL_INTERFACE_KNOWN (decl))
2639 if (DECL_TEMPLATE_INSTANTIATION (decl)
2640 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
2642 DECL_NOT_REALLY_EXTERN (decl) = 1;
2643 if ((DECL_IMPLICIT_INSTANTIATION (decl)
2644 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
2645 && (flag_implicit_templates
2646 || (flag_implicit_inline_templates && DECL_THIS_INLINE (decl))))
2648 if (!TREE_PUBLIC (decl))
2649 /* Templates are allowed to have internal linkage. See
2653 comdat_linkage (decl);
2656 DECL_NOT_REALLY_EXTERN (decl) = 0;
2658 else if (DECL_FUNCTION_MEMBER_P (decl))
2660 tree ctype = DECL_CONTEXT (decl);
2661 import_export_class (ctype);
2662 if (CLASSTYPE_INTERFACE_KNOWN (ctype)
2664 ? (! DECL_THIS_INLINE (decl))
2665 : (! DECL_ARTIFICIAL (decl) || DECL_VINDEX (decl))))
2667 DECL_NOT_REALLY_EXTERN (decl)
2668 = ! (CLASSTYPE_INTERFACE_ONLY (ctype)
2669 || (DECL_THIS_INLINE (decl) && ! flag_implement_inlines
2670 && !DECL_VINDEX (decl)));
2672 /* Always make artificials weak. */
2673 if (DECL_ARTIFICIAL (decl) && flag_weak)
2674 comdat_linkage (decl);
2676 maybe_make_one_only (decl);
2679 comdat_linkage (decl);
2681 else if (DECL_TINFO_FN_P (decl))
2683 tree ctype = TREE_TYPE (DECL_NAME (decl));
2685 if (IS_AGGR_TYPE (ctype))
2686 import_export_class (ctype);
2688 if (IS_AGGR_TYPE (ctype) && CLASSTYPE_INTERFACE_KNOWN (ctype)
2689 && TYPE_POLYMORPHIC_P (ctype)
2690 /* If -fno-rtti, we're not necessarily emitting this stuff with
2691 the class, so go ahead and emit it now. This can happen
2692 when a class is used in exception handling. */
2694 /* If the type is a cv-qualified variant of a type, then we
2695 must emit the tinfo function in this translation unit
2696 since it will not be emitted when the vtable for the type
2697 is output (which is when the unqualified version is
2699 && same_type_p (ctype, TYPE_MAIN_VARIANT (ctype)))
2701 DECL_NOT_REALLY_EXTERN (decl)
2702 = ! (CLASSTYPE_INTERFACE_ONLY (ctype)
2703 || (DECL_THIS_INLINE (decl) && ! flag_implement_inlines
2704 && !DECL_VINDEX (decl)));
2706 /* Always make artificials weak. */
2708 comdat_linkage (decl);
2710 else if (TYPE_BUILT_IN (ctype)
2711 && same_type_p (ctype, TYPE_MAIN_VARIANT (ctype)))
2712 DECL_NOT_REALLY_EXTERN (decl) = 0;
2714 comdat_linkage (decl);
2717 comdat_linkage (decl);
2719 DECL_INTERFACE_KNOWN (decl) = 1;
2723 build_cleanup (decl)
2727 tree type = TREE_TYPE (decl);
2729 if (TREE_CODE (type) == ARRAY_TYPE)
2733 mark_addressable (decl);
2734 temp = build1 (ADDR_EXPR, build_pointer_type (type), decl);
2736 temp = build_delete (TREE_TYPE (temp), temp,
2738 LOOKUP_NORMAL|LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
2742 extern int parse_time, varconst_time;
2748 tree sname = get_id_2 ("__sn", base);
2749 /* For struct X foo __attribute__((weak)), there is a counter
2750 __snfoo. Since base is already an assembler name, sname should
2751 be globally unique */
2752 tree sentry = IDENTIFIER_GLOBAL_VALUE (sname);
2755 sentry = build_decl (VAR_DECL, sname, integer_type_node);
2756 TREE_PUBLIC (sentry) = 1;
2757 DECL_ARTIFICIAL (sentry) = 1;
2758 TREE_STATIC (sentry) = 1;
2759 TREE_USED (sentry) = 1;
2760 DECL_COMMON (sentry) = 1;
2761 pushdecl_top_level (sentry);
2762 cp_finish_decl (sentry, NULL_TREE, NULL_TREE, 0);
2767 /* Start the process of running a particular set of global constructors
2768 or destructors. Subroutine of do_[cd]tors. */
2771 start_objects (method_type, initp)
2772 int method_type, initp;
2778 /* Make ctor or dtor function. METHOD_TYPE may be 'I' or 'D'. */
2780 if (initp != DEFAULT_INIT_PRIORITY)
2790 sprintf (type, "%c%c%.5u", method_type, joiner, initp);
2793 sprintf (type, "%c", method_type);
2795 fnname = get_file_function_name_long (type);
2797 start_function (void_list_node,
2798 make_call_declarator (fnname, void_list_node, NULL_TREE,
2800 NULL_TREE, SF_DEFAULT);
2802 #if defined(ASM_OUTPUT_CONSTRUCTOR) && defined(ASM_OUTPUT_DESTRUCTOR)
2803 /* It can be a static function as long as collect2 does not have
2804 to scan the object file to find its ctor/dtor routine. */
2805 TREE_PUBLIC (current_function_decl) = 0;
2808 /* Mark this declaration as used to avoid spurious warnings. */
2809 TREE_USED (current_function_decl) = 1;
2811 /* Mark this function as a global constructor or destructor. */
2812 if (method_type == 'I')
2813 DECL_GLOBAL_CTOR_P (current_function_decl) = 1;
2815 DECL_GLOBAL_DTOR_P (current_function_decl) = 1;
2816 GLOBAL_INIT_PRIORITY (current_function_decl) = initp;
2818 body = begin_compound_stmt (/*has_no_scope=*/0);
2820 /* We cannot allow these functions to be elided, even if they do not
2821 have external linkage. And, there's no point in deferring
2822 copmilation of thes functions; they're all going to have to be
2824 current_function_cannot_inline
2825 = "static constructors and destructors cannot be inlined";
2830 /* Finish the process of running a particular set of global constructors
2831 or destructors. Subroutine of do_[cd]tors. */
2834 finish_objects (method_type, initp, body)
2835 int method_type, initp;
2842 finish_compound_stmt(/*has_no_scope=*/0, body);
2843 fn = finish_function (lineno, 0);
2846 /* When only doing semantic analysis, and no RTL generation, we
2847 can't call functions that directly emit assembly code; there is
2848 no assembly file in which to put the code. */
2849 if (flag_syntax_only)
2852 fnname = XSTR (XEXP (DECL_RTL (fn), 0), 0);
2853 if (initp == DEFAULT_INIT_PRIORITY)
2855 if (method_type == 'I')
2856 assemble_constructor (fnname);
2858 assemble_destructor (fnname);
2860 #if defined (ASM_OUTPUT_SECTION_NAME) && defined (ASM_OUTPUT_CONSTRUCTOR)
2861 /* If we're using init priority we can't use assemble_*tor, but on ELF
2862 targets we can stick the references into named sections for GNU ld
2867 sprintf (buf, ".%ctors.%.5u", method_type == 'I' ? 'c' : 'd',
2868 /* invert the numbering so the linker puts us in the proper
2869 order; constructors are run from right to left, and the
2870 linker sorts in increasing order. */
2871 MAX_INIT_PRIORITY - initp);
2872 named_section (NULL_TREE, buf, 0);
2873 assemble_integer (gen_rtx_SYMBOL_REF (Pmode, fnname),
2874 POINTER_SIZE / BITS_PER_UNIT, 1);
2879 /* The names of the parameters to the function created to handle
2880 initializations and destructions for objects with static storage
2882 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
2883 #define PRIORITY_IDENTIFIER "__priority"
2885 /* The name of the function we create to handle initializations and
2886 destructions for objects with static storage duration. */
2887 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
2889 /* The declaration for the __INITIALIZE_P argument. */
2890 static tree initialize_p_decl;
2892 /* The declaration for the __PRIORITY argument. */
2893 static tree priority_decl;
2895 /* The declaration for the static storage duration function. */
2896 static tree ssdf_decl;
2898 /* All the static storage duration functions created in this
2899 translation unit. */
2900 static varray_type ssdf_decls;
2902 /* A map from priority levels to information about that priority
2903 level. There may be many such levels, so efficient lookup is
2905 static splay_tree priority_info_map;
2907 /* Begins the generation of the function that will handle all
2908 initialization and destruction of objects with static storage
2909 duration. The function generated takes two parameters of type
2910 `int': __INITIALIZE_P and __PRIORITY. If __INITIALIZE_P is
2911 non-zero, it performs initializations. Otherwise, it performs
2912 destructions. It only performs those initializations or
2913 destructions with the indicated __PRIORITY. The generated function
2916 It is assumed that this function will only be called once per
2917 translation unit. */
2920 start_static_storage_duration_function ()
2922 static unsigned ssdf_number;
2927 char id[sizeof (SSDF_IDENTIFIER) + 1 /* '\0' */ + 32];
2929 /* Create the identifier for this function. It will be of the form
2930 SSDF_IDENTIFIER_<number>. */
2931 sprintf (id, "%s_%u", SSDF_IDENTIFIER, ssdf_number++);
2932 if (ssdf_number == 0)
2934 /* Overflow occurred. That means there are at least 4 billion
2935 initialization functions. */
2936 sorry ("too many initialization functions required");
2937 my_friendly_abort (19990430);
2940 /* Create the parameters. */
2941 parm_types = void_list_node;
2942 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2943 parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2944 type = build_function_type (void_type_node, parm_types);
2946 /* Create the FUNCTION_DECL itself. */
2947 ssdf_decl = build_lang_decl (FUNCTION_DECL,
2948 get_identifier (id),
2950 TREE_PUBLIC (ssdf_decl) = 0;
2951 DECL_ARTIFICIAL (ssdf_decl) = 1;
2953 /* Put this function in the list of functions to be called from the
2954 static constructors and destructors. */
2957 VARRAY_TREE_INIT (ssdf_decls, 32, "ssdf_decls");
2959 /* Take this opportunity to initialize the map from priority
2960 numbers to information about that priority level. */
2961 priority_info_map = splay_tree_new (splay_tree_compare_ints,
2962 /*delete_key_fn=*/0,
2963 /*delete_value_fn=*/
2964 (splay_tree_delete_value_fn) &free);
2966 /* We always need to generate functions for the
2967 DEFAULT_INIT_PRIORITY so enter it now. That way when we walk
2968 priorities later, we'll be sure to find the
2969 DEFAULT_INIT_PRIORITY. */
2970 get_priority_info (DEFAULT_INIT_PRIORITY);
2973 VARRAY_PUSH_TREE (ssdf_decls, ssdf_decl);
2975 /* Create the argument list. */
2976 initialize_p_decl = build_decl (PARM_DECL,
2977 get_identifier (INITIALIZE_P_IDENTIFIER),
2979 DECL_CONTEXT (initialize_p_decl) = ssdf_decl;
2980 DECL_ARG_TYPE (initialize_p_decl) = integer_type_node;
2981 TREE_USED (initialize_p_decl) = 1;
2982 priority_decl = build_decl (PARM_DECL, get_identifier (PRIORITY_IDENTIFIER),
2984 DECL_CONTEXT (priority_decl) = ssdf_decl;
2985 DECL_ARG_TYPE (priority_decl) = integer_type_node;
2986 TREE_USED (priority_decl) = 1;
2988 TREE_CHAIN (initialize_p_decl) = priority_decl;
2989 DECL_ARGUMENTS (ssdf_decl) = initialize_p_decl;
2991 /* Put the function in the global scope. */
2992 pushdecl (ssdf_decl);
2994 /* Start the function itself. This is equivalent to declarating the
2997 static void __ssdf (int __initialize_p, init __priority_p);
2999 It is static because we only need to call this function from the
3000 various constructor and destructor functions for this module. */
3001 start_function (/*specs=*/NULL_TREE,
3003 /*attrs=*/NULL_TREE,
3006 /* Set up the scope of the outermost block in the function. */
3007 body = begin_compound_stmt (/*has_no_scope=*/0);
3009 /* This function must not be deferred because we are depending on
3010 its compilation to tell us what is TREE_SYMBOL_REFERENCED. */
3011 current_function_cannot_inline
3012 = "static storage duration functions cannot be inlined";
3017 /* Finish the generation of the function which performs initialization
3018 and destruction of objects with static storage duration. After
3019 this point, no more such objects can be created. */
3022 finish_static_storage_duration_function (body)
3025 /* Close out the function. */
3026 finish_compound_stmt (/*has_no_scope=*/0, body);
3027 expand_body (finish_function (lineno, 0));
3030 /* Return the information about the indicated PRIORITY level. If no
3031 code to handle this level has yet been generated, generate the
3032 appropriate prologue. */
3034 static priority_info
3035 get_priority_info (priority)
3041 n = splay_tree_lookup (priority_info_map,
3042 (splay_tree_key) priority);
3045 /* Create a new priority information structure, and insert it
3047 pi = (priority_info) xmalloc (sizeof (struct priority_info_s));
3048 pi->initializations_p = 0;
3049 pi->destructions_p = 0;
3050 splay_tree_insert (priority_info_map,
3051 (splay_tree_key) priority,
3052 (splay_tree_value) pi);
3055 pi = (priority_info) n->value;
3060 /* Set up to handle the initialization or destruction of DECL. If
3061 INITP is non-zero, we are initializing the variable. Otherwise, we
3062 are destroying it. */
3065 start_static_initialization_or_destruction (decl, initp)
3069 tree sentry_if_stmt = NULL_TREE;
3075 /* Figure out the priority for this declaration. */
3076 priority = DECL_INIT_PRIORITY (decl);
3078 priority = DEFAULT_INIT_PRIORITY;
3080 /* Remember that we had an initialization or finalization at this
3082 pi = get_priority_info (priority);
3084 pi->initializations_p = 1;
3086 pi->destructions_p = 1;
3088 /* Trick the compiler into thinking we are at the file and line
3089 where DECL was declared so that error-messages make sense, and so
3090 that the debugger will show somewhat sensible file and line
3092 input_filename = DECL_SOURCE_FILE (decl);
3093 lineno = DECL_SOURCE_LINE (decl);
3099 Access control for implicit calls to the constructors,
3100 the conversion functions, or the destructor called to
3101 create and destroy a static data member is performed as
3102 if these calls appeared in the scope of the member's
3105 we pretend we are in a static member function of the class of
3106 which the DECL is a member. */
3107 if (member_p (decl))
3109 DECL_CONTEXT (current_function_decl) = DECL_CONTEXT (decl);
3110 DECL_STATIC_FUNCTION_P (current_function_decl) = 1;
3113 /* Conditionalize this initialization on being in the right priority
3114 and being initializing/finalizing appropriately. */
3115 sentry_if_stmt = begin_if_stmt ();
3116 cond = build_binary_op (EQ_EXPR,
3118 build_int_2 (priority, 0));
3119 init_cond = initp ? integer_one_node : integer_zero_node;
3120 init_cond = build_binary_op (EQ_EXPR,
3123 cond = build_binary_op (TRUTH_ANDIF_EXPR, cond, init_cond);
3125 /* We need a sentry if this is an object with external linkage that
3126 might be initialized in more than one place. */
3127 if (TREE_PUBLIC (decl) && (DECL_COMMON (decl)
3128 || DECL_ONE_ONLY (decl)
3129 || DECL_WEAK (decl)))
3134 sentry = get_sentry (DECL_ASSEMBLER_NAME (decl));
3136 /* We do initializations only if the SENTRY is zero, i.e., if we
3137 are the first to initialize the variable. We do destructions
3138 only if the SENTRY is one, i.e., if we are the last to
3139 destroy the variable. */
3141 sentry_cond = build_binary_op (EQ_EXPR,
3142 build_unary_op (PREINCREMENT_EXPR,
3147 sentry_cond = build_binary_op (EQ_EXPR,
3148 build_unary_op (PREDECREMENT_EXPR,
3153 cond = build_binary_op (TRUTH_ANDIF_EXPR, cond, sentry_cond);
3156 finish_if_stmt_cond (cond, sentry_if_stmt);
3158 return sentry_if_stmt;
3161 /* We've just finished generating code to do an initialization or
3162 finalization. SENTRY_IF_STMT is the if-statement we used to guard
3163 the initialization. */
3166 finish_static_initialization_or_destruction (sentry_if_stmt)
3167 tree sentry_if_stmt;
3169 finish_then_clause (sentry_if_stmt);
3172 /* Now that we're done with DECL we don't need to pretend to be a
3173 member of its class any longer. */
3174 DECL_CONTEXT (current_function_decl) = NULL_TREE;
3175 DECL_STATIC_FUNCTION_P (current_function_decl) = 0;
3178 /* Generate code to do the static initialization of DECL. The
3179 initialization is INIT. If DECL may be initialized more than once
3180 in different object files, SENTRY is the guard variable to
3181 check. PRIORITY is the priority for the initialization. */
3184 do_static_initialization (decl, init)
3189 tree sentry_if_stmt;
3191 /* Set up for the initialization. */
3193 = start_static_initialization_or_destruction (decl,
3196 /* Do the initialization itself. */
3197 if (IS_AGGR_TYPE (TREE_TYPE (decl))
3198 || TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE)
3199 expr = build_aggr_init (decl, init, 0);
3200 else if (TREE_CODE (init) == TREE_VEC)
3201 expr = build_vec_init (decl, TREE_VEC_ELT (init, 0),
3202 TREE_VEC_ELT (init, 1),
3203 TREE_VEC_ELT (init, 2), 0);
3206 expr = build (INIT_EXPR, TREE_TYPE (decl), decl, init);
3207 TREE_SIDE_EFFECTS (expr) = 1;
3209 finish_expr_stmt (expr);
3211 /* If we're using __cxa_atexit, register a a function that calls the
3212 destructor for the object. */
3213 if (flag_use_cxa_atexit)
3214 register_dtor_fn (decl);
3217 finish_static_initialization_or_destruction (sentry_if_stmt);
3220 /* Generate code to do the static destruction of DECL. If DECL may be
3221 initialized more than once in different object files, SENTRY is the
3222 guard variable to check. PRIORITY is the priority for the
3226 do_static_destruction (decl)
3229 tree sentry_if_stmt;
3231 /* If we're using __cxa_atexit, then destructors are registered
3232 immediately after objects are initialized. */
3233 my_friendly_assert (!flag_use_cxa_atexit, 20000121);
3235 /* If we don't need a destructor, there's nothing to do. */
3236 if (!TYPE_NEEDS_DESTRUCTOR (TREE_TYPE (decl)))
3239 /* Actually do the destruction. */
3240 sentry_if_stmt = start_static_initialization_or_destruction (decl,
3242 finish_expr_stmt (build_cleanup (decl));
3243 finish_static_initialization_or_destruction (sentry_if_stmt);
3246 /* VARS is a list of variables with static storage duration which may
3247 need initialization and/or finalization. Remove those variables
3248 that don't really need to be initialized or finalized, and return
3249 the resulting list. The order in which the variables appear in
3250 VARS is in reverse order of the order in which they should actually
3251 be initialized. The list we return is in the unreversed order;
3252 i.e., the first variable should be initialized first. */
3255 prune_vars_needing_no_initialization (vars)
3261 for (var = vars, result = NULL_TREE;
3263 var = TREE_CHAIN (var))
3265 tree decl = TREE_VALUE (var);
3266 tree init = TREE_PURPOSE (var);
3268 /* Deal gracefully with error. */
3269 if (decl == error_mark_node)
3272 /* The only things that can be initialized are variables. */
3273 my_friendly_assert (TREE_CODE (decl) == VAR_DECL, 19990420);
3275 /* If this object is not defined, we don't need to do anything
3277 if (DECL_EXTERNAL (decl))
3280 /* Also, if the initializer already contains errors, we can bail
3282 if (init && TREE_CODE (init) == TREE_LIST
3283 && value_member (error_mark_node, init))
3286 /* This variable is going to need initialization and/or
3287 finalization, so we add it to the list. */
3288 result = tree_cons (init, decl, result);
3294 /* Make sure we have told the back end about all the variables in
3298 write_out_vars (vars)
3303 for (v = vars; v; v = TREE_CHAIN (v))
3304 if (! TREE_ASM_WRITTEN (TREE_VALUE (v)))
3305 rest_of_decl_compilation (TREE_VALUE (v), 0, 1, 1);
3308 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
3309 (otherwise) that will initialize all gobal objects with static
3310 storage duration having the indicated PRIORITY. */
3313 generate_ctor_or_dtor_function (constructor_p, priority)
3322 /* We use `I' to indicate initialization and `D' to indicate
3329 /* Begin the function. */
3330 body = start_objects (function_key, priority);
3332 /* Call the static storage duration function with appropriate
3334 for (i = 0; i < ssdf_decls->elements_used; ++i)
3336 arguments = tree_cons (NULL_TREE, build_int_2 (priority, 0),
3338 arguments = tree_cons (NULL_TREE, build_int_2 (constructor_p, 0),
3340 finish_expr_stmt (build_function_call (VARRAY_TREE (ssdf_decls, i),
3344 /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
3345 calls to any functions marked with attributes indicating that
3346 they should be called at initialization- or destruction-time. */
3347 if (priority == DEFAULT_INIT_PRIORITY)
3351 for (fns = constructor_p ? static_ctors : static_dtors;
3353 fns = TREE_CHAIN (fns))
3354 finish_expr_stmt (build_function_call (TREE_VALUE (fns), NULL_TREE));
3357 /* Close out the function. */
3358 finish_objects (function_key, priority, body);
3361 /* Generate constructor and destructor functions for the priority
3365 generate_ctor_and_dtor_functions_for_priority (n, data)
3367 void *data ATTRIBUTE_UNUSED;
3369 int priority = (int) n->key;
3370 priority_info pi = (priority_info) n->value;
3372 /* Generate the functions themselves, but only if they are really
3374 if (pi->initializations_p
3375 || (priority == DEFAULT_INIT_PRIORITY && static_ctors))
3376 generate_ctor_or_dtor_function (/*constructor_p=*/1,
3378 if (pi->destructions_p
3379 || (priority == DEFAULT_INIT_PRIORITY && static_dtors))
3380 generate_ctor_or_dtor_function (/*constructor_p=*/0,
3383 /* Keep iterating. */
3387 /* This routine is called from the last rule in yyparse ().
3388 Its job is to create all the code needed to initialize and
3389 destroy the global aggregates. We do the destruction
3390 first, since that way we only need to reverse the decls once. */
3396 int start_time, this_time;
3403 /* Bad parse errors. Just forget about it. */
3404 if (! global_bindings_p () || current_class_type || decl_namespace_list)
3407 start_time = get_run_time ();
3409 /* Otherwise, GDB can get confused, because in only knows
3410 about source for LINENO-1 lines. */
3413 interface_unknown = 1;
3416 /* We now have to write out all the stuff we put off writing out.
3419 o Template specializations that we have not yet instantiated,
3420 but which are needed.
3421 o Initialization and destruction for non-local objects with
3422 static storage duration. (Local objects with static storage
3423 duration are initialized when their scope is first entered,
3424 and are cleaned up via atexit.)
3425 o Virtual function tables.
3427 All of these may cause others to be needed. For example,
3428 instantiating one function may cause another to be needed, and
3429 generating the intiailzer for an object may cause templates to be
3430 instantiated, etc., etc. */
3432 this_time = get_run_time ();
3433 parse_time -= this_time - start_time;
3434 varconst_time += this_time - start_time;
3435 start_time = get_run_time ();
3437 if (new_abi_rtti_p ())
3438 emit_support_tinfos ();
3444 /* If there are templates that we've put off instantiating, do
3446 instantiate_pending_templates ();
3448 /* Write out virtual tables as required. Note that writing out
3449 the virtual table for a template class may cause the
3450 instantiation of members of that class. */
3451 if (walk_globals (vtable_decl_p,
3452 finish_vtable_vardecl,
3456 /* Write out needed type info variables. Writing out one variable
3457 might cause others to be needed. */
3458 if (new_abi_rtti_p ()
3459 && walk_globals (tinfo_decl_p, emit_tinfo_decl, /*data=*/0))
3462 /* The list of objects with static storage duration is built up
3463 in reverse order. We clear STATIC_AGGREGATES so that any new
3464 aggregates added during the initialization of these will be
3465 initialized in the correct order when we next come around the
3467 vars = prune_vars_needing_no_initialization (static_aggregates);
3468 static_aggregates = NULL_TREE;
3474 /* We need to start a new initialization function each time
3475 through the loop. That's because we need to know which
3476 vtables have been referenced, and TREE_SYMBOL_REFERENCED
3477 isn't computed until a function is finished, and written
3478 out. That's a deficiency in the back-end. When this is
3479 fixed, these initialization functions could all become
3480 inline, with resulting performance improvements. */
3481 tree ssdf_body = start_static_storage_duration_function ();
3483 /* Make sure the back end knows about all the variables. */
3484 write_out_vars (vars);
3486 /* First generate code to do all the initializations. */
3487 for (v = vars; v; v = TREE_CHAIN (v))
3488 do_static_initialization (TREE_VALUE (v),
3491 /* Then, generate code to do all the destructions. Do these
3492 in reverse order so that the most recently constructed
3493 variable is the first destroyed. If we're using
3494 __cxa_atexit, then we don't need to do this; functions
3495 we're registered at initialization time to destroy the
3497 if (!flag_use_cxa_atexit)
3499 vars = nreverse (vars);
3500 for (v = vars; v; v = TREE_CHAIN (v))
3501 do_static_destruction (TREE_VALUE (v));
3506 /* Finish up the static storage duration function for this
3508 finish_static_storage_duration_function (ssdf_body);
3510 /* All those initializations and finalizations might cause
3511 us to need more inline functions, more template
3512 instantiations, etc. */
3516 /* Go through the various inline functions, and see if any need
3518 for (i = 0; i < saved_inlines_used; ++i)
3520 tree decl = VARRAY_TREE (saved_inlines, i);
3521 import_export_decl (decl);
3522 if (DECL_ARTIFICIAL (decl) && ! DECL_INITIAL (decl)
3524 && (! DECL_REALLY_EXTERN (decl) || DECL_INLINE (decl)))
3526 /* Even though we're already at the top-level, we push
3527 there again. That way, when we pop back a few lines
3528 hence, all of our state is restored. Otherwise,
3529 finish_function doesn't clean things up, and we end
3530 up with CURRENT_FUNCTION_DECL set. */
3531 push_to_top_level ();
3532 if (DECL_TINFO_FN_P (decl))
3533 synthesize_tinfo_fn (decl);
3535 synthesize_method (decl);
3536 pop_from_top_level ();
3541 /* Mark all functions that might deal with exception-handling as
3543 mark_all_runtime_matches ();
3545 /* We lie to the back-end, pretending that some functions are
3546 not defined when they really are. This keeps these functions
3547 from being put out unncessarily. But, we must stop lying
3548 when the functions are referenced, or if they are not comdat
3549 since they need to be put out now. */
3550 for (i = 0; i < saved_inlines_used; ++i)
3552 tree decl = VARRAY_TREE (saved_inlines, i);
3554 if (DECL_NOT_REALLY_EXTERN (decl)
3555 && DECL_INITIAL (decl)
3556 && DECL_NEEDED_P (decl))
3557 DECL_EXTERNAL (decl) = 0;
3559 /* If we're going to need to write this function out, and
3560 there's already a body for it, create RTL for it now.
3561 (There might be no body if this is a method we haven't
3562 gotten around to synthesizing yet.) */
3563 if (!DECL_EXTERNAL (decl)
3564 && DECL_NEEDED_P (decl)
3565 && DECL_SAVED_TREE (decl)
3566 && !DECL_SAVED_INSNS (decl)
3567 && !TREE_ASM_WRITTEN (decl))
3569 int saved_not_really_extern;
3571 /* When we call finish_function in expand_body, it will
3572 try to reset DECL_NOT_REALLY_EXTERN so we save and
3574 saved_not_really_extern = DECL_NOT_REALLY_EXTERN (decl);
3575 /* Generate RTL for this function now that we know we
3578 /* Undo the damage done by finish_function. */
3579 DECL_EXTERNAL (decl) = 0;
3580 DECL_NOT_REALLY_EXTERN (decl) = saved_not_really_extern;
3581 /* If we're compiling -fsyntax-only pretend that this
3582 function has been written out so that we don't try to
3584 if (flag_syntax_only)
3585 TREE_ASM_WRITTEN (decl) = 1;
3590 if (saved_inlines_used
3591 && wrapup_global_declarations (&VARRAY_TREE (saved_inlines, 0),
3592 saved_inlines_used))
3594 if (walk_namespaces (wrapup_globals_for_namespace, /*data=*/0))
3597 /* Static data members are just like namespace-scope globals. */
3598 for (i = 0; i < pending_statics_used; ++i)
3600 tree decl = VARRAY_TREE (pending_statics, i);
3601 if (TREE_ASM_WRITTEN (decl))
3603 import_export_decl (decl);
3604 if (DECL_NOT_REALLY_EXTERN (decl) && ! DECL_IN_AGGR_P (decl))
3605 DECL_EXTERNAL (decl) = 0;
3608 && wrapup_global_declarations (&VARRAY_TREE (pending_statics, 0),
3609 pending_statics_used))
3614 /* We give C linkage to static constructors and destructors. */
3615 push_lang_context (lang_name_c);
3617 /* Generate initialization and destruction functions for all
3618 priorities for which they are required. */
3619 if (priority_info_map)
3620 splay_tree_foreach (priority_info_map,
3621 generate_ctor_and_dtor_functions_for_priority,
3624 /* We're done with the splay-tree now. */
3625 if (priority_info_map)
3626 splay_tree_delete (priority_info_map);
3628 /* We're done with static constructors, so we can go back to "C++"
3630 pop_lang_context ();
3632 /* Now delete from the chain of variables all virtual function tables.
3633 We output them all ourselves, because each will be treated
3634 specially. We don't do this if we're just doing semantic
3635 analysis, and not code-generation. */
3636 if (!flag_syntax_only)
3637 walk_globals (vtable_decl_p, prune_vtable_vardecl, /*data=*/0);
3639 /* Now, issue warnings about static, but not defined, functions,
3640 etc., and emit debugging information. */
3641 walk_namespaces (wrapup_globals_for_namespace, /*data=*/&reconsider);
3642 if (pending_statics)
3643 check_global_declarations (&VARRAY_TREE (pending_statics, 0),
3644 pending_statics_used);
3648 /* The entire file is now complete. If requested, dump everything
3650 if (flag_dump_translation_unit)
3651 dump_node_to_file (global_namespace, flag_dump_translation_unit);
3653 /* If there's some tool that wants to examine the entire translation
3654 unit, let it do so now. */
3656 (*back_end_hook) (global_namespace);
3658 this_time = get_run_time ();
3659 parse_time -= this_time - start_time;
3660 varconst_time += this_time - start_time;
3662 if (flag_detailed_statistics)
3664 dump_tree_statistics ();
3665 dump_time_statistics ();
3669 /* This is something of the form 'A()()()()()+1' that has turned out to be an
3670 expr. Since it was parsed like a type, we need to wade through and fix
3671 that. Unfortunately, since operator() is left-associative, we can't use
3672 tail recursion. In the above example, TYPE is `A', and DECL is
3675 Maybe this shouldn't be recursive, but how often will it actually be
3679 reparse_absdcl_as_expr (type, decl)
3682 /* do build_functional_cast (type, NULL_TREE) at bottom */
3683 if (TREE_OPERAND (decl, 0) == NULL_TREE)
3684 return build_functional_cast (type, NULL_TREE);
3687 decl = reparse_absdcl_as_expr (type, TREE_OPERAND (decl, 0));
3689 decl = build_x_function_call (decl, NULL_TREE, current_class_ref);
3691 if (TREE_CODE (decl) == CALL_EXPR
3692 && (! TREE_TYPE (decl)
3693 || TREE_CODE (TREE_TYPE (decl)) != VOID_TYPE))
3694 decl = require_complete_type (decl);
3699 /* This is something of the form `int ((int)(int)(int)1)' that has turned
3700 out to be an expr. Since it was parsed like a type, we need to wade
3701 through and fix that. Since casts are right-associative, we are
3702 reversing the order, so we don't have to recurse.
3704 In the above example, DECL is the `(int)(int)(int)', and EXPR is the
3708 reparse_absdcl_as_casts (decl, expr)
3713 if (TREE_CODE (expr) == CONSTRUCTOR
3714 && TREE_TYPE (expr) == 0)
3716 type = groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl)));
3717 decl = TREE_OPERAND (decl, 0);
3719 expr = digest_init (type, expr, (tree *) 0);
3720 if (TREE_CODE (type) == ARRAY_TYPE && TYPE_SIZE (type) == 0)
3722 int failure = complete_array_type (type, expr, 1);
3724 my_friendly_abort (78);
3730 type = groktypename (TREE_VALUE (CALL_DECLARATOR_PARMS (decl)));
3731 decl = TREE_OPERAND (decl, 0);
3732 expr = build_c_cast (type, expr);
3735 if (warn_old_style_cast && ! in_system_header
3736 && current_lang_name != lang_name_c)
3737 warning ("use of old-style cast");
3742 /* Given plain tree nodes for an expression, build up the full semantics. */
3745 build_expr_from_tree (t)
3748 if (t == NULL_TREE || t == error_mark_node)
3751 switch (TREE_CODE (t))
3753 case IDENTIFIER_NODE:
3754 return do_identifier (t, 0, NULL_TREE);
3757 if (LOOKUP_EXPR_GLOBAL (t))
3758 return do_scoped_id (TREE_OPERAND (t, 0), 0);
3760 return do_identifier (TREE_OPERAND (t, 0), 0, NULL_TREE);
3762 case TEMPLATE_ID_EXPR:
3763 return (lookup_template_function
3764 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3765 build_expr_from_tree (TREE_OPERAND (t, 1))));
3768 return build_x_indirect_ref
3769 (build_expr_from_tree (TREE_OPERAND (t, 0)), "unary *");
3772 return build_functional_cast
3773 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3775 case REINTERPRET_CAST_EXPR:
3776 return build_reinterpret_cast
3777 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3779 case CONST_CAST_EXPR:
3780 return build_const_cast
3781 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3783 case DYNAMIC_CAST_EXPR:
3784 return build_dynamic_cast
3785 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3787 case STATIC_CAST_EXPR:
3788 return build_static_cast
3789 (TREE_TYPE (t), build_expr_from_tree (TREE_OPERAND (t, 0)));
3791 case PREDECREMENT_EXPR:
3792 case PREINCREMENT_EXPR:
3793 case POSTDECREMENT_EXPR:
3794 case POSTINCREMENT_EXPR:
3798 case TRUTH_NOT_EXPR:
3800 case CONVERT_EXPR: /* Unary + */
3805 return build_x_unary_op (TREE_CODE (t),
3806 build_expr_from_tree (TREE_OPERAND (t, 0)));
3811 case TRUNC_DIV_EXPR:
3813 case FLOOR_DIV_EXPR:
3814 case ROUND_DIV_EXPR:
3815 case EXACT_DIV_EXPR:
3817 case BIT_ANDTC_EXPR:
3820 case TRUNC_MOD_EXPR:
3821 case FLOOR_MOD_EXPR:
3822 case TRUTH_ANDIF_EXPR:
3823 case TRUTH_ORIF_EXPR:
3824 case TRUTH_AND_EXPR:
3839 return build_x_binary_op
3841 build_expr_from_tree (TREE_OPERAND (t, 0)),
3842 build_expr_from_tree (TREE_OPERAND (t, 1)));
3845 return build_m_component_ref
3846 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3847 build_expr_from_tree (TREE_OPERAND (t, 1)));
3850 return build_offset_ref (TREE_OPERAND (t, 0), TREE_OPERAND (t, 1));
3853 if (TREE_OPERAND (t, 0) == NULL_TREE)
3855 return build_parse_node (ARRAY_REF, NULL_TREE,
3856 build_expr_from_tree (TREE_OPERAND (t, 1)));
3857 return grok_array_decl (build_expr_from_tree (TREE_OPERAND (t, 0)),
3858 build_expr_from_tree (TREE_OPERAND (t, 1)));
3863 tree r = build_expr_from_tree (TREE_OPERAND (t, 0));
3864 if (TREE_CODE_CLASS (TREE_CODE (r)) != 't')
3866 return TREE_CODE (t) == SIZEOF_EXPR ? c_sizeof (r) : c_alignof (r);
3870 return build_x_modify_expr
3871 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3872 TREE_CODE (TREE_OPERAND (t, 1)),
3873 build_expr_from_tree (TREE_OPERAND (t, 2)));
3876 return build_x_arrow
3877 (build_expr_from_tree (TREE_OPERAND (t, 0)));
3881 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3882 build_expr_from_tree (TREE_OPERAND (t, 1)),
3883 build_expr_from_tree (TREE_OPERAND (t, 2)),
3884 NEW_EXPR_USE_GLOBAL (t));
3887 return delete_sanity
3888 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3889 build_expr_from_tree (TREE_OPERAND (t, 1)),
3890 DELETE_EXPR_USE_VEC (t), DELETE_EXPR_USE_GLOBAL (t));
3893 if (TREE_OPERAND (t, 1) == NULL_TREE)
3894 return build_x_compound_expr
3895 (build_expr_from_tree (TREE_OPERAND (t, 0)));
3897 my_friendly_abort (42);
3899 case METHOD_CALL_EXPR:
3900 if (TREE_CODE (TREE_OPERAND (t, 0)) == SCOPE_REF)
3902 tree ref = TREE_OPERAND (t, 0);
3903 return build_scoped_method_call
3904 (build_expr_from_tree (TREE_OPERAND (t, 1)),
3905 build_expr_from_tree (TREE_OPERAND (ref, 0)),
3906 TREE_OPERAND (ref, 1),
3907 build_expr_from_tree (TREE_OPERAND (t, 2)));
3911 tree fn = TREE_OPERAND (t, 0);
3913 /* We can get a TEMPLATE_ID_EXPR here on code like:
3917 so we must resolve that. However, we can also get things
3918 like a BIT_NOT_EXPR here, when referring to a destructor,
3919 and things like that are not correctly resolved by
3920 build_expr_from_tree. So, just use build_expr_from_tree
3921 when we really need it. */
3922 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
3923 fn = lookup_template_function
3924 (TREE_OPERAND (fn, 0),
3925 build_expr_from_tree (TREE_OPERAND (fn, 1)));
3927 return build_method_call
3928 (build_expr_from_tree (TREE_OPERAND (t, 1)),
3930 build_expr_from_tree (TREE_OPERAND (t, 2)),
3931 NULL_TREE, LOOKUP_NORMAL);
3935 if (TREE_CODE (TREE_OPERAND (t, 0)) == SCOPE_REF)
3937 tree ref = TREE_OPERAND (t, 0);
3938 return build_member_call
3939 (build_expr_from_tree (TREE_OPERAND (ref, 0)),
3940 TREE_OPERAND (ref, 1),
3941 build_expr_from_tree (TREE_OPERAND (t, 1)));
3945 tree name = TREE_OPERAND (t, 0);
3947 tree args = build_expr_from_tree (TREE_OPERAND (t, 1));
3948 if (args != NULL_TREE && TREE_CODE (name) == LOOKUP_EXPR
3949 && !LOOKUP_EXPR_GLOBAL (name)
3950 && TREE_CODE ((id = TREE_OPERAND (name, 0))) == IDENTIFIER_NODE
3951 && (!current_class_type
3952 || !lookup_member (current_class_type, id, 0, 0)))
3954 /* Do Koenig lookup if there are no class members. */
3955 name = do_identifier (id, 0, args);
3957 else if (TREE_CODE (name) == TEMPLATE_ID_EXPR
3958 || ! really_overloaded_fn (name))
3959 name = build_expr_from_tree (name);
3960 return build_x_function_call (name, args, current_class_ref);
3964 return build_x_conditional_expr
3965 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3966 build_expr_from_tree (TREE_OPERAND (t, 1)),
3967 build_expr_from_tree (TREE_OPERAND (t, 2)));
3969 case PSEUDO_DTOR_EXPR:
3970 return (finish_pseudo_destructor_call_expr
3971 (build_expr_from_tree (TREE_OPERAND (t, 0)),
3972 build_expr_from_tree (TREE_OPERAND (t, 1)),
3973 build_expr_from_tree (TREE_OPERAND (t, 2))));
3977 tree purpose, value, chain;
3979 if (t == void_list_node)
3982 purpose = TREE_PURPOSE (t);
3984 purpose = build_expr_from_tree (purpose);
3985 value = TREE_VALUE (t);
3987 value = build_expr_from_tree (value);
3988 chain = TREE_CHAIN (t);
3989 if (chain && chain != void_type_node)
3990 chain = build_expr_from_tree (chain);
3991 return tree_cons (purpose, value, chain);
3996 tree object = build_expr_from_tree (TREE_OPERAND (t, 0));
3997 tree field = TREE_OPERAND (t, 1);
3999 /* We use a COMPONENT_REF to indicate things of the form `x.b'
4000 and `x.A::b'. We must distinguish between those cases
4002 if (TREE_CODE (field) == SCOPE_REF)
4003 return build_object_ref (object,
4004 TREE_OPERAND (field, 0),
4005 TREE_OPERAND (field, 1));
4007 return build_x_component_ref (object, field,
4012 return build_throw (build_expr_from_tree (TREE_OPERAND (t, 0)));
4018 /* digest_init will do the wrong thing if we let it. */
4019 if (TREE_TYPE (t) && TYPE_PTRMEMFUNC_P (TREE_TYPE (t)))
4022 r = build_nt (CONSTRUCTOR, NULL_TREE,
4023 build_expr_from_tree (CONSTRUCTOR_ELTS (t)));
4024 TREE_HAS_CONSTRUCTOR (r) = TREE_HAS_CONSTRUCTOR (t);
4027 return digest_init (TREE_TYPE (t), r, 0);
4032 if (TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (t, 0))) == 't')
4033 return get_typeid (TREE_OPERAND (t, 0));
4034 return build_typeid (build_expr_from_tree (TREE_OPERAND (t, 0)));
4037 return convert_from_reference (t);
4040 return build_va_arg (build_expr_from_tree (TREE_OPERAND (t, 0)),
4048 /* This is something of the form `int (*a)++' that has turned out to be an
4049 expr. It was only converted into parse nodes, so we need to go through
4050 and build up the semantics. Most of the work is done by
4051 build_expr_from_tree, above.
4053 In the above example, TYPE is `int' and DECL is `*a'. */
4056 reparse_decl_as_expr (type, decl)
4059 decl = build_expr_from_tree (decl);
4061 return build_functional_cast (type, build_tree_list (NULL_TREE, decl));
4066 /* This is something of the form `int (*a)' that has turned out to be a
4067 decl. It was only converted into parse nodes, so we need to do the
4068 checking that make_{pointer,reference}_declarator do. */
4071 finish_decl_parsing (decl)
4074 extern int current_class_depth;
4076 switch (TREE_CODE (decl))
4078 case IDENTIFIER_NODE:
4081 return make_pointer_declarator
4082 (NULL_TREE, finish_decl_parsing (TREE_OPERAND (decl, 0)));
4084 return make_reference_declarator
4085 (NULL_TREE, finish_decl_parsing (TREE_OPERAND (decl, 0)));
4087 TREE_OPERAND (decl, 0) = finish_decl_parsing (TREE_OPERAND (decl, 0));
4090 push_nested_class (TREE_TYPE (TREE_OPERAND (decl, 0)), 3);
4091 TREE_COMPLEXITY (decl) = current_class_depth;
4094 TREE_OPERAND (decl, 0) = finish_decl_parsing (TREE_OPERAND (decl, 0));
4097 /* For attribute handling. */
4098 TREE_VALUE (decl) = finish_decl_parsing (TREE_VALUE (decl));
4101 my_friendly_abort (5);
4107 check_cp_case_value (value)
4110 if (value == NULL_TREE)
4113 /* Strip NON_LVALUE_EXPRs since we aren't using as an lvalue. */
4114 STRIP_TYPE_NOPS (value);
4116 if (TREE_READONLY_DECL_P (value))
4118 value = decl_constant_value (value);
4119 STRIP_TYPE_NOPS (value);
4121 value = fold (value);
4123 if (TREE_CODE (value) != INTEGER_CST
4124 && value != error_mark_node)
4126 cp_error ("case label `%E' does not reduce to an integer constant",
4128 value = error_mark_node;
4131 /* Promote char or short to int. */
4132 value = default_conversion (value);
4134 constant_expression_warning (value);
4139 /* Return 1 if root encloses child. */
4142 is_namespace_ancestor (root, child)
4147 if (root == global_namespace)
4149 if (child == global_namespace)
4151 return is_namespace_ancestor (root, CP_DECL_CONTEXT (child));
4155 /* Return the namespace that is the common ancestor
4156 of two given namespaces. */
4159 namespace_ancestor (ns1, ns2)
4162 if (is_namespace_ancestor (ns1, ns2))
4164 return namespace_ancestor (CP_DECL_CONTEXT (ns1), ns2);
4167 /* Insert used into the using list of user. Set indirect_flag if this
4168 directive is not directly from the source. Also find the common
4169 ancestor and let our users know about the new namespace */
4171 add_using_namespace (user, used, indirect)
4177 /* Using oneself is a no-op. */
4180 my_friendly_assert (TREE_CODE (user) == NAMESPACE_DECL, 380);
4181 my_friendly_assert (TREE_CODE (used) == NAMESPACE_DECL, 380);
4182 /* Check if we already have this. */
4183 t = purpose_member (used, DECL_NAMESPACE_USING (user));
4187 /* Promote to direct usage. */
4188 TREE_INDIRECT_USING (t) = 0;
4192 /* Add used to the user's using list. */
4193 DECL_NAMESPACE_USING (user)
4194 = tree_cons (used, namespace_ancestor (user, used),
4195 DECL_NAMESPACE_USING (user));
4197 TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user)) = indirect;
4199 /* Add user to the used's users list. */
4200 DECL_NAMESPACE_USERS (used)
4201 = tree_cons (user, 0, DECL_NAMESPACE_USERS (used));
4203 /* Recursively add all namespaces used. */
4204 for (t = DECL_NAMESPACE_USING (used); t; t = TREE_CHAIN (t))
4205 /* indirect usage */
4206 add_using_namespace (user, TREE_PURPOSE (t), 1);
4208 /* Tell everyone using us about the new used namespaces. */
4209 for (t = DECL_NAMESPACE_USERS (user); t; t = TREE_CHAIN (t))
4210 add_using_namespace (TREE_PURPOSE (t), used, 1);
4213 /* Combines two sets of overloaded functions into an OVERLOAD chain, removing
4214 duplicates. The first list becomes the tail of the result.
4216 The algorithm is O(n^2). We could get this down to O(n log n) by
4217 doing a sort on the addresses of the functions, if that becomes
4221 merge_functions (s1, s2)
4225 for (; s2; s2 = OVL_NEXT (s2))
4227 tree fn = OVL_CURRENT (s2);
4228 if (! ovl_member (fn, s1))
4229 s1 = build_overload (fn, s1);
4234 /* This should return an error not all definitions define functions.
4235 It is not an error if we find two functions with exactly the
4236 same signature, only if these are selected in overload resolution.
4237 old is the current set of bindings, new the freshly-found binding.
4238 XXX Do we want to give *all* candidates in case of ambiguity?
4239 XXX In what way should I treat extern declarations?
4240 XXX I don't want to repeat the entire duplicate_decls here */
4243 ambiguous_decl (name, old, new, flags)
4250 my_friendly_assert (old != NULL_TREE, 393);
4251 /* Copy the value. */
4252 val = BINDING_VALUE (new);
4254 switch (TREE_CODE (val))
4257 /* If we expect types or namespaces, and not templates,
4258 or this is not a template class. */
4259 if (LOOKUP_QUALIFIERS_ONLY (flags)
4260 && !DECL_CLASS_TEMPLATE_P (val))
4264 if (LOOKUP_NAMESPACES_ONLY (flags))
4267 case NAMESPACE_DECL:
4268 if (LOOKUP_TYPES_ONLY (flags))
4272 if (LOOKUP_QUALIFIERS_ONLY (flags))
4276 if (!BINDING_VALUE (old))
4277 BINDING_VALUE (old) = val;
4278 else if (val && val != BINDING_VALUE (old))
4280 if (is_overloaded_fn (BINDING_VALUE (old))
4281 && is_overloaded_fn (val))
4283 BINDING_VALUE (old) = merge_functions (BINDING_VALUE (old),
4288 /* Some declarations are functions, some are not. */
4289 if (flags & LOOKUP_COMPLAIN)
4291 /* If we've already given this error for this lookup,
4292 BINDING_VALUE (old) is error_mark_node, so let's not
4293 repeat ourselves. */
4294 if (BINDING_VALUE (old) != error_mark_node)
4296 cp_error ("use of `%D' is ambiguous", name);
4297 cp_error_at (" first declared as `%#D' here",
4298 BINDING_VALUE (old));
4300 cp_error_at (" also declared as `%#D' here", val);
4302 BINDING_VALUE (old) = error_mark_node;
4305 /* ... and copy the type. */
4306 type = BINDING_TYPE (new);
4307 if (LOOKUP_NAMESPACES_ONLY (flags))
4309 if (!BINDING_TYPE (old))
4310 BINDING_TYPE (old) = type;
4311 else if (type && BINDING_TYPE (old) != type)
4313 if (flags & LOOKUP_COMPLAIN)
4315 cp_error ("`%D' denotes an ambiguous type",name);
4316 cp_error_at (" first type here", BINDING_TYPE (old));
4317 cp_error_at (" other type here", type);
4323 /* Subroutine of unualified_namespace_lookup:
4324 Add the bindings of NAME in used namespaces to VAL.
4325 We are currently looking for names in namespace SCOPE, so we
4326 look through USINGS for using-directives of namespaces
4327 which have SCOPE as a common ancestor with the current scope.
4328 Returns zero on errors. */
4331 lookup_using_namespace (name, val, usings, scope, flags, spacesp)
4332 tree name, val, usings, scope;
4338 /* Iterate over all used namespaces in current, searching for using
4339 directives of scope. */
4340 for (iter = usings; iter; iter = TREE_CHAIN (iter))
4341 if (TREE_VALUE (iter) == scope)
4344 *spacesp = tree_cons (TREE_PURPOSE (iter), NULL_TREE,
4346 val1 = binding_for_name (name, TREE_PURPOSE (iter));
4347 /* Resolve ambiguities. */
4348 val = ambiguous_decl (name, val, val1, flags);
4350 return BINDING_VALUE (val) != error_mark_node;
4354 Accepts the NAME to lookup and its qualifying SCOPE.
4355 Returns the name/type pair found into the CPLUS_BINDING RESULT,
4359 qualified_lookup_using_namespace (name, scope, result, flags)
4365 /* Maintain a list of namespaces visited... */
4366 tree seen = NULL_TREE;
4367 /* ... and a list of namespace yet to see. */
4368 tree todo = NULL_TREE;
4370 while (scope && (result != error_mark_node))
4372 seen = tree_cons (scope, NULL_TREE, seen);
4373 result = ambiguous_decl (name, result,
4374 binding_for_name (name, scope), flags);
4375 if (!BINDING_VALUE (result) && !BINDING_TYPE (result))
4376 /* Consider using directives. */
4377 for (usings = DECL_NAMESPACE_USING (scope); usings;
4378 usings = TREE_CHAIN (usings))
4379 /* If this was a real directive, and we have not seen it. */
4380 if (!TREE_INDIRECT_USING (usings)
4381 && !purpose_member (TREE_PURPOSE (usings), seen))
4382 todo = tree_cons (TREE_PURPOSE (usings), NULL_TREE, todo);
4385 scope = TREE_PURPOSE (todo);
4386 todo = TREE_CHAIN (todo);
4389 scope = NULL_TREE; /* If there never was a todo list. */
4391 return result != error_mark_node;
4394 /* [namespace.memdef]/2 */
4396 /* Set the context of a declaration to scope. Complain if we are not
4400 set_decl_namespace (decl, scope, friendp)
4406 if (scope == std_node)
4407 scope = global_namespace;
4408 /* Get rid of namespace aliases. */
4409 scope = ORIGINAL_NAMESPACE (scope);
4411 /* It is ok for friends to be qualified in parallel space. */
4412 if (!friendp && !is_namespace_ancestor (current_namespace, scope))
4413 cp_error ("declaration of `%D' not in a namespace surrounding `%D'",
4415 DECL_CONTEXT (decl) = FROB_CONTEXT (scope);
4416 if (scope != current_namespace)
4418 /* See whether this has been declared in the namespace. */
4419 old = namespace_binding (DECL_NAME (decl), scope);
4421 /* No old declaration at all. */
4423 if (!is_overloaded_fn (decl))
4424 /* Don't compare non-function decls with decls_match here,
4425 since it can't check for the correct constness at this
4426 point. pushdecl will find those errors later. */
4428 /* Since decl is a function, old should contain a function decl. */
4429 if (!is_overloaded_fn (old))
4431 if (processing_template_decl || processing_specialization)
4432 /* We have not yet called push_template_decl to turn the
4433 FUNCTION_DECL into a TEMPLATE_DECL, so the declarations
4434 won't match. But, we'll check later, when we construct the
4437 for (; old; old = OVL_NEXT (old))
4438 if (decls_match (decl, OVL_CURRENT (old)))
4444 cp_error ("`%D' should have been declared inside `%D'",
4448 /* Compute the namespace where a declaration is defined. */
4451 decl_namespace (decl)
4454 while (DECL_CONTEXT (decl))
4456 decl = DECL_CONTEXT (decl);
4457 if (TREE_CODE (decl) == NAMESPACE_DECL)
4459 if (TREE_CODE_CLASS (TREE_CODE (decl)) == 't')
4460 decl = TYPE_STUB_DECL (decl);
4461 my_friendly_assert (TREE_CODE_CLASS (TREE_CODE (decl)) == 'd', 390);
4464 return global_namespace;
4467 /* Return the namespace where the current declaration is declared. */
4470 current_decl_namespace ()
4473 /* If we have been pushed into a different namespace, use it. */
4474 if (decl_namespace_list)
4475 return TREE_PURPOSE (decl_namespace_list);
4477 if (current_class_type)
4478 result = decl_namespace (TYPE_STUB_DECL (current_class_type));
4479 else if (current_function_decl)
4480 result = decl_namespace (current_function_decl);
4482 result = current_namespace;
4486 /* Temporarily set the namespace for the current declaration. */
4489 push_decl_namespace (decl)
4492 if (TREE_CODE (decl) != NAMESPACE_DECL)
4493 decl = decl_namespace (decl);
4494 decl_namespace_list = tree_cons (decl, NULL_TREE, decl_namespace_list);
4498 pop_decl_namespace ()
4500 decl_namespace_list = TREE_CHAIN (decl_namespace_list);
4503 /* Enter a class or namespace scope. */
4509 if (TREE_CODE (t) == NAMESPACE_DECL)
4510 push_decl_namespace (t);
4515 /* Leave scope pushed by push_scope. */
4521 if (TREE_CODE (t) == NAMESPACE_DECL)
4522 pop_decl_namespace ();
4527 /* [basic.lookup.koenig] */
4528 /* A non-zero return value in the functions below indicates an error.
4529 All nodes allocated in the procedure are on the scratch obstack. */
4539 static int arg_assoc PARAMS ((struct arg_lookup*, tree));
4540 static int arg_assoc_args PARAMS ((struct arg_lookup*, tree));
4541 static int arg_assoc_type PARAMS ((struct arg_lookup*, tree));
4542 static int add_function PARAMS ((struct arg_lookup *, tree));
4543 static int arg_assoc_namespace PARAMS ((struct arg_lookup *, tree));
4544 static int arg_assoc_class PARAMS ((struct arg_lookup *, tree));
4545 static int arg_assoc_template_arg PARAMS ((struct arg_lookup*, tree));
4547 /* Add a function to the lookup structure.
4548 Returns 1 on error. */
4551 add_function (k, fn)
4552 struct arg_lookup *k;
4555 /* We used to check here to see if the function was already in the list,
4556 but that's O(n^2), which is just too expensive for function lookup.
4557 Now we deal with the occasional duplicate in joust. In doing this, we
4558 assume that the number of duplicates will be small compared to the
4559 total number of functions being compared, which should usually be the
4562 /* We must find only functions, or exactly one non-function. */
4563 if (k->functions && is_overloaded_fn (k->functions)
4564 && is_overloaded_fn (fn))
4565 k->functions = build_overload (fn, k->functions);
4566 else if (k->functions)
4568 tree f1 = OVL_CURRENT (k->functions);
4570 if (is_overloaded_fn (f1))
4572 fn = f1; f1 = f2; f2 = fn;
4574 cp_error_at ("`%D' is not a function,", f1);
4575 cp_error_at (" conflict with `%D'", f2);
4576 cp_error (" in call to `%D'", k->name);
4584 /* Add functions of a namespace to the lookup structure.
4585 Returns 1 on error. */
4588 arg_assoc_namespace (k, scope)
4589 struct arg_lookup *k;
4594 if (purpose_member (scope, k->namespaces))
4596 k->namespaces = tree_cons (scope, NULL_TREE, k->namespaces);
4598 value = namespace_binding (k->name, scope);
4602 for (; value; value = OVL_NEXT (value))
4603 if (add_function (k, OVL_CURRENT (value)))
4609 /* Adds everything associated with a template argument to the lookup
4610 structure. Returns 1 on error. */
4613 arg_assoc_template_arg (k, arg)
4614 struct arg_lookup* k;
4617 /* [basic.lookup.koenig]
4619 If T is a template-id, its associated namespaces and classes are
4620 ... the namespaces and classes associated with the types of the
4621 template arguments provided for template type parameters
4622 (excluding template template parameters); the namespaces in which
4623 any template template arguments are defined; and the classes in
4624 which any member templates used as template template arguments
4625 are defined. [Note: non-type template arguments do not
4626 contribute to the set of associated namespaces. ] */
4628 /* Consider first template template arguments. */
4629 if (TREE_CODE (arg) == TEMPLATE_DECL)
4631 tree ctx = CP_DECL_CONTEXT (arg);
4633 /* It's not a member template. */
4634 if (TREE_CODE (ctx) == NAMESPACE_DECL)
4635 return arg_assoc_namespace (k, ctx);
4636 /* Otherwise, it must be member template. */
4638 return arg_assoc_class (k, ctx);
4640 /* It's not a template template argument, but it is a type template
4642 else if (TREE_CODE_CLASS (TREE_CODE (arg)) == 't')
4643 return arg_assoc_type (k, arg);
4644 /* It's a non-type template argument. */
4649 /* Adds everything associated with class to the lookup structure.
4650 Returns 1 on error. */
4653 arg_assoc_class (k, type)
4654 struct arg_lookup* k;
4657 tree list, friends, context;
4660 /* Backend build structures, such as __builtin_va_list, aren't
4661 affected by all this. */
4662 if (!CLASS_TYPE_P (type))
4665 if (purpose_member (type, k->classes))
4667 k->classes = tree_cons (type, NULL_TREE, k->classes);
4669 context = decl_namespace (TYPE_MAIN_DECL (type));
4670 if (arg_assoc_namespace (k, context))
4673 /* Process baseclasses. */
4674 for (i = 0; i < CLASSTYPE_N_BASECLASSES (type); i++)
4675 if (arg_assoc_class (k, TYPE_BINFO_BASETYPE (type, i)))
4678 /* Process friends. */
4679 for (list = DECL_FRIENDLIST (TYPE_MAIN_DECL (type)); list;
4680 list = TREE_CHAIN (list))
4681 if (k->name == TREE_PURPOSE (list))
4682 for (friends = TREE_VALUE (list); friends;
4683 friends = TREE_CHAIN (friends))
4684 /* Only interested in global functions with potentially hidden
4685 (i.e. unqualified) declarations. */
4686 if (TREE_PURPOSE (list) == error_mark_node && TREE_VALUE (list)
4687 && decl_namespace (TREE_VALUE (list)) == context)
4688 if (add_function (k, TREE_VALUE (list)))
4691 /* Process template arguments. */
4692 if (CLASSTYPE_TEMPLATE_INFO (type))
4694 list = innermost_args (CLASSTYPE_TI_ARGS (type));
4695 for (i = 0; i < TREE_VEC_LENGTH (list); ++i)
4696 arg_assoc_template_arg (k, TREE_VEC_ELT (list, i));
4702 /* Adds everything associated with a given type.
4703 Returns 1 on error. */
4706 arg_assoc_type (k, type)
4707 struct arg_lookup *k;
4710 switch (TREE_CODE (type))
4720 if (TYPE_PTRMEMFUNC_P (type))
4721 return arg_assoc_type (k, TYPE_PTRMEMFUNC_FN_TYPE (type));
4722 return arg_assoc_class (k, type);
4724 case REFERENCE_TYPE:
4726 return arg_assoc_type (k, TREE_TYPE (type));
4729 return arg_assoc_namespace (k, decl_namespace (TYPE_MAIN_DECL (type)));
4731 /* Pointer to member: associate class type and value type. */
4732 if (arg_assoc_type (k, TYPE_OFFSET_BASETYPE (type)))
4734 return arg_assoc_type (k, TREE_TYPE (type));
4736 /* The basetype is referenced in the first arg type, so just
4739 /* Associate the parameter types. */
4740 if (arg_assoc_args (k, TYPE_ARG_TYPES (type)))
4742 /* Associate the return type. */
4743 return arg_assoc_type (k, TREE_TYPE (type));
4744 case TEMPLATE_TYPE_PARM:
4745 case TEMPLATE_TEMPLATE_PARM:
4748 if (type == unknown_type_node)
4750 /* else fall through */
4752 my_friendly_abort (390);
4757 /* Adds everything associated with arguments. Returns 1 on error. */
4760 arg_assoc_args (k, args)
4761 struct arg_lookup* k;
4764 for (; args; args = TREE_CHAIN (args))
4765 if (arg_assoc (k, TREE_VALUE (args)))
4770 /* Adds everything associated with a given tree_node. Returns 1 on error. */
4774 struct arg_lookup* k;
4777 if (n == error_mark_node)
4780 if (TREE_CODE_CLASS (TREE_CODE (n)) == 't')
4781 return arg_assoc_type (k, n);
4783 if (! type_unknown_p (n))
4784 return arg_assoc_type (k, TREE_TYPE (n));
4786 if (TREE_CODE (n) == ADDR_EXPR)
4787 n = TREE_OPERAND (n, 0);
4788 if (TREE_CODE (n) == COMPONENT_REF)
4789 n = TREE_OPERAND (n, 1);
4790 if (TREE_CODE (n) == OFFSET_REF)
4791 n = TREE_OPERAND (n, 1);
4792 while (TREE_CODE (n) == TREE_LIST)
4795 if (TREE_CODE (n) == FUNCTION_DECL)
4796 return arg_assoc_type (k, TREE_TYPE (n));
4797 if (TREE_CODE (n) == TEMPLATE_ID_EXPR)
4799 /* [basic.lookup.koenig]
4801 If T is a template-id, its associated namespaces and classes
4802 are the namespace in which the template is defined; for
4803 member templates, the member template's class... */
4804 tree template = TREE_OPERAND (n, 0);
4805 tree args = TREE_OPERAND (n, 1);
4809 /* First, the template. There may actually be more than one if
4810 this is an overloaded function template. But, in that case,
4811 we only need the first; all the functions will be in the same
4813 template = OVL_CURRENT (template);
4815 ctx = CP_DECL_CONTEXT (template);
4817 if (TREE_CODE (ctx) == NAMESPACE_DECL)
4819 if (arg_assoc_namespace (k, ctx) == 1)
4822 /* It must be a member template. */
4823 else if (arg_assoc_class (k, ctx) == 1)
4826 /* Now the arguments. */
4827 for (arg = args; arg != NULL_TREE; arg = TREE_CHAIN (arg))
4828 if (arg_assoc_template_arg (k, TREE_VALUE (arg)) == 1)
4833 my_friendly_assert (TREE_CODE (n) == OVERLOAD, 980715);
4835 for (; n; n = OVL_CHAIN (n))
4836 if (arg_assoc_type (k, TREE_TYPE (OVL_FUNCTION (n))))
4843 /* Performs Koenig lookup depending on arguments, where fns
4844 are the functions found in normal lookup. */
4847 lookup_arg_dependent (name, fns, args)
4852 struct arg_lookup k;
4853 tree fn = NULL_TREE;
4857 k.classes = NULL_TREE;
4859 /* Note that we've already looked at some namespaces during normal
4860 unqualified lookup, unless we found a decl in function scope. */
4862 fn = OVL_CURRENT (fns);
4863 if (fn && TREE_CODE (fn) == FUNCTION_DECL && DECL_LOCAL_FUNCTION_P (fn))
4864 k.namespaces = NULL_TREE;
4866 unqualified_namespace_lookup (name, 0, &k.namespaces);
4868 arg_assoc_args (&k, args);
4872 /* Process a namespace-alias declaration. */
4875 do_namespace_alias (alias, namespace)
4876 tree alias, namespace;
4878 if (TREE_CODE (namespace) != NAMESPACE_DECL)
4880 /* The parser did not find it, so it's not there. */
4881 cp_error ("unknown namespace `%D'", namespace);
4885 namespace = ORIGINAL_NAMESPACE (namespace);
4887 /* Build the alias. */
4888 alias = build_lang_decl (NAMESPACE_DECL, alias, void_type_node);
4889 DECL_NAMESPACE_ALIAS (alias) = namespace;
4893 /* Check a non-member using-declaration. Return the name and scope
4894 being used, and the USING_DECL, or NULL_TREE on failure. */
4897 validate_nonmember_using_decl (decl, scope, name)
4902 if (TREE_CODE (decl) == SCOPE_REF
4903 && TREE_OPERAND (decl, 0) == std_node)
4905 if (namespace_bindings_p ()
4906 && current_namespace == global_namespace)
4907 /* There's no need for a using declaration at all, here,
4908 since `std' is the same as `::'. We can't just pass this
4909 on because we'll complain later about declaring something
4910 in the same scope as a using declaration with the same
4911 name. We return NULL_TREE which indicates to the caller
4912 that there's no need to do any further processing. */
4915 *scope = global_namespace;
4916 *name = TREE_OPERAND (decl, 1);
4918 else if (TREE_CODE (decl) == SCOPE_REF)
4920 *scope = TREE_OPERAND (decl, 0);
4921 *name = TREE_OPERAND (decl, 1);
4923 /* [namespace.udecl]
4925 A using-declaration for a class member shall be a
4926 member-declaration. */
4927 if (TREE_CODE (*scope) != NAMESPACE_DECL)
4929 if (TYPE_P (*scope))
4930 cp_error ("`%T' is not a namespace", *scope);
4932 cp_error ("`%D' is not a namespace", *scope);
4936 else if (TREE_CODE (decl) == IDENTIFIER_NODE
4937 || TREE_CODE (decl) == TYPE_DECL
4938 || TREE_CODE (decl) == TEMPLATE_DECL)
4940 *scope = global_namespace;
4944 my_friendly_abort (382);
4945 if (TREE_CODE_CLASS (TREE_CODE (*name)) == 'd')
4946 *name = DECL_NAME (*name);
4947 /* Make a USING_DECL. */
4948 return push_using_decl (*scope, *name);
4951 /* Process local and global using-declarations. */
4954 do_nonmember_using_decl (scope, name, oldval, oldtype, newval, newtype)
4956 tree oldval, oldtype;
4957 tree *newval, *newtype;
4961 *newval = *newtype = NULL_TREE;
4962 decls = make_node (CPLUS_BINDING);
4963 if (!qualified_lookup_using_namespace (name, scope, decls, 0))
4967 if (!BINDING_VALUE (decls) && !BINDING_TYPE (decls))
4969 cp_error ("`%D' not declared", name);
4973 /* Check for using functions. */
4974 if (BINDING_VALUE (decls) && is_overloaded_fn (BINDING_VALUE (decls)))
4978 if (oldval && !is_overloaded_fn (oldval))
4980 duplicate_decls (OVL_CURRENT (BINDING_VALUE (decls)), oldval);
4985 for (tmp = BINDING_VALUE (decls); tmp; tmp = OVL_NEXT (tmp))
4987 tree new_fn = OVL_CURRENT (tmp);
4989 /* [namespace.udecl]
4991 If a function declaration in namespace scope or block
4992 scope has the same name and the same parameter types as a
4993 function introduced by a using declaration the program is
4995 for (tmp1 = oldval; tmp1; tmp1 = OVL_NEXT (tmp1))
4997 tree old_fn = OVL_CURRENT (tmp1);
4999 if (!OVL_USED (tmp1)
5000 && compparms (TYPE_ARG_TYPES (TREE_TYPE (new_fn)),
5001 TYPE_ARG_TYPES (TREE_TYPE (old_fn))))
5003 /* There was already a non-using declaration in
5004 this scope with the same parameter types. */
5005 cp_error ("`%D' is already declared in this scope",
5009 else if (duplicate_decls (new_fn, old_fn))
5010 /* We're re-using something we already used
5011 before. We don't need to add it again. */
5015 /* If we broke out of the loop, there's no reason to add
5016 this function to the using declarations for this
5021 *newval = build_overload (OVL_CURRENT (tmp), *newval);
5022 if (TREE_CODE (*newval) != OVERLOAD)
5023 *newval = ovl_cons (*newval, NULL_TREE);
5024 OVL_USED (*newval) = 1;
5029 *newval = BINDING_VALUE (decls);
5031 duplicate_decls (*newval, oldval);
5034 *newtype = BINDING_TYPE (decls);
5035 if (oldtype && *newtype && oldtype != *newtype)
5037 cp_error ("using directive `%D' introduced ambiguous type `%T'",
5043 /* Process a using-declaration not appearing in class or local scope. */
5046 do_toplevel_using_decl (decl)
5049 tree scope, name, binding;
5050 tree oldval, oldtype, newval, newtype;
5052 decl = validate_nonmember_using_decl (decl, &scope, &name);
5053 if (decl == NULL_TREE)
5056 binding = binding_for_name (name, current_namespace);
5058 oldval = BINDING_VALUE (binding);
5059 oldtype = BINDING_TYPE (binding);
5061 do_nonmember_using_decl (scope, name, oldval, oldtype, &newval, &newtype);
5063 /* Copy declarations found. */
5065 BINDING_VALUE (binding) = newval;
5067 BINDING_TYPE (binding) = newtype;
5071 /* Process a using-declaration at function scope. */
5074 do_local_using_decl (decl)
5078 tree oldval, oldtype, newval, newtype;
5080 decl = validate_nonmember_using_decl (decl, &scope, &name);
5081 if (decl == NULL_TREE)
5084 oldval = lookup_name_current_level (name);
5085 oldtype = lookup_type_current_level (name);
5087 do_nonmember_using_decl (scope, name, oldval, oldtype, &newval, &newtype);
5091 if (is_overloaded_fn (newval))
5095 /* We only need to push declarations for those functions
5096 that were not already bound in the current level.
5097 The old value might be NULL_TREE, it might be a single
5098 function, or an OVERLOAD. */
5099 if (oldval && TREE_CODE (oldval) == OVERLOAD)
5100 term = OVL_FUNCTION (oldval);
5103 for (fn = newval; fn && OVL_CURRENT (fn) != term;
5105 push_overloaded_decl (OVL_CURRENT (fn),
5106 PUSH_LOCAL | PUSH_USING);
5109 push_local_binding (name, newval, PUSH_USING);
5112 set_identifier_type_value (name, newtype);
5116 do_class_using_decl (decl)
5121 if (TREE_CODE (decl) != SCOPE_REF
5122 || TREE_CODE_CLASS (TREE_CODE (TREE_OPERAND (decl, 0))) != 't')
5124 cp_error ("using-declaration for non-member at class scope");
5127 name = TREE_OPERAND (decl, 1);
5128 if (TREE_CODE (name) == BIT_NOT_EXPR)
5130 cp_error ("using-declaration for destructor");
5133 if (TREE_CODE (name) == TYPE_DECL)
5134 name = DECL_NAME (name);
5136 my_friendly_assert (TREE_CODE (name) == IDENTIFIER_NODE, 980716);
5138 value = build_lang_decl (USING_DECL, name, void_type_node);
5139 DECL_INITIAL (value) = TREE_OPERAND (decl, 0);
5143 /* Process a using-directive. */
5146 do_using_directive (namespace)
5149 if (namespace == std_node)
5151 /* using namespace A::B::C; */
5152 if (TREE_CODE (namespace) == SCOPE_REF)
5153 namespace = TREE_OPERAND (namespace, 1);
5154 if (TREE_CODE (namespace) == IDENTIFIER_NODE)
5156 /* Lookup in lexer did not find a namespace. */
5157 cp_error ("namespace `%T' undeclared", namespace);
5160 if (TREE_CODE (namespace) != NAMESPACE_DECL)
5162 cp_error ("`%T' is not a namespace", namespace);
5165 namespace = ORIGINAL_NAMESPACE (namespace);
5166 if (!toplevel_bindings_p ())
5167 push_using_directive (namespace);
5170 add_using_namespace (current_namespace, namespace, 0);
5174 check_default_args (x)
5177 tree arg = TYPE_ARG_TYPES (TREE_TYPE (x));
5178 int saw_def = 0, i = 0 - (TREE_CODE (TREE_TYPE (x)) == METHOD_TYPE);
5179 for (; arg && arg != void_list_node; arg = TREE_CHAIN (arg), ++i)
5181 if (TREE_PURPOSE (arg))
5185 cp_error_at ("default argument missing for parameter %P of `%+#D'",
5196 TREE_USED (decl) = 1;
5197 if (processing_template_decl)
5199 assemble_external (decl);
5201 /* Is it a synthesized method that needs to be synthesized? */
5202 if (TREE_CODE (decl) == FUNCTION_DECL
5203 && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)
5204 && DECL_ARTIFICIAL (decl)
5205 && ! DECL_INITIAL (decl)
5206 /* Kludge: don't synthesize for default args. */
5207 && current_function_decl)
5208 synthesize_method (decl);
5210 /* If this is a function or variable that is an instance of some
5211 template, we now know that we will need to actually do the
5212 instantiation. We check that DECL is not an explicit
5213 instantiation because that is not checked in instantiate_decl. */
5214 if ((TREE_CODE (decl) == FUNCTION_DECL || TREE_CODE (decl) == VAR_DECL)
5215 && DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)
5216 && (!DECL_EXPLICIT_INSTANTIATION (decl)
5217 || (TREE_CODE (decl) == FUNCTION_DECL && DECL_INLINE (decl))))
5218 instantiate_decl (decl);
5221 /* Helper function for named_class_head_sans_basetype nonterminal. We
5222 have just seen something of the form `AGGR SCOPE::ID'. Return a
5223 TYPE_DECL for the type declared by ID in SCOPE. */
5226 handle_class_head (aggr, scope, id)
5227 tree aggr, scope, id;
5231 if (TREE_CODE (id) == TYPE_DECL)
5233 else if (DECL_CLASS_TEMPLATE_P (id))
5234 decl = DECL_TEMPLATE_RESULT (id);
5237 tree current = current_scope();
5239 if (current == NULL_TREE)
5240 current = current_namespace;
5241 if (scope == std_node)
5242 scope = global_namespace;
5243 if (scope == NULL_TREE)
5244 scope = global_namespace;
5245 if (scope == current)
5247 /* We've been given AGGR SCOPE::ID, when we're already inside SCOPE.
5248 Be nice about it. */
5250 cp_pedwarn ("extra qualification `%T::' on member `%D' ignored",
5251 FROB_CONTEXT (scope), id);
5253 else if (scope != global_namespace)
5254 cp_error ("`%T' does not have a nested type named `%D'", scope, id);
5256 cp_error ("no file-scope type named `%D'", id);
5258 /* Inject it at the current scope. */
5259 decl = TYPE_MAIN_DECL (xref_tag (aggr, id, 1));
5262 /* Enter the SCOPE. If this turns out not to be a definition, the
5263 parser must leave the scope. */
5264 push_scope (CP_DECL_CONTEXT (decl));
5266 /* If we see something like:
5268 template <typename T> struct S::I ....
5270 we must create a TEMPLATE_DECL for the nested type. */
5271 if (PROCESSING_REAL_TEMPLATE_DECL_P ())
5272 decl = push_template_decl (decl);
5277 /* Initialize decl2.c. */
5282 ggc_add_tree_root (&decl_namespace_list, 1);
5283 ggc_add_tree_varray_root (&saved_inlines, 1);
5284 ggc_add_tree_varray_root (&pending_statics, 1);
5285 ggc_add_tree_varray_root (&ssdf_decls, 1);
5286 ggc_add_tree_root (&ssdf_decl, 1);
5287 ggc_add_tree_root (&priority_decl, 1);
5288 ggc_add_tree_root (&initialize_p_decl, 1);
5289 ggc_add_tree_root (&pending_vtables, 1);