1/* Perform the semantic phase of parsing, i.e., the process of 2 building tree structure, checking semantic consistency, and 3 building RTL. These routines are used both during actual parsing 4 and during the instantiation of template functions. 5 6 Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005 7 Free Software Foundation, Inc. 8 Written by Mark Mitchell (mmitchell@usa.net) based on code found 9 formerly in parse.y and pt.c. 10 11 This file is part of GCC. 12 13 GCC is free software; you can redistribute it and/or modify it 14 under the terms of the GNU General Public License as published by 15 the Free Software Foundation; either version 2, or (at your option) 16 any later version. 17 18 GCC is distributed in the hope that it will be useful, but 19 WITHOUT ANY WARRANTY; without even the implied warranty of 20 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU 21 General Public License for more details. 22 23 You should have received a copy of the GNU General Public License 24 along with GCC; see the file COPYING. If not, write to the Free 25 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA 26 02110-1301, USA. */ 27 28#include "config.h" 29#include "system.h" 30#include "coretypes.h" 31#include "tm.h" 32#include "tree.h" 33#include "cp-tree.h" 34#include "c-common.h" 35#include "tree-inline.h" 36#include "tree-mudflap.h" 37#include "except.h" 38#include "toplev.h" 39#include "flags.h" 40#include "rtl.h" 41#include "expr.h" 42#include "output.h" 43#include "timevar.h" 44#include "debug.h" 45#include "diagnostic.h" 46#include "cgraph.h" 47#include "tree-iterator.h" 48#include "vec.h" 49#include "target.h" 50 51/* There routines provide a modular interface to perform many parsing 52 operations. They may therefore be used during actual parsing, or 53 during template instantiation, which may be regarded as a 54 degenerate form of parsing. */ 55 56static tree maybe_convert_cond (tree); 57static tree simplify_aggr_init_exprs_r (tree *, int *, void *); 58static void emit_associated_thunks (tree); 59static tree finalize_nrv_r (tree *, int *, void *); 60 61 62/* Deferred Access Checking Overview 63 --------------------------------- 64 65 Most C++ expressions and declarations require access checking 66 to be performed during parsing. However, in several cases, 67 this has to be treated differently. 68 69 For member declarations, access checking has to be deferred 70 until more information about the declaration is known. For 71 example: 72 73 class A { 74 typedef int X; 75 public: 76 X f(); 77 }; 78 79 A::X A::f(); 80 A::X g(); 81 82 When we are parsing the function return type `A::X', we don't 83 really know if this is allowed until we parse the function name. 84 85 Furthermore, some contexts require that access checking is 86 never performed at all. These include class heads, and template 87 instantiations. 88 89 Typical use of access checking functions is described here: 90 91 1. When we enter a context that requires certain access checking 92 mode, the function `push_deferring_access_checks' is called with 93 DEFERRING argument specifying the desired mode. Access checking 94 may be performed immediately (dk_no_deferred), deferred 95 (dk_deferred), or not performed (dk_no_check). 96 97 2. When a declaration such as a type, or a variable, is encountered, 98 the function `perform_or_defer_access_check' is called. It 99 maintains a VEC of all deferred checks. 100 101 3. The global `current_class_type' or `current_function_decl' is then 102 setup by the parser. `enforce_access' relies on these information 103 to check access. 104 105 4. Upon exiting the context mentioned in step 1, 106 `perform_deferred_access_checks' is called to check all declaration 107 stored in the VEC. `pop_deferring_access_checks' is then 108 called to restore the previous access checking mode. 109 110 In case of parsing error, we simply call `pop_deferring_access_checks' 111 without `perform_deferred_access_checks'. */ 112 113typedef struct deferred_access GTY(()) 114{ 115 /* A VEC representing name-lookups for which we have deferred 116 checking access controls. We cannot check the accessibility of 117 names used in a decl-specifier-seq until we know what is being 118 declared because code like: 119 120 class A { 121 class B {}; 122 B* f(); 123 } 124 125 A::B* A::f() { return 0; } 126 127 is valid, even though `A::B' is not generally accessible. */ 128 VEC (deferred_access_check,gc)* GTY(()) deferred_access_checks; 129 130 /* The current mode of access checks. */ 131 enum deferring_kind deferring_access_checks_kind; 132 133} deferred_access; 134DEF_VEC_O (deferred_access); 135DEF_VEC_ALLOC_O (deferred_access,gc); 136 137/* Data for deferred access checking. */ 138static GTY(()) VEC(deferred_access,gc) *deferred_access_stack; 139static GTY(()) unsigned deferred_access_no_check; 140 141/* Save the current deferred access states and start deferred 142 access checking iff DEFER_P is true. */ 143 144void 145push_deferring_access_checks (deferring_kind deferring) 146{ 147 /* For context like template instantiation, access checking 148 disabling applies to all nested context. */ 149 if (deferred_access_no_check || deferring == dk_no_check) 150 deferred_access_no_check++; 151 else 152 { 153 deferred_access *ptr; 154 155 ptr = VEC_safe_push (deferred_access, gc, deferred_access_stack, NULL); 156 ptr->deferred_access_checks = NULL; 157 ptr->deferring_access_checks_kind = deferring; 158 } 159} 160 161/* Resume deferring access checks again after we stopped doing 162 this previously. */ 163 164void 165resume_deferring_access_checks (void) 166{ 167 if (!deferred_access_no_check) 168 VEC_last (deferred_access, deferred_access_stack) 169 ->deferring_access_checks_kind = dk_deferred; 170} 171 172/* Stop deferring access checks. */ 173 174void 175stop_deferring_access_checks (void) 176{ 177 if (!deferred_access_no_check) 178 VEC_last (deferred_access, deferred_access_stack) 179 ->deferring_access_checks_kind = dk_no_deferred; 180} 181 182/* Discard the current deferred access checks and restore the 183 previous states. */ 184 185void 186pop_deferring_access_checks (void) 187{ 188 if (deferred_access_no_check) 189 deferred_access_no_check--; 190 else 191 VEC_pop (deferred_access, deferred_access_stack); 192} 193 194/* Returns a TREE_LIST representing the deferred checks. 195 The TREE_PURPOSE of each node is the type through which the 196 access occurred; the TREE_VALUE is the declaration named. 197 */ 198 199VEC (deferred_access_check,gc)* 200get_deferred_access_checks (void) 201{ 202 if (deferred_access_no_check) 203 return NULL; 204 else 205 return (VEC_last (deferred_access, deferred_access_stack) 206 ->deferred_access_checks); 207} 208 209/* Take current deferred checks and combine with the 210 previous states if we also defer checks previously. 211 Otherwise perform checks now. */ 212 213void 214pop_to_parent_deferring_access_checks (void) 215{ 216 if (deferred_access_no_check) 217 deferred_access_no_check--; 218 else 219 { 220 VEC (deferred_access_check,gc) *checks; 221 deferred_access *ptr; 222 223 checks = (VEC_last (deferred_access, deferred_access_stack) 224 ->deferred_access_checks); 225 226 VEC_pop (deferred_access, deferred_access_stack); 227 ptr = VEC_last (deferred_access, deferred_access_stack); 228 if (ptr->deferring_access_checks_kind == dk_no_deferred) 229 { 230 /* Check access. */ 231 perform_access_checks (checks); 232 } 233 else 234 { 235 /* Merge with parent. */ 236 int i, j; 237 deferred_access_check *chk, *probe; 238 239 for (i = 0 ; 240 VEC_iterate (deferred_access_check, checks, i, chk) ; 241 ++i) 242 { 243 for (j = 0 ; 244 VEC_iterate (deferred_access_check, 245 ptr->deferred_access_checks, j, probe) ; 246 ++j) 247 { 248 if (probe->binfo == chk->binfo && 249 probe->decl == chk->decl && 250 probe->diag_decl == chk->diag_decl) 251 goto found; 252 } 253 /* Insert into parent's checks. */ 254 VEC_safe_push (deferred_access_check, gc, 255 ptr->deferred_access_checks, chk); 256 found:; 257 } 258 } 259 } 260} 261 262/* Perform the access checks in CHECKS. The TREE_PURPOSE of each node 263 is the BINFO indicating the qualifying scope used to access the 264 DECL node stored in the TREE_VALUE of the node. */ 265 266void 267perform_access_checks (VEC (deferred_access_check,gc)* checks) 268{ 269 int i; 270 deferred_access_check *chk; 271 272 if (!checks) 273 return; 274 275 for (i = 0 ; VEC_iterate (deferred_access_check, checks, i, chk) ; ++i) 276 enforce_access (chk->binfo, chk->decl, chk->diag_decl); 277} 278 279/* Perform the deferred access checks. 280 281 After performing the checks, we still have to keep the list 282 `deferred_access_stack->deferred_access_checks' since we may want 283 to check access for them again later in a different context. 284 For example: 285 286 class A { 287 typedef int X; 288 static X a; 289 }; 290 A::X A::a, x; // No error for `A::a', error for `x' 291 292 We have to perform deferred access of `A::X', first with `A::a', 293 next with `x'. */ 294 295void 296perform_deferred_access_checks (void) 297{ 298 perform_access_checks (get_deferred_access_checks ()); 299} 300 301/* Defer checking the accessibility of DECL, when looked up in 302 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */ 303 304void 305perform_or_defer_access_check (tree binfo, tree decl, tree diag_decl) 306{ 307 int i; 308 deferred_access *ptr; 309 deferred_access_check *chk; 310 deferred_access_check *new_access; 311 312 313 /* Exit if we are in a context that no access checking is performed. 314 */ 315 if (deferred_access_no_check) 316 return; 317 318 gcc_assert (TREE_CODE (binfo) == TREE_BINFO); 319 320 ptr = VEC_last (deferred_access, deferred_access_stack); 321 322 /* If we are not supposed to defer access checks, just check now. */ 323 if (ptr->deferring_access_checks_kind == dk_no_deferred) 324 { 325 enforce_access (binfo, decl, diag_decl); 326 return; 327 } 328 329 /* See if we are already going to perform this check. */ 330 for (i = 0 ; 331 VEC_iterate (deferred_access_check, 332 ptr->deferred_access_checks, i, chk) ; 333 ++i) 334 { 335 if (chk->decl == decl && chk->binfo == binfo && 336 chk->diag_decl == diag_decl) 337 { 338 return; 339 } 340 } 341 /* If not, record the check. */ 342 new_access = 343 VEC_safe_push (deferred_access_check, gc, 344 ptr->deferred_access_checks, 0); 345 new_access->binfo = binfo; 346 new_access->decl = decl; 347 new_access->diag_decl = diag_decl; 348} 349 350/* Returns nonzero if the current statement is a full expression, 351 i.e. temporaries created during that statement should be destroyed 352 at the end of the statement. */ 353 354int 355stmts_are_full_exprs_p (void) 356{ 357 return current_stmt_tree ()->stmts_are_full_exprs_p; 358} 359 360/* T is a statement. Add it to the statement-tree. This is the C++ 361 version. The C/ObjC frontends have a slightly different version of 362 this function. */ 363 364tree 365add_stmt (tree t) 366{ 367 enum tree_code code = TREE_CODE (t); 368 369 if (EXPR_P (t) && code != LABEL_EXPR) 370 { 371 if (!EXPR_HAS_LOCATION (t)) 372 SET_EXPR_LOCATION (t, input_location); 373 374 /* When we expand a statement-tree, we must know whether or not the 375 statements are full-expressions. We record that fact here. */ 376 STMT_IS_FULL_EXPR_P (t) = stmts_are_full_exprs_p (); 377 } 378 379 /* Add T to the statement-tree. Non-side-effect statements need to be 380 recorded during statement expressions. */ 381 append_to_statement_list_force (t, &cur_stmt_list); 382 383 return t; 384} 385 386/* Returns the stmt_tree (if any) to which statements are currently 387 being added. If there is no active statement-tree, NULL is 388 returned. */ 389 390stmt_tree 391current_stmt_tree (void) 392{ 393 return (cfun 394 ? &cfun->language->base.x_stmt_tree 395 : &scope_chain->x_stmt_tree); 396} 397 398/* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */ 399 400static tree 401maybe_cleanup_point_expr (tree expr) 402{ 403 if (!processing_template_decl && stmts_are_full_exprs_p ()) 404 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr); 405 return expr; 406} 407 408/* Like maybe_cleanup_point_expr except have the type of the new expression be 409 void so we don't need to create a temporary variable to hold the inner 410 expression. The reason why we do this is because the original type might be 411 an aggregate and we cannot create a temporary variable for that type. */ 412 413static tree 414maybe_cleanup_point_expr_void (tree expr) 415{ 416 if (!processing_template_decl && stmts_are_full_exprs_p ()) 417 expr = fold_build_cleanup_point_expr (void_type_node, expr); 418 return expr; 419} 420 421 422 423/* Create a declaration statement for the declaration given by the DECL. */ 424 425void 426add_decl_expr (tree decl) 427{ 428 tree r = build_stmt (DECL_EXPR, decl); 429 if (DECL_INITIAL (decl) 430 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl)))) 431 r = maybe_cleanup_point_expr_void (r); 432 add_stmt (r); 433} 434 435/* Nonzero if TYPE is an anonymous union or struct type. We have to use a 436 flag for this because "A union for which objects or pointers are 437 declared is not an anonymous union" [class.union]. */ 438 439int 440anon_aggr_type_p (tree node) 441{ 442 return ANON_AGGR_TYPE_P (node); 443} 444 445/* Finish a scope. */ 446 447tree 448do_poplevel (tree stmt_list) 449{ 450 tree block = NULL; 451 452 if (stmts_are_full_exprs_p ()) 453 block = poplevel (kept_level_p (), 1, 0); 454 455 stmt_list = pop_stmt_list (stmt_list); 456 457 if (!processing_template_decl) 458 { 459 stmt_list = c_build_bind_expr (block, stmt_list); 460 /* ??? See c_end_compound_stmt re statement expressions. */ 461 } 462 463 return stmt_list; 464} 465 466/* Begin a new scope. */ 467 468static tree 469do_pushlevel (scope_kind sk) 470{ 471 tree ret = push_stmt_list (); 472 if (stmts_are_full_exprs_p ()) 473 begin_scope (sk, NULL); 474 return ret; 475} 476 477/* Queue a cleanup. CLEANUP is an expression/statement to be executed 478 when the current scope is exited. EH_ONLY is true when this is not 479 meant to apply to normal control flow transfer. */ 480 481void 482push_cleanup (tree decl, tree cleanup, bool eh_only) 483{ 484 tree stmt = build_stmt (CLEANUP_STMT, NULL, cleanup, decl); 485 CLEANUP_EH_ONLY (stmt) = eh_only; 486 add_stmt (stmt); 487 CLEANUP_BODY (stmt) = push_stmt_list (); 488} 489 490/* Begin a conditional that might contain a declaration. When generating 491 normal code, we want the declaration to appear before the statement 492 containing the conditional. When generating template code, we want the 493 conditional to be rendered as the raw DECL_EXPR. */ 494 495static void 496begin_cond (tree *cond_p) 497{ 498 if (processing_template_decl) 499 *cond_p = push_stmt_list (); 500} 501 502/* Finish such a conditional. */ 503 504static void 505finish_cond (tree *cond_p, tree expr) 506{ 507 if (processing_template_decl) 508 { 509 tree cond = pop_stmt_list (*cond_p); 510 if (TREE_CODE (cond) == DECL_EXPR) 511 expr = cond; 512 } 513 *cond_p = expr; 514} 515 516/* If *COND_P specifies a conditional with a declaration, transform the 517 loop such that 518 while (A x = 42) { } 519 for (; A x = 42;) { } 520 becomes 521 while (true) { A x = 42; if (!x) break; } 522 for (;;) { A x = 42; if (!x) break; } 523 The statement list for BODY will be empty if the conditional did 524 not declare anything. */ 525 526static void 527simplify_loop_decl_cond (tree *cond_p, tree body) 528{ 529 tree cond, if_stmt; 530 531 if (!TREE_SIDE_EFFECTS (body)) 532 return; 533 534 cond = *cond_p; 535 *cond_p = boolean_true_node; 536 537 if_stmt = begin_if_stmt (); 538 cond = build_unary_op (TRUTH_NOT_EXPR, cond, 0); 539 finish_if_stmt_cond (cond, if_stmt); 540 finish_break_stmt (); 541 finish_then_clause (if_stmt); 542 finish_if_stmt (if_stmt); 543} 544 545/* Finish a goto-statement. */ 546 547tree 548finish_goto_stmt (tree destination) 549{ 550 if (TREE_CODE (destination) == IDENTIFIER_NODE) 551 destination = lookup_label (destination); 552 553 /* We warn about unused labels with -Wunused. That means we have to 554 mark the used labels as used. */ 555 if (TREE_CODE (destination) == LABEL_DECL) 556 TREE_USED (destination) = 1; 557 else 558 { 559 /* The DESTINATION is being used as an rvalue. */ 560 if (!processing_template_decl) 561 destination = decay_conversion (destination); 562 /* We don't inline calls to functions with computed gotos. 563 Those functions are typically up to some funny business, 564 and may be depending on the labels being at particular 565 addresses, or some such. */ 566 DECL_UNINLINABLE (current_function_decl) = 1; 567 } 568 569 check_goto (destination); 570 571 return add_stmt (build_stmt (GOTO_EXPR, destination)); 572} 573 574/* COND is the condition-expression for an if, while, etc., 575 statement. Convert it to a boolean value, if appropriate. */ 576 577static tree 578maybe_convert_cond (tree cond) 579{ 580 /* Empty conditions remain empty. */ 581 if (!cond) 582 return NULL_TREE; 583 584 /* Wait until we instantiate templates before doing conversion. */ 585 if (processing_template_decl) 586 return cond; 587 588 /* Do the conversion. */ 589 cond = convert_from_reference (cond); 590 591 if (TREE_CODE (cond) == MODIFY_EXPR 592 && !TREE_NO_WARNING (cond) 593 && warn_parentheses) 594 { 595 warning (OPT_Wparentheses, 596 "suggest parentheses around assignment used as truth value"); 597 TREE_NO_WARNING (cond) = 1; 598 } 599 600 return condition_conversion (cond); 601} 602 603/* Finish an expression-statement, whose EXPRESSION is as indicated. */ 604 605tree 606finish_expr_stmt (tree expr) 607{ 608 tree r = NULL_TREE; 609 610 if (expr != NULL_TREE) 611 { 612 if (!processing_template_decl) 613 { 614 if (warn_sequence_point) 615 verify_sequence_points (expr); 616 expr = convert_to_void (expr, "statement"); 617 } 618 else if (!type_dependent_expression_p (expr)) 619 convert_to_void (build_non_dependent_expr (expr), "statement"); 620 621 /* Simplification of inner statement expressions, compound exprs, 622 etc can result in us already having an EXPR_STMT. */ 623 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR) 624 { 625 if (TREE_CODE (expr) != EXPR_STMT) 626 expr = build_stmt (EXPR_STMT, expr); 627 expr = maybe_cleanup_point_expr_void (expr); 628 } 629 630 r = add_stmt (expr); 631 } 632 633 finish_stmt (); 634 635 return r; 636} 637 638 639/* Begin an if-statement. Returns a newly created IF_STMT if 640 appropriate. */ 641 642tree 643begin_if_stmt (void) 644{ 645 tree r, scope; 646 scope = do_pushlevel (sk_block); 647 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE); 648 TREE_CHAIN (r) = scope; 649 begin_cond (&IF_COND (r)); 650 return r; 651} 652 653/* Process the COND of an if-statement, which may be given by 654 IF_STMT. */ 655 656void 657finish_if_stmt_cond (tree cond, tree if_stmt) 658{ 659 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond)); 660 add_stmt (if_stmt); 661 THEN_CLAUSE (if_stmt) = push_stmt_list (); 662} 663 664/* Finish the then-clause of an if-statement, which may be given by 665 IF_STMT. */ 666 667tree 668finish_then_clause (tree if_stmt) 669{ 670 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt)); 671 return if_stmt; 672} 673 674/* Begin the else-clause of an if-statement. */ 675 676void 677begin_else_clause (tree if_stmt) 678{ 679 ELSE_CLAUSE (if_stmt) = push_stmt_list (); 680} 681 682/* Finish the else-clause of an if-statement, which may be given by 683 IF_STMT. */ 684 685void 686finish_else_clause (tree if_stmt) 687{ 688 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt)); 689} 690 691/* Finish an if-statement. */ 692 693void 694finish_if_stmt (tree if_stmt) 695{ 696 tree scope = TREE_CHAIN (if_stmt); 697 TREE_CHAIN (if_stmt) = NULL; 698 add_stmt (do_poplevel (scope)); 699 finish_stmt (); 700 empty_body_warning (THEN_CLAUSE (if_stmt), ELSE_CLAUSE (if_stmt)); 701} 702 703/* Begin a while-statement. Returns a newly created WHILE_STMT if 704 appropriate. */ 705 706tree 707/* APPLE LOCAL begin for-fsf-4_4 3274130 5295549 */ \ 708begin_while_stmt (tree attribs) 709/* APPLE LOCAL end for-fsf-4_4 3274130 5295549 */ \ 710{ 711 tree r; 712/* APPLE LOCAL begin for-fsf-4_4 3274130 5295549 */ \ 713 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE, attribs); 714/* APPLE LOCAL end for-fsf-4_4 3274130 5295549 */ \ 715 add_stmt (r); 716 WHILE_BODY (r) = do_pushlevel (sk_block); 717 begin_cond (&WHILE_COND (r)); 718 return r; 719} 720 721/* Process the COND of a while-statement, which may be given by 722 WHILE_STMT. */ 723 724void 725finish_while_stmt_cond (tree cond, tree while_stmt) 726{ 727 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond)); 728 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt)); 729} 730 731/* Finish a while-statement, which may be given by WHILE_STMT. */ 732 733void 734finish_while_stmt (tree while_stmt) 735{ 736 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt)); 737 finish_stmt (); 738} 739 740/* Begin a do-statement. Returns a newly created DO_STMT if 741 appropriate. */ 742 743tree 744/* APPLE LOCAL begin for-fsf-4_4 3274130 5295549 */ \ 745begin_do_stmt (tree attribs) 746/* APPLE LOCAL end for-fsf-4_4 3274130 5295549 */ \ 747{ 748 /* APPLE LOCAL radar 4445586 */ 749/* APPLE LOCAL begin for-fsf-4_4 3274130 5295549 */ \ 750 tree r = build_stmt (DO_STMT, NULL_TREE, NULL_TREE, attribs, NULL_TREE); 751/* APPLE LOCAL end for-fsf-4_4 3274130 5295549 */ \ 752 add_stmt (r); 753 DO_BODY (r) = push_stmt_list (); 754 return r; 755} 756 757/* Finish the body of a do-statement, which may be given by DO_STMT. */ 758 759void 760finish_do_body (tree do_stmt) 761{ 762 DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt)); 763} 764 765/* Finish a do-statement, which may be given by DO_STMT, and whose 766 COND is as indicated. */ 767 768void 769finish_do_stmt (tree cond, tree do_stmt) 770{ 771 cond = maybe_convert_cond (cond); 772 DO_COND (do_stmt) = cond; 773 finish_stmt (); 774} 775 776/* Finish a return-statement. The EXPRESSION returned, if any, is as 777 indicated. */ 778 779tree 780finish_return_stmt (tree expr) 781{ 782 tree r; 783 bool no_warning; 784 785 expr = check_return_expr (expr, &no_warning); 786 787 if (flag_openmp && !check_omp_return ()) 788 return error_mark_node; 789 if (!processing_template_decl) 790 { 791 if (DECL_DESTRUCTOR_P (current_function_decl) 792 || (DECL_CONSTRUCTOR_P (current_function_decl) 793 && targetm.cxx.cdtor_returns_this ())) 794 { 795 /* Similarly, all destructors must run destructors for 796 base-classes before returning. So, all returns in a 797 destructor get sent to the DTOR_LABEL; finish_function emits 798 code to return a value there. */ 799 return finish_goto_stmt (cdtor_label); 800 } 801 } 802 803 r = build_stmt (RETURN_EXPR, expr); 804 TREE_NO_WARNING (r) |= no_warning; 805 r = maybe_cleanup_point_expr_void (r); 806 r = add_stmt (r); 807 finish_stmt (); 808 809 return r; 810} 811 812/* Begin a for-statement. Returns a new FOR_STMT if appropriate. */ 813 814tree 815/* APPLE LOCAL begin for-fsf-4_4 3274130 5295549 */ \ 816begin_for_stmt (tree attribs) 817/* APPLE LOCAL end for-fsf-4_4 3274130 5295549 */ \ 818{ 819 tree r; 820 821 r = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE, 822/* APPLE LOCAL begin for-fsf-4_4 3274130 5295549 */ \ 823 NULL_TREE, NULL_TREE, attribs); 824 825/* APPLE LOCAL end for-fsf-4_4 3274130 5295549 */ \ 826 827 if (flag_new_for_scope > 0) 828 TREE_CHAIN (r) = do_pushlevel (sk_for); 829 830 if (processing_template_decl) 831 FOR_INIT_STMT (r) = push_stmt_list (); 832 833 return r; 834} 835 836/* Finish the for-init-statement of a for-statement, which may be 837 given by FOR_STMT. */ 838 839void 840finish_for_init_stmt (tree for_stmt) 841{ 842 if (processing_template_decl) 843 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt)); 844 add_stmt (for_stmt); 845 FOR_BODY (for_stmt) = do_pushlevel (sk_block); 846 begin_cond (&FOR_COND (for_stmt)); 847} 848 849/* Finish the COND of a for-statement, which may be given by 850 FOR_STMT. */ 851 852void 853finish_for_cond (tree cond, tree for_stmt) 854{ 855 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond)); 856 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt)); 857} 858 859/* Finish the increment-EXPRESSION in a for-statement, which may be 860 given by FOR_STMT. */ 861 862void 863finish_for_expr (tree expr, tree for_stmt) 864{ 865 if (!expr) 866 return; 867 /* If EXPR is an overloaded function, issue an error; there is no 868 context available to use to perform overload resolution. */ 869 if (type_unknown_p (expr)) 870 { 871 cxx_incomplete_type_error (expr, TREE_TYPE (expr)); 872 expr = error_mark_node; 873 } 874 if (!processing_template_decl) 875 { 876 if (warn_sequence_point) 877 verify_sequence_points (expr); 878 expr = convert_to_void (expr, "3rd expression in for"); 879 } 880 else if (!type_dependent_expression_p (expr)) 881 convert_to_void (build_non_dependent_expr (expr), "3rd expression in for"); 882 expr = maybe_cleanup_point_expr_void (expr); 883 FOR_EXPR (for_stmt) = expr; 884} 885 886/* Finish the body of a for-statement, which may be given by 887 FOR_STMT. The increment-EXPR for the loop must be 888 provided. */ 889 890void 891finish_for_stmt (tree for_stmt) 892{ 893 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt)); 894 895 /* Pop the scope for the body of the loop. */ 896 if (flag_new_for_scope > 0) 897 { 898 tree scope = TREE_CHAIN (for_stmt); 899 TREE_CHAIN (for_stmt) = NULL; 900 add_stmt (do_poplevel (scope)); 901 } 902 903 finish_stmt (); 904} 905 906/* Finish a break-statement. */ 907 908tree 909finish_break_stmt (void) 910{ 911 return add_stmt (build_stmt (BREAK_STMT)); 912} 913 914/* Finish a continue-statement. */ 915 916tree 917finish_continue_stmt (void) 918{ 919 return add_stmt (build_stmt (CONTINUE_STMT)); 920} 921 922/* Begin a switch-statement. Returns a new SWITCH_STMT if 923 appropriate. */ 924 925tree 926begin_switch_stmt (void) 927{ 928 tree r, scope; 929 930 r = build_stmt (SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE); 931 932 scope = do_pushlevel (sk_block); 933 TREE_CHAIN (r) = scope; 934 begin_cond (&SWITCH_STMT_COND (r)); 935 936 return r; 937} 938 939/* Finish the cond of a switch-statement. */ 940 941void 942finish_switch_cond (tree cond, tree switch_stmt) 943{ 944 tree orig_type = NULL; 945 if (!processing_template_decl) 946 { 947 tree index; 948 949 /* Convert the condition to an integer or enumeration type. */ 950 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true); 951 if (cond == NULL_TREE) 952 { 953 error ("switch quantity not an integer"); 954 cond = error_mark_node; 955 } 956 orig_type = TREE_TYPE (cond); 957 if (cond != error_mark_node) 958 { 959 /* [stmt.switch] 960 961 Integral promotions are performed. */ 962 cond = perform_integral_promotions (cond); 963 cond = maybe_cleanup_point_expr (cond); 964 } 965 966 if (cond != error_mark_node) 967 { 968 index = get_unwidened (cond, NULL_TREE); 969 /* We can't strip a conversion from a signed type to an unsigned, 970 because if we did, int_fits_type_p would do the wrong thing 971 when checking case values for being in range, 972 and it's too hard to do the right thing. */ 973 if (TYPE_UNSIGNED (TREE_TYPE (cond)) 974 == TYPE_UNSIGNED (TREE_TYPE (index))) 975 cond = index; 976 } 977 } 978 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond); 979 SWITCH_STMT_TYPE (switch_stmt) = orig_type; 980 add_stmt (switch_stmt); 981 push_switch (switch_stmt); 982 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list (); 983} 984 985/* Finish the body of a switch-statement, which may be given by 986 SWITCH_STMT. The COND to switch on is indicated. */ 987 988void 989finish_switch_stmt (tree switch_stmt) 990{ 991 tree scope; 992 993 SWITCH_STMT_BODY (switch_stmt) = 994 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt)); 995 pop_switch (); 996 finish_stmt (); 997 998 scope = TREE_CHAIN (switch_stmt); 999 TREE_CHAIN (switch_stmt) = NULL; 1000 add_stmt (do_poplevel (scope)); 1001} 1002 1003/* Begin a try-block. Returns a newly-created TRY_BLOCK if 1004 appropriate. */ 1005 1006tree 1007begin_try_block (void) 1008{ 1009 tree r = build_stmt (TRY_BLOCK, NULL_TREE, NULL_TREE); 1010 add_stmt (r); 1011 TRY_STMTS (r) = push_stmt_list (); 1012 return r; 1013} 1014 1015/* Likewise, for a function-try-block. The block returned in 1016 *COMPOUND_STMT is an artificial outer scope, containing the 1017 function-try-block. */ 1018 1019tree 1020begin_function_try_block (tree *compound_stmt) 1021{ 1022 tree r; 1023 /* This outer scope does not exist in the C++ standard, but we need 1024 a place to put __FUNCTION__ and similar variables. */ 1025 *compound_stmt = begin_compound_stmt (0); 1026 r = begin_try_block (); 1027 FN_TRY_BLOCK_P (r) = 1; 1028 return r; 1029} 1030 1031/* Finish a try-block, which may be given by TRY_BLOCK. */ 1032 1033void 1034finish_try_block (tree try_block) 1035{ 1036 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block)); 1037 TRY_HANDLERS (try_block) = push_stmt_list (); 1038} 1039 1040/* Finish the body of a cleanup try-block, which may be given by 1041 TRY_BLOCK. */ 1042 1043void 1044finish_cleanup_try_block (tree try_block) 1045{ 1046 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block)); 1047} 1048 1049/* Finish an implicitly generated try-block, with a cleanup is given 1050 by CLEANUP. */ 1051 1052void 1053finish_cleanup (tree cleanup, tree try_block) 1054{ 1055 TRY_HANDLERS (try_block) = cleanup; 1056 CLEANUP_P (try_block) = 1; 1057} 1058 1059/* Likewise, for a function-try-block. */ 1060 1061void 1062finish_function_try_block (tree try_block) 1063{ 1064 finish_try_block (try_block); 1065 /* FIXME : something queer about CTOR_INITIALIZER somehow following 1066 the try block, but moving it inside. */ 1067 in_function_try_handler = 1; 1068} 1069 1070/* Finish a handler-sequence for a try-block, which may be given by 1071 TRY_BLOCK. */ 1072 1073void 1074finish_handler_sequence (tree try_block) 1075{ 1076 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block)); 1077 check_handlers (TRY_HANDLERS (try_block)); 1078} 1079 1080/* Finish the handler-seq for a function-try-block, given by 1081 TRY_BLOCK. COMPOUND_STMT is the outer block created by 1082 begin_function_try_block. */ 1083 1084void 1085finish_function_handler_sequence (tree try_block, tree compound_stmt) 1086{ 1087 in_function_try_handler = 0; 1088 finish_handler_sequence (try_block); 1089 finish_compound_stmt (compound_stmt); 1090} 1091 1092/* Begin a handler. Returns a HANDLER if appropriate. */ 1093 1094tree 1095begin_handler (void) 1096{ 1097 tree r; 1098 1099 r = build_stmt (HANDLER, NULL_TREE, NULL_TREE); 1100 add_stmt (r); 1101 1102 /* Create a binding level for the eh_info and the exception object 1103 cleanup. */ 1104 HANDLER_BODY (r) = do_pushlevel (sk_catch); 1105 1106 return r; 1107} 1108 1109/* Finish the handler-parameters for a handler, which may be given by 1110 HANDLER. DECL is the declaration for the catch parameter, or NULL 1111 if this is a `catch (...)' clause. */ 1112 1113void 1114finish_handler_parms (tree decl, tree handler) 1115{ 1116 tree type = NULL_TREE; 1117 if (processing_template_decl) 1118 { 1119 if (decl) 1120 { 1121 decl = pushdecl (decl); 1122 decl = push_template_decl (decl); 1123 HANDLER_PARMS (handler) = decl; 1124 type = TREE_TYPE (decl); 1125 } 1126 } 1127 else 1128 type = expand_start_catch_block (decl); 1129 HANDLER_TYPE (handler) = type; 1130 if (!processing_template_decl && type) 1131 mark_used (eh_type_info (type)); 1132} 1133 1134/* Finish a handler, which may be given by HANDLER. The BLOCKs are 1135 the return value from the matching call to finish_handler_parms. */ 1136 1137void 1138finish_handler (tree handler) 1139{ 1140 if (!processing_template_decl) 1141 expand_end_catch_block (); 1142 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler)); 1143} 1144 1145/* Begin a compound statement. FLAGS contains some bits that control the 1146 behavior and context. If BCS_NO_SCOPE is set, the compound statement 1147 does not define a scope. If BCS_FN_BODY is set, this is the outermost 1148 block of a function. If BCS_TRY_BLOCK is set, this is the block 1149 created on behalf of a TRY statement. Returns a token to be passed to 1150 finish_compound_stmt. */ 1151 1152tree 1153begin_compound_stmt (unsigned int flags) 1154{ 1155 tree r; 1156 1157 if (flags & BCS_NO_SCOPE) 1158 { 1159 r = push_stmt_list (); 1160 STATEMENT_LIST_NO_SCOPE (r) = 1; 1161 1162 /* Normally, we try hard to keep the BLOCK for a statement-expression. 1163 But, if it's a statement-expression with a scopeless block, there's 1164 nothing to keep, and we don't want to accidentally keep a block 1165 *inside* the scopeless block. */ 1166 keep_next_level (false); 1167 } 1168 else 1169 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block); 1170 1171 /* When processing a template, we need to remember where the braces were, 1172 so that we can set up identical scopes when instantiating the template 1173 later. BIND_EXPR is a handy candidate for this. 1174 Note that do_poplevel won't create a BIND_EXPR itself here (and thus 1175 result in nested BIND_EXPRs), since we don't build BLOCK nodes when 1176 processing templates. */ 1177 if (processing_template_decl) 1178 { 1179 r = build3 (BIND_EXPR, NULL, NULL, r, NULL); 1180 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0; 1181 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0; 1182 TREE_SIDE_EFFECTS (r) = 1; 1183 } 1184 1185 return r; 1186} 1187 1188/* Finish a compound-statement, which is given by STMT. */ 1189 1190void 1191finish_compound_stmt (tree stmt) 1192{ 1193 if (TREE_CODE (stmt) == BIND_EXPR) 1194 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt)); 1195 else if (STATEMENT_LIST_NO_SCOPE (stmt)) 1196 stmt = pop_stmt_list (stmt); 1197 else 1198 { 1199 /* Destroy any ObjC "super" receivers that may have been 1200 created. */ 1201 objc_clear_super_receiver (); 1202 1203 stmt = do_poplevel (stmt); 1204 } 1205 1206 /* ??? See c_end_compound_stmt wrt statement expressions. */ 1207 add_stmt (stmt); 1208 finish_stmt (); 1209} 1210 1211/* Finish an asm-statement, whose components are a STRING, some 1212 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note 1213 whether the asm-statement should be considered volatile. */ 1214 1215tree 1216finish_asm_stmt (int volatile_p, tree string, tree output_operands, 1217 tree input_operands, tree clobbers) 1218{ 1219 tree r; 1220 tree t; 1221 int ninputs = list_length (input_operands); 1222 int noutputs = list_length (output_operands); 1223 1224 if (!processing_template_decl) 1225 { 1226 const char *constraint; 1227 const char **oconstraints; 1228 bool allows_mem, allows_reg, is_inout; 1229 tree operand; 1230 int i; 1231 1232 oconstraints = (const char **) alloca (noutputs * sizeof (char *)); 1233 1234 string = resolve_asm_operand_names (string, output_operands, 1235 input_operands); 1236 1237 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i) 1238 { 1239 operand = TREE_VALUE (t); 1240 1241 /* ??? Really, this should not be here. Users should be using a 1242 proper lvalue, dammit. But there's a long history of using 1243 casts in the output operands. In cases like longlong.h, this 1244 becomes a primitive form of typechecking -- if the cast can be 1245 removed, then the output operand had a type of the proper width; 1246 otherwise we'll get an error. Gross, but ... */ 1247 STRIP_NOPS (operand); 1248 1249 if (!lvalue_or_else (operand, lv_asm)) 1250 operand = error_mark_node; 1251 1252 if (operand != error_mark_node 1253 && (TREE_READONLY (operand) 1254 || CP_TYPE_CONST_P (TREE_TYPE (operand)) 1255 /* Functions are not modifiable, even though they are 1256 lvalues. */ 1257 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE 1258 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE 1259 /* If it's an aggregate and any field is const, then it is 1260 effectively const. */ 1261 || (CLASS_TYPE_P (TREE_TYPE (operand)) 1262 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand))))) 1263 readonly_error (operand, "assignment (via 'asm' output)", 0); 1264 1265 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t))); 1266 oconstraints[i] = constraint; 1267 1268 if (parse_output_constraint (&constraint, i, ninputs, noutputs, 1269 &allows_mem, &allows_reg, &is_inout)) 1270 { 1271 /* If the operand is going to end up in memory, 1272 mark it addressable. */ 1273 if (!allows_reg && !cxx_mark_addressable (operand)) 1274 operand = error_mark_node; 1275 } 1276 else 1277 operand = error_mark_node; 1278 1279 TREE_VALUE (t) = operand; 1280 } 1281 1282 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t)) 1283 { 1284 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t))); 1285 operand = decay_conversion (TREE_VALUE (t)); 1286 1287 /* If the type of the operand hasn't been determined (e.g., 1288 because it involves an overloaded function), then issue 1289 an error message. There's no context available to 1290 resolve the overloading. */ 1291 if (TREE_TYPE (operand) == unknown_type_node) 1292 { 1293 error ("type of asm operand %qE could not be determined", 1294 TREE_VALUE (t)); 1295 operand = error_mark_node; 1296 } 1297 1298 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0, 1299 oconstraints, &allows_mem, &allows_reg)) 1300 { 1301 /* If the operand is going to end up in memory, 1302 mark it addressable. */ 1303 if (!allows_reg && allows_mem) 1304 { 1305 /* Strip the nops as we allow this case. FIXME, this really 1306 should be rejected or made deprecated. */ 1307 STRIP_NOPS (operand); 1308 if (!cxx_mark_addressable (operand)) 1309 operand = error_mark_node; 1310 } 1311 } 1312 else 1313 operand = error_mark_node; 1314 1315 TREE_VALUE (t) = operand; 1316 } 1317 } 1318 1319 r = build_stmt (ASM_EXPR, string, 1320 output_operands, input_operands, 1321 clobbers); 1322 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0; 1323 r = maybe_cleanup_point_expr_void (r); 1324 return add_stmt (r); 1325} 1326 1327/* Finish a label with the indicated NAME. */ 1328 1329tree 1330finish_label_stmt (tree name) 1331{ 1332 tree decl = define_label (input_location, name); 1333 1334 if (decl == error_mark_node) 1335 return error_mark_node; 1336 1337 return add_stmt (build_stmt (LABEL_EXPR, decl)); 1338} 1339 1340/* Finish a series of declarations for local labels. G++ allows users 1341 to declare "local" labels, i.e., labels with scope. This extension 1342 is useful when writing code involving statement-expressions. */ 1343 1344void 1345finish_label_decl (tree name) 1346{ 1347 if (!at_function_scope_p ()) 1348 { 1349 error ("__label__ declarations are only allowed in function scopes"); 1350 return; 1351 } 1352 1353 add_decl_expr (declare_local_label (name)); 1354} 1355 1356/* When DECL goes out of scope, make sure that CLEANUP is executed. */ 1357 1358void 1359finish_decl_cleanup (tree decl, tree cleanup) 1360{ 1361 push_cleanup (decl, cleanup, false); 1362} 1363 1364/* If the current scope exits with an exception, run CLEANUP. */ 1365 1366void 1367finish_eh_cleanup (tree cleanup) 1368{ 1369 push_cleanup (NULL, cleanup, true); 1370} 1371 1372/* The MEM_INITS is a list of mem-initializers, in reverse of the 1373 order they were written by the user. Each node is as for 1374 emit_mem_initializers. */ 1375 1376void 1377finish_mem_initializers (tree mem_inits) 1378{ 1379 /* Reorder the MEM_INITS so that they are in the order they appeared 1380 in the source program. */ 1381 mem_inits = nreverse (mem_inits); 1382 1383 if (processing_template_decl) 1384 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits)); 1385 else 1386 emit_mem_initializers (mem_inits); 1387} 1388 1389/* Finish a parenthesized expression EXPR. */ 1390 1391tree 1392finish_parenthesized_expr (tree expr) 1393{ 1394 if (EXPR_P (expr)) 1395 /* This inhibits warnings in c_common_truthvalue_conversion. */ 1396 TREE_NO_WARNING (expr) = 1; 1397 1398 if (TREE_CODE (expr) == OFFSET_REF) 1399 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be 1400 enclosed in parentheses. */ 1401 PTRMEM_OK_P (expr) = 0; 1402 1403 if (TREE_CODE (expr) == STRING_CST) 1404 PAREN_STRING_LITERAL_P (expr) = 1; 1405 1406 return expr; 1407} 1408 1409/* Finish a reference to a non-static data member (DECL) that is not 1410 preceded by `.' or `->'. */ 1411 1412tree 1413finish_non_static_data_member (tree decl, tree object, tree qualifying_scope) 1414{ 1415 gcc_assert (TREE_CODE (decl) == FIELD_DECL); 1416 1417 if (!object) 1418 { 1419 if (current_function_decl 1420 && DECL_STATIC_FUNCTION_P (current_function_decl)) 1421 error ("invalid use of member %q+D in static member function", decl); 1422 else 1423 error ("invalid use of non-static data member %q+D", decl); 1424 error ("from this location"); 1425 1426 return error_mark_node; 1427 } 1428 TREE_USED (current_class_ptr) = 1; 1429 if (processing_template_decl && !qualifying_scope) 1430 { 1431 tree type = TREE_TYPE (decl); 1432 1433 if (TREE_CODE (type) == REFERENCE_TYPE) 1434 type = TREE_TYPE (type); 1435 else 1436 { 1437 /* Set the cv qualifiers. */ 1438 int quals = cp_type_quals (TREE_TYPE (current_class_ref)); 1439 1440 if (DECL_MUTABLE_P (decl)) 1441 quals &= ~TYPE_QUAL_CONST; 1442 1443 quals |= cp_type_quals (TREE_TYPE (decl)); 1444 type = cp_build_qualified_type (type, quals); 1445 } 1446 1447 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE); 1448 } 1449 else 1450 { 1451 tree access_type = TREE_TYPE (object); 1452 tree lookup_context = context_for_name_lookup (decl); 1453 1454 while (!DERIVED_FROM_P (lookup_context, access_type)) 1455 { 1456 access_type = TYPE_CONTEXT (access_type); 1457 while (access_type && DECL_P (access_type)) 1458 access_type = DECL_CONTEXT (access_type); 1459 1460 if (!access_type) 1461 { 1462 error ("object missing in reference to %q+D", decl); 1463 error ("from this location"); 1464 return error_mark_node; 1465 } 1466 } 1467 1468 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then 1469 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF 1470 for now. */ 1471 if (processing_template_decl) 1472 return build_qualified_name (TREE_TYPE (decl), 1473 qualifying_scope, 1474 DECL_NAME (decl), 1475 /*template_p=*/false); 1476 1477 perform_or_defer_access_check (TYPE_BINFO (access_type), decl, 1478 decl); 1479 1480 /* If the data member was named `C::M', convert `*this' to `C' 1481 first. */ 1482 if (qualifying_scope) 1483 { 1484 tree binfo = NULL_TREE; 1485 object = build_scoped_ref (object, qualifying_scope, 1486 &binfo); 1487 } 1488 1489 return build_class_member_access_expr (object, decl, 1490 /*access_path=*/NULL_TREE, 1491 /*preserve_reference=*/false); 1492 } 1493} 1494 1495/* DECL was the declaration to which a qualified-id resolved. Issue 1496 an error message if it is not accessible. If OBJECT_TYPE is 1497 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the 1498 type of `*x', or `x', respectively. If the DECL was named as 1499 `A::B' then NESTED_NAME_SPECIFIER is `A'. */ 1500 1501void 1502check_accessibility_of_qualified_id (tree decl, 1503 tree object_type, 1504 tree nested_name_specifier) 1505{ 1506 tree scope; 1507 tree qualifying_type = NULL_TREE; 1508 1509 /* If we're not checking, return immediately. */ 1510 if (deferred_access_no_check) 1511 return; 1512 1513 /* Determine the SCOPE of DECL. */ 1514 scope = context_for_name_lookup (decl); 1515 /* If the SCOPE is not a type, then DECL is not a member. */ 1516 if (!TYPE_P (scope)) 1517 return; 1518 /* Compute the scope through which DECL is being accessed. */ 1519 if (object_type 1520 /* OBJECT_TYPE might not be a class type; consider: 1521 1522 class A { typedef int I; }; 1523 I *p; 1524 p->A::I::~I(); 1525 1526 In this case, we will have "A::I" as the DECL, but "I" as the 1527 OBJECT_TYPE. */ 1528 && CLASS_TYPE_P (object_type) 1529 && DERIVED_FROM_P (scope, object_type)) 1530 /* If we are processing a `->' or `.' expression, use the type of the 1531 left-hand side. */ 1532 qualifying_type = object_type; 1533 else if (nested_name_specifier) 1534 { 1535 /* If the reference is to a non-static member of the 1536 current class, treat it as if it were referenced through 1537 `this'. */ 1538 if (DECL_NONSTATIC_MEMBER_P (decl) 1539 && current_class_ptr 1540 && DERIVED_FROM_P (scope, current_class_type)) 1541 qualifying_type = current_class_type; 1542 /* Otherwise, use the type indicated by the 1543 nested-name-specifier. */ 1544 else 1545 qualifying_type = nested_name_specifier; 1546 } 1547 else 1548 /* Otherwise, the name must be from the current class or one of 1549 its bases. */ 1550 qualifying_type = currently_open_derived_class (scope); 1551 1552 if (qualifying_type 1553 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM 1554 or similar in a default argument value. */ 1555 && CLASS_TYPE_P (qualifying_type) 1556 && !dependent_type_p (qualifying_type)) 1557 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl, 1558 decl); 1559} 1560 1561/* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the 1562 class named to the left of the "::" operator. DONE is true if this 1563 expression is a complete postfix-expression; it is false if this 1564 expression is followed by '->', '[', '(', etc. ADDRESS_P is true 1565 iff this expression is the operand of '&'. TEMPLATE_P is true iff 1566 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P 1567 is true iff this qualified name appears as a template argument. */ 1568 1569tree 1570finish_qualified_id_expr (tree qualifying_class, 1571 tree expr, 1572 bool done, 1573 bool address_p, 1574 bool template_p, 1575 bool template_arg_p) 1576{ 1577 gcc_assert (TYPE_P (qualifying_class)); 1578 1579 if (error_operand_p (expr)) 1580 return error_mark_node; 1581 1582 if (DECL_P (expr) || BASELINK_P (expr)) 1583 mark_used (expr); 1584 1585 if (template_p) 1586 check_template_keyword (expr); 1587 1588 /* If EXPR occurs as the operand of '&', use special handling that 1589 permits a pointer-to-member. */ 1590 if (address_p && done) 1591 { 1592 if (TREE_CODE (expr) == SCOPE_REF) 1593 expr = TREE_OPERAND (expr, 1); 1594 expr = build_offset_ref (qualifying_class, expr, 1595 /*address_p=*/true); 1596 return expr; 1597 } 1598 1599 /* Within the scope of a class, turn references to non-static 1600 members into expression of the form "this->...". */ 1601 if (template_arg_p) 1602 /* But, within a template argument, we do not want make the 1603 transformation, as there is no "this" pointer. */ 1604 ; 1605 else if (TREE_CODE (expr) == FIELD_DECL) 1606 expr = finish_non_static_data_member (expr, current_class_ref, 1607 qualifying_class); 1608 else if (BASELINK_P (expr) && !processing_template_decl) 1609 { 1610 tree fns; 1611 1612 /* See if any of the functions are non-static members. */ 1613 fns = BASELINK_FUNCTIONS (expr); 1614 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR) 1615 fns = TREE_OPERAND (fns, 0); 1616 /* If so, the expression may be relative to the current 1617 class. */ 1618 if (!shared_member_p (fns) 1619 && current_class_type 1620 && DERIVED_FROM_P (qualifying_class, current_class_type)) 1621 expr = (build_class_member_access_expr 1622 (maybe_dummy_object (qualifying_class, NULL), 1623 expr, 1624 BASELINK_ACCESS_BINFO (expr), 1625 /*preserve_reference=*/false)); 1626 else if (done) 1627 /* The expression is a qualified name whose address is not 1628 being taken. */ 1629 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false); 1630 } 1631 1632 return expr; 1633} 1634 1635/* Begin a statement-expression. The value returned must be passed to 1636 finish_stmt_expr. */ 1637 1638tree 1639begin_stmt_expr (void) 1640{ 1641 return push_stmt_list (); 1642} 1643 1644/* Process the final expression of a statement expression. EXPR can be 1645 NULL, if the final expression is empty. Return a STATEMENT_LIST 1646 containing all the statements in the statement-expression, or 1647 ERROR_MARK_NODE if there was an error. */ 1648 1649tree 1650finish_stmt_expr_expr (tree expr, tree stmt_expr) 1651{ 1652 if (error_operand_p (expr)) 1653 return error_mark_node; 1654 1655 /* If the last statement does not have "void" type, then the value 1656 of the last statement is the value of the entire expression. */ 1657 if (expr) 1658 { 1659 tree type = TREE_TYPE (expr); 1660 1661 if (processing_template_decl) 1662 { 1663 expr = build_stmt (EXPR_STMT, expr); 1664 expr = add_stmt (expr); 1665 /* Mark the last statement so that we can recognize it as such at 1666 template-instantiation time. */ 1667 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1; 1668 } 1669 else if (VOID_TYPE_P (type)) 1670 { 1671 /* Just treat this like an ordinary statement. */ 1672 expr = finish_expr_stmt (expr); 1673 } 1674 else 1675 { 1676 /* It actually has a value we need to deal with. First, force it 1677 to be an rvalue so that we won't need to build up a copy 1678 constructor call later when we try to assign it to something. */ 1679 expr = force_rvalue (expr); 1680 if (error_operand_p (expr)) 1681 return error_mark_node; 1682 1683 /* Update for array-to-pointer decay. */ 1684 type = TREE_TYPE (expr); 1685 1686 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a 1687 normal statement, but don't convert to void or actually add 1688 the EXPR_STMT. */ 1689 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR) 1690 expr = maybe_cleanup_point_expr (expr); 1691 add_stmt (expr); 1692 } 1693 1694 /* The type of the statement-expression is the type of the last 1695 expression. */ 1696 TREE_TYPE (stmt_expr) = type; 1697 } 1698 1699 return stmt_expr; 1700} 1701 1702/* Finish a statement-expression. EXPR should be the value returned 1703 by the previous begin_stmt_expr. Returns an expression 1704 representing the statement-expression. */ 1705 1706tree 1707finish_stmt_expr (tree stmt_expr, bool has_no_scope) 1708{ 1709 tree type; 1710 tree result; 1711 1712 if (error_operand_p (stmt_expr)) 1713 return error_mark_node; 1714 1715 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST); 1716 1717 type = TREE_TYPE (stmt_expr); 1718 result = pop_stmt_list (stmt_expr); 1719 TREE_TYPE (result) = type; 1720 1721 if (processing_template_decl) 1722 { 1723 result = build_min (STMT_EXPR, type, result); 1724 TREE_SIDE_EFFECTS (result) = 1; 1725 STMT_EXPR_NO_SCOPE (result) = has_no_scope; 1726 } 1727 else if (CLASS_TYPE_P (type)) 1728 { 1729 /* Wrap the statement-expression in a TARGET_EXPR so that the 1730 temporary object created by the final expression is destroyed at 1731 the end of the full-expression containing the 1732 statement-expression. */ 1733 result = force_target_expr (type, result); 1734 } 1735 1736 return result; 1737} 1738 1739/* Perform Koenig lookup. FN is the postfix-expression representing 1740 the function (or functions) to call; ARGS are the arguments to the 1741 call. Returns the functions to be considered by overload 1742 resolution. */ 1743 1744tree 1745perform_koenig_lookup (tree fn, tree args) 1746{ 1747 tree identifier = NULL_TREE; 1748 tree functions = NULL_TREE; 1749 1750 /* Find the name of the overloaded function. */ 1751 if (TREE_CODE (fn) == IDENTIFIER_NODE) 1752 identifier = fn; 1753 else if (is_overloaded_fn (fn)) 1754 { 1755 functions = fn; 1756 identifier = DECL_NAME (get_first_fn (functions)); 1757 } 1758 else if (DECL_P (fn)) 1759 { 1760 functions = fn; 1761 identifier = DECL_NAME (fn); 1762 } 1763 1764 /* A call to a namespace-scope function using an unqualified name. 1765 1766 Do Koenig lookup -- unless any of the arguments are 1767 type-dependent. */ 1768 if (!any_type_dependent_arguments_p (args)) 1769 { 1770 fn = lookup_arg_dependent (identifier, functions, args); 1771 if (!fn) 1772 /* The unqualified name could not be resolved. */ 1773 fn = unqualified_fn_lookup_error (identifier); 1774 } 1775 1776 return fn; 1777} 1778 1779/* Generate an expression for `FN (ARGS)'. 1780 1781 If DISALLOW_VIRTUAL is true, the call to FN will be not generated 1782 as a virtual call, even if FN is virtual. (This flag is set when 1783 encountering an expression where the function name is explicitly 1784 qualified. For example a call to `X::f' never generates a virtual 1785 call.) 1786 1787 Returns code for the call. */ 1788 1789tree 1790finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p) 1791{ 1792 tree result; 1793 tree orig_fn; 1794 tree orig_args; 1795 1796 if (fn == error_mark_node || args == error_mark_node) 1797 return error_mark_node; 1798 1799 /* ARGS should be a list of arguments. */ 1800 gcc_assert (!args || TREE_CODE (args) == TREE_LIST); 1801 gcc_assert (!TYPE_P (fn)); 1802 1803 orig_fn = fn; 1804 orig_args = args; 1805 1806 if (processing_template_decl) 1807 { 1808 if (type_dependent_expression_p (fn) 1809 || any_type_dependent_arguments_p (args)) 1810 { 1811 result = build_nt (CALL_EXPR, fn, args, NULL_TREE); 1812 KOENIG_LOOKUP_P (result) = koenig_p; 1813 return result; 1814 } 1815 if (!BASELINK_P (fn) 1816 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR 1817 && TREE_TYPE (fn) != unknown_type_node) 1818 fn = build_non_dependent_expr (fn); 1819 args = build_non_dependent_args (orig_args); 1820 } 1821 1822 if (is_overloaded_fn (fn)) 1823 fn = baselink_for_fns (fn); 1824 1825 result = NULL_TREE; 1826 if (BASELINK_P (fn)) 1827 { 1828 tree object; 1829 1830 /* A call to a member function. From [over.call.func]: 1831 1832 If the keyword this is in scope and refers to the class of 1833 that member function, or a derived class thereof, then the 1834 function call is transformed into a qualified function call 1835 using (*this) as the postfix-expression to the left of the 1836 . operator.... [Otherwise] a contrived object of type T 1837 becomes the implied object argument. 1838 1839 This paragraph is unclear about this situation: 1840 1841 struct A { void f(); }; 1842 struct B : public A {}; 1843 struct C : public A { void g() { B::f(); }}; 1844 1845 In particular, for `B::f', this paragraph does not make clear 1846 whether "the class of that member function" refers to `A' or 1847 to `B'. We believe it refers to `B'. */ 1848 if (current_class_type 1849 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)), 1850 current_class_type) 1851 && current_class_ref) 1852 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)), 1853 NULL); 1854 else 1855 { 1856 tree representative_fn; 1857 1858 representative_fn = BASELINK_FUNCTIONS (fn); 1859 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR) 1860 representative_fn = TREE_OPERAND (representative_fn, 0); 1861 representative_fn = get_first_fn (representative_fn); 1862 object = build_dummy_object (DECL_CONTEXT (representative_fn)); 1863 } 1864 1865 if (processing_template_decl) 1866 { 1867 if (type_dependent_expression_p (object)) 1868 return build_nt (CALL_EXPR, orig_fn, orig_args, NULL_TREE); 1869 object = build_non_dependent_expr (object); 1870 } 1871 1872 result = build_new_method_call (object, fn, args, NULL_TREE, 1873 (disallow_virtual 1874 ? LOOKUP_NONVIRTUAL : 0), 1875 /*fn_p=*/NULL); 1876 } 1877 else if (is_overloaded_fn (fn)) 1878 { 1879 /* If the function is an overloaded builtin, resolve it. */ 1880 if (TREE_CODE (fn) == FUNCTION_DECL 1881 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL 1882 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD)) 1883 result = resolve_overloaded_builtin (fn, args); 1884 1885 if (!result) 1886 /* A call to a namespace-scope function. */ 1887 result = build_new_function_call (fn, args, koenig_p); 1888 } 1889 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR) 1890 { 1891 if (args) 1892 error ("arguments to destructor are not allowed"); 1893 /* Mark the pseudo-destructor call as having side-effects so 1894 that we do not issue warnings about its use. */ 1895 result = build1 (NOP_EXPR, 1896 void_type_node, 1897 TREE_OPERAND (fn, 0)); 1898 TREE_SIDE_EFFECTS (result) = 1; 1899 } 1900 else if (CLASS_TYPE_P (TREE_TYPE (fn))) 1901 /* If the "function" is really an object of class type, it might 1902 have an overloaded `operator ()'. */ 1903 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE, 1904 /*overloaded_p=*/NULL); 1905 1906 if (!result) 1907 /* A call where the function is unknown. */ 1908 result = build_function_call (fn, args); 1909 1910 if (processing_template_decl) 1911 { 1912 result = build3 (CALL_EXPR, TREE_TYPE (result), orig_fn, 1913 orig_args, NULL_TREE); 1914 KOENIG_LOOKUP_P (result) = koenig_p; 1915 } 1916 return result; 1917} 1918 1919/* Finish a call to a postfix increment or decrement or EXPR. (Which 1920 is indicated by CODE, which should be POSTINCREMENT_EXPR or 1921 POSTDECREMENT_EXPR.) */ 1922 1923tree 1924finish_increment_expr (tree expr, enum tree_code code) 1925{ 1926 return build_x_unary_op (code, expr); 1927} 1928 1929/* Finish a use of `this'. Returns an expression for `this'. */ 1930 1931tree 1932finish_this_expr (void) 1933{ 1934 tree result; 1935 1936 if (current_class_ptr) 1937 { 1938 result = current_class_ptr; 1939 } 1940 else if (current_function_decl 1941 && DECL_STATIC_FUNCTION_P (current_function_decl)) 1942 { 1943 error ("%<this%> is unavailable for static member functions"); 1944 result = error_mark_node; 1945 } 1946 /* APPLE LOCAL begin radar 6275956 */ 1947 else if (cur_block && current_function_decl 1948 && BLOCK_SYNTHESIZED_FUNC (current_function_decl)) 1949 { 1950 result = lookup_name (this_identifier); 1951 if (!result) 1952 { 1953 error ("invalid use of %<this%> in a block"); 1954 result = error_mark_node; 1955 } 1956 } 1957 /* APPLE LOCAL end radar 6275956 */ 1958 else 1959 { 1960 if (current_function_decl) 1961 error ("invalid use of %<this%> in non-member function"); 1962 else 1963 error ("invalid use of %<this%> at top level"); 1964 result = error_mark_node; 1965 } 1966 1967 return result; 1968} 1969 1970/* Finish a pseudo-destructor expression. If SCOPE is NULL, the 1971 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is 1972 the TYPE for the type given. If SCOPE is non-NULL, the expression 1973 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */ 1974 1975tree 1976finish_pseudo_destructor_expr (tree object, tree scope, tree destructor) 1977{ 1978 if (destructor == error_mark_node) 1979 return error_mark_node; 1980 1981 gcc_assert (TYPE_P (destructor)); 1982 1983 if (!processing_template_decl) 1984 { 1985 if (scope == error_mark_node) 1986 { 1987 error ("invalid qualifying scope in pseudo-destructor name"); 1988 return error_mark_node; 1989 } 1990 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor)) 1991 { 1992 error ("qualified type %qT does not match destructor name ~%qT", 1993 scope, destructor); 1994 return error_mark_node; 1995 } 1996 1997 1998 /* [expr.pseudo] says both: 1999 2000 The type designated by the pseudo-destructor-name shall be 2001 the same as the object type. 2002 2003 and: 2004 2005 The cv-unqualified versions of the object type and of the 2006 type designated by the pseudo-destructor-name shall be the 2007 same type. 2008 2009 We implement the more generous second sentence, since that is 2010 what most other compilers do. */ 2011 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object), 2012 destructor)) 2013 { 2014 error ("%qE is not of type %qT", object, destructor); 2015 return error_mark_node; 2016 } 2017 } 2018 2019 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor); 2020} 2021 2022/* Finish an expression of the form CODE EXPR. */ 2023 2024tree 2025finish_unary_op_expr (enum tree_code code, tree expr) 2026{ 2027 tree result = build_x_unary_op (code, expr); 2028 /* Inside a template, build_x_unary_op does not fold the 2029 expression. So check whether the result is folded before 2030 setting TREE_NEGATED_INT. */ 2031 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST 2032 && TREE_CODE (result) == INTEGER_CST 2033 && !TYPE_UNSIGNED (TREE_TYPE (result)) 2034 && INT_CST_LT (result, integer_zero_node)) 2035 { 2036 /* RESULT may be a cached INTEGER_CST, so we must copy it before 2037 setting TREE_NEGATED_INT. */ 2038 result = copy_node (result); 2039 TREE_NEGATED_INT (result) = 1; 2040 } 2041 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr)) 2042 overflow_warning (result); 2043 2044 return result; 2045} 2046 2047/* Finish a compound-literal expression. TYPE is the type to which 2048 the INITIALIZER_LIST is being cast. */ 2049 2050tree 2051finish_compound_literal (tree type, VEC(constructor_elt,gc) *initializer_list) 2052{ 2053 tree var; 2054 tree compound_literal; 2055 2056 if (!TYPE_OBJ_P (type)) 2057 { 2058 error ("compound literal of non-object type %qT", type); 2059 return error_mark_node; 2060 } 2061 2062 /* Build a CONSTRUCTOR for the INITIALIZER_LIST. */ 2063 compound_literal = build_constructor (NULL_TREE, initializer_list); 2064 if (processing_template_decl) 2065 { 2066 TREE_TYPE (compound_literal) = type; 2067 /* Mark the expression as a compound literal. */ 2068 TREE_HAS_CONSTRUCTOR (compound_literal) = 1; 2069 return compound_literal; 2070 } 2071 2072 /* Create a temporary variable to represent the compound literal. */ 2073 var = create_temporary_var (type); 2074 if (!current_function_decl) 2075 { 2076 /* If this compound-literal appears outside of a function, then 2077 the corresponding variable has static storage duration, just 2078 like the variable in whose initializer it appears. */ 2079 TREE_STATIC (var) = 1; 2080 /* The variable has internal linkage, since there is no need to 2081 reference it from another translation unit. */ 2082 TREE_PUBLIC (var) = 0; 2083 /* It must have a name, so that the name mangler can mangle it. */ 2084 DECL_NAME (var) = make_anon_name (); 2085 } 2086 /* We must call pushdecl, since the gimplifier complains if the 2087 variable has not been declared via a BIND_EXPR. */ 2088 pushdecl (var); 2089 /* Initialize the variable as we would any other variable with a 2090 brace-enclosed initializer. */ 2091 cp_finish_decl (var, compound_literal, 2092 /*init_const_expr_p=*/false, 2093 /*asmspec_tree=*/NULL_TREE, 2094 LOOKUP_ONLYCONVERTING); 2095 return var; 2096} 2097 2098/* Return the declaration for the function-name variable indicated by 2099 ID. */ 2100 2101tree 2102finish_fname (tree id) 2103{ 2104 tree decl; 2105 2106 decl = fname_decl (C_RID_CODE (id), id); 2107 if (processing_template_decl) 2108 decl = DECL_NAME (decl); 2109 return decl; 2110} 2111 2112/* Finish a translation unit. */ 2113 2114void 2115finish_translation_unit (void) 2116{ 2117 /* In case there were missing closebraces, 2118 get us back to the global binding level. */ 2119 pop_everything (); 2120 while (current_namespace != global_namespace) 2121 pop_namespace (); 2122 2123 /* Do file scope __FUNCTION__ et al. */ 2124 finish_fname_decls (); 2125} 2126 2127/* Finish a template type parameter, specified as AGGR IDENTIFIER. 2128 Returns the parameter. */ 2129 2130tree 2131finish_template_type_parm (tree aggr, tree identifier) 2132{ 2133 if (aggr != class_type_node) 2134 { 2135 pedwarn ("template type parameters must use the keyword %<class%> or %<typename%>"); 2136 aggr = class_type_node; 2137 } 2138 2139 return build_tree_list (aggr, identifier); 2140} 2141 2142/* Finish a template template parameter, specified as AGGR IDENTIFIER. 2143 Returns the parameter. */ 2144 2145tree 2146finish_template_template_parm (tree aggr, tree identifier) 2147{ 2148 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE); 2149 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE); 2150 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms; 2151 DECL_TEMPLATE_RESULT (tmpl) = decl; 2152 DECL_ARTIFICIAL (decl) = 1; 2153 end_template_decl (); 2154 2155 gcc_assert (DECL_TEMPLATE_PARMS (tmpl)); 2156 2157 return finish_template_type_parm (aggr, tmpl); 2158} 2159 2160/* ARGUMENT is the default-argument value for a template template 2161 parameter. If ARGUMENT is invalid, issue error messages and return 2162 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */ 2163 2164tree 2165check_template_template_default_arg (tree argument) 2166{ 2167 if (TREE_CODE (argument) != TEMPLATE_DECL 2168 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM 2169 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE) 2170 { 2171 if (TREE_CODE (argument) == TYPE_DECL) 2172 error ("invalid use of type %qT as a default value for a template " 2173 "template-parameter", TREE_TYPE (argument)); 2174 else 2175 error ("invalid default argument for a template template parameter"); 2176 return error_mark_node; 2177 } 2178 2179 return argument; 2180} 2181 2182/* Begin a class definition, as indicated by T. */ 2183 2184tree 2185begin_class_definition (tree t, tree attributes) 2186{ 2187 if (t == error_mark_node) 2188 return error_mark_node; 2189 2190 if (processing_template_parmlist) 2191 { 2192 error ("definition of %q#T inside template parameter list", t); 2193 return error_mark_node; 2194 } 2195 /* A non-implicit typename comes from code like: 2196 2197 template <typename T> struct A { 2198 template <typename U> struct A<T>::B ... 2199 2200 This is erroneous. */ 2201 else if (TREE_CODE (t) == TYPENAME_TYPE) 2202 { 2203 error ("invalid definition of qualified type %qT", t); 2204 t = error_mark_node; 2205 } 2206 2207 if (t == error_mark_node || ! IS_AGGR_TYPE (t)) 2208 { 2209 t = make_aggr_type (RECORD_TYPE); 2210 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current); 2211 } 2212 2213 /* Update the location of the decl. */ 2214 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location; 2215 2216 if (TYPE_BEING_DEFINED (t)) 2217 { 2218 t = make_aggr_type (TREE_CODE (t)); 2219 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current); 2220 } 2221 maybe_process_partial_specialization (t); 2222 pushclass (t); 2223 TYPE_BEING_DEFINED (t) = 1; 2224 2225 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE); 2226 2227 if (flag_pack_struct) 2228 { 2229 tree v; 2230 TYPE_PACKED (t) = 1; 2231 /* Even though the type is being defined for the first time 2232 here, there might have been a forward declaration, so there 2233 might be cv-qualified variants of T. */ 2234 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v)) 2235 TYPE_PACKED (v) = 1; 2236 } 2237 /* Reset the interface data, at the earliest possible 2238 moment, as it might have been set via a class foo; 2239 before. */ 2240 if (! TYPE_ANONYMOUS_P (t)) 2241 { 2242 struct c_fileinfo *finfo = get_fileinfo (input_filename); 2243 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only; 2244 SET_CLASSTYPE_INTERFACE_UNKNOWN_X 2245 (t, finfo->interface_unknown); 2246 } 2247 reset_specialization(); 2248 2249 /* Make a declaration for this class in its own scope. */ 2250 build_self_reference (); 2251 2252 return t; 2253} 2254 2255/* Finish the member declaration given by DECL. */ 2256 2257void 2258finish_member_declaration (tree decl) 2259{ 2260 if (decl == error_mark_node || decl == NULL_TREE) 2261 return; 2262 2263 if (decl == void_type_node) 2264 /* The COMPONENT was a friend, not a member, and so there's 2265 nothing for us to do. */ 2266 return; 2267 2268 /* We should see only one DECL at a time. */ 2269 gcc_assert (TREE_CHAIN (decl) == NULL_TREE); 2270 2271 /* Set up access control for DECL. */ 2272 TREE_PRIVATE (decl) 2273 = (current_access_specifier == access_private_node); 2274 TREE_PROTECTED (decl) 2275 = (current_access_specifier == access_protected_node); 2276 if (TREE_CODE (decl) == TEMPLATE_DECL) 2277 { 2278 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl); 2279 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl); 2280 } 2281 2282 /* Mark the DECL as a member of the current class. */ 2283 DECL_CONTEXT (decl) = current_class_type; 2284 2285 /* [dcl.link] 2286 2287 A C language linkage is ignored for the names of class members 2288 and the member function type of class member functions. */ 2289 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c) 2290 SET_DECL_LANGUAGE (decl, lang_cplusplus); 2291 2292 /* Put functions on the TYPE_METHODS list and everything else on the 2293 TYPE_FIELDS list. Note that these are built up in reverse order. 2294 We reverse them (to obtain declaration order) in finish_struct. */ 2295 if (TREE_CODE (decl) == FUNCTION_DECL 2296 || DECL_FUNCTION_TEMPLATE_P (decl)) 2297 { 2298 /* We also need to add this function to the 2299 CLASSTYPE_METHOD_VEC. */ 2300 if (add_method (current_class_type, decl, NULL_TREE)) 2301 { 2302 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type); 2303 TYPE_METHODS (current_class_type) = decl; 2304 2305 maybe_add_class_template_decl_list (current_class_type, decl, 2306 /*friend_p=*/0); 2307 } 2308 } 2309 /* Enter the DECL into the scope of the class. */ 2310 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl)) 2311 || pushdecl_class_level (decl)) 2312 { 2313 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields 2314 go at the beginning. The reason is that lookup_field_1 2315 searches the list in order, and we want a field name to 2316 override a type name so that the "struct stat hack" will 2317 work. In particular: 2318 2319 struct S { enum E { }; int E } s; 2320 s.E = 3; 2321 2322 is valid. In addition, the FIELD_DECLs must be maintained in 2323 declaration order so that class layout works as expected. 2324 However, we don't need that order until class layout, so we 2325 save a little time by putting FIELD_DECLs on in reverse order 2326 here, and then reversing them in finish_struct_1. (We could 2327 also keep a pointer to the correct insertion points in the 2328 list.) */ 2329 2330 if (TREE_CODE (decl) == TYPE_DECL) 2331 TYPE_FIELDS (current_class_type) 2332 = chainon (TYPE_FIELDS (current_class_type), decl); 2333 else 2334 { 2335 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type); 2336 TYPE_FIELDS (current_class_type) = decl; 2337 } 2338 2339 maybe_add_class_template_decl_list (current_class_type, decl, 2340 /*friend_p=*/0); 2341 } 2342 2343 if (pch_file) 2344 note_decl_for_pch (decl); 2345} 2346 2347/* DECL has been declared while we are building a PCH file. Perform 2348 actions that we might normally undertake lazily, but which can be 2349 performed now so that they do not have to be performed in 2350 translation units which include the PCH file. */ 2351 2352void 2353note_decl_for_pch (tree decl) 2354{ 2355 gcc_assert (pch_file); 2356 2357 /* There's a good chance that we'll have to mangle names at some 2358 point, even if only for emission in debugging information. */ 2359 if ((TREE_CODE (decl) == VAR_DECL 2360 || TREE_CODE (decl) == FUNCTION_DECL) 2361 && !processing_template_decl) 2362 mangle_decl (decl); 2363} 2364 2365/* Finish processing a complete template declaration. The PARMS are 2366 the template parameters. */ 2367 2368void 2369finish_template_decl (tree parms) 2370{ 2371 if (parms) 2372 end_template_decl (); 2373 else 2374 end_specialization (); 2375} 2376 2377/* Finish processing a template-id (which names a type) of the form 2378 NAME < ARGS >. Return the TYPE_DECL for the type named by the 2379 template-id. If ENTERING_SCOPE is nonzero we are about to enter 2380 the scope of template-id indicated. */ 2381 2382tree 2383finish_template_type (tree name, tree args, int entering_scope) 2384{ 2385 tree decl; 2386 2387 decl = lookup_template_class (name, args, 2388 NULL_TREE, NULL_TREE, entering_scope, 2389 tf_warning_or_error | tf_user); 2390 if (decl != error_mark_node) 2391 decl = TYPE_STUB_DECL (decl); 2392 2393 return decl; 2394} 2395 2396/* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER. 2397 Return a TREE_LIST containing the ACCESS_SPECIFIER and the 2398 BASE_CLASS, or NULL_TREE if an error occurred. The 2399 ACCESS_SPECIFIER is one of 2400 access_{default,public,protected_private}_node. For a virtual base 2401 we set TREE_TYPE. */ 2402 2403tree 2404finish_base_specifier (tree base, tree access, bool virtual_p) 2405{ 2406 tree result; 2407 2408 if (base == error_mark_node) 2409 { 2410 error ("invalid base-class specification"); 2411 result = NULL_TREE; 2412 } 2413 else if (! is_aggr_type (base, 1)) 2414 result = NULL_TREE; 2415 else 2416 { 2417 if (cp_type_quals (base) != 0) 2418 { 2419 error ("base class %qT has cv qualifiers", base); 2420 base = TYPE_MAIN_VARIANT (base); 2421 } 2422 result = build_tree_list (access, base); 2423 if (virtual_p) 2424 TREE_TYPE (result) = integer_type_node; 2425 } 2426 2427 return result; 2428} 2429 2430/* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is 2431 what we found when we tried to do the lookup. */ 2432 2433void 2434qualified_name_lookup_error (tree scope, tree name, tree decl) 2435{ 2436 if (scope == error_mark_node) 2437 ; /* We already complained. */ 2438 else if (TYPE_P (scope)) 2439 { 2440 if (!COMPLETE_TYPE_P (scope)) 2441 error ("incomplete type %qT used in nested name specifier", scope); 2442 else if (TREE_CODE (decl) == TREE_LIST) 2443 { 2444 error ("reference to %<%T::%D%> is ambiguous", scope, name); 2445 print_candidates (decl); 2446 } 2447 else 2448 error ("%qD is not a member of %qT", name, scope); 2449 } 2450 else if (scope != global_namespace) 2451 error ("%qD is not a member of %qD", name, scope); 2452 else 2453 error ("%<::%D%> has not been declared", name); 2454} 2455 2456/* If FNS is a member function, a set of member functions, or a 2457 template-id referring to one or more member functions, return a 2458 BASELINK for FNS, incorporating the current access context. 2459 Otherwise, return FNS unchanged. */ 2460 2461tree 2462baselink_for_fns (tree fns) 2463{ 2464 tree fn; 2465 tree cl; 2466 2467 if (BASELINK_P (fns) 2468 || error_operand_p (fns)) 2469 return fns; 2470 2471 fn = fns; 2472 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR) 2473 fn = TREE_OPERAND (fn, 0); 2474 fn = get_first_fn (fn); 2475 if (!DECL_FUNCTION_MEMBER_P (fn)) 2476 return fns; 2477 2478 cl = currently_open_derived_class (DECL_CONTEXT (fn)); 2479 if (!cl) 2480 cl = DECL_CONTEXT (fn); 2481 cl = TYPE_BINFO (cl); 2482 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE); 2483} 2484 2485/* APPLE LOCAL begin blocks 6040305 */ 2486static bool 2487block_var_ok_for_context (tree context) 2488{ 2489 /* FIXME - local classes inside blocks, templates, etc */ 2490 struct block_sema_info *b = cur_block; 2491 tree decl = current_function_decl; 2492 2493 /* If in a block helper, only variables from the context of the helper 2494 are ok. */ 2495 while (b && b->helper_func_decl == decl) 2496 { 2497 if (context == DECL_CONTEXT (decl)) 2498 return true; 2499 decl = DECL_CONTEXT (decl); 2500 b = b->prev_block_info; 2501 } 2502 2503 return false; 2504} 2505 2506/* APPLE LOCAL begin radar 6545782 */ 2507/** This routine does all the work on use of variables in a block. */ 2508static tree get_final_block_variable (tree name, tree var) { 2509 tree decl = var; 2510 2511 if (cur_block 2512 && (TREE_CODE (decl) == VAR_DECL 2513 || TREE_CODE (decl) == PARM_DECL) 2514 && !lookup_name_in_block (name, &decl)) 2515 { 2516 bool gdecl; 2517 /* We are referencing a variable inside a block whose 2518 declaration is outside. */ 2519 gcc_assert (decl && 2520 (TREE_CODE (decl) == VAR_DECL 2521 || TREE_CODE (decl) == PARM_DECL)); 2522 gdecl = (TREE_CODE (decl) == VAR_DECL && 2523 (DECL_EXTERNAL (decl) || TREE_STATIC (decl))); 2524 /* Treat all 'global' variables as 'byref' by default. */ 2525 if (gdecl 2526 || (TREE_CODE (decl) == VAR_DECL && COPYABLE_BYREF_LOCAL_VAR (decl))) 2527 { 2528 /* byref globals are directly accessed. */ 2529 /* APPLE LOCAL begin radar 7760213 */ 2530 if (!gdecl) { 2531 if (HasByrefArray(TREE_TYPE (decl))) 2532 error ("cannot access __block variable of array type inside block"); 2533 /* build a decl for the byref variable. */ 2534 decl = build_block_byref_decl (name, decl, decl); 2535 } 2536 /* APPLE LOCAL end radar 7760213 */ 2537 else 2538 add_block_global_byref_list (decl); 2539 } 2540 else 2541 { 2542 /* 'byref' globals are never copied-in. So, do not add 2543 them to the copied-in list. */ 2544 if (!in_block_global_byref_list (decl)) { 2545 /* APPLE LOCAL begin radar 7721728 */ 2546 if (TREE_CODE (TREE_TYPE (decl)) == ARRAY_TYPE) 2547 error ("cannot access copied-in variable of array type inside block"); 2548 /* APPLE LOCAL end radar 7721728 */ 2549 /* build a new decl node. set its type to 'const' type 2550 of the old decl. */ 2551 decl = build_block_ref_decl (name, decl); 2552 } 2553 } 2554 } 2555 return decl; 2556} 2557/* APPLE LOCAL end radar 6545782 */ 2558 2559/* APPLE LOCAL end blocks 6040305 */ 2560 2561/* ID_EXPRESSION is a representation of parsed, but unprocessed, 2562 id-expression. (See cp_parser_id_expression for details.) SCOPE, 2563 if non-NULL, is the type or namespace used to explicitly qualify 2564 ID_EXPRESSION. DECL is the entity to which that name has been 2565 resolved. 2566 2567 *CONSTANT_EXPRESSION_P is true if we are presently parsing a 2568 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will 2569 be set to true if this expression isn't permitted in a 2570 constant-expression, but it is otherwise not set by this function. 2571 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a 2572 constant-expression, but a non-constant expression is also 2573 permissible. 2574 2575 DONE is true if this expression is a complete postfix-expression; 2576 it is false if this expression is followed by '->', '[', '(', etc. 2577 ADDRESS_P is true iff this expression is the operand of '&'. 2578 TEMPLATE_P is true iff the qualified-id was of the form 2579 "A::template B". TEMPLATE_ARG_P is true iff this qualified name 2580 appears as a template argument. 2581 2582 If an error occurs, and it is the kind of error that might cause 2583 the parser to abort a tentative parse, *ERROR_MSG is filled in. It 2584 is the caller's responsibility to issue the message. *ERROR_MSG 2585 will be a string with static storage duration, so the caller need 2586 not "free" it. 2587 2588 Return an expression for the entity, after issuing appropriate 2589 diagnostics. This function is also responsible for transforming a 2590 reference to a non-static member into a COMPONENT_REF that makes 2591 the use of "this" explicit. 2592 2593 Upon return, *IDK will be filled in appropriately. */ 2594 2595tree 2596finish_id_expression (tree id_expression, 2597 tree decl, 2598 tree scope, 2599 cp_id_kind *idk, 2600 bool integral_constant_expression_p, 2601 bool allow_non_integral_constant_expression_p, 2602 bool *non_integral_constant_expression_p, 2603 bool template_p, 2604 bool done, 2605 bool address_p, 2606 bool template_arg_p, 2607 const char **error_msg) 2608{ 2609 /* Initialize the output parameters. */ 2610 *idk = CP_ID_KIND_NONE; 2611 *error_msg = NULL; 2612 2613 if (id_expression == error_mark_node) 2614 return error_mark_node; 2615 /* If we have a template-id, then no further lookup is 2616 required. If the template-id was for a template-class, we 2617 will sometimes have a TYPE_DECL at this point. */ 2618 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR 2619 || TREE_CODE (decl) == TYPE_DECL) 2620 ; 2621 /* Look up the name. */ 2622 else 2623 { 2624 if (decl == error_mark_node) 2625 { 2626 /* Name lookup failed. */ 2627 2628 if (scope 2629 && (!TYPE_P (scope) 2630 || (!dependent_type_p (scope) 2631 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE 2632 && IDENTIFIER_TYPENAME_P (id_expression) 2633 && dependent_type_p (TREE_TYPE (id_expression)))))) 2634 { 2635 /* If the qualifying type is non-dependent (and the name 2636 does not name a conversion operator to a dependent 2637 type), issue an error. */ 2638 qualified_name_lookup_error (scope, id_expression, decl); 2639 return error_mark_node; 2640 } 2641 else if (!scope) 2642 { 2643 /* It may be resolved via Koenig lookup. */ 2644 *idk = CP_ID_KIND_UNQUALIFIED; 2645 return id_expression; 2646 } 2647 else 2648 decl = id_expression; 2649 } 2650 /* If DECL is a variable that would be out of scope under 2651 ANSI/ISO rules, but in scope in the ARM, name lookup 2652 will succeed. Issue a diagnostic here. */ 2653 else 2654 decl = check_for_out_of_scope_variable (decl); 2655 2656 /* Remember that the name was used in the definition of 2657 the current class so that we can check later to see if 2658 the meaning would have been different after the class 2659 was entirely defined. */ 2660 if (!scope && decl != error_mark_node) 2661 maybe_note_name_used_in_class (id_expression, decl); 2662 2663 /* Disallow uses of local variables from containing functions. */ 2664 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL) 2665 { 2666 tree context = decl_function_context (decl); 2667 if (context != NULL_TREE && context != current_function_decl 2668 /* APPLE LOCAL begin blocks 6040305 */ 2669 && ! TREE_STATIC (decl) 2670 && !block_var_ok_for_context (context)) 2671 /* APPLE LOCAL end blocks 6040305 */ 2672 { 2673 error (TREE_CODE (decl) == VAR_DECL 2674 ? "use of %<auto%> variable from containing function" 2675 : "use of parameter from containing function"); 2676 error (" %q+#D declared here", decl); 2677 return error_mark_node; 2678 } 2679 } 2680 } 2681 2682 /* If we didn't find anything, or what we found was a type, 2683 then this wasn't really an id-expression. */ 2684 if (TREE_CODE (decl) == TEMPLATE_DECL 2685 && !DECL_FUNCTION_TEMPLATE_P (decl)) 2686 { 2687 *error_msg = "missing template arguments"; 2688 return error_mark_node; 2689 } 2690 else if (TREE_CODE (decl) == TYPE_DECL 2691 || TREE_CODE (decl) == NAMESPACE_DECL) 2692 { 2693 *error_msg = "expected primary-expression"; 2694 return error_mark_node; 2695 } 2696 2697 /* If the name resolved to a template parameter, there is no 2698 need to look it up again later. */ 2699 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl)) 2700 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX) 2701 { 2702 tree r; 2703 2704 *idk = CP_ID_KIND_NONE; 2705 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX) 2706 decl = TEMPLATE_PARM_DECL (decl); 2707 r = convert_from_reference (DECL_INITIAL (decl)); 2708 2709 if (integral_constant_expression_p 2710 && !dependent_type_p (TREE_TYPE (decl)) 2711 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r)))) 2712 { 2713 if (!allow_non_integral_constant_expression_p) 2714 error ("template parameter %qD of type %qT is not allowed in " 2715 "an integral constant expression because it is not of " 2716 "integral or enumeration type", decl, TREE_TYPE (decl)); 2717 *non_integral_constant_expression_p = true; 2718 } 2719 return r; 2720 } 2721 /* Similarly, we resolve enumeration constants to their 2722 underlying values. */ 2723 else if (TREE_CODE (decl) == CONST_DECL) 2724 { 2725 *idk = CP_ID_KIND_NONE; 2726 if (!processing_template_decl) 2727 { 2728 used_types_insert (TREE_TYPE (decl)); 2729 return DECL_INITIAL (decl); 2730 } 2731 return decl; 2732 } 2733 else 2734 { 2735 bool dependent_p; 2736 2737 /* If the declaration was explicitly qualified indicate 2738 that. The semantics of `A::f(3)' are different than 2739 `f(3)' if `f' is virtual. */ 2740 *idk = (scope 2741 ? CP_ID_KIND_QUALIFIED 2742 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR 2743 ? CP_ID_KIND_TEMPLATE_ID 2744 : CP_ID_KIND_UNQUALIFIED)); 2745 2746 2747 /* [temp.dep.expr] 2748 2749 An id-expression is type-dependent if it contains an 2750 identifier that was declared with a dependent type. 2751 2752 The standard is not very specific about an id-expression that 2753 names a set of overloaded functions. What if some of them 2754 have dependent types and some of them do not? Presumably, 2755 such a name should be treated as a dependent name. */ 2756 /* Assume the name is not dependent. */ 2757 dependent_p = false; 2758 if (!processing_template_decl) 2759 /* No names are dependent outside a template. */ 2760 ; 2761 /* A template-id where the name of the template was not resolved 2762 is definitely dependent. */ 2763 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR 2764 && (TREE_CODE (TREE_OPERAND (decl, 0)) 2765 == IDENTIFIER_NODE)) 2766 dependent_p = true; 2767 /* For anything except an overloaded function, just check its 2768 type. */ 2769 else if (!is_overloaded_fn (decl)) 2770 dependent_p 2771 = dependent_type_p (TREE_TYPE (decl)); 2772 /* For a set of overloaded functions, check each of the 2773 functions. */ 2774 else 2775 { 2776 tree fns = decl; 2777 2778 if (BASELINK_P (fns)) 2779 fns = BASELINK_FUNCTIONS (fns); 2780 2781 /* For a template-id, check to see if the template 2782 arguments are dependent. */ 2783 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR) 2784 { 2785 tree args = TREE_OPERAND (fns, 1); 2786 dependent_p = any_dependent_template_arguments_p (args); 2787 /* The functions are those referred to by the 2788 template-id. */ 2789 fns = TREE_OPERAND (fns, 0); 2790 } 2791 2792 /* If there are no dependent template arguments, go through 2793 the overloaded functions. */ 2794 while (fns && !dependent_p) 2795 { 2796 tree fn = OVL_CURRENT (fns); 2797 2798 /* Member functions of dependent classes are 2799 dependent. */ 2800 if (TREE_CODE (fn) == FUNCTION_DECL 2801 && type_dependent_expression_p (fn)) 2802 dependent_p = true; 2803 else if (TREE_CODE (fn) == TEMPLATE_DECL 2804 && dependent_template_p (fn)) 2805 dependent_p = true; 2806 2807 fns = OVL_NEXT (fns); 2808 } 2809 } 2810 2811 /* If the name was dependent on a template parameter, we will 2812 resolve the name at instantiation time. */ 2813 if (dependent_p) 2814 { 2815 /* Create a SCOPE_REF for qualified names, if the scope is 2816 dependent. */ 2817 if (scope) 2818 { 2819 /* Since this name was dependent, the expression isn't 2820 constant -- yet. No error is issued because it might 2821 be constant when things are instantiated. */ 2822 if (integral_constant_expression_p) 2823 *non_integral_constant_expression_p = true; 2824 if (TYPE_P (scope)) 2825 { 2826 if (address_p && done) 2827 decl = finish_qualified_id_expr (scope, decl, 2828 done, address_p, 2829 template_p, 2830 template_arg_p); 2831 else if (dependent_type_p (scope)) 2832 decl = build_qualified_name (/*type=*/NULL_TREE, 2833 scope, 2834 id_expression, 2835 template_p); 2836 else if (DECL_P (decl)) 2837 decl = build_qualified_name (TREE_TYPE (decl), 2838 scope, 2839 id_expression, 2840 template_p); 2841 } 2842 if (TREE_TYPE (decl)) 2843 decl = convert_from_reference (decl); 2844 return decl; 2845 } 2846 /* A TEMPLATE_ID already contains all the information we 2847 need. */ 2848 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR) 2849 return id_expression; 2850 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT; 2851 /* If we found a variable, then name lookup during the 2852 instantiation will always resolve to the same VAR_DECL 2853 (or an instantiation thereof). */ 2854 if (TREE_CODE (decl) == VAR_DECL 2855 || TREE_CODE (decl) == PARM_DECL) 2856 return convert_from_reference (decl); 2857 /* The same is true for FIELD_DECL, but we also need to 2858 make sure that the syntax is correct. */ 2859 else if (TREE_CODE (decl) == FIELD_DECL) 2860 { 2861 /* Since SCOPE is NULL here, this is an unqualified name. 2862 Access checking has been performed during name lookup 2863 already. Turn off checking to avoid duplicate errors. */ 2864 push_deferring_access_checks (dk_no_check); 2865 decl = finish_non_static_data_member 2866 (decl, current_class_ref, 2867 /*qualifying_scope=*/NULL_TREE); 2868 pop_deferring_access_checks (); 2869 return decl; 2870 } 2871 return id_expression; 2872 } 2873 2874 /* Only certain kinds of names are allowed in constant 2875 expression. Enumerators and template parameters have already 2876 been handled above. */ 2877 if (integral_constant_expression_p 2878 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl) 2879 && ! builtin_valid_in_constant_expr_p (decl)) 2880 { 2881 if (!allow_non_integral_constant_expression_p) 2882 { 2883 error ("%qD cannot appear in a constant-expression", decl); 2884 return error_mark_node; 2885 } 2886 *non_integral_constant_expression_p = true; 2887 } 2888 2889 if (TREE_CODE (decl) == NAMESPACE_DECL) 2890 { 2891 error ("use of namespace %qD as expression", decl); 2892 return error_mark_node; 2893 } 2894 else if (DECL_CLASS_TEMPLATE_P (decl)) 2895 { 2896 error ("use of class template %qT as expression", decl); 2897 return error_mark_node; 2898 } 2899 else if (TREE_CODE (decl) == TREE_LIST) 2900 { 2901 /* Ambiguous reference to base members. */ 2902 error ("request for member %qD is ambiguous in " 2903 "multiple inheritance lattice", id_expression); 2904 print_candidates (decl); 2905 return error_mark_node; 2906 } 2907 2908 /* Mark variable-like entities as used. Functions are similarly 2909 marked either below or after overload resolution. */ 2910 if (TREE_CODE (decl) == VAR_DECL 2911 || TREE_CODE (decl) == PARM_DECL 2912 || TREE_CODE (decl) == RESULT_DECL) 2913 mark_used (decl); 2914 2915 if (scope) 2916 { 2917 decl = (adjust_result_of_qualified_name_lookup 2918 (decl, scope, current_class_type)); 2919 2920 if (TREE_CODE (decl) == FUNCTION_DECL) 2921 mark_used (decl); 2922 2923 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl)) 2924 decl = finish_qualified_id_expr (scope, 2925 decl, 2926 done, 2927 address_p, 2928 template_p, 2929 template_arg_p); 2930 else 2931 { 2932 tree r = convert_from_reference (decl); 2933 2934 if (processing_template_decl && TYPE_P (scope)) 2935 r = build_qualified_name (TREE_TYPE (r), 2936 scope, decl, 2937 template_p); 2938 decl = r; 2939 } 2940 } 2941 else if (TREE_CODE (decl) == FIELD_DECL) 2942 { 2943 /* Since SCOPE is NULL here, this is an unqualified name. 2944 Access checking has been performed during name lookup 2945 already. Turn off checking to avoid duplicate errors. */ 2946 push_deferring_access_checks (dk_no_check); 2947 /* APPLE LOCAL begin radar 6169580 */ 2948 if (cur_block) 2949 { 2950 tree exp; 2951 tree this_copiedin_var = lookup_name (this_identifier); 2952 gcc_assert (!current_class_ref); 2953 gcc_assert (this_copiedin_var); 2954 exp = build_x_arrow (this_copiedin_var); 2955 decl = build_class_member_access_expr (exp, decl, TREE_TYPE (exp), 2956 /*preserve_reference=*/false); 2957 } 2958 else 2959 decl = finish_non_static_data_member (decl, current_class_ref, 2960 /*qualifying_scope=*/NULL_TREE); 2961 /* APPLE LOCAL end radar 6169580 */ 2962 pop_deferring_access_checks (); 2963 } 2964 else if (is_overloaded_fn (decl)) 2965 { 2966 tree first_fn; 2967 2968 first_fn = decl; 2969 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR) 2970 first_fn = TREE_OPERAND (first_fn, 0); 2971 first_fn = get_first_fn (first_fn); 2972 if (TREE_CODE (first_fn) == TEMPLATE_DECL) 2973 first_fn = DECL_TEMPLATE_RESULT (first_fn); 2974 2975 if (!really_overloaded_fn (decl)) 2976 mark_used (first_fn); 2977 2978 if (!template_arg_p 2979 && TREE_CODE (first_fn) == FUNCTION_DECL 2980 && DECL_FUNCTION_MEMBER_P (first_fn) 2981 && !shared_member_p (decl)) 2982 { 2983 /* A set of member functions. */ 2984 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0); 2985 return finish_class_member_access_expr (decl, id_expression, 2986 /*template_p=*/false); 2987 } 2988 2989 decl = baselink_for_fns (decl); 2990 } 2991 else 2992 { 2993 if (DECL_P (decl) && DECL_NONLOCAL (decl) 2994 && DECL_CLASS_SCOPE_P (decl) 2995 && DECL_CONTEXT (decl) != current_class_type) 2996 { 2997 tree path; 2998 2999 path = currently_open_derived_class (DECL_CONTEXT (decl)); 3000 perform_or_defer_access_check (TYPE_BINFO (path), decl, decl); 3001 } 3002 /* APPLE LOCAL radar 6545782 */ 3003 decl = get_final_block_variable (id_expression, decl); 3004 decl = convert_from_reference (decl); 3005 } 3006 } 3007 3008 if (TREE_DEPRECATED (decl)) 3009 warn_deprecated_use (decl); 3010 3011 /* APPLE LOCAL begin blocks 6040305 (cd) */ 3012 if (TREE_CODE (decl) == VAR_DECL) 3013 { 3014 if (BLOCK_DECL_BYREF (decl)) 3015 { 3016 tree orig_decl = decl; 3017 decl = build_indirect_ref (decl, "unary *"); 3018 if (COPYABLE_BYREF_LOCAL_VAR (orig_decl)) 3019 { 3020 /* What we have is an expression which is of type 3021 struct __Block_byref_X. Must get to the value of the variable 3022 embedded in this structure. It is at: 3023 __Block_byref_X.__forwarding->x */ 3024 decl = build_byref_local_var_access (decl, 3025 DECL_NAME (orig_decl)); 3026 } 3027 } 3028 else 3029 if (COPYABLE_BYREF_LOCAL_VAR (decl)) 3030 decl = build_byref_local_var_access (decl, 3031 DECL_NAME (decl)); 3032 } 3033 /* APPLE LOCAL end blocks 6040305 (cd) */ 3034 3035 return decl; 3036} 3037 3038/* Implement the __typeof keyword: Return the type of EXPR, suitable for 3039 use as a type-specifier. */ 3040 3041tree 3042finish_typeof (tree expr) 3043{ 3044 tree type; 3045 3046 if (type_dependent_expression_p (expr)) 3047 { 3048 type = make_aggr_type (TYPEOF_TYPE); 3049 TYPEOF_TYPE_EXPR (type) = expr; 3050 3051 return type; 3052 } 3053 3054 type = unlowered_expr_type (expr); 3055 3056 if (!type || type == unknown_type_node) 3057 { 3058 error ("type of %qE is unknown", expr); 3059 return error_mark_node; 3060 } 3061 3062 return type; 3063} 3064 3065/* Perform C++-specific checks for __builtin_offsetof before calling 3066 fold_offsetof. */ 3067 3068tree 3069finish_offsetof (tree expr) 3070{ 3071 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR) 3072 { 3073 error ("cannot apply %<offsetof%> to destructor %<~%T%>", 3074 TREE_OPERAND (expr, 2)); 3075 return error_mark_node; 3076 } 3077 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE 3078 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE 3079 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE) 3080 { 3081 if (TREE_CODE (expr) == COMPONENT_REF 3082 || TREE_CODE (expr) == COMPOUND_EXPR) 3083 expr = TREE_OPERAND (expr, 1); 3084 error ("cannot apply %<offsetof%> to member function %qD", expr); 3085 return error_mark_node; 3086 } 3087 return fold_offsetof (expr, NULL_TREE); 3088} 3089 3090/* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs 3091 with equivalent CALL_EXPRs. */ 3092 3093static tree 3094simplify_aggr_init_exprs_r (tree* tp, 3095 int* walk_subtrees, 3096 void* data ATTRIBUTE_UNUSED) 3097{ 3098 /* We don't need to walk into types; there's nothing in a type that 3099 needs simplification. (And, furthermore, there are places we 3100 actively don't want to go. For example, we don't want to wander 3101 into the default arguments for a FUNCTION_DECL that appears in a 3102 CALL_EXPR.) */ 3103 if (TYPE_P (*tp)) 3104 { 3105 *walk_subtrees = 0; 3106 return NULL_TREE; 3107 } 3108 /* Only AGGR_INIT_EXPRs are interesting. */ 3109 else if (TREE_CODE (*tp) != AGGR_INIT_EXPR) 3110 return NULL_TREE; 3111 3112 simplify_aggr_init_expr (tp); 3113 3114 /* Keep iterating. */ 3115 return NULL_TREE; 3116} 3117 3118/* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This 3119 function is broken out from the above for the benefit of the tree-ssa 3120 project. */ 3121 3122void 3123simplify_aggr_init_expr (tree *tp) 3124{ 3125 tree aggr_init_expr = *tp; 3126 3127 /* Form an appropriate CALL_EXPR. */ 3128 tree fn = TREE_OPERAND (aggr_init_expr, 0); 3129 tree args = TREE_OPERAND (aggr_init_expr, 1); 3130 tree slot = TREE_OPERAND (aggr_init_expr, 2); 3131 tree type = TREE_TYPE (slot); 3132 3133 tree call_expr; 3134 enum style_t { ctor, arg, pcc } style; 3135 3136 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr)) 3137 style = ctor; 3138#ifdef PCC_STATIC_STRUCT_RETURN 3139 else if (1) 3140 style = pcc; 3141#endif 3142 else 3143 { 3144 gcc_assert (TREE_ADDRESSABLE (type)); 3145 style = arg; 3146 } 3147 3148 if (style == ctor) 3149 { 3150 /* Replace the first argument to the ctor with the address of the 3151 slot. */ 3152 tree addr; 3153 3154 args = TREE_CHAIN (args); 3155 cxx_mark_addressable (slot); 3156 addr = build1 (ADDR_EXPR, build_pointer_type (type), slot); 3157 args = tree_cons (NULL_TREE, addr, args); 3158 } 3159 3160 call_expr = build3 (CALL_EXPR, 3161 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))), 3162 fn, args, NULL_TREE); 3163 3164 if (style == arg) 3165 { 3166 /* Just mark it addressable here, and leave the rest to 3167 expand_call{,_inline}. */ 3168 cxx_mark_addressable (slot); 3169 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true; 3170 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr); 3171 } 3172 else if (style == pcc) 3173 { 3174 /* If we're using the non-reentrant PCC calling convention, then we 3175 need to copy the returned value out of the static buffer into the 3176 SLOT. */ 3177 push_deferring_access_checks (dk_no_check); 3178 call_expr = build_aggr_init (slot, call_expr, 3179 DIRECT_BIND | LOOKUP_ONLYCONVERTING); 3180 pop_deferring_access_checks (); 3181 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot); 3182 } 3183 3184 *tp = call_expr; 3185} 3186 3187/* Emit all thunks to FN that should be emitted when FN is emitted. */ 3188 3189static void 3190emit_associated_thunks (tree fn) 3191{ 3192 /* When we use vcall offsets, we emit thunks with the virtual 3193 functions to which they thunk. The whole point of vcall offsets 3194 is so that you can know statically the entire set of thunks that 3195 will ever be needed for a given virtual function, thereby 3196 enabling you to output all the thunks with the function itself. */ 3197 if (DECL_VIRTUAL_P (fn)) 3198 { 3199 tree thunk; 3200 3201 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk)) 3202 { 3203 if (!THUNK_ALIAS (thunk)) 3204 { 3205 use_thunk (thunk, /*emit_p=*/1); 3206 if (DECL_RESULT_THUNK_P (thunk)) 3207 { 3208 tree probe; 3209 3210 for (probe = DECL_THUNKS (thunk); 3211 probe; probe = TREE_CHAIN (probe)) 3212 use_thunk (probe, /*emit_p=*/1); 3213 } 3214 } 3215 else 3216 gcc_assert (!DECL_THUNKS (thunk)); 3217 } 3218 } 3219} 3220 3221/* Generate RTL for FN. */ 3222 3223void 3224expand_body (tree fn) 3225{ 3226 tree saved_function; 3227 3228 /* Compute the appropriate object-file linkage for inline 3229 functions. */ 3230 if (DECL_DECLARED_INLINE_P (fn)) 3231 import_export_decl (fn); 3232 3233 /* If FN is external, then there's no point in generating RTL for 3234 it. This situation can arise with an inline function under 3235 `-fexternal-templates'; we instantiate the function, even though 3236 we're not planning on emitting it, in case we get a chance to 3237 inline it. */ 3238 if (DECL_EXTERNAL (fn)) 3239 return; 3240 3241 /* ??? When is this needed? */ 3242 saved_function = current_function_decl; 3243 3244 /* Emit any thunks that should be emitted at the same time as FN. */ 3245 emit_associated_thunks (fn); 3246 3247 /* This function is only called from cgraph, or recursively from 3248 emit_associated_thunks. In neither case should we be currently 3249 generating trees for a function. */ 3250 gcc_assert (function_depth == 0); 3251 3252 tree_rest_of_compilation (fn); 3253 3254 current_function_decl = saved_function; 3255 3256 if (DECL_CLONED_FUNCTION_P (fn)) 3257 { 3258 /* If this is a clone, go through the other clones now and mark 3259 their parameters used. We have to do that here, as we don't 3260 know whether any particular clone will be expanded, and 3261 therefore cannot pick one arbitrarily. */ 3262 tree probe; 3263 3264 for (probe = TREE_CHAIN (DECL_CLONED_FUNCTION (fn)); 3265 probe && DECL_CLONED_FUNCTION_P (probe); 3266 probe = TREE_CHAIN (probe)) 3267 { 3268 tree parms; 3269 3270 for (parms = DECL_ARGUMENTS (probe); 3271 parms; parms = TREE_CHAIN (parms)) 3272 TREE_USED (parms) = 1; 3273 } 3274 } 3275} 3276 3277/* Generate RTL for FN. */ 3278 3279void 3280expand_or_defer_fn (tree fn) 3281{ 3282 /* When the parser calls us after finishing the body of a template 3283 function, we don't really want to expand the body. */ 3284 if (processing_template_decl) 3285 { 3286 /* Normally, collection only occurs in rest_of_compilation. So, 3287 if we don't collect here, we never collect junk generated 3288 during the processing of templates until we hit a 3289 non-template function. It's not safe to do this inside a 3290 nested class, though, as the parser may have local state that 3291 is not a GC root. */ 3292 if (!function_depth) 3293 ggc_collect (); 3294 return; 3295 } 3296 3297 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */ 3298 walk_tree_without_duplicates (&DECL_SAVED_TREE (fn), 3299 simplify_aggr_init_exprs_r, 3300 NULL); 3301 3302 /* If this is a constructor or destructor body, we have to clone 3303 it. */ 3304 if (maybe_clone_body (fn)) 3305 { 3306 /* APPLE LOCAL begin radar 6305545 */ 3307 /* Must lower the nested functions which could be, among other 3308 things, block helper functions. */ 3309 lower_if_nested_functions (fn); 3310 /* APPLE LOCAL end radar 6305545 */ 3311 /* We don't want to process FN again, so pretend we've written 3312 it out, even though we haven't. */ 3313 TREE_ASM_WRITTEN (fn) = 1; 3314 return; 3315 } 3316 3317 /* If this function is marked with the constructor attribute, add it 3318 to the list of functions to be called along with constructors 3319 from static duration objects. */ 3320 if (DECL_STATIC_CONSTRUCTOR (fn)) 3321 static_ctors = tree_cons (NULL_TREE, fn, static_ctors); 3322 3323 /* If this function is marked with the destructor attribute, add it 3324 to the list of functions to be called along with destructors from 3325 static duration objects. */ 3326 if (DECL_STATIC_DESTRUCTOR (fn)) 3327 static_dtors = tree_cons (NULL_TREE, fn, static_dtors); 3328 3329 /* We make a decision about linkage for these functions at the end 3330 of the compilation. Until that point, we do not want the back 3331 end to output them -- but we do want it to see the bodies of 3332 these functions so that it can inline them as appropriate. */ 3333 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn)) 3334 { 3335 if (DECL_INTERFACE_KNOWN (fn)) 3336 /* We've already made a decision as to how this function will 3337 be handled. */; 3338 else if (!at_eof) 3339 { 3340 DECL_EXTERNAL (fn) = 1; 3341 DECL_NOT_REALLY_EXTERN (fn) = 1; 3342 note_vague_linkage_fn (fn); 3343 /* A non-template inline function with external linkage will 3344 always be COMDAT. As we must eventually determine the 3345 linkage of all functions, and as that causes writes to 3346 the data mapped in from the PCH file, it's advantageous 3347 to mark the functions at this point. */ 3348 if (!DECL_IMPLICIT_INSTANTIATION (fn)) 3349 { 3350 /* This function must have external linkage, as 3351 otherwise DECL_INTERFACE_KNOWN would have been 3352 set. */ 3353 gcc_assert (TREE_PUBLIC (fn)); 3354 comdat_linkage (fn); 3355 DECL_INTERFACE_KNOWN (fn) = 1; 3356 } 3357 } 3358 else 3359 import_export_decl (fn); 3360 3361 /* If the user wants us to keep all inline functions, then mark 3362 this function as needed so that finish_file will make sure to 3363 output it later. */ 3364 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn)) 3365 mark_needed (fn); 3366 } 3367 3368 /* There's no reason to do any of the work here if we're only doing 3369 semantic analysis; this code just generates RTL. */ 3370 if (flag_syntax_only) 3371 return; 3372 3373 function_depth++; 3374 3375 /* Expand or defer, at the whim of the compilation unit manager. */ 3376 cgraph_finalize_function (fn, function_depth > 1); 3377 3378 function_depth--; 3379} 3380 3381struct nrv_data 3382{ 3383 tree var; 3384 tree result; 3385 htab_t visited; 3386}; 3387 3388/* Helper function for walk_tree, used by finalize_nrv below. */ 3389 3390static tree 3391finalize_nrv_r (tree* tp, int* walk_subtrees, void* data) 3392{ 3393 struct nrv_data *dp = (struct nrv_data *)data; 3394 void **slot; 3395 3396 /* No need to walk into types. There wouldn't be any need to walk into 3397 non-statements, except that we have to consider STMT_EXPRs. */ 3398 if (TYPE_P (*tp)) 3399 *walk_subtrees = 0; 3400 /* Change all returns to just refer to the RESULT_DECL; this is a nop, 3401 but differs from using NULL_TREE in that it indicates that we care 3402 about the value of the RESULT_DECL. */ 3403 else if (TREE_CODE (*tp) == RETURN_EXPR) 3404 TREE_OPERAND (*tp, 0) = dp->result; 3405 /* Change all cleanups for the NRV to only run when an exception is 3406 thrown. */ 3407 else if (TREE_CODE (*tp) == CLEANUP_STMT 3408 && CLEANUP_DECL (*tp) == dp->var) 3409 CLEANUP_EH_ONLY (*tp) = 1; 3410 /* Replace the DECL_EXPR for the NRV with an initialization of the 3411 RESULT_DECL, if needed. */ 3412 else if (TREE_CODE (*tp) == DECL_EXPR 3413 && DECL_EXPR_DECL (*tp) == dp->var) 3414 { 3415 tree init; 3416 if (DECL_INITIAL (dp->var) 3417 && DECL_INITIAL (dp->var) != error_mark_node) 3418 { 3419 init = build2 (INIT_EXPR, void_type_node, dp->result, 3420 DECL_INITIAL (dp->var)); 3421 DECL_INITIAL (dp->var) = error_mark_node; 3422 } 3423 else 3424 init = build_empty_stmt (); 3425 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp)); 3426 *tp = init; 3427 } 3428 /* And replace all uses of the NRV with the RESULT_DECL. */ 3429 else if (*tp == dp->var) 3430 *tp = dp->result; 3431 3432 /* Avoid walking into the same tree more than once. Unfortunately, we 3433 can't just use walk_tree_without duplicates because it would only call 3434 us for the first occurrence of dp->var in the function body. */ 3435 slot = htab_find_slot (dp->visited, *tp, INSERT); 3436 if (*slot) 3437 *walk_subtrees = 0; 3438 else 3439 *slot = *tp; 3440 3441 /* Keep iterating. */ 3442 return NULL_TREE; 3443} 3444 3445/* Called from finish_function to implement the named return value 3446 optimization by overriding all the RETURN_EXPRs and pertinent 3447 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the 3448 RESULT_DECL for the function. */ 3449 3450void 3451finalize_nrv (tree *tp, tree var, tree result) 3452{ 3453 struct nrv_data data; 3454 3455 /* Copy debugging information from VAR to RESULT. */ 3456 DECL_NAME (result) = DECL_NAME (var); 3457 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var); 3458 DECL_IGNORED_P (result) = DECL_IGNORED_P (var); 3459 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var); 3460 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var); 3461 /* Don't forget that we take its address. */ 3462 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var); 3463 3464 data.var = var; 3465 data.result = result; 3466 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL); 3467 walk_tree (tp, finalize_nrv_r, &data, 0); 3468 htab_delete (data.visited); 3469} 3470 3471/* For all elements of CLAUSES, validate them vs OpenMP constraints. 3472 Remove any elements from the list that are invalid. */ 3473 3474tree 3475finish_omp_clauses (tree clauses) 3476{ 3477 bitmap_head generic_head, firstprivate_head, lastprivate_head; 3478 tree c, t, *pc = &clauses; 3479 const char *name; 3480 3481 bitmap_obstack_initialize (NULL); 3482 bitmap_initialize (&generic_head, &bitmap_default_obstack); 3483 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack); 3484 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack); 3485 3486 for (pc = &clauses, c = clauses; c ; c = *pc) 3487 { 3488 bool remove = false; 3489 3490 switch (OMP_CLAUSE_CODE (c)) 3491 { 3492 case OMP_CLAUSE_SHARED: 3493 name = "shared"; 3494 goto check_dup_generic; 3495 case OMP_CLAUSE_PRIVATE: 3496 name = "private"; 3497 goto check_dup_generic; 3498 case OMP_CLAUSE_REDUCTION: 3499 name = "reduction"; 3500 goto check_dup_generic; 3501 case OMP_CLAUSE_COPYPRIVATE: 3502 name = "copyprivate"; 3503 goto check_dup_generic; 3504 case OMP_CLAUSE_COPYIN: 3505 name = "copyin"; 3506 goto check_dup_generic; 3507 check_dup_generic: 3508 t = OMP_CLAUSE_DECL (c); 3509 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL) 3510 { 3511 if (processing_template_decl) 3512 break; 3513 if (DECL_P (t)) 3514 error ("%qD is not a variable in clause %qs", t, name); 3515 else 3516 error ("%qE is not a variable in clause %qs", t, name); 3517 remove = true; 3518 } 3519 else if (bitmap_bit_p (&generic_head, DECL_UID (t)) 3520 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)) 3521 || bitmap_bit_p (&lastprivate_head, DECL_UID (t))) 3522 { 3523 error ("%qD appears more than once in data clauses", t); 3524 remove = true; 3525 } 3526 else 3527 bitmap_set_bit (&generic_head, DECL_UID (t)); 3528 break; 3529 3530 case OMP_CLAUSE_FIRSTPRIVATE: 3531 t = OMP_CLAUSE_DECL (c); 3532 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL) 3533 { 3534 if (processing_template_decl) 3535 break; 3536 error ("%qE is not a variable in clause %<firstprivate%>", t); 3537 remove = true; 3538 } 3539 else if (bitmap_bit_p (&generic_head, DECL_UID (t)) 3540 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))) 3541 { 3542 error ("%qE appears more than once in data clauses", t); 3543 remove = true; 3544 } 3545 else 3546 bitmap_set_bit (&firstprivate_head, DECL_UID (t)); 3547 break; 3548 3549 case OMP_CLAUSE_LASTPRIVATE: 3550 t = OMP_CLAUSE_DECL (c); 3551 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL) 3552 { 3553 if (processing_template_decl) 3554 break; 3555 error ("%qE is not a variable in clause %<lastprivate%>", t); 3556 remove = true; 3557 } 3558 else if (bitmap_bit_p (&generic_head, DECL_UID (t)) 3559 || bitmap_bit_p (&lastprivate_head, DECL_UID (t))) 3560 { 3561 error ("%qE appears more than once in data clauses", t); 3562 remove = true; 3563 } 3564 else 3565 bitmap_set_bit (&lastprivate_head, DECL_UID (t)); 3566 break; 3567 3568 case OMP_CLAUSE_IF: 3569 t = OMP_CLAUSE_IF_EXPR (c); 3570 t = maybe_convert_cond (t); 3571 if (t == error_mark_node) 3572 remove = true; 3573 OMP_CLAUSE_IF_EXPR (c) = t; 3574 break; 3575 3576 case OMP_CLAUSE_NUM_THREADS: 3577 t = OMP_CLAUSE_NUM_THREADS_EXPR (c); 3578 if (t == error_mark_node) 3579 remove = true; 3580 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t)) 3581 && !type_dependent_expression_p (t)) 3582 { 3583 error ("num_threads expression must be integral"); 3584 remove = true; 3585 } 3586 break; 3587 3588 case OMP_CLAUSE_SCHEDULE: 3589 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c); 3590 if (t == NULL) 3591 ; 3592 else if (t == error_mark_node) 3593 remove = true; 3594 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t)) 3595 && !type_dependent_expression_p (t)) 3596 { 3597 error ("schedule chunk size expression must be integral"); 3598 remove = true; 3599 } 3600 break; 3601 3602 case OMP_CLAUSE_NOWAIT: 3603 case OMP_CLAUSE_ORDERED: 3604 case OMP_CLAUSE_DEFAULT: 3605 break; 3606 3607 default: 3608 gcc_unreachable (); 3609 } 3610 3611 if (remove) 3612 *pc = OMP_CLAUSE_CHAIN (c); 3613 else 3614 pc = &OMP_CLAUSE_CHAIN (c); 3615 } 3616 3617 for (pc = &clauses, c = clauses; c ; c = *pc) 3618 { 3619 enum tree_code c_kind = OMP_CLAUSE_CODE (c); 3620 bool remove = false; 3621 bool need_complete_non_reference = false; 3622 bool need_default_ctor = false; 3623 bool need_copy_ctor = false; 3624 bool need_copy_assignment = false; 3625 bool need_implicitly_determined = false; 3626 tree type, inner_type; 3627 3628 switch (c_kind) 3629 { 3630 case OMP_CLAUSE_SHARED: 3631 name = "shared"; 3632 need_implicitly_determined = true; 3633 break; 3634 case OMP_CLAUSE_PRIVATE: 3635 name = "private"; 3636 need_complete_non_reference = true; 3637 need_default_ctor = true; 3638 need_implicitly_determined = true; 3639 break; 3640 case OMP_CLAUSE_FIRSTPRIVATE: 3641 name = "firstprivate"; 3642 need_complete_non_reference = true; 3643 need_copy_ctor = true; 3644 need_implicitly_determined = true; 3645 break; 3646 case OMP_CLAUSE_LASTPRIVATE: 3647 name = "lastprivate"; 3648 need_complete_non_reference = true; 3649 need_copy_assignment = true; 3650 need_implicitly_determined = true; 3651 break; 3652 case OMP_CLAUSE_REDUCTION: 3653 name = "reduction"; 3654 need_implicitly_determined = true; 3655 break; 3656 case OMP_CLAUSE_COPYPRIVATE: 3657 name = "copyprivate"; 3658 need_copy_assignment = true; 3659 break; 3660 case OMP_CLAUSE_COPYIN: 3661 name = "copyin"; 3662 need_copy_assignment = true; 3663 break; 3664 default: 3665 pc = &OMP_CLAUSE_CHAIN (c); 3666 continue; 3667 } 3668 3669 t = OMP_CLAUSE_DECL (c); 3670 if (processing_template_decl 3671 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL) 3672 { 3673 pc = &OMP_CLAUSE_CHAIN (c); 3674 continue; 3675 } 3676 3677 switch (c_kind) 3678 { 3679 case OMP_CLAUSE_LASTPRIVATE: 3680 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t))) 3681 need_default_ctor = true; 3682 break; 3683 3684 case OMP_CLAUSE_REDUCTION: 3685 if (AGGREGATE_TYPE_P (TREE_TYPE (t)) 3686 || POINTER_TYPE_P (TREE_TYPE (t))) 3687 { 3688 error ("%qE has invalid type for %<reduction%>", t); 3689 remove = true; 3690 } 3691 else if (FLOAT_TYPE_P (TREE_TYPE (t))) 3692 { 3693 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c); 3694 switch (r_code) 3695 { 3696 case PLUS_EXPR: 3697 case MULT_EXPR: 3698 case MINUS_EXPR: 3699 break; 3700 default: 3701 error ("%qE has invalid type for %<reduction(%s)%>", 3702 t, operator_name_info[r_code].name); 3703 remove = true; 3704 } 3705 } 3706 break; 3707 3708 case OMP_CLAUSE_COPYIN: 3709 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t)) 3710 { 3711 error ("%qE must be %<threadprivate%> for %<copyin%>", t); 3712 remove = true; 3713 } 3714 break; 3715 3716 default: 3717 break; 3718 } 3719 3720 if (need_complete_non_reference) 3721 { 3722 t = require_complete_type (t); 3723 if (t == error_mark_node) 3724 remove = true; 3725 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE) 3726 { 3727 error ("%qE has reference type for %qs", t, name); 3728 remove = true; 3729 } 3730 } 3731 if (need_implicitly_determined) 3732 { 3733 const char *share_name = NULL; 3734 3735 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t)) 3736 share_name = "threadprivate"; 3737 else switch (cxx_omp_predetermined_sharing (t)) 3738 { 3739 case OMP_CLAUSE_DEFAULT_UNSPECIFIED: 3740 break; 3741 case OMP_CLAUSE_DEFAULT_SHARED: 3742 share_name = "shared"; 3743 break; 3744 case OMP_CLAUSE_DEFAULT_PRIVATE: 3745 share_name = "private"; 3746 break; 3747 default: 3748 gcc_unreachable (); 3749 } 3750 if (share_name) 3751 { 3752 error ("%qE is predetermined %qs for %qs", 3753 t, share_name, name); 3754 remove = true; 3755 } 3756 } 3757 3758 /* We're interested in the base element, not arrays. */ 3759 inner_type = type = TREE_TYPE (t); 3760 while (TREE_CODE (inner_type) == ARRAY_TYPE) 3761 inner_type = TREE_TYPE (inner_type); 3762 3763 /* Check for special function availability by building a call to one. 3764 Save the results, because later we won't be in the right context 3765 for making these queries. */ 3766 if (CLASS_TYPE_P (inner_type) 3767 && (need_default_ctor || need_copy_ctor || need_copy_assignment) 3768 && !type_dependent_expression_p (t)) 3769 { 3770 int save_errorcount = errorcount; 3771 tree info; 3772 3773 /* Always allocate 3 elements for simplicity. These are the 3774 function decls for the ctor, dtor, and assignment op. 3775 This layout is known to the three lang hooks, 3776 cxx_omp_clause_default_init, cxx_omp_clause_copy_init, 3777 and cxx_omp_clause_assign_op. */ 3778 info = make_tree_vec (3); 3779 CP_OMP_CLAUSE_INFO (c) = info; 3780 3781 if (need_default_ctor 3782 || (need_copy_ctor 3783 && !TYPE_HAS_TRIVIAL_INIT_REF (inner_type))) 3784 { 3785 if (need_default_ctor) 3786 t = NULL; 3787 else 3788 { 3789 t = build_int_cst (build_pointer_type (inner_type), 0); 3790 t = build1 (INDIRECT_REF, inner_type, t); 3791 t = build_tree_list (NULL, t); 3792 } 3793 t = build_special_member_call (NULL_TREE, 3794 complete_ctor_identifier, 3795 t, inner_type, LOOKUP_NORMAL); 3796 t = get_callee_fndecl (t); 3797 TREE_VEC_ELT (info, 0) = t; 3798 } 3799 3800 if ((need_default_ctor || need_copy_ctor) 3801 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_type)) 3802 { 3803 t = build_int_cst (build_pointer_type (inner_type), 0); 3804 t = build1 (INDIRECT_REF, inner_type, t); 3805 t = build_special_member_call (t, complete_dtor_identifier, 3806 NULL, inner_type, LOOKUP_NORMAL); 3807 t = get_callee_fndecl (t); 3808 TREE_VEC_ELT (info, 1) = t; 3809 } 3810 3811 if (need_copy_assignment 3812 && !TYPE_HAS_TRIVIAL_ASSIGN_REF (inner_type)) 3813 { 3814 t = build_int_cst (build_pointer_type (inner_type), 0); 3815 t = build1 (INDIRECT_REF, inner_type, t); 3816 t = build_special_member_call (t, ansi_assopname (NOP_EXPR), 3817 build_tree_list (NULL, t), 3818 inner_type, LOOKUP_NORMAL); 3819 3820 /* We'll have called convert_from_reference on the call, which 3821 may well have added an indirect_ref. It's unneeded here, 3822 and in the way, so kill it. */ 3823 if (TREE_CODE (t) == INDIRECT_REF) 3824 t = TREE_OPERAND (t, 0); 3825 3826 t = get_callee_fndecl (t); 3827 TREE_VEC_ELT (info, 2) = t; 3828 } 3829 3830 if (errorcount != save_errorcount) 3831 remove = true; 3832 } 3833 3834 if (remove) 3835 *pc = OMP_CLAUSE_CHAIN (c); 3836 else 3837 pc = &OMP_CLAUSE_CHAIN (c); 3838 } 3839 3840 bitmap_obstack_release (NULL); 3841 return clauses; 3842} 3843 3844/* For all variables in the tree_list VARS, mark them as thread local. */ 3845 3846void 3847finish_omp_threadprivate (tree vars) 3848{ 3849 tree t; 3850 3851 /* Mark every variable in VARS to be assigned thread local storage. */ 3852 for (t = vars; t; t = TREE_CHAIN (t)) 3853 { 3854 tree v = TREE_PURPOSE (t); 3855 3856 /* If V had already been marked threadprivate, it doesn't matter 3857 whether it had been used prior to this point. */ 3858 if (TREE_USED (v) 3859 && (DECL_LANG_SPECIFIC (v) == NULL 3860 || !CP_DECL_THREADPRIVATE_P (v))) 3861 error ("%qE declared %<threadprivate%> after first use", v); 3862 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v)) 3863 error ("automatic variable %qE cannot be %<threadprivate%>", v); 3864 else if (! COMPLETE_TYPE_P (TREE_TYPE (v))) 3865 error ("%<threadprivate%> %qE has incomplete type", v); 3866 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))) 3867 error ("%<threadprivate%> %qE is not file, namespace " 3868 "or block scope variable", v); 3869 else 3870 { 3871 /* Allocate a LANG_SPECIFIC structure for V, if needed. */ 3872 if (DECL_LANG_SPECIFIC (v) == NULL) 3873 { 3874 retrofit_lang_decl (v); 3875 3876 /* Make sure that DECL_DISCRIMINATOR_P continues to be true 3877 after the allocation of the lang_decl structure. */ 3878 if (DECL_DISCRIMINATOR_P (v)) 3879 DECL_LANG_SPECIFIC (v)->decl_flags.u2sel = 1; 3880 } 3881 3882 if (! DECL_THREAD_LOCAL_P (v)) 3883 { 3884 DECL_TLS_MODEL (v) = decl_default_tls_model (v); 3885 /* If rtl has been already set for this var, call 3886 make_decl_rtl once again, so that encode_section_info 3887 has a chance to look at the new decl flags. */ 3888 if (DECL_RTL_SET_P (v)) 3889 make_decl_rtl (v); 3890 } 3891 CP_DECL_THREADPRIVATE_P (v) = 1; 3892 } 3893 } 3894} 3895 3896/* Build an OpenMP structured block. */ 3897 3898tree 3899begin_omp_structured_block (void) 3900{ 3901 return do_pushlevel (sk_omp); 3902} 3903 3904tree 3905finish_omp_structured_block (tree block) 3906{ 3907 return do_poplevel (block); 3908} 3909 3910/* Similarly, except force the retention of the BLOCK. */ 3911 3912tree 3913begin_omp_parallel (void) 3914{ 3915 keep_next_level (true); 3916 return begin_omp_structured_block (); 3917} 3918 3919tree 3920finish_omp_parallel (tree clauses, tree body) 3921{ 3922 tree stmt; 3923 3924 body = finish_omp_structured_block (body); 3925 3926 stmt = make_node (OMP_PARALLEL); 3927 TREE_TYPE (stmt) = void_type_node; 3928 OMP_PARALLEL_CLAUSES (stmt) = clauses; 3929 OMP_PARALLEL_BODY (stmt) = body; 3930 3931 return add_stmt (stmt); 3932} 3933 3934/* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR 3935 are directly for their associated operands in the statement. DECL 3936 and INIT are a combo; if DECL is NULL then INIT ought to be a 3937 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are 3938 optional statements that need to go before the loop into its 3939 sk_omp scope. */ 3940 3941tree 3942finish_omp_for (location_t locus, tree decl, tree init, tree cond, 3943 tree incr, tree body, tree pre_body) 3944{ 3945 if (decl == NULL) 3946 { 3947 if (init != NULL) 3948 switch (TREE_CODE (init)) 3949 { 3950 case MODIFY_EXPR: 3951 decl = TREE_OPERAND (init, 0); 3952 init = TREE_OPERAND (init, 1); 3953 break; 3954 case MODOP_EXPR: 3955 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR) 3956 { 3957 decl = TREE_OPERAND (init, 0); 3958 init = TREE_OPERAND (init, 2); 3959 } 3960 break; 3961 default: 3962 break; 3963 } 3964 3965 if (decl == NULL) 3966 { 3967 error ("expected iteration declaration or initialization"); 3968 return NULL; 3969 } 3970 } 3971 3972 if (type_dependent_expression_p (decl) 3973 || type_dependent_expression_p (init) 3974 || (cond && type_dependent_expression_p (cond)) 3975 || (incr && type_dependent_expression_p (incr))) 3976 { 3977 tree stmt; 3978 3979 if (cond == NULL) 3980 { 3981 error ("%Hmissing controlling predicate", &locus); 3982 return NULL; 3983 } 3984 3985 if (incr == NULL) 3986 { 3987 error ("%Hmissing increment expression", &locus); 3988 return NULL; 3989 } 3990 3991 stmt = make_node (OMP_FOR); 3992 3993 /* This is really just a place-holder. We'll be decomposing this 3994 again and going through the build_modify_expr path below when 3995 we instantiate the thing. */ 3996 init = build2 (MODIFY_EXPR, void_type_node, decl, init); 3997 3998 TREE_TYPE (stmt) = void_type_node; 3999 OMP_FOR_INIT (stmt) = init; 4000 OMP_FOR_COND (stmt) = cond; 4001 OMP_FOR_INCR (stmt) = incr; 4002 OMP_FOR_BODY (stmt) = body; 4003 OMP_FOR_PRE_BODY (stmt) = pre_body; 4004 4005 SET_EXPR_LOCATION (stmt, locus); 4006 return add_stmt (stmt); 4007 } 4008 4009 if (!DECL_P (decl)) 4010 { 4011 error ("expected iteration declaration or initialization"); 4012 return NULL; 4013 } 4014 4015 if (pre_body == NULL || IS_EMPTY_STMT (pre_body)) 4016 pre_body = NULL; 4017 else if (! processing_template_decl) 4018 { 4019 add_stmt (pre_body); 4020 pre_body = NULL; 4021 } 4022 init = build_modify_expr (decl, NOP_EXPR, init); 4023 return c_finish_omp_for (locus, decl, init, cond, incr, body, pre_body); 4024} 4025 4026void 4027finish_omp_atomic (enum tree_code code, tree lhs, tree rhs) 4028{ 4029 tree orig_lhs; 4030 tree orig_rhs; 4031 bool dependent_p; 4032 tree stmt; 4033 4034 orig_lhs = lhs; 4035 orig_rhs = rhs; 4036 dependent_p = false; 4037 stmt = NULL_TREE; 4038 4039 /* Even in a template, we can detect invalid uses of the atomic 4040 pragma if neither LHS nor RHS is type-dependent. */ 4041 if (processing_template_decl) 4042 { 4043 dependent_p = (type_dependent_expression_p (lhs) 4044 || type_dependent_expression_p (rhs)); 4045 if (!dependent_p) 4046 { 4047 lhs = build_non_dependent_expr (lhs); 4048 rhs = build_non_dependent_expr (rhs); 4049 } 4050 } 4051 if (!dependent_p) 4052 { 4053 stmt = c_finish_omp_atomic (code, lhs, rhs); 4054 if (stmt == error_mark_node) 4055 return; 4056 } 4057 if (processing_template_decl) 4058 { 4059 stmt = build2 (OMP_ATOMIC, void_type_node, orig_lhs, orig_rhs); 4060 OMP_ATOMIC_DEPENDENT_P (stmt) = 1; 4061 OMP_ATOMIC_CODE (stmt) = code; 4062 } 4063 add_stmt (stmt); 4064} 4065 4066void 4067finish_omp_barrier (void) 4068{ 4069 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER]; 4070 tree stmt = finish_call_expr (fn, NULL, false, false); 4071 finish_expr_stmt (stmt); 4072} 4073 4074void 4075finish_omp_flush (void) 4076{ 4077 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE]; 4078 tree stmt = finish_call_expr (fn, NULL, false, false); 4079 finish_expr_stmt (stmt); 4080} 4081 4082/* True if OpenMP sharing attribute of DECL is predetermined. */ 4083 4084enum omp_clause_default_kind 4085cxx_omp_predetermined_sharing (tree decl) 4086{ 4087 enum omp_clause_default_kind kind; 4088 4089 kind = c_omp_predetermined_sharing (decl); 4090 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED) 4091 return kind; 4092 4093 /* Static data members are predetermined as shared. */ 4094 if (TREE_STATIC (decl)) 4095 { 4096 tree ctx = CP_DECL_CONTEXT (decl); 4097 if (TYPE_P (ctx) && IS_AGGR_TYPE (ctx)) 4098 return OMP_CLAUSE_DEFAULT_SHARED; 4099 } 4100 4101 return OMP_CLAUSE_DEFAULT_UNSPECIFIED; 4102} 4103 4104/* APPLE LOCAL begin blocks 6040305 (ch) */ 4105tree 4106begin_block (void) 4107{ 4108 struct block_sema_info *csi; 4109 tree block; 4110 /* push_scope (); */ 4111 current_stmt_tree ()->stmts_are_full_exprs_p = 1; 4112#if 0 4113 block = do_pushlevel (sk_block); 4114#else 4115 block = NULL_TREE; 4116#endif 4117 csi = (struct block_sema_info*)xcalloc (1, sizeof (struct block_sema_info)); 4118 csi->prev_block_info = cur_block; 4119 cur_block = csi; 4120 return block; 4121} 4122 4123struct block_sema_info * 4124finish_block (tree block) 4125{ 4126 struct block_sema_info *csi = cur_block; 4127 cur_block = cur_block->prev_block_info; 4128 /* pop_scope (); */ 4129#if 0 4130 if (block) 4131 do_poplevel (block); 4132#else 4133 block = 0; 4134#endif 4135 return csi; 4136} 4137/* APPLE LOCAL end blocks 6040305 (ch) */ 4138 4139 4140void 4141init_cp_semantics (void) 4142{ 4143} 4144 4145#include "gt-cp-semantics.h" 4146