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 else 1947 { 1948 if (current_function_decl) 1949 error ("invalid use of %<this%> in non-member function"); 1950 else 1951 error ("invalid use of %<this%> at top level"); 1952 result = error_mark_node; 1953 } 1954 1955 return result; 1956} 1957 1958/* Finish a pseudo-destructor expression. If SCOPE is NULL, the 1959 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is 1960 the TYPE for the type given. If SCOPE is non-NULL, the expression 1961 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */ 1962 1963tree 1964finish_pseudo_destructor_expr (tree object, tree scope, tree destructor) 1965{ 1966 if (destructor == error_mark_node) 1967 return error_mark_node; 1968 1969 gcc_assert (TYPE_P (destructor)); 1970 1971 if (!processing_template_decl) 1972 { 1973 if (scope == error_mark_node) 1974 { 1975 error ("invalid qualifying scope in pseudo-destructor name"); 1976 return error_mark_node; 1977 } 1978 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor)) 1979 { 1980 error ("qualified type %qT does not match destructor name ~%qT", 1981 scope, destructor); 1982 return error_mark_node; 1983 } 1984 1985 1986 /* [expr.pseudo] says both: 1987 1988 The type designated by the pseudo-destructor-name shall be 1989 the same as the object type. 1990 1991 and: 1992 1993 The cv-unqualified versions of the object type and of the 1994 type designated by the pseudo-destructor-name shall be the 1995 same type. 1996 1997 We implement the more generous second sentence, since that is 1998 what most other compilers do. */ 1999 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object), 2000 destructor)) 2001 { 2002 error ("%qE is not of type %qT", object, destructor); 2003 return error_mark_node; 2004 } 2005 } 2006 2007 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor); 2008} 2009 2010/* Finish an expression of the form CODE EXPR. */ 2011 2012tree 2013finish_unary_op_expr (enum tree_code code, tree expr) 2014{ 2015 tree result = build_x_unary_op (code, expr); 2016 /* Inside a template, build_x_unary_op does not fold the 2017 expression. So check whether the result is folded before 2018 setting TREE_NEGATED_INT. */ 2019 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST 2020 && TREE_CODE (result) == INTEGER_CST 2021 && !TYPE_UNSIGNED (TREE_TYPE (result)) 2022 && INT_CST_LT (result, integer_zero_node)) 2023 { 2024 /* RESULT may be a cached INTEGER_CST, so we must copy it before 2025 setting TREE_NEGATED_INT. */ 2026 result = copy_node (result); 2027 TREE_NEGATED_INT (result) = 1; 2028 } 2029 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr)) 2030 overflow_warning (result); 2031 2032 return result; 2033} 2034 2035/* Finish a compound-literal expression. TYPE is the type to which 2036 the INITIALIZER_LIST is being cast. */ 2037 2038tree 2039finish_compound_literal (tree type, VEC(constructor_elt,gc) *initializer_list) 2040{ 2041 tree var; 2042 tree compound_literal; 2043 2044 if (!TYPE_OBJ_P (type)) 2045 { 2046 error ("compound literal of non-object type %qT", type); 2047 return error_mark_node; 2048 } 2049 2050 /* Build a CONSTRUCTOR for the INITIALIZER_LIST. */ 2051 compound_literal = build_constructor (NULL_TREE, initializer_list); 2052 if (processing_template_decl) 2053 { 2054 TREE_TYPE (compound_literal) = type; 2055 /* Mark the expression as a compound literal. */ 2056 TREE_HAS_CONSTRUCTOR (compound_literal) = 1; 2057 return compound_literal; 2058 } 2059 2060 /* Create a temporary variable to represent the compound literal. */ 2061 var = create_temporary_var (type); 2062 if (!current_function_decl) 2063 { 2064 /* If this compound-literal appears outside of a function, then 2065 the corresponding variable has static storage duration, just 2066 like the variable in whose initializer it appears. */ 2067 TREE_STATIC (var) = 1; 2068 /* The variable has internal linkage, since there is no need to 2069 reference it from another translation unit. */ 2070 TREE_PUBLIC (var) = 0; 2071 /* It must have a name, so that the name mangler can mangle it. */ 2072 DECL_NAME (var) = make_anon_name (); 2073 } 2074 /* We must call pushdecl, since the gimplifier complains if the 2075 variable has not been declared via a BIND_EXPR. */ 2076 pushdecl (var); 2077 /* Initialize the variable as we would any other variable with a 2078 brace-enclosed initializer. */ 2079 cp_finish_decl (var, compound_literal, 2080 /*init_const_expr_p=*/false, 2081 /*asmspec_tree=*/NULL_TREE, 2082 LOOKUP_ONLYCONVERTING); 2083 return var; 2084} 2085 2086/* Return the declaration for the function-name variable indicated by 2087 ID. */ 2088 2089tree 2090finish_fname (tree id) 2091{ 2092 tree decl; 2093 2094 decl = fname_decl (C_RID_CODE (id), id); 2095 if (processing_template_decl) 2096 decl = DECL_NAME (decl); 2097 return decl; 2098} 2099 2100/* Finish a translation unit. */ 2101 2102void 2103finish_translation_unit (void) 2104{ 2105 /* In case there were missing closebraces, 2106 get us back to the global binding level. */ 2107 pop_everything (); 2108 while (current_namespace != global_namespace) 2109 pop_namespace (); 2110 2111 /* Do file scope __FUNCTION__ et al. */ 2112 finish_fname_decls (); 2113} 2114 2115/* Finish a template type parameter, specified as AGGR IDENTIFIER. 2116 Returns the parameter. */ 2117 2118tree 2119finish_template_type_parm (tree aggr, tree identifier) 2120{ 2121 if (aggr != class_type_node) 2122 { 2123 pedwarn ("template type parameters must use the keyword %<class%> or %<typename%>"); 2124 aggr = class_type_node; 2125 } 2126 2127 return build_tree_list (aggr, identifier); 2128} 2129 2130/* Finish a template template parameter, specified as AGGR IDENTIFIER. 2131 Returns the parameter. */ 2132 2133tree 2134finish_template_template_parm (tree aggr, tree identifier) 2135{ 2136 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE); 2137 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE); 2138 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms; 2139 DECL_TEMPLATE_RESULT (tmpl) = decl; 2140 DECL_ARTIFICIAL (decl) = 1; 2141 end_template_decl (); 2142 2143 gcc_assert (DECL_TEMPLATE_PARMS (tmpl)); 2144 2145 return finish_template_type_parm (aggr, tmpl); 2146} 2147 2148/* ARGUMENT is the default-argument value for a template template 2149 parameter. If ARGUMENT is invalid, issue error messages and return 2150 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */ 2151 2152tree 2153check_template_template_default_arg (tree argument) 2154{ 2155 if (TREE_CODE (argument) != TEMPLATE_DECL 2156 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM 2157 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE) 2158 { 2159 if (TREE_CODE (argument) == TYPE_DECL) 2160 error ("invalid use of type %qT as a default value for a template " 2161 "template-parameter", TREE_TYPE (argument)); 2162 else 2163 error ("invalid default argument for a template template parameter"); 2164 return error_mark_node; 2165 } 2166 2167 return argument; 2168} 2169 2170/* Begin a class definition, as indicated by T. */ 2171 2172tree 2173begin_class_definition (tree t, tree attributes) 2174{ 2175 if (t == error_mark_node) 2176 return error_mark_node; 2177 2178 if (processing_template_parmlist) 2179 { 2180 error ("definition of %q#T inside template parameter list", t); 2181 return error_mark_node; 2182 } 2183 /* A non-implicit typename comes from code like: 2184 2185 template <typename T> struct A { 2186 template <typename U> struct A<T>::B ... 2187 2188 This is erroneous. */ 2189 else if (TREE_CODE (t) == TYPENAME_TYPE) 2190 { 2191 error ("invalid definition of qualified type %qT", t); 2192 t = error_mark_node; 2193 } 2194 2195 if (t == error_mark_node || ! IS_AGGR_TYPE (t)) 2196 { 2197 t = make_aggr_type (RECORD_TYPE); 2198 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current); 2199 } 2200 2201 /* Update the location of the decl. */ 2202 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location; 2203 2204 if (TYPE_BEING_DEFINED (t)) 2205 { 2206 t = make_aggr_type (TREE_CODE (t)); 2207 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current); 2208 } 2209 maybe_process_partial_specialization (t); 2210 pushclass (t); 2211 TYPE_BEING_DEFINED (t) = 1; 2212 2213 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE); 2214 2215 if (flag_pack_struct) 2216 { 2217 tree v; 2218 TYPE_PACKED (t) = 1; 2219 /* Even though the type is being defined for the first time 2220 here, there might have been a forward declaration, so there 2221 might be cv-qualified variants of T. */ 2222 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v)) 2223 TYPE_PACKED (v) = 1; 2224 } 2225 /* Reset the interface data, at the earliest possible 2226 moment, as it might have been set via a class foo; 2227 before. */ 2228 if (! TYPE_ANONYMOUS_P (t)) 2229 { 2230 struct c_fileinfo *finfo = get_fileinfo (input_filename); 2231 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only; 2232 SET_CLASSTYPE_INTERFACE_UNKNOWN_X 2233 (t, finfo->interface_unknown); 2234 } 2235 reset_specialization(); 2236 2237 /* Make a declaration for this class in its own scope. */ 2238 build_self_reference (); 2239 2240 return t; 2241} 2242 2243/* Finish the member declaration given by DECL. */ 2244 2245void 2246finish_member_declaration (tree decl) 2247{ 2248 if (decl == error_mark_node || decl == NULL_TREE) 2249 return; 2250 2251 if (decl == void_type_node) 2252 /* The COMPONENT was a friend, not a member, and so there's 2253 nothing for us to do. */ 2254 return; 2255 2256 /* We should see only one DECL at a time. */ 2257 gcc_assert (TREE_CHAIN (decl) == NULL_TREE); 2258 2259 /* Set up access control for DECL. */ 2260 TREE_PRIVATE (decl) 2261 = (current_access_specifier == access_private_node); 2262 TREE_PROTECTED (decl) 2263 = (current_access_specifier == access_protected_node); 2264 if (TREE_CODE (decl) == TEMPLATE_DECL) 2265 { 2266 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl); 2267 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl); 2268 } 2269 2270 /* Mark the DECL as a member of the current class. */ 2271 DECL_CONTEXT (decl) = current_class_type; 2272 2273 /* [dcl.link] 2274 2275 A C language linkage is ignored for the names of class members 2276 and the member function type of class member functions. */ 2277 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c) 2278 SET_DECL_LANGUAGE (decl, lang_cplusplus); 2279 2280 /* Put functions on the TYPE_METHODS list and everything else on the 2281 TYPE_FIELDS list. Note that these are built up in reverse order. 2282 We reverse them (to obtain declaration order) in finish_struct. */ 2283 if (TREE_CODE (decl) == FUNCTION_DECL 2284 || DECL_FUNCTION_TEMPLATE_P (decl)) 2285 { 2286 /* We also need to add this function to the 2287 CLASSTYPE_METHOD_VEC. */ 2288 if (add_method (current_class_type, decl, NULL_TREE)) 2289 { 2290 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type); 2291 TYPE_METHODS (current_class_type) = decl; 2292 2293 maybe_add_class_template_decl_list (current_class_type, decl, 2294 /*friend_p=*/0); 2295 } 2296 } 2297 /* Enter the DECL into the scope of the class. */ 2298 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl)) 2299 || pushdecl_class_level (decl)) 2300 { 2301 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields 2302 go at the beginning. The reason is that lookup_field_1 2303 searches the list in order, and we want a field name to 2304 override a type name so that the "struct stat hack" will 2305 work. In particular: 2306 2307 struct S { enum E { }; int E } s; 2308 s.E = 3; 2309 2310 is valid. In addition, the FIELD_DECLs must be maintained in 2311 declaration order so that class layout works as expected. 2312 However, we don't need that order until class layout, so we 2313 save a little time by putting FIELD_DECLs on in reverse order 2314 here, and then reversing them in finish_struct_1. (We could 2315 also keep a pointer to the correct insertion points in the 2316 list.) */ 2317 2318 if (TREE_CODE (decl) == TYPE_DECL) 2319 TYPE_FIELDS (current_class_type) 2320 = chainon (TYPE_FIELDS (current_class_type), decl); 2321 else 2322 { 2323 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type); 2324 TYPE_FIELDS (current_class_type) = decl; 2325 } 2326 2327 maybe_add_class_template_decl_list (current_class_type, decl, 2328 /*friend_p=*/0); 2329 } 2330 2331 if (pch_file) 2332 note_decl_for_pch (decl); 2333} 2334 2335/* DECL has been declared while we are building a PCH file. Perform 2336 actions that we might normally undertake lazily, but which can be 2337 performed now so that they do not have to be performed in 2338 translation units which include the PCH file. */ 2339 2340void 2341note_decl_for_pch (tree decl) 2342{ 2343 gcc_assert (pch_file); 2344 2345 /* There's a good chance that we'll have to mangle names at some 2346 point, even if only for emission in debugging information. */ 2347 if ((TREE_CODE (decl) == VAR_DECL 2348 || TREE_CODE (decl) == FUNCTION_DECL) 2349 && !processing_template_decl) 2350 mangle_decl (decl); 2351} 2352 2353/* Finish processing a complete template declaration. The PARMS are 2354 the template parameters. */ 2355 2356void 2357finish_template_decl (tree parms) 2358{ 2359 if (parms) 2360 end_template_decl (); 2361 else 2362 end_specialization (); 2363} 2364 2365/* Finish processing a template-id (which names a type) of the form 2366 NAME < ARGS >. Return the TYPE_DECL for the type named by the 2367 template-id. If ENTERING_SCOPE is nonzero we are about to enter 2368 the scope of template-id indicated. */ 2369 2370tree 2371finish_template_type (tree name, tree args, int entering_scope) 2372{ 2373 tree decl; 2374 2375 decl = lookup_template_class (name, args, 2376 NULL_TREE, NULL_TREE, entering_scope, 2377 tf_warning_or_error | tf_user); 2378 if (decl != error_mark_node) 2379 decl = TYPE_STUB_DECL (decl); 2380 2381 return decl; 2382} 2383 2384/* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER. 2385 Return a TREE_LIST containing the ACCESS_SPECIFIER and the 2386 BASE_CLASS, or NULL_TREE if an error occurred. The 2387 ACCESS_SPECIFIER is one of 2388 access_{default,public,protected_private}_node. For a virtual base 2389 we set TREE_TYPE. */ 2390 2391tree 2392finish_base_specifier (tree base, tree access, bool virtual_p) 2393{ 2394 tree result; 2395 2396 if (base == error_mark_node) 2397 { 2398 error ("invalid base-class specification"); 2399 result = NULL_TREE; 2400 } 2401 else if (! is_aggr_type (base, 1)) 2402 result = NULL_TREE; 2403 else 2404 { 2405 if (cp_type_quals (base) != 0) 2406 { 2407 error ("base class %qT has cv qualifiers", base); 2408 base = TYPE_MAIN_VARIANT (base); 2409 } 2410 result = build_tree_list (access, base); 2411 if (virtual_p) 2412 TREE_TYPE (result) = integer_type_node; 2413 } 2414 2415 return result; 2416} 2417 2418/* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is 2419 what we found when we tried to do the lookup. */ 2420 2421void 2422qualified_name_lookup_error (tree scope, tree name, tree decl) 2423{ 2424 if (scope == error_mark_node) 2425 ; /* We already complained. */ 2426 else if (TYPE_P (scope)) 2427 { 2428 if (!COMPLETE_TYPE_P (scope)) 2429 error ("incomplete type %qT used in nested name specifier", scope); 2430 else if (TREE_CODE (decl) == TREE_LIST) 2431 { 2432 error ("reference to %<%T::%D%> is ambiguous", scope, name); 2433 print_candidates (decl); 2434 } 2435 else 2436 error ("%qD is not a member of %qT", name, scope); 2437 } 2438 else if (scope != global_namespace) 2439 error ("%qD is not a member of %qD", name, scope); 2440 else 2441 error ("%<::%D%> has not been declared", name); 2442} 2443 2444/* If FNS is a member function, a set of member functions, or a 2445 template-id referring to one or more member functions, return a 2446 BASELINK for FNS, incorporating the current access context. 2447 Otherwise, return FNS unchanged. */ 2448 2449tree 2450baselink_for_fns (tree fns) 2451{ 2452 tree fn; 2453 tree cl; 2454 2455 if (BASELINK_P (fns) 2456 || error_operand_p (fns)) 2457 return fns; 2458 2459 fn = fns; 2460 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR) 2461 fn = TREE_OPERAND (fn, 0); 2462 fn = get_first_fn (fn); 2463 if (!DECL_FUNCTION_MEMBER_P (fn)) 2464 return fns; 2465 2466 cl = currently_open_derived_class (DECL_CONTEXT (fn)); 2467 if (!cl) 2468 cl = DECL_CONTEXT (fn); 2469 cl = TYPE_BINFO (cl); 2470 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE); 2471} 2472 2473/* ID_EXPRESSION is a representation of parsed, but unprocessed, 2474 id-expression. (See cp_parser_id_expression for details.) SCOPE, 2475 if non-NULL, is the type or namespace used to explicitly qualify 2476 ID_EXPRESSION. DECL is the entity to which that name has been 2477 resolved. 2478 2479 *CONSTANT_EXPRESSION_P is true if we are presently parsing a 2480 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will 2481 be set to true if this expression isn't permitted in a 2482 constant-expression, but it is otherwise not set by this function. 2483 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a 2484 constant-expression, but a non-constant expression is also 2485 permissible. 2486 2487 DONE is true if this expression is a complete postfix-expression; 2488 it is false if this expression is followed by '->', '[', '(', etc. 2489 ADDRESS_P is true iff this expression is the operand of '&'. 2490 TEMPLATE_P is true iff the qualified-id was of the form 2491 "A::template B". TEMPLATE_ARG_P is true iff this qualified name 2492 appears as a template argument. 2493 2494 If an error occurs, and it is the kind of error that might cause 2495 the parser to abort a tentative parse, *ERROR_MSG is filled in. It 2496 is the caller's responsibility to issue the message. *ERROR_MSG 2497 will be a string with static storage duration, so the caller need 2498 not "free" it. 2499 2500 Return an expression for the entity, after issuing appropriate 2501 diagnostics. This function is also responsible for transforming a 2502 reference to a non-static member into a COMPONENT_REF that makes 2503 the use of "this" explicit. 2504 2505 Upon return, *IDK will be filled in appropriately. */ 2506 2507tree 2508finish_id_expression (tree id_expression, 2509 tree decl, 2510 tree scope, 2511 cp_id_kind *idk, 2512 bool integral_constant_expression_p, 2513 bool allow_non_integral_constant_expression_p, 2514 bool *non_integral_constant_expression_p, 2515 bool template_p, 2516 bool done, 2517 bool address_p, 2518 bool template_arg_p, 2519 const char **error_msg) 2520{ 2521 /* Initialize the output parameters. */ 2522 *idk = CP_ID_KIND_NONE; 2523 *error_msg = NULL; 2524 2525 if (id_expression == error_mark_node) 2526 return error_mark_node; 2527 /* If we have a template-id, then no further lookup is 2528 required. If the template-id was for a template-class, we 2529 will sometimes have a TYPE_DECL at this point. */ 2530 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR 2531 || TREE_CODE (decl) == TYPE_DECL) 2532 ; 2533 /* Look up the name. */ 2534 else 2535 { 2536 if (decl == error_mark_node) 2537 { 2538 /* Name lookup failed. */ 2539 if (scope 2540 && (!TYPE_P (scope) 2541 || (!dependent_type_p (scope) 2542 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE 2543 && IDENTIFIER_TYPENAME_P (id_expression) 2544 && dependent_type_p (TREE_TYPE (id_expression)))))) 2545 { 2546 /* If the qualifying type is non-dependent (and the name 2547 does not name a conversion operator to a dependent 2548 type), issue an error. */ 2549 qualified_name_lookup_error (scope, id_expression, decl); 2550 return error_mark_node; 2551 } 2552 else if (!scope) 2553 { 2554 /* It may be resolved via Koenig lookup. */ 2555 *idk = CP_ID_KIND_UNQUALIFIED; 2556 return id_expression; 2557 } 2558 else 2559 decl = id_expression; 2560 } 2561 /* If DECL is a variable that would be out of scope under 2562 ANSI/ISO rules, but in scope in the ARM, name lookup 2563 will succeed. Issue a diagnostic here. */ 2564 else 2565 decl = check_for_out_of_scope_variable (decl); 2566 2567 /* Remember that the name was used in the definition of 2568 the current class so that we can check later to see if 2569 the meaning would have been different after the class 2570 was entirely defined. */ 2571 if (!scope && decl != error_mark_node) 2572 maybe_note_name_used_in_class (id_expression, decl); 2573 2574 /* Disallow uses of local variables from containing functions. */ 2575 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL) 2576 { 2577 tree context = decl_function_context (decl); 2578 if (context != NULL_TREE && context != current_function_decl 2579 && ! TREE_STATIC (decl)) 2580 { 2581 error (TREE_CODE (decl) == VAR_DECL 2582 ? "use of %<auto%> variable from containing function" 2583 : "use of parameter from containing function"); 2584 error (" %q+#D declared here", decl); 2585 return error_mark_node; 2586 } 2587 } 2588 } 2589 2590 /* If we didn't find anything, or what we found was a type, 2591 then this wasn't really an id-expression. */ 2592 if (TREE_CODE (decl) == TEMPLATE_DECL 2593 && !DECL_FUNCTION_TEMPLATE_P (decl)) 2594 { 2595 *error_msg = "missing template arguments"; 2596 return error_mark_node; 2597 } 2598 else if (TREE_CODE (decl) == TYPE_DECL 2599 || TREE_CODE (decl) == NAMESPACE_DECL) 2600 { 2601 *error_msg = "expected primary-expression"; 2602 return error_mark_node; 2603 } 2604 2605 /* If the name resolved to a template parameter, there is no 2606 need to look it up again later. */ 2607 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl)) 2608 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX) 2609 { 2610 tree r; 2611 2612 *idk = CP_ID_KIND_NONE; 2613 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX) 2614 decl = TEMPLATE_PARM_DECL (decl); 2615 r = convert_from_reference (DECL_INITIAL (decl)); 2616 2617 if (integral_constant_expression_p 2618 && !dependent_type_p (TREE_TYPE (decl)) 2619 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r)))) 2620 { 2621 if (!allow_non_integral_constant_expression_p) 2622 error ("template parameter %qD of type %qT is not allowed in " 2623 "an integral constant expression because it is not of " 2624 "integral or enumeration type", decl, TREE_TYPE (decl)); 2625 *non_integral_constant_expression_p = true; 2626 } 2627 return r; 2628 } 2629 /* Similarly, we resolve enumeration constants to their 2630 underlying values. */ 2631 else if (TREE_CODE (decl) == CONST_DECL) 2632 { 2633 *idk = CP_ID_KIND_NONE; 2634 if (!processing_template_decl) 2635 { 2636 used_types_insert (TREE_TYPE (decl)); 2637 return DECL_INITIAL (decl); 2638 } 2639 return decl; 2640 } 2641 else 2642 { 2643 bool dependent_p; 2644 2645 /* If the declaration was explicitly qualified indicate 2646 that. The semantics of `A::f(3)' are different than 2647 `f(3)' if `f' is virtual. */ 2648 *idk = (scope 2649 ? CP_ID_KIND_QUALIFIED 2650 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR 2651 ? CP_ID_KIND_TEMPLATE_ID 2652 : CP_ID_KIND_UNQUALIFIED)); 2653 2654 2655 /* [temp.dep.expr] 2656 2657 An id-expression is type-dependent if it contains an 2658 identifier that was declared with a dependent type. 2659 2660 The standard is not very specific about an id-expression that 2661 names a set of overloaded functions. What if some of them 2662 have dependent types and some of them do not? Presumably, 2663 such a name should be treated as a dependent name. */ 2664 /* Assume the name is not dependent. */ 2665 dependent_p = false; 2666 if (!processing_template_decl) 2667 /* No names are dependent outside a template. */ 2668 ; 2669 /* A template-id where the name of the template was not resolved 2670 is definitely dependent. */ 2671 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR 2672 && (TREE_CODE (TREE_OPERAND (decl, 0)) 2673 == IDENTIFIER_NODE)) 2674 dependent_p = true; 2675 /* For anything except an overloaded function, just check its 2676 type. */ 2677 else if (!is_overloaded_fn (decl)) 2678 dependent_p 2679 = dependent_type_p (TREE_TYPE (decl)); 2680 /* For a set of overloaded functions, check each of the 2681 functions. */ 2682 else 2683 { 2684 tree fns = decl; 2685 2686 if (BASELINK_P (fns)) 2687 fns = BASELINK_FUNCTIONS (fns); 2688 2689 /* For a template-id, check to see if the template 2690 arguments are dependent. */ 2691 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR) 2692 { 2693 tree args = TREE_OPERAND (fns, 1); 2694 dependent_p = any_dependent_template_arguments_p (args); 2695 /* The functions are those referred to by the 2696 template-id. */ 2697 fns = TREE_OPERAND (fns, 0); 2698 } 2699 2700 /* If there are no dependent template arguments, go through 2701 the overloaded functions. */ 2702 while (fns && !dependent_p) 2703 { 2704 tree fn = OVL_CURRENT (fns); 2705 2706 /* Member functions of dependent classes are 2707 dependent. */ 2708 if (TREE_CODE (fn) == FUNCTION_DECL 2709 && type_dependent_expression_p (fn)) 2710 dependent_p = true; 2711 else if (TREE_CODE (fn) == TEMPLATE_DECL 2712 && dependent_template_p (fn)) 2713 dependent_p = true; 2714 2715 fns = OVL_NEXT (fns); 2716 } 2717 } 2718 2719 /* If the name was dependent on a template parameter, we will 2720 resolve the name at instantiation time. */ 2721 if (dependent_p) 2722 { 2723 /* Create a SCOPE_REF for qualified names, if the scope is 2724 dependent. */ 2725 if (scope) 2726 { 2727 /* Since this name was dependent, the expression isn't 2728 constant -- yet. No error is issued because it might 2729 be constant when things are instantiated. */ 2730 if (integral_constant_expression_p) 2731 *non_integral_constant_expression_p = true; 2732 if (TYPE_P (scope)) 2733 { 2734 if (address_p && done) 2735 decl = finish_qualified_id_expr (scope, decl, 2736 done, address_p, 2737 template_p, 2738 template_arg_p); 2739 else if (dependent_type_p (scope)) 2740 decl = build_qualified_name (/*type=*/NULL_TREE, 2741 scope, 2742 id_expression, 2743 template_p); 2744 else if (DECL_P (decl)) 2745 decl = build_qualified_name (TREE_TYPE (decl), 2746 scope, 2747 id_expression, 2748 template_p); 2749 } 2750 if (TREE_TYPE (decl)) 2751 decl = convert_from_reference (decl); 2752 return decl; 2753 } 2754 /* A TEMPLATE_ID already contains all the information we 2755 need. */ 2756 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR) 2757 return id_expression; 2758 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT; 2759 /* If we found a variable, then name lookup during the 2760 instantiation will always resolve to the same VAR_DECL 2761 (or an instantiation thereof). */ 2762 if (TREE_CODE (decl) == VAR_DECL 2763 || TREE_CODE (decl) == PARM_DECL) 2764 return convert_from_reference (decl); 2765 /* The same is true for FIELD_DECL, but we also need to 2766 make sure that the syntax is correct. */ 2767 else if (TREE_CODE (decl) == FIELD_DECL) 2768 { 2769 /* Since SCOPE is NULL here, this is an unqualified name. 2770 Access checking has been performed during name lookup 2771 already. Turn off checking to avoid duplicate errors. */ 2772 push_deferring_access_checks (dk_no_check); 2773 decl = finish_non_static_data_member 2774 (decl, current_class_ref, 2775 /*qualifying_scope=*/NULL_TREE); 2776 pop_deferring_access_checks (); 2777 return decl; 2778 } 2779 return id_expression; 2780 } 2781 2782 /* Only certain kinds of names are allowed in constant 2783 expression. Enumerators and template parameters have already 2784 been handled above. */ 2785 if (integral_constant_expression_p 2786 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl) 2787 && ! builtin_valid_in_constant_expr_p (decl)) 2788 { 2789 if (!allow_non_integral_constant_expression_p) 2790 { 2791 error ("%qD cannot appear in a constant-expression", decl); 2792 return error_mark_node; 2793 } 2794 *non_integral_constant_expression_p = true; 2795 } 2796 2797 if (TREE_CODE (decl) == NAMESPACE_DECL) 2798 { 2799 error ("use of namespace %qD as expression", decl); 2800 return error_mark_node; 2801 } 2802 else if (DECL_CLASS_TEMPLATE_P (decl)) 2803 { 2804 error ("use of class template %qT as expression", decl); 2805 return error_mark_node; 2806 } 2807 else if (TREE_CODE (decl) == TREE_LIST) 2808 { 2809 /* Ambiguous reference to base members. */ 2810 error ("request for member %qD is ambiguous in " 2811 "multiple inheritance lattice", id_expression); 2812 print_candidates (decl); 2813 return error_mark_node; 2814 } 2815 2816 /* Mark variable-like entities as used. Functions are similarly 2817 marked either below or after overload resolution. */ 2818 if (TREE_CODE (decl) == VAR_DECL 2819 || TREE_CODE (decl) == PARM_DECL 2820 || TREE_CODE (decl) == RESULT_DECL) 2821 mark_used (decl); 2822 2823 if (scope) 2824 { 2825 decl = (adjust_result_of_qualified_name_lookup 2826 (decl, scope, current_class_type)); 2827 2828 if (TREE_CODE (decl) == FUNCTION_DECL) 2829 mark_used (decl); 2830 2831 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl)) 2832 decl = finish_qualified_id_expr (scope, 2833 decl, 2834 done, 2835 address_p, 2836 template_p, 2837 template_arg_p); 2838 else 2839 { 2840 tree r = convert_from_reference (decl); 2841 2842 if (processing_template_decl && TYPE_P (scope)) 2843 r = build_qualified_name (TREE_TYPE (r), 2844 scope, decl, 2845 template_p); 2846 decl = r; 2847 } 2848 } 2849 else if (TREE_CODE (decl) == FIELD_DECL) 2850 { 2851 /* Since SCOPE is NULL here, this is an unqualified name. 2852 Access checking has been performed during name lookup 2853 already. Turn off checking to avoid duplicate errors. */ 2854 push_deferring_access_checks (dk_no_check); 2855 decl = finish_non_static_data_member (decl, current_class_ref, 2856 /*qualifying_scope=*/NULL_TREE); 2857 pop_deferring_access_checks (); 2858 } 2859 else if (is_overloaded_fn (decl)) 2860 { 2861 tree first_fn; 2862 2863 first_fn = decl; 2864 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR) 2865 first_fn = TREE_OPERAND (first_fn, 0); 2866 first_fn = get_first_fn (first_fn); 2867 if (TREE_CODE (first_fn) == TEMPLATE_DECL) 2868 first_fn = DECL_TEMPLATE_RESULT (first_fn); 2869 2870 if (!really_overloaded_fn (decl)) 2871 mark_used (first_fn); 2872 2873 if (!template_arg_p 2874 && TREE_CODE (first_fn) == FUNCTION_DECL 2875 && DECL_FUNCTION_MEMBER_P (first_fn) 2876 && !shared_member_p (decl)) 2877 { 2878 /* A set of member functions. */ 2879 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0); 2880 return finish_class_member_access_expr (decl, id_expression, 2881 /*template_p=*/false); 2882 } 2883 2884 decl = baselink_for_fns (decl); 2885 } 2886 else 2887 { 2888 if (DECL_P (decl) && DECL_NONLOCAL (decl) 2889 && DECL_CLASS_SCOPE_P (decl) 2890 && DECL_CONTEXT (decl) != current_class_type) 2891 { 2892 tree path; 2893 2894 path = currently_open_derived_class (DECL_CONTEXT (decl)); 2895 perform_or_defer_access_check (TYPE_BINFO (path), decl, decl); 2896 } 2897 2898 decl = convert_from_reference (decl); 2899 } 2900 } 2901 2902 if (TREE_DEPRECATED (decl)) 2903 warn_deprecated_use (decl); 2904 2905 return decl; 2906} 2907 2908/* Implement the __typeof keyword: Return the type of EXPR, suitable for 2909 use as a type-specifier. */ 2910 2911tree 2912finish_typeof (tree expr) 2913{ 2914 tree type; 2915 2916 if (type_dependent_expression_p (expr)) 2917 { 2918 type = make_aggr_type (TYPEOF_TYPE); 2919 TYPEOF_TYPE_EXPR (type) = expr; 2920 2921 return type; 2922 } 2923 2924 type = unlowered_expr_type (expr); 2925 2926 if (!type || type == unknown_type_node) 2927 { 2928 error ("type of %qE is unknown", expr); 2929 return error_mark_node; 2930 } 2931 2932 return type; 2933} 2934 2935/* Perform C++-specific checks for __builtin_offsetof before calling 2936 fold_offsetof. */ 2937 2938tree 2939finish_offsetof (tree expr) 2940{ 2941 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR) 2942 { 2943 error ("cannot apply %<offsetof%> to destructor %<~%T%>", 2944 TREE_OPERAND (expr, 2)); 2945 return error_mark_node; 2946 } 2947 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE 2948 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE 2949 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE) 2950 { 2951 if (TREE_CODE (expr) == COMPONENT_REF 2952 || TREE_CODE (expr) == COMPOUND_EXPR) 2953 expr = TREE_OPERAND (expr, 1); 2954 error ("cannot apply %<offsetof%> to member function %qD", expr); 2955 return error_mark_node; 2956 } 2957 return fold_offsetof (expr, NULL_TREE); 2958} 2959 2960/* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs 2961 with equivalent CALL_EXPRs. */ 2962 2963static tree 2964simplify_aggr_init_exprs_r (tree* tp, 2965 int* walk_subtrees, 2966 void* data ATTRIBUTE_UNUSED) 2967{ 2968 /* We don't need to walk into types; there's nothing in a type that 2969 needs simplification. (And, furthermore, there are places we 2970 actively don't want to go. For example, we don't want to wander 2971 into the default arguments for a FUNCTION_DECL that appears in a 2972 CALL_EXPR.) */ 2973 if (TYPE_P (*tp)) 2974 { 2975 *walk_subtrees = 0; 2976 return NULL_TREE; 2977 } 2978 /* Only AGGR_INIT_EXPRs are interesting. */ 2979 else if (TREE_CODE (*tp) != AGGR_INIT_EXPR) 2980 return NULL_TREE; 2981 2982 simplify_aggr_init_expr (tp); 2983 2984 /* Keep iterating. */ 2985 return NULL_TREE; 2986} 2987 2988/* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This 2989 function is broken out from the above for the benefit of the tree-ssa 2990 project. */ 2991 2992void 2993simplify_aggr_init_expr (tree *tp) 2994{ 2995 tree aggr_init_expr = *tp; 2996 2997 /* Form an appropriate CALL_EXPR. */ 2998 tree fn = TREE_OPERAND (aggr_init_expr, 0); 2999 tree args = TREE_OPERAND (aggr_init_expr, 1); 3000 tree slot = TREE_OPERAND (aggr_init_expr, 2); 3001 tree type = TREE_TYPE (slot); 3002 3003 tree call_expr; 3004 enum style_t { ctor, arg, pcc } style; 3005 3006 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr)) 3007 style = ctor; 3008#ifdef PCC_STATIC_STRUCT_RETURN 3009 else if (1) 3010 style = pcc; 3011#endif 3012 else 3013 { 3014 gcc_assert (TREE_ADDRESSABLE (type)); 3015 style = arg; 3016 } 3017 3018 if (style == ctor) 3019 { 3020 /* Replace the first argument to the ctor with the address of the 3021 slot. */ 3022 tree addr; 3023 3024 args = TREE_CHAIN (args); 3025 cxx_mark_addressable (slot); 3026 addr = build1 (ADDR_EXPR, build_pointer_type (type), slot); 3027 args = tree_cons (NULL_TREE, addr, args); 3028 } 3029 3030 call_expr = build3 (CALL_EXPR, 3031 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))), 3032 fn, args, NULL_TREE); 3033 3034 if (style == arg) 3035 { 3036 /* Just mark it addressable here, and leave the rest to 3037 expand_call{,_inline}. */ 3038 cxx_mark_addressable (slot); 3039 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true; 3040 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr); 3041 } 3042 else if (style == pcc) 3043 { 3044 /* If we're using the non-reentrant PCC calling convention, then we 3045 need to copy the returned value out of the static buffer into the 3046 SLOT. */ 3047 push_deferring_access_checks (dk_no_check); 3048 call_expr = build_aggr_init (slot, call_expr, 3049 DIRECT_BIND | LOOKUP_ONLYCONVERTING); 3050 pop_deferring_access_checks (); 3051 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot); 3052 } 3053 3054 *tp = call_expr; 3055} 3056 3057/* Emit all thunks to FN that should be emitted when FN is emitted. */ 3058 3059static void 3060emit_associated_thunks (tree fn) 3061{ 3062 /* When we use vcall offsets, we emit thunks with the virtual 3063 functions to which they thunk. The whole point of vcall offsets 3064 is so that you can know statically the entire set of thunks that 3065 will ever be needed for a given virtual function, thereby 3066 enabling you to output all the thunks with the function itself. */ 3067 if (DECL_VIRTUAL_P (fn)) 3068 { 3069 tree thunk; 3070 3071 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk)) 3072 { 3073 if (!THUNK_ALIAS (thunk)) 3074 { 3075 use_thunk (thunk, /*emit_p=*/1); 3076 if (DECL_RESULT_THUNK_P (thunk)) 3077 { 3078 tree probe; 3079 3080 for (probe = DECL_THUNKS (thunk); 3081 probe; probe = TREE_CHAIN (probe)) 3082 use_thunk (probe, /*emit_p=*/1); 3083 } 3084 } 3085 else 3086 gcc_assert (!DECL_THUNKS (thunk)); 3087 } 3088 } 3089} 3090 3091/* Generate RTL for FN. */ 3092 3093void 3094expand_body (tree fn) 3095{ 3096 tree saved_function; 3097 3098 /* Compute the appropriate object-file linkage for inline 3099 functions. */ 3100 if (DECL_DECLARED_INLINE_P (fn)) 3101 import_export_decl (fn); 3102 3103 /* If FN is external, then there's no point in generating RTL for 3104 it. This situation can arise with an inline function under 3105 `-fexternal-templates'; we instantiate the function, even though 3106 we're not planning on emitting it, in case we get a chance to 3107 inline it. */ 3108 if (DECL_EXTERNAL (fn)) 3109 return; 3110 3111 /* ??? When is this needed? */ 3112 saved_function = current_function_decl; 3113 3114 /* Emit any thunks that should be emitted at the same time as FN. */ 3115 emit_associated_thunks (fn); 3116 3117 /* This function is only called from cgraph, or recursively from 3118 emit_associated_thunks. In neither case should we be currently 3119 generating trees for a function. */ 3120 gcc_assert (function_depth == 0); 3121 3122 tree_rest_of_compilation (fn); 3123 3124 current_function_decl = saved_function; 3125 3126 if (DECL_CLONED_FUNCTION_P (fn)) 3127 { 3128 /* If this is a clone, go through the other clones now and mark 3129 their parameters used. We have to do that here, as we don't 3130 know whether any particular clone will be expanded, and 3131 therefore cannot pick one arbitrarily. */ 3132 tree probe; 3133 3134 for (probe = TREE_CHAIN (DECL_CLONED_FUNCTION (fn)); 3135 probe && DECL_CLONED_FUNCTION_P (probe); 3136 probe = TREE_CHAIN (probe)) 3137 { 3138 tree parms; 3139 3140 for (parms = DECL_ARGUMENTS (probe); 3141 parms; parms = TREE_CHAIN (parms)) 3142 TREE_USED (parms) = 1; 3143 } 3144 } 3145} 3146 3147/* Generate RTL for FN. */ 3148 3149void 3150expand_or_defer_fn (tree fn) 3151{ 3152 /* When the parser calls us after finishing the body of a template 3153 function, we don't really want to expand the body. */ 3154 if (processing_template_decl) 3155 { 3156 /* Normally, collection only occurs in rest_of_compilation. So, 3157 if we don't collect here, we never collect junk generated 3158 during the processing of templates until we hit a 3159 non-template function. It's not safe to do this inside a 3160 nested class, though, as the parser may have local state that 3161 is not a GC root. */ 3162 if (!function_depth) 3163 ggc_collect (); 3164 return; 3165 } 3166 3167 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */ 3168 walk_tree_without_duplicates (&DECL_SAVED_TREE (fn), 3169 simplify_aggr_init_exprs_r, 3170 NULL); 3171 3172 /* If this is a constructor or destructor body, we have to clone 3173 it. */ 3174 if (maybe_clone_body (fn)) 3175 { 3176 /* We don't want to process FN again, so pretend we've written 3177 it out, even though we haven't. */ 3178 TREE_ASM_WRITTEN (fn) = 1; 3179 return; 3180 } 3181 3182 /* If this function is marked with the constructor attribute, add it 3183 to the list of functions to be called along with constructors 3184 from static duration objects. */ 3185 if (DECL_STATIC_CONSTRUCTOR (fn)) 3186 static_ctors = tree_cons (NULL_TREE, fn, static_ctors); 3187 3188 /* If this function is marked with the destructor attribute, add it 3189 to the list of functions to be called along with destructors from 3190 static duration objects. */ 3191 if (DECL_STATIC_DESTRUCTOR (fn)) 3192 static_dtors = tree_cons (NULL_TREE, fn, static_dtors); 3193 3194 /* We make a decision about linkage for these functions at the end 3195 of the compilation. Until that point, we do not want the back 3196 end to output them -- but we do want it to see the bodies of 3197 these functions so that it can inline them as appropriate. */ 3198 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn)) 3199 { 3200 if (DECL_INTERFACE_KNOWN (fn)) 3201 /* We've already made a decision as to how this function will 3202 be handled. */; 3203 else if (!at_eof) 3204 { 3205 DECL_EXTERNAL (fn) = 1; 3206 DECL_NOT_REALLY_EXTERN (fn) = 1; 3207 note_vague_linkage_fn (fn); 3208 /* A non-template inline function with external linkage will 3209 always be COMDAT. As we must eventually determine the 3210 linkage of all functions, and as that causes writes to 3211 the data mapped in from the PCH file, it's advantageous 3212 to mark the functions at this point. */ 3213 if (!DECL_IMPLICIT_INSTANTIATION (fn)) 3214 { 3215 /* This function must have external linkage, as 3216 otherwise DECL_INTERFACE_KNOWN would have been 3217 set. */ 3218 gcc_assert (TREE_PUBLIC (fn)); 3219 comdat_linkage (fn); 3220 DECL_INTERFACE_KNOWN (fn) = 1; 3221 } 3222 } 3223 else 3224 import_export_decl (fn); 3225 3226 /* If the user wants us to keep all inline functions, then mark 3227 this function as needed so that finish_file will make sure to 3228 output it later. */ 3229 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn)) 3230 mark_needed (fn); 3231 } 3232 3233 /* There's no reason to do any of the work here if we're only doing 3234 semantic analysis; this code just generates RTL. */ 3235 if (flag_syntax_only) 3236 return; 3237 3238 function_depth++; 3239 3240 /* Expand or defer, at the whim of the compilation unit manager. */ 3241 cgraph_finalize_function (fn, function_depth > 1); 3242 3243 function_depth--; 3244} 3245 3246struct nrv_data 3247{ 3248 tree var; 3249 tree result; 3250 htab_t visited; 3251}; 3252 3253/* Helper function for walk_tree, used by finalize_nrv below. */ 3254 3255static tree 3256finalize_nrv_r (tree* tp, int* walk_subtrees, void* data) 3257{ 3258 struct nrv_data *dp = (struct nrv_data *)data; 3259 void **slot; 3260 3261 /* No need to walk into types. There wouldn't be any need to walk into 3262 non-statements, except that we have to consider STMT_EXPRs. */ 3263 if (TYPE_P (*tp)) 3264 *walk_subtrees = 0; 3265 /* Change all returns to just refer to the RESULT_DECL; this is a nop, 3266 but differs from using NULL_TREE in that it indicates that we care 3267 about the value of the RESULT_DECL. */ 3268 else if (TREE_CODE (*tp) == RETURN_EXPR) 3269 TREE_OPERAND (*tp, 0) = dp->result; 3270 /* Change all cleanups for the NRV to only run when an exception is 3271 thrown. */ 3272 else if (TREE_CODE (*tp) == CLEANUP_STMT 3273 && CLEANUP_DECL (*tp) == dp->var) 3274 CLEANUP_EH_ONLY (*tp) = 1; 3275 /* Replace the DECL_EXPR for the NRV with an initialization of the 3276 RESULT_DECL, if needed. */ 3277 else if (TREE_CODE (*tp) == DECL_EXPR 3278 && DECL_EXPR_DECL (*tp) == dp->var) 3279 { 3280 tree init; 3281 if (DECL_INITIAL (dp->var) 3282 && DECL_INITIAL (dp->var) != error_mark_node) 3283 { 3284 init = build2 (INIT_EXPR, void_type_node, dp->result, 3285 DECL_INITIAL (dp->var)); 3286 DECL_INITIAL (dp->var) = error_mark_node; 3287 } 3288 else 3289 init = build_empty_stmt (); 3290 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp)); 3291 *tp = init; 3292 } 3293 /* And replace all uses of the NRV with the RESULT_DECL. */ 3294 else if (*tp == dp->var) 3295 *tp = dp->result; 3296 3297 /* Avoid walking into the same tree more than once. Unfortunately, we 3298 can't just use walk_tree_without duplicates because it would only call 3299 us for the first occurrence of dp->var in the function body. */ 3300 slot = htab_find_slot (dp->visited, *tp, INSERT); 3301 if (*slot) 3302 *walk_subtrees = 0; 3303 else 3304 *slot = *tp; 3305 3306 /* Keep iterating. */ 3307 return NULL_TREE; 3308} 3309 3310/* Called from finish_function to implement the named return value 3311 optimization by overriding all the RETURN_EXPRs and pertinent 3312 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the 3313 RESULT_DECL for the function. */ 3314 3315void 3316finalize_nrv (tree *tp, tree var, tree result) 3317{ 3318 struct nrv_data data; 3319 3320 /* Copy debugging information from VAR to RESULT. */ 3321 DECL_NAME (result) = DECL_NAME (var); 3322 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var); 3323 DECL_IGNORED_P (result) = DECL_IGNORED_P (var); 3324 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var); 3325 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var); 3326 /* Don't forget that we take its address. */ 3327 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var); 3328 3329 data.var = var; 3330 data.result = result; 3331 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL); 3332 walk_tree (tp, finalize_nrv_r, &data, 0); 3333 htab_delete (data.visited); 3334} 3335 3336/* For all elements of CLAUSES, validate them vs OpenMP constraints. 3337 Remove any elements from the list that are invalid. */ 3338 3339tree 3340finish_omp_clauses (tree clauses) 3341{ 3342 bitmap_head generic_head, firstprivate_head, lastprivate_head; 3343 tree c, t, *pc = &clauses; 3344 const char *name; 3345 3346 bitmap_obstack_initialize (NULL); 3347 bitmap_initialize (&generic_head, &bitmap_default_obstack); 3348 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack); 3349 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack); 3350 3351 for (pc = &clauses, c = clauses; c ; c = *pc) 3352 { 3353 bool remove = false; 3354 3355 switch (OMP_CLAUSE_CODE (c)) 3356 { 3357 case OMP_CLAUSE_SHARED: 3358 name = "shared"; 3359 goto check_dup_generic; 3360 case OMP_CLAUSE_PRIVATE: 3361 name = "private"; 3362 goto check_dup_generic; 3363 case OMP_CLAUSE_REDUCTION: 3364 name = "reduction"; 3365 goto check_dup_generic; 3366 case OMP_CLAUSE_COPYPRIVATE: 3367 name = "copyprivate"; 3368 goto check_dup_generic; 3369 case OMP_CLAUSE_COPYIN: 3370 name = "copyin"; 3371 goto check_dup_generic; 3372 check_dup_generic: 3373 t = OMP_CLAUSE_DECL (c); 3374 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL) 3375 { 3376 if (processing_template_decl) 3377 break; 3378 if (DECL_P (t)) 3379 error ("%qD is not a variable in clause %qs", t, name); 3380 else 3381 error ("%qE is not a variable in clause %qs", t, name); 3382 remove = true; 3383 } 3384 else if (bitmap_bit_p (&generic_head, DECL_UID (t)) 3385 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)) 3386 || bitmap_bit_p (&lastprivate_head, DECL_UID (t))) 3387 { 3388 error ("%qD appears more than once in data clauses", t); 3389 remove = true; 3390 } 3391 else 3392 bitmap_set_bit (&generic_head, DECL_UID (t)); 3393 break; 3394 3395 case OMP_CLAUSE_FIRSTPRIVATE: 3396 t = OMP_CLAUSE_DECL (c); 3397 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL) 3398 { 3399 if (processing_template_decl) 3400 break; 3401 error ("%qE is not a variable in clause %<firstprivate%>", t); 3402 remove = true; 3403 } 3404 else if (bitmap_bit_p (&generic_head, DECL_UID (t)) 3405 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))) 3406 { 3407 error ("%qE appears more than once in data clauses", t); 3408 remove = true; 3409 } 3410 else 3411 bitmap_set_bit (&firstprivate_head, DECL_UID (t)); 3412 break; 3413 3414 case OMP_CLAUSE_LASTPRIVATE: 3415 t = OMP_CLAUSE_DECL (c); 3416 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL) 3417 { 3418 if (processing_template_decl) 3419 break; 3420 error ("%qE is not a variable in clause %<lastprivate%>", t); 3421 remove = true; 3422 } 3423 else if (bitmap_bit_p (&generic_head, DECL_UID (t)) 3424 || bitmap_bit_p (&lastprivate_head, DECL_UID (t))) 3425 { 3426 error ("%qE appears more than once in data clauses", t); 3427 remove = true; 3428 } 3429 else 3430 bitmap_set_bit (&lastprivate_head, DECL_UID (t)); 3431 break; 3432 3433 case OMP_CLAUSE_IF: 3434 t = OMP_CLAUSE_IF_EXPR (c); 3435 t = maybe_convert_cond (t); 3436 if (t == error_mark_node) 3437 remove = true; 3438 OMP_CLAUSE_IF_EXPR (c) = t; 3439 break; 3440 3441 case OMP_CLAUSE_NUM_THREADS: 3442 t = OMP_CLAUSE_NUM_THREADS_EXPR (c); 3443 if (t == error_mark_node) 3444 remove = true; 3445 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t)) 3446 && !type_dependent_expression_p (t)) 3447 { 3448 error ("num_threads expression must be integral"); 3449 remove = true; 3450 } 3451 break; 3452 3453 case OMP_CLAUSE_SCHEDULE: 3454 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c); 3455 if (t == NULL) 3456 ; 3457 else if (t == error_mark_node) 3458 remove = true; 3459 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t)) 3460 && !type_dependent_expression_p (t)) 3461 { 3462 error ("schedule chunk size expression must be integral"); 3463 remove = true; 3464 } 3465 break; 3466 3467 case OMP_CLAUSE_NOWAIT: 3468 case OMP_CLAUSE_ORDERED: 3469 case OMP_CLAUSE_DEFAULT: 3470 break; 3471 3472 default: 3473 gcc_unreachable (); 3474 } 3475 3476 if (remove) 3477 *pc = OMP_CLAUSE_CHAIN (c); 3478 else 3479 pc = &OMP_CLAUSE_CHAIN (c); 3480 } 3481 3482 for (pc = &clauses, c = clauses; c ; c = *pc) 3483 { 3484 enum tree_code c_kind = OMP_CLAUSE_CODE (c); 3485 bool remove = false; 3486 bool need_complete_non_reference = false; 3487 bool need_default_ctor = false; 3488 bool need_copy_ctor = false; 3489 bool need_copy_assignment = false; 3490 bool need_implicitly_determined = false; 3491 tree type, inner_type; 3492 3493 switch (c_kind) 3494 { 3495 case OMP_CLAUSE_SHARED: 3496 name = "shared"; 3497 need_implicitly_determined = true; 3498 break; 3499 case OMP_CLAUSE_PRIVATE: 3500 name = "private"; 3501 need_complete_non_reference = true; 3502 need_default_ctor = true; 3503 need_implicitly_determined = true; 3504 break; 3505 case OMP_CLAUSE_FIRSTPRIVATE: 3506 name = "firstprivate"; 3507 need_complete_non_reference = true; 3508 need_copy_ctor = true; 3509 need_implicitly_determined = true; 3510 break; 3511 case OMP_CLAUSE_LASTPRIVATE: 3512 name = "lastprivate"; 3513 need_complete_non_reference = true; 3514 need_copy_assignment = true; 3515 need_implicitly_determined = true; 3516 break; 3517 case OMP_CLAUSE_REDUCTION: 3518 name = "reduction"; 3519 need_implicitly_determined = true; 3520 break; 3521 case OMP_CLAUSE_COPYPRIVATE: 3522 name = "copyprivate"; 3523 need_copy_assignment = true; 3524 break; 3525 case OMP_CLAUSE_COPYIN: 3526 name = "copyin"; 3527 need_copy_assignment = true; 3528 break; 3529 default: 3530 pc = &OMP_CLAUSE_CHAIN (c); 3531 continue; 3532 } 3533 3534 t = OMP_CLAUSE_DECL (c); 3535 if (processing_template_decl 3536 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL) 3537 { 3538 pc = &OMP_CLAUSE_CHAIN (c); 3539 continue; 3540 } 3541 3542 switch (c_kind) 3543 { 3544 case OMP_CLAUSE_LASTPRIVATE: 3545 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t))) 3546 need_default_ctor = true; 3547 break; 3548 3549 case OMP_CLAUSE_REDUCTION: 3550 if (AGGREGATE_TYPE_P (TREE_TYPE (t)) 3551 || POINTER_TYPE_P (TREE_TYPE (t))) 3552 { 3553 error ("%qE has invalid type for %<reduction%>", t); 3554 remove = true; 3555 } 3556 else if (FLOAT_TYPE_P (TREE_TYPE (t))) 3557 { 3558 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c); 3559 switch (r_code) 3560 { 3561 case PLUS_EXPR: 3562 case MULT_EXPR: 3563 case MINUS_EXPR: 3564 break; 3565 default: 3566 error ("%qE has invalid type for %<reduction(%s)%>", 3567 t, operator_name_info[r_code].name); 3568 remove = true; 3569 } 3570 } 3571 break; 3572 3573 case OMP_CLAUSE_COPYIN: 3574 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t)) 3575 { 3576 error ("%qE must be %<threadprivate%> for %<copyin%>", t); 3577 remove = true; 3578 } 3579 break; 3580 3581 default: 3582 break; 3583 } 3584 3585 if (need_complete_non_reference) 3586 { 3587 t = require_complete_type (t); 3588 if (t == error_mark_node) 3589 remove = true; 3590 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE) 3591 { 3592 error ("%qE has reference type for %qs", t, name); 3593 remove = true; 3594 } 3595 } 3596 if (need_implicitly_determined) 3597 { 3598 const char *share_name = NULL; 3599 3600 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t)) 3601 share_name = "threadprivate"; 3602 else switch (cxx_omp_predetermined_sharing (t)) 3603 { 3604 case OMP_CLAUSE_DEFAULT_UNSPECIFIED: 3605 break; 3606 case OMP_CLAUSE_DEFAULT_SHARED: 3607 share_name = "shared"; 3608 break; 3609 case OMP_CLAUSE_DEFAULT_PRIVATE: 3610 share_name = "private"; 3611 break; 3612 default: 3613 gcc_unreachable (); 3614 } 3615 if (share_name) 3616 { 3617 error ("%qE is predetermined %qs for %qs", 3618 t, share_name, name); 3619 remove = true; 3620 } 3621 } 3622 3623 /* We're interested in the base element, not arrays. */ 3624 inner_type = type = TREE_TYPE (t); 3625 while (TREE_CODE (inner_type) == ARRAY_TYPE) 3626 inner_type = TREE_TYPE (inner_type); 3627 3628 /* Check for special function availability by building a call to one. 3629 Save the results, because later we won't be in the right context 3630 for making these queries. */ 3631 if (CLASS_TYPE_P (inner_type) 3632 && (need_default_ctor || need_copy_ctor || need_copy_assignment) 3633 && !type_dependent_expression_p (t)) 3634 { 3635 int save_errorcount = errorcount; 3636 tree info; 3637 3638 /* Always allocate 3 elements for simplicity. These are the 3639 function decls for the ctor, dtor, and assignment op. 3640 This layout is known to the three lang hooks, 3641 cxx_omp_clause_default_init, cxx_omp_clause_copy_init, 3642 and cxx_omp_clause_assign_op. */ 3643 info = make_tree_vec (3); 3644 CP_OMP_CLAUSE_INFO (c) = info; 3645 3646 if (need_default_ctor 3647 || (need_copy_ctor 3648 && !TYPE_HAS_TRIVIAL_INIT_REF (inner_type))) 3649 { 3650 if (need_default_ctor) 3651 t = NULL; 3652 else 3653 { 3654 t = build_int_cst (build_pointer_type (inner_type), 0); 3655 t = build1 (INDIRECT_REF, inner_type, t); 3656 t = build_tree_list (NULL, t); 3657 } 3658 t = build_special_member_call (NULL_TREE, 3659 complete_ctor_identifier, 3660 t, inner_type, LOOKUP_NORMAL); 3661 t = get_callee_fndecl (t); 3662 TREE_VEC_ELT (info, 0) = t; 3663 } 3664 3665 if ((need_default_ctor || need_copy_ctor) 3666 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_type)) 3667 { 3668 t = build_int_cst (build_pointer_type (inner_type), 0); 3669 t = build1 (INDIRECT_REF, inner_type, t); 3670 t = build_special_member_call (t, complete_dtor_identifier, 3671 NULL, inner_type, LOOKUP_NORMAL); 3672 t = get_callee_fndecl (t); 3673 TREE_VEC_ELT (info, 1) = t; 3674 } 3675 3676 if (need_copy_assignment 3677 && !TYPE_HAS_TRIVIAL_ASSIGN_REF (inner_type)) 3678 { 3679 t = build_int_cst (build_pointer_type (inner_type), 0); 3680 t = build1 (INDIRECT_REF, inner_type, t); 3681 t = build_special_member_call (t, ansi_assopname (NOP_EXPR), 3682 build_tree_list (NULL, t), 3683 inner_type, LOOKUP_NORMAL); 3684 3685 /* We'll have called convert_from_reference on the call, which 3686 may well have added an indirect_ref. It's unneeded here, 3687 and in the way, so kill it. */ 3688 if (TREE_CODE (t) == INDIRECT_REF) 3689 t = TREE_OPERAND (t, 0); 3690 3691 t = get_callee_fndecl (t); 3692 TREE_VEC_ELT (info, 2) = t; 3693 } 3694 3695 if (errorcount != save_errorcount) 3696 remove = true; 3697 } 3698 3699 if (remove) 3700 *pc = OMP_CLAUSE_CHAIN (c); 3701 else 3702 pc = &OMP_CLAUSE_CHAIN (c); 3703 } 3704 3705 bitmap_obstack_release (NULL); 3706 return clauses; 3707} 3708 3709/* For all variables in the tree_list VARS, mark them as thread local. */ 3710 3711void 3712finish_omp_threadprivate (tree vars) 3713{ 3714 tree t; 3715 3716 /* Mark every variable in VARS to be assigned thread local storage. */ 3717 for (t = vars; t; t = TREE_CHAIN (t)) 3718 { 3719 tree v = TREE_PURPOSE (t); 3720 3721 /* If V had already been marked threadprivate, it doesn't matter 3722 whether it had been used prior to this point. */ 3723 if (TREE_USED (v) 3724 && (DECL_LANG_SPECIFIC (v) == NULL 3725 || !CP_DECL_THREADPRIVATE_P (v))) 3726 error ("%qE declared %<threadprivate%> after first use", v); 3727 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v)) 3728 error ("automatic variable %qE cannot be %<threadprivate%>", v); 3729 else if (! COMPLETE_TYPE_P (TREE_TYPE (v))) 3730 error ("%<threadprivate%> %qE has incomplete type", v); 3731 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))) 3732 error ("%<threadprivate%> %qE is not file, namespace " 3733 "or block scope variable", v); 3734 else 3735 { 3736 /* Allocate a LANG_SPECIFIC structure for V, if needed. */ 3737 if (DECL_LANG_SPECIFIC (v) == NULL) 3738 { 3739 retrofit_lang_decl (v); 3740 3741 /* Make sure that DECL_DISCRIMINATOR_P continues to be true 3742 after the allocation of the lang_decl structure. */ 3743 if (DECL_DISCRIMINATOR_P (v)) 3744 DECL_LANG_SPECIFIC (v)->decl_flags.u2sel = 1; 3745 } 3746 3747 if (! DECL_THREAD_LOCAL_P (v)) 3748 { 3749 DECL_TLS_MODEL (v) = decl_default_tls_model (v); 3750 /* If rtl has been already set for this var, call 3751 make_decl_rtl once again, so that encode_section_info 3752 has a chance to look at the new decl flags. */ 3753 if (DECL_RTL_SET_P (v)) 3754 make_decl_rtl (v); 3755 } 3756 CP_DECL_THREADPRIVATE_P (v) = 1; 3757 } 3758 } 3759} 3760 3761/* Build an OpenMP structured block. */ 3762 3763tree 3764begin_omp_structured_block (void) 3765{ 3766 return do_pushlevel (sk_omp); 3767} 3768 3769tree 3770finish_omp_structured_block (tree block) 3771{ 3772 return do_poplevel (block); 3773} 3774 3775/* Similarly, except force the retention of the BLOCK. */ 3776 3777tree 3778begin_omp_parallel (void) 3779{ 3780 keep_next_level (true); 3781 return begin_omp_structured_block (); 3782} 3783 3784tree 3785finish_omp_parallel (tree clauses, tree body) 3786{ 3787 tree stmt; 3788 3789 body = finish_omp_structured_block (body); 3790 3791 stmt = make_node (OMP_PARALLEL); 3792 TREE_TYPE (stmt) = void_type_node; 3793 OMP_PARALLEL_CLAUSES (stmt) = clauses; 3794 OMP_PARALLEL_BODY (stmt) = body; 3795 3796 return add_stmt (stmt); 3797} 3798 3799/* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR 3800 are directly for their associated operands in the statement. DECL 3801 and INIT are a combo; if DECL is NULL then INIT ought to be a 3802 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are 3803 optional statements that need to go before the loop into its 3804 sk_omp scope. */ 3805 3806tree 3807finish_omp_for (location_t locus, tree decl, tree init, tree cond, 3808 tree incr, tree body, tree pre_body) 3809{ 3810 if (decl == NULL) 3811 { 3812 if (init != NULL) 3813 switch (TREE_CODE (init)) 3814 { 3815 case MODIFY_EXPR: 3816 decl = TREE_OPERAND (init, 0); 3817 init = TREE_OPERAND (init, 1); 3818 break; 3819 case MODOP_EXPR: 3820 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR) 3821 { 3822 decl = TREE_OPERAND (init, 0); 3823 init = TREE_OPERAND (init, 2); 3824 } 3825 break; 3826 default: 3827 break; 3828 } 3829 3830 if (decl == NULL) 3831 { 3832 error ("expected iteration declaration or initialization"); 3833 return NULL; 3834 } 3835 } 3836 3837 if (type_dependent_expression_p (decl) 3838 || type_dependent_expression_p (init) 3839 || (cond && type_dependent_expression_p (cond)) 3840 || (incr && type_dependent_expression_p (incr))) 3841 { 3842 tree stmt; 3843 3844 if (cond == NULL) 3845 { 3846 error ("%Hmissing controlling predicate", &locus); 3847 return NULL; 3848 } 3849 3850 if (incr == NULL) 3851 { 3852 error ("%Hmissing increment expression", &locus); 3853 return NULL; 3854 } 3855 3856 stmt = make_node (OMP_FOR); 3857 3858 /* This is really just a place-holder. We'll be decomposing this 3859 again and going through the build_modify_expr path below when 3860 we instantiate the thing. */ 3861 init = build2 (MODIFY_EXPR, void_type_node, decl, init); 3862 3863 TREE_TYPE (stmt) = void_type_node; 3864 OMP_FOR_INIT (stmt) = init; 3865 OMP_FOR_COND (stmt) = cond; 3866 OMP_FOR_INCR (stmt) = incr; 3867 OMP_FOR_BODY (stmt) = body; 3868 OMP_FOR_PRE_BODY (stmt) = pre_body; 3869 3870 SET_EXPR_LOCATION (stmt, locus); 3871 return add_stmt (stmt); 3872 } 3873 3874 if (!DECL_P (decl)) 3875 { 3876 error ("expected iteration declaration or initialization"); 3877 return NULL; 3878 } 3879 3880 if (pre_body == NULL || IS_EMPTY_STMT (pre_body)) 3881 pre_body = NULL; 3882 else if (! processing_template_decl) 3883 { 3884 add_stmt (pre_body); 3885 pre_body = NULL; 3886 } 3887 init = build_modify_expr (decl, NOP_EXPR, init); 3888 return c_finish_omp_for (locus, decl, init, cond, incr, body, pre_body); 3889} 3890 3891void 3892finish_omp_atomic (enum tree_code code, tree lhs, tree rhs) 3893{ 3894 tree orig_lhs; 3895 tree orig_rhs; 3896 bool dependent_p; 3897 tree stmt; 3898 3899 orig_lhs = lhs; 3900 orig_rhs = rhs; 3901 dependent_p = false; 3902 stmt = NULL_TREE; 3903 3904 /* Even in a template, we can detect invalid uses of the atomic 3905 pragma if neither LHS nor RHS is type-dependent. */ 3906 if (processing_template_decl) 3907 { 3908 dependent_p = (type_dependent_expression_p (lhs) 3909 || type_dependent_expression_p (rhs)); 3910 if (!dependent_p) 3911 { 3912 lhs = build_non_dependent_expr (lhs); 3913 rhs = build_non_dependent_expr (rhs); 3914 } 3915 } 3916 if (!dependent_p) 3917 { 3918 stmt = c_finish_omp_atomic (code, lhs, rhs); 3919 if (stmt == error_mark_node) 3920 return; 3921 } 3922 if (processing_template_decl) 3923 { 3924 stmt = build2 (OMP_ATOMIC, void_type_node, orig_lhs, orig_rhs); 3925 OMP_ATOMIC_DEPENDENT_P (stmt) = 1; 3926 OMP_ATOMIC_CODE (stmt) = code; 3927 } 3928 add_stmt (stmt); 3929} 3930 3931void 3932finish_omp_barrier (void) 3933{ 3934 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER]; 3935 tree stmt = finish_call_expr (fn, NULL, false, false); 3936 finish_expr_stmt (stmt); 3937} 3938 3939void 3940finish_omp_flush (void) 3941{ 3942 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE]; 3943 tree stmt = finish_call_expr (fn, NULL, false, false); 3944 finish_expr_stmt (stmt); 3945} 3946 3947/* True if OpenMP sharing attribute of DECL is predetermined. */ 3948 3949enum omp_clause_default_kind 3950cxx_omp_predetermined_sharing (tree decl) 3951{ 3952 enum omp_clause_default_kind kind; 3953 3954 kind = c_omp_predetermined_sharing (decl); 3955 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED) 3956 return kind; 3957 3958 /* Static data members are predetermined as shared. */ 3959 if (TREE_STATIC (decl)) 3960 { 3961 tree ctx = CP_DECL_CONTEXT (decl); 3962 if (TYPE_P (ctx) && IS_AGGR_TYPE (ctx)) 3963 return OMP_CLAUSE_DEFAULT_SHARED; 3964 } 3965 3966 return OMP_CLAUSE_DEFAULT_UNSPECIFIED; 3967} 3968 3969void 3970init_cp_semantics (void) 3971{ 3972} 3973 3974#include "gt-cp-semantics.h" 3975