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, 2005, 2007  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 3, 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 COPYING3.  If not see
  20 <http://www.gnu.org/licenses/>.  */
  21
  22
  23 /* Process declarations and symbol lookup for C++ front end.
  24    Also constructs types; the standard scalar types at initialization,
  25    and structure, union, array and enum types when they are declared.  */
  26
  27 /* ??? not all decl nodes are given the most useful possible
  28    line numbers.  For example, the CONST_DECLs for enum values.  */
  29
  30 #include "config.h"
  31 #include "system.h"
  32 #include "coretypes.h"
  33 #include "tm.h"
  34 #include "tree.h"
  35 #include "rtl.h"
  36 #include "expr.h"
  37 #include "flags.h"
  38 #include "cp-tree.h"
  39 #include "decl.h"
  40 #include "output.h"
  41 #include "except.h"
  42 #include "toplev.h"
  43 #include "timevar.h"
  44 #include "cpplib.h"
  45 #include "target.h"
  46 #include "c-common.h"
  47 #include "tree-mudflap.h"
  48 #include "cgraph.h"
  49 #include "tree-inline.h"
  50 #include "c-pragma.h"
  51 #include "tree-dump.h"
  52 #include "intl.h"
  53
  54 extern cpp_reader *parse_in;
  55
  56 /* This structure contains information about the initializations
  57    and/or destructions required for a particular priority level.  */
  58 typedef struct priority_info_s {
  59   /* Nonzero if there have been any initializations at this priority
  60      throughout the translation unit.  */
  61   int initializations_p;
  62   /* Nonzero if there have been any destructions at this priority
  63      throughout the translation unit.  */
  64   int destructions_p;
  65 } *priority_info;
  66
  67 static void mark_vtable_entries (tree);
  68 static bool maybe_emit_vtables (tree);
  69 static bool acceptable_java_type (tree);
  70 static tree start_objects (int, int);
  71 static void finish_objects (int, int, tree);
  72 static tree start_static_storage_duration_function (unsigned);
  73 static void finish_static_storage_duration_function (tree);
  74 static priority_info get_priority_info (int);
  75 static void do_static_initialization_or_destruction (tree, bool);
  76 static void one_static_initialization_or_destruction (tree, tree, bool);
  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 static void determine_visibility_from_class (tree, tree);
  85
  86 /* A list of static class variables.  This is needed, because a
  87    static class variable can be declared inside the class without
  88    an initializer, and then initialized, statically, outside the class.  */
  89 static GTY(()) VEC(tree,gc) *pending_statics;
  90
  91 /* A list of functions which were declared inline, but which we
  92    may need to emit outline anyway.  */
  93 static GTY(()) VEC(tree,gc) *deferred_fns;
  94
  95 /* Nonzero if we're done parsing and into end-of-file activities.  */
  96
  97 int at_eof;
  98
  99 \f
 100
 101 /* Return a member function type (a METHOD_TYPE), given FNTYPE (a
 102    FUNCTION_TYPE), CTYPE (class type), and QUALS (the cv-qualifiers
 103    that apply to the function).  */
 104
 105 tree
 106 build_memfn_type (tree fntype, tree ctype, cp_cv_quals quals)
 107 {
 108   tree raises;
 109   int type_quals;
 110
 111   if (fntype == error_mark_node || ctype == error_mark_node)
 112     return error_mark_node;
 113
 114   type_quals = quals & ~TYPE_QUAL_RESTRICT;
 115   ctype = cp_build_qualified_type (ctype, type_quals);
 116   fntype = build_method_type_directly (ctype, TREE_TYPE (fntype),
 117                                        (TREE_CODE (fntype) == METHOD_TYPE
 118                                         ? TREE_CHAIN (TYPE_ARG_TYPES (fntype))
 119                                         : TYPE_ARG_TYPES (fntype)));
 120   raises = TYPE_RAISES_EXCEPTIONS (fntype);
 121   if (raises)
 122     fntype = build_exception_variant (fntype, raises);
 123
 124   return fntype;
 125 }
 126
 127 /* Build a PARM_DECL with NAME and TYPE, and set DECL_ARG_TYPE
 128    appropriately.  */
 129
 130 tree
 131 cp_build_parm_decl (tree name, tree type)
 132 {
 133   tree parm = build_decl (PARM_DECL, name, type);
 134   /* DECL_ARG_TYPE is only used by the back end and the back end never
 135      sees templates.  */
 136   if (!processing_template_decl)
 137     DECL_ARG_TYPE (parm) = type_passed_as (type);
 138
 139   /* If the type is a pack expansion, then we have a function
 140      parameter pack. */
 141   if (type && TREE_CODE (type) == TYPE_PACK_EXPANSION)
 142     FUNCTION_PARAMETER_PACK_P (parm) = 1;
 143
 144   return parm;
 145 }
 146
 147 /* Returns a PARM_DECL for a parameter of the indicated TYPE, with the
 148    indicated NAME.  */
 149
 150 tree
 151 build_artificial_parm (tree name, tree type)
 152 {
 153   tree parm = cp_build_parm_decl (name, type);
 154   DECL_ARTIFICIAL (parm) = 1;
 155   /* All our artificial parms are implicitly `const'; they cannot be
 156      assigned to.  */
 157   TREE_READONLY (parm) = 1;
 158   return parm;
 159 }
 160
 161 /* Constructors for types with virtual baseclasses need an "in-charge" flag
 162    saying whether this constructor is responsible for initialization of
 163    virtual baseclasses or not.  All destructors also need this "in-charge"
 164    flag, which additionally determines whether or not the destructor should
 165    free the memory for the object.
 166
 167    This function adds the "in-charge" flag to member function FN if
 168    appropriate.  It is called from grokclassfn and tsubst.
 169    FN must be either a constructor or destructor.
 170
 171    The in-charge flag follows the 'this' parameter, and is followed by the
 172    VTT parm (if any), then the user-written parms.  */
 173
 174 void
 175 maybe_retrofit_in_chrg (tree fn)
 176 {
 177   tree basetype, arg_types, parms, parm, fntype;
 178
 179   /* If we've already add the in-charge parameter don't do it again.  */
 180   if (DECL_HAS_IN_CHARGE_PARM_P (fn))
 181     return;
 182
 183   /* When processing templates we can't know, in general, whether or
 184      not we're going to have virtual baseclasses.  */
 185   if (processing_template_decl)
 186     return;
 187
 188   /* We don't need an in-charge parameter for constructors that don't
 189      have virtual bases.  */
 190   if (DECL_CONSTRUCTOR_P (fn)
 191       && !CLASSTYPE_VBASECLASSES (DECL_CONTEXT (fn)))
 192     return;
 193
 194   arg_types = TYPE_ARG_TYPES (TREE_TYPE (fn));
 195   basetype = TREE_TYPE (TREE_VALUE (arg_types));
 196   arg_types = TREE_CHAIN (arg_types);
 197
 198   parms = TREE_CHAIN (DECL_ARGUMENTS (fn));
 199
 200   /* If this is a subobject constructor or destructor, our caller will
 201      pass us a pointer to our VTT.  */
 202   if (CLASSTYPE_VBASECLASSES (DECL_CONTEXT (fn)))
 203     {
 204       parm = build_artificial_parm (vtt_parm_identifier, vtt_parm_type);
 205
 206       /* First add it to DECL_ARGUMENTS between 'this' and the real args...  */
 207       TREE_CHAIN (parm) = parms;
 208       parms = parm;
 209
 210       /* ...and then to TYPE_ARG_TYPES.  */
 211       arg_types = hash_tree_chain (vtt_parm_type, arg_types);
 212
 213       DECL_HAS_VTT_PARM_P (fn) = 1;
 214     }
 215
 216   /* Then add the in-charge parm (before the VTT parm).  */
 217   parm = build_artificial_parm (in_charge_identifier, integer_type_node);
 218   TREE_CHAIN (parm) = parms;
 219   parms = parm;
 220   arg_types = hash_tree_chain (integer_type_node, arg_types);
 221
 222   /* Insert our new parameter(s) into the list.  */
 223   TREE_CHAIN (DECL_ARGUMENTS (fn)) = parms;
 224
 225   /* And rebuild the function type.  */
 226   fntype = build_method_type_directly (basetype, TREE_TYPE (TREE_TYPE (fn)),
 227                                        arg_types);
 228   if (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)))
 229     fntype = build_exception_variant (fntype,
 230                                       TYPE_RAISES_EXCEPTIONS (TREE_TYPE (fn)));
 231   TREE_TYPE (fn) = fntype;
 232
 233   /* Now we've got the in-charge parameter.  */
 234   DECL_HAS_IN_CHARGE_PARM_P (fn) = 1;
 235 }
 236
 237 /* Classes overload their constituent function names automatically.
 238    When a function name is declared in a record structure,
 239    its name is changed to it overloaded name.  Since names for
 240    constructors and destructors can conflict, we place a leading
 241    '$' for destructors.
 242
 243    CNAME is the name of the class we are grokking for.
 244
 245    FUNCTION is a FUNCTION_DECL.  It was created by `grokdeclarator'.
 246
 247    FLAGS contains bits saying what's special about today's
 248    arguments.  1 == DESTRUCTOR.  2 == OPERATOR.
 249
 250    If FUNCTION is a destructor, then we must add the `auto-delete' field
 251    as a second parameter.  There is some hair associated with the fact
 252    that we must "declare" this variable in the manner consistent with the
 253    way the rest of the arguments were declared.
 254
 255    QUALS are the qualifiers for the this pointer.  */
 256
 257 void
 258 grokclassfn (tree ctype, tree function, enum overload_flags flags)
 259 {
 260   tree fn_name = DECL_NAME (function);
 261
 262   /* Even within an `extern "C"' block, members get C++ linkage.  See
 263      [dcl.link] for details.  */
 264   SET_DECL_LANGUAGE (function, lang_cplusplus);
 265
 266   if (fn_name == NULL_TREE)
 267     {
 268       error ("name missing for member function");
 269       fn_name = get_identifier ("<anonymous>");
 270       DECL_NAME (function) = fn_name;
 271     }
 272
 273   DECL_CONTEXT (function) = ctype;
 274
 275   if (flags == DTOR_FLAG)
 276     DECL_DESTRUCTOR_P (function) = 1;
 277
 278   if (flags == DTOR_FLAG || DECL_CONSTRUCTOR_P (function))
 279     maybe_retrofit_in_chrg (function);
 280 }
 281
 282 /* Create an ARRAY_REF, checking for the user doing things backwards
 283    along the way.  */
 284
 285 tree
 286 grok_array_decl (tree array_expr, tree index_exp)
 287 {
 288   tree type;
 289   tree expr;
 290   tree orig_array_expr = array_expr;
 291   tree orig_index_exp = index_exp;
 292
 293   if (error_operand_p (array_expr) || error_operand_p (index_exp))
 294     return error_mark_node;
 295
 296   if (processing_template_decl)
 297     {
 298       if (type_dependent_expression_p (array_expr)
 299           || type_dependent_expression_p (index_exp))
 300         return build_min_nt (ARRAY_REF, array_expr, index_exp,
 301                              NULL_TREE, NULL_TREE);
 302       array_expr = build_non_dependent_expr (array_expr);
 303       index_exp = build_non_dependent_expr (index_exp);
 304     }
 305
 306   type = TREE_TYPE (array_expr);
 307   gcc_assert (type);
 308   type = non_reference (type);
 309
 310   /* If they have an `operator[]', use that.  */
 311   if (IS_AGGR_TYPE (type) || IS_AGGR_TYPE (TREE_TYPE (index_exp)))
 312     expr = build_new_op (ARRAY_REF, LOOKUP_NORMAL,
 313                          array_expr, index_exp, NULL_TREE,
 314                          /*overloaded_p=*/NULL);
 315   else
 316     {
 317       tree p1, p2, i1, i2;
 318
 319       /* Otherwise, create an ARRAY_REF for a pointer or array type.
 320          It is a little-known fact that, if `a' is an array and `i' is
 321          an int, you can write `i[a]', which means the same thing as
 322          `a[i]'.  */
 323       if (TREE_CODE (type) == ARRAY_TYPE)
 324         p1 = array_expr;
 325       else
 326         p1 = build_expr_type_conversion (WANT_POINTER, array_expr, false);
 327
 328       if (TREE_CODE (TREE_TYPE (index_exp)) == ARRAY_TYPE)
 329         p2 = index_exp;
 330       else
 331         p2 = build_expr_type_conversion (WANT_POINTER, index_exp, false);
 332
 333       i1 = build_expr_type_conversion (WANT_INT | WANT_ENUM, array_expr,
 334                                        false);
 335       i2 = build_expr_type_conversion (WANT_INT | WANT_ENUM, index_exp,
 336                                        false);
 337
 338       if ((p1 && i2) && (i1 && p2))
 339         error ("ambiguous conversion for array subscript");
 340
 341       if (p1 && i2)
 342         array_expr = p1, index_exp = i2;
 343       else if (i1 && p2)
 344         array_expr = p2, index_exp = i1;
 345       else
 346         {
 347           error ("invalid types %<%T[%T]%> for array subscript",
 348                  type, TREE_TYPE (index_exp));
 349           return error_mark_node;
 350         }
 351
 352       if (array_expr == error_mark_node || index_exp == error_mark_node)
 353         error ("ambiguous conversion for array subscript");
 354
 355       expr = build_array_ref (array_expr, index_exp);
 356     }
 357   if (processing_template_decl && expr != error_mark_node)
 358     return build_min_non_dep (ARRAY_REF, expr, orig_array_expr, orig_index_exp,
 359                               NULL_TREE, NULL_TREE);
 360   return expr;
 361 }
 362
 363 /* Given the cast expression EXP, checking out its validity.   Either return
 364    an error_mark_node if there was an unavoidable error, return a cast to
 365    void for trying to delete a pointer w/ the value 0, or return the
 366    call to delete.  If DOING_VEC is true, we handle things differently
 367    for doing an array delete.
 368    Implements ARM $5.3.4.  This is called from the parser.  */
 369
 370 tree
 371 delete_sanity (tree exp, tree size, bool doing_vec, int use_global_delete)
 372 {
 373   tree t, type;
 374
 375   if (exp == error_mark_node)
 376     return exp;
 377
 378   if (processing_template_decl)
 379     {
 380       t = build_min (DELETE_EXPR, void_type_node, exp, size);
 381       DELETE_EXPR_USE_GLOBAL (t) = use_global_delete;
 382       DELETE_EXPR_USE_VEC (t) = doing_vec;
 383       TREE_SIDE_EFFECTS (t) = 1;
 384       return t;
 385     }
 386
 387   /* An array can't have been allocated by new, so complain.  */
 388   if (TREE_CODE (exp) == VAR_DECL
 389       && TREE_CODE (TREE_TYPE (exp)) == ARRAY_TYPE)
 390     warning (0, "deleting array %q#D", exp);
 391
 392   t = build_expr_type_conversion (WANT_POINTER, exp, true);
 393
 394   if (t == NULL_TREE || t == error_mark_node)
 395     {
 396       error ("type %q#T argument given to %<delete%>, expected pointer",
 397              TREE_TYPE (exp));
 398       return error_mark_node;
 399     }
 400
 401   type = TREE_TYPE (t);
 402
 403   /* As of Valley Forge, you can delete a pointer to const.  */
 404
 405   /* You can't delete functions.  */
 406   if (TREE_CODE (TREE_TYPE (type)) == FUNCTION_TYPE)
 407     {
 408       error ("cannot delete a function.  Only pointer-to-objects are "
 409              "valid arguments to %<delete%>");
 410       return error_mark_node;
 411     }
 412
 413   /* Deleting ptr to void is undefined behavior [expr.delete/3].  */
 414   if (TREE_CODE (TREE_TYPE (type)) == VOID_TYPE)
 415     {
 416       warning (0, "deleting %qT is undefined", type);
 417       doing_vec = 0;
 418     }
 419
 420   /* Deleting a pointer with the value zero is valid and has no effect.  */
 421   if (integer_zerop (t))
 422     return build1 (NOP_EXPR, void_type_node, t);
 423
 424   if (doing_vec)
 425     return build_vec_delete (t, /*maxindex=*/NULL_TREE,
 426                              sfk_deleting_destructor,
 427                              use_global_delete);
 428   else
 429     return build_delete (type, t, sfk_deleting_destructor,
 430                          LOOKUP_NORMAL, use_global_delete);
 431 }
 432
 433 /* Report an error if the indicated template declaration is not the
 434    sort of thing that should be a member template.  */
 435
 436 void
 437 check_member_template (tree tmpl)
 438 {
 439   tree decl;
 440
 441   gcc_assert (TREE_CODE (tmpl) == TEMPLATE_DECL);
 442   decl = DECL_TEMPLATE_RESULT (tmpl);
 443
 444   if (TREE_CODE (decl) == FUNCTION_DECL
 445       || (TREE_CODE (decl) == TYPE_DECL
 446           && IS_AGGR_TYPE (TREE_TYPE (decl))))
 447     {
 448       /* The parser rejects template declarations in local classes.  */
 449       gcc_assert (!current_function_decl);
 450       /* The parser rejects any use of virtual in a function template.  */
 451       gcc_assert (!(TREE_CODE (decl) == FUNCTION_DECL
 452                     && DECL_VIRTUAL_P (decl)));
 453
 454       /* The debug-information generating code doesn't know what to do
 455          with member templates.  */
 456       DECL_IGNORED_P (tmpl) = 1;
 457     }
 458   else
 459     error ("template declaration of %q#D", decl);
 460 }
 461
 462 /* Return true iff TYPE is a valid Java parameter or return type.  */
 463
 464 static bool
 465 acceptable_java_type (tree type)
 466 {
 467   if (type == error_mark_node)
 468     return false;
 469
 470   if (TREE_CODE (type) == VOID_TYPE || TYPE_FOR_JAVA (type))
 471     return true;
 472   if (TREE_CODE (type) == POINTER_TYPE || TREE_CODE (type) == REFERENCE_TYPE)
 473     {
 474       type = TREE_TYPE (type);
 475       if (TREE_CODE (type) == RECORD_TYPE)
 476         {
 477           tree args;  int i;
 478           if (! TYPE_FOR_JAVA (type))
 479             return false;
 480           if (! CLASSTYPE_TEMPLATE_INFO (type))
 481             return true;
 482           args = CLASSTYPE_TI_ARGS (type);
 483           i = TREE_VEC_LENGTH (args);
 484           while (--i >= 0)
 485             {
 486               type = TREE_VEC_ELT (args, i);
 487               if (TREE_CODE (type) == POINTER_TYPE)
 488                 type = TREE_TYPE (type);
 489               if (! TYPE_FOR_JAVA (type))
 490                 return false;
 491             }
 492           return true;
 493         }
 494     }
 495   return false;
 496 }
 497
 498 /* For a METHOD in a Java class CTYPE, return true if
 499    the parameter and return types are valid Java types.
 500    Otherwise, print appropriate error messages, and return false.  */
 501
 502 bool
 503 check_java_method (tree method)
 504 {
 505   bool jerr = false;
 506   tree arg_types = TYPE_ARG_TYPES (TREE_TYPE (method));
 507   tree ret_type = TREE_TYPE (TREE_TYPE (method));
 508
 509   if (!acceptable_java_type (ret_type))
 510     {
 511       error ("Java method %qD has non-Java return type %qT",
 512              method, ret_type);
 513       jerr = true;
 514     }
 515
 516   arg_types = TREE_CHAIN (arg_types);
 517   if (DECL_HAS_IN_CHARGE_PARM_P (method))
 518     arg_types = TREE_CHAIN (arg_types);
 519   if (DECL_HAS_VTT_PARM_P (method))
 520     arg_types = TREE_CHAIN (arg_types);
 521
 522   for (; arg_types != NULL_TREE; arg_types = TREE_CHAIN (arg_types))
 523     {
 524       tree type = TREE_VALUE (arg_types);
 525       if (!acceptable_java_type (type))
 526         {
 527           if (type != error_mark_node)
 528             error ("Java method %qD has non-Java parameter type %qT",
 529                    method, type);
 530           jerr = true;
 531         }
 532     }
 533   return !jerr;
 534 }
 535
 536 /* Sanity check: report error if this function FUNCTION is not
 537    really a member of the class (CTYPE) it is supposed to belong to.
 538    TEMPLATE_PARMS is used to specify the template parameters of a member
 539    template passed as FUNCTION_DECL. If the member template is passed as a
 540    TEMPLATE_DECL, it can be NULL since the parameters can be extracted
 541    from the declaration. If the function is not a function template, it
 542    must be NULL.
 543    It returns the original declaration for the function, NULL_TREE if
 544    no declaration was found, error_mark_node if an error was emitted.  */
 545
 546 tree
 547 check_classfn (tree ctype, tree function, tree template_parms)
 548 {
 549   int ix;
 550   bool is_template;
 551   tree pushed_scope;
 552
 553   if (DECL_USE_TEMPLATE (function)
 554       && !(TREE_CODE (function) == TEMPLATE_DECL
 555            && DECL_TEMPLATE_SPECIALIZATION (function))
 556       && DECL_MEMBER_TEMPLATE_P (DECL_TI_TEMPLATE (function)))
 557     /* Since this is a specialization of a member template,
 558        we're not going to find the declaration in the class.
 559        For example, in:
 560
 561          struct S { template <typename T> void f(T); };
 562          template <> void S::f(int);
 563
 564        we're not going to find `S::f(int)', but there's no
 565        reason we should, either.  We let our callers know we didn't
 566        find the method, but we don't complain.  */
 567     return NULL_TREE;
 568
 569   /* Basic sanity check: for a template function, the template parameters
 570      either were not passed, or they are the same of DECL_TEMPLATE_PARMS.  */
 571   if (TREE_CODE (function) == TEMPLATE_DECL)
 572     {
 573       gcc_assert (!template_parms
 574                   || comp_template_parms (template_parms,
 575                                           DECL_TEMPLATE_PARMS (function)));
 576       template_parms = DECL_TEMPLATE_PARMS (function);
 577     }
 578
 579   /* OK, is this a definition of a member template?  */
 580   is_template = (template_parms != NULL_TREE);
 581
 582   /* We must enter the scope here, because conversion operators are
 583      named by target type, and type equivalence relies on typenames
 584      resolving within the scope of CTYPE.  */
 585   pushed_scope = push_scope (ctype);
 586   ix = class_method_index_for_fn (complete_type (ctype), function);
 587   if (ix >= 0)
 588     {
 589       VEC(tree,gc) *methods = CLASSTYPE_METHOD_VEC (ctype);
 590       tree fndecls, fndecl = 0;
 591       bool is_conv_op;
 592       const char *format = NULL;
 593
 594       for (fndecls = VEC_index (tree, methods, ix);
 595            fndecls; fndecls = OVL_NEXT (fndecls))
 596         {
 597           tree p1, p2;
 598
 599           fndecl = OVL_CURRENT (fndecls);
 600           p1 = TYPE_ARG_TYPES (TREE_TYPE (function));
 601           p2 = TYPE_ARG_TYPES (TREE_TYPE (fndecl));
 602
 603           /* We cannot simply call decls_match because this doesn't
 604              work for static member functions that are pretending to
 605              be methods, and because the name may have been changed by
 606              asm("new_name").  */
 607
 608            /* Get rid of the this parameter on functions that become
 609               static.  */
 610           if (DECL_STATIC_FUNCTION_P (fndecl)
 611               && TREE_CODE (TREE_TYPE (function)) == METHOD_TYPE)
 612             p1 = TREE_CHAIN (p1);
 613
 614           /* A member template definition only matches a member template
 615              declaration.  */
 616           if (is_template != (TREE_CODE (fndecl) == TEMPLATE_DECL))
 617             continue;
 618
 619           if (same_type_p (TREE_TYPE (TREE_TYPE (function)),
 620                            TREE_TYPE (TREE_TYPE (fndecl)))
 621               && compparms (p1, p2)
 622               && (!is_template
 623                   || comp_template_parms (template_parms,
 624                                           DECL_TEMPLATE_PARMS (fndecl)))
 625               && (DECL_TEMPLATE_SPECIALIZATION (function)
 626                   == DECL_TEMPLATE_SPECIALIZATION (fndecl))
 627               && (!DECL_TEMPLATE_SPECIALIZATION (function)
 628                   || (DECL_TI_TEMPLATE (function)
 629                       == DECL_TI_TEMPLATE (fndecl))))
 630             break;
 631         }
 632       if (fndecls)
 633         {
 634           if (pushed_scope)
 635             pop_scope (pushed_scope);
 636           return OVL_CURRENT (fndecls);
 637         }
 638
 639       error ("prototype for %q#D does not match any in class %qT",
 640              function, ctype);
 641       is_conv_op = DECL_CONV_FN_P (fndecl);
 642
 643       if (is_conv_op)
 644         ix = CLASSTYPE_FIRST_CONVERSION_SLOT;
 645       fndecls = VEC_index (tree, methods, ix);
 646       while (fndecls)
 647         {
 648           fndecl = OVL_CURRENT (fndecls);
 649           fndecls = OVL_NEXT (fndecls);
 650
 651           if (!fndecls && is_conv_op)
 652             {
 653               if (VEC_length (tree, methods) > (size_t) ++ix)
 654                 {
 655                   fndecls = VEC_index (tree, methods, ix);
 656                   if (!DECL_CONV_FN_P (OVL_CURRENT (fndecls)))
 657                     {
 658                       fndecls = NULL_TREE;
 659                       is_conv_op = false;
 660                     }
 661                 }
 662               else
 663                 is_conv_op = false;
 664             }
 665           if (format)
 666             format = "                %+#D";
 667           else if (fndecls)
 668             format = N_("candidates are: %+#D");
 669           else
 670             format = N_("candidate is: %+#D");
 671           error (format, fndecl);
 672         }
 673     }
 674   else if (!COMPLETE_TYPE_P (ctype))
 675     cxx_incomplete_type_error (function, ctype);
 676   else
 677     error ("no %q#D member function declared in class %qT",
 678            function, ctype);
 679
 680   if (pushed_scope)
 681     pop_scope (pushed_scope);
 682   return error_mark_node;
 683 }
 684
 685 /* DECL is a function with vague linkage.  Remember it so that at the
 686    end of the translation unit we can decide whether or not to emit
 687    it.  */
 688
 689 void
 690 note_vague_linkage_fn (tree decl)
 691 {
 692   if (!DECL_DEFERRED_FN (decl))
 693     {
 694       DECL_DEFERRED_FN (decl) = 1;
 695       DECL_DEFER_OUTPUT (decl) = 1;
 696       VEC_safe_push (tree, gc, deferred_fns, decl);
 697     }
 698 }
 699
 700 /* We have just processed the DECL, which is a static data member.
 701    The other parameters are as for cp_finish_decl.  */
 702
 703 void
 704 finish_static_data_member_decl (tree decl,
 705                                 tree init, bool init_const_expr_p,
 706                                 tree asmspec_tree,
 707                                 int flags)
 708 {
 709   DECL_CONTEXT (decl) = current_class_type;
 710
 711   /* We cannot call pushdecl here, because that would fill in the
 712      TREE_CHAIN of our decl.  Instead, we modify cp_finish_decl to do
 713      the right thing, namely, to put this decl out straight away.  */
 714
 715   if (! processing_template_decl)
 716     VEC_safe_push (tree, gc, pending_statics, decl);
 717
 718   if (LOCAL_CLASS_P (current_class_type))
 719     pedwarn ("local class %q#T shall not have static data member %q#D",
 720              current_class_type, decl);
 721
 722   /* Static consts need not be initialized in the class definition.  */
 723   if (init != NULL_TREE && TYPE_NEEDS_CONSTRUCTING (TREE_TYPE (decl)))
 724     {
 725       static int explained = 0;
 726
 727       error ("initializer invalid for static member with constructor");
 728       if (!explained)
 729         {
 730           error ("(an out of class initialization is required)");
 731           explained = 1;
 732         }
 733       init = NULL_TREE;
 734     }
 735   /* Force the compiler to know when an uninitialized static const
 736      member is being used.  */
 737   if (CP_TYPE_CONST_P (TREE_TYPE (decl)) && init == 0)
 738     TREE_USED (decl) = 1;
 739   DECL_INITIAL (decl) = init;
 740   DECL_IN_AGGR_P (decl) = 1;
 741
 742   cp_finish_decl (decl, init, init_const_expr_p, asmspec_tree, flags);
 743 }
 744
 745 /* DECLARATOR and DECLSPECS correspond to a class member.  The other
 746    parameters are as for cp_finish_decl.  Return the DECL for the
 747    class member declared.  */
 748
 749 tree
 750 grokfield (const cp_declarator *declarator,
 751            cp_decl_specifier_seq *declspecs,
 752            tree init, bool init_const_expr_p,
 753            tree asmspec_tree,
 754            tree attrlist)
 755 {
 756   tree value;
 757   const char *asmspec = 0;
 758   int flags = LOOKUP_ONLYCONVERTING;
 759
 760   if (init
 761       && TREE_CODE (init) == TREE_LIST
 762       && TREE_VALUE (init) == error_mark_node
 763       && TREE_CHAIN (init) == NULL_TREE)
 764     init = NULL_TREE;
 765
 766   value = grokdeclarator (declarator, declspecs, FIELD, init != 0, &attrlist);
 767   if (! value || error_operand_p (value))
 768     /* friend or constructor went bad.  */
 769     return error_mark_node;
 770
 771   if (TREE_CODE (value) == TYPE_DECL && init)
 772     {
 773       error ("typedef %qD is initialized (use __typeof__ instead)", value);
 774       init = NULL_TREE;
 775     }
 776
 777   /* Pass friendly classes back.  */
 778   if (value == void_type_node)
 779     return value;
 780
 781   /* Pass friend decls back.  */
 782   if ((TREE_CODE (value) == FUNCTION_DECL
 783        || TREE_CODE (value) == TEMPLATE_DECL)
 784       && DECL_CONTEXT (value) != current_class_type)
 785     return value;
 786
 787   if (DECL_NAME (value) != NULL_TREE
 788       && IDENTIFIER_POINTER (DECL_NAME (value))[0] == '_'
 789       && ! strcmp (IDENTIFIER_POINTER (DECL_NAME (value)), "_vptr"))
 790     error ("member %qD conflicts with virtual function table field name",
 791            value);
 792
 793   /* Stash away type declarations.  */
 794   if (TREE_CODE (value) == TYPE_DECL)
 795     {
 796       DECL_NONLOCAL (value) = 1;
 797       DECL_CONTEXT (value) = current_class_type;
 798
 799       if (processing_template_decl)
 800         value = push_template_decl (value);
 801
 802       if (attrlist)
 803         cplus_decl_attributes (&value, attrlist, 0);
 804
 805       return value;
 806     }
 807
 808   if (DECL_IN_AGGR_P (value))
 809     {
 810       error ("%qD is already defined in %qT", value, DECL_CONTEXT (value));
 811       return void_type_node;
 812     }
 813
 814   if (asmspec_tree && asmspec_tree != error_mark_node)
 815     asmspec = TREE_STRING_POINTER (asmspec_tree);
 816
 817   if (init)
 818     {
 819       if (TREE_CODE (value) == FUNCTION_DECL)
 820         {
 821           /* Initializers for functions are rejected early in the parser.
 822              If we get here, it must be a pure specifier for a method.  */
 823           if (TREE_CODE (TREE_TYPE (value)) == METHOD_TYPE)
 824             {
 825               gcc_assert (error_operand_p (init) || integer_zerop (init));
 826               DECL_PURE_VIRTUAL_P (value) = 1;
 827             }
 828           else
 829             {
 830               gcc_assert (TREE_CODE (TREE_TYPE (value)) == FUNCTION_TYPE);
 831               error ("initializer specified for static member function %qD",
 832                      value);
 833             }
 834         }
 835       else if (pedantic && TREE_CODE (value) != VAR_DECL)
 836         /* Already complained in grokdeclarator.  */
 837         init = NULL_TREE;
 838       else if (!processing_template_decl)
 839         {
 840           if (TREE_CODE (init) == CONSTRUCTOR)
 841             init = digest_init (TREE_TYPE (value), init);
 842           else
 843             init = integral_constant_value (init);
 844
 845           if (init != error_mark_node && !TREE_CONSTANT (init))
 846             {
 847               /* We can allow references to things that are effectively
 848                  static, since references are initialized with the
 849                  address.  */
 850               if (TREE_CODE (TREE_TYPE (value)) != REFERENCE_TYPE
 851                   || (TREE_STATIC (init) == 0
 852                       && (!DECL_P (init) || DECL_EXTERNAL (init) == 0)))
 853                 {
 854                   error ("field initializer is not constant");
 855                   init = error_mark_node;
 856                 }
 857             }
 858         }
 859     }
 860
 861   if (processing_template_decl
 862       && (TREE_CODE (value) == VAR_DECL || TREE_CODE (value) == FUNCTION_DECL))
 863     {
 864       value = push_template_decl (value);
 865       if (error_operand_p (value))
 866         return error_mark_node;
 867     }
 868
 869   if (attrlist)
 870     cplus_decl_attributes (&value, attrlist, 0);
 871
 872   switch (TREE_CODE (value))
 873     {
 874     case VAR_DECL:
 875       finish_static_data_member_decl (value, init, init_const_expr_p,
 876                                       asmspec_tree, flags);
 877       return value;
 878
 879     case FIELD_DECL:
 880       if (asmspec)
 881         error ("%<asm%> specifiers are not permitted on non-static data members");
 882       if (DECL_INITIAL (value) == error_mark_node)
 883         init = error_mark_node;
 884       cp_finish_decl (value, init, /*init_const_expr_p=*/false,
 885                       NULL_TREE, flags);
 886       DECL_INITIAL (value) = init;
 887       DECL_IN_AGGR_P (value) = 1;
 888       return value;
 889
 890     case  FUNCTION_DECL:
 891       if (asmspec)
 892         set_user_assembler_name (value, asmspec);
 893
 894       cp_finish_decl (value,
 895                       /*init=*/NULL_TREE,
 896                       /*init_const_expr_p=*/false,
 897                       asmspec_tree, flags);
 898
 899       /* Pass friends back this way.  */
 900       if (DECL_FRIEND_P (value))
 901         return void_type_node;
 902
 903       DECL_IN_AGGR_P (value) = 1;
 904       return value;
 905
 906     default:
 907       gcc_unreachable ();
 908     }
 909   return NULL_TREE;
 910 }
 911
 912 /* Like `grokfield', but for bitfields.
 913    WIDTH is non-NULL for bit fields only, and is an INTEGER_CST node.  */
 914
 915 tree
 916 grokbitfield (const cp_declarator *declarator,
 917               cp_decl_specifier_seq *declspecs, tree width)
 918 {
 919   tree value = grokdeclarator (declarator, declspecs, BITFIELD, 0, NULL);
 920
 921   if (value == error_mark_node)
 922     return NULL_TREE; /* friends went bad.  */
 923
 924   /* Pass friendly classes back.  */
 925   if (TREE_CODE (value) == VOID_TYPE)
 926     return void_type_node;
 927
 928   if (!INTEGRAL_TYPE_P (TREE_TYPE (value))
 929       && (POINTER_TYPE_P (value)
 930           || !dependent_type_p (TREE_TYPE (value))))
 931     {
 932       error ("bit-field %qD with non-integral type", value);
 933       return error_mark_node;
 934     }
 935
 936   if (TREE_CODE (value) == TYPE_DECL)
 937     {
 938       error ("cannot declare %qD to be a bit-field type", value);
 939       return NULL_TREE;
 940     }
 941
 942   /* Usually, finish_struct_1 catches bitfields with invalid types.
 943      But, in the case of bitfields with function type, we confuse
 944      ourselves into thinking they are member functions, so we must
 945      check here.  */
 946   if (TREE_CODE (value) == FUNCTION_DECL)
 947     {
 948       error ("cannot declare bit-field %qD with function type",
 949              DECL_NAME (value));
 950       return NULL_TREE;
 951     }
 952
 953   if (DECL_IN_AGGR_P (value))
 954     {
 955       error ("%qD is already defined in the class %qT", value,
 956              DECL_CONTEXT (value));
 957       return void_type_node;
 958     }
 959
 960   if (TREE_STATIC (value))
 961     {
 962       error ("static member %qD cannot be a bit-field", value);
 963       return NULL_TREE;
 964     }
 965   finish_decl (value, NULL_TREE, NULL_TREE);
 966
 967   if (width != error_mark_node)
 968     {
 969       constant_expression_warning (width);
 970       DECL_INITIAL (value) = width;
 971       SET_DECL_C_BIT_FIELD (value);
 972     }
 973
 974   DECL_IN_AGGR_P (value) = 1;
 975   return value;
 976 }
 977
 978 \f
 979 /* Returns true iff ATTR is an attribute which needs to be applied at
 980    instantiation time rather than template definition time.  */
 981
 982 static bool
 983 is_late_template_attribute (tree attr, tree decl)
 984 {
 985   tree name = TREE_PURPOSE (attr);
 986   tree args = TREE_VALUE (attr);
 987   const struct attribute_spec *spec = lookup_attribute_spec (name);
 988   tree arg;
 989
 990   if (!spec)
 991     /* Unknown attribute.  */
 992     return false;
 993
 994   /* If any of the arguments are dependent expressions, we can't evaluate
 995      the attribute until instantiation time.  */
 996   for (arg = args; arg; arg = TREE_CHAIN (arg))
 997     {
 998       tree t = TREE_VALUE (arg);
 999       if (value_dependent_expression_p (t)
1000           || type_dependent_expression_p (t))
1001         return true;
1002     }
1003
1004   if (TREE_CODE (decl) == TYPE_DECL
1005       || TYPE_P (decl)
1006       || spec->type_required)
1007     {
1008       tree type = TYPE_P (decl) ? decl : TREE_TYPE (decl);
1009
1010       /* We can't apply any attributes to a completely unknown type until
1011          instantiation time.  */
1012       enum tree_code code = TREE_CODE (type);
1013       if (code == TEMPLATE_TYPE_PARM
1014           || code == BOUND_TEMPLATE_TEMPLATE_PARM
1015           || code == TYPENAME_TYPE)
1016         return true;
1017       /* Also defer most attributes on dependent types.  This is not
1018          necessary in all cases, but is the better default.  */
1019       else if (dependent_type_p (type)
1020                /* But attribute visibility specifically works on
1021                   templates.  */
1022                && !is_attribute_p ("visibility", name))
1023         return true;
1024       else
1025         return false;
1026     }
1027   else
1028     return false;
1029 }
1030
1031 /* ATTR_P is a list of attributes.  Remove any attributes which need to be
1032    applied at instantiation time and return them.  If IS_DEPENDENT is true,
1033    the declaration itself is dependent, so all attributes should be applied
1034    at instantiation time.  */
1035
1036 static tree
1037 splice_template_attributes (tree *attr_p, tree decl)
1038 {
1039   tree *p = attr_p;
1040   tree late_attrs = NULL_TREE;
1041   tree *q = &late_attrs;
1042
1043   if (!p)
1044     return NULL_TREE;
1045
1046   for (; *p; )
1047     {
1048       if (is_late_template_attribute (*p, decl))
1049         {
1050           ATTR_IS_DEPENDENT (*p) = 1;
1051           *q = *p;
1052           *p = TREE_CHAIN (*p);
1053           q = &TREE_CHAIN (*q);
1054           *q = NULL_TREE;
1055         }
1056       else
1057         p = &TREE_CHAIN (*p);
1058     }
1059
1060   return late_attrs;
1061 }
1062
1063 /* Remove any late attributes from the list in ATTR_P and attach them to
1064    DECL_P.  */
1065
1066 static void
1067 save_template_attributes (tree *attr_p, tree *decl_p)
1068 {
1069   tree late_attrs = splice_template_attributes (attr_p, *decl_p);
1070   tree *q;
1071   tree old_attrs = NULL_TREE;
1072
1073   if (!late_attrs)
1074     return;
1075
1076   /* Give this type a name so we know to look it up again at instantiation
1077      time.  */
1078   if (TREE_CODE (*decl_p) == TYPE_DECL
1079       && DECL_ORIGINAL_TYPE (*decl_p) == NULL_TREE)
1080     {
1081       tree oldt = TREE_TYPE (*decl_p);
1082       tree newt = build_variant_type_copy (oldt);
1083       DECL_ORIGINAL_TYPE (*decl_p) = oldt;
1084       TREE_TYPE (*decl_p) = newt;
1085       TYPE_NAME (newt) = *decl_p;
1086       TREE_USED (newt) = TREE_USED (*decl_p);
1087     }
1088
1089   if (DECL_P (*decl_p))
1090     q = &DECL_ATTRIBUTES (*decl_p);
1091   else
1092     q = &TYPE_ATTRIBUTES (*decl_p);
1093
1094   old_attrs = *q;
1095
1096   /* Place the late attributes at the beginning of the attribute
1097      list.  */
1098   TREE_CHAIN (tree_last (late_attrs)) = *q;
1099   *q = late_attrs;
1100
1101   if (!DECL_P (*decl_p) && *decl_p == TYPE_MAIN_VARIANT (*decl_p))
1102     {
1103       /* We've added new attributes directly to the main variant, so
1104          now we need to update all of the other variants to include
1105          these new attributes.  */
1106       tree variant;
1107       for (variant = TYPE_NEXT_VARIANT (*decl_p); variant;
1108            variant = TYPE_NEXT_VARIANT (variant))
1109         {
1110           gcc_assert (TYPE_ATTRIBUTES (variant) == old_attrs);
1111           TYPE_ATTRIBUTES (variant) = TYPE_ATTRIBUTES (*decl_p);
1112         }
1113     }
1114 }
1115
1116 /* Like decl_attributes, but handle C++ complexity.  */
1117
1118 void
1119 cplus_decl_attributes (tree *decl, tree attributes, int flags)
1120 {
1121   if (*decl == NULL_TREE || *decl == void_type_node
1122       || *decl == error_mark_node
1123       || attributes == NULL_TREE)
1124     return;
1125
1126   if (processing_template_decl)
1127     {
1128       if (check_for_bare_parameter_packs (attributes))
1129         return;
1130
1131       save_template_attributes (&attributes, decl);
1132       if (attributes == NULL_TREE)
1133         return;
1134     }
1135
1136   if (TREE_CODE (*decl) == TEMPLATE_DECL)
1137     decl = &DECL_TEMPLATE_RESULT (*decl);
1138
1139   decl_attributes (decl, attributes, flags);
1140
1141   if (TREE_CODE (*decl) == TYPE_DECL)
1142     SET_IDENTIFIER_TYPE_VALUE (DECL_NAME (*decl), TREE_TYPE (*decl));
1143 }
1144 \f
1145 /* Walks through the namespace- or function-scope anonymous union
1146    OBJECT, with the indicated TYPE, building appropriate VAR_DECLs.
1147    Returns one of the fields for use in the mangled name.  */
1148
1149 static tree
1150 build_anon_union_vars (tree type, tree object)
1151 {
1152   tree main_decl = NULL_TREE;
1153   tree field;
1154
1155   /* Rather than write the code to handle the non-union case,
1156      just give an error.  */
1157   if (TREE_CODE (type) != UNION_TYPE)
1158     error ("anonymous struct not inside named type");
1159
1160   for (field = TYPE_FIELDS (type);
1161        field != NULL_TREE;
1162        field = TREE_CHAIN (field))
1163     {
1164       tree decl;
1165       tree ref;
1166
1167       if (DECL_ARTIFICIAL (field))
1168         continue;
1169       if (TREE_CODE (field) != FIELD_DECL)
1170         {
1171           pedwarn ("%q+#D invalid; an anonymous union can only "
1172                    "have non-static data members", field);
1173           continue;
1174         }
1175
1176       if (TREE_PRIVATE (field))
1177         pedwarn ("private member %q+#D in anonymous union", field);
1178       else if (TREE_PROTECTED (field))
1179         pedwarn ("protected member %q+#D in anonymous union", field);
1180
1181       if (processing_template_decl)
1182         ref = build_min_nt (COMPONENT_REF, object,
1183                             DECL_NAME (field), NULL_TREE);
1184       else
1185         ref = build_class_member_access_expr (object, field, NULL_TREE,
1186                                               false);
1187
1188       if (DECL_NAME (field))
1189         {
1190           tree base;
1191
1192           decl = build_decl (VAR_DECL, DECL_NAME (field), TREE_TYPE (field));
1193           DECL_ANON_UNION_VAR_P (decl) = 1;
1194
1195           base = get_base_address (object);
1196           TREE_PUBLIC (decl) = TREE_PUBLIC (base);
1197           TREE_STATIC (decl) = TREE_STATIC (base);
1198           DECL_EXTERNAL (decl) = DECL_EXTERNAL (base);
1199
1200           SET_DECL_VALUE_EXPR (decl, ref);
1201           DECL_HAS_VALUE_EXPR_P (decl) = 1;
1202
1203           decl = pushdecl (decl);
1204         }
1205       else if (ANON_AGGR_TYPE_P (TREE_TYPE (field)))
1206         decl = build_anon_union_vars (TREE_TYPE (field), ref);
1207       else
1208         decl = 0;
1209
1210       if (main_decl == NULL_TREE)
1211         main_decl = decl;
1212     }
1213
1214   return main_decl;
1215 }
1216
1217 /* Finish off the processing of a UNION_TYPE structure.  If the union is an
1218    anonymous union, then all members must be laid out together.  PUBLIC_P
1219    is nonzero if this union is not declared static.  */
1220
1221 void
1222 finish_anon_union (tree anon_union_decl)
1223 {
1224   tree type;
1225   tree main_decl;
1226   bool public_p;
1227
1228   if (anon_union_decl == error_mark_node)
1229     return;
1230
1231   type = TREE_TYPE (anon_union_decl);
1232   public_p = TREE_PUBLIC (anon_union_decl);
1233
1234   /* The VAR_DECL's context is the same as the TYPE's context.  */
1235   DECL_CONTEXT (anon_union_decl) = DECL_CONTEXT (TYPE_NAME (type));
1236
1237   if (TYPE_FIELDS (type) == NULL_TREE)
1238     return;
1239
1240   if (public_p)
1241     {
1242       error ("namespace-scope anonymous aggregates must be static");
1243       return;
1244     }
1245
1246   main_decl = build_anon_union_vars (type, anon_union_decl);
1247   if (main_decl == error_mark_node)
1248     return;
1249   if (main_decl == NULL_TREE)
1250     {
1251       warning (0, "anonymous union with no members");
1252       return;
1253     }
1254
1255   if (!processing_template_decl)
1256     {
1257       /* Use main_decl to set the mangled name.  */
1258       DECL_NAME (anon_union_decl) = DECL_NAME (main_decl);
1259       mangle_decl (anon_union_decl);
1260       DECL_NAME (anon_union_decl) = NULL_TREE;
1261     }
1262
1263   pushdecl (anon_union_decl);
1264   if (building_stmt_tree ()
1265       && at_function_scope_p ())
1266     add_decl_expr (anon_union_decl);
1267   else if (!processing_template_decl)
1268     rest_of_decl_compilation (anon_union_decl,
1269                               toplevel_bindings_p (), at_eof);
1270 }
1271 \f
1272 /* Auxiliary functions to make type signatures for
1273    `operator new' and `operator delete' correspond to
1274    what compiler will be expecting.  */
1275
1276 tree
1277 coerce_new_type (tree type)
1278 {
1279   int e = 0;
1280   tree args = TYPE_ARG_TYPES (type);
1281
1282   gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
1283
1284   if (!same_type_p (TREE_TYPE (type), ptr_type_node))
1285     {
1286       e = 1;
1287       error ("%<operator new%> must return type %qT", ptr_type_node);
1288     }
1289
1290   if (args && args != void_list_node)
1291     {
1292       if (TREE_PURPOSE (args))
1293         {
1294           /* [basic.stc.dynamic.allocation]
1295
1296              The first parameter shall not have an associated default
1297              argument.  */
1298           error ("the first parameter of %<operator new%> cannot "
1299                  "have a default argument");
1300           /* Throw away the default argument.  */
1301           TREE_PURPOSE (args) = NULL_TREE;
1302         }
1303
1304       if (!same_type_p (TREE_VALUE (args), size_type_node))
1305         {
1306           e = 2;
1307           args = TREE_CHAIN (args);
1308         }
1309     }
1310   else
1311     e = 2;
1312
1313   if (e == 2)
1314     pedwarn ("%<operator new%> takes type %<size_t%> (%qT) "
1315              "as first parameter", size_type_node);
1316
1317   switch (e)
1318   {
1319     case 2:
1320       args = tree_cons (NULL_TREE, size_type_node, args);
1321       /* Fall through.  */
1322     case 1:
1323       type = build_exception_variant
1324               (build_function_type (ptr_type_node, args),
1325                TYPE_RAISES_EXCEPTIONS (type));
1326       /* Fall through.  */
1327     default:;
1328   }
1329   return type;
1330 }
1331
1332 tree
1333 coerce_delete_type (tree type)
1334 {
1335   int e = 0;
1336   tree args = TYPE_ARG_TYPES (type);
1337
1338   gcc_assert (TREE_CODE (type) == FUNCTION_TYPE);
1339
1340   if (!same_type_p (TREE_TYPE (type), void_type_node))
1341     {
1342       e = 1;
1343       error ("%<operator delete%> must return type %qT", void_type_node);
1344     }
1345
1346   if (!args || args == void_list_node
1347       || !same_type_p (TREE_VALUE (args), ptr_type_node))
1348     {
1349       e = 2;
1350       if (args && args != void_list_node)
1351         args = TREE_CHAIN (args);
1352       error ("%<operator delete%> takes type %qT as first parameter",
1353              ptr_type_node);
1354     }
1355   switch (e)
1356   {
1357     case 2:
1358       args = tree_cons (NULL_TREE, ptr_type_node, args);
1359       /* Fall through.  */
1360     case 1:
1361       type = build_exception_variant
1362               (build_function_type (void_type_node, args),
1363                TYPE_RAISES_EXCEPTIONS (type));
1364       /* Fall through.  */
1365     default:;
1366   }
1367
1368   return type;
1369 }
1370 \f
1371 /* DECL is a VAR_DECL for a vtable: walk through the entries in the vtable
1372    and mark them as needed.  */
1373
1374 static void
1375 mark_vtable_entries (tree decl)
1376 {
1377   tree fnaddr;
1378   unsigned HOST_WIDE_INT idx;
1379
1380   FOR_EACH_CONSTRUCTOR_VALUE (CONSTRUCTOR_ELTS (DECL_INITIAL (decl)),
1381                               idx, fnaddr)
1382     {
1383       tree fn;
1384
1385       STRIP_NOPS (fnaddr);
1386
1387       if (TREE_CODE (fnaddr) != ADDR_EXPR
1388           && TREE_CODE (fnaddr) != FDESC_EXPR)
1389         /* This entry is an offset: a virtual base class offset, a
1390            virtual call offset, an RTTI offset, etc.  */
1391         continue;
1392
1393       fn = TREE_OPERAND (fnaddr, 0);
1394       TREE_ADDRESSABLE (fn) = 1;
1395       /* When we don't have vcall offsets, we output thunks whenever
1396          we output the vtables that contain them.  With vcall offsets,
1397          we know all the thunks we'll need when we emit a virtual
1398          function, so we emit the thunks there instead.  */
1399       if (DECL_THUNK_P (fn))
1400         use_thunk (fn, /*emit_p=*/0);
1401       mark_used (fn);
1402     }
1403 }
1404
1405 /* Set DECL up to have the closest approximation of "initialized common"
1406    linkage available.  */
1407
1408 void
1409 comdat_linkage (tree decl)
1410 {
1411   if (flag_weak)
1412     make_decl_one_only (decl);
1413   else if (TREE_CODE (decl) == FUNCTION_DECL
1414            || (TREE_CODE (decl) == VAR_DECL && DECL_ARTIFICIAL (decl)))
1415     /* We can just emit function and compiler-generated variables
1416        statically; having multiple copies is (for the most part) only
1417        a waste of space.
1418
1419        There are two correctness issues, however: the address of a
1420        template instantiation with external linkage should be the
1421        same, independent of what translation unit asks for the
1422        address, and this will not hold when we emit multiple copies of
1423        the function.  However, there's little else we can do.
1424
1425        Also, by default, the typeinfo implementation assumes that
1426        there will be only one copy of the string used as the name for
1427        each type.  Therefore, if weak symbols are unavailable, the
1428        run-time library should perform a more conservative check; it
1429        should perform a string comparison, rather than an address
1430        comparison.  */
1431     TREE_PUBLIC (decl) = 0;
1432   else
1433     {
1434       /* Static data member template instantiations, however, cannot
1435          have multiple copies.  */
1436       if (DECL_INITIAL (decl) == 0
1437           || DECL_INITIAL (decl) == error_mark_node)
1438         DECL_COMMON (decl) = 1;
1439       else if (EMPTY_CONSTRUCTOR_P (DECL_INITIAL (decl)))
1440         {
1441           DECL_COMMON (decl) = 1;
1442           DECL_INITIAL (decl) = error_mark_node;
1443         }
1444       else if (!DECL_EXPLICIT_INSTANTIATION (decl))
1445         {
1446           /* We can't do anything useful; leave vars for explicit
1447              instantiation.  */
1448           DECL_EXTERNAL (decl) = 1;
1449           DECL_NOT_REALLY_EXTERN (decl) = 0;
1450         }
1451     }
1452
1453   if (DECL_LANG_SPECIFIC (decl))
1454     DECL_COMDAT (decl) = 1;
1455 }
1456
1457 /* For win32 we also want to put explicit instantiations in
1458    linkonce sections, so that they will be merged with implicit
1459    instantiations; otherwise we get duplicate symbol errors.
1460    For Darwin we do not want explicit instantiations to be
1461    linkonce.  */
1462
1463 void
1464 maybe_make_one_only (tree decl)
1465 {
1466   /* We used to say that this was not necessary on targets that support weak
1467      symbols, because the implicit instantiations will defer to the explicit
1468      one.  However, that's not actually the case in SVR4; a strong definition
1469      after a weak one is an error.  Also, not making explicit
1470      instantiations one_only means that we can end up with two copies of
1471      some template instantiations.  */
1472   if (! flag_weak)
1473     return;
1474
1475   /* We can't set DECL_COMDAT on functions, or cp_finish_file will think
1476      we can get away with not emitting them if they aren't used.  We need
1477      to for variables so that cp_finish_decl will update their linkage,
1478      because their DECL_INITIAL may not have been set properly yet.  */
1479
1480   if (!TARGET_WEAK_NOT_IN_ARCHIVE_TOC
1481       || (! DECL_EXPLICIT_INSTANTIATION (decl)
1482           && ! DECL_TEMPLATE_SPECIALIZATION (decl)))
1483     {
1484       make_decl_one_only (decl);
1485
1486       if (TREE_CODE (decl) == VAR_DECL)
1487         {
1488           DECL_COMDAT (decl) = 1;
1489           /* Mark it needed so we don't forget to emit it.  */
1490           mark_decl_referenced (decl);
1491         }
1492     }
1493 }
1494
1495 /* Determine whether or not we want to specifically import or export CTYPE,
1496    using various heuristics.  */
1497
1498 static void
1499 import_export_class (tree ctype)
1500 {
1501   /* -1 for imported, 1 for exported.  */
1502   int import_export = 0;
1503
1504   /* It only makes sense to call this function at EOF.  The reason is
1505      that this function looks at whether or not the first non-inline
1506      non-abstract virtual member function has been defined in this
1507      translation unit.  But, we can't possibly know that until we've
1508      seen the entire translation unit.  */
1509   gcc_assert (at_eof);
1510
1511   if (CLASSTYPE_INTERFACE_KNOWN (ctype))
1512     return;
1513
1514   /* If MULTIPLE_SYMBOL_SPACES is set and we saw a #pragma interface,
1515      we will have CLASSTYPE_INTERFACE_ONLY set but not
1516      CLASSTYPE_INTERFACE_KNOWN.  In that case, we don't want to use this
1517      heuristic because someone will supply a #pragma implementation
1518      elsewhere, and deducing it here would produce a conflict.  */
1519   if (CLASSTYPE_INTERFACE_ONLY (ctype))
1520     return;
1521
1522   if (lookup_attribute ("dllimport", TYPE_ATTRIBUTES (ctype)))
1523     import_export = -1;
1524   else if (lookup_attribute ("dllexport", TYPE_ATTRIBUTES (ctype)))
1525     import_export = 1;
1526   else if (CLASSTYPE_IMPLICIT_INSTANTIATION (ctype)
1527            && !flag_implicit_templates)
1528     /* For a template class, without -fimplicit-templates, check the
1529        repository.  If the virtual table is assigned to this
1530        translation unit, then export the class; otherwise, import
1531        it.  */
1532       import_export = repo_export_class_p (ctype) ? 1 : -1;
1533   else if (TYPE_POLYMORPHIC_P (ctype))
1534     {
1535       /* The ABI specifies that the virtual table and associated
1536          information are emitted with the key method, if any.  */
1537       tree method = CLASSTYPE_KEY_METHOD (ctype);
1538       /* If weak symbol support is not available, then we must be
1539          careful not to emit the vtable when the key function is
1540          inline.  An inline function can be defined in multiple
1541          translation units.  If we were to emit the vtable in each
1542          translation unit containing a definition, we would get
1543          multiple definition errors at link-time.  */
1544       if (method && (flag_weak || ! DECL_DECLARED_INLINE_P (method)))
1545         import_export = (DECL_REALLY_EXTERN (method) ? -1 : 1);
1546     }
1547
1548   /* When MULTIPLE_SYMBOL_SPACES is set, we cannot count on seeing
1549      a definition anywhere else.  */
1550   if (MULTIPLE_SYMBOL_SPACES && import_export == -1)
1551     import_export = 0;
1552
1553   /* Allow back ends the chance to overrule the decision.  */
1554   if (targetm.cxx.import_export_class)
1555     import_export = targetm.cxx.import_export_class (ctype, import_export);
1556
1557   if (import_export)
1558     {
1559       SET_CLASSTYPE_INTERFACE_KNOWN (ctype);
1560       CLASSTYPE_INTERFACE_ONLY (ctype) = (import_export < 0);
1561     }
1562 }
1563
1564 /* Return true if VAR has already been provided to the back end; in that
1565    case VAR should not be modified further by the front end.  */
1566 static bool
1567 var_finalized_p (tree var)
1568 {
1569   return varpool_node (var)->finalized;
1570 }
1571
1572 /* DECL is a VAR_DECL or FUNCTION_DECL which, for whatever reason,
1573    must be emitted in this translation unit.  Mark it as such.  */
1574
1575 void
1576 mark_needed (tree decl)
1577 {
1578   /* It's possible that we no longer need to set
1579      TREE_SYMBOL_REFERENCED here directly, but doing so is
1580      harmless.  */
1581   TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl)) = 1;
1582   mark_decl_referenced (decl);
1583 }
1584
1585 /* DECL is either a FUNCTION_DECL or a VAR_DECL.  This function
1586    returns true if a definition of this entity should be provided in
1587    this object file.  Callers use this function to determine whether
1588    or not to let the back end know that a definition of DECL is
1589    available in this translation unit.  */
1590
1591 bool
1592 decl_needed_p (tree decl)
1593 {
1594   gcc_assert (TREE_CODE (decl) == VAR_DECL
1595               || TREE_CODE (decl) == FUNCTION_DECL);
1596   /* This function should only be called at the end of the translation
1597      unit.  We cannot be sure of whether or not something will be
1598      COMDAT until that point.  */
1599   gcc_assert (at_eof);
1600
1601   /* All entities with external linkage that are not COMDAT should be
1602      emitted; they may be referred to from other object files.  */
1603   if (TREE_PUBLIC (decl) && !DECL_COMDAT (decl))
1604     return true;
1605   /* If this entity was used, let the back end see it; it will decide
1606      whether or not to emit it into the object file.  */
1607   if (TREE_USED (decl)
1608       || (DECL_ASSEMBLER_NAME_SET_P (decl)
1609           && TREE_SYMBOL_REFERENCED (DECL_ASSEMBLER_NAME (decl))))
1610       return true;
1611   /* Otherwise, DECL does not need to be emitted -- yet.  A subsequent
1612      reference to DECL might cause it to be emitted later.  */
1613   return false;
1614 }
1615
1616 /* If necessary, write out the vtables for the dynamic class CTYPE.
1617    Returns true if any vtables were emitted.  */
1618
1619 static bool
1620 maybe_emit_vtables (tree ctype)
1621 {
1622   tree vtbl;
1623   tree primary_vtbl;
1624   int needed = 0;
1625
1626   /* If the vtables for this class have already been emitted there is
1627      nothing more to do.  */
1628   primary_vtbl = CLASSTYPE_VTABLES (ctype);
1629   if (var_finalized_p (primary_vtbl))
1630     return false;
1631   /* Ignore dummy vtables made by get_vtable_decl.  */
1632   if (TREE_TYPE (primary_vtbl) == void_type_node)
1633     return false;
1634
1635   /* On some targets, we cannot determine the key method until the end
1636      of the translation unit -- which is when this function is
1637      called.  */
1638   if (!targetm.cxx.key_method_may_be_inline ())
1639     determine_key_method (ctype);
1640
1641   /* See if any of the vtables are needed.  */
1642   for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = TREE_CHAIN (vtbl))
1643     {
1644       import_export_decl (vtbl);
1645       if (DECL_NOT_REALLY_EXTERN (vtbl) && decl_needed_p (vtbl))
1646         needed = 1;
1647     }
1648   if (!needed)
1649     {
1650       /* If the references to this class' vtables are optimized away,
1651          still emit the appropriate debugging information.  See
1652          dfs_debug_mark.  */
1653       if (DECL_COMDAT (primary_vtbl)
1654           && CLASSTYPE_DEBUG_REQUESTED (ctype))
1655         note_debug_info_needed (ctype);
1656       return false;
1657     }
1658
1659   /* The ABI requires that we emit all of the vtables if we emit any
1660      of them.  */
1661   for (vtbl = CLASSTYPE_VTABLES (ctype); vtbl; vtbl = TREE_CHAIN (vtbl))
1662     {
1663       /* Mark entities references from the virtual table as used.  */
1664       mark_vtable_entries (vtbl);
1665
1666       if (TREE_TYPE (DECL_INITIAL (vtbl)) == 0)
1667         {
1668           tree expr = store_init_value (vtbl, DECL_INITIAL (vtbl));
1669
1670           /* It had better be all done at compile-time.  */
1671           gcc_assert (!expr);
1672         }
1673
1674       /* Write it out.  */
1675       DECL_EXTERNAL (vtbl) = 0;
1676       rest_of_decl_compilation (vtbl, 1, 1);
1677
1678       /* Because we're only doing syntax-checking, we'll never end up
1679          actually marking the variable as written.  */
1680       if (flag_syntax_only)
1681         TREE_ASM_WRITTEN (vtbl) = 1;
1682     }
1683
1684   /* Since we're writing out the vtable here, also write the debug
1685      info.  */
1686   note_debug_info_needed (ctype);
1687
1688   return true;
1689 }
1690
1691 /* A special return value from type_visibility meaning internal
1692    linkage.  */
1693
1694 enum { VISIBILITY_ANON = VISIBILITY_INTERNAL+1 };
1695
1696 /* walk_tree helper function for type_visibility.  */
1697
1698 static tree
1699 min_vis_r (tree *tp, int *walk_subtrees, void *data)
1700 {
1701   int *vis_p = (int *)data;
1702   if (! TYPE_P (*tp))
1703     {
1704       *walk_subtrees = 0;
1705     }
1706   else if (CLASS_TYPE_P (*tp))
1707     {
1708       if (!TREE_PUBLIC (TYPE_MAIN_DECL (*tp)))
1709         {
1710           *vis_p = VISIBILITY_ANON;
1711           return *tp;
1712         }
1713       else if (CLASSTYPE_VISIBILITY (*tp) > *vis_p)
1714         *vis_p = CLASSTYPE_VISIBILITY (*tp);
1715     }
1716   return NULL;
1717 }
1718
1719 /* Returns the visibility of TYPE, which is the minimum visibility of its
1720    component types.  */
1721
1722 static int
1723 type_visibility (tree type)
1724 {
1725   int vis = VISIBILITY_DEFAULT;
1726   cp_walk_tree_without_duplicates (&type, min_vis_r, &vis);
1727   return vis;
1728 }
1729
1730 /* Limit the visibility of DECL to VISIBILITY, if not explicitly
1731    specified (or if VISIBILITY is static).  */
1732
1733 static bool
1734 constrain_visibility (tree decl, int visibility)
1735 {
1736   if (visibility == VISIBILITY_ANON)
1737     {
1738       /* extern "C" declarations aren't affected by the anonymous
1739          namespace.  */
1740       if (!DECL_EXTERN_C_P (decl))
1741         {
1742           TREE_PUBLIC (decl) = 0;
1743           DECL_ONE_ONLY (decl) = 0;
1744           DECL_INTERFACE_KNOWN (decl) = 1;
1745           if (DECL_LANG_SPECIFIC (decl))
1746             DECL_NOT_REALLY_EXTERN (decl) = 1;
1747         }
1748     }
1749   else if (visibility > DECL_VISIBILITY (decl)
1750            && !DECL_VISIBILITY_SPECIFIED (decl))
1751     {
1752       DECL_VISIBILITY (decl) = visibility;
1753       return true;
1754     }
1755   return false;
1756 }
1757
1758 /* Constrain the visibility of DECL based on the visibility of its template
1759    arguments.  */
1760
1761 static void
1762 constrain_visibility_for_template (tree decl, tree targs)
1763 {
1764   /* If this is a template instantiation, check the innermost
1765      template args for visibility constraints.  The outer template
1766      args are covered by the class check.  */
1767   tree args = INNERMOST_TEMPLATE_ARGS (targs);
1768   int i;
1769   for (i = TREE_VEC_LENGTH (args); i > 0; --i)
1770     {
1771       int vis = 0;
1772
1773       tree arg = TREE_VEC_ELT (args, i-1);
1774       if (TYPE_P (arg))
1775         vis = type_visibility (arg);
1776       else if (TREE_TYPE (arg) && POINTER_TYPE_P (TREE_TYPE (arg)))
1777         {
1778           STRIP_NOPS (arg);
1779           if (TREE_CODE (arg) == ADDR_EXPR)
1780             arg = TREE_OPERAND (arg, 0);
1781           if (TREE_CODE (arg) == VAR_DECL
1782               || TREE_CODE (arg) == FUNCTION_DECL)
1783             {
1784               if (! TREE_PUBLIC (arg))
1785                 vis = VISIBILITY_ANON;
1786               else
1787                 vis = DECL_VISIBILITY (arg);
1788             }
1789         }
1790       if (vis)
1791         constrain_visibility (decl, vis);
1792     }
1793 }
1794
1795 /* Like c_determine_visibility, but with additional C++-specific
1796    behavior.
1797
1798    Function-scope entities can rely on the function's visibility because
1799    it is set in start_preparsed_function.
1800
1801    Class-scope entities cannot rely on the class's visibility until the end
1802    of the enclosing class definition.
1803
1804    Note that because namespaces have multiple independent definitions,
1805    namespace visibility is handled elsewhere using the #pragma visibility
1806    machinery rather than by decorating the namespace declaration.
1807
1808    The goal is for constraints from the type to give a diagnostic, and
1809    other constraints to be applied silently.  */
1810
1811 void
1812 determine_visibility (tree decl)
1813 {
1814   tree class_type = NULL_TREE;
1815   bool use_template;
1816
1817   /* Remember that all decls get VISIBILITY_DEFAULT when built.  */
1818
1819   /* Only relevant for names with external linkage.  */
1820   if (!TREE_PUBLIC (decl))
1821     return;
1822
1823   /* Cloned constructors and destructors get the same visibility as
1824      the underlying function.  That should be set up in
1825      maybe_clone_body.  */
1826   gcc_assert (!DECL_CLONED_FUNCTION_P (decl));
1827
1828   if (TREE_CODE (decl) == TYPE_DECL)
1829     {
1830       if (CLASS_TYPE_P (TREE_TYPE (decl)))
1831         use_template = CLASSTYPE_USE_TEMPLATE (TREE_TYPE (decl));
1832       else if (TYPE_TEMPLATE_INFO (TREE_TYPE (decl)))
1833         use_template = 1;
1834       else
1835         use_template = 0;
1836     }
1837   else if (DECL_LANG_SPECIFIC (decl))
1838     use_template = DECL_USE_TEMPLATE (decl);
1839   else
1840     use_template = 0;
1841
1842   /* If DECL is a member of a class, visibility specifiers on the
1843      class can influence the visibility of the DECL.  */
1844   if (DECL_CLASS_SCOPE_P (decl))
1845     class_type = DECL_CONTEXT (decl);
1846   else
1847     {
1848       /* Not a class member.  */
1849
1850       /* Virtual tables have DECL_CONTEXT set to their associated class,
1851          so they are automatically handled above.  */
1852       gcc_assert (TREE_CODE (decl) != VAR_DECL
1853                   || !DECL_VTABLE_OR_VTT_P (decl));
1854
1855       if (DECL_FUNCTION_SCOPE_P (decl) && ! DECL_VISIBILITY_SPECIFIED (decl))
1856         {
1857           /* Local statics and classes get the visibility of their
1858              containing function by default, except that
1859              -fvisibility-inlines-hidden doesn't affect them.  */
1860           tree fn = DECL_CONTEXT (decl);
1861           if (DECL_VISIBILITY_SPECIFIED (fn) || ! DECL_CLASS_SCOPE_P (fn))
1862             {
1863               DECL_VISIBILITY (decl) = DECL_VISIBILITY (fn);
1864               DECL_VISIBILITY_SPECIFIED (decl) =
1865                 DECL_VISIBILITY_SPECIFIED (fn);
1866             }
1867           else
1868             determine_visibility_from_class (decl, DECL_CONTEXT (fn));
1869
1870           /* Local classes in templates have CLASSTYPE_USE_TEMPLATE set,
1871              but have no TEMPLATE_INFO, so don't try to check it.  */
1872           use_template = 0;
1873         }
1874       else if (TREE_CODE (decl) == VAR_DECL && DECL_TINFO_P (decl)
1875                && flag_visibility_ms_compat)
1876         {
1877           /* Under -fvisibility-ms-compat, types are visible by default,
1878              even though their contents aren't.  */
1879           tree underlying_type = TREE_TYPE (DECL_NAME (decl));
1880           int underlying_vis = type_visibility (underlying_type);
1881           if (underlying_vis == VISIBILITY_ANON
1882               || CLASSTYPE_VISIBILITY_SPECIFIED (underlying_type))
1883             constrain_visibility (decl, underlying_vis);
1884           else
1885             DECL_VISIBILITY (decl) = VISIBILITY_DEFAULT;
1886         }
1887       else if (TREE_CODE (decl) == VAR_DECL && DECL_TINFO_P (decl))
1888         {
1889           /* tinfo visibility is based on the type it's for.  */
1890           constrain_visibility
1891             (decl, type_visibility (TREE_TYPE (DECL_NAME (decl))));
1892         }
1893       else if (use_template)
1894         /* Template instantiations and specializations get visibility based
1895            on their template unless they override it with an attribute.  */;
1896       else if (! DECL_VISIBILITY_SPECIFIED (decl))
1897         {
1898           /* Set default visibility to whatever the user supplied with
1899              #pragma GCC visibility or a namespace visibility attribute.  */
1900           DECL_VISIBILITY (decl) = default_visibility;
1901           DECL_VISIBILITY_SPECIFIED (decl) = visibility_options.inpragma;
1902         }
1903     }
1904
1905   if (use_template)
1906     {
1907       /* If the specialization doesn't specify visibility, use the
1908          visibility from the template.  */
1909       tree tinfo = (TREE_CODE (decl) == TYPE_DECL
1910                     ? TYPE_TEMPLATE_INFO (TREE_TYPE (decl))
1911                     : DECL_TEMPLATE_INFO (decl));
1912       tree args = TI_ARGS (tinfo);
1913
1914       if (args != error_mark_node)
1915         {
1916           int depth = TMPL_ARGS_DEPTH (args);
1917           tree pattern = DECL_TEMPLATE_RESULT (TI_TEMPLATE (tinfo));
1918
1919           if (!DECL_VISIBILITY_SPECIFIED (decl))
1920             {
1921               DECL_VISIBILITY (decl) = DECL_VISIBILITY (pattern);
1922               DECL_VISIBILITY_SPECIFIED (decl)
1923                 = DECL_VISIBILITY_SPECIFIED (pattern);
1924             }
1925
1926           /* FIXME should TMPL_ARGS_DEPTH really return 1 for null input? */
1927           if (args && depth > template_class_depth (class_type))
1928             /* Limit visibility based on its template arguments.  */
1929             constrain_visibility_for_template (decl, args);
1930         }
1931     }
1932
1933   if (class_type)
1934     determine_visibility_from_class (decl, class_type);
1935
1936   if (decl_anon_ns_mem_p (decl))
1937     /* Names in an anonymous namespace get internal linkage.
1938        This might change once we implement export.  */
1939     constrain_visibility (decl, VISIBILITY_ANON);
1940   else if (TREE_CODE (decl) != TYPE_DECL)
1941     {
1942       /* Propagate anonymity from type to decl.  */
1943       int tvis = type_visibility (TREE_TYPE (decl));
1944       if (tvis == VISIBILITY_ANON
1945           || ! DECL_VISIBILITY_SPECIFIED (decl))
1946         constrain_visibility (decl, tvis);
1947     }
1948 }
1949
1950 /* By default, static data members and function members receive
1951    the visibility of their containing class.  */
1952
1953 static void
1954 determine_visibility_from_class (tree decl, tree class_type)
1955 {
1956   if (DECL_VISIBILITY_SPECIFIED (decl))
1957     return;
1958
1959   if (visibility_options.inlines_hidden
1960       /* Don't do this for inline templates; specializations might not be
1961          inline, and we don't want them to inherit the hidden
1962          visibility.  We'll set it here for all inline instantiations.  */
1963       && !processing_template_decl
1964       && TREE_CODE (decl) == FUNCTION_DECL
1965       && DECL_DECLARED_INLINE_P (decl)
1966       && (! DECL_LANG_SPECIFIC (decl)
1967           || ! DECL_EXPLICIT_INSTANTIATION (decl)))
1968     DECL_VISIBILITY (decl) = VISIBILITY_HIDDEN;
1969   else
1970     {
1971       /* Default to the class visibility.  */
1972       DECL_VISIBILITY (decl) = CLASSTYPE_VISIBILITY (class_type);
1973       DECL_VISIBILITY_SPECIFIED (decl)
1974         = CLASSTYPE_VISIBILITY_SPECIFIED (class_type);
1975     }
1976
1977   /* Give the target a chance to override the visibility associated
1978      with DECL.  */
1979   if (TREE_CODE (decl) == VAR_DECL
1980       && (DECL_TINFO_P (decl)
1981           || (DECL_VTABLE_OR_VTT_P (decl)
1982               /* Construction virtual tables are not exported because
1983                  they cannot be referred to from other object files;
1984                  their name is not standardized by the ABI.  */
1985               && !DECL_CONSTRUCTION_VTABLE_P (decl)))
1986       && TREE_PUBLIC (decl)
1987       && !DECL_REALLY_EXTERN (decl)
1988       && !CLASSTYPE_VISIBILITY_SPECIFIED (class_type))
1989     targetm.cxx.determine_class_data_visibility (decl);
1990 }
1991
1992 /* Constrain the visibility of a class TYPE based on the visibility of its
1993    field types.  Warn if any fields require lesser visibility.  */
1994
1995 void
1996 constrain_class_visibility (tree type)
1997 {
1998   tree binfo;
1999   tree t;
2000   int i;
2001
2002   int vis = type_visibility (type);
2003
2004   if (vis == VISIBILITY_ANON
2005       || DECL_IN_SYSTEM_HEADER (TYPE_MAIN_DECL (type)))
2006     return;
2007
2008   /* Don't warn about visibility if the class has explicit visibility.  */
2009   if (CLASSTYPE_VISIBILITY_SPECIFIED (type))
2010     vis = VISIBILITY_INTERNAL;
2011
2012   for (t = TYPE_FIELDS (type); t; t = TREE_CHAIN (t))
2013     if (TREE_CODE (t) == FIELD_DECL && TREE_TYPE (t) != error_mark_node)
2014       {
2015         tree ftype = strip_pointer_or_array_types (TREE_TYPE (t));
2016         int subvis = type_visibility (ftype);
2017
2018         if (subvis == VISIBILITY_ANON)
2019           {
2020             if (!in_main_input_context ())
2021               warning (0, "\
2022 %qT has a field %qD whose type uses the anonymous namespace",
2023                        type, t);
2024           }
2025         else if (IS_AGGR_TYPE (ftype)
2026                  && vis < VISIBILITY_HIDDEN
2027                  && subvis >= VISIBILITY_HIDDEN)
2028           warning (OPT_Wattributes, "\
2029 %qT declared with greater visibility than the type of its field %qD",
2030                    type, t);
2031       }
2032
2033   binfo = TYPE_BINFO (type);
2034   for (i = 0; BINFO_BASE_ITERATE (binfo, i, t); ++i)
2035     {
2036       int subvis = type_visibility (TREE_TYPE (t));
2037
2038       if (subvis == VISIBILITY_ANON)
2039         {
2040           if (!in_main_input_context())
2041             warning (0, "\
2042 %qT has a base %qT whose type uses the anonymous namespace",
2043                      type, TREE_TYPE (t));
2044         }
2045       else if (vis < VISIBILITY_HIDDEN
2046                && subvis >= VISIBILITY_HIDDEN)
2047         warning (OPT_Wattributes, "\
2048 %qT declared with greater visibility than its base %qT",
2049                  type, TREE_TYPE (t));
2050     }
2051 }
2052
2053 /* DECL is a FUNCTION_DECL or VAR_DECL.  If the object file linkage
2054    for DECL has not already been determined, do so now by setting
2055    DECL_EXTERNAL, DECL_COMDAT and other related flags.  Until this
2056    function is called entities with vague linkage whose definitions
2057    are available must have TREE_PUBLIC set.
2058
2059    If this function decides to place DECL in COMDAT, it will set
2060    appropriate flags -- but will not clear DECL_EXTERNAL.  It is up to
2061    the caller to decide whether or not to clear DECL_EXTERNAL.  Some
2062    callers defer that decision until it is clear that DECL is actually
2063    required.  */
2064
2065 void
2066 import_export_decl (tree decl)
2067 {
2068   int emit_p;
2069   bool comdat_p;
2070   bool import_p;
2071   tree class_type = NULL_TREE;
2072
2073   if (DECL_INTERFACE_KNOWN (decl))
2074     return;
2075
2076   /* We cannot determine what linkage to give to an entity with vague
2077      linkage until the end of the file.  For example, a virtual table
2078      for a class will be defined if and only if the key method is
2079      defined in this translation unit.  As a further example, consider
2080      that when compiling a translation unit that uses PCH file with
2081      "-frepo" it would be incorrect to make decisions about what
2082      entities to emit when building the PCH; those decisions must be
2083      delayed until the repository information has been processed.  */
2084   gcc_assert (at_eof);
2085   /* Object file linkage for explicit instantiations is handled in
2086      mark_decl_instantiated.  For static variables in functions with
2087      vague linkage, maybe_commonize_var is used.
2088
2089      Therefore, the only declarations that should be provided to this
2090      function are those with external linkage that are:
2091
2092      * implicit instantiations of function templates
2093
2094      * inline function
2095
2096      * implicit instantiations of static data members of class
2097        templates
2098
2099      * virtual tables
2100
2101      * typeinfo objects
2102
2103      Furthermore, all entities that reach this point must have a
2104      definition available in this translation unit.
2105
2106      The following assertions check these conditions.  */
2107   gcc_assert (TREE_CODE (decl) == FUNCTION_DECL
2108               || TREE_CODE (decl) == VAR_DECL);
2109   /* Any code that creates entities with TREE_PUBLIC cleared should
2110      also set DECL_INTERFACE_KNOWN.  */
2111   gcc_assert (TREE_PUBLIC (decl));
2112   if (TREE_CODE (decl) == FUNCTION_DECL)
2113     gcc_assert (DECL_IMPLICIT_INSTANTIATION (decl)
2114                 || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl)
2115                 || DECL_DECLARED_INLINE_P (decl));
2116   else
2117     gcc_assert (DECL_IMPLICIT_INSTANTIATION (decl)
2118                 || DECL_VTABLE_OR_VTT_P (decl)
2119                 || DECL_TINFO_P (decl));
2120   /* Check that a definition of DECL is available in this translation
2121      unit.  */
2122   gcc_assert (!DECL_REALLY_EXTERN (decl));
2123
2124   /* Assume that DECL will not have COMDAT linkage.  */
2125   comdat_p = false;
2126   /* Assume that DECL will not be imported into this translation
2127      unit.  */
2128   import_p = false;
2129
2130   /* See if the repository tells us whether or not to emit DECL in
2131      this translation unit.  */
2132   emit_p = repo_emit_p (decl);
2133   if (emit_p == 0)
2134     import_p = true;
2135   else if (emit_p == 1)
2136     {
2137       /* The repository indicates that this entity should be defined
2138          here.  Make sure the back end honors that request.  */
2139       if (TREE_CODE (decl) == VAR_DECL)
2140         mark_needed (decl);
2141       else if (DECL_MAYBE_IN_CHARGE_CONSTRUCTOR_P (decl)
2142                || DECL_MAYBE_IN_CHARGE_DESTRUCTOR_P (decl))
2143         {
2144           tree clone;
2145           FOR_EACH_CLONE (clone, decl)
2146             mark_needed (clone);
2147         }
2148       else
2149         mark_needed (decl);
2150       /* Output the definition as an ordinary strong definition.  */
2151       DECL_EXTERNAL (decl) = 0;
2152       DECL_INTERFACE_KNOWN (decl) = 1;
2153       return;
2154     }
2155
2156   if (import_p)
2157     /* We have already decided what to do with this DECL; there is no
2158        need to check anything further.  */
2159     ;
2160   else if (TREE_CODE (decl) == VAR_DECL && DECL_VTABLE_OR_VTT_P (decl))
2161     {
2162       class_type = DECL_CONTEXT (decl);
2163       import_export_class (class_type);
2164       if (TYPE_FOR_JAVA (class_type))
2165         import_p = true;
2166       else if (CLASSTYPE_INTERFACE_KNOWN (class_type)
2167                && CLASSTYPE_INTERFACE_ONLY (class_type))
2168         import_p = true;
2169       else if ((!flag_weak || TARGET_WEAK_NOT_IN_ARCHIVE_TOC)
2170                && !CLASSTYPE_USE_TEMPLATE (class_type)
2171                && CLASSTYPE_KEY_METHOD (class_type)
2172                && !DECL_DECLARED_INLINE_P (CLASSTYPE_KEY_METHOD (class_type)))
2173         /* The ABI requires that all virtual tables be emitted with
2174            COMDAT linkage.  However, on systems where COMDAT symbols
2175            don't show up in the table of contents for a static
2176            archive, or on systems without weak symbols (where we
2177            approximate COMDAT linkage by using internal linkage), the
2178            linker will report errors about undefined symbols because
2179            it will not see the virtual table definition.  Therefore,
2180            in the case that we know that the virtual table will be
2181            emitted in only one translation unit, we make the virtual
2182            table an ordinary definition with external linkage.  */
2183         DECL_EXTERNAL (decl) = 0;
2184       else if (CLASSTYPE_INTERFACE_KNOWN (class_type))
2185         {
2186           /* CLASS_TYPE is being exported from this translation unit,
2187              so DECL should be defined here.  */
2188           if (!flag_weak && CLASSTYPE_EXPLICIT_INSTANTIATION (class_type))
2189             /* If a class is declared in a header with the "extern
2190                template" extension, then it will not be instantiated,
2191                even in translation units that would normally require
2192                it.  Often such classes are explicitly instantiated in
2193                one translation unit.  Therefore, the explicit
2194                instantiation must be made visible to other translation
2195                units.  */
2196             DECL_EXTERNAL (decl) = 0;
2197           else
2198             {
2199               /* The generic C++ ABI says that class data is always
2200                  COMDAT, even if there is a key function.  Some
2201                  variants (e.g., the ARM EABI) says that class data
2202                  only has COMDAT linkage if the class data might be
2203                  emitted in more than one translation unit.  When the
2204                  key method can be inline and is inline, we still have
2205                  to arrange for comdat even though
2206                  class_data_always_comdat is false.  */
2207               if (!CLASSTYPE_KEY_METHOD (class_type)
2208                   || DECL_DECLARED_INLINE_P (CLASSTYPE_KEY_METHOD (class_type))
2209                   || targetm.cxx.class_data_always_comdat ())
2210                 {
2211                   /* The ABI requires COMDAT linkage.  Normally, we
2212                      only emit COMDAT things when they are needed;
2213                      make sure that we realize that this entity is
2214                      indeed needed.  */
2215                   comdat_p = true;
2216                   mark_needed (decl);
2217                 }
2218             }
2219         }
2220       else if (!flag_implicit_templates
2221                && CLASSTYPE_IMPLICIT_INSTANTIATION (class_type))
2222         import_p = true;
2223       else
2224         comdat_p = true;
2225     }
2226   else if (TREE_CODE (decl) == VAR_DECL && DECL_TINFO_P (decl))
2227     {
2228       tree type = TREE_TYPE (DECL_NAME (decl));
2229       if (CLASS_TYPE_P (type))
2230         {
2231           class_type = type;
2232           import_export_class (type);
2233           if (CLASSTYPE_INTERFACE_KNOWN (type)
2234               && TYPE_POLYMORPHIC_P (type)
2235               && CLASSTYPE_INTERFACE_ONLY (type)
2236               /* If -fno-rtti was specified, then we cannot be sure
2237                  that RTTI information will be emitted with the
2238                  virtual table of the class, so we must emit it
2239                  wherever it is used.  */
2240               && flag_rtti)
2241             import_p = true;
2242           else
2243             {
2244               if (CLASSTYPE_INTERFACE_KNOWN (type)
2245                   && !CLASSTYPE_INTERFACE_ONLY (type))
2246                 {
2247                   comdat_p = (targetm.cxx.class_data_always_comdat ()
2248                               || (CLASSTYPE_KEY_METHOD (type)
2249                                   && DECL_DECLARED_INLINE_P (CLASSTYPE_KEY_METHOD (type))));
2250                   mark_needed (decl);
2251                   if (!flag_weak)
2252                     {
2253                       comdat_p = false;
2254                       DECL_EXTERNAL (decl) = 0;
2255                     }
2256                 }
2257               else
2258                 comdat_p = true;
2259             }
2260         }
2261       else
2262         comdat_p = true;
2263     }
2264   else if (DECL_TEMPLATE_INSTANTIATION (decl)
2265            || DECL_FRIEND_PSEUDO_TEMPLATE_INSTANTIATION (decl))
2266     {
2267       /* DECL is an implicit instantiation of a function or static
2268          data member.  */
2269       if ((flag_implicit_templates
2270            && !flag_use_repository)
2271           || (flag_implicit_inline_templates
2272               && TREE_CODE (decl) == FUNCTION_DECL
2273               && DECL_DECLARED_INLINE_P (decl)))
2274         comdat_p = true;
2275       else
2276         /* If we are not implicitly generating templates, then mark
2277            this entity as undefined in this translation unit.  */
2278         import_p = true;
2279     }
2280   else if (DECL_FUNCTION_MEMBER_P (decl))
2281     {
2282       if (!DECL_DECLARED_INLINE_P (decl))
2283         {
2284           tree ctype = DECL_CONTEXT (decl);
2285           import_export_class (ctype);
2286           if (CLASSTYPE_INTERFACE_KNOWN (ctype))
2287             {
2288               DECL_NOT_REALLY_EXTERN (decl)
2289                 = ! (CLASSTYPE_INTERFACE_ONLY (ctype)
2290                      || (DECL_DECLARED_INLINE_P (decl)
2291                          && ! flag_implement_inlines
2292                          && !DECL_VINDEX (decl)));
2293
2294               if (!DECL_NOT_REALLY_EXTERN (decl))
2295                 DECL_EXTERNAL (decl) = 1;
2296
2297               /* Always make artificials weak.  */
2298               if (DECL_ARTIFICIAL (decl) && flag_weak)
2299                 comdat_p = true;
2300               else
2301                 maybe_make_one_only (decl);
2302             }
2303         }
2304       else
2305         comdat_p = true;
2306     }
2307   else
2308     comdat_p = true;
2309
2310   if (import_p)
2311     {
2312       /* If we are importing DECL into this translation unit, mark is
2313          an undefined here.  */
2314       DECL_EXTERNAL (decl) = 1;
2315       DECL_NOT_REALLY_EXTERN (decl) = 0;
2316     }
2317   else if (comdat_p)
2318     {
2319       /* If we decided to put DECL in COMDAT, mark it accordingly at
2320          this point.  */
2321       comdat_linkage (decl);
2322     }
2323
2324   DECL_INTERFACE_KNOWN (decl) = 1;
2325 }
2326
2327 /* Return an expression that performs the destruction of DECL, which
2328    must be a VAR_DECL whose type has a non-trivial destructor, or is
2329    an array whose (innermost) elements have a non-trivial destructor.  */
2330
2331 tree
2332 build_cleanup (tree decl)
2333 {
2334   tree temp;
2335   tree type = TREE_TYPE (decl);
2336
2337   /* This function should only be called for declarations that really
2338      require cleanups.  */
2339   gcc_assert (!TYPE_HAS_TRIVIAL_DESTRUCTOR (type));
2340
2341   /* Treat all objects with destructors as used; the destructor may do
2342      something substantive.  */
2343   mark_used (decl);
2344
2345   if (TREE_CODE (type) == ARRAY_TYPE)
2346     temp = decl;
2347   else
2348     temp = build_address (decl);
2349   temp = build_delete (TREE_TYPE (temp), temp,
2350                        sfk_complete_destructor,
2351                        LOOKUP_NORMAL|LOOKUP_NONVIRTUAL|LOOKUP_DESTRUCTOR, 0);
2352   return temp;
2353 }
2354
2355 /* Returns the initialization guard variable for the variable DECL,
2356    which has static storage duration.  */
2357
2358 tree
2359 get_guard (tree decl)
2360 {
2361   tree sname;
2362   tree guard;
2363
2364   sname = mangle_guard_variable (decl);
2365   guard = IDENTIFIER_GLOBAL_VALUE (sname);
2366   if (! guard)
2367     {
2368       tree guard_type;
2369
2370       /* We use a type that is big enough to contain a mutex as well
2371          as an integer counter.  */
2372       guard_type = targetm.cxx.guard_type ();
2373       guard = build_decl (VAR_DECL, sname, guard_type);
2374
2375       /* The guard should have the same linkage as what it guards.  */
2376       TREE_PUBLIC (guard) = TREE_PUBLIC (decl);
2377       TREE_STATIC (guard) = TREE_STATIC (decl);
2378       DECL_COMMON (guard) = DECL_COMMON (decl);
2379       DECL_ONE_ONLY (guard) = DECL_ONE_ONLY (decl);
2380       if (TREE_PUBLIC (decl))
2381         DECL_WEAK (guard) = DECL_WEAK (decl);
2382       DECL_VISIBILITY (guard) = DECL_VISIBILITY (decl);
2383       DECL_VISIBILITY_SPECIFIED (guard) = DECL_VISIBILITY_SPECIFIED (decl);
2384
2385       DECL_ARTIFICIAL (guard) = 1;
2386       DECL_IGNORED_P (guard) = 1;
2387       TREE_USED (guard) = 1;
2388       pushdecl_top_level_and_finish (guard, NULL_TREE);
2389     }
2390   return guard;
2391 }
2392
2393 /* Return those bits of the GUARD variable that should be set when the
2394    guarded entity is actually initialized.  */
2395
2396 static tree
2397 get_guard_bits (tree guard)
2398 {
2399   if (!targetm.cxx.guard_mask_bit ())
2400     {
2401       /* We only set the first byte of the guard, in order to leave room
2402          for a mutex in the high-order bits.  */
2403       guard = build1 (ADDR_EXPR,
2404                       build_pointer_type (TREE_TYPE (guard)),
2405                       guard);
2406       guard = build1 (NOP_EXPR,
2407                       build_pointer_type (char_type_node),
2408                       guard);
2409       guard = build1 (INDIRECT_REF, char_type_node, guard);
2410     }
2411
2412   return guard;
2413 }
2414
2415 /* Return an expression which determines whether or not the GUARD
2416    variable has already been initialized.  */
2417
2418 tree
2419 get_guard_cond (tree guard)
2420 {
2421   tree guard_value;
2422
2423   /* Check to see if the GUARD is zero.  */
2424   guard = get_guard_bits (guard);
2425
2426   /* Mask off all but the low bit.  */
2427   if (targetm.cxx.guard_mask_bit ())
2428     {
2429       guard_value = integer_one_node;
2430       if (!same_type_p (TREE_TYPE (guard_value), TREE_TYPE (guard)))
2431         guard_value = convert (TREE_TYPE (guard), guard_value);
2432         guard = cp_build_binary_op (BIT_AND_EXPR, guard, guard_value);
2433     }
2434
2435   guard_value = integer_zero_node;
2436   if (!same_type_p (TREE_TYPE (guard_value), TREE_TYPE (guard)))
2437     guard_value = convert (TREE_TYPE (guard), guard_value);
2438   return cp_build_binary_op (EQ_EXPR, guard, guard_value);
2439 }
2440
2441 /* Return an expression which sets the GUARD variable, indicating that
2442    the variable being guarded has been initialized.  */
2443
2444 tree
2445 set_guard (tree guard)
2446 {
2447   tree guard_init;
2448
2449   /* Set the GUARD to one.  */
2450   guard = get_guard_bits (guard);
2451   guard_init = integer_one_node;
2452   if (!same_type_p (TREE_TYPE (guard_init), TREE_TYPE (guard)))
2453     guard_init = convert (TREE_TYPE (guard), guard_init);
2454   return build_modify_expr (guard, NOP_EXPR, guard_init);
2455 }
2456
2457 /* Start the process of running a particular set of global constructors
2458    or destructors.  Subroutine of do_[cd]tors.  */
2459
2460 static tree
2461 start_objects (int method_type, int initp)
2462 {
2463   tree body;
2464   tree fndecl;
2465   char type[10];
2466
2467   /* Make ctor or dtor function.  METHOD_TYPE may be 'I' or 'D'.  */
2468
2469   if (initp != DEFAULT_INIT_PRIORITY)
2470     {
2471       char joiner;
2472
2473 #ifdef JOINER
2474       joiner = JOINER;
2475 #else
2476       joiner = '_';
2477 #endif
2478
2479       sprintf (type, "%c%c%.5u", method_type, joiner, initp);
2480     }
2481   else
2482     sprintf (type, "%c", method_type);
2483
2484   fndecl = build_lang_decl (FUNCTION_DECL,
2485                             get_file_function_name (type),
2486                             build_function_type (void_type_node,
2487                                                  void_list_node));
2488   start_preparsed_function (fndecl, /*attrs=*/NULL_TREE, SF_PRE_PARSED);
2489
2490   TREE_PUBLIC (current_function_decl) = 0;
2491
2492   /* Mark as artificial because it's not explicitly in the user's
2493      source code.  */
2494   DECL_ARTIFICIAL (current_function_decl) = 1;
2495
2496   /* Mark this declaration as used to avoid spurious warnings.  */
2497   TREE_USED (current_function_decl) = 1;
2498
2499   /* Mark this function as a global constructor or destructor.  */
2500   if (method_type == 'I')
2501     DECL_GLOBAL_CTOR_P (current_function_decl) = 1;
2502   else
2503     DECL_GLOBAL_DTOR_P (current_function_decl) = 1;
2504   DECL_LANG_SPECIFIC (current_function_decl)->decl_flags.u2sel = 1;
2505
2506   body = begin_compound_stmt (BCS_FN_BODY);
2507
2508   return body;
2509 }
2510
2511 /* Finish the process of running a particular set of global constructors
2512    or destructors.  Subroutine of do_[cd]tors.  */
2513
2514 static void
2515 finish_objects (int method_type, int initp, tree body)
2516 {
2517   tree fn;
2518
2519   /* Finish up.  */
2520   finish_compound_stmt (body);
2521   fn = finish_function (0);
2522
2523   if (method_type == 'I')
2524     {
2525       DECL_STATIC_CONSTRUCTOR (fn) = 1;
2526       decl_init_priority_insert (fn, initp);
2527     }
2528   else
2529     {
2530       DECL_STATIC_DESTRUCTOR (fn) = 1;
2531       decl_fini_priority_insert (fn, initp);
2532     }
2533
2534   expand_or_defer_fn (fn);
2535 }
2536
2537 /* The names of the parameters to the function created to handle
2538    initializations and destructions for objects with static storage
2539    duration.  */
2540 #define INITIALIZE_P_IDENTIFIER "__initialize_p"
2541 #define PRIORITY_IDENTIFIER "__priority"
2542
2543 /* The name of the function we create to handle initializations and
2544    destructions for objects with static storage duration.  */
2545 #define SSDF_IDENTIFIER "__static_initialization_and_destruction"
2546
2547 /* The declaration for the __INITIALIZE_P argument.  */
2548 static GTY(()) tree initialize_p_decl;
2549
2550 /* The declaration for the __PRIORITY argument.  */
2551 static GTY(()) tree priority_decl;
2552
2553 /* The declaration for the static storage duration function.  */
2554 static GTY(()) tree ssdf_decl;
2555
2556 /* All the static storage duration functions created in this
2557    translation unit.  */
2558 static GTY(()) VEC(tree,gc) *ssdf_decls;
2559
2560 /* A map from priority levels to information about that priority
2561    level.  There may be many such levels, so efficient lookup is
2562    important.  */
2563 static splay_tree priority_info_map;
2564
2565 /* Begins the generation of the function that will handle all
2566    initialization and destruction of objects with static storage
2567    duration.  The function generated takes two parameters of type
2568    `int': __INITIALIZE_P and __PRIORITY.  If __INITIALIZE_P is
2569    nonzero, it performs initializations.  Otherwise, it performs
2570    destructions.  It only performs those initializations or
2571    destructions with the indicated __PRIORITY.  The generated function
2572    returns no value.
2573
2574    It is assumed that this function will only be called once per
2575    translation unit.  */
2576
2577 static tree
2578 start_static_storage_duration_function (unsigned count)
2579 {
2580   tree parm_types;
2581   tree type;
2582   tree body;
2583   char id[sizeof (SSDF_IDENTIFIER) + 1 /* '\0' */ + 32];
2584
2585   /* Create the identifier for this function.  It will be of the form
2586      SSDF_IDENTIFIER_<number>.  */
2587   sprintf (id, "%s_%u", SSDF_IDENTIFIER, count);
2588
2589   /* Create the parameters.  */
2590   parm_types = void_list_node;
2591   parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2592   parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types);
2593   type = build_function_type (void_type_node, parm_types);
2594
2595   /* Create the FUNCTION_DECL itself.  */
2596   ssdf_decl = build_lang_decl (FUNCTION_DECL,
2597                                get_identifier (id),
2598                                type);
2599   TREE_PUBLIC (ssdf_decl) = 0;
2600   DECL_ARTIFICIAL (ssdf_decl) = 1;
2601   DECL_INLINE (ssdf_decl) = 1;
2602
2603   /* Put this function in the list of functions to be called from the
2604      static constructors and destructors.  */
2605   if (!ssdf_decls)
2606     {
2607       ssdf_decls = VEC_alloc (tree, gc, 32);
2608
2609       /* Take this opportunity to initialize the map from priority
2610          numbers to information about that priority level.  */
2611       priority_info_map = splay_tree_new (splay_tree_compare_ints,
2612                                           /*delete_key_fn=*/0,
2613                                           /*delete_value_fn=*/
2614                                           (splay_tree_delete_value_fn) &free);
2615
2616       /* We always need to generate functions for the
2617          DEFAULT_INIT_PRIORITY so enter it now.  That way when we walk
2618          priorities later, we'll be sure to find the
2619          DEFAULT_INIT_PRIORITY.  */
2620       get_priority_info (DEFAULT_INIT_PRIORITY);
2621     }
2622
2623   VEC_safe_push (tree, gc, ssdf_decls, ssdf_decl);
2624
2625   /* Create the argument list.  */
2626   initialize_p_decl = cp_build_parm_decl
2627     (get_identifier (INITIALIZE_P_IDENTIFIER), integer_type_node);
2628   DECL_CONTEXT (initialize_p_decl) = ssdf_decl;
2629   TREE_USED (initialize_p_decl) = 1;
2630   priority_decl = cp_build_parm_decl
2631     (get_identifier (PRIORITY_IDENTIFIER), integer_type_node);
2632   DECL_CONTEXT (priority_decl) = ssdf_decl;
2633   TREE_USED (priority_decl) = 1;
2634
2635   TREE_CHAIN (initialize_p_decl) = priority_decl;
2636   DECL_ARGUMENTS (ssdf_decl) = initialize_p_decl;
2637
2638   /* Put the function in the global scope.  */
2639   pushdecl (ssdf_decl);
2640
2641   /* Start the function itself.  This is equivalent to declaring the
2642      function as:
2643
2644        static void __ssdf (int __initialize_p, init __priority_p);
2645
2646      It is static because we only need to call this function from the
2647      various constructor and destructor functions for this module.  */
2648   start_preparsed_function (ssdf_decl,
2649                             /*attrs=*/NULL_TREE,
2650                             SF_PRE_PARSED);
2651
2652   /* Set up the scope of the outermost block in the function.  */
2653   body = begin_compound_stmt (BCS_FN_BODY);
2654
2655   return body;
2656 }
2657
2658 /* Finish the generation of the function which performs initialization
2659    and destruction of objects with static storage duration.  After
2660    this point, no more such objects can be created.  */
2661
2662 static void
2663 finish_static_storage_duration_function (tree body)
2664 {
2665   /* Close out the function.  */
2666   finish_compound_stmt (body);
2667   expand_or_defer_fn (finish_function (0));
2668 }
2669
2670 /* Return the information about the indicated PRIORITY level.  If no
2671    code to handle this level has yet been generated, generate the
2672    appropriate prologue.  */
2673
2674 static priority_info
2675 get_priority_info (int priority)
2676 {
2677   priority_info pi;
2678   splay_tree_node n;
2679
2680   n = splay_tree_lookup (priority_info_map,
2681                          (splay_tree_key) priority);
2682   if (!n)
2683     {
2684       /* Create a new priority information structure, and insert it
2685          into the map.  */
2686       pi = XNEW (struct priority_info_s);
2687       pi->initializations_p = 0;
2688       pi->destructions_p = 0;
2689       splay_tree_insert (priority_info_map,
2690                          (splay_tree_key) priority,
2691                          (splay_tree_value) pi);
2692     }
2693   else
2694     pi = (priority_info) n->value;
2695
2696   return pi;
2697 }
2698
2699 /* The effective initialization priority of a DECL.  */
2700
2701 #define DECL_EFFECTIVE_INIT_PRIORITY(decl)                                    \
2702         ((!DECL_HAS_INIT_PRIORITY_P (decl) || DECL_INIT_PRIORITY (decl) == 0) \
2703          ? DEFAULT_INIT_PRIORITY : DECL_INIT_PRIORITY (decl))
2704
2705 /* Whether a DECL needs a guard to protect it against multiple
2706    initialization.  */
2707
2708 #define NEEDS_GUARD_P(decl) (TREE_PUBLIC (decl) && (DECL_COMMON (decl)      \
2709                                                     || DECL_ONE_ONLY (decl) \
2710                                                     || DECL_WEAK (decl)))
2711
2712 /* Set up to handle the initialization or destruction of DECL.  If
2713    INITP is nonzero, we are initializing the variable.  Otherwise, we
2714    are destroying it.  */
2715
2716 static void
2717 one_static_initialization_or_destruction (tree decl, tree init, bool initp)
2718 {
2719   tree guard_if_stmt = NULL_TREE;
2720   tree guard;
2721
2722   /* If we are supposed to destruct and there's a trivial destructor,
2723      nothing has to be done.  */
2724   if (!initp
2725       && TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
2726     return;
2727
2728   /* Trick the compiler into thinking we are at the file and line
2729      where DECL was declared so that error-messages make sense, and so
2730      that the debugger will show somewhat sensible file and line
2731      information.  */
2732   input_location = DECL_SOURCE_LOCATION (decl);
2733
2734   /* Because of:
2735
2736        [class.access.spec]
2737
2738        Access control for implicit calls to the constructors,
2739        the conversion functions, or the destructor called to
2740        create and destroy a static data member is performed as
2741        if these calls appeared in the scope of the member's
2742        class.
2743
2744      we pretend we are in a static member function of the class of
2745      which the DECL is a member.  */
2746   if (member_p (decl))
2747     {
2748       DECL_CONTEXT (current_function_decl) = DECL_CONTEXT (decl);
2749       DECL_STATIC_FUNCTION_P (current_function_decl) = 1;
2750     }
2751
2752   /* Assume we don't need a guard.  */
2753   guard = NULL_TREE;
2754   /* We need a guard if this is an object with external linkage that
2755      might be initialized in more than one place.  (For example, a
2756      static data member of a template, when the data member requires
2757      construction.)  */
2758   if (NEEDS_GUARD_P (decl))
2759     {
2760       tree guard_cond;
2761
2762       guard = get_guard (decl);
2763
2764       /* When using __cxa_atexit, we just check the GUARD as we would
2765          for a local static.  */
2766       if (flag_use_cxa_atexit)
2767         {
2768           /* When using __cxa_atexit, we never try to destroy
2769              anything from a static destructor.  */
2770           gcc_assert (initp);
2771           guard_cond = get_guard_cond (guard);
2772         }
2773       /* If we don't have __cxa_atexit, then we will be running
2774          destructors from .fini sections, or their equivalents.  So,
2775          we need to know how many times we've tried to initialize this
2776          object.  We do initializations only if the GUARD is zero,
2777          i.e., if we are the first to initialize the variable.  We do
2778          destructions only if the GUARD is one, i.e., if we are the
2779          last to destroy the variable.  */
2780       else if (initp)
2781         guard_cond
2782           = cp_build_binary_op (EQ_EXPR,
2783                                 build_unary_op (PREINCREMENT_EXPR,
2784                                                 guard,
2785                                                 /*noconvert=*/1),
2786                                 integer_one_node);
2787       else
2788         guard_cond
2789           = cp_build_binary_op (EQ_EXPR,
2790                                 build_unary_op (PREDECREMENT_EXPR,
2791                                                 guard,
2792                                                 /*noconvert=*/1),
2793                                 integer_zero_node);
2794
2795       guard_if_stmt = begin_if_stmt ();
2796       finish_if_stmt_cond (guard_cond, guard_if_stmt);
2797     }
2798
2799
2800   /* If we're using __cxa_atexit, we have not already set the GUARD,
2801      so we must do so now.  */
2802   if (guard && initp && flag_use_cxa_atexit)
2803     finish_expr_stmt (set_guard (guard));
2804
2805   /* Perform the initialization or destruction.  */
2806   if (initp)
2807     {
2808       if (init)
2809         finish_expr_stmt (init);
2810
2811       /* If we're using __cxa_atexit, register a function that calls the
2812          destructor for the object.  */
2813       if (flag_use_cxa_atexit)
2814         finish_expr_stmt (register_dtor_fn (decl));
2815     }
2816   else
2817     finish_expr_stmt (build_cleanup (decl));
2818
2819   /* Finish the guard if-stmt, if necessary.  */
2820   if (guard)
2821     {
2822       finish_then_clause (guard_if_stmt);
2823       finish_if_stmt (guard_if_stmt);
2824     }
2825
2826   /* Now that we're done with DECL we don't need to pretend to be a
2827      member of its class any longer.  */
2828   DECL_CONTEXT (current_function_decl) = NULL_TREE;
2829   DECL_STATIC_FUNCTION_P (current_function_decl) = 0;
2830 }
2831
2832 /* Generate code to do the initialization or destruction of the decls in VARS,
2833    a TREE_LIST of VAR_DECL with static storage duration.
2834    Whether initialization or destruction is performed is specified by INITP.  */
2835
2836 static void
2837 do_static_initialization_or_destruction (tree vars, bool initp)
2838 {
2839   tree node, init_if_stmt, cond;
2840
2841   /* Build the outer if-stmt to check for initialization or destruction.  */
2842   init_if_stmt = begin_if_stmt ();
2843   cond = initp ? integer_one_node : integer_zero_node;
2844   cond = cp_build_binary_op (EQ_EXPR,
2845                                   initialize_p_decl,
2846                                   cond);
2847   finish_if_stmt_cond (cond, init_if_stmt);
2848
2849   node = vars;
2850   do {
2851     tree decl = TREE_VALUE (node);
2852     tree priority_if_stmt;
2853     int priority;
2854     priority_info pi;
2855
2856     /* If we don't need a destructor, there's nothing to do.  Avoid
2857        creating a possibly empty if-stmt.  */
2858     if (!initp && TYPE_HAS_TRIVIAL_DESTRUCTOR (TREE_TYPE (decl)))
2859       {
2860         node = TREE_CHAIN (node);
2861         continue;
2862       }
2863
2864     /* Remember that we had an initialization or finalization at this
2865        priority.  */
2866     priority = DECL_EFFECTIVE_INIT_PRIORITY (decl);
2867     pi = get_priority_info (priority);
2868     if (initp)
2869       pi->initializations_p = 1;
2870     else
2871       pi->destructions_p = 1;
2872
2873     /* Conditionalize this initialization on being in the right priority
2874        and being initializing/finalizing appropriately.  */
2875     priority_if_stmt = begin_if_stmt ();
2876     cond = cp_build_binary_op (EQ_EXPR,
2877                                priority_decl,
2878                                build_int_cst (NULL_TREE, priority));
2879     finish_if_stmt_cond (cond, priority_if_stmt);
2880
2881     /* Process initializers with same priority.  */
2882     for (; node
2883            && DECL_EFFECTIVE_INIT_PRIORITY (TREE_VALUE (node)) == priority;
2884          node = TREE_CHAIN (node))
2885       /* Do one initialization or destruction.  */
2886       one_static_initialization_or_destruction (TREE_VALUE (node),
2887                                                 TREE_PURPOSE (node), initp);
2888
2889     /* Finish up the priority if-stmt body.  */
2890     finish_then_clause (priority_if_stmt);
2891     finish_if_stmt (priority_if_stmt);
2892
2893   } while (node);
2894
2895   /* Finish up the init/destruct if-stmt body.  */
2896   finish_then_clause (init_if_stmt);
2897   finish_if_stmt (init_if_stmt);
2898 }
2899
2900 /* VARS is a list of variables with static storage duration which may
2901    need initialization and/or finalization.  Remove those variables
2902    that don't really need to be initialized or finalized, and return
2903    the resulting list.  The order in which the variables appear in
2904    VARS is in reverse order of the order in which they should actually
2905    be initialized.  The list we return is in the unreversed order;
2906    i.e., the first variable should be initialized first.  */
2907
2908 static tree
2909 prune_vars_needing_no_initialization (tree *vars)
2910 {
2911   tree *var = vars;
2912   tree result = NULL_TREE;
2913
2914   while (*var)
2915     {
2916       tree t = *var;
2917       tree decl = TREE_VALUE (t);
2918       tree init = TREE_PURPOSE (t);
2919
2920       /* Deal gracefully with error.  */
2921       if (decl == error_mark_node)
2922         {
2923           var = &TREE_CHAIN (t);
2924           continue;
2925         }
2926
2927       /* The only things that can be initialized are variables.  */
2928       gcc_assert (TREE_CODE (decl) == VAR_DECL);
2929
2930       /* If this object is not defined, we don't need to do anything
2931          here.  */
2932       if (DECL_EXTERNAL (decl))
2933         {
2934           var = &TREE_CHAIN (t);
2935           continue;
2936         }
2937
2938       /* Also, if the initializer already contains errors, we can bail
2939          out now.  */
2940       if (init && TREE_CODE (init) == TREE_LIST
2941           && value_member (error_mark_node, init))
2942         {
2943           var = &TREE_CHAIN (t);
2944           continue;
2945         }
2946
2947       /* This variable is going to need initialization and/or
2948          finalization, so we add it to the list.  */
2949       *var = TREE_CHAIN (t);
2950       TREE_CHAIN (t) = result;
2951       result = t;
2952     }
2953
2954   return result;
2955 }
2956
2957 /* Make sure we have told the back end about all the variables in
2958    VARS.  */
2959
2960 static void
2961 write_out_vars (tree vars)
2962 {
2963   tree v;
2964
2965   for (v = vars; v; v = TREE_CHAIN (v))
2966     {
2967       tree var = TREE_VALUE (v);
2968       if (!var_finalized_p (var))
2969         {
2970           import_export_decl (var);
2971           rest_of_decl_compilation (var, 1, 1);
2972         }
2973     }
2974 }
2975
2976 /* Generate a static constructor (if CONSTRUCTOR_P) or destructor
2977    (otherwise) that will initialize all global objects with static
2978    storage duration having the indicated PRIORITY.  */
2979
2980 static void
2981 generate_ctor_or_dtor_function (bool constructor_p, int priority,
2982                                 location_t *locus)
2983 {
2984   char function_key;
2985   tree arguments;
2986   tree fndecl;
2987   tree body;
2988   size_t i;
2989
2990   input_location = *locus;
2991 #ifdef USE_MAPPED_LOCATION
2992   /* ??? */
2993 #else
2994   locus->line++;
2995 #endif
2996
2997   /* We use `I' to indicate initialization and `D' to indicate
2998      destruction.  */
2999   function_key = constructor_p ? 'I' : 'D';
3000
3001   /* We emit the function lazily, to avoid generating empty
3002      global constructors and destructors.  */
3003   body = NULL_TREE;
3004
3005   /* For Objective-C++, we may need to initialize metadata found in this module.
3006      This must be done _before_ any other static initializations.  */
3007   if (c_dialect_objc () && (priority == DEFAULT_INIT_PRIORITY)
3008       && constructor_p && objc_static_init_needed_p ())
3009     {
3010       body = start_objects (function_key, priority);
3011       objc_generate_static_init_call (NULL_TREE);
3012     }
3013
3014   /* Call the static storage duration function with appropriate
3015      arguments.  */
3016   for (i = 0; VEC_iterate (tree, ssdf_decls, i, fndecl); ++i)
3017     {
3018       /* Calls to pure or const functions will expand to nothing.  */
3019       if (! (flags_from_decl_or_type (fndecl) & (ECF_CONST | ECF_PURE)))
3020         {
3021           if (! body)
3022             body = start_objects (function_key, priority);
3023
3024           arguments = tree_cons (NULL_TREE,
3025                                  build_int_cst (NULL_TREE, priority),
3026                                  NULL_TREE);
3027           arguments = tree_cons (NULL_TREE,
3028                                  build_int_cst (NULL_TREE, constructor_p),
3029                                  arguments);
3030           finish_expr_stmt (build_function_call (fndecl, arguments));
3031         }
3032     }
3033
3034   /* Close out the function.  */
3035   if (body)
3036     finish_objects (function_key, priority, body);
3037 }
3038
3039 /* Generate constructor and destructor functions for the priority
3040    indicated by N.  */
3041
3042 static int
3043 generate_ctor_and_dtor_functions_for_priority (splay_tree_node n, void * data)
3044 {
3045   location_t *locus = (location_t *) data;
3046   int priority = (int) n->key;
3047   priority_info pi = (priority_info) n->value;
3048
3049   /* Generate the functions themselves, but only if they are really
3050      needed.  */
3051   if (pi->initializations_p)
3052     generate_ctor_or_dtor_function (/*constructor_p=*/true, priority, locus);
3053   if (pi->destructions_p)
3054     generate_ctor_or_dtor_function (/*constructor_p=*/false, priority, locus);
3055
3056   /* Keep iterating.  */
3057   return 0;
3058 }
3059
3060 /* Called via LANGHOOK_CALLGRAPH_ANALYZE_EXPR.  It is supposed to mark
3061    decls referenced from front-end specific constructs; it will be called
3062    only for language-specific tree nodes.
3063
3064    Here we must deal with member pointers.  */
3065
3066 tree
3067 cxx_callgraph_analyze_expr (tree *tp, int *walk_subtrees ATTRIBUTE_UNUSED)
3068 {
3069   tree t = *tp;
3070
3071   switch (TREE_CODE (t))
3072     {
3073     case PTRMEM_CST:
3074       if (TYPE_PTRMEMFUNC_P (TREE_TYPE (t)))
3075         cgraph_mark_needed_node (cgraph_node (PTRMEM_CST_MEMBER (t)));
3076       break;
3077     case BASELINK:
3078       if (TREE_CODE (BASELINK_FUNCTIONS (t)) == FUNCTION_DECL)
3079         cgraph_mark_needed_node (cgraph_node (BASELINK_FUNCTIONS (t)));
3080       break;
3081     case VAR_DECL:
3082       if (DECL_VTABLE_OR_VTT_P (t))
3083         {
3084           /* The ABI requires that all virtual tables be emitted
3085              whenever one of them is.  */
3086           tree vtbl;
3087           for (vtbl = CLASSTYPE_VTABLES (DECL_CONTEXT (t));
3088                vtbl;
3089                vtbl = TREE_CHAIN (vtbl))
3090             mark_decl_referenced (vtbl);
3091         }
3092       else if (DECL_CONTEXT (t)
3093                && TREE_CODE (DECL_CONTEXT (t)) == FUNCTION_DECL)
3094         /* If we need a static variable in a function, then we
3095            need the containing function.  */
3096         mark_decl_referenced (DECL_CONTEXT (t));
3097       break;
3098     default:
3099       break;
3100     }
3101
3102   return NULL;
3103 }
3104
3105 /* Java requires that we be able to reference a local address for a
3106    method, and not be confused by PLT entries.  If hidden aliases are
3107    supported, emit one for each java function that we've emitted.  */
3108
3109 static void
3110 build_java_method_aliases (void)
3111 {
3112   struct cgraph_node *node;
3113
3114 #ifndef HAVE_GAS_HIDDEN
3115   return;
3116 #endif
3117
3118   for (node = cgraph_nodes; node ; node = node->next)
3119     {
3120       tree fndecl = node->decl;
3121
3122       if (TREE_ASM_WRITTEN (fndecl)
3123           && DECL_CONTEXT (fndecl)
3124           && TYPE_P (DECL_CONTEXT (fndecl))
3125           && TYPE_FOR_JAVA (DECL_CONTEXT (fndecl))
3126           && TARGET_USE_LOCAL_THUNK_ALIAS_P (fndecl))
3127         {
3128           /* Mangle the name in a predictable way; we need to reference
3129              this from a java compiled object file.  */
3130           tree oid, nid, alias;
3131           const char *oname;
3132           char *nname;
3133
3134           oid = DECL_ASSEMBLER_NAME (fndecl);
3135           oname = IDENTIFIER_POINTER (oid);
3136           gcc_assert (oname[0] == '_' && oname[1] == 'Z');
3137           nname = ACONCAT (("_ZGA", oname+2, NULL));
3138           nid = get_identifier (nname);
3139
3140           alias = make_alias_for (fndecl, nid);
3141           TREE_PUBLIC (alias) = 1;
3142           DECL_VISIBILITY (alias) = VISIBILITY_HIDDEN;
3143
3144           assemble_alias (alias, oid);
3145         }
3146     }
3147 }
3148
3149 /* This routine is called at the end of compilation.
3150    Its job is to create all the code needed to initialize and
3151    destroy the global aggregates.  We do the destruction
3152    first, since that way we only need to reverse the decls once.  */
3153
3154 void
3155 cp_write_global_declarations (void)
3156 {
3157   tree vars;
3158   bool reconsider;
3159   size_t i;
3160   location_t locus;
3161   unsigned ssdf_count = 0;
3162   int retries = 0;
3163   tree decl;
3164
3165   locus = input_location;
3166   at_eof = 1;
3167
3168   /* Bad parse errors.  Just forget about it.  */
3169   if (! global_bindings_p () || current_class_type || decl_namespace_list)
3170     return;
3171
3172   if (pch_file)
3173     c_common_write_pch ();
3174
3175 #ifdef USE_MAPPED_LOCATION
3176   /* FIXME - huh? */
3177 #else
3178   /* Otherwise, GDB can get confused, because in only knows
3179      about source for LINENO-1 lines.  */
3180   input_line -= 1;
3181 #endif
3182
3183   /* We now have to write out all the stuff we put off writing out.
3184      These include:
3185
3186        o Template specializations that we have not yet instantiated,
3187          but which are needed.
3188        o Initialization and destruction for non-local objects with
3189          static storage duration.  (Local objects with static storage
3190          duration are initialized when their scope is first entered,
3191          and are cleaned up via atexit.)
3192        o Virtual function tables.
3193
3194      All of these may cause others to be needed.  For example,
3195      instantiating one function may cause another to be needed, and
3196      generating the initializer for an object may cause templates to be
3197      instantiated, etc., etc.  */
3198
3199   timevar_push (TV_VARCONST);
3200
3201   emit_support_tinfos ();
3202
3203   do
3204     {
3205       tree t;
3206       tree decl;
3207
3208       reconsider = false;
3209
3210       /* If there are templates that we've put off instantiating, do
3211          them now.  */
3212       instantiate_pending_templates (retries);
3213       ggc_collect ();
3214
3215       /* Write out virtual tables as required.  Note that writing out
3216          the virtual table for a template class may cause the
3217          instantiation of members of that class.  If we write out
3218          vtables then we remove the class from our list so we don't
3219          have to look at it again.  */
3220
3221       while (keyed_classes != NULL_TREE
3222              && maybe_emit_vtables (TREE_VALUE (keyed_classes)))
3223         {
3224           reconsider = true;
3225           keyed_classes = TREE_CHAIN (keyed_classes);
3226         }
3227
3228       t = keyed_classes;
3229       if (t != NULL_TREE)
3230         {
3231           tree next = TREE_CHAIN (t);
3232
3233           while (next)
3234             {
3235               if (maybe_emit_vtables (TREE_VALUE (next)))
3236                 {
3237                   reconsider = true;
3238                   TREE_CHAIN (t) = TREE_CHAIN (next);
3239                 }
3240               else
3241                 t = next;
3242
3243               next = TREE_CHAIN (t);
3244             }
3245         }
3246
3247       /* Write out needed type info variables.  We have to be careful
3248          looping through unemitted decls, because emit_tinfo_decl may
3249          cause other variables to be needed. New elements will be
3250          appended, and we remove from the vector those that actually
3251          get emitted.  */
3252       for (i = VEC_length (tree, unemitted_tinfo_decls);
3253            VEC_iterate (tree, unemitted_tinfo_decls, --i, t);)
3254         if (emit_tinfo_decl (t))
3255           {
3256             reconsider = true;
3257             VEC_unordered_remove (tree, unemitted_tinfo_decls, i);
3258           }
3259
3260       /* The list of objects with static storage duration is built up
3261          in reverse order.  We clear STATIC_AGGREGATES so that any new
3262          aggregates added during the initialization of these will be
3263          initialized in the correct order when we next come around the
3264          loop.  */
3265       vars = prune_vars_needing_no_initialization (&static_aggregates);
3266
3267       if (vars)
3268         {
3269           /* We need to start a new initialization function each time
3270              through the loop.  That's because we need to know which
3271              vtables have been referenced, and TREE_SYMBOL_REFERENCED
3272              isn't computed until a function is finished, and written
3273              out.  That's a deficiency in the back end.  When this is
3274              fixed, these initialization functions could all become
3275              inline, with resulting performance improvements.  */
3276           tree ssdf_body;
3277
3278           /* Set the line and file, so that it is obviously not from
3279              the source file.  */
3280           input_location = locus;
3281           ssdf_body = start_static_storage_duration_function (ssdf_count);
3282
3283           /* Make sure the back end knows about all the variables.  */
3284           write_out_vars (vars);
3285
3286           /* First generate code to do all the initializations.  */
3287           if (vars)
3288             do_static_initialization_or_destruction (vars, /*initp=*/true);
3289
3290           /* Then, generate code to do all the destructions.  Do these
3291              in reverse order so that the most recently constructed
3292              variable is the first destroyed.  If we're using
3293              __cxa_atexit, then we don't need to do this; functions
3294              were registered at initialization time to destroy the
3295              local statics.  */
3296           if (!flag_use_cxa_atexit && vars)
3297             {
3298               vars = nreverse (vars);
3299               do_static_initialization_or_destruction (vars, /*initp=*/false);
3300             }
3301           else
3302             vars = NULL_TREE;
3303
3304           /* Finish up the static storage duration function for this
3305              round.  */
3306           input_location = locus;
3307           finish_static_storage_duration_function (ssdf_body);
3308
3309           /* All those initializations and finalizations might cause
3310              us to need more inline functions, more template
3311              instantiations, etc.  */
3312           reconsider = true;
3313           ssdf_count++;
3314 #ifdef USE_MAPPED_LOCATION
3315           /* ??? */
3316 #else
3317           locus.line++;
3318 #endif
3319         }
3320
3321       /* Go through the set of inline functions whose bodies have not
3322          been emitted yet.  If out-of-line copies of these functions
3323          are required, emit them.  */
3324       for (i = 0; VEC_iterate (tree, deferred_fns, i, decl); ++i)
3325         {
3326           /* Does it need synthesizing?  */
3327           if (DECL_ARTIFICIAL (decl) && ! DECL_INITIAL (decl)
3328               && (! DECL_REALLY_EXTERN (decl) || DECL_INLINE (decl)))
3329             {
3330               /* Even though we're already at the top-level, we push
3331                  there again.  That way, when we pop back a few lines
3332                  hence, all of our state is restored.  Otherwise,
3333                  finish_function doesn't clean things up, and we end
3334                  up with CURRENT_FUNCTION_DECL set.  */
3335               push_to_top_level ();
3336               /* The decl's location will mark where it was first
3337                  needed.  Save that so synthesize method can indicate
3338                  where it was needed from, in case of error  */
3339               input_location = DECL_SOURCE_LOCATION (decl);
3340               synthesize_method (decl);
3341               pop_from_top_level ();
3342               reconsider = true;
3343             }
3344
3345           if (!DECL_SAVED_TREE (decl))
3346             continue;
3347
3348           /* We lie to the back end, pretending that some functions
3349              are not defined when they really are.  This keeps these
3350              functions from being put out unnecessarily.  But, we must
3351              stop lying when the functions are referenced, or if they
3352              are not comdat since they need to be put out now.  If
3353              DECL_INTERFACE_KNOWN, then we have already set
3354              DECL_EXTERNAL appropriately, so there's no need to check
3355              again, and we do not want to clear DECL_EXTERNAL if a
3356              previous call to import_export_decl set it.
3357
3358              This is done in a separate for cycle, because if some
3359              deferred function is contained in another deferred
3360              function later in deferred_fns varray,
3361              rest_of_compilation would skip this function and we
3362              really cannot expand the same function twice.  */
3363           import_export_decl (decl);
3364           if (DECL_NOT_REALLY_EXTERN (decl)
3365               && DECL_INITIAL (decl)
3366               && decl_needed_p (decl))
3367             DECL_EXTERNAL (decl) = 0;
3368
3369           /* If we're going to need to write this function out, and
3370              there's already a body for it, create RTL for it now.
3371              (There might be no body if this is a method we haven't
3372              gotten around to synthesizing yet.)  */
3373           if (!DECL_EXTERNAL (decl)
3374               && decl_needed_p (decl)
3375               && !TREE_ASM_WRITTEN (decl)
3376               && !cgraph_node (decl)->local.finalized)
3377             {
3378               /* We will output the function; no longer consider it in this
3379                  loop.  */
3380               DECL_DEFER_OUTPUT (decl) = 0;
3381               /* Generate RTL for this function now that we know we
3382                  need it.  */
3383               expand_or_defer_fn (decl);
3384               /* If we're compiling -fsyntax-only pretend that this
3385                  function has been written out so that we don't try to
3386                  expand it again.  */
3387               if (flag_syntax_only)
3388                 TREE_ASM_WRITTEN (decl) = 1;
3389               reconsider = true;
3390             }
3391         }
3392
3393       if (walk_namespaces (wrapup_globals_for_namespace, /*data=*/0))
3394         reconsider = true;
3395
3396       /* Static data members are just like namespace-scope globals.  */
3397       for (i = 0; VEC_iterate (tree, pending_statics, i, decl); ++i)
3398         {
3399           if (var_finalized_p (decl) || DECL_REALLY_EXTERN (decl)
3400               /* Don't write it out if we haven't seen a definition.  */
3401               || DECL_IN_AGGR_P (decl))
3402             continue;
3403           import_export_decl (decl);
3404           /* If this static data member is needed, provide it to the
3405              back end.  */
3406           if (DECL_NOT_REALLY_EXTERN (decl) && decl_needed_p (decl))
3407             DECL_EXTERNAL (decl) = 0;
3408         }
3409       if (VEC_length (tree, pending_statics) != 0
3410           && wrapup_global_declarations (VEC_address (tree, pending_statics),
3411                                          VEC_length (tree, pending_statics)))
3412         reconsider = true;
3413
3414       retries++;
3415     }
3416   while (reconsider);
3417
3418   /* All used inline functions must have a definition at this point.  */
3419   for (i = 0; VEC_iterate (tree, deferred_fns, i, decl); ++i)
3420     {
3421       if (/* Check online inline functions that were actually used.  */
3422           TREE_USED (decl) && DECL_DECLARED_INLINE_P (decl)
3423           /* If the definition actually was available here, then the
3424              fact that the function was not defined merely represents
3425              that for some reason (use of a template repository,
3426              #pragma interface, etc.) we decided not to emit the
3427              definition here.  */
3428           && !DECL_INITIAL (decl)
3429           /* An explicit instantiation can be used to specify
3430              that the body is in another unit. It will have
3431              already verified there was a definition.  */
3432           && !DECL_EXPLICIT_INSTANTIATION (decl))
3433         {
3434           warning (0, "inline function %q+D used but never defined", decl);
3435           /* Avoid a duplicate warning from check_global_declaration_1.  */
3436           TREE_NO_WARNING (decl) = 1;
3437         }
3438     }
3439
3440   /* We give C linkage to static constructors and destructors.  */
3441   push_lang_context (lang_name_c);
3442
3443   /* Generate initialization and destruction functions for all
3444      priorities for which they are required.  */
3445   if (priority_info_map)
3446     splay_tree_foreach (priority_info_map,
3447                         generate_ctor_and_dtor_functions_for_priority,
3448                         /*data=*/&locus);
3449   else if (c_dialect_objc () && objc_static_init_needed_p ())
3450     /* If this is obj-c++ and we need a static init, call
3451        generate_ctor_or_dtor_function.  */
3452     generate_ctor_or_dtor_function (/*constructor_p=*/true,
3453                                     DEFAULT_INIT_PRIORITY, &locus);
3454
3455   /* We're done with the splay-tree now.  */
3456   if (priority_info_map)
3457     splay_tree_delete (priority_info_map);
3458
3459   /* Generate any missing aliases.  */
3460   maybe_apply_pending_pragma_weaks ();
3461
3462   /* We're done with static constructors, so we can go back to "C++"
3463      linkage now.  */
3464   pop_lang_context ();
3465
3466   cgraph_finalize_compilation_unit ();
3467   cgraph_optimize ();
3468
3469   /* Now, issue warnings about static, but not defined, functions,
3470      etc., and emit debugging information.  */
3471   walk_namespaces (wrapup_globals_for_namespace, /*data=*/&reconsider);
3472   if (VEC_length (tree, pending_statics) != 0)
3473     {
3474       check_global_declarations (VEC_address (tree, pending_statics),
3475                                  VEC_length (tree, pending_statics));
3476       emit_debug_global_declarations (VEC_address (tree, pending_statics),
3477                                       VEC_length (tree, pending_statics));
3478     }
3479
3480   /* Generate hidden aliases for Java.  */
3481   build_java_method_aliases ();
3482
3483   finish_repo ();
3484
3485   /* The entire file is now complete.  If requested, dump everything
3486      to a file.  */
3487   {
3488     int flags;
3489     FILE *stream = dump_begin (TDI_tu, &flags);
3490
3491     if (stream)
3492       {
3493         dump_node (global_namespace, flags & ~TDF_SLIM, stream);
3494         dump_end (TDI_tu, stream);
3495       }
3496   }
3497
3498   timevar_pop (TV_VARCONST);
3499
3500   if (flag_detailed_statistics)
3501     {
3502       dump_tree_statistics ();
3503       dump_time_statistics ();
3504     }
3505   input_location = locus;
3506
3507 #ifdef ENABLE_CHECKING
3508   validate_conversion_obstack ();
3509 #endif /* ENABLE_CHECKING */
3510 }
3511
3512 /* FN is an OFFSET_REF, DOTSTAR_EXPR or MEMBER_REF indicating the
3513    function to call in parse-tree form; it has not yet been
3514    semantically analyzed.  ARGS are the arguments to the function.
3515    They have already been semantically analyzed.  */
3516
3517 tree
3518 build_offset_ref_call_from_tree (tree fn, tree args)
3519 {
3520   tree orig_fn;
3521   tree orig_args;
3522   tree expr;
3523   tree object;
3524
3525   orig_fn = fn;
3526   orig_args = args;
3527   object = TREE_OPERAND (fn, 0);
3528
3529   if (processing_template_decl)
3530     {
3531       gcc_assert (TREE_CODE (fn) == DOTSTAR_EXPR
3532                   || TREE_CODE (fn) == MEMBER_REF);
3533       if (type_dependent_expression_p (fn)
3534           || any_type_dependent_arguments_p (args))
3535         return build_nt_call_list (fn, args);
3536
3537       /* Transform the arguments and add the implicit "this"
3538          parameter.  That must be done before the FN is transformed
3539          because we depend on the form of FN.  */
3540       args = build_non_dependent_args (args);
3541       object = build_non_dependent_expr (object);
3542       if (TREE_CODE (fn) == DOTSTAR_EXPR)
3543         object = build_unary_op (ADDR_EXPR, object, 0);
3544       args = tree_cons (NULL_TREE, object, args);
3545       /* Now that the arguments are done, transform FN.  */
3546       fn = build_non_dependent_expr (fn);
3547     }
3548
3549   /* A qualified name corresponding to a bound pointer-to-member is
3550      represented as an OFFSET_REF:
3551
3552         struct B { void g(); };
3553         void (B::*p)();
3554         void B::g() { (this->*p)(); }  */
3555   if (TREE_CODE (fn) == OFFSET_REF)
3556     {
3557       tree object_addr = build_unary_op (ADDR_EXPR, object, 0);
3558       fn = TREE_OPERAND (fn, 1);
3559       fn = get_member_function_from_ptrfunc (&object_addr, fn);
3560       args = tree_cons (NULL_TREE, object_addr, args);
3561     }
3562
3563   expr = build_function_call (fn, args);
3564   if (processing_template_decl && expr != error_mark_node)
3565     return build_min_non_dep_call_list (expr, orig_fn, orig_args);
3566   return expr;
3567 }
3568
3569
3570 void
3571 check_default_args (tree x)
3572 {
3573   tree arg = TYPE_ARG_TYPES (TREE_TYPE (x));
3574   bool saw_def = false;
3575   int i = 0 - (TREE_CODE (TREE_TYPE (x)) == METHOD_TYPE);
3576   for (; arg && arg != void_list_node; arg = TREE_CHAIN (arg), ++i)
3577     {
3578       if (TREE_PURPOSE (arg))
3579         saw_def = true;
3580       else if (saw_def)
3581         {
3582           error ("default argument missing for parameter %P of %q+#D", i, x);
3583           TREE_PURPOSE (arg) = error_mark_node;
3584         }
3585     }
3586 }
3587
3588 /* Mark DECL (either a _DECL or a BASELINK) as "used" in the program.
3589    If DECL is a specialization or implicitly declared class member,
3590    generate the actual definition.  */
3591
3592 void
3593 mark_used (tree decl)
3594 {
3595   HOST_WIDE_INT saved_processing_template_decl = 0;
3596
3597   /* If DECL is a BASELINK for a single function, then treat it just
3598      like the DECL for the function.  Otherwise, if the BASELINK is
3599      for an overloaded function, we don't know which function was
3600      actually used until after overload resolution.  */
3601   if (TREE_CODE (decl) == BASELINK)
3602     {
3603       decl = BASELINK_FUNCTIONS (decl);
3604       if (really_overloaded_fn (decl))
3605         return;
3606       decl = OVL_CURRENT (decl);
3607     }
3608
3609   TREE_USED (decl) = 1;
3610   if (DECL_CLONED_FUNCTION_P (decl))
3611     TREE_USED (DECL_CLONED_FUNCTION (decl)) = 1;
3612   /* If we don't need a value, then we don't need to synthesize DECL.  */
3613   if (skip_evaluation)
3614     return;
3615   /* Normally, we can wait until instantiation-time to synthesize
3616      DECL.  However, if DECL is a static data member initialized with
3617      a constant, we need the value right now because a reference to
3618      such a data member is not value-dependent.  */
3619   if (TREE_CODE (decl) == VAR_DECL
3620       && DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl)
3621       && DECL_CLASS_SCOPE_P (decl))
3622     {
3623       /* Don't try to instantiate members of dependent types.  We
3624          cannot just use dependent_type_p here because this function
3625          may be called from fold_non_dependent_expr, and then we may
3626          see dependent types, even though processing_template_decl
3627          will not be set.  */
3628       if (CLASSTYPE_TEMPLATE_INFO ((DECL_CONTEXT (decl)))
3629           && uses_template_parms (CLASSTYPE_TI_ARGS (DECL_CONTEXT (decl))))
3630         return;
3631       /* Pretend that we are not in a template, even if we are, so
3632          that the static data member initializer will be processed.  */
3633       saved_processing_template_decl = processing_template_decl;
3634       processing_template_decl = 0;
3635     }
3636
3637   if (processing_template_decl)
3638     return;
3639
3640   if (TREE_CODE (decl) == FUNCTION_DECL && DECL_DECLARED_INLINE_P (decl)
3641       && !TREE_ASM_WRITTEN (decl))
3642     /* Remember it, so we can check it was defined.  */
3643     {
3644       if (DECL_DEFERRED_FN (decl))
3645         return;
3646
3647       /* Remember the current location for a function we will end up
3648          synthesizing.  Then we can inform the user where it was
3649          required in the case of error.  */
3650       if (DECL_ARTIFICIAL (decl) && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)
3651           && !DECL_THUNK_P (decl))
3652         DECL_SOURCE_LOCATION (decl) = input_location;
3653
3654       note_vague_linkage_fn (decl);
3655     }
3656
3657   assemble_external (decl);
3658
3659   /* Is it a synthesized method that needs to be synthesized?  */
3660   if (TREE_CODE (decl) == FUNCTION_DECL
3661       && DECL_NONSTATIC_MEMBER_FUNCTION_P (decl)
3662       && DECL_ARTIFICIAL (decl)
3663       && !DECL_THUNK_P (decl)
3664       && ! DECL_INITIAL (decl)
3665       /* Kludge: don't synthesize for default args.  Unfortunately this
3666          rules out initializers of namespace-scoped objects too, but
3667          it's sort-of ok if the implicit ctor or dtor decl keeps
3668          pointing to the class location.  */
3669       && current_function_decl)
3670     {
3671       synthesize_method (decl);
3672       /* If we've already synthesized the method we don't need to
3673          do the instantiation test below.  */
3674     }
3675   else if ((DECL_NON_THUNK_FUNCTION_P (decl) || TREE_CODE (decl) == VAR_DECL)
3676            && DECL_LANG_SPECIFIC (decl) && DECL_TEMPLATE_INFO (decl)
3677            && (!DECL_EXPLICIT_INSTANTIATION (decl)
3678                || (TREE_CODE (decl) == FUNCTION_DECL
3679                    && DECL_INLINE (DECL_TEMPLATE_RESULT
3680                                    (template_for_substitution (decl))))
3681                /* We need to instantiate static data members so that there
3682                   initializers are available in integral constant
3683                   expressions.  */
3684                || (TREE_CODE (decl) == VAR_DECL
3685                    && DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl))))
3686     /* If this is a function or variable that is an instance of some
3687        template, we now know that we will need to actually do the
3688        instantiation. We check that DECL is not an explicit
3689        instantiation because that is not checked in instantiate_decl.
3690
3691        We put off instantiating functions in order to improve compile
3692        times.  Maintaining a stack of active functions is expensive,
3693        and the inliner knows to instantiate any functions it might
3694        need.  Therefore, we always try to defer instantiation.  */
3695     instantiate_decl (decl, /*defer_ok=*/true,
3696                       /*expl_inst_class_mem_p=*/false);
3697
3698   processing_template_decl = saved_processing_template_decl;
3699 }
3700
3701 #include "gt-cp-decl2.h"