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