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