gcc/cp/decl2.c

   1 /* Process declarations and variables for C++ compiler.
   2    Copyright (C) 1988, 1992, 1993, 1994, 1995, 1996, 1997, 1998,
   3    1999, 2000, 2001, 2002, 2003, 2004 Free Software Foundation, Inc.
   4    Hacked by Michael Tiemann (tiemann@cygnus.com)
   5
   6 This file is part of GCC.
   7
   8 GCC is free software; you can redistribute it and/or modify
   9 it under the terms of the GNU General Public License as published by
  10 the Free Software Foundation; either version 2, or (at your option)
  11 any later version.
  12
  13 GCC is distributed in the hope that it will be useful,
  14 but WITHOUT ANY WARRANTY; without even the implied warranty of
  15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  16 GNU General Public License for more details.
  17
  18 You should have received a copy of the GNU General Public License
  19 along with GCC; see the file COPYING.  If not, write to
  20 the Free Software Foundation, 59 Temple Place - Suite 330,
  21 Boston, MA 02111-1307, USA.  */
  22
  23
  24 /* Process declarations and symbol lookup for C++ front end.
  25    Also constructs types; the standard scalar types at initialization,
  26    and structure, union, array and enum types when they are declared.  */
  27
  28 /* ??? not all decl nodes are given the most useful possible
  29    line numbers.  For example, the CONST_DECLs for enum values.  */
  30
  31 #include "config.h"
  32 #include "system.h"
  33 #include "coretypes.h"
  34 #include "tm.h"
  35 #include "tree.h"
  36 #include "rtl.h"
  37 #include "expr.h"
  38 #include "flags.h"
  39 #include "cp-tree.h"
  40 #include "decl.h"
  41 #include "lex.h"
  42 #include "output.h"
  43 #include "except.h"
  44 #include "toplev.h"
  45 #include "timevar.h"
  46 #include "cpplib.h"
  47 #include "target.h"
  48 #include "c-common.h"
  49 #include "cgraph.h"
  50 #include "tree-inline.h"
  51 extern cpp_reader *parse_in;
  52
  53 /* This structure contains information about the initializations
  54    and/or destructions required for a particular priority level.  */
  55 typedef struct priority_info_s {
  56   /* Nonzero if there have been any initializations at this priority
  57      throughout the translation unit.  */
  58   int initializations_p;
  59   /* Nonzero if there have been any destructions at this priority
  60      throughout the translation unit.  */
  61   int destructions_p;
  62 } *priority_info;
  63
  64 static void mark_vtable_entries (tree);
  65 static void grok_function_init (tree, tree);
  66 static bool maybe_emit_vtables (tree);
  67 static tree build_anon_union_vars (tree);
  68 static bool acceptable_java_type (tree);
  69 static tree start_objects (int, int);
  70 static void finish_objects (int, int, tree);
  71 static tree start_static_storage_duration_function (unsigned);
  72 static void finish_static_storage_duration_function (tree);
  73 static priority_info get_priority_info (int);
  74 static void do_static_initialization (tree, tree);
  75 static void do_static_destruction (tree);
  76 static tree start_static_initialization_or_destruction (tree, int);
  77 static void finish_static_initialization_or_destruction (tree);
  78 static void generate_ctor_or_dtor_function (bool, int, location_t *);
  79 static int generate_ctor_and_dtor_functions_for_priority (splay_tree_node,
  80                                                           void *);
  81 static tree prune_vars_needing_no_initialization (tree *);
  82 static void write_out_vars (tree);
  83 static void import_export_class (tree);
  84 static tree get_guard_bits (tree);
  85
  86 /* A list of static class variables.  This is needed, because a
  87    static class variable can be declared inside the class without
  88    an initializer, and then initialized, statically, outside the class.  */
  89 static GTY(()) varray_type pending_statics;
  90 #define pending_statics_used \
  91   (pending_statics ? pending_statics->elements_used : 0)
  92
  93 /* A list of functions which were declared inline, but which we
  94    may need to emit outline anyway.  */
  95 static GTY(()) varray_type deferred_fns;
  96 #define deferred_fns_used \
  97   (deferred_fns ? deferred_fns->elements_used : 0)
  98
  99 /* Flag used when debugging spew.c */
 100
 101 extern int spew_debug;
 102
 103 /* Nonzero if we're done parsing and into end-of-file activities.  */
 104
 105 int at_eof;
 106
 107 /* Functions called along with real static constructors and destructors.  */
 108
 109 tree static_ctors;
 110 tree static_dtors;
 111
 112 \f
 113 /* Incorporate `const' and `volatile' qualifiers for member functions.
 114    FUNCTION is a TYPE_DECL or a FUNCTION_DECL.
 115    QUALS is a list of qualifiers.  Returns any explicit
 116    top-level qualifiers of the method's this pointer, anything other than
 117    TYPE_UNQUALIFIED will be an extension.  */
 118
 119 int
 120 grok_method_quals (tree ctype, tree function, tree quals)
 121 {
 122   tree fntype = TREE_TYPE (function);
 123   tree raises = TYPE_RAISES_EXCEPTIONS (fntype);
 124   int type_quals = TYPE_UNQUALIFIED;
 125   int dup_quals = TYPE_UNQUALIFIED;
 126   int this_quals = TYPE_UNQUALIFIED;
 127
 128   do
 129     {
 130       int tq = cp_type_qual_from_rid (TREE_VALUE (quals));
 131
 132       if ((type_quals | this_quals) & tq)
 133         dup_quals |= tq;
 134       else if (tq & TYPE_QUAL_RESTRICT)
 135         this_quals |= tq;
 136       else
 137         type_quals |= tq;
 138       quals = TREE_CHAIN (quals);
 139     }
 140   while (quals);
 141
 142   if (dup_quals != TYPE_UNQUALIFIED)
 143     error ("duplicate type qualifiers in %s declaration",
 144               TREE_CODE (function) == FUNCTION_DECL
 145               ? "member function" : "type");
 146
 147   ctype = cp_build_qualified_type (ctype, type_quals);
 148   fntype = build_method_type_directly (ctype, TREE_TYPE (fntype),
 149                                        (TREE_CODE (fntype) == METHOD_TYPE
 150                                         ? TREE_CHAIN (TYPE_ARG_TYPES (fntype))
 151                                         : TYPE_ARG_TYPES (fntype)));
 152   if (raises)
 153     fntype = build_exception_variant (fntype, raises);
 154
 155   TREE_TYPE (function) = fntype;
 156   return this_quals;
 157 }
 158
 159 /* A subroutine of the parser, to handle a component list.  */
 160
 161 void
 162 grok_x_components (tree specs)
 163 {
 164   tree t;
 165
 166   specs = strip_attrs (specs);
 167
 168   check_tag_decl (specs);
 169   t = groktypename (build_tree_list (specs, NULL_TREE));
 170
 171   /* The only case where we need to do anything additional here is an
 172      anonymous union field, e.g.: `struct S { union { int i; }; };'.  */
 173   if (t == NULL_TREE || !ANON_AGGR_TYPE_P (t))
 174     return;
 175
 176   fixup_anonymous_aggr (t);
 177   finish_member_declaration (build_decl (FIELD_DECL, NULL_TREE, t));
 178 }
 179
 180 /* Build a PARM_DECL with NAME and TYPE, and set DECL_ARG_TYPE
 181    appropriately.  */
 182
 183 tree
 184 cp_build_parm_decl (tree name, tree type)
 185 {
 186   tree parm = build_decl (PARM_DECL, name, type);
 187   /* DECL_ARG_TYPE is only used by the back end and the back end never
 188      sees templates.  */
 189   if (!processing_template_decl)
 190     DECL_ARG_TYPE (parm) = type_passed_as (type);
 191   return parm;
 192 }
 193
 194 /* Returns a PARM_DECL for a parameter of the indicated TYPE, with the
 195    indicated NAME.  */
 196
 197 tree
 198 build_artificial_parm (tree name, tree type)
 199 {
 200   tree parm = cp_build_parm_decl (name, type);
 201   DECL_ARTIFICIAL (parm) = 1;
 202   /* All our artificial parms are implicitly `const'; they cannot be
 203      assigned to.  */
 204   TREE_READONLY (parm) = 1;
 205   return parm;
 206 }
 207
 208 /* Constructors for types with virtual baseclasses need an "in-charge" flag
 209    saying whether this constructor is responsible for initialization of
 210    virtual baseclasses or not.  All destructors also need this "in-charge"
 211    flag, which additionally determines whether or not the destructor should
 212    free the memory for the object.
 213
 214    This function adds the "in-charge" flag to member function FN if
 215    appropriate.  It is called from grokclassfn and tsubst.
 216    FN must be either a constructor or destructor.
 217
 218    The in-charge flag follows the 'this' parameter, and is followed by the
 219    VTT parm (if any), then the user-written parms.  */
 220
 221 void
 222 maybe_retrofit_in_chrg (tree fn)
 223 {
 224   tree basetype, arg_types, parms, parm, fntype;
 225
 226   /* If we've already add the in-charge parameter don't do it again.  */
 227   if (DECL_HAS_IN_CHARGE_PARM_P (fn))
 228     return;
 229
 230   /* When processing templates we can't know, in general, whether or
 231      not we're going to have virtual baseclasses.  */
 232   if (processing_template_decl)
 233     return;
 234
 235   /* We don't need an in-charge parameter for constructors that don't
 236      have virtual bases.  */
 237   if (DECL_CONSTRUCTOR_P (fn)
 238       && !TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (fn)))
 239     return;
 240
 241   arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
 242   basetype = TREE_TYPE (TREE_VALUE (arg_types));
 243   arg_types = TREE_CHAIN (arg_types);
 244
 245   parms = TREE_CHAIN (DECL_ARGUMENTS (fn));
 246
 247   /* If this is a subobject constructor or destructor, our caller will
 248      pass us a pointer to our VTT.  */
 249   if (TYPE_USES_VIRTUAL_BASECLASSES (DECL_CONTEXT (fn)))
 250     {
 251       parm = build_artificial_parm (vtt_parm_identifier, vtt_parm_type);
 252
 253       /* First add it to DECL_ARGUMENTS between 'this' and the real args...  */
 254       TREE_CHAIN (parm) = parms;
 255       parms = parm;
 256
 257       /* ...and then to TYPE_ARG_TYPES.  */
 258       arg_types = hash_tree_chain (vtt_parm_type, arg_types);
 259
 260       DECL_HAS_VTT_PARM_P (fn) = 1;
 261     }
 262
 263   /* Then add the in-charge parm (before the VTT parm).  */
 264   parm = build_artificial_parm (in_charge_identifier, integer_type_node);
 265   TREE_CHAIN (parm) = parms;
 266   parms = parm;
 267   arg_types = hash_tree_chain (integer_type_node, arg_types);
 268
 269   /* Insert our new parameter(s) into the list.  */
 270   TREE_CHAIN (DECL_ARGUMENTS (fn)) = parms;
 271
 272   /* And rebuild the function type.  */
 273   fntype = build_method_type_directly (basetype, TREE_TYPE (TREE_TYPE (fn)),
 274                                        arg_types);
 275   if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)))
 276     fntype = build_exception_variant (fntype,
 277                                       TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)));
 278   TREE_TYPE (fn) = fntype;
 279
 280   /* Now we've got the in-charge parameter.  */
 281   DECL_HAS_IN_CHARGE_PARM_P (fn) = 1;
 282 }
 283
 284 /* Classes overload their constituent function names automatically.
 285    When a function name is declared in a record structure,
 286    its name is changed to it overloaded name.  Since names for
 287    constructors and destructors can conflict, we place a leading
 288    '$' for destructors.
 289
 290    CNAME is the name of the class we are grokking for.
 291
 292    FUNCTION is a FUNCTION_DECL.  It was created by `grokdeclarator'.
 293
 294    FLAGS contains bits saying what's special about today's
 295    arguments.  1 == DESTRUCTOR.  2 == OPERATOR.
 296
 297    If FUNCTION is a destructor, then we must add the `auto-delete' field
 298    as a second parameter.  There is some hair associated with the fact
 299    that we must "declare" this variable in the manner consistent with the
 300    way the rest of the arguments were declared.
 301
 302    QUALS are the qualifiers for the this pointer.  */
 303
 304 void
 305 grokclassfn (tree ctype, tree function, enum overload_flags flags, tree quals)
 306 {
 307   tree fn_name = DECL_NAME (function);
 308   int this_quals = TYPE_UNQUALIFIED;
 309
 310   /* Even within an `extern "C"' block, members get C++ linkage.  See
 311      [dcl.link] for details.  */
 312   SET_DECL_LANGUAGE (function, lang_cplusplus);
 313
 314   if (fn_name == NULL_TREE)
 315     {
 316       error ("name missing for member function");
 317       fn_name = get_identifier ("<anonymous>");
 318       DECL_NAME (function) = fn_name;
 319     }
 320
 321   if (quals)
 322     this_quals = grok_method_quals (ctype, function, quals);
 323
 324   if (TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
 325     {
 326       /* Must add the class instance variable up front.  */
 327       /* Right now we just make this a pointer.  But later
 328          we may wish to make it special.  */
 329       tree type = TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (function)));
 330       tree qual_type;
 331       tree parm;
 332
 333       /* The `this' parameter is implicitly `const'; it cannot be
 334          assigned to.  */
 335       this_quals |= TYPE_QUAL_CONST;
 336       qual_type = cp_build_qualified_type (type, this_quals);
 337       parm = build_artificial_parm (this_identifier, qual_type);
 338       c_apply_type_quals_to_decl (this_quals, parm);
 339       TREE_CHAIN (parm) = last_function_parms;
 340       last_function_parms = parm;
 341     }
 342
 343   DECL_ARGUMENTS (function) = last_function_parms;
 344   DECL_CONTEXT (function) = ctype;
 345
 346   if (flags == DTOR_FLAG)
 347     DECL_DESTRUCTOR_P (function) = 1;
 348
 349   if (flags == DTOR_FLAG || DECL_CONSTRUCTOR_P (function))
 350     maybe_retrofit_in_chrg (function);
 351 }
 352
 353 /* Create an ARRAY_REF, checking for the user doing things backwards
 354    along the way.  */
 355
 356 tree
 357 grok_array_decl (tree array_expr, tree index_exp)
 358 {
 359   tree type;
 360   tree expr;
 361   tree orig_array_expr = array_expr;
 362   tree orig_index_exp = index_exp;
 363
 364   if (error_operand_p (array_expr) || error_operand_p (index_exp))
 365     return error_mark_node;
 366
 367   if (processing_template_decl)
 368     {
 369       if (type_dependent_expression_p (array_expr)
 370           || type_dependent_expression_p (index_exp))
 371         return build_min_nt (ARRAY_REF, array_expr, index_exp);
 372       array_expr = build_non_dependent_expr (array_expr);
 373       index_exp = build_non_dependent_expr (index_exp);
 374     }
 375
 376   type = TREE_TYPE (array_expr);
 377   my_friendly_assert (type, 20030626);
 378   type = non_reference (type);
 379
 380   /* If they have an `operator[]', use that.  */
 381   if (IS_AGGR_TYPE (type) || IS_AGGR_TYPE (TREE_TYPE (index_exp)))
 382     expr = build_new_op (ARRAY_REF, LOOKUP_NORMAL,
 383                          array_expr, index_exp, NULL_TREE);
 384   else
 385     {
 386       tree p1, p2, i1, i2;
 387
 388       /* Otherwise, create an ARRAY_REF for a pointer or array type.
 389          It is a little-known fact that, if `a' is an array and `i' is
 390          an int, you can write `i[a]', which means the same thing as
 391          `a[i]'.  */
 392       if (TREE_CODE (type) == ARRAY_TYPE)
 393         p1 = array_expr;
 394       else
 395         p1 = build_expr_type_conversion (WANT_POINTER, array_expr, false);
 396
 397       if (TREE_CODE (TREE_TYPE (index_exp)) == ARRAY_TYPE)
 398         p2 = index_exp;
 399       else
 400         p2 = build_expr_type_conversion (WANT_POINTER, index_exp, false);
 401
 402       i1 = build_expr_type_conversion (WANT_INT | WANT_ENUM, array_expr,
 403                                        false);
 404       i2 = build_expr_type_conversion (WANT_INT | WANT_ENUM, index_exp,
 405                                        false);
 406
 407       if ((p1 && i2) && (i1 && p2))
 408         error ("ambiguous conversion for array subscript");
 409
 410       if (p1 && i2)
 411         array_expr = p1, index_exp = i2;
 412       else if (i1 && p2)
 413         array_expr = p2, index_exp = i1;
 414       else
 415         {
 416           error ("invalid types `%T[%T]' for array subscript",
 417                     type, TREE_TYPE (index_exp));
 418           return error_mark_node;
 419         }
 420
 421       if (array_expr == error_mark_node || index_exp == error_mark_node)
 422         error ("ambiguous conversion for array subscript");
 423
 424       expr = build_array_ref (array_expr, index_exp);
 425     }
 426   if (processing_template_decl && expr != error_mark_node)
 427     return build_min_non_dep (ARRAY_REF, expr,
 428                               orig_array_expr, orig_index_exp);
 429   return expr;
 430 }
 431
 432 /* Given the cast expression EXP, checking out its validity.   Either return
 433    an error_mark_node if there was an unavoidable error, return a cast to
 434    void for trying to delete a pointer w/ the value 0, or return the
 435    call to delete.  If DOING_VEC is true, we handle things differently
 436    for doing an array delete.
 437    Implements ARM $5.3.4.  This is called from the parser.  */
 438
 439 tree
 440 delete_sanity (tree exp, tree size, bool doing_vec, int use_global_delete)
 441 {
 442   tree t, type;
 443
 444   if (exp == error_mark_node)
 445     return exp;
 446
 447   if (processing_template_decl)
 448     {
 449       t = build_min (DELETE_EXPR, void_type_node, exp, size);
 450       DELETE_EXPR_USE_GLOBAL (t) = use_global_delete;
 451       DELETE_EXPR_USE_VEC (t) = doing_vec;
 452       return t;
 453     }
 454
 455   exp = convert_from_reference (exp);
 456
 457   /* An array can't have been allocated by new, so complain.  */
 458   if (TREE_CODE (exp) == VAR_DECL
 459       && TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
 460     warning ("deleting array `%#D'", exp);
 461
 462   t = build_expr_type_conversion (WANT_POINTER, exp, true);
 463
 464   if (t == NULL_TREE || t == error_mark_node)
 465     {
 466       error ("type `%#T' argument given to `delete', expected pointer",
 467                 TREE_TYPE (exp));
 468       return error_mark_node;
 469     }
 470
 471   type = TREE_TYPE (t);
 472
 473   /* As of Valley Forge, you can delete a pointer to const.  */
 474
 475   /* You can't delete functions.  */
 476   if (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
 477     {
 478       error ("cannot delete a function.  Only pointer-to-objects are valid arguments to `delete'");
 479       return error_mark_node;
 480     }
 481
 482   /* Deleting ptr to void is undefined behavior [expr.delete/3].  */
 483   if (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE)
 484     {
 485       warning ("deleting `%T' is undefined", type);
 486       doing_vec = 0;
 487     }
 488
 489   /* Deleting a pointer with the value zero is valid and has no effect.  */
 490   if (integer_zerop (t))
 491     return build1 (NOP_EXPR, void_type_node, t);
 492
 493   if (doing_vec)
 494     return build_vec_delete (t, /*maxindex=*/NULL_TREE,
 495                              sfk_deleting_destructor,
 496                              use_global_delete);
 497   else
 498     return build_delete (type, t, sfk_deleting_destructor,
 499                          LOOKUP_NORMAL, use_global_delete);
 500 }
 501
 502 /* Report an error if the indicated template declaration is not the
 503    sort of thing that should be a member template.  */
 504
 505 void
 506 check_member_template (tree tmpl)
 507 {
 508   tree decl;
 509
 510   my_friendly_assert (TREE_CODE (tmpl) == TEMPLATE_DECL, 0);
 511   decl = DECL_TEMPLATE_RESULT (tmpl);
 512
 513   if (TREE_CODE (decl) == FUNCTION_DECL
 514       || (TREE_CODE (decl) == TYPE_DECL
 515           && IS_AGGR_TYPE (TREE_TYPE (decl))))
 516     {
 517       if (current_function_decl)
 518         /* 14.5.2.2 [temp.mem]
 519
 520            A local class shall not have member templates.  */
 521         error ("invalid declaration of member template `%#D' in local class",
 522                   decl);
 523
 524       if (TREE_CODE (decl) == FUNCTION_DECL && DECL_VIRTUAL_P (decl))
 525         {
 526           /* 14.5.2.3 [temp.mem]
 527
 528              A member function template shall not be virtual.  */
 529           error
 530             ("invalid use of `virtual' in template declaration of `%#D'",
 531              decl);
 532           DECL_VIRTUAL_P (decl) = 0;
 533         }
 534
 535       /* The debug-information generating code doesn't know what to do
 536          with member templates.  */
 537       DECL_IGNORED_P (tmpl) = 1;
 538     }
 539   else
 540     error ("template declaration of `%#D'", decl);
 541 }
 542
 543 /* Return true iff TYPE is a valid Java parameter or return type.  */
 544
 545 static bool
 546 acceptable_java_type (tree type)
 547 {
 548   if (TREE_CODE (type) == VOID_TYPE || TYPE_FOR_JAVA (type))
 549     return 1;
 550   if (TREE_CODE (type) == POINTER_TYPE || TREE_CODE (type) == REFERENCE_TYPE)
 551     {
 552       type = TREE_TYPE (type);
 553       if (TREE_CODE (type) == RECORD_TYPE)
 554         {
 555           tree args;  int i;
 556           if (! TYPE_FOR_JAVA (type))
 557             return false;
 558           if (! CLASSTYPE_TEMPLATE_INFO (type))
 559             return true;
 560           args = CLASSTYPE_TI_ARGS (type);
 561           i = TREE_VEC_LENGTH (args);
 562           while (--i >= 0)
 563             {
 564               type = TREE_VEC_ELT (args, i);
 565               if (TREE_CODE (type) == POINTER_TYPE)
 566                 type = TREE_TYPE (type);
 567               if (! TYPE_FOR_JAVA (type))
 568                 return false;
 569             }
 570           return true;
 571         }
 572     }
 573   return false;
 574 }
 575
 576 /* For a METHOD in a Java class CTYPE, return true if
 577    the parameter and return types are valid Java types.
 578    Otherwise, print appropriate error messages, and return false.  */
 579
 580 bool
 581 check_java_method (tree method)
 582 {
 583   bool jerr = false;
 584   tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (method));
 585   tree ret_type = TREE_TYPE (TREE_TYPE (method));
 586
 587   if (!acceptable_java_type (ret_type))
 588     {
 589       error ("Java method '%D' has non-Java return type `%T'",
 590                 method, ret_type);
 591       jerr = true;
 592     }
 593
 594   arg_types = TREE_CHAIN (arg_types);
 595   if (DECL_HAS_IN_CHARGE_PARM_P (method))
 596     arg_types = TREE_CHAIN (arg_types);
 597   if (DECL_HAS_VTT_PARM_P (method))
 598     arg_types = TREE_CHAIN (arg_types);
 599
 600   for (; arg_types != NULL_TREE; arg_types = TREE_CHAIN (arg_types))
 601     {
 602       tree type = TREE_VALUE (arg_types);
 603       if (!acceptable_java_type (type))
 604         {
 605           error ("Java method '%D' has non-Java parameter type `%T'",
 606                     method, type);
 607           jerr = true;
 608         }
 609     }
 610   return !jerr;
 611 }
 612
 613 /* Sanity check: report error if this function FUNCTION is not
 614    really a member of the class (CTYPE) it is supposed to belong to.
 615    CNAME is the same here as it is for grokclassfn above.
 616    TEMPLATE_HEADER_P is true when this declaration comes with a
 617    template header.  */
 618
 619 tree
 620 check_classfn (tree ctype, tree function, bool template_header_p)
 621 {
 622   int ix;
 623   int is_template;
 624
 625   if (DECL_USE_TEMPLATE (function)
 626       && !(TREE_CODE (function) == TEMPLATE_DECL
 627            && DECL_TEMPLATE_SPECIALIZATION (function))
 628       && is_member_template (DECL_TI_TEMPLATE (function)))
 629     /* Since this is a specialization of a member template,
 630        we're not going to find the declaration in the class.
 631        For example, in:
 632
 633          struct S { template <typename T> void f(T); };
 634          template <> void S::f(int);
 635
 636        we're not going to find `S::f(int)', but there's no
 637        reason we should, either.  We let our callers know we didn't
 638        find the method, but we don't complain.  */
 639     return NULL_TREE;
 640
 641   /* OK, is this a definition of a member template?  */
 642   is_template = (TREE_CODE (function) == TEMPLATE_DECL
 643                  || template_header_p);
 644
 645   ix = lookup_fnfields_1 (complete_type (ctype),
 646                           DECL_CONSTRUCTOR_P (function) ? ctor_identifier :
 647                           DECL_DESTRUCTOR_P (function) ? dtor_identifier :
 648                           DECL_NAME (function));
 649
 650   if (ix >= 0)
 651     {
 652       tree methods = CLASSTYPE_METHOD_VEC (ctype);
 653       tree fndecls, fndecl = 0;
 654       bool is_conv_op;
 655       const char *format = NULL;
 656
 657       push_scope (ctype);
 658       for (fndecls = TREE_VEC_ELT (methods, ix);
 659            fndecls; fndecls = OVL_NEXT (fndecls))
 660         {
 661           tree p1, p2;
 662
 663           fndecl = OVL_CURRENT (fndecls);
 664           p1 = TYPE_ARG_TYPES (TREE_TYPE (function));
 665           p2 = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
 666
 667           /* We cannot simply call decls_match because this doesn't
 668              work for static member functions that are pretending to
 669              be methods, and because the name may have been changed by
 670              asm("new_name").  */
 671
 672            /* Get rid of the this parameter on functions that become
 673               static.  */
 674           if (DECL_STATIC_FUNCTION_P (fndecl)
 675               && TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
 676             p1 = TREE_CHAIN (p1);
 677
 678           /* A member template definition only matches a member template
 679              declaration.  */
 680           if (is_template != (TREE_CODE (fndecl) == TEMPLATE_DECL))
 681             continue;
 682
 683           if (same_type_p (TREE_TYPE (TREE_TYPE (function)),
 684                            TREE_TYPE (TREE_TYPE (fndecl)))
 685               && compparms (p1, p2)
 686               && (DECL_TEMPLATE_SPECIALIZATION (function)
 687                   == DECL_TEMPLATE_SPECIALIZATION (fndecl))
 688               && (!DECL_TEMPLATE_SPECIALIZATION (function)
 689                   || (DECL_TI_TEMPLATE (function)
 690                       == DECL_TI_TEMPLATE (fndecl))))
 691             break;
 692         }
 693       pop_scope (ctype);
 694       if (fndecls)
 695         return OVL_CURRENT (fndecls);
 696       error ("prototype for `%#D' does not match any in class `%T'",
 697              function, ctype);
 698       is_conv_op = DECL_CONV_FN_P (fndecl);
 699
 700       if (is_conv_op)
 701         ix = CLASSTYPE_FIRST_CONVERSION_SLOT;
 702       fndecls = TREE_VEC_ELT (methods, ix);
 703       while (fndecls)
 704         {
 705           fndecl = OVL_CURRENT (fndecls);
 706           fndecls = OVL_NEXT (fndecls);
 707
 708           if (!fndecls && is_conv_op)
 709             {
 710               if (TREE_VEC_LENGTH (methods) > ix)
 711                 {
 712                   ix++;
 713                   fndecls = TREE_VEC_ELT (methods, ix);
 714                   if (!DECL_CONV_FN_P (OVL_CURRENT (fndecls)))
 715                     {
 716                       fndecls = NULL_TREE;
 717                       is_conv_op = false;
 718                     }
 719                 }
 720               else
 721                 is_conv_op = false;
 722             }
 723           if (format)
 724             format = "                %#D";
 725           else if (fndecls)
 726             format = "candidates are: %#D";
 727           else
 728             format = "candidate is: %#D";
 729           cp_error_at (format, fndecl);
 730         }
 731     }
 732   else if (!COMPLETE_TYPE_P (ctype))
 733     cxx_incomplete_type_error (function, ctype);
 734   else
 735     error ("no `%#D' member function declared in class `%T'",
 736            function, ctype);
 737
 738   /* If we did not find the method in the class, add it to avoid
 739      spurious errors (unless the CTYPE is not yet defined, in which
 740      case we'll only confuse ourselves when the function is declared
 741      properly within the class.  */
 742   if (COMPLETE_TYPE_P (ctype))
 743     add_method (ctype, function, /*error_p=*/1);
 744   return NULL_TREE;
 745 }
 746
 747 /* We have just processed the DECL, which is a static data member.
 748    Its initializer, if present, is INIT.  The ASMSPEC_TREE, if
 749    present, is the assembly-language name for the data member.
 750    FLAGS is as for cp_finish_decl.  */
 751
 752 void
 753 finish_static_data_member_decl (tree decl, tree init, tree asmspec_tree,
 754                                 int flags)
 755 {
 756   my_friendly_assert (TREE_PUBLIC (decl), 0);
 757
 758   DECL_CONTEXT (decl) = current_class_type;
 759
 760   /* We cannot call pushdecl here, because that would fill in the
 761      TREE_CHAIN of our decl.  Instead, we modify cp_finish_decl to do
 762      the right thing, namely, to put this decl out straight away.  */
 763   /* current_class_type can be NULL_TREE in case of error.  */
 764   if (!asmspec_tree && current_class_type)
 765     DECL_INITIAL (decl) = error_mark_node;
 766
 767   if (! processing_template_decl)
 768     {
 769       if (!pending_statics)
 770         VARRAY_TREE_INIT (pending_statics, 32, "pending_statics");
 771       VARRAY_PUSH_TREE (pending_statics, decl);
 772     }
 773
 774   if (LOCAL_CLASS_P (current_class_type))
 775     pedwarn ("local class `%#T' shall not have static data member `%#D'",
 776              current_class_type, decl);
 777
 778   /* Static consts need not be initialized in the class definition.  */
 779   if (init != NULL_TREE && TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
 780     {
 781       static int explained = 0;
 782
 783       error ("initializer invalid for static member with constructor");
 784       if (!explained)
 785         {
 786           error ("(an out of class initialization is required)");
 787           explained = 1;
 788         }
 789       init = NULL_TREE;
 790     }
 791   /* Force the compiler to know when an uninitialized static const
 792      member is being used.  */
 793   if (CP_TYPE_CONST_P (TREE_TYPE (decl)) && init == 0)
 794     TREE_USED (decl) = 1;
 795   DECL_INITIAL (decl) = init;
 796   DECL_IN_AGGR_P (decl) = 1;
 797
 798   cp_finish_decl (decl, init, asmspec_tree, flags);
 799 }
 800
 801 /* Process the specs, declarator (NULL if omitted) and width (NULL if omitted)
 802    of a structure component, returning a _DECL node.
 803    QUALS is a list of type qualifiers for this decl (such as for declaring
 804    const member functions).
 805
 806    This is done during the parsing of the struct declaration.
 807    The _DECL nodes are chained together and the lot of them
 808    are ultimately passed to `build_struct' to make the RECORD_TYPE node.
 809
 810    If class A defines that certain functions in class B are friends, then
 811    the way I have set things up, it is B who is interested in permission
 812    granted by A.  However, it is in A's context that these declarations
 813    are parsed.  By returning a void_type_node, class A does not attempt
 814    to incorporate the declarations of the friends within its structure.
 815
 816    DO NOT MAKE ANY CHANGES TO THIS CODE WITHOUT MAKING CORRESPONDING
 817    CHANGES TO CODE IN `start_method'.  */
 818
 819 tree
 820 grokfield (tree declarator, tree declspecs, tree init, tree asmspec_tree,
 821            tree attrlist)
 822 {
 823   tree value;
 824   const char *asmspec = 0;
 825   int flags = LOOKUP_ONLYCONVERTING;
 826
 827   if (declspecs == NULL_TREE
 828       && TREE_CODE (declarator) == SCOPE_REF
 829       && TREE_CODE (TREE_OPERAND (declarator, 1)) == IDENTIFIER_NODE)
 830     {
 831       /* Access declaration */
 832       if (! IS_AGGR_TYPE_CODE (TREE_CODE (TREE_OPERAND (declarator, 0))))
 833         ;
 834       else if (TREE_COMPLEXITY (declarator) == current_class_depth)
 835         pop_nested_class ();
 836       return do_class_using_decl (declarator);
 837     }
 838
 839   if (init
 840       && TREE_CODE (init) == TREE_LIST
 841       && TREE_VALUE (init) == error_mark_node
 842       && TREE_CHAIN (init) == NULL_TREE)
 843     init = NULL_TREE;
 844
 845   value = grokdeclarator (declarator, declspecs, FIELD, init != 0, &attrlist);
 846   if (! value || error_operand_p (value))
 847     /* friend or constructor went bad.  */
 848     return error_mark_node;
 849
 850   if (TREE_CODE (value) == TYPE_DECL && init)
 851     {
 852       error ("typedef `%D' is initialized (use __typeof__ instead)", value);
 853       init = NULL_TREE;
 854     }
 855
 856   /* Pass friendly classes back.  */
 857   if (value == void_type_node)
 858     return value;
 859
 860   /* Pass friend decls back.  */
 861   if ((TREE_CODE (value) == FUNCTION_DECL
 862        || TREE_CODE (value) == TEMPLATE_DECL)
 863       && DECL_CONTEXT (value) != current_class_type)
 864     return value;
 865
 866   if (DECL_NAME (value) != NULL_TREE
 867       && IDENTIFIER_POINTER (DECL_NAME (value))[0] == '_'
 868       && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value)), "_vptr"))
 869     error ("member `%D' conflicts with virtual function table field name",
 870               value);
 871
 872   /* Stash away type declarations.  */
 873   if (TREE_CODE (value) == TYPE_DECL)
 874     {
 875       DECL_NONLOCAL (value) = 1;
 876       DECL_CONTEXT (value) = current_class_type;
 877
 878       if (processing_template_decl)
 879         value = push_template_decl (value);
 880
 881       return value;
 882     }
 883
 884   if (DECL_IN_AGGR_P (value))
 885     {
 886       error ("`%D' is already defined in `%T'", value,
 887                 DECL_CONTEXT (value));
 888       return void_type_node;
 889     }
 890
 891   if (asmspec_tree)
 892     asmspec = TREE_STRING_POINTER (asmspec_tree);
 893
 894   if (init)
 895     {
 896       if (TREE_CODE (value) == FUNCTION_DECL)
 897         {
 898           grok_function_init (value, init);
 899           init = NULL_TREE;
 900         }
 901       else if (pedantic && TREE_CODE (value) != VAR_DECL)
 902         /* Already complained in grokdeclarator.  */
 903         init = NULL_TREE;
 904       else
 905         {
 906           /* We allow initializers to become parameters to base
 907              initializers.  */
 908           if (TREE_CODE (init) == TREE_LIST)
 909             {
 910               if (TREE_CHAIN (init) == NULL_TREE)
 911                 init = TREE_VALUE (init);
 912               else
 913                 init = digest_init (TREE_TYPE (value), init, (tree *)0);
 914             }
 915
 916           if (!processing_template_decl)
 917             {
 918               if (TREE_CODE (init) == CONST_DECL)
 919                 init = DECL_INITIAL (init);
 920               else if (TREE_READONLY_DECL_P (init))
 921                 init = decl_constant_value (init);
 922               else if (TREE_CODE (init) == CONSTRUCTOR)
 923                 init = digest_init (TREE_TYPE (value), init, (tree *)0);
 924               if (init != error_mark_node && ! TREE_CONSTANT (init))
 925                 {
 926                   /* We can allow references to things that are effectively
 927                      static, since references are initialized with the
 928                      address.  */
 929                   if (TREE_CODE (TREE_TYPE (value)) != REFERENCE_TYPE
 930                       || (TREE_STATIC (init) == 0
 931                           && (!DECL_P (init) || DECL_EXTERNAL (init) == 0)))
 932                     {
 933                       error ("field initializer is not constant");
 934                       init = error_mark_node;
 935                     }
 936                 }
 937             }
 938         }
 939     }
 940
 941   if (processing_template_decl
 942       && (TREE_CODE (value) == VAR_DECL || TREE_CODE (value) == FUNCTION_DECL))
 943     {
 944       value = push_template_decl (value);
 945       if (error_operand_p (value))
 946         return error_mark_node;
 947     }
 948
 949   if (attrlist)
 950     cplus_decl_attributes (&value, attrlist, 0);
 951
 952   if (TREE_CODE (value) == VAR_DECL)
 953     {
 954       finish_static_data_member_decl (value, init, asmspec_tree,
 955                                       flags);
 956       return value;
 957     }
 958   if (TREE_CODE (value) == FIELD_DECL)
 959     {
 960       if (asmspec)
 961         error ("`asm' specifiers are not permitted on non-static data members");
 962       if (DECL_INITIAL (value) == error_mark_node)
 963         init = error_mark_node;
 964       cp_finish_decl (value, init, NULL_TREE, flags);
 965       DECL_INITIAL (value) = init;
 966       DECL_IN_AGGR_P (value) = 1;
 967       return value;
 968     }
 969   if (TREE_CODE (value) == FUNCTION_DECL)
 970     {
 971       if (asmspec)
 972         {
 973           /* This must override the asm specifier which was placed
 974              by grokclassfn.  Lay this out fresh.  */
 975           SET_DECL_RTL (value, NULL_RTX);
 976           change_decl_assembler_name (value, get_identifier (asmspec));
 977         }
 978       if (!DECL_FRIEND_P (value))
 979         grok_special_member_properties (value);
 980
 981       cp_finish_decl (value, init, asmspec_tree, flags);
 982
 983       /* Pass friends back this way.  */
 984       if (DECL_FRIEND_P (value))
 985         return void_type_node;
 986
 987       DECL_IN_AGGR_P (value) = 1;
 988       return value;
 989     }
 990   abort ();
 991   /* NOTREACHED */
 992   return NULL_TREE;
 993 }
 994
 995 /* Like `grokfield', but for bitfields.
 996    WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node.  */
 997
 998 tree
 999 grokbitfield (tree declarator, tree declspecs, tree width)
