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.
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.
11 This file is part of GCC.
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)
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.
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
30 #include "coretypes.h"
35 #include "tree-inline.h"
36 #include "tree-mudflap.h"
45 #include "diagnostic.h"
47 #include "tree-iterator.h"
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. */
56 static tree maybe_convert_cond (tree);
57 static tree simplify_aggr_init_exprs_r (tree *, int *, void *);
58 static void emit_associated_thunks (tree);
59 static tree finalize_nrv_r (tree *, int *, void *);
62 /* Deferred Access Checking Overview
63 ---------------------------------
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.
69 For member declarations, access checking has to be deferred
70 until more information about the declaration is known. For
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.
85 Furthermore, some contexts require that access checking is
86 never performed at all. These include class heads, and template
89 Typical use of access checking functions is described here:
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).
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.
101 3. The global `current_class_type' or `current_function_decl' is then
102 setup by the parser. `enforce_access' relies on these information
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.
110 In case of parsing error, we simply call `pop_deferring_access_checks'
111 without `perform_deferred_access_checks'. */
113 typedef struct deferred_access GTY(())
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:
125 A::B* A::f() { return 0; }
127 is valid, even though `A::B' is not generally accessible. */
128 VEC (deferred_access_check,gc)* GTY(()) deferred_access_checks;
130 /* The current mode of access checks. */
131 enum deferring_kind deferring_access_checks_kind;
134 DEF_VEC_O (deferred_access);
135 DEF_VEC_ALLOC_O (deferred_access,gc);
137 /* Data for deferred access checking. */
138 static GTY(()) VEC(deferred_access,gc) *deferred_access_stack;
139 static GTY(()) unsigned deferred_access_no_check;
141 /* Save the current deferred access states and start deferred
142 access checking iff DEFER_P is true. */
145 push_deferring_access_checks (deferring_kind deferring)
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++;
153 deferred_access *ptr;
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;
161 /* Resume deferring access checks again after we stopped doing
165 resume_deferring_access_checks (void)
167 if (!deferred_access_no_check)
168 VEC_last (deferred_access, deferred_access_stack)
169 ->deferring_access_checks_kind = dk_deferred;
172 /* Stop deferring access checks. */
175 stop_deferring_access_checks (void)
177 if (!deferred_access_no_check)
178 VEC_last (deferred_access, deferred_access_stack)
179 ->deferring_access_checks_kind = dk_no_deferred;
182 /* Discard the current deferred access checks and restore the
186 pop_deferring_access_checks (void)
188 if (deferred_access_no_check)
189 deferred_access_no_check--;
191 VEC_pop (deferred_access, deferred_access_stack);
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.
199 VEC (deferred_access_check,gc)*
200 get_deferred_access_checks (void)
202 if (deferred_access_no_check)
205 return (VEC_last (deferred_access, deferred_access_stack)
206 ->deferred_access_checks);
209 /* Take current deferred checks and combine with the
210 previous states if we also defer checks previously.
211 Otherwise perform checks now. */
214 pop_to_parent_deferring_access_checks (void)
216 if (deferred_access_no_check)
217 deferred_access_no_check--;
220 VEC (deferred_access_check,gc) *checks;
221 deferred_access *ptr;
223 checks = (VEC_last (deferred_access, deferred_access_stack)
224 ->deferred_access_checks);
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)
231 perform_access_checks (checks);
235 /* Merge with parent. */
237 deferred_access_check *chk, *probe;
240 VEC_iterate (deferred_access_check, checks, i, chk) ;
244 VEC_iterate (deferred_access_check,
245 ptr->deferred_access_checks, j, probe) ;
248 if (probe->binfo == chk->binfo &&
249 probe->decl == chk->decl &&
250 probe->diag_decl == chk->diag_decl)
253 /* Insert into parent's checks. */
254 VEC_safe_push (deferred_access_check, gc,
255 ptr->deferred_access_checks, chk);
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. */
267 perform_access_checks (VEC (deferred_access_check,gc)* checks)
270 deferred_access_check *chk;
275 for (i = 0 ; VEC_iterate (deferred_access_check, checks, i, chk) ; ++i)
276 enforce_access (chk->binfo, chk->decl, chk->diag_decl);
279 /* Perform the deferred access checks.
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.
290 A::X A::a, x; // No error for `A::a', error for `x'
292 We have to perform deferred access of `A::X', first with `A::a',
296 perform_deferred_access_checks (void)
298 perform_access_checks (get_deferred_access_checks ());
301 /* Defer checking the accessibility of DECL, when looked up in
302 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */
305 perform_or_defer_access_check (tree binfo, tree decl, tree diag_decl)
308 deferred_access *ptr;
309 deferred_access_check *chk;
310 deferred_access_check *new_access;
313 /* Exit if we are in a context that no access checking is performed.
315 if (deferred_access_no_check)
318 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
320 ptr = VEC_last (deferred_access, deferred_access_stack);
322 /* If we are not supposed to defer access checks, just check now. */
323 if (ptr->deferring_access_checks_kind == dk_no_deferred)
325 enforce_access (binfo, decl, diag_decl);
329 /* See if we are already going to perform this check. */
331 VEC_iterate (deferred_access_check,
332 ptr->deferred_access_checks, i, chk) ;
335 if (chk->decl == decl && chk->binfo == binfo &&
336 chk->diag_decl == diag_decl)
341 /* If not, record the check. */
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;
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. */
355 stmts_are_full_exprs_p (void)
357 return current_stmt_tree ()->stmts_are_full_exprs_p;
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
367 enum tree_code code = TREE_CODE (t);
369 if (EXPR_P (t) && code != LABEL_EXPR)
371 if (!EXPR_HAS_LOCATION (t))
372 SET_EXPR_LOCATION (t, input_location);
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 ();
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);
386 /* Returns the stmt_tree (if any) to which statements are currently
387 being added. If there is no active statement-tree, NULL is
391 current_stmt_tree (void)
394 ? &cfun->language->base.x_stmt_tree
395 : &scope_chain->x_stmt_tree);
398 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
401 maybe_cleanup_point_expr (tree expr)
403 if (!processing_template_decl && stmts_are_full_exprs_p ())
404 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
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. */
414 maybe_cleanup_point_expr_void (tree expr)
416 if (!processing_template_decl && stmts_are_full_exprs_p ())
417 expr = fold_build_cleanup_point_expr (void_type_node, expr);
423 /* Create a declaration statement for the declaration given by the DECL. */
426 add_decl_expr (tree decl)
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);
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]. */
440 anon_aggr_type_p (tree node)
442 return ANON_AGGR_TYPE_P (node);
445 /* Finish a scope. */
448 do_poplevel (tree stmt_list)
452 if (stmts_are_full_exprs_p ())
453 block = poplevel (kept_level_p (), 1, 0);
455 stmt_list = pop_stmt_list (stmt_list);
457 if (!processing_template_decl)
459 stmt_list = c_build_bind_expr (block, stmt_list);
460 /* ??? See c_end_compound_stmt re statement expressions. */
466 /* Begin a new scope. */
469 do_pushlevel (scope_kind sk)
471 tree ret = push_stmt_list ();
472 if (stmts_are_full_exprs_p ())
473 begin_scope (sk, NULL);
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. */
482 push_cleanup (tree decl, tree cleanup, bool eh_only)
484 tree stmt = build_stmt (CLEANUP_STMT, NULL, cleanup, decl);
485 CLEANUP_EH_ONLY (stmt) = eh_only;
487 CLEANUP_BODY (stmt) = push_stmt_list ();
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. */
496 begin_cond (tree *cond_p)
498 if (processing_template_decl)
499 *cond_p = push_stmt_list ();
502 /* Finish such a conditional. */
505 finish_cond (tree *cond_p, tree expr)
507 if (processing_template_decl)
509 tree cond = pop_stmt_list (*cond_p);
510 if (TREE_CODE (cond) == DECL_EXPR)
516 /* If *COND_P specifies a conditional with a declaration, transform the
519 for (; A x = 42;) { }
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. */
527 simplify_loop_decl_cond (tree *cond_p, tree body)
531 if (!TREE_SIDE_EFFECTS (body))
535 *cond_p = boolean_true_node;
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);
545 /* Finish a goto-statement. */
548 finish_goto_stmt (tree destination)
550 if (TREE_CODE (destination) == IDENTIFIER_NODE)
551 destination = lookup_label (destination);
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;
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;
569 check_goto (destination);
571 return add_stmt (build_stmt (GOTO_EXPR, destination));
574 /* COND is the condition-expression for an if, while, etc.,
575 statement. Convert it to a boolean value, if appropriate. */
578 maybe_convert_cond (tree cond)
580 /* Empty conditions remain empty. */
584 /* Wait until we instantiate templates before doing conversion. */
585 if (processing_template_decl)
588 /* Do the conversion. */
589 cond = convert_from_reference (cond);
590 return condition_conversion (cond);
593 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
596 finish_expr_stmt (tree expr)
600 if (expr != NULL_TREE)
602 if (!processing_template_decl)
604 if (warn_sequence_point)
605 verify_sequence_points (expr);
606 expr = convert_to_void (expr, "statement");
608 else if (!type_dependent_expression_p (expr))
609 convert_to_void (build_non_dependent_expr (expr), "statement");
611 /* Simplification of inner statement expressions, compound exprs,
612 etc can result in us already having an EXPR_STMT. */
613 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
615 if (TREE_CODE (expr) != EXPR_STMT)
616 expr = build_stmt (EXPR_STMT, expr);
617 expr = maybe_cleanup_point_expr_void (expr);
629 /* Begin an if-statement. Returns a newly created IF_STMT if
636 scope = do_pushlevel (sk_block);
637 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
638 TREE_CHAIN (r) = scope;
639 begin_cond (&IF_COND (r));
643 /* Process the COND of an if-statement, which may be given by
647 finish_if_stmt_cond (tree cond, tree if_stmt)
649 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
651 THEN_CLAUSE (if_stmt) = push_stmt_list ();
654 /* Finish the then-clause of an if-statement, which may be given by
658 finish_then_clause (tree if_stmt)
660 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
664 /* Begin the else-clause of an if-statement. */
667 begin_else_clause (tree if_stmt)
669 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
672 /* Finish the else-clause of an if-statement, which may be given by
676 finish_else_clause (tree if_stmt)
678 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
681 /* Finish an if-statement. */
684 finish_if_stmt (tree if_stmt)
686 tree scope = TREE_CHAIN (if_stmt);
687 TREE_CHAIN (if_stmt) = NULL;
688 add_stmt (do_poplevel (scope));
690 empty_body_warning (THEN_CLAUSE (if_stmt), ELSE_CLAUSE (if_stmt));
693 /* Begin a while-statement. Returns a newly created WHILE_STMT if
697 begin_while_stmt (void)
700 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
702 WHILE_BODY (r) = do_pushlevel (sk_block);
703 begin_cond (&WHILE_COND (r));
707 /* Process the COND of a while-statement, which may be given by
711 finish_while_stmt_cond (tree cond, tree while_stmt)
713 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
714 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
717 /* Finish a while-statement, which may be given by WHILE_STMT. */
720 finish_while_stmt (tree while_stmt)
722 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
726 /* Begin a do-statement. Returns a newly created DO_STMT if
732 tree r = build_stmt (DO_STMT, NULL_TREE, NULL_TREE);
734 DO_BODY (r) = push_stmt_list ();
738 /* Finish the body of a do-statement, which may be given by DO_STMT. */
741 finish_do_body (tree do_stmt)
743 DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
746 /* Finish a do-statement, which may be given by DO_STMT, and whose
747 COND is as indicated. */
750 finish_do_stmt (tree cond, tree do_stmt)
752 cond = maybe_convert_cond (cond);
753 DO_COND (do_stmt) = cond;
757 /* Finish a return-statement. The EXPRESSION returned, if any, is as
761 finish_return_stmt (tree expr)
766 expr = check_return_expr (expr, &no_warning);
768 if (flag_openmp && !check_omp_return ())
769 return error_mark_node;
770 if (!processing_template_decl)
772 if (DECL_DESTRUCTOR_P (current_function_decl)
773 || (DECL_CONSTRUCTOR_P (current_function_decl)
774 && targetm.cxx.cdtor_returns_this ()))
776 /* Similarly, all destructors must run destructors for
777 base-classes before returning. So, all returns in a
778 destructor get sent to the DTOR_LABEL; finish_function emits
779 code to return a value there. */
780 return finish_goto_stmt (cdtor_label);
784 r = build_stmt (RETURN_EXPR, expr);
785 TREE_NO_WARNING (r) |= no_warning;
786 r = maybe_cleanup_point_expr_void (r);
793 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
796 begin_for_stmt (void)
800 r = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE,
801 NULL_TREE, NULL_TREE);
803 if (flag_new_for_scope > 0)
804 TREE_CHAIN (r) = do_pushlevel (sk_for);
806 if (processing_template_decl)
807 FOR_INIT_STMT (r) = push_stmt_list ();
812 /* Finish the for-init-statement of a for-statement, which may be
813 given by FOR_STMT. */
816 finish_for_init_stmt (tree for_stmt)
818 if (processing_template_decl)
819 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
821 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
822 begin_cond (&FOR_COND (for_stmt));
825 /* Finish the COND of a for-statement, which may be given by
829 finish_for_cond (tree cond, tree for_stmt)
831 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
832 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
835 /* Finish the increment-EXPRESSION in a for-statement, which may be
836 given by FOR_STMT. */
839 finish_for_expr (tree expr, tree for_stmt)
843 /* If EXPR is an overloaded function, issue an error; there is no
844 context available to use to perform overload resolution. */
845 if (type_unknown_p (expr))
847 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
848 expr = error_mark_node;
850 if (!processing_template_decl)
852 if (warn_sequence_point)
853 verify_sequence_points (expr);
854 expr = convert_to_void (expr, "3rd expression in for");
856 else if (!type_dependent_expression_p (expr))
857 convert_to_void (build_non_dependent_expr (expr), "3rd expression in for");
858 expr = maybe_cleanup_point_expr_void (expr);
859 FOR_EXPR (for_stmt) = expr;
862 /* Finish the body of a for-statement, which may be given by
863 FOR_STMT. The increment-EXPR for the loop must be
867 finish_for_stmt (tree for_stmt)
869 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
871 /* Pop the scope for the body of the loop. */
872 if (flag_new_for_scope > 0)
874 tree scope = TREE_CHAIN (for_stmt);
875 TREE_CHAIN (for_stmt) = NULL;
876 add_stmt (do_poplevel (scope));
882 /* Finish a break-statement. */
885 finish_break_stmt (void)
887 return add_stmt (build_stmt (BREAK_STMT));
890 /* Finish a continue-statement. */
893 finish_continue_stmt (void)
895 return add_stmt (build_stmt (CONTINUE_STMT));
898 /* Begin a switch-statement. Returns a new SWITCH_STMT if
902 begin_switch_stmt (void)
906 r = build_stmt (SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
908 scope = do_pushlevel (sk_block);
909 TREE_CHAIN (r) = scope;
910 begin_cond (&SWITCH_STMT_COND (r));
915 /* Finish the cond of a switch-statement. */
918 finish_switch_cond (tree cond, tree switch_stmt)
920 tree orig_type = NULL;
921 if (!processing_template_decl)
925 /* Convert the condition to an integer or enumeration type. */
926 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
927 if (cond == NULL_TREE)
929 error ("switch quantity not an integer");
930 cond = error_mark_node;
932 orig_type = TREE_TYPE (cond);
933 if (cond != error_mark_node)
937 Integral promotions are performed. */
938 cond = perform_integral_promotions (cond);
939 cond = maybe_cleanup_point_expr (cond);
942 if (cond != error_mark_node)
944 index = get_unwidened (cond, NULL_TREE);
945 /* We can't strip a conversion from a signed type to an unsigned,
946 because if we did, int_fits_type_p would do the wrong thing
947 when checking case values for being in range,
948 and it's too hard to do the right thing. */
949 if (TYPE_UNSIGNED (TREE_TYPE (cond))
950 == TYPE_UNSIGNED (TREE_TYPE (index)))
954 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
955 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
956 add_stmt (switch_stmt);
957 push_switch (switch_stmt);
958 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
961 /* Finish the body of a switch-statement, which may be given by
962 SWITCH_STMT. The COND to switch on is indicated. */
965 finish_switch_stmt (tree switch_stmt)
969 SWITCH_STMT_BODY (switch_stmt) =
970 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
974 scope = TREE_CHAIN (switch_stmt);
975 TREE_CHAIN (switch_stmt) = NULL;
976 add_stmt (do_poplevel (scope));
979 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
983 begin_try_block (void)
985 tree r = build_stmt (TRY_BLOCK, NULL_TREE, NULL_TREE);
987 TRY_STMTS (r) = push_stmt_list ();
991 /* Likewise, for a function-try-block. The block returned in
992 *COMPOUND_STMT is an artificial outer scope, containing the
993 function-try-block. */
996 begin_function_try_block (tree *compound_stmt)
999 /* This outer scope does not exist in the C++ standard, but we need
1000 a place to put __FUNCTION__ and similar variables. */
1001 *compound_stmt = begin_compound_stmt (0);
1002 r = begin_try_block ();
1003 FN_TRY_BLOCK_P (r) = 1;
1007 /* Finish a try-block, which may be given by TRY_BLOCK. */
1010 finish_try_block (tree try_block)
1012 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1013 TRY_HANDLERS (try_block) = push_stmt_list ();
1016 /* Finish the body of a cleanup try-block, which may be given by
1020 finish_cleanup_try_block (tree try_block)
1022 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1025 /* Finish an implicitly generated try-block, with a cleanup is given
1029 finish_cleanup (tree cleanup, tree try_block)
1031 TRY_HANDLERS (try_block) = cleanup;
1032 CLEANUP_P (try_block) = 1;
1035 /* Likewise, for a function-try-block. */
1038 finish_function_try_block (tree try_block)
1040 finish_try_block (try_block);
1041 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1042 the try block, but moving it inside. */
1043 in_function_try_handler = 1;
1046 /* Finish a handler-sequence for a try-block, which may be given by
1050 finish_handler_sequence (tree try_block)
1052 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1053 check_handlers (TRY_HANDLERS (try_block));
1056 /* Finish the handler-seq for a function-try-block, given by
1057 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1058 begin_function_try_block. */
1061 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1063 in_function_try_handler = 0;
1064 finish_handler_sequence (try_block);
1065 finish_compound_stmt (compound_stmt);
1068 /* Begin a handler. Returns a HANDLER if appropriate. */
1071 begin_handler (void)
1075 r = build_stmt (HANDLER, NULL_TREE, NULL_TREE);
1078 /* Create a binding level for the eh_info and the exception object
1080 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1085 /* Finish the handler-parameters for a handler, which may be given by
1086 HANDLER. DECL is the declaration for the catch parameter, or NULL
1087 if this is a `catch (...)' clause. */
1090 finish_handler_parms (tree decl, tree handler)
1092 tree type = NULL_TREE;
1093 if (processing_template_decl)
1097 decl = pushdecl (decl);
1098 decl = push_template_decl (decl);
1099 HANDLER_PARMS (handler) = decl;
1100 type = TREE_TYPE (decl);
1104 type = expand_start_catch_block (decl);
1105 HANDLER_TYPE (handler) = type;
1106 if (!processing_template_decl && type)
1107 mark_used (eh_type_info (type));
1110 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1111 the return value from the matching call to finish_handler_parms. */
1114 finish_handler (tree handler)
1116 if (!processing_template_decl)
1117 expand_end_catch_block ();
1118 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1121 /* Begin a compound statement. FLAGS contains some bits that control the
1122 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1123 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1124 block of a function. If BCS_TRY_BLOCK is set, this is the block
1125 created on behalf of a TRY statement. Returns a token to be passed to
1126 finish_compound_stmt. */
1129 begin_compound_stmt (unsigned int flags)
1133 if (flags & BCS_NO_SCOPE)
1135 r = push_stmt_list ();
1136 STATEMENT_LIST_NO_SCOPE (r) = 1;
1138 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1139 But, if it's a statement-expression with a scopeless block, there's
1140 nothing to keep, and we don't want to accidentally keep a block
1141 *inside* the scopeless block. */
1142 keep_next_level (false);
1145 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1147 /* When processing a template, we need to remember where the braces were,
1148 so that we can set up identical scopes when instantiating the template
1149 later. BIND_EXPR is a handy candidate for this.
1150 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1151 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1152 processing templates. */
1153 if (processing_template_decl)
1155 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1156 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1157 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1158 TREE_SIDE_EFFECTS (r) = 1;
1164 /* Finish a compound-statement, which is given by STMT. */
1167 finish_compound_stmt (tree stmt)
1169 if (TREE_CODE (stmt) == BIND_EXPR)
1170 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1171 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1172 stmt = pop_stmt_list (stmt);
1175 /* Destroy any ObjC "super" receivers that may have been
1177 objc_clear_super_receiver ();
1179 stmt = do_poplevel (stmt);
1182 /* ??? See c_end_compound_stmt wrt statement expressions. */
1187 /* Finish an asm-statement, whose components are a STRING, some
1188 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1189 whether the asm-statement should be considered volatile. */
1192 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1193 tree input_operands, tree clobbers)
1197 int ninputs = list_length (input_operands);
1198 int noutputs = list_length (output_operands);
1200 if (!processing_template_decl)
1202 const char *constraint;
1203 const char **oconstraints;
1204 bool allows_mem, allows_reg, is_inout;
1208 oconstraints = (const char **) alloca (noutputs * sizeof (char *));
1210 string = resolve_asm_operand_names (string, output_operands,
1213 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1215 operand = TREE_VALUE (t);
1217 /* ??? Really, this should not be here. Users should be using a
1218 proper lvalue, dammit. But there's a long history of using
1219 casts in the output operands. In cases like longlong.h, this
1220 becomes a primitive form of typechecking -- if the cast can be
1221 removed, then the output operand had a type of the proper width;
1222 otherwise we'll get an error. Gross, but ... */
1223 STRIP_NOPS (operand);
1225 if (!lvalue_or_else (operand, lv_asm))
1226 operand = error_mark_node;
1228 if (operand != error_mark_node
1229 && (TREE_READONLY (operand)
1230 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1231 /* Functions are not modifiable, even though they are
1233 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1234 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1235 /* If it's an aggregate and any field is const, then it is
1236 effectively const. */
1237 || (CLASS_TYPE_P (TREE_TYPE (operand))
1238 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1239 readonly_error (operand, "assignment (via 'asm' output)", 0);
1241 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1242 oconstraints[i] = constraint;
1244 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1245 &allows_mem, &allows_reg, &is_inout))
1247 /* If the operand is going to end up in memory,
1248 mark it addressable. */
1249 if (!allows_reg && !cxx_mark_addressable (operand))
1250 operand = error_mark_node;
1253 operand = error_mark_node;
1255 TREE_VALUE (t) = operand;
1258 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1260 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1261 operand = decay_conversion (TREE_VALUE (t));
1263 /* If the type of the operand hasn't been determined (e.g.,
1264 because it involves an overloaded function), then issue
1265 an error message. There's no context available to
1266 resolve the overloading. */
1267 if (TREE_TYPE (operand) == unknown_type_node)
1269 error ("type of asm operand %qE could not be determined",
1271 operand = error_mark_node;
1274 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1275 oconstraints, &allows_mem, &allows_reg))
1277 /* If the operand is going to end up in memory,
1278 mark it addressable. */
1279 if (!allows_reg && allows_mem)
1281 /* Strip the nops as we allow this case. FIXME, this really
1282 should be rejected or made deprecated. */
1283 STRIP_NOPS (operand);
1284 if (!cxx_mark_addressable (operand))
1285 operand = error_mark_node;
1289 operand = error_mark_node;
1291 TREE_VALUE (t) = operand;
1295 r = build_stmt (ASM_EXPR, string,
1296 output_operands, input_operands,
1298 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1299 r = maybe_cleanup_point_expr_void (r);
1300 return add_stmt (r);
1303 /* Finish a label with the indicated NAME. */
1306 finish_label_stmt (tree name)
1308 tree decl = define_label (input_location, name);
1310 if (decl == error_mark_node)
1311 return error_mark_node;
1313 return add_stmt (build_stmt (LABEL_EXPR, decl));
1316 /* Finish a series of declarations for local labels. G++ allows users
1317 to declare "local" labels, i.e., labels with scope. This extension
1318 is useful when writing code involving statement-expressions. */
1321 finish_label_decl (tree name)
1323 tree decl = declare_local_label (name);
1324 add_decl_expr (decl);
1327 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1330 finish_decl_cleanup (tree decl, tree cleanup)
1332 push_cleanup (decl, cleanup, false);
1335 /* If the current scope exits with an exception, run CLEANUP. */
1338 finish_eh_cleanup (tree cleanup)
1340 push_cleanup (NULL, cleanup, true);
1343 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1344 order they were written by the user. Each node is as for
1345 emit_mem_initializers. */
1348 finish_mem_initializers (tree mem_inits)
1350 /* Reorder the MEM_INITS so that they are in the order they appeared
1351 in the source program. */
1352 mem_inits = nreverse (mem_inits);
1354 if (processing_template_decl)
1355 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1357 emit_mem_initializers (mem_inits);
1360 /* Finish a parenthesized expression EXPR. */
1363 finish_parenthesized_expr (tree expr)
1366 /* This inhibits warnings in c_common_truthvalue_conversion. */
1367 TREE_NO_WARNING (expr) = 1;
1369 if (TREE_CODE (expr) == OFFSET_REF)
1370 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1371 enclosed in parentheses. */
1372 PTRMEM_OK_P (expr) = 0;
1374 if (TREE_CODE (expr) == STRING_CST)
1375 PAREN_STRING_LITERAL_P (expr) = 1;
1380 /* Finish a reference to a non-static data member (DECL) that is not
1381 preceded by `.' or `->'. */
1384 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1386 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1390 if (current_function_decl
1391 && DECL_STATIC_FUNCTION_P (current_function_decl))
1392 error ("invalid use of member %q+D in static member function", decl);
1394 error ("invalid use of non-static data member %q+D", decl);
1395 error ("from this location");
1397 return error_mark_node;
1399 TREE_USED (current_class_ptr) = 1;
1400 if (processing_template_decl && !qualifying_scope)
1402 tree type = TREE_TYPE (decl);
1404 if (TREE_CODE (type) == REFERENCE_TYPE)
1405 type = TREE_TYPE (type);
1408 /* Set the cv qualifiers. */
1409 int quals = cp_type_quals (TREE_TYPE (current_class_ref));
1411 if (DECL_MUTABLE_P (decl))
1412 quals &= ~TYPE_QUAL_CONST;
1414 quals |= cp_type_quals (TREE_TYPE (decl));
1415 type = cp_build_qualified_type (type, quals);
1418 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1422 tree access_type = TREE_TYPE (object);
1423 tree lookup_context = context_for_name_lookup (decl);
1425 while (!DERIVED_FROM_P (lookup_context, access_type))
1427 access_type = TYPE_CONTEXT (access_type);
1428 while (access_type && DECL_P (access_type))
1429 access_type = DECL_CONTEXT (access_type);
1433 error ("object missing in reference to %q+D", decl);
1434 error ("from this location");
1435 return error_mark_node;
1439 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1440 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1442 if (processing_template_decl)
1443 return build_qualified_name (TREE_TYPE (decl),
1446 /*template_p=*/false);
1448 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1451 /* If the data member was named `C::M', convert `*this' to `C'
1453 if (qualifying_scope)
1455 tree binfo = NULL_TREE;
1456 object = build_scoped_ref (object, qualifying_scope,
1460 return build_class_member_access_expr (object, decl,
1461 /*access_path=*/NULL_TREE,
1462 /*preserve_reference=*/false);
1466 /* DECL was the declaration to which a qualified-id resolved. Issue
1467 an error message if it is not accessible. If OBJECT_TYPE is
1468 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1469 type of `*x', or `x', respectively. If the DECL was named as
1470 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1473 check_accessibility_of_qualified_id (tree decl,
1475 tree nested_name_specifier)
1478 tree qualifying_type = NULL_TREE;
1480 /* If we're not checking, return immediately. */
1481 if (deferred_access_no_check)
1484 /* Determine the SCOPE of DECL. */
1485 scope = context_for_name_lookup (decl);
1486 /* If the SCOPE is not a type, then DECL is not a member. */
1487 if (!TYPE_P (scope))
1489 /* Compute the scope through which DECL is being accessed. */
1491 /* OBJECT_TYPE might not be a class type; consider:
1493 class A { typedef int I; };
1497 In this case, we will have "A::I" as the DECL, but "I" as the
1499 && CLASS_TYPE_P (object_type)
1500 && DERIVED_FROM_P (scope, object_type))
1501 /* If we are processing a `->' or `.' expression, use the type of the
1503 qualifying_type = object_type;
1504 else if (nested_name_specifier)
1506 /* If the reference is to a non-static member of the
1507 current class, treat it as if it were referenced through
1509 if (DECL_NONSTATIC_MEMBER_P (decl)
1510 && current_class_ptr
1511 && DERIVED_FROM_P (scope, current_class_type))
1512 qualifying_type = current_class_type;
1513 /* Otherwise, use the type indicated by the
1514 nested-name-specifier. */
1516 qualifying_type = nested_name_specifier;
1519 /* Otherwise, the name must be from the current class or one of
1521 qualifying_type = currently_open_derived_class (scope);
1524 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1525 or similar in a default argument value. */
1526 && CLASS_TYPE_P (qualifying_type)
1527 && !dependent_type_p (qualifying_type))
1528 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1532 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1533 class named to the left of the "::" operator. DONE is true if this
1534 expression is a complete postfix-expression; it is false if this
1535 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1536 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1537 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1538 is true iff this qualified name appears as a template argument. */
1541 finish_qualified_id_expr (tree qualifying_class,
1546 bool template_arg_p)
1548 gcc_assert (TYPE_P (qualifying_class));
1550 if (error_operand_p (expr))
1551 return error_mark_node;
1553 if (DECL_P (expr) || BASELINK_P (expr))
1557 check_template_keyword (expr);
1559 /* If EXPR occurs as the operand of '&', use special handling that
1560 permits a pointer-to-member. */
1561 if (address_p && done)
1563 if (TREE_CODE (expr) == SCOPE_REF)
1564 expr = TREE_OPERAND (expr, 1);
1565 expr = build_offset_ref (qualifying_class, expr,
1566 /*address_p=*/true);
1570 /* Within the scope of a class, turn references to non-static
1571 members into expression of the form "this->...". */
1573 /* But, within a template argument, we do not want make the
1574 transformation, as there is no "this" pointer. */
1576 else if (TREE_CODE (expr) == FIELD_DECL)
1577 expr = finish_non_static_data_member (expr, current_class_ref,
1579 else if (BASELINK_P (expr) && !processing_template_decl)
1583 /* See if any of the functions are non-static members. */
1584 fns = BASELINK_FUNCTIONS (expr);
1585 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1586 fns = TREE_OPERAND (fns, 0);
1587 /* If so, the expression may be relative to the current
1589 if (!shared_member_p (fns)
1590 && current_class_type
1591 && DERIVED_FROM_P (qualifying_class, current_class_type))
1592 expr = (build_class_member_access_expr
1593 (maybe_dummy_object (qualifying_class, NULL),
1595 BASELINK_ACCESS_BINFO (expr),
1596 /*preserve_reference=*/false));
1598 /* The expression is a qualified name whose address is not
1600 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1606 /* Begin a statement-expression. The value returned must be passed to
1607 finish_stmt_expr. */
1610 begin_stmt_expr (void)
1612 return push_stmt_list ();
1615 /* Process the final expression of a statement expression. EXPR can be
1616 NULL, if the final expression is empty. Return a STATEMENT_LIST
1617 containing all the statements in the statement-expression, or
1618 ERROR_MARK_NODE if there was an error. */
1621 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1623 if (error_operand_p (expr))
1624 return error_mark_node;
1626 /* If the last statement does not have "void" type, then the value
1627 of the last statement is the value of the entire expression. */
1630 tree type = TREE_TYPE (expr);
1632 if (processing_template_decl)
1634 expr = build_stmt (EXPR_STMT, expr);
1635 expr = add_stmt (expr);
1636 /* Mark the last statement so that we can recognize it as such at
1637 template-instantiation time. */
1638 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1640 else if (VOID_TYPE_P (type))
1642 /* Just treat this like an ordinary statement. */
1643 expr = finish_expr_stmt (expr);
1647 /* It actually has a value we need to deal with. First, force it
1648 to be an rvalue so that we won't need to build up a copy
1649 constructor call later when we try to assign it to something. */
1650 expr = force_rvalue (expr);
1651 if (error_operand_p (expr))
1652 return error_mark_node;
1654 /* Update for array-to-pointer decay. */
1655 type = TREE_TYPE (expr);
1657 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1658 normal statement, but don't convert to void or actually add
1660 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1661 expr = maybe_cleanup_point_expr (expr);
1665 /* The type of the statement-expression is the type of the last
1667 TREE_TYPE (stmt_expr) = type;
1673 /* Finish a statement-expression. EXPR should be the value returned
1674 by the previous begin_stmt_expr. Returns an expression
1675 representing the statement-expression. */
1678 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1683 if (error_operand_p (stmt_expr))
1684 return error_mark_node;
1686 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1688 type = TREE_TYPE (stmt_expr);
1689 result = pop_stmt_list (stmt_expr);
1690 TREE_TYPE (result) = type;
1692 if (processing_template_decl)
1694 result = build_min (STMT_EXPR, type, result);
1695 TREE_SIDE_EFFECTS (result) = 1;
1696 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1698 else if (CLASS_TYPE_P (type))
1700 /* Wrap the statement-expression in a TARGET_EXPR so that the
1701 temporary object created by the final expression is destroyed at
1702 the end of the full-expression containing the
1703 statement-expression. */
1704 result = force_target_expr (type, result);
1710 /* Perform Koenig lookup. FN is the postfix-expression representing
1711 the function (or functions) to call; ARGS are the arguments to the
1712 call. Returns the functions to be considered by overload
1716 perform_koenig_lookup (tree fn, tree args)
1718 tree identifier = NULL_TREE;
1719 tree functions = NULL_TREE;
1721 /* Find the name of the overloaded function. */
1722 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1724 else if (is_overloaded_fn (fn))
1727 identifier = DECL_NAME (get_first_fn (functions));
1729 else if (DECL_P (fn))
1732 identifier = DECL_NAME (fn);
1735 /* A call to a namespace-scope function using an unqualified name.
1737 Do Koenig lookup -- unless any of the arguments are
1739 if (!any_type_dependent_arguments_p (args))
1741 fn = lookup_arg_dependent (identifier, functions, args);
1743 /* The unqualified name could not be resolved. */
1744 fn = unqualified_fn_lookup_error (identifier);
1750 /* Generate an expression for `FN (ARGS)'.
1752 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1753 as a virtual call, even if FN is virtual. (This flag is set when
1754 encountering an expression where the function name is explicitly
1755 qualified. For example a call to `X::f' never generates a virtual
1758 Returns code for the call. */
1761 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p)
1767 if (fn == error_mark_node || args == error_mark_node)
1768 return error_mark_node;
1770 /* ARGS should be a list of arguments. */
1771 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1772 gcc_assert (!TYPE_P (fn));
1777 if (processing_template_decl)
1779 if (type_dependent_expression_p (fn)
1780 || any_type_dependent_arguments_p (args))
1782 result = build_nt (CALL_EXPR, fn, args, NULL_TREE);
1783 KOENIG_LOOKUP_P (result) = koenig_p;
1786 if (!BASELINK_P (fn)
1787 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1788 && TREE_TYPE (fn) != unknown_type_node)
1789 fn = build_non_dependent_expr (fn);
1790 args = build_non_dependent_args (orig_args);
1793 if (is_overloaded_fn (fn))
1794 fn = baselink_for_fns (fn);
1797 if (BASELINK_P (fn))
1801 /* A call to a member function. From [over.call.func]:
1803 If the keyword this is in scope and refers to the class of
1804 that member function, or a derived class thereof, then the
1805 function call is transformed into a qualified function call
1806 using (*this) as the postfix-expression to the left of the
1807 . operator.... [Otherwise] a contrived object of type T
1808 becomes the implied object argument.
1810 This paragraph is unclear about this situation:
1812 struct A { void f(); };
1813 struct B : public A {};
1814 struct C : public A { void g() { B::f(); }};
1816 In particular, for `B::f', this paragraph does not make clear
1817 whether "the class of that member function" refers to `A' or
1818 to `B'. We believe it refers to `B'. */
1819 if (current_class_type
1820 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1822 && current_class_ref)
1823 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1827 tree representative_fn;
1829 representative_fn = BASELINK_FUNCTIONS (fn);
1830 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1831 representative_fn = TREE_OPERAND (representative_fn, 0);
1832 representative_fn = get_first_fn (representative_fn);
1833 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1836 if (processing_template_decl)
1838 if (type_dependent_expression_p (object))
1839 return build_nt (CALL_EXPR, orig_fn, orig_args, NULL_TREE);
1840 object = build_non_dependent_expr (object);
1843 result = build_new_method_call (object, fn, args, NULL_TREE,
1845 ? LOOKUP_NONVIRTUAL : 0),
1848 else if (is_overloaded_fn (fn))
1850 /* If the function is an overloaded builtin, resolve it. */
1851 if (TREE_CODE (fn) == FUNCTION_DECL
1852 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
1853 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
1854 result = resolve_overloaded_builtin (fn, args);
1857 /* A call to a namespace-scope function. */
1858 result = build_new_function_call (fn, args, koenig_p);
1860 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1863 error ("arguments to destructor are not allowed");
1864 /* Mark the pseudo-destructor call as having side-effects so
1865 that we do not issue warnings about its use. */
1866 result = build1 (NOP_EXPR,
1868 TREE_OPERAND (fn, 0));
1869 TREE_SIDE_EFFECTS (result) = 1;
1871 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1872 /* If the "function" is really an object of class type, it might
1873 have an overloaded `operator ()'. */
1874 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1875 /*overloaded_p=*/NULL);
1878 /* A call where the function is unknown. */
1879 result = build_function_call (fn, args);
1881 if (processing_template_decl)
1883 result = build3 (CALL_EXPR, TREE_TYPE (result), orig_fn,
1884 orig_args, NULL_TREE);
1885 KOENIG_LOOKUP_P (result) = koenig_p;
1890 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1891 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1892 POSTDECREMENT_EXPR.) */
1895 finish_increment_expr (tree expr, enum tree_code code)
1897 return build_x_unary_op (code, expr);
1900 /* Finish a use of `this'. Returns an expression for `this'. */
1903 finish_this_expr (void)
1907 if (current_class_ptr)
1909 result = current_class_ptr;
1911 else if (current_function_decl
1912 && DECL_STATIC_FUNCTION_P (current_function_decl))
1914 error ("%<this%> is unavailable for static member functions");
1915 result = error_mark_node;
1919 if (current_function_decl)
1920 error ("invalid use of %<this%> in non-member function");
1922 error ("invalid use of %<this%> at top level");
1923 result = error_mark_node;
1929 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
1930 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
1931 the TYPE for the type given. If SCOPE is non-NULL, the expression
1932 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
1935 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
1937 if (destructor == error_mark_node)
1938 return error_mark_node;
1940 gcc_assert (TYPE_P (destructor));
1942 if (!processing_template_decl)
1944 if (scope == error_mark_node)
1946 error ("invalid qualifying scope in pseudo-destructor name");
1947 return error_mark_node;
1949 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
1951 error ("qualified type %qT does not match destructor name ~%qT",
1953 return error_mark_node;
1957 /* [expr.pseudo] says both:
1959 The type designated by the pseudo-destructor-name shall be
1960 the same as the object type.
1964 The cv-unqualified versions of the object type and of the
1965 type designated by the pseudo-destructor-name shall be the
1968 We implement the more generous second sentence, since that is
1969 what most other compilers do. */
1970 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
1973 error ("%qE is not of type %qT", object, destructor);
1974 return error_mark_node;
1978 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
1981 /* Finish an expression of the form CODE EXPR. */
1984 finish_unary_op_expr (enum tree_code code, tree expr)
1986 tree result = build_x_unary_op (code, expr);
1987 /* Inside a template, build_x_unary_op does not fold the
1988 expression. So check whether the result is folded before
1989 setting TREE_NEGATED_INT. */
1990 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
1991 && TREE_CODE (result) == INTEGER_CST
1992 && !TYPE_UNSIGNED (TREE_TYPE (result))
1993 && INT_CST_LT (result, integer_zero_node))
1995 /* RESULT may be a cached INTEGER_CST, so we must copy it before
1996 setting TREE_NEGATED_INT. */
1997 result = copy_node (result);
1998 TREE_NEGATED_INT (result) = 1;
2000 overflow_warning (result);
2004 /* Finish a compound-literal expression. TYPE is the type to which
2005 the INITIALIZER_LIST is being cast. */
2008 finish_compound_literal (tree type, VEC(constructor_elt,gc) *initializer_list)
2011 tree compound_literal;
2013 if (!TYPE_OBJ_P (type))
2015 error ("compound literal of non-object type %qT", type);
2016 return error_mark_node;
2019 /* Build a CONSTRUCTOR for the INITIALIZER_LIST. */
2020 compound_literal = build_constructor (NULL_TREE, initializer_list);
2021 if (processing_template_decl)
2023 TREE_TYPE (compound_literal) = type;
2024 /* Mark the expression as a compound literal. */
2025 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2026 return compound_literal;
2029 /* Create a temporary variable to represent the compound literal. */
2030 var = create_temporary_var (type);
2031 if (!current_function_decl)
2033 /* If this compound-literal appears outside of a function, then
2034 the corresponding variable has static storage duration, just
2035 like the variable in whose initializer it appears. */
2036 TREE_STATIC (var) = 1;
2037 /* The variable has internal linkage, since there is no need to
2038 reference it from another translation unit. */
2039 TREE_PUBLIC (var) = 0;
2040 /* It must have a name, so that the name mangler can mangle it. */
2041 DECL_NAME (var) = make_anon_name ();
2043 /* We must call pushdecl, since the gimplifier complains if the
2044 variable has not been declared via a BIND_EXPR. */
2046 /* Initialize the variable as we would any other variable with a
2047 brace-enclosed initializer. */
2048 cp_finish_decl (var, compound_literal,
2049 /*init_const_expr_p=*/false,
2050 /*asmspec_tree=*/NULL_TREE,
2051 LOOKUP_ONLYCONVERTING);
2055 /* Return the declaration for the function-name variable indicated by
2059 finish_fname (tree id)
2063 decl = fname_decl (C_RID_CODE (id), id);
2064 if (processing_template_decl)
2065 decl = DECL_NAME (decl);
2069 /* Finish a translation unit. */
2072 finish_translation_unit (void)
2074 /* In case there were missing closebraces,
2075 get us back to the global binding level. */
2077 while (current_namespace != global_namespace)
2080 /* Do file scope __FUNCTION__ et al. */
2081 finish_fname_decls ();
2084 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2085 Returns the parameter. */
2088 finish_template_type_parm (tree aggr, tree identifier)
2090 if (aggr != class_type_node)
2092 pedwarn ("template type parameters must use the keyword %<class%> or %<typename%>");
2093 aggr = class_type_node;
2096 return build_tree_list (aggr, identifier);
2099 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2100 Returns the parameter. */
2103 finish_template_template_parm (tree aggr, tree identifier)
2105 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2106 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2107 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2108 DECL_TEMPLATE_RESULT (tmpl) = decl;
2109 DECL_ARTIFICIAL (decl) = 1;
2110 end_template_decl ();
2112 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2114 return finish_template_type_parm (aggr, tmpl);
2117 /* ARGUMENT is the default-argument value for a template template
2118 parameter. If ARGUMENT is invalid, issue error messages and return
2119 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2122 check_template_template_default_arg (tree argument)
2124 if (TREE_CODE (argument) != TEMPLATE_DECL
2125 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2126 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2128 if (TREE_CODE (argument) == TYPE_DECL)
2129 error ("invalid use of type %qT as a default value for a template "
2130 "template-parameter", TREE_TYPE (argument));
2132 error ("invalid default argument for a template template parameter");
2133 return error_mark_node;
2139 /* Begin a class definition, as indicated by T. */
2142 begin_class_definition (tree t, tree attributes)
2144 if (t == error_mark_node)
2145 return error_mark_node;
2147 if (processing_template_parmlist)
2149 error ("definition of %q#T inside template parameter list", t);
2150 return error_mark_node;
2152 /* A non-implicit typename comes from code like:
2154 template <typename T> struct A {
2155 template <typename U> struct A<T>::B ...
2157 This is erroneous. */
2158 else if (TREE_CODE (t) == TYPENAME_TYPE)
2160 error ("invalid definition of qualified type %qT", t);
2161 t = error_mark_node;
2164 if (t == error_mark_node || ! IS_AGGR_TYPE (t))
2166 t = make_aggr_type (RECORD_TYPE);
2167 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2170 /* Update the location of the decl. */
2171 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2173 if (TYPE_BEING_DEFINED (t))
2175 t = make_aggr_type (TREE_CODE (t));
2176 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2178 maybe_process_partial_specialization (t);
2180 TYPE_BEING_DEFINED (t) = 1;
2182 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2184 if (flag_pack_struct)
2187 TYPE_PACKED (t) = 1;
2188 /* Even though the type is being defined for the first time
2189 here, there might have been a forward declaration, so there
2190 might be cv-qualified variants of T. */
2191 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2192 TYPE_PACKED (v) = 1;
2194 /* Reset the interface data, at the earliest possible
2195 moment, as it might have been set via a class foo;
2197 if (! TYPE_ANONYMOUS_P (t))
2199 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2200 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2201 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2202 (t, finfo->interface_unknown);
2204 reset_specialization();
2206 /* Make a declaration for this class in its own scope. */
2207 build_self_reference ();
2212 /* Finish the member declaration given by DECL. */
2215 finish_member_declaration (tree decl)
2217 if (decl == error_mark_node || decl == NULL_TREE)
2220 if (decl == void_type_node)
2221 /* The COMPONENT was a friend, not a member, and so there's
2222 nothing for us to do. */
2225 /* We should see only one DECL at a time. */
2226 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2228 /* Set up access control for DECL. */
2230 = (current_access_specifier == access_private_node);
2231 TREE_PROTECTED (decl)
2232 = (current_access_specifier == access_protected_node);
2233 if (TREE_CODE (decl) == TEMPLATE_DECL)
2235 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2236 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2239 /* Mark the DECL as a member of the current class. */
2240 DECL_CONTEXT (decl) = current_class_type;
2244 A C language linkage is ignored for the names of class members
2245 and the member function type of class member functions. */
2246 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2247 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2249 /* Put functions on the TYPE_METHODS list and everything else on the
2250 TYPE_FIELDS list. Note that these are built up in reverse order.
2251 We reverse them (to obtain declaration order) in finish_struct. */
2252 if (TREE_CODE (decl) == FUNCTION_DECL
2253 || DECL_FUNCTION_TEMPLATE_P (decl))
2255 /* We also need to add this function to the
2256 CLASSTYPE_METHOD_VEC. */
2257 if (add_method (current_class_type, decl, NULL_TREE))
2259 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2260 TYPE_METHODS (current_class_type) = decl;
2262 maybe_add_class_template_decl_list (current_class_type, decl,
2266 /* Enter the DECL into the scope of the class. */
2267 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2268 || pushdecl_class_level (decl))
2270 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2271 go at the beginning. The reason is that lookup_field_1
2272 searches the list in order, and we want a field name to
2273 override a type name so that the "struct stat hack" will
2274 work. In particular:
2276 struct S { enum E { }; int E } s;
2279 is valid. In addition, the FIELD_DECLs must be maintained in
2280 declaration order so that class layout works as expected.
2281 However, we don't need that order until class layout, so we
2282 save a little time by putting FIELD_DECLs on in reverse order
2283 here, and then reversing them in finish_struct_1. (We could
2284 also keep a pointer to the correct insertion points in the
2287 if (TREE_CODE (decl) == TYPE_DECL)
2288 TYPE_FIELDS (current_class_type)
2289 = chainon (TYPE_FIELDS (current_class_type), decl);
2292 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2293 TYPE_FIELDS (current_class_type) = decl;
2296 maybe_add_class_template_decl_list (current_class_type, decl,
2301 note_decl_for_pch (decl);
2304 /* DECL has been declared while we are building a PCH file. Perform
2305 actions that we might normally undertake lazily, but which can be
2306 performed now so that they do not have to be performed in
2307 translation units which include the PCH file. */
2310 note_decl_for_pch (tree decl)
2312 gcc_assert (pch_file);
2314 /* There's a good chance that we'll have to mangle names at some
2315 point, even if only for emission in debugging information. */
2316 if ((TREE_CODE (decl) == VAR_DECL
2317 || TREE_CODE (decl) == FUNCTION_DECL)
2318 && !processing_template_decl)
2322 /* Finish processing a complete template declaration. The PARMS are
2323 the template parameters. */
2326 finish_template_decl (tree parms)
2329 end_template_decl ();
2331 end_specialization ();
2334 /* Finish processing a template-id (which names a type) of the form
2335 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2336 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2337 the scope of template-id indicated. */
2340 finish_template_type (tree name, tree args, int entering_scope)
2344 decl = lookup_template_class (name, args,
2345 NULL_TREE, NULL_TREE, entering_scope,
2346 tf_warning_or_error | tf_user);
2347 if (decl != error_mark_node)
2348 decl = TYPE_STUB_DECL (decl);
2353 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2354 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2355 BASE_CLASS, or NULL_TREE if an error occurred. The
2356 ACCESS_SPECIFIER is one of
2357 access_{default,public,protected_private}_node. For a virtual base
2358 we set TREE_TYPE. */
2361 finish_base_specifier (tree base, tree access, bool virtual_p)
2365 if (base == error_mark_node)
2367 error ("invalid base-class specification");
2370 else if (! is_aggr_type (base, 1))
2374 if (cp_type_quals (base) != 0)
2376 error ("base class %qT has cv qualifiers", base);
2377 base = TYPE_MAIN_VARIANT (base);
2379 result = build_tree_list (access, base);
2381 TREE_TYPE (result) = integer_type_node;
2387 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2388 what we found when we tried to do the lookup. */
2391 qualified_name_lookup_error (tree scope, tree name, tree decl)
2393 if (scope == error_mark_node)
2394 ; /* We already complained. */
2395 else if (TYPE_P (scope))
2397 if (!COMPLETE_TYPE_P (scope))
2398 error ("incomplete type %qT used in nested name specifier", scope);
2399 else if (TREE_CODE (decl) == TREE_LIST)
2401 error ("reference to %<%T::%D%> is ambiguous", scope, name);
2402 print_candidates (decl);
2405 error ("%qD is not a member of %qT", name, scope);
2407 else if (scope != global_namespace)
2408 error ("%qD is not a member of %qD", name, scope);
2410 error ("%<::%D%> has not been declared", name);
2413 /* If FNS is a member function, a set of member functions, or a
2414 template-id referring to one or more member functions, return a
2415 BASELINK for FNS, incorporating the current access context.
2416 Otherwise, return FNS unchanged. */
2419 baselink_for_fns (tree fns)
2424 if (BASELINK_P (fns)
2425 || error_operand_p (fns))
2429 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2430 fn = TREE_OPERAND (fn, 0);
2431 fn = get_first_fn (fn);
2432 if (!DECL_FUNCTION_MEMBER_P (fn))
2435 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2437 cl = DECL_CONTEXT (fn);
2438 cl = TYPE_BINFO (cl);
2439 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2442 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2443 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2444 if non-NULL, is the type or namespace used to explicitly qualify
2445 ID_EXPRESSION. DECL is the entity to which that name has been
2448 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2449 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2450 be set to true if this expression isn't permitted in a
2451 constant-expression, but it is otherwise not set by this function.
2452 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2453 constant-expression, but a non-constant expression is also
2456 DONE is true if this expression is a complete postfix-expression;
2457 it is false if this expression is followed by '->', '[', '(', etc.
2458 ADDRESS_P is true iff this expression is the operand of '&'.
2459 TEMPLATE_P is true iff the qualified-id was of the form
2460 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2461 appears as a template argument.
2463 If an error occurs, and it is the kind of error that might cause
2464 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2465 is the caller's responsibility to issue the message. *ERROR_MSG
2466 will be a string with static storage duration, so the caller need
2469 Return an expression for the entity, after issuing appropriate
2470 diagnostics. This function is also responsible for transforming a
2471 reference to a non-static member into a COMPONENT_REF that makes
2472 the use of "this" explicit.
2474 Upon return, *IDK will be filled in appropriately. */
2477 finish_id_expression (tree id_expression,
2481 bool integral_constant_expression_p,
2482 bool allow_non_integral_constant_expression_p,
2483 bool *non_integral_constant_expression_p,
2487 bool template_arg_p,
2488 const char **error_msg)
2490 /* Initialize the output parameters. */
2491 *idk = CP_ID_KIND_NONE;
2494 if (id_expression == error_mark_node)
2495 return error_mark_node;
2496 /* If we have a template-id, then no further lookup is
2497 required. If the template-id was for a template-class, we
2498 will sometimes have a TYPE_DECL at this point. */
2499 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2500 || TREE_CODE (decl) == TYPE_DECL)
2502 /* Look up the name. */
2505 if (decl == error_mark_node)
2507 /* Name lookup failed. */
2510 || (!dependent_type_p (scope)
2511 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2512 && IDENTIFIER_TYPENAME_P (id_expression)
2513 && dependent_type_p (TREE_TYPE (id_expression))))))
2515 /* If the qualifying type is non-dependent (and the name
2516 does not name a conversion operator to a dependent
2517 type), issue an error. */
2518 qualified_name_lookup_error (scope, id_expression, decl);
2519 return error_mark_node;
2523 /* It may be resolved via Koenig lookup. */
2524 *idk = CP_ID_KIND_UNQUALIFIED;
2525 return id_expression;
2528 decl = id_expression;
2530 /* If DECL is a variable that would be out of scope under
2531 ANSI/ISO rules, but in scope in the ARM, name lookup
2532 will succeed. Issue a diagnostic here. */
2534 decl = check_for_out_of_scope_variable (decl);
2536 /* Remember that the name was used in the definition of
2537 the current class so that we can check later to see if
2538 the meaning would have been different after the class
2539 was entirely defined. */
2540 if (!scope && decl != error_mark_node)
2541 maybe_note_name_used_in_class (id_expression, decl);
2543 /* Disallow uses of local variables from containing functions. */
2544 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2546 tree context = decl_function_context (decl);
2547 if (context != NULL_TREE && context != current_function_decl
2548 && ! TREE_STATIC (decl))
2550 error (TREE_CODE (decl) == VAR_DECL
2551 ? "use of %<auto%> variable from containing function"
2552 : "use of parameter from containing function");
2553 error (" %q+#D declared here", decl);
2554 return error_mark_node;
2559 /* If we didn't find anything, or what we found was a type,
2560 then this wasn't really an id-expression. */
2561 if (TREE_CODE (decl) == TEMPLATE_DECL
2562 && !DECL_FUNCTION_TEMPLATE_P (decl))
2564 *error_msg = "missing template arguments";
2565 return error_mark_node;
2567 else if (TREE_CODE (decl) == TYPE_DECL
2568 || TREE_CODE (decl) == NAMESPACE_DECL)
2570 *error_msg = "expected primary-expression";
2571 return error_mark_node;
2574 /* If the name resolved to a template parameter, there is no
2575 need to look it up again later. */
2576 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2577 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2581 *idk = CP_ID_KIND_NONE;
2582 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2583 decl = TEMPLATE_PARM_DECL (decl);
2584 r = convert_from_reference (DECL_INITIAL (decl));
2586 if (integral_constant_expression_p
2587 && !dependent_type_p (TREE_TYPE (decl))
2588 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2590 if (!allow_non_integral_constant_expression_p)
2591 error ("template parameter %qD of type %qT is not allowed in "
2592 "an integral constant expression because it is not of "
2593 "integral or enumeration type", decl, TREE_TYPE (decl));
2594 *non_integral_constant_expression_p = true;
2598 /* Similarly, we resolve enumeration constants to their
2599 underlying values. */
2600 else if (TREE_CODE (decl) == CONST_DECL)
2602 *idk = CP_ID_KIND_NONE;
2603 if (!processing_template_decl)
2605 used_types_insert (TREE_TYPE (decl));
2606 return DECL_INITIAL (decl);
2614 /* If the declaration was explicitly qualified indicate
2615 that. The semantics of `A::f(3)' are different than
2616 `f(3)' if `f' is virtual. */
2618 ? CP_ID_KIND_QUALIFIED
2619 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2620 ? CP_ID_KIND_TEMPLATE_ID
2621 : CP_ID_KIND_UNQUALIFIED));
2626 An id-expression is type-dependent if it contains an
2627 identifier that was declared with a dependent type.
2629 The standard is not very specific about an id-expression that
2630 names a set of overloaded functions. What if some of them
2631 have dependent types and some of them do not? Presumably,
2632 such a name should be treated as a dependent name. */
2633 /* Assume the name is not dependent. */
2634 dependent_p = false;
2635 if (!processing_template_decl)
2636 /* No names are dependent outside a template. */
2638 /* A template-id where the name of the template was not resolved
2639 is definitely dependent. */
2640 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2641 && (TREE_CODE (TREE_OPERAND (decl, 0))
2642 == IDENTIFIER_NODE))
2644 /* For anything except an overloaded function, just check its
2646 else if (!is_overloaded_fn (decl))
2648 = dependent_type_p (TREE_TYPE (decl));
2649 /* For a set of overloaded functions, check each of the
2655 if (BASELINK_P (fns))
2656 fns = BASELINK_FUNCTIONS (fns);
2658 /* For a template-id, check to see if the template
2659 arguments are dependent. */
2660 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2662 tree args = TREE_OPERAND (fns, 1);
2663 dependent_p = any_dependent_template_arguments_p (args);
2664 /* The functions are those referred to by the
2666 fns = TREE_OPERAND (fns, 0);
2669 /* If there are no dependent template arguments, go through
2670 the overloaded functions. */
2671 while (fns && !dependent_p)
2673 tree fn = OVL_CURRENT (fns);
2675 /* Member functions of dependent classes are
2677 if (TREE_CODE (fn) == FUNCTION_DECL
2678 && type_dependent_expression_p (fn))
2680 else if (TREE_CODE (fn) == TEMPLATE_DECL
2681 && dependent_template_p (fn))
2684 fns = OVL_NEXT (fns);
2688 /* If the name was dependent on a template parameter, we will
2689 resolve the name at instantiation time. */
2692 /* Create a SCOPE_REF for qualified names, if the scope is
2696 /* Since this name was dependent, the expression isn't
2697 constant -- yet. No error is issued because it might
2698 be constant when things are instantiated. */
2699 if (integral_constant_expression_p)
2700 *non_integral_constant_expression_p = true;
2703 if (address_p && done)
2704 decl = finish_qualified_id_expr (scope, decl,
2708 else if (dependent_type_p (scope))
2709 decl = build_qualified_name (/*type=*/NULL_TREE,
2713 else if (DECL_P (decl))
2714 decl = build_qualified_name (TREE_TYPE (decl),
2719 if (TREE_TYPE (decl))
2720 decl = convert_from_reference (decl);
2723 /* A TEMPLATE_ID already contains all the information we
2725 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2726 return id_expression;
2727 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2728 /* If we found a variable, then name lookup during the
2729 instantiation will always resolve to the same VAR_DECL
2730 (or an instantiation thereof). */
2731 if (TREE_CODE (decl) == VAR_DECL
2732 || TREE_CODE (decl) == PARM_DECL)
2733 return convert_from_reference (decl);
2734 /* The same is true for FIELD_DECL, but we also need to
2735 make sure that the syntax is correct. */
2736 else if (TREE_CODE (decl) == FIELD_DECL)
2738 /* Since SCOPE is NULL here, this is an unqualified name.
2739 Access checking has been performed during name lookup
2740 already. Turn off checking to avoid duplicate errors. */
2741 push_deferring_access_checks (dk_no_check);
2742 decl = finish_non_static_data_member
2743 (decl, current_class_ref,
2744 /*qualifying_scope=*/NULL_TREE);
2745 pop_deferring_access_checks ();
2748 return id_expression;
2751 /* Only certain kinds of names are allowed in constant
2752 expression. Enumerators and template parameters have already
2753 been handled above. */
2754 if (integral_constant_expression_p
2755 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2756 && ! builtin_valid_in_constant_expr_p (decl))
2758 if (!allow_non_integral_constant_expression_p)
2760 error ("%qD cannot appear in a constant-expression", decl);
2761 return error_mark_node;
2763 *non_integral_constant_expression_p = true;
2766 if (TREE_CODE (decl) == NAMESPACE_DECL)
2768 error ("use of namespace %qD as expression", decl);
2769 return error_mark_node;
2771 else if (DECL_CLASS_TEMPLATE_P (decl))
2773 error ("use of class template %qT as expression", decl);
2774 return error_mark_node;
2776 else if (TREE_CODE (decl) == TREE_LIST)
2778 /* Ambiguous reference to base members. */
2779 error ("request for member %qD is ambiguous in "
2780 "multiple inheritance lattice", id_expression);
2781 print_candidates (decl);
2782 return error_mark_node;
2785 /* Mark variable-like entities as used. Functions are similarly
2786 marked either below or after overload resolution. */
2787 if (TREE_CODE (decl) == VAR_DECL
2788 || TREE_CODE (decl) == PARM_DECL
2789 || TREE_CODE (decl) == RESULT_DECL)
2794 decl = (adjust_result_of_qualified_name_lookup
2795 (decl, scope, current_class_type));
2797 if (TREE_CODE (decl) == FUNCTION_DECL)
2800 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2801 decl = finish_qualified_id_expr (scope,
2809 tree r = convert_from_reference (decl);
2811 if (processing_template_decl && TYPE_P (scope))
2812 r = build_qualified_name (TREE_TYPE (r),
2818 else if (TREE_CODE (decl) == FIELD_DECL)
2820 /* Since SCOPE is NULL here, this is an unqualified name.
2821 Access checking has been performed during name lookup
2822 already. Turn off checking to avoid duplicate errors. */
2823 push_deferring_access_checks (dk_no_check);
2824 decl = finish_non_static_data_member (decl, current_class_ref,
2825 /*qualifying_scope=*/NULL_TREE);
2826 pop_deferring_access_checks ();
2828 else if (is_overloaded_fn (decl))
2833 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
2834 first_fn = TREE_OPERAND (first_fn, 0);
2835 first_fn = get_first_fn (first_fn);
2836 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2837 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2839 if (!really_overloaded_fn (decl))
2840 mark_used (first_fn);
2843 && TREE_CODE (first_fn) == FUNCTION_DECL
2844 && DECL_FUNCTION_MEMBER_P (first_fn)
2845 && !shared_member_p (decl))
2847 /* A set of member functions. */
2848 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
2849 return finish_class_member_access_expr (decl, id_expression,
2850 /*template_p=*/false);
2853 decl = baselink_for_fns (decl);
2857 if (DECL_P (decl) && DECL_NONLOCAL (decl)
2858 && DECL_CLASS_SCOPE_P (decl)
2859 && DECL_CONTEXT (decl) != current_class_type)
2863 path = currently_open_derived_class (DECL_CONTEXT (decl));
2864 perform_or_defer_access_check (TYPE_BINFO (path), decl, decl);
2867 decl = convert_from_reference (decl);
2871 if (TREE_DEPRECATED (decl))
2872 warn_deprecated_use (decl);
2877 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
2878 use as a type-specifier. */
2881 finish_typeof (tree expr)
2885 if (type_dependent_expression_p (expr))
2887 type = make_aggr_type (TYPEOF_TYPE);
2888 TYPEOF_TYPE_EXPR (type) = expr;
2893 type = unlowered_expr_type (expr);
2895 if (!type || type == unknown_type_node)
2897 error ("type of %qE is unknown", expr);
2898 return error_mark_node;
2904 /* Perform C++-specific checks for __builtin_offsetof before calling
2908 finish_offsetof (tree expr)
2910 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
2912 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
2913 TREE_OPERAND (expr, 2));
2914 return error_mark_node;
2916 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
2917 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
2918 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
2920 if (TREE_CODE (expr) == COMPONENT_REF
2921 || TREE_CODE (expr) == COMPOUND_EXPR)
2922 expr = TREE_OPERAND (expr, 1);
2923 error ("cannot apply %<offsetof%> to member function %qD", expr);
2924 return error_mark_node;
2926 return fold_offsetof (expr, NULL_TREE);
2929 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
2930 with equivalent CALL_EXPRs. */
2933 simplify_aggr_init_exprs_r (tree* tp,
2935 void* data ATTRIBUTE_UNUSED)
2937 /* We don't need to walk into types; there's nothing in a type that
2938 needs simplification. (And, furthermore, there are places we
2939 actively don't want to go. For example, we don't want to wander
2940 into the default arguments for a FUNCTION_DECL that appears in a
2947 /* Only AGGR_INIT_EXPRs are interesting. */
2948 else if (TREE_CODE (*tp) != AGGR_INIT_EXPR)
2951 simplify_aggr_init_expr (tp);
2953 /* Keep iterating. */
2957 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
2958 function is broken out from the above for the benefit of the tree-ssa
2962 simplify_aggr_init_expr (tree *tp)
2964 tree aggr_init_expr = *tp;
2966 /* Form an appropriate CALL_EXPR. */
2967 tree fn = TREE_OPERAND (aggr_init_expr, 0);
2968 tree args = TREE_OPERAND (aggr_init_expr, 1);
2969 tree slot = TREE_OPERAND (aggr_init_expr, 2);
2970 tree type = TREE_TYPE (slot);
2973 enum style_t { ctor, arg, pcc } style;
2975 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
2977 #ifdef PCC_STATIC_STRUCT_RETURN
2983 gcc_assert (TREE_ADDRESSABLE (type));
2989 /* Replace the first argument to the ctor with the address of the
2993 args = TREE_CHAIN (args);
2994 cxx_mark_addressable (slot);
2995 addr = build1 (ADDR_EXPR, build_pointer_type (type), slot);
2996 args = tree_cons (NULL_TREE, addr, args);
2999 call_expr = build3 (CALL_EXPR,
3000 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3001 fn, args, NULL_TREE);
3005 /* Just mark it addressable here, and leave the rest to
3006 expand_call{,_inline}. */
3007 cxx_mark_addressable (slot);
3008 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3009 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3011 else if (style == pcc)
3013 /* If we're using the non-reentrant PCC calling convention, then we
3014 need to copy the returned value out of the static buffer into the
3016 push_deferring_access_checks (dk_no_check);
3017 call_expr = build_aggr_init (slot, call_expr,
3018 DIRECT_BIND | LOOKUP_ONLYCONVERTING);
3019 pop_deferring_access_checks ();
3020 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3026 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3029 emit_associated_thunks (tree fn)
3031 /* When we use vcall offsets, we emit thunks with the virtual
3032 functions to which they thunk. The whole point of vcall offsets
3033 is so that you can know statically the entire set of thunks that
3034 will ever be needed for a given virtual function, thereby
3035 enabling you to output all the thunks with the function itself. */
3036 if (DECL_VIRTUAL_P (fn))
3040 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3042 if (!THUNK_ALIAS (thunk))
3044 use_thunk (thunk, /*emit_p=*/1);
3045 if (DECL_RESULT_THUNK_P (thunk))
3049 for (probe = DECL_THUNKS (thunk);
3050 probe; probe = TREE_CHAIN (probe))
3051 use_thunk (probe, /*emit_p=*/1);
3055 gcc_assert (!DECL_THUNKS (thunk));
3060 /* Generate RTL for FN. */
3063 expand_body (tree fn)
3065 tree saved_function;
3067 /* Compute the appropriate object-file linkage for inline
3069 if (DECL_DECLARED_INLINE_P (fn))
3070 import_export_decl (fn);
3072 /* If FN is external, then there's no point in generating RTL for
3073 it. This situation can arise with an inline function under
3074 `-fexternal-templates'; we instantiate the function, even though
3075 we're not planning on emitting it, in case we get a chance to
3077 if (DECL_EXTERNAL (fn))
3080 /* ??? When is this needed? */
3081 saved_function = current_function_decl;
3083 /* Emit any thunks that should be emitted at the same time as FN. */
3084 emit_associated_thunks (fn);
3086 /* This function is only called from cgraph, or recursively from
3087 emit_associated_thunks. In neither case should we be currently
3088 generating trees for a function. */
3089 gcc_assert (function_depth == 0);
3091 tree_rest_of_compilation (fn);
3093 current_function_decl = saved_function;
3095 if (DECL_CLONED_FUNCTION_P (fn))
3097 /* If this is a clone, go through the other clones now and mark
3098 their parameters used. We have to do that here, as we don't
3099 know whether any particular clone will be expanded, and
3100 therefore cannot pick one arbitrarily. */
3103 for (probe = TREE_CHAIN (DECL_CLONED_FUNCTION (fn));
3104 probe && DECL_CLONED_FUNCTION_P (probe);
3105 probe = TREE_CHAIN (probe))
3109 for (parms = DECL_ARGUMENTS (probe);
3110 parms; parms = TREE_CHAIN (parms))
3111 TREE_USED (parms) = 1;
3116 /* Generate RTL for FN. */
3119 expand_or_defer_fn (tree fn)
3121 /* When the parser calls us after finishing the body of a template
3122 function, we don't really want to expand the body. */
3123 if (processing_template_decl)
3125 /* Normally, collection only occurs in rest_of_compilation. So,
3126 if we don't collect here, we never collect junk generated
3127 during the processing of templates until we hit a
3128 non-template function. It's not safe to do this inside a
3129 nested class, though, as the parser may have local state that
3130 is not a GC root. */
3131 if (!function_depth)
3136 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
3137 walk_tree_without_duplicates (&DECL_SAVED_TREE (fn),
3138 simplify_aggr_init_exprs_r,
3141 /* If this is a constructor or destructor body, we have to clone
3143 if (maybe_clone_body (fn))
3145 /* We don't want to process FN again, so pretend we've written
3146 it out, even though we haven't. */
3147 TREE_ASM_WRITTEN (fn) = 1;
3151 /* If this function is marked with the constructor attribute, add it
3152 to the list of functions to be called along with constructors
3153 from static duration objects. */
3154 if (DECL_STATIC_CONSTRUCTOR (fn))
3155 static_ctors = tree_cons (NULL_TREE, fn, static_ctors);
3157 /* If this function is marked with the destructor attribute, add it
3158 to the list of functions to be called along with destructors from
3159 static duration objects. */
3160 if (DECL_STATIC_DESTRUCTOR (fn))
3161 static_dtors = tree_cons (NULL_TREE, fn, static_dtors);
3163 /* We make a decision about linkage for these functions at the end
3164 of the compilation. Until that point, we do not want the back
3165 end to output them -- but we do want it to see the bodies of
3166 these functions so that it can inline them as appropriate. */
3167 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3169 if (DECL_INTERFACE_KNOWN (fn))
3170 /* We've already made a decision as to how this function will
3174 DECL_EXTERNAL (fn) = 1;
3175 DECL_NOT_REALLY_EXTERN (fn) = 1;
3176 note_vague_linkage_fn (fn);
3177 /* A non-template inline function with external linkage will
3178 always be COMDAT. As we must eventually determine the
3179 linkage of all functions, and as that causes writes to
3180 the data mapped in from the PCH file, it's advantageous
3181 to mark the functions at this point. */
3182 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3184 /* This function must have external linkage, as
3185 otherwise DECL_INTERFACE_KNOWN would have been
3187 gcc_assert (TREE_PUBLIC (fn));
3188 comdat_linkage (fn);
3189 DECL_INTERFACE_KNOWN (fn) = 1;
3193 import_export_decl (fn);
3195 /* If the user wants us to keep all inline functions, then mark
3196 this function as needed so that finish_file will make sure to
3198 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3202 /* There's no reason to do any of the work here if we're only doing
3203 semantic analysis; this code just generates RTL. */
3204 if (flag_syntax_only)
3209 /* Expand or defer, at the whim of the compilation unit manager. */
3210 cgraph_finalize_function (fn, function_depth > 1);
3222 /* Helper function for walk_tree, used by finalize_nrv below. */
3225 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3227 struct nrv_data *dp = (struct nrv_data *)data;
3230 /* No need to walk into types. There wouldn't be any need to walk into
3231 non-statements, except that we have to consider STMT_EXPRs. */
3234 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3235 but differs from using NULL_TREE in that it indicates that we care
3236 about the value of the RESULT_DECL. */
3237 else if (TREE_CODE (*tp) == RETURN_EXPR)
3238 TREE_OPERAND (*tp, 0) = dp->result;
3239 /* Change all cleanups for the NRV to only run when an exception is
3241 else if (TREE_CODE (*tp) == CLEANUP_STMT
3242 && CLEANUP_DECL (*tp) == dp->var)
3243 CLEANUP_EH_ONLY (*tp) = 1;
3244 /* Replace the DECL_EXPR for the NRV with an initialization of the
3245 RESULT_DECL, if needed. */
3246 else if (TREE_CODE (*tp) == DECL_EXPR
3247 && DECL_EXPR_DECL (*tp) == dp->var)
3250 if (DECL_INITIAL (dp->var)
3251 && DECL_INITIAL (dp->var) != error_mark_node)
3253 init = build2 (INIT_EXPR, void_type_node, dp->result,
3254 DECL_INITIAL (dp->var));
3255 DECL_INITIAL (dp->var) = error_mark_node;
3258 init = build_empty_stmt ();
3259 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3262 /* And replace all uses of the NRV with the RESULT_DECL. */
3263 else if (*tp == dp->var)
3266 /* Avoid walking into the same tree more than once. Unfortunately, we
3267 can't just use walk_tree_without duplicates because it would only call
3268 us for the first occurrence of dp->var in the function body. */
3269 slot = htab_find_slot (dp->visited, *tp, INSERT);
3275 /* Keep iterating. */
3279 /* Called from finish_function to implement the named return value
3280 optimization by overriding all the RETURN_EXPRs and pertinent
3281 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3282 RESULT_DECL for the function. */
3285 finalize_nrv (tree *tp, tree var, tree result)
3287 struct nrv_data data;
3289 /* Copy debugging information from VAR to RESULT. */
3290 DECL_NAME (result) = DECL_NAME (var);
3291 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3292 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3293 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3294 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3295 /* Don't forget that we take its address. */
3296 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3299 data.result = result;
3300 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3301 walk_tree (tp, finalize_nrv_r, &data, 0);
3302 htab_delete (data.visited);
3305 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3306 Remove any elements from the list that are invalid. */
3309 finish_omp_clauses (tree clauses)
3311 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3312 tree c, t, *pc = &clauses;
3315 bitmap_obstack_initialize (NULL);
3316 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3317 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3318 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3320 for (pc = &clauses, c = clauses; c ; c = *pc)
3322 bool remove = false;
3324 switch (OMP_CLAUSE_CODE (c))
3326 case OMP_CLAUSE_SHARED:
3328 goto check_dup_generic;
3329 case OMP_CLAUSE_PRIVATE:
3331 goto check_dup_generic;
3332 case OMP_CLAUSE_REDUCTION:
3334 goto check_dup_generic;
3335 case OMP_CLAUSE_COPYPRIVATE:
3336 name = "copyprivate";
3337 goto check_dup_generic;
3338 case OMP_CLAUSE_COPYIN:
3340 goto check_dup_generic;
3342 t = OMP_CLAUSE_DECL (c);
3343 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3345 if (processing_template_decl)
3348 error ("%qD is not a variable in clause %qs", t, name);
3350 error ("%qE is not a variable in clause %qs", t, name);
3353 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3354 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3355 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3357 error ("%qD appears more than once in data clauses", t);
3361 bitmap_set_bit (&generic_head, DECL_UID (t));
3364 case OMP_CLAUSE_FIRSTPRIVATE:
3365 t = OMP_CLAUSE_DECL (c);
3366 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3368 if (processing_template_decl)
3370 error ("%qE is not a variable in clause %<firstprivate%>", t);
3373 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3374 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3376 error ("%qE appears more than once in data clauses", t);
3380 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3383 case OMP_CLAUSE_LASTPRIVATE:
3384 t = OMP_CLAUSE_DECL (c);
3385 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3387 if (processing_template_decl)
3389 error ("%qE is not a variable in clause %<lastprivate%>", t);
3392 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3393 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3395 error ("%qE appears more than once in data clauses", t);
3399 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3403 t = OMP_CLAUSE_IF_EXPR (c);
3404 t = maybe_convert_cond (t);
3405 if (t == error_mark_node)
3407 OMP_CLAUSE_IF_EXPR (c) = t;
3410 case OMP_CLAUSE_NUM_THREADS:
3411 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3412 if (t == error_mark_node)
3414 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
3415 && !type_dependent_expression_p (t))
3417 error ("num_threads expression must be integral");
3422 case OMP_CLAUSE_SCHEDULE:
3423 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3426 else if (t == error_mark_node)
3428 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
3429 && !type_dependent_expression_p (t))
3431 error ("schedule chunk size expression must be integral");
3436 case OMP_CLAUSE_NOWAIT:
3437 case OMP_CLAUSE_ORDERED:
3438 case OMP_CLAUSE_DEFAULT:
3446 *pc = OMP_CLAUSE_CHAIN (c);
3448 pc = &OMP_CLAUSE_CHAIN (c);
3451 for (pc = &clauses, c = clauses; c ; c = *pc)
3453 enum tree_code c_kind = OMP_CLAUSE_CODE (c);
3454 bool remove = false;
3455 bool need_complete_non_reference = false;
3456 bool need_default_ctor = false;
3457 bool need_copy_ctor = false;
3458 bool need_copy_assignment = false;
3459 bool need_implicitly_determined = false;
3460 tree type, inner_type;
3464 case OMP_CLAUSE_SHARED:
3466 need_implicitly_determined = true;
3468 case OMP_CLAUSE_PRIVATE:
3470 need_complete_non_reference = true;
3471 need_default_ctor = true;
3472 need_implicitly_determined = true;
3474 case OMP_CLAUSE_FIRSTPRIVATE:
3475 name = "firstprivate";
3476 need_complete_non_reference = true;
3477 need_copy_ctor = true;
3478 need_implicitly_determined = true;
3480 case OMP_CLAUSE_LASTPRIVATE:
3481 name = "lastprivate";
3482 need_complete_non_reference = true;
3483 need_copy_assignment = true;
3484 need_implicitly_determined = true;
3486 case OMP_CLAUSE_REDUCTION:
3488 need_implicitly_determined = true;
3490 case OMP_CLAUSE_COPYPRIVATE:
3491 name = "copyprivate";
3492 need_copy_assignment = true;
3494 case OMP_CLAUSE_COPYIN:
3496 need_copy_assignment = true;
3499 pc = &OMP_CLAUSE_CHAIN (c);
3503 t = OMP_CLAUSE_DECL (c);
3504 if (processing_template_decl
3505 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3507 pc = &OMP_CLAUSE_CHAIN (c);
3513 case OMP_CLAUSE_LASTPRIVATE:
3514 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3515 need_default_ctor = true;
3518 case OMP_CLAUSE_REDUCTION:
3519 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3520 || POINTER_TYPE_P (TREE_TYPE (t)))
3522 error ("%qE has invalid type for %<reduction%>", t);
3525 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3527 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3535 error ("%qE has invalid type for %<reduction(%s)%>",
3536 t, operator_name_info[r_code].name);
3542 case OMP_CLAUSE_COPYIN:
3543 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3545 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3554 if (need_complete_non_reference)
3556 t = require_complete_type (t);
3557 if (t == error_mark_node)
3559 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3561 error ("%qE has reference type for %qs", t, name);
3565 if (need_implicitly_determined)
3567 const char *share_name = NULL;
3569 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3570 share_name = "threadprivate";
3571 else switch (cxx_omp_predetermined_sharing (t))
3573 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3575 case OMP_CLAUSE_DEFAULT_SHARED:
3576 share_name = "shared";
3578 case OMP_CLAUSE_DEFAULT_PRIVATE:
3579 share_name = "private";
3586 error ("%qE is predetermined %qs for %qs",
3587 t, share_name, name);
3592 /* We're interested in the base element, not arrays. */
3593 inner_type = type = TREE_TYPE (t);
3594 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3595 inner_type = TREE_TYPE (inner_type);
3597 /* Check for special function availability by building a call to one.
3598 Save the results, because later we won't be in the right context
3599 for making these queries. */
3600 if (CLASS_TYPE_P (inner_type)
3601 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3602 && !type_dependent_expression_p (t))
3604 int save_errorcount = errorcount;
3607 /* Always allocate 3 elements for simplicity. These are the
3608 function decls for the ctor, dtor, and assignment op.
3609 This layout is known to the three lang hooks,
3610 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3611 and cxx_omp_clause_assign_op. */
3612 info = make_tree_vec (3);
3613 CP_OMP_CLAUSE_INFO (c) = info;
3615 if (need_default_ctor
3617 && !TYPE_HAS_TRIVIAL_INIT_REF (inner_type)))
3619 if (need_default_ctor)
3623 t = build_int_cst (build_pointer_type (inner_type), 0);
3624 t = build1 (INDIRECT_REF, inner_type, t);
3625 t = build_tree_list (NULL, t);
3627 t = build_special_member_call (NULL_TREE,
3628 complete_ctor_identifier,
3629 t, inner_type, LOOKUP_NORMAL);
3630 t = get_callee_fndecl (t);
3631 TREE_VEC_ELT (info, 0) = t;
3634 if ((need_default_ctor || need_copy_ctor)
3635 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_type))
3637 t = build_int_cst (build_pointer_type (inner_type), 0);
3638 t = build1 (INDIRECT_REF, inner_type, t);
3639 t = build_special_member_call (t, complete_dtor_identifier,
3640 NULL, inner_type, LOOKUP_NORMAL);
3641 t = get_callee_fndecl (t);
3642 TREE_VEC_ELT (info, 1) = t;
3645 if (need_copy_assignment
3646 && !TYPE_HAS_TRIVIAL_ASSIGN_REF (inner_type))
3648 t = build_int_cst (build_pointer_type (inner_type), 0);
3649 t = build1 (INDIRECT_REF, inner_type, t);
3650 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3651 build_tree_list (NULL, t),
3652 inner_type, LOOKUP_NORMAL);
3654 /* We'll have called convert_from_reference on the call, which
3655 may well have added an indirect_ref. It's unneeded here,
3656 and in the way, so kill it. */
3657 if (TREE_CODE (t) == INDIRECT_REF)
3658 t = TREE_OPERAND (t, 0);
3660 t = get_callee_fndecl (t);
3661 TREE_VEC_ELT (info, 2) = t;
3664 if (errorcount != save_errorcount)
3669 *pc = OMP_CLAUSE_CHAIN (c);
3671 pc = &OMP_CLAUSE_CHAIN (c);
3674 bitmap_obstack_release (NULL);
3678 /* For all variables in the tree_list VARS, mark them as thread local. */
3681 finish_omp_threadprivate (tree vars)
3685 /* Mark every variable in VARS to be assigned thread local storage. */
3686 for (t = vars; t; t = TREE_CHAIN (t))
3688 tree v = TREE_PURPOSE (t);
3690 /* If V had already been marked threadprivate, it doesn't matter
3691 whether it had been used prior to this point. */
3693 && (DECL_LANG_SPECIFIC (v) == NULL
3694 || !CP_DECL_THREADPRIVATE_P (v)))
3695 error ("%qE declared %<threadprivate%> after first use", v);
3696 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3697 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3698 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3699 error ("%<threadprivate%> %qE has incomplete type", v);
3700 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v)))
3701 error ("%<threadprivate%> %qE is not file, namespace "
3702 "or block scope variable", v);
3705 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3706 if (DECL_LANG_SPECIFIC (v) == NULL)
3708 retrofit_lang_decl (v);
3710 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3711 after the allocation of the lang_decl structure. */
3712 if (DECL_DISCRIMINATOR_P (v))
3713 DECL_LANG_SPECIFIC (v)->decl_flags.u2sel = 1;
3716 if (! DECL_THREAD_LOCAL_P (v))
3718 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3719 /* If rtl has been already set for this var, call
3720 make_decl_rtl once again, so that encode_section_info
3721 has a chance to look at the new decl flags. */
3722 if (DECL_RTL_SET_P (v))
3725 CP_DECL_THREADPRIVATE_P (v) = 1;
3730 /* Build an OpenMP structured block. */
3733 begin_omp_structured_block (void)
3735 return do_pushlevel (sk_omp);
3739 finish_omp_structured_block (tree block)
3741 return do_poplevel (block);
3744 /* Similarly, except force the retention of the BLOCK. */
3747 begin_omp_parallel (void)
3749 keep_next_level (true);
3750 return begin_omp_structured_block ();
3754 finish_omp_parallel (tree clauses, tree body)
3758 body = finish_omp_structured_block (body);
3760 stmt = make_node (OMP_PARALLEL);
3761 TREE_TYPE (stmt) = void_type_node;
3762 OMP_PARALLEL_CLAUSES (stmt) = clauses;
3763 OMP_PARALLEL_BODY (stmt) = body;
3765 return add_stmt (stmt);
3768 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
3769 are directly for their associated operands in the statement. DECL
3770 and INIT are a combo; if DECL is NULL then INIT ought to be a
3771 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
3772 optional statements that need to go before the loop into its
3776 finish_omp_for (location_t locus, tree decl, tree init, tree cond,
3777 tree incr, tree body, tree pre_body)
3782 switch (TREE_CODE (init))
3785 decl = TREE_OPERAND (init, 0);
3786 init = TREE_OPERAND (init, 1);
3789 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
3791 decl = TREE_OPERAND (init, 0);
3792 init = TREE_OPERAND (init, 2);
3801 error ("expected iteration declaration or initialization");
3806 if (type_dependent_expression_p (decl)
3807 || type_dependent_expression_p (init)
3808 || (cond && type_dependent_expression_p (cond))
3809 || (incr && type_dependent_expression_p (incr)))
3815 error ("%Hmissing controlling predicate", &locus);
3821 error ("%Hmissing increment expression", &locus);
3825 stmt = make_node (OMP_FOR);
3827 /* This is really just a place-holder. We'll be decomposing this
3828 again and going through the build_modify_expr path below when
3829 we instantiate the thing. */
3830 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
3832 TREE_TYPE (stmt) = void_type_node;
3833 OMP_FOR_INIT (stmt) = init;
3834 OMP_FOR_COND (stmt) = cond;
3835 OMP_FOR_INCR (stmt) = incr;
3836 OMP_FOR_BODY (stmt) = body;
3837 OMP_FOR_PRE_BODY (stmt) = pre_body;
3839 SET_EXPR_LOCATION (stmt, locus);
3840 return add_stmt (stmt);
3845 error ("expected iteration declaration or initialization");
3849 if (pre_body == NULL || IS_EMPTY_STMT (pre_body))
3851 else if (! processing_template_decl)
3853 add_stmt (pre_body);
3856 init = build_modify_expr (decl, NOP_EXPR, init);
3857 return c_finish_omp_for (locus, decl, init, cond, incr, body, pre_body);
3861 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
3870 dependent_p = false;
3873 /* Even in a template, we can detect invalid uses of the atomic
3874 pragma if neither LHS nor RHS is type-dependent. */
3875 if (processing_template_decl)
3877 dependent_p = (type_dependent_expression_p (lhs)
3878 || type_dependent_expression_p (rhs));
3881 lhs = build_non_dependent_expr (lhs);
3882 rhs = build_non_dependent_expr (rhs);
3887 stmt = c_finish_omp_atomic (code, lhs, rhs);
3888 if (stmt == error_mark_node)
3891 if (processing_template_decl)
3893 stmt = build2 (OMP_ATOMIC, void_type_node, orig_lhs, orig_rhs);
3894 OMP_ATOMIC_DEPENDENT_P (stmt) = 1;
3895 OMP_ATOMIC_CODE (stmt) = code;
3901 finish_omp_barrier (void)
3903 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
3904 tree stmt = finish_call_expr (fn, NULL, false, false);
3905 finish_expr_stmt (stmt);
3909 finish_omp_flush (void)
3911 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
3912 tree stmt = finish_call_expr (fn, NULL, false, false);
3913 finish_expr_stmt (stmt);
3916 /* True if OpenMP sharing attribute of DECL is predetermined. */
3918 enum omp_clause_default_kind
3919 cxx_omp_predetermined_sharing (tree decl)
3921 enum omp_clause_default_kind kind;
3923 kind = c_omp_predetermined_sharing (decl);
3924 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
3927 /* Static data members are predetermined as shared. */
3928 if (TREE_STATIC (decl))
3930 tree ctx = CP_DECL_CONTEXT (decl);
3931 if (TYPE_P (ctx) && IS_AGGR_TYPE (ctx))
3932 return OMP_CLAUSE_DEFAULT_SHARED;
3935 return OMP_CLAUSE_DEFAULT_UNSPECIFIED;
3939 init_cp_semantics (void)
3943 #include "gt-cp-semantics.h"