1000 {
1001   tree value = grokdeclarator (declarator, declspecs, BITFIELD, 0, NULL);
1002
1003   if (! value) return NULL_TREE; /* friends went bad.  */
1004
1005   /* Pass friendly classes back.  */
1006   if (TREE_CODE (value) == VOID_TYPE)
1007     return void_type_node;
1008
1009   if (TREE_CODE (value) == TYPE_DECL)
1010     {
1011       error ("cannot declare `%D' to be a bit-field type", value);
1012       return NULL_TREE;
1013     }
1014
1015   /* Usually, finish_struct_1 catches bitfields with invalid types.
1016      But, in the case of bitfields with function type, we confuse
1017      ourselves into thinking they are member functions, so we must
1018      check here.  */
1019   if (TREE_CODE (value) == FUNCTION_DECL)
1020     {
1021       error ("cannot declare bit-field `%D' with function type",
1022              DECL_NAME (value));
1023       return NULL_TREE;
1024     }
1025
1026   if (DECL_IN_AGGR_P (value))
1027     {
1028       error ("`%D' is already defined in the class %T", value,
1029                   DECL_CONTEXT (value));
1030       return void_type_node;
1031     }
1032
1033   if (TREE_STATIC (value))
1034     {
1035       error ("static member `%D' cannot be a bit-field", value);
1036       return NULL_TREE;
1037     }
1038   cp_finish_decl (value, NULL_TREE, NULL_TREE, 0);
1039
1040   if (width != error_mark_node)
1041     {
1042       constant_expression_warning (width);
1043       DECL_INITIAL (value) = width;
1044       SET_DECL_C_BIT_FIELD (value);
1045     }
1046
1047   DECL_IN_AGGR_P (value) = 1;
1048   return value;
1049 }
1050
1051 /* When a function is declared with an initializer,
1052    do the right thing.  Currently, there are two possibilities:
1053
1054    class B
1055    {
1056     public:
1057      // initialization possibility #1.
1058      virtual void f () = 0;
1059      int g ();
1060    };
1061
1062    class D1 : B
1063    {
1064     public:
1065      int d1;
1066      // error, no f ();
1067    };
1068
1069    class D2 : B
1070    {
1071     public:
1072      int d2;
1073      void f ();
1074    };
1075
1076    class D3 : B
1077    {
1078     public:
1079      int d3;
1080      // initialization possibility #2
1081      void f () = B::f;
1082    };
1083
1084 */
1085
1086 static void
1087 grok_function_init (tree decl, tree init)
1088 {
1089   /* An initializer for a function tells how this function should
1090      be inherited.  */
1091   tree type = TREE_TYPE (decl);
1092
1093   if (TREE_CODE (type) == FUNCTION_TYPE)
1094     error ("initializer specified for non-member function `%D'", decl);
1095   else if (integer_zerop (init))
1096     DECL_PURE_VIRTUAL_P (decl) = 1;
1097   else
1098     error ("invalid initializer for virtual method `%D'", decl);
1099 }
1100 \f
1101 void
1102 cplus_decl_attributes (tree *decl, tree attributes, int flags)
1103 {
1104   if (*decl == NULL_TREE || *decl == void_type_node)
1105     return;
1106
1107   if (TREE_CODE (*decl) == TEMPLATE_DECL)
1108     decl = &DECL_TEMPLATE_RESULT (*decl);
1109
1110   decl_attributes (decl, attributes, flags);
1111
1112   if (TREE_CODE (*decl) == TYPE_DECL)
1113     SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (*decl), TREE_TYPE (*decl));
1114 }
1115 \f
1116 /* Defer the compilation of the FN until the end of compilation.  */
1117
1118 void
1119 defer_fn (tree fn)
1120 {
1121   if (DECL_DEFERRED_FN (fn))
1122     return;
1123   DECL_DEFERRED_FN (fn) = 1;
1124   DECL_DEFER_OUTPUT (fn) = 1;
1125   if (!deferred_fns)
1126     VARRAY_TREE_INIT (deferred_fns, 32, "deferred_fns");
1127
1128   VARRAY_PUSH_TREE (deferred_fns, fn);
1129 }
1130
1131 /* Walks through the namespace- or function-scope anonymous union OBJECT,
1132    building appropriate ALIAS_DECLs.  Returns one of the fields for use in
1133    the mangled name.  */
1134
1135 static tree
1136 build_anon_union_vars (tree object)
1137 {
1138   tree type = TREE_TYPE (object);
1139   tree main_decl = NULL_TREE;
1140   tree field;
1141
1142   /* Rather than write the code to handle the non-union case,
1143      just give an error.  */
1144   if (TREE_CODE (type) != UNION_TYPE)
1145     error ("anonymous struct not inside named type");
1146
1147   for (field = TYPE_FIELDS (type);
1148        field != NULL_TREE;
1149        field = TREE_CHAIN (field))
1150     {
1151       tree decl;
1152       tree ref;
1153
1154       if (DECL_ARTIFICIAL (field))
1155         continue;
1156       if (TREE_CODE (field) != FIELD_DECL)
1157         {
1158           cp_pedwarn_at ("\
1159 `%#D' invalid; an anonymous union can only have non-static data members",
1160                          field);
1161           continue;
1162         }
1163
1164       if (TREE_PRIVATE (field))
1165         cp_pedwarn_at ("private member `%#D' in anonymous union", field);
1166       else if (TREE_PROTECTED (field))
1167         cp_pedwarn_at ("protected member `%#D' in anonymous union", field);
1168
1169       if (processing_template_decl)
1170         ref = build_min_nt (COMPONENT_REF, object, DECL_NAME (field));
1171       else
1172         ref = build_class_member_access_expr (object, field, NULL_TREE,
1173                                               false);
1174
1175       if (DECL_NAME (field))
1176         {
1177           decl = build_decl (ALIAS_DECL, DECL_NAME (field), TREE_TYPE (field));
1178           DECL_INITIAL (decl) = ref;
1179           TREE_PUBLIC (decl) = 0;
1180           TREE_STATIC (decl) = 0;
1181           DECL_EXTERNAL (decl) = 1;
1182           decl = pushdecl (decl);
1183         }
1184       else if (ANON_AGGR_TYPE_P (TREE_TYPE (field)))
1185         decl = build_anon_union_vars (ref);
1186       else
1187         decl = 0;
1188
1189       if (main_decl == NULL_TREE)
1190         main_decl = decl;
1191     }
1192
1193   return main_decl;
1194 }
1195
1196 /* Finish off the processing of a UNION_TYPE structure.  If the union is an
1197    anonymous union, then all members must be laid out together.  PUBLIC_P
1198    is nonzero if this union is not declared static.  */
1199
1200 void
1201 finish_anon_union (tree anon_union_decl)
1202 {
1203   tree type = TREE_TYPE (anon_union_decl);
1204   tree main_decl;
1205   bool public_p = TREE_PUBLIC (anon_union_decl);
1206
1207   /* The VAR_DECL's context is the same as the TYPE's context.  */
1208   DECL_CONTEXT (anon_union_decl) = DECL_CONTEXT (TYPE_NAME (type));
1209
1210   if (TYPE_FIELDS (type) == NULL_TREE)
1211     return;
1212
1213   if (public_p)
1214     {
1215       error ("namespace-scope anonymous aggregates must be static");
1216       return;
1217     }
1218
1219   main_decl = build_anon_union_vars (anon_union_decl);
1220   if (main_decl == NULL_TREE)
1221     {
1222       warning ("anonymous union with no members");
1223       return;
1224     }
1225
1226   if (!processing_template_decl)
1227     {
1228       /* Use main_decl to set the mangled name.  */
1229       DECL_NAME (anon_union_decl) = DECL_NAME (main_decl);
1230       mangle_decl (anon_union_decl);
1231       DECL_NAME (anon_union_decl) = NULL_TREE;
1232     }
1233
1234   pushdecl (anon_union_decl);
1235   if (building_stmt_tree ()
1236       && at_function_scope_p ())
1237     add_decl_stmt (anon_union_decl);
1238   else if (!processing_template_decl)
1239     rest_of_decl_compilation (anon_union_decl, NULL,
1240                               toplevel_bindings_p (), at_eof);
1241 }
1242 \f
1243 /* Auxiliary functions to make type signatures for
1244    `operator new' and `operator delete' correspond to
1245    what compiler will be expecting.  */
1246
1247 tree
1248 coerce_new_type (tree type)
1249 {
1250   int e = 0;
1251   tree args = TYPE_ARG_TYPES (type);
1252
1253   my_friendly_assert (TREE_CODE (type) == FUNCTION_TYPE, 20001107);
1254
1255   if (!same_type_p (TREE_TYPE (type), ptr_type_node))
1256     e = 1, error ("`operator new' must return type `%T'", ptr_type_node);
1257
1258   if (!args || args == void_list_node
1259       || !same_type_p (TREE_VALUE (args), size_type_node))
1260     {
1261       e = 2;
1262       if (args && args != void_list_node)
1263         args = TREE_CHAIN (args);
1264       pedwarn ("`operator new' takes type `size_t' (`%T') as first parameter", size_type_node);
1265     }
1266   switch (e)
1267   {
1268     case 2:
1269       args = tree_cons (NULL_TREE, size_type_node, args);
1270       /* Fall through.  */
1271     case 1:
1272       type = build_exception_variant
1273               (build_function_type (ptr_type_node, args),
1274                TYPE_RAISES_EXCEPTIONS (type));
1275       /* Fall through.  */
1276     default:;
1277   }
1278   return type;
1279 }
1280
1281 tree
1282 coerce_delete_type (tree type)
1283 {
1284   int e = 0;
1285   tree args = TYPE_ARG_TYPES (type);
1286
1287   my_friendly_assert (TREE_CODE (type) == FUNCTION_TYPE, 20001107);
1288
1289   if (!same_type_p (TREE_TYPE (type), void_type_node))
1290     e = 1, error ("`operator delete' must return type `%T'", void_type_node);
1291
1292   if (!args || args == void_list_node
1293       || !same_type_p (TREE_VALUE (args), ptr_type_node))
1294     {
1295       e = 2;
1296       if (args && args != void_list_node)
1297         args = TREE_CHAIN (args);
1298       error ("`operator delete' takes type `%T' as first parameter", ptr_type_node);
1299     }
1300   switch (e)
1301   {
1302     case 2:
1303       args = tree_cons (NULL_TREE, ptr_type_node, args);
1304       /* Fall through.  */
1305     case 1:
1306       type = build_exception_variant
1307               (build_function_type (void_type_node, args),
1308                TYPE_RAISES_EXCEPTIONS (type));
1309       /* Fall through.  */
1310     default:;
1311   }
1312
1313   return type;
1314 }
1315 \f
1316 static void
1317 mark_vtable_entries (tree decl)
1318 {
1319   tree entries = CONSTRUCTOR_ELTS (DECL_INITIAL (decl));
1320
1321   for (; entries; entries = TREE_CHAIN (entries))
1322     {
1323       tree fnaddr = TREE_VALUE (entries);
1324       tree fn;
1325
1326       STRIP_NOPS (fnaddr);
1327
1328       if (TREE_CODE (fnaddr) != ADDR_EXPR
1329           && TREE_CODE (fnaddr) != FDESC_EXPR)
1330         /* This entry is an offset: a virtual base class offset, a
1331            virtual call offset, an RTTI offset, etc.  */
1332         continue;
1333
1334       fn = TREE_OPERAND (fnaddr, 0);
1335       TREE_ADDRESSABLE (fn) = 1;
1336       /* When we don't have vcall offsets, we output thunks whenever
1337          we output the vtables that contain them.  With vcall offsets,
1338          we know all the thunks we'll need when we emit a virtual
1339          function, so we emit the thunks there instead.  */
1340       if (DECL_THUNK_P (fn))
1341         use_thunk (fn, /*emit_p=*/0);
1342       mark_used (fn);
1343     }
1344 }
1345
1346 /* Set DECL up to have the closest approximation of "initialized common"
1347    linkage available.  */
1348
1349 void
1350 comdat_linkage (tree decl)
1351 {
1352   if (flag_weak)
1353     make_decl_one_only (decl);
1354   else if (TREE_CODE (decl) == FUNCTION_DECL
1355            || (TREE_CODE (decl) == VAR_DECL && DECL_ARTIFICIAL (decl)))
1356     /* We can just emit function and compiler-generated variables
1357        statically; having multiple copies is (for the most part) only
1358        a waste of space.
1359
1360        There are two correctness issues, however: the address of a
1361        template instantiation with external linkage should be the
1362        same, independent of what translation unit asks for the
1363        address, and this will not hold when we emit multiple copies of
1364        the function.  However, there's little else we can do.
1365
1366        Also, by default, the typeinfo implementation assumes that
1367        there will be only one copy of the string used as the name for
1368        each type.  Therefore, if weak symbols are unavailable, the
1369        run-time library should perform a more conservative check; it
1370        should perform a string comparison, rather than an address
1371        comparison.  */
1372     TREE_PUBLIC (decl) = 0;
1373   else
1374     {
1375       /* Static data member template instantiations, however, cannot
1376          have multiple copies.  */
1377       if (DECL_INITIAL (decl) == 0
1378           || DECL_INITIAL (decl) == error_mark_node)
1379         DECL_COMMON (decl) = 1;
1380       else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
1381         {
1382           DECL_COMMON (decl) = 1;
1383           DECL_INITIAL (decl) = error_mark_node;
1384         }
1385       else if (!DECL_EXPLICIT_INSTANTIATION (decl))
1386         {
1387           /* We can't do anything useful; leave vars for explicit
1388              instantiation.  */
1389           DECL_EXTERNAL (decl) = 1;
1390           DECL_NOT_REALLY_EXTERN (decl) = 0;
1391         }
1392     }
1393
1394   if (DECL_LANG_SPECIFIC (decl))
1395     DECL_COMDAT (decl) = 1;
1396 }
1397
1398 /* For win32 we also want to put explicit instantiations in
1399    linkonce sections, so that they will be merged with implicit
1400    instantiations; otherwise we get duplicate symbol errors.  */
1401
1402 void
1403 maybe_make_one_only (tree decl)
1404 {
1405   /* We used to say that this was not necessary on targets that support weak
1406      symbols, because the implicit instantiations will defer to the explicit
1407      one.  However, that's not actually the case in SVR4; a strong definition
1408      after a weak one is an error.  Also, not making explicit
1409      instantiations one_only means that we can end up with two copies of
1410      some template instantiations.  */
1411   if (! flag_weak)
1412     return;
1413
1414   /* We can't set DECL_COMDAT on functions, or finish_file will think
1415      we can get away with not emitting them if they aren't used.  We need
1416      to for variables so that cp_finish_decl will update their linkage,
1417      because their DECL_INITIAL may not have been set properly yet.  */
1418
1419   make_decl_one_only (decl);
1420
1421   if (TREE_CODE (decl) == VAR_DECL)
1422     {
1423       DECL_COMDAT (decl) = 1;
1424       /* Mark it needed so we don't forget to emit it.  */
1425       mark_referenced (DECL_ASSEMBLER_NAME (decl));
1426     }
1427 }
1428
1429 /* Set TREE_PUBLIC and/or DECL_EXTERN on the vtable DECL,
1430    based on TYPE and other static flags.
1431
1432    Note that anything public is tagged TREE_PUBLIC, whether
1433    it's public in this file or in another one.  */
1434
1435 void
1436 import_export_vtable (tree decl, tree type, int final)
1437 {
1438   if (DECL_INTERFACE_KNOWN (decl))
1439     return;
1440
1441   if (TYPE_FOR_JAVA (type))
1442     {
1443       TREE_PUBLIC (decl) = 1;
1444       DECL_EXTERNAL (decl) = 1;
1445       DECL_INTERFACE_KNOWN (decl) = 1;
1446     }
1447   else if (CLASSTYPE_INTERFACE_KNOWN (type))
1448     {
1449       TREE_PUBLIC (decl) = 1;
1450       DECL_EXTERNAL (decl) = CLASSTYPE_INTERFACE_ONLY (type);
1451       DECL_INTERFACE_KNOWN (decl) = 1;
1452     }
1453   else
1454     {
1455       /* We can only wait to decide if we have real non-inline virtual
1456          functions in our class, or if we come from a template.  */
1457
1458       int found = (CLASSTYPE_TEMPLATE_INSTANTIATION (type)
1459                    || CLASSTYPE_KEY_METHOD (type) != NULL_TREE);
1460
1461       if (final || ! found)
1462         {
1463           comdat_linkage (decl);
1464           DECL_EXTERNAL (decl) = 0;
1465         }
1466       else
1467         {
1468           TREE_PUBLIC (decl) = 1;
1469           DECL_EXTERNAL (decl) = 1;
1470         }
1471     }
1472 }
1473
1474 /* Determine whether or not we want to specifically import or export CTYPE,
1475    using various heuristics.  */
1476
1477 static void
1478 import_export_class (tree ctype)
1479 {
1480   /* -1 for imported, 1 for exported.  */
1481   int import_export = 0;
1482
1483   /* It only makes sense to call this function at EOF.  The reason is
1484      that this function looks at whether or not the first non-inline
1485      non-abstract virtual member function has been defined in this
1486      translation unit.  But, we can't possibly know that until we've
1487      seen the entire translation unit.  */
1488   my_friendly_assert (at_eof, 20000226);
1489
1490   if (CLASSTYPE_INTERFACE_KNOWN (ctype))
1491     return;
1492
1493   /* If MULTIPLE_SYMBOL_SPACES is defined and we saw a #pragma interface,
1494      we will have CLASSTYPE_INTERFACE_ONLY set but not
1495      CLASSTYPE_INTERFACE_KNOWN.  In that case, we don't want to use this
1496      heuristic because someone will supply a #pragma implementation
1497      elsewhere, and deducing it here would produce a conflict.  */
1498   if (CLASSTYPE_INTERFACE_ONLY (ctype))
1499     return;
1500
1501   if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype)))
1502     import_export = -1;
1503   else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype)))
1504     import_export = 1;
1505
1506   /* If we got -fno-implicit-templates, we import template classes that
1507      weren't explicitly instantiated.  */
1508   if (import_export == 0
1509       && CLASSTYPE_IMPLICIT_INSTANTIATION (ctype)
1510       && ! flag_implicit_templates)
1511     import_export = -1;
1512
1513   /* Base our import/export status on that of the first non-inline,
1514      non-pure virtual function, if any.  */
1515   if (import_export == 0
1516       && TYPE_POLYMORPHIC_P (ctype))
1517     {
1518       tree method = CLASSTYPE_KEY_METHOD (ctype);
1519       if (method)
1520         import_export = (DECL_REALLY_EXTERN (method) ? -1 : 1);
1521     }
1522
1523 #ifdef MULTIPLE_SYMBOL_SPACES
1524   if (import_export == -1)
1525     import_export = 0;
1526 #endif
1527
1528   if (import_export)
1529     {
1530       SET_CLASSTYPE_INTERFACE_KNOWN (ctype);
1531       CLASSTYPE_INTERFACE_ONLY (ctype) = (import_export < 0);
1532     }
1533 }
1534
1535 /* Return true if VAR has already been provided to the back end; in that
1536    case VAR should not be modified further by the front end.  */
1537 static bool
1538 var_finalized_p (tree var)
1539 {
1540   if (flag_unit_at_a_time)
1541     return cgraph_varpool_node (var)->finalized;
1542   else
1543     return TREE_ASM_WRITTEN (var);
1544 }
1545
1546 /* If necessary, write out the vtables for the dynamic class CTYPE.
1547    Returns true if any vtables were emitted.  */
1548
1549 static bool
1550 maybe_emit_vtables (tree ctype)
1551 {
1552   tree vtbl;
1553   tree primary_vtbl;
1554   bool needed = false;
1555
1556   /* If the vtables for this class have already been emitted there is
1557      nothing more to do.  */
1558   primary_vtbl = CLASSTYPE_VTABLES (ctype);
1559   if (var_finalized_p (primary_vtbl))
1560     return false;
1561   /* Ignore dummy vtables made by get_vtable_decl.  */
1562   if (TREE_TYPE (primary_vtbl) == void_type_node)
1563     return false;
1564
1565   import_export_class (ctype);
1566   import_export_vtable (primary_vtbl, ctype, 1);
1567
1568   /* See if any of the vtables are needed.  */
1569   for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = TREE_CHAIN (vtbl))
1570     if (!DECL_EXTERNAL (vtbl) && DECL_NEEDED_P (vtbl))
1571       break;
1572   if (!vtbl)
1573     {
1574       /* If the references to this class' vtables are optimized away,
1575          still emit the appropriate debugging information.  See
1576          dfs_debug_mark.  */
1577       if (DECL_COMDAT (primary_vtbl)
1578           && CLASSTYPE_DEBUG_REQUESTED (ctype))
1579         note_debug_info_needed (ctype);
1580       return false;
1581     }
1582   else if (TREE_PUBLIC (vtbl) && !DECL_COMDAT (vtbl))
1583     needed = true;
1584
1585
1586   /* The ABI requires that we emit all of the vtables if we emit any
1587      of them.  */
1588   for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = TREE_CHAIN (vtbl))
1589     {
1590       /* Write it out.  */
1591       import_export_vtable (vtbl, ctype, 1);
1592       mark_vtable_entries (vtbl);
1593
1594       /* If we know that DECL is needed, mark it as such for the varpool.  */
1595       if (needed)
1596         cgraph_varpool_mark_needed_node (cgraph_varpool_node (vtbl));
1597
1598       if (TREE_TYPE (DECL_INITIAL (vtbl)) == 0)
1599         {
1600           /* It had better be all done at compile-time.  */
1601           if (store_init_value (vtbl, DECL_INITIAL (vtbl)))
1602             abort ();
1603         }
1604
1605       if (write_symbols == DWARF_DEBUG || write_symbols == DWARF2_DEBUG)
1606         {
1607           /* Mark the VAR_DECL node representing the vtable itself as a
1608              "gratuitous" one, thereby forcing dwarfout.c to ignore it.
1609              It is rather important that such things be ignored because
1610              any effort to actually generate DWARF for them will run
1611              into trouble when/if we encounter code like:
1612
1613                 #pragma interface
1614                 struct S { virtual void member (); };
1615
1616               because the artificial declaration of the vtable itself (as
1617               manufactured by the g++ front end) will say that the vtable
1618               is a static member of `S' but only *after* the debug output
1619               for the definition of `S' has already been output.  This causes
1620               grief because the DWARF entry for the definition of the vtable
1621               will try to refer back to an earlier *declaration* of the
1622               vtable as a static member of `S' and there won't be one.
1623               We might be able to arrange to have the "vtable static member"
1624               attached to the member list for `S' before the debug info for
1625               `S' get written (which would solve the problem) but that would
1626               require more intrusive changes to the g++ front end.  */
1627
1628           DECL_IGNORED_P (vtbl) = 1;
1629         }
1630
1631       /* Always make vtables weak.  */
1632       if (flag_weak)
1633         comdat_linkage (vtbl);
1634
1635       rest_of_decl_compilation (vtbl, NULL, 1, 1);
1636
1637       /* Because we're only doing syntax-checking, we'll never end up
1638          actually marking the variable as written.  */
1639       if (flag_syntax_only)
1640         TREE_ASM_WRITTEN (vtbl) = 1;
1641     }
1642
1643   /* Since we're writing out the vtable here, also write the debug
1644      info.  */
1645   note_debug_info_needed (ctype);
1646
1647   return true;
1648 }
1649
1650 /* Determines the proper settings of TREE_PUBLIC and DECL_EXTERNAL for an
1651    inline function or template instantiation at end-of-file.  */
1652
1653 void
1654 import_export_decl (tree decl)
1655 {
1656   if (DECL_INTERFACE_KNOWN (decl))
1657     return;
1658
1659   if (DECL_TEMPLATE_INSTANTIATION (decl)
1660       || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
1661     {
1662       DECL_NOT_REALLY_EXTERN (decl) = 1;
1663       if ((DECL_IMPLICIT_INSTANTIATION (decl)
1664            || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
1665           && (flag_implicit_templates
1666               || (flag_implicit_inline_templates
1667                   && TREE_CODE (decl) == FUNCTION_DECL
1668                   && DECL_DECLARED_INLINE_P (decl))))
1669         {
1670           if (!TREE_PUBLIC (decl))
1671             /* Templates are allowed to have internal linkage.  See
1672                [basic.link].  */
1673             ;
1674           else
1675             comdat_linkage (decl);
1676         }
1677       else
1678         {
1679           DECL_EXTERNAL (decl) = 1;
1680           DECL_NOT_REALLY_EXTERN (decl) = 0;
1681         }
1682     }
1683   else if (DECL_FUNCTION_MEMBER_P (decl))
1684     {
1685       if (!DECL_DECLARED_INLINE_P (decl))
1686         {
1687           tree ctype = DECL_CONTEXT (decl);
1688           import_export_class (ctype);
1689           if (CLASSTYPE_INTERFACE_KNOWN (ctype))
1690             {
1691               DECL_NOT_REALLY_EXTERN (decl)
1692                 = ! (CLASSTYPE_INTERFACE_ONLY (ctype)
1693                      || (DECL_DECLARED_INLINE_P (decl)
1694                          && ! flag_implement_inlines
1695                          && !DECL_VINDEX (decl)));
1696
1697               if (!DECL_NOT_REALLY_EXTERN (decl))
1698                 DECL_EXTERNAL (decl) = 1;
1699
1700               /* Always make artificials weak.  */
1701               if (DECL_ARTIFICIAL (decl) && flag_weak)
1702                 comdat_linkage (decl);
1703               else
1704                 maybe_make_one_only (decl);
1705             }
1706         }
1707       else
1708         comdat_linkage (decl);
1709     }
1710   else
1711     comdat_linkage (decl);
1712
1713   DECL_INTERFACE_KNOWN (decl) = 1;
1714 }
1715
1716 /* Here, we only decide whether or not the tinfo node should be
1717    emitted with the vtable.  IS_IN_LIBRARY is nonzero iff the
1718    typeinfo for TYPE should be in the runtime library.  */
1719
1720 void
1721 import_export_tinfo (tree decl, tree type, bool is_in_library)
1722 {
1723   if (DECL_INTERFACE_KNOWN (decl))
1724     return;
1725
1726   if (IS_AGGR_TYPE (type))
1727     import_export_class (type);
1728
1729   if (IS_AGGR_TYPE (type) && CLASSTYPE_INTERFACE_KNOWN (type)
1730       && TYPE_POLYMORPHIC_P (type)
1731       /* If -fno-rtti, we're not necessarily emitting this stuff with
1732          the class, so go ahead and emit it now.  This can happen when
1733          a class is used in exception handling.  */
1734       && flag_rtti)
1735     {
1736       DECL_NOT_REALLY_EXTERN (decl) = !CLASSTYPE_INTERFACE_ONLY (type);
1737       DECL_COMDAT (decl) = 0;
1738     }
1739   else
1740     {
1741       DECL_NOT_REALLY_EXTERN (decl) = 1;
1742       DECL_COMDAT (decl) = 1;
1743     }
1744
1745   /* Now override some cases.  */
1746   if (flag_weak)
1747     DECL_COMDAT (decl) = 1;
1748   else if (is_in_library)
1749     DECL_COMDAT (decl) = 0;
1750
1751   DECL_INTERFACE_KNOWN (decl) = 1;
1752 }
1753
1754 /* Return an expression that performs the destruction of DECL, which
1755    must be a VAR_DECL whose type has a non-trivial destructor, or is
1756    an array whose (innermost) elements have a non-trivial destructor.  */
1757
1758 tree
1759 build_cleanup (tree decl)
1760 {
1761   tree temp;
1762   tree type = TREE_TYPE (decl);
1763
1764   /* This function should only be called for declarations that really
1765      require cleanups.  */
1766   my_friendly_assert (!TYPE_HAS_TRIVIAL_DESTRUCTOR (type), 20030106);
1767
1768   /* Treat all objects with destructors as used; the destructor may do
1769      something substantive.  */
1770   mark_used (decl);
1771
1772   if (TREE_CODE (type) == ARRAY_TYPE)
1773     temp = decl;
1774   else
1775     {
1776       cxx_mark_addressable (decl);
1777       temp = build1 (ADDR_EXPR, build_pointer_type (type), decl);
1778     }
1779   temp = build_delete (TREE_TYPE (temp), temp,
1780                        sfk_complete_destructor,
1781                        LOOKUP_NORMAL|LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
1782   return temp;
1783 }
1784
1785 /* Returns the initialization guard variable for the variable DECL,
1786    which has static storage duration.  */
1787
1788 tree
1789 get_guard (tree decl)
1790 {
1791   tree sname;
1792   tree guard;
1793
1794   sname = mangle_guard_variable (decl);
1795   guard = IDENTIFIER_GLOBAL_VALUE (sname);
1796   if (! guard)
1797     {
1798       tree guard_type;
1799
1800       /* We use a type that is big enough to contain a mutex as well
1801          as an integer counter.  */
1802       guard_type = long_long_integer_type_node;
1803       guard = build_decl (VAR_DECL, sname, guard_type);
1804
1805       /* The guard should have the same linkage as what it guards.  */
1806       TREE_PUBLIC (guard) = TREE_PUBLIC (decl);
1807       TREE_STATIC (guard) = TREE_STATIC (decl);
1808       DECL_COMMON (guard) = DECL_COMMON (decl);
1809       DECL_ONE_ONLY (guard) = DECL_ONE_ONLY (decl);
1810       if (TREE_PUBLIC (decl))
1811         DECL_WEAK (guard) = DECL_WEAK (decl);
1812
1813       DECL_ARTIFICIAL (guard) = 1;
1814       TREE_USED (guard) = 1;
1815       pushdecl_top_level_and_finish (guard, NULL_TREE);
1816     }
1817   return guard;
1818 }
1819
1820 /* Return those bits of the GUARD variable that should be set when the
1821    guarded entity is actually initialized.  */
1822
1823 static tree
1824 get_guard_bits (tree guard)
1825 {
1826   /* We only set the first byte of the guard, in order to leave room
1827      for a mutex in the high-order bits.  */
1828   guard = build1 (ADDR_EXPR,
1829                   build_pointer_type (TREE_TYPE (guard)),
1830                   guard);
1831   guard = build1 (NOP_EXPR,
1832                   build_pointer_type (char_type_node),
1833                   guard);
1834   guard = build1 (INDIRECT_REF, char_type_node, guard);
1835
1836   return guard;
1837 }
1838
1839 /* Return an expression which determines whether or not the GUARD
1840    variable has already been initialized.  */
1841
1842 tree
1843 get_guard_cond (tree guard)
1844 {
1845   tree guard_value;
1846
1847   /* Check to see if the GUARD is zero.  */
1848   guard = get_guard_bits (guard);
1849   guard_value = integer_zero_node;
1850   if (!same_type_p (TREE_TYPE (guard_value), TREE_TYPE (guard)))
1851     guard_value = convert (TREE_TYPE (guard), guard_value);
1852   return cp_build_binary_op (EQ_EXPR, guard, guard_value);
1853 }
1854
1855 /* Return an expression which sets the GUARD variable, indicating that
1856    the variable being guarded has been initialized.  */
1857
1858 tree
1859 set_guard (tree guard)
1860 {
1861   tree guard_init;
1862
1863   /* Set the GUARD to one.  */
1864   guard = get_guard_bits (guard);
1865   guard_init = integer_one_node;
1866   if (!same_type_p (TREE_TYPE (guard_init), TREE_TYPE (guard)))
1867     guard_init = convert (TREE_TYPE (guard), guard_init);
1868   return build_modify_expr (guard, NOP_EXPR, guard_init);
1869 }
1870
1871 /* Start the process of running a particular set of global constructors
1872    or destructors.  Subroutine of do_[cd]tors.  */
1873
1874 static tree
1875 start_objects (int method_type, int initp)
1876 {
1877   tree fnname;
1878   tree body;
1879   char type[10];
1880
1881   /* Make ctor or dtor function.  METHOD_TYPE may be 'I' or 'D'.  */
1882
1883   if (initp != DEFAULT_INIT_PRIORITY)
1884     {
1885       char joiner;
1886
1887 #ifdef JOINER
1888       joiner = JOINER;
1889 #else
1890       joiner = '_';
1891 #endif
1892
1893       sprintf (type, "%c%c%.5u", method_type, joiner, initp);
1894     }
1895   else
1896     sprintf (type, "%c", method_type);
1897
1898   fnname = get_file_function_name_long (type);
1899
1900   start_function (void_list_node,
1901                   make_call_declarator (fnname, void_list_node, NULL_TREE,
1902                                         NULL_TREE),
1903                   NULL_TREE, SF_DEFAULT);
1904
1905   /* It can be a static function as long as collect2 does not have
1906      to scan the object file to find its ctor/dtor routine.  */
1907   TREE_PUBLIC (current_function_decl) = ! targetm.have_ctors_dtors;
1908
1909   /* Mark this declaration as used to avoid spurious warnings.  */
1910   TREE_USED (current_function_decl) = 1;
1911
1912   /* Mark this function as a global constructor or destructor.  */
1913   if (method_type == 'I')
1914     DECL_GLOBAL_CTOR_P (current_function_decl) = 1;
1915   else
1916     DECL_GLOBAL_DTOR_P (current_function_decl) = 1;
1917   DECL_LANG_SPECIFIC (current_function_decl)->decl_flags.u2sel = 1;
1918
1919   body = begin_compound_stmt (/*has_no_scope=*/false);
1920
1921   /* We cannot allow these functions to be elided, even if they do not
1922      have external linkage.  And, there's no point in deferring
1923      compilation of thes functions; they're all going to have to be
1924      out anyhow.  */
1925   current_function_cannot_inline
1926     = "static constructors and destructors cannot be inlined";
1927
1928   return body;
1929 }
1930
1931 /* Finish the process of running a particular set of global constructors
1932    or destructors.  Subroutine of do_[cd]tors.  */
1933
1934 static void
1935 finish_objects (int method_type, int initp, tree body)
1936 {
1937   tree fn;
1938
1939   /* Finish up.  */
1940   finish_compound_stmt (body);
1941   fn = finish_function (0);
1942   expand_or_defer_fn (fn);
1943
1944   /* When only doing semantic analysis, and no RTL generation, we
1945      can't call functions that directly emit assembly code; there is
1946      no assembly file in which to put the code.  */
1947   if (flag_syntax_only)
1948     return;
1949
1950   if (targetm.have_ctors_dtors)
1951     {
1952       rtx fnsym = XEXP (DECL_RTL (fn), 0);
1953       if (method_type == 'I')
1954         (* targetm.asm_out.constructor) (fnsym, initp);
1955       else
1956         (* targetm.asm_out.destructor) (fnsym, initp);
1957     }
1958 }
1959
1960 /* The names of the parameters to the function created to handle
1961    initializations and destructions for objects with static storage
1962    duration.  */
1963 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
1964 #define PRIORITY_IDENTIFIER "__priority"
1965
1966 /* The name of the function we create to handle initializations and
1967    destructions for objects with static storage duration.  */
1968 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
1969
1970 /* The declaration for the __INITIALIZE_P argument.  */
1971 static GTY(()) tree initialize_p_decl;
1972
1973 /* The declaration for the __PRIORITY argument.  */
1974 static GTY(()) tree priority_decl;
1975
1976 /* The declaration for the static storage duration function.  */
1977 static GTY(()) tree ssdf_decl;
1978
1979 /* All the static storage duration functions created in this
1980    translation unit.  */
1981 static GTY(()) varray_type ssdf_decls;
1982
1983 /* A map from priority levels to information about that priority
1984    level.  There may be many such levels, so efficient lookup is
1985    important.  */
1986 static splay_tree priority_info_map;
1987
1988 /* Begins the generation of the function that will handle all
1989    initialization and destruction of objects with static storage
1990    duration.  The function generated takes two parameters of type
1991    `int': __INITIALIZE_P and __PRIORITY.  If __INITIALIZE_P is
1992    nonzero, it performs initializations.  Otherwise, it performs
1993    destructions.  It only performs those initializations or
1994    destructions with the indicated __PRIORITY.  The generated function
1995    returns no value.
1996
1997    It is assumed that this function will only be called once per
1998    translation unit.  */
1999
2000 static tree
2001 start_static_storage_duration_function (unsigned count)
2002 {
2003   tree parm_types;
2004   tree type;
2005   tree body;
2006   char id[sizeof (SSDF_IDENTIFIER) + 1 /* '\0' */ + 32];
2007
2008   /* Create the identifier for this function.  It will be of the form
2009      SSDF_IDENTIFIER_<number>.  */
2010   sprintf (id, "%s_%u", SSDF_IDENTIFIER, count);
2011
2012   /* Create the parameters.  */
2013   parm_types = void_list_node;
2014   parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2015   parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2016   type = build_function_type (void_type_node, parm_types);
2017
2018   /* Create the FUNCTION_DECL itself.  */
2019   ssdf_decl = build_lang_decl (FUNCTION_DECL,
2020                                get_identifier (id),
2021                                type);
2022   TREE_PUBLIC (ssdf_decl) = 0;
2023   DECL_ARTIFICIAL (ssdf_decl) = 1;
2024
2025   /* Put this function in the list of functions to be called from the
2026      static constructors and destructors.  */
2027   if (!ssdf_decls)
2028     {
2029       VARRAY_TREE_INIT (ssdf_decls, 32, "ssdf_decls");
2030
2031       /* Take this opportunity to initialize the map from priority
2032          numbers to information about that priority level.  */
2033       priority_info_map = splay_tree_new (splay_tree_compare_ints,
2034                                           /*delete_key_fn=*/0,
2035                                           /*delete_value_fn=*/
2036                                           (splay_tree_delete_value_fn) &free);
2037
2038       /* We always need to generate functions for the
2039          DEFAULT_INIT_PRIORITY so enter it now.  That way when we walk
2040          priorities later, we'll be sure to find the
2041          DEFAULT_INIT_PRIORITY.  */
2042       get_priority_info (DEFAULT_INIT_PRIORITY);
2043     }
2044
2045   VARRAY_PUSH_TREE (ssdf_decls, ssdf_decl);
2046
2047   /* Create the argument list.  */
2048   initialize_p_decl = cp_build_parm_decl
2049     (get_identifier (INITIALIZE_P_IDENTIFIER), integer_type_node);
2050   DECL_CONTEXT (initialize_p_decl) = ssdf_decl;
2051   TREE_USED (initialize_p_decl) = 1;
2052   priority_decl = cp_build_parm_decl
2053     (get_identifier (PRIORITY_IDENTIFIER), integer_type_node);
2054   DECL_CONTEXT (priority_decl) = ssdf_decl;
2055   TREE_USED (priority_decl) = 1;
2056
2057   TREE_CHAIN (initialize_p_decl) = priority_decl;
2058   DECL_ARGUMENTS (ssdf_decl) = initialize_p_decl;
2059
2060   /* Put the function in the global scope.  */
2061   pushdecl (ssdf_decl);
2062
2063   /* Start the function itself.  This is equivalent to declaring the
2064      function as:
2065
2066        static void __ssdf (int __initialize_p, init __priority_p);
2067
2068      It is static because we only need to call this function from the
2069      various constructor and destructor functions for this module.  */
2070   start_function (/*specs=*/NULL_TREE,
2071                   ssdf_decl,
2072                   /*attrs=*/NULL_TREE,
2073                   SF_PRE_PARSED);
2074
2075   /* Set up the scope of the outermost block in the function.  */
2076   body = begin_compound_stmt (/*has_no_scope=*/false);
2077
2078   /* This function must not be deferred because we are depending on
2079      its compilation to tell us what is TREE_SYMBOL_REFERENCED.  */
2080   current_function_cannot_inline
2081     = "static storage duration functions cannot be inlined";
2082
2083   return body;
2084 }
2085
2086 /* Finish the generation of the function which performs initialization
2087    and destruction of objects with static storage duration.  After
2088    this point, no more such objects can be created.  */
2089
2090 static void
2091 finish_static_storage_duration_function (tree body)
2092 {
2093   /* Close out the function.  */
2094   finish_compound_stmt (body);
2095   expand_or_defer_fn (finish_function (0));
2096 }
2097
2098 /* Return the information about the indicated PRIORITY level.  If no
2099    code to handle this level has yet been generated, generate the
2100    appropriate prologue.  */
2101
2102 static priority_info
2103 get_priority_info (int priority)
2104 {
2105   priority_info pi;
2106   splay_tree_node n;
2107
2108   n = splay_tree_lookup (priority_info_map,
2109                          (splay_tree_key) priority);
2110   if (!n)
2111     {
2112       /* Create a new priority information structure, and insert it
2113          into the map.  */
2114       pi = xmalloc (sizeof (struct priority_info_s));
2115       pi->initializations_p = 0;
2116       pi->destructions_p = 0;
2117       splay_tree_insert (priority_info_map,
2118                          (splay_tree_key) priority,
2119                          (splay_tree_value) pi);
2120     }
2121   else
2122     pi = (priority_info) n->value;
2123
2124   return pi;
2125 }
2126
2127 /* Set up to handle the initialization or destruction of DECL.  If
2128    INITP is nonzero, we are initializing the variable.  Otherwise, we
2129    are destroying it.  */
2130
2131 static tree
2132 start_static_initialization_or_destruction (tree decl, int initp)
2133 {
2134   tree guard_if_stmt = NULL_TREE;
2135   int priority;
2136   tree cond;
2137   tree guard;
2138   tree init_cond;
2139   priority_info pi;
2140
2141   /* Figure out the priority for this declaration.  */
2142   priority = DECL_INIT_PRIORITY (decl);
2143   if (!priority)
2144     priority = DEFAULT_INIT_PRIORITY;
2145
2146   /* Remember that we had an initialization or finalization at this
2147      priority.  */
2148   pi = get_priority_info (priority);
2149   if (initp)
2150     pi->initializations_p = 1;
2151   else
2152     pi->destructions_p = 1;
2153
2154   /* Trick the compiler into thinking we are at the file and line
2155      where DECL was declared so that error-messages make sense, and so
2156      that the debugger will show somewhat sensible file and line
2157      information.  */
2158   input_location = DECL_SOURCE_LOCATION (decl);
2159
2160   /* Because of:
2161
2162        [class.access.spec]
2163
2164        Access control for implicit calls to the constructors,
2165        the conversion functions, or the destructor called to
2166        create and destroy a static data member is performed as
2167        if these calls appeared in the scope of the member's
2168        class.
2169
2170      we pretend we are in a static member function of the class of
2171      which the DECL is a member.  */
2172   if (member_p (decl))
2173     {
2174       DECL_CONTEXT (current_function_decl) = DECL_CONTEXT (decl);
2175       DECL_STATIC_FUNCTION_P (current_function_decl) = 1;
2176     }
2177
2178   /* Conditionalize this initialization on being in the right priority
2179      and being initializing/finalizing appropriately.  */
2180   guard_if_stmt = begin_if_stmt ();
2181   cond = cp_build_binary_op (EQ_EXPR,
2182                              priority_decl,
2183                              build_int_2 (priority, 0));
2184   init_cond = initp ? integer_one_node : integer_zero_node;
2185   init_cond = cp_build_binary_op (EQ_EXPR,
2186                                   initialize_p_decl,
2187                                   init_cond);
2188   cond = cp_build_binary_op (TRUTH_ANDIF_EXPR, cond, init_cond);
2189
2190   /* Assume we don't need a guard.  */
2191   guard = NULL_TREE;
2192   /* We need a guard if this is an object with external linkage that
2193      might be initialized in more than one place.  (For example, a
2194      static data member of a template, when the data member requires
2195      construction.)  */
2196   if (TREE_PUBLIC (decl) && (DECL_COMMON (decl)
2197                              || DECL_ONE_ONLY (decl)
2198                              || DECL_WEAK (decl)))
2199     {
2200       tree guard_cond;
2201
2202       guard = get_guard (decl);
2203
2204       /* When using __cxa_atexit, we just check the GUARD as we would
2205          for a local static.  */
2206       if (flag_use_cxa_atexit)
2207         {
2208           /* When using __cxa_atexit, we never try to destroy
2209              anything from a static destructor.  */
2210           my_friendly_assert (initp, 20000629);
2211           guard_cond = get_guard_cond (guard);
2212         }
2213       /* If we don't have __cxa_atexit, then we will be running
2214          destructors from .fini sections, or their equivalents.  So,
2215          we need to know how many times we've tried to initialize this
2216          object.  We do initializations only if the GUARD is zero,
2217          i.e., if we are the first to initialize the variable.  We do
2218          destructions only if the GUARD is one, i.e., if we are the
2219          last to destroy the variable.  */
2220       else if (initp)
2221         guard_cond
2222           = cp_build_binary_op (EQ_EXPR,
2223                                 build_unary_op (PREINCREMENT_EXPR,
2224                                                 guard,
2225                                                 /*noconvert=*/1),
2226                                 integer_one_node);
2227       else
2228         guard_cond
2229           = cp_build_binary_op (EQ_EXPR,
2230                                 build_unary_op (PREDECREMENT_EXPR,
2231                                                 guard,
2232                                                 /*noconvert=*/1),
2233                                 integer_zero_node);
2234
2235       cond = cp_build_binary_op (TRUTH_ANDIF_EXPR, cond, guard_cond);
2236     }
2237
2238   finish_if_stmt_cond (cond, guard_if_stmt);
2239
2240   /* If we're using __cxa_atexit, we have not already set the GUARD,
2241      so we must do so now.  */
2242   if (guard && initp && flag_use_cxa_atexit)
2243     finish_expr_stmt (set_guard (guard));
2244
2245   return guard_if_stmt;
2246 }
2247
2248 /* We've just finished generating code to do an initialization or
2249    finalization.  GUARD_IF_STMT is the if-statement we used to guard
2250    the initialization.  */
2251
2252 static void
2253 finish_static_initialization_or_destruction (tree guard_if_stmt)
2254 {
2255   finish_then_clause (guard_if_stmt);
2256   finish_if_stmt ();
2257
2258   /* Now that we're done with DECL we don't need to pretend to be a
2259      member of its class any longer.  */
2260   DECL_CONTEXT (current_function_decl) = NULL_TREE;
2261   DECL_STATIC_FUNCTION_P (current_function_decl) = 0;
2262 }
2263
2264 /* Generate code to do the initialization of DECL, a VAR_DECL with
2265    static storage duration.  The initialization is INIT.  */
2266
2267 static void
2268 do_static_initialization (tree decl, tree init)
2269 {
2270   tree guard_if_stmt;
2271
2272   /* Set up for the initialization.  */
2273   guard_if_stmt
2274     = start_static_initialization_or_destruction (decl,
2275                                                   /*initp=*/1);
2276
2277   /* Perform the initialization.  */
2278   if (init)
2279     finish_expr_stmt (init);
2280
2281   /* If we're using __cxa_atexit, register a a function that calls the
2282      destructor for the object.  */
2283   if (flag_use_cxa_atexit)
2284     register_dtor_fn (decl);
2285
2286   /* Finsh up.  */
2287   finish_static_initialization_or_destruction (guard_if_stmt);
2288 }
2289
2290 /* Generate code to do the static destruction of DECL.  If DECL may be
2291    initialized more than once in different object files, GUARD is the
2292    guard variable to check.  PRIORITY is the priority for the
2293    destruction.  */
2294
2295 static void
2296 do_static_destruction (tree decl)
2297 {
2298   tree guard_if_stmt;
2299
2300   /* If we're using __cxa_atexit, then destructors are registered
2301      immediately after objects are initialized.  */
2302   my_friendly_assert (!flag_use_cxa_atexit, 20000121);
2303
2304   /* If we don't need a destructor, there's nothing to do.  */
2305   if (TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
2306     return;
2307
2308   /* Actually do the destruction.  */
2309   guard_if_stmt = start_static_initialization_or_destruction (decl,
2310                                                               /*initp=*/0);
2311   finish_expr_stmt (build_cleanup (decl));
2312   finish_static_initialization_or_destruction (guard_if_stmt);
2313 }
2314
2315 /* VARS is a list of variables with static storage duration which may
2316    need initialization and/or finalization.  Remove those variables
2317    that don't really need to be initialized or finalized, and return
2318    the resulting list.  The order in which the variables appear in
2319    VARS is in reverse order of the order in which they should actually
2320    be initialized.  The list we return is in the unreversed order;
2321    i.e., the first variable should be initialized first.  */
2322
2323 static tree
2324 prune_vars_needing_no_initialization (tree *vars)
2325 {
2326   tree *var = vars;
2327   tree result = NULL_TREE;
2328
2329   while (*var)
2330     {
2331       tree t = *var;
2332       tree decl = TREE_VALUE (t);
2333       tree init = TREE_PURPOSE (t);
2334
2335       /* Deal gracefully with error.  */
2336       if (decl == error_mark_node)
2337         {
2338           var = &TREE_CHAIN (t);
2339           continue;
2340         }
2341
2342       /* The only things that can be initialized are variables.  */
2343       my_friendly_assert (TREE_CODE (decl) == VAR_DECL, 19990420);
2344
2345       /* If this object is not defined, we don't need to do anything
2346          here.  */
2347       if (DECL_EXTERNAL (decl))
2348         {
2349           var = &TREE_CHAIN (t);
2350           continue;
2351         }
2352
2353       /* Also, if the initializer already contains errors, we can bail
2354          out now.  */
2355       if (init && TREE_CODE (init) == TREE_LIST
2356           && value_member (error_mark_node, init))
2357         {
2358           var = &TREE_CHAIN (t);
2359           continue;
2360         }
2361
2362       /* This variable is going to need initialization and/or
2363          finalization, so we add it to the list.  */
2364       *var = TREE_CHAIN (t);
2365       TREE_CHAIN (t) = result;
2366       result = t;
2367     }
2368
2369   return result;
2370 }
2371
2372 /* Make sure we have told the back end about all the variables in
2373    VARS.  */
2374
2375 static void
2376 write_out_vars (tree vars)
2377 {
2378   tree v;
2379
2380   for (v = vars; v; v = TREE_CHAIN (v))
2381     if (!var_finalized_p (TREE_VALUE (v)))
2382       rest_of_decl_compilation (TREE_VALUE (v), 0, 1, 1);
2383 }
2384
2385 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
2386    (otherwise) that will initialize all gobal objects with static
2387    storage duration having the indicated PRIORITY.  */
2388
2389 static void
2390 generate_ctor_or_dtor_function (bool constructor_p, int priority,
2391                                 location_t *locus)
2392 {
2393   char function_key;
2394   tree arguments;
2395   tree fndecl;
2396   tree body;
2397   size_t i;
2398
2399   input_location = *locus;
2400   locus->line++;
2401
2402   /* We use `I' to indicate initialization and `D' to indicate
2403      destruction.  */
2404   function_key = constructor_p ? 'I' : 'D';
2405
2406   /* We emit the function lazily, to avoid generating empty
2407      global constructors and destructors.  */
2408   body = NULL_TREE;
2409
2410   /* Call the static storage duration function with appropriate
2411      arguments.  */
2412   if (ssdf_decls)
2413     for (i = 0; i < ssdf_decls->elements_used; ++i)
2414       {
2415         fndecl = VARRAY_TREE (ssdf_decls, i);
2416
2417         /* Calls to pure or const functions will expand to nothing.  */
2418         if (! (flags_from_decl_or_type (fndecl) & (ECF_CONST | ECF_PURE)))
2419           {
2420             if (! body)
2421               body = start_objects (function_key, priority);
2422
2423             arguments = tree_cons (NULL_TREE, build_int_2 (priority, 0),
2424                                    NULL_TREE);
2425             arguments = tree_cons (NULL_TREE, build_int_2 (constructor_p, 0),
2426                                    arguments);
2427             finish_expr_stmt (build_function_call (fndecl, arguments));
2428           }
2429       }
2430
2431   /* If we're generating code for the DEFAULT_INIT_PRIORITY, throw in
2432      calls to any functions marked with attributes indicating that
2433      they should be called at initialization- or destruction-time.  */
2434   if (priority == DEFAULT_INIT_PRIORITY)
2435     {
2436       tree fns;
2437
2438       for (fns = constructor_p ? static_ctors : static_dtors;
2439            fns;
2440            fns = TREE_CHAIN (fns))
2441         {
2442           fndecl = TREE_VALUE (fns);
2443
2444           /* Calls to pure/const functions will expand to nothing.  */
2445           if (! (flags_from_decl_or_type (fndecl) & (ECF_CONST | ECF_PURE)))
2446             {
2447               if (! body)
2448                 body = start_objects (function_key, priority);
2449               finish_expr_stmt (build_function_call (fndecl, NULL_TREE));
2450             }
2451         }
2452     }
2453
2454   /* Close out the function.  */
2455   if (body)
2456     finish_objects (function_key, priority, body);
2457 }
2458
2459 /* Generate constructor and destructor functions for the priority
2460    indicated by N.  */
2461
2462 static int
2463 generate_ctor_and_dtor_functions_for_priority (splay_tree_node n, void * data)
2464 {
2465   location_t *locus = data;
2466   int priority = (int) n->key;
2467   priority_info pi = (priority_info) n->value;
2468
2469   /* Generate the functions themselves, but only if they are really
2470      needed.  */
2471   if (pi->initializations_p
2472       || (priority == DEFAULT_INIT_PRIORITY && static_ctors))
2473     generate_ctor_or_dtor_function (/*constructor_p=*/true, priority, locus);
2474   if (pi->destructions_p
2475       || (priority == DEFAULT_INIT_PRIORITY && static_dtors))
2476     generate_ctor_or_dtor_function (/*constructor_p=*/false, priority, locus);
2477
2478   /* Keep iterating.  */
2479   return 0;
2480 }
2481
2482 /* Called via LANGHOOK_CALLGRAPH_ANALYZE_EXPR.  It is supposed to mark
2483    decls referenced from frontend specific constructs; it will be called
2484    only for language-specific tree nodes.
2485
2486    Here we must deal with member pointers.  */
2487
2488 tree
2489 cxx_callgraph_analyze_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED,
2490                             tree from ATTRIBUTE_UNUSED)
2491 {
2492   tree t = *tp;
2493
2494   if (flag_unit_at_a_time)
2495     switch (TREE_CODE (t))
2496       {
2497       case PTRMEM_CST:
2498         if (TYPE_PTRMEMFUNC_P (TREE_TYPE (t)))
2499           cgraph_mark_needed_node (cgraph_node (PTRMEM_CST_MEMBER (t)));
2500         break;
2501       case BASELINK:
2502         if (TREE_CODE (BASELINK_FUNCTIONS (t)) == FUNCTION_DECL)
2503           cgraph_mark_needed_node (cgraph_node (BASELINK_FUNCTIONS (t)));
2504         break;
2505
2506       default:
2507         break;
2508       }
2509
2510   return NULL;
2511 }
2512
2513 /* This routine is called from the last rule in yyparse ().
2514    Its job is to create all the code needed to initialize and
2515    destroy the global aggregates.  We do the destruction
2516    first, since that way we only need to reverse the decls once.  */
2517
2518 void
2519 finish_file (void)
2520 {
2521   tree vars;
2522   bool reconsider;
2523   size_t i;
2524   location_t locus;
2525   unsigned ssdf_count = 0;
2526
2527   locus = input_location;
2528   at_eof = 1;
2529
2530   /* Bad parse errors.  Just forget about it.  */
2531   if (! global_bindings_p () || current_class_type || decl_namespace_list)
2532     return;
2533
2534   if (pch_file)
2535     c_common_write_pch ();
2536
2537   /* Otherwise, GDB can get confused, because in only knows
2538      about source for LINENO-1 lines.  */
2539   input_line -= 1;
2540
2541   interface_unknown = 1;
2542   interface_only = 0;
2543
2544   /* We now have to write out all the stuff we put off writing out.
2545      These include:
2546
2547        o Template specializations that we have not yet instantiated,
2548          but which are needed.
2549        o Initialization and destruction for non-local objects with
2550          static storage duration.  (Local objects with static storage
2551          duration are initialized when their scope is first entered,
2552          and are cleaned up via atexit.)
2553        o Virtual function tables.
2554
2555      All of these may cause others to be needed.  For example,
2556      instantiating one function may cause another to be needed, and
2557      generating the initializer for an object may cause templates to be
2558      instantiated, etc., etc.  */
2559
2560   timevar_push (TV_VARCONST);
2561
2562   emit_support_tinfos ();
2563
2564   do
2565     {
2566       tree t;
2567       size_t n_old, n_new;
2568
2569       reconsider = false;
2570
2571       /* If there are templates that we've put off instantiating, do
2572          them now.  */
2573       instantiate_pending_templates ();
2574       ggc_collect ();
2575
2576       /* Write out virtual tables as required.  Note that writing out
2577          the virtual table for a template class may cause the
2578          instantiation of members of that class.  If we write out
2579          vtables then we remove the class from our list so we don't
2580          have to look at it again.  */
2581
2582       while (keyed_classes != NULL_TREE
2583              && maybe_emit_vtables (TREE_VALUE (keyed_classes)))
2584         {
2585           reconsider = true;
2586           keyed_classes = TREE_CHAIN (keyed_classes);
2587         }
2588
2589       t = keyed_classes;
2590       if (t != NULL_TREE)
2591         {
2592           tree next = TREE_CHAIN (t);
2593
2594           while (next)
2595             {
2596               if (maybe_emit_vtables (TREE_VALUE (next)))
2597                 {
2598                   reconsider = true;
2599                   TREE_CHAIN (t) = TREE_CHAIN (next);
2600                 }
2601               else
2602                 t = next;
2603
2604               next = TREE_CHAIN (t);
2605             }
2606         }
2607
2608       /* Write out needed type info variables.  We have to be careful
2609          looping through unemitted decls, because emit_tinfo_decl may
2610          cause other variables to be needed.  We stick new elements
2611          (and old elements that we may need to reconsider) at the end
2612          of the array, then shift them back to the beginning once we're
2613          done.  */
2614
2615       n_old = VARRAY_ACTIVE_SIZE (unemitted_tinfo_decls);
2616       for (i = 0; i < n_old; ++i)
2617         {
2618           tree tinfo_decl = VARRAY_TREE (unemitted_tinfo_decls, i);
2619           if (emit_tinfo_decl (tinfo_decl))
2620             reconsider = true;
2621           else
2622             VARRAY_PUSH_TREE (unemitted_tinfo_decls, tinfo_decl);
2623         }
2624
2625       /* The only elements we want to keep are the new ones.  Copy
2626          them to the beginning of the array, then get rid of the
2627          leftovers.  */
2628       n_new = VARRAY_ACTIVE_SIZE (unemitted_tinfo_decls) - n_old;
2629       if (n_new)
2630         memmove (&VARRAY_TREE (unemitted_tinfo_decls, 0),
2631                  &VARRAY_TREE (unemitted_tinfo_decls, n_old),
2632                  n_new * sizeof (tree));
2633       memset (&VARRAY_TREE (unemitted_tinfo_decls, n_new),
2634               0, n_old * sizeof (tree));
2635       VARRAY_ACTIVE_SIZE (unemitted_tinfo_decls) = n_new;
2636
2637       /* The list of objects with static storage duration is built up
2638          in reverse order.  We clear STATIC_AGGREGATES so that any new
2639          aggregates added during the initialization of these will be
2640          initialized in the correct order when we next come around the
2641          loop.  */
2642       vars = prune_vars_needing_no_initialization (&static_aggregates);
2643
2644       if (vars)
2645         {
2646           tree v;
2647
2648           /* We need to start a new initialization function each time
2649              through the loop.  That's because we need to know which
2650              vtables have been referenced, and TREE_SYMBOL_REFERENCED
2651              isn't computed until a function is finished, and written
2652              out.  That's a deficiency in the back-end.  When this is
2653              fixed, these initialization functions could all become
2654              inline, with resulting performance improvements.  */
2655           tree ssdf_body;
2656
2657           /* Set the line and file, so that it is obviously not from
2658              the source file.  */
2659           input_location = locus;
2660           ssdf_body = start_static_storage_duration_function (ssdf_count);
2661
2662           /* Make sure the back end knows about all the variables.  */
2663           write_out_vars (vars);
2664
2665           /* First generate code to do all the initializations.  */
2666           for (v = vars; v; v = TREE_CHAIN (v))
2667             do_static_initialization (TREE_VALUE (v),
2668                                       TREE_PURPOSE (v));
2669
2670           /* Then, generate code to do all the destructions.  Do these
2671              in reverse order so that the most recently constructed
2672              variable is the first destroyed.  If we're using
2673              __cxa_atexit, then we don't need to do this; functions
2674              were registered at initialization time to destroy the
2675              local statics.  */
2676           if (!flag_use_cxa_atexit)
2677             {
2678               vars = nreverse (vars);
2679               for (v = vars; v; v = TREE_CHAIN (v))
2680                 do_static_destruction (TREE_VALUE (v));
2681             }
2682           else
2683             vars = NULL_TREE;
2684
2685           /* Finish up the static storage duration function for this
2686              round.  */
2687           input_location = locus;
2688           finish_static_storage_duration_function (ssdf_body);
2689
2690           /* All those initializations and finalizations might cause
2691              us to need more inline functions, more template
2692              instantiations, etc.  */
2693           reconsider = true;
2694           ssdf_count++;
2695           locus.line++;
2696         }
2697
2698       for (i = 0; i < deferred_fns_used; ++i)
2699         {
2700           tree decl = VARRAY_TREE (deferred_fns, i);
2701
2702           /* Does it need synthesizing?  */
2703           if (DECL_ARTIFICIAL (decl) && ! DECL_INITIAL (decl)
2704               && TREE_USED (decl)
2705               && (! DECL_REALLY_EXTERN (decl) || DECL_INLINE (decl)))
2706             {
2707               /* Even though we're already at the top-level, we push
2708                  there again.  That way, when we pop back a few lines
2709                  hence, all of our state is restored.  Otherwise,
2710                  finish_function doesn't clean things up, and we end
2711                  up with CURRENT_FUNCTION_DECL set.  */
2712               push_to_top_level ();
2713               synthesize_method (decl);
2714               pop_from_top_level ();
2715               reconsider = true;
2716             }
2717
2718           /* If the function has no body, avoid calling
2719              import_export_decl.  On a system without weak symbols,
2720              calling import_export_decl will make an inline template
2721              instantiation "static", which will result in errors about
2722              the use of undefined functions if there is no body for
2723              the function.  */
2724           if (!DECL_SAVED_TREE (decl))
2725             continue;
2726
2727           import_export_decl (decl);
2728
2729           /* We lie to the back-end, pretending that some functions
2730              are not defined when they really are.  This keeps these
2731              functions from being put out unnecessarily.  But, we must
2732              stop lying when the functions are referenced, or if they
2733              are not comdat since they need to be put out now.  This
2734              is done in a separate for cycle, because if some deferred
2735              function is contained in another deferred function later
2736              in deferred_fns varray, rest_of_compilation would skip
2737              this function and we really cannot expand the same
2738              function twice.  */
2739           if (DECL_NOT_REALLY_EXTERN (decl)
2740               && DECL_INITIAL (decl)
2741               && DECL_NEEDED_P (decl))
2742             DECL_EXTERNAL (decl) = 0;
2743
2744           /* If we're going to need to write this function out, and
2745              there's already a body for it, create RTL for it now.
2746              (There might be no body if this is a method we haven't
2747              gotten around to synthesizing yet.)  */
2748           if (!DECL_EXTERNAL (decl)
2749               && DECL_NEEDED_P (decl)
2750               && DECL_SAVED_TREE (decl)
2751               && !TREE_ASM_WRITTEN (decl)
2752               && (!flag_unit_at_a_time
2753                   || !cgraph_node (decl)->local.finalized))
2754             {
2755               /* We will output the function; no longer consider it in this
2756                  loop.  */
2757               DECL_DEFER_OUTPUT (decl) = 0;
2758               /* Generate RTL for this function now that we know we
2759                  need it.  */
2760               expand_or_defer_fn (decl);
2761               /* If we're compiling -fsyntax-only pretend that this
2762                  function has been written out so that we don't try to
2763                  expand it again.  */
2764               if (flag_syntax_only)
2765                 TREE_ASM_WRITTEN (decl) = 1;
2766               reconsider = true;
2767             }
2768         }
2769
2770       if (walk_namespaces (wrapup_globals_for_namespace, /*data=*/0))
2771         reconsider = true;
2772
2773       /* Static data members are just like namespace-scope globals.  */
2774       for (i = 0; i < pending_statics_used; ++i)
2775         {
2776           tree decl = VARRAY_TREE (pending_statics, i);
2777           if (var_finalized_p (decl))
2778             continue;
2779           import_export_decl (decl);
2780           if (DECL_NOT_REALLY_EXTERN (decl) && ! DECL_IN_AGGR_P (decl))
2781             DECL_EXTERNAL (decl) = 0;
2782         }
2783       if (pending_statics
2784           && wrapup_global_declarations (&VARRAY_TREE (pending_statics, 0),
2785                                          pending_statics_used))
2786         reconsider = true;
2787
2788       if (cgraph_assemble_pending_functions ())
2789         reconsider = true;
2790     }
2791   while (reconsider);
2792
2793   /* All used inline functions must have a definition at this point.  */
2794   for (i = 0; i < deferred_fns_used; ++i)
2795     {
2796       tree decl = VARRAY_TREE (deferred_fns, i);
2797
2798       if (TREE_USED (decl) && DECL_DECLARED_INLINE_P (decl)
2799           && !(TREE_ASM_WRITTEN (decl) || DECL_SAVED_TREE (decl)
2800                /* An explicit instantiation can be used to specify
2801                   that the body is in another unit. It will have
2802                   already verified there was a definition.  */
2803                || DECL_EXPLICIT_INSTANTIATION (decl)))
2804         {
2805           cp_warning_at ("inline function `%D' used but never defined", decl);
2806           /* This symbol is effectively an "extern" declaration now.
2807              This is not strictly necessary, but removes a duplicate
2808              warning.  */
2809           TREE_PUBLIC (decl) = 1;
2810         }
2811
2812     }
2813
2814   /* We give C linkage to static constructors and destructors.  */
2815   push_lang_context (lang_name_c);
2816
2817   /* Generate initialization and destruction functions for all
2818      priorities for which they are required.  */
2819   if (priority_info_map)
2820     splay_tree_foreach (priority_info_map,
2821                         generate_ctor_and_dtor_functions_for_priority,
2822                         /*data=*/&locus);
2823   else
2824     {
2825
2826       if (static_ctors)
2827         generate_ctor_or_dtor_function (/*constructor_p=*/true,
2828                                         DEFAULT_INIT_PRIORITY, &locus);
2829       if (static_dtors)
2830         generate_ctor_or_dtor_function (/*constructor_p=*/false,
2831                                         DEFAULT_INIT_PRIORITY, &locus);
2832     }
2833
2834   /* We're done with the splay-tree now.  */
2835   if (priority_info_map)
2836     splay_tree_delete (priority_info_map);
2837
2838   /* We're done with static constructors, so we can go back to "C++"
2839      linkage now.  */
2840   pop_lang_context ();
2841
2842   if (flag_unit_at_a_time)
2843     {
2844       cgraph_finalize_compilation_unit ();
2845       cgraph_optimize ();
2846     }
2847
2848   /* Now, issue warnings about static, but not defined, functions,
2849      etc., and emit debugging information.  */
2850   walk_namespaces (wrapup_globals_for_namespace, /*data=*/&reconsider);
2851   if (pending_statics)
2852     check_global_declarations (&VARRAY_TREE (pending_statics, 0),
2853                                pending_statics_used);
2854
2855   finish_repo ();
2856
2857   /* The entire file is now complete.  If requested, dump everything
2858      to a file.  */
2859   {
2860     int flags;
2861     FILE *stream = dump_begin (TDI_all, &flags);
2862
2863     if (stream)
2864       {
2865         dump_node (global_namespace, flags & ~TDF_SLIM, stream);
2866         dump_end (TDI_all, stream);
2867       }
2868   }
2869
2870   timevar_pop (TV_VARCONST);
2871
2872   if (flag_detailed_statistics)
2873     {
2874       dump_tree_statistics ();
2875       dump_time_statistics ();
2876     }
2877   input_location = locus;
2878
2879 #ifdef ENABLE_CHECKING
2880   validate_conversion_obstack ();
2881 #endif /* ENABLE_CHECKING */
2882 }
2883
2884 /* FN is an OFFSET_REF, DOTSTAR_EXPR or MEMBER_REF indicating the
2885    function to call in parse-tree form; it has not yet been
2886    semantically analyzed.  ARGS are the arguments to the function.
2887    They have already been semantically analyzed.  */
2888
2889 tree
2890 build_offset_ref_call_from_tree (tree fn, tree args)
2891 {
2892   tree orig_fn;
2893   tree orig_args;
2894   tree expr;
2895   tree object;
2896
2897   orig_fn = fn;
2898   orig_args = args;
2899   object = TREE_OPERAND (fn, 0);
2900
2901   if (processing_template_decl)
2902     {
2903       my_friendly_assert (TREE_CODE (fn) == DOTSTAR_EXPR
2904                           || TREE_CODE (fn) == MEMBER_REF,
2905                           20030708);
2906       if (type_dependent_expression_p (fn)
2907           || any_type_dependent_arguments_p (args))
2908         return build_min_nt (CALL_EXPR, fn, args);
2909
2910       /* Transform the arguments and add the implicit "this"
2911          parameter.  That must be done before the FN is transformed
2912          because we depend on the form of FN.  */
2913       args = build_non_dependent_args (args);
2914       if (TREE_CODE (fn) == DOTSTAR_EXPR)
2915         object = build_unary_op (ADDR_EXPR, object, 0);
2916       object = build_non_dependent_expr (object);
2917       args = tree_cons (NULL_TREE, object, args);
2918       /* Now that the arguments are done, transform FN.  */
2919       fn = build_non_dependent_expr (fn);
2920     }
2921
2922   /* A qualified name corresponding to a bound pointer-to-member is
2923      represented as an OFFSET_REF:
2924
2925         struct B { void g(); };
2926         void (B::*p)();
2927         void B::g() { (this->*p)(); }  */
2928   if (TREE_CODE (fn) == OFFSET_REF)
2929     {
2930       tree object_addr = build_unary_op (ADDR_EXPR, object, 0);
2931       fn = TREE_OPERAND (fn, 1);
2932       fn = get_member_function_from_ptrfunc (&object_addr, fn);
2933       args = tree_cons (NULL_TREE, object_addr, args);
2934     }
2935
2936   expr = build_function_call (fn, args);
2937   if (processing_template_decl && expr != error_mark_node)
2938     return build_min_non_dep (CALL_EXPR, expr, orig_fn, orig_args);
2939   return expr;
2940 }
2941
2942
2943 void
2944 check_default_args (tree x)
2945 {
2946   tree arg = TYPE_ARG_TYPES (TREE_TYPE (x));
2947   bool saw_def = false;
2948   int i = 0 - (TREE_CODE (TREE_TYPE (x)) == METHOD_TYPE);
2949   for (; arg && arg != void_list_node; arg = TREE_CHAIN (arg), ++i)
2950     {
2951       if (TREE_PURPOSE (arg))
2952         saw_def = true;
2953       else if (saw_def)
2954         {
2955           cp_error_at ("default argument missing for parameter %P of `%+#D'",
2956                        i, x);
2957           break;
2958         }
2959     }
2960 }
2961
2962 void
2963 mark_used (tree decl)
2964 {
2965   TREE_USED (decl) = 1;
2966   if (processing_template_decl || skip_evaluation)
2967     return;
2968
2969   if (TREE_CODE (decl) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (decl)
2970       && !TREE_ASM_WRITTEN (decl))
2971     /* Remember it, so we can check it was defined.  */
2972     defer_fn (decl);
2973
2974   assemble_external (decl);
2975
2976   /* Is it a synthesized method that needs to be synthesized?  */
2977   if (TREE_CODE (decl) == FUNCTION_DECL
2978       && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)
2979       && DECL_ARTIFICIAL (decl)
2980       && !DECL_THUNK_P (decl)
2981       && ! DECL_INITIAL (decl)
2982       /* Kludge: don't synthesize for default args.  */
2983       && current_function_decl)
2984     {
2985       synthesize_method (decl);
2986       /* If we've already synthesized the method we don't need to
2987          instantiate it, so we can return right away.  */
2988       return;
2989     }
2990
2991   /* If this is a function or variable that is an instance of some
2992      template, we now know that we will need to actually do the
2993      instantiation. We check that DECL is not an explicit
2994      instantiation because that is not checked in instantiate_decl.  */
2995   if ((DECL_NON_THUNK_FUNCTION_P (decl) || TREE_CODE (decl) == VAR_DECL)
2996       && DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)
2997       && (!DECL_EXPLICIT_INSTANTIATION (decl)
2998           || (TREE_CODE (decl) == FUNCTION_DECL
2999               && DECL_INLINE (DECL_TEMPLATE_RESULT
3000                               (template_for_substitution (decl))))))
3001     {
3002       bool defer;
3003
3004       /* Normally, we put off instantiating functions in order to
3005          improve compile times.  Maintaining a stack of active
3006          functions is expensive, and the inliner knows to
3007          instantiate any functions it might need.
3008
3009          However, if instantiating this function might help us mark
3010          the current function TREE_NOTHROW, we go ahead and
3011          instantiate it now.
3012
3013          This is not needed for unit-at-a-time since we reorder the functions
3014          in topological order anyway.
3015          */
3016       defer = (!flag_exceptions
3017                || flag_unit_at_a_time
3018                || !optimize
3019                || TREE_CODE (decl) != FUNCTION_DECL
3020                /* If the called function can't throw, we don't need to
3021                   generate its body to find that out.  */
3022                || TREE_NOTHROW (decl)
3023                || !cfun
3024                /* If we already know the current function can't throw,
3025                   then we don't need to work hard to prove it.  */
3026                || TREE_NOTHROW (current_function_decl)
3027                /* If we already know that the current function *can*
3028                   throw, there's no point in gathering more
3029                   information.  */
3030                || cp_function_chain->can_throw);
3031
3032       instantiate_decl (decl, defer);
3033     }
3034 }
3035
3036 #include "gt-cp-decl2.h"