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, 2006, 2007
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)
513 check_for_bare_parameter_packs (expr);
518 /* If *COND_P specifies a conditional with a declaration, transform the
521 for (; A x = 42;) { }
523 while (true) { A x = 42; if (!x) break; }
524 for (;;) { A x = 42; if (!x) break; }
525 The statement list for BODY will be empty if the conditional did
526 not declare anything. */
529 simplify_loop_decl_cond (tree *cond_p, tree body)
533 if (!TREE_SIDE_EFFECTS (body))
537 *cond_p = boolean_true_node;
539 if_stmt = begin_if_stmt ();
540 cond = build_unary_op (TRUTH_NOT_EXPR, cond, 0);
541 finish_if_stmt_cond (cond, if_stmt);
542 finish_break_stmt ();
543 finish_then_clause (if_stmt);
544 finish_if_stmt (if_stmt);
547 /* Finish a goto-statement. */
550 finish_goto_stmt (tree destination)
552 if (TREE_CODE (destination) == IDENTIFIER_NODE)
553 destination = lookup_label (destination);
555 /* We warn about unused labels with -Wunused. That means we have to
556 mark the used labels as used. */
557 if (TREE_CODE (destination) == LABEL_DECL)
558 TREE_USED (destination) = 1;
561 /* The DESTINATION is being used as an rvalue. */
562 if (!processing_template_decl)
563 destination = decay_conversion (destination);
564 /* We don't inline calls to functions with computed gotos.
565 Those functions are typically up to some funny business,
566 and may be depending on the labels being at particular
567 addresses, or some such. */
568 DECL_UNINLINABLE (current_function_decl) = 1;
571 check_goto (destination);
573 return add_stmt (build_stmt (GOTO_EXPR, destination));
576 /* COND is the condition-expression for an if, while, etc.,
577 statement. Convert it to a boolean value, if appropriate. */
580 maybe_convert_cond (tree cond)
582 /* Empty conditions remain empty. */
586 /* Wait until we instantiate templates before doing conversion. */
587 if (processing_template_decl)
590 /* Do the conversion. */
591 cond = convert_from_reference (cond);
593 if (TREE_CODE (cond) == MODIFY_EXPR
594 && !TREE_NO_WARNING (cond)
597 warning (OPT_Wparentheses,
598 "suggest parentheses around assignment used as truth value");
599 TREE_NO_WARNING (cond) = 1;
602 return condition_conversion (cond);
605 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
608 finish_expr_stmt (tree expr)
612 if (expr != NULL_TREE)
614 if (!processing_template_decl)
616 if (warn_sequence_point)
617 verify_sequence_points (expr);
618 expr = convert_to_void (expr, "statement");
620 else if (!type_dependent_expression_p (expr))
621 convert_to_void (build_non_dependent_expr (expr), "statement");
623 check_for_bare_parameter_packs (expr);
625 /* Simplification of inner statement expressions, compound exprs,
626 etc can result in us already having an EXPR_STMT. */
627 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
629 if (TREE_CODE (expr) != EXPR_STMT)
630 expr = build_stmt (EXPR_STMT, expr);
631 expr = maybe_cleanup_point_expr_void (expr);
643 /* Begin an if-statement. Returns a newly created IF_STMT if
650 scope = do_pushlevel (sk_block);
651 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
652 TREE_CHAIN (r) = scope;
653 begin_cond (&IF_COND (r));
657 /* Process the COND of an if-statement, which may be given by
661 finish_if_stmt_cond (tree cond, tree if_stmt)
663 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
665 THEN_CLAUSE (if_stmt) = push_stmt_list ();
668 /* Finish the then-clause of an if-statement, which may be given by
672 finish_then_clause (tree if_stmt)
674 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
678 /* Begin the else-clause of an if-statement. */
681 begin_else_clause (tree if_stmt)
683 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
686 /* Finish the else-clause of an if-statement, which may be given by
690 finish_else_clause (tree if_stmt)
692 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
695 /* Finish an if-statement. */
698 finish_if_stmt (tree if_stmt)
700 tree scope = TREE_CHAIN (if_stmt);
701 TREE_CHAIN (if_stmt) = NULL;
702 add_stmt (do_poplevel (scope));
704 empty_body_warning (THEN_CLAUSE (if_stmt), ELSE_CLAUSE (if_stmt));
707 /* Begin a while-statement. Returns a newly created WHILE_STMT if
711 begin_while_stmt (void)
714 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
716 WHILE_BODY (r) = do_pushlevel (sk_block);
717 begin_cond (&WHILE_COND (r));
721 /* Process the COND of a while-statement, which may be given by
725 finish_while_stmt_cond (tree cond, tree while_stmt)
727 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
728 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
731 /* Finish a while-statement, which may be given by WHILE_STMT. */
734 finish_while_stmt (tree while_stmt)
736 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
740 /* Begin a do-statement. Returns a newly created DO_STMT if
746 tree r = build_stmt (DO_STMT, NULL_TREE, NULL_TREE);
748 DO_BODY (r) = push_stmt_list ();
752 /* Finish the body of a do-statement, which may be given by DO_STMT. */
755 finish_do_body (tree do_stmt)
757 DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
760 /* Finish a do-statement, which may be given by DO_STMT, and whose
761 COND is as indicated. */
764 finish_do_stmt (tree cond, tree do_stmt)
766 cond = maybe_convert_cond (cond);
767 DO_COND (do_stmt) = cond;
771 /* Finish a return-statement. The EXPRESSION returned, if any, is as
775 finish_return_stmt (tree expr)
780 expr = check_return_expr (expr, &no_warning);
782 if (flag_openmp && !check_omp_return ())
783 return error_mark_node;
784 if (!processing_template_decl)
786 if (DECL_DESTRUCTOR_P (current_function_decl)
787 || (DECL_CONSTRUCTOR_P (current_function_decl)
788 && targetm.cxx.cdtor_returns_this ()))
790 /* Similarly, all destructors must run destructors for
791 base-classes before returning. So, all returns in a
792 destructor get sent to the DTOR_LABEL; finish_function emits
793 code to return a value there. */
794 return finish_goto_stmt (cdtor_label);
798 r = build_stmt (RETURN_EXPR, expr);
799 TREE_NO_WARNING (r) |= no_warning;
800 r = maybe_cleanup_point_expr_void (r);
807 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
810 begin_for_stmt (void)
814 r = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE,
815 NULL_TREE, NULL_TREE);
817 if (flag_new_for_scope > 0)
818 TREE_CHAIN (r) = do_pushlevel (sk_for);
820 if (processing_template_decl)
821 FOR_INIT_STMT (r) = push_stmt_list ();
826 /* Finish the for-init-statement of a for-statement, which may be
827 given by FOR_STMT. */
830 finish_for_init_stmt (tree for_stmt)
832 if (processing_template_decl)
833 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
835 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
836 begin_cond (&FOR_COND (for_stmt));
839 /* Finish the COND of a for-statement, which may be given by
843 finish_for_cond (tree cond, tree for_stmt)
845 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
846 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
849 /* Finish the increment-EXPRESSION in a for-statement, which may be
850 given by FOR_STMT. */
853 finish_for_expr (tree expr, tree for_stmt)
857 /* If EXPR is an overloaded function, issue an error; there is no
858 context available to use to perform overload resolution. */
859 if (type_unknown_p (expr))
861 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
862 expr = error_mark_node;
864 if (!processing_template_decl)
866 if (warn_sequence_point)
867 verify_sequence_points (expr);
868 expr = convert_to_void (expr, "3rd expression in for");
870 else if (!type_dependent_expression_p (expr))
871 convert_to_void (build_non_dependent_expr (expr), "3rd expression in for");
872 expr = maybe_cleanup_point_expr_void (expr);
873 check_for_bare_parameter_packs (expr);
874 FOR_EXPR (for_stmt) = expr;
877 /* Finish the body of a for-statement, which may be given by
878 FOR_STMT. The increment-EXPR for the loop must be
882 finish_for_stmt (tree for_stmt)
884 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
886 /* Pop the scope for the body of the loop. */
887 if (flag_new_for_scope > 0)
889 tree scope = TREE_CHAIN (for_stmt);
890 TREE_CHAIN (for_stmt) = NULL;
891 add_stmt (do_poplevel (scope));
897 /* Finish a break-statement. */
900 finish_break_stmt (void)
902 return add_stmt (build_stmt (BREAK_STMT));
905 /* Finish a continue-statement. */
908 finish_continue_stmt (void)
910 return add_stmt (build_stmt (CONTINUE_STMT));
913 /* Begin a switch-statement. Returns a new SWITCH_STMT if
917 begin_switch_stmt (void)
921 r = build_stmt (SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
923 scope = do_pushlevel (sk_block);
924 TREE_CHAIN (r) = scope;
925 begin_cond (&SWITCH_STMT_COND (r));
930 /* Finish the cond of a switch-statement. */
933 finish_switch_cond (tree cond, tree switch_stmt)
935 tree orig_type = NULL;
936 if (!processing_template_decl)
940 /* Convert the condition to an integer or enumeration type. */
941 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
942 if (cond == NULL_TREE)
944 error ("switch quantity not an integer");
945 cond = error_mark_node;
947 orig_type = TREE_TYPE (cond);
948 if (cond != error_mark_node)
952 Integral promotions are performed. */
953 cond = perform_integral_promotions (cond);
954 cond = maybe_cleanup_point_expr (cond);
957 if (cond != error_mark_node)
959 index = get_unwidened (cond, NULL_TREE);
960 /* We can't strip a conversion from a signed type to an unsigned,
961 because if we did, int_fits_type_p would do the wrong thing
962 when checking case values for being in range,
963 and it's too hard to do the right thing. */
964 if (TYPE_UNSIGNED (TREE_TYPE (cond))
965 == TYPE_UNSIGNED (TREE_TYPE (index)))
969 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
970 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
971 add_stmt (switch_stmt);
972 push_switch (switch_stmt);
973 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
974 check_for_bare_parameter_packs (cond);
977 /* Finish the body of a switch-statement, which may be given by
978 SWITCH_STMT. The COND to switch on is indicated. */
981 finish_switch_stmt (tree switch_stmt)
985 SWITCH_STMT_BODY (switch_stmt) =
986 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
990 scope = TREE_CHAIN (switch_stmt);
991 TREE_CHAIN (switch_stmt) = NULL;
992 add_stmt (do_poplevel (scope));
995 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
999 begin_try_block (void)
1001 tree r = build_stmt (TRY_BLOCK, NULL_TREE, NULL_TREE);
1003 TRY_STMTS (r) = push_stmt_list ();
1007 /* Likewise, for a function-try-block. The block returned in
1008 *COMPOUND_STMT is an artificial outer scope, containing the
1009 function-try-block. */
1012 begin_function_try_block (tree *compound_stmt)
1015 /* This outer scope does not exist in the C++ standard, but we need
1016 a place to put __FUNCTION__ and similar variables. */
1017 *compound_stmt = begin_compound_stmt (0);
1018 r = begin_try_block ();
1019 FN_TRY_BLOCK_P (r) = 1;
1023 /* Finish a try-block, which may be given by TRY_BLOCK. */
1026 finish_try_block (tree try_block)
1028 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1029 TRY_HANDLERS (try_block) = push_stmt_list ();
1032 /* Finish the body of a cleanup try-block, which may be given by
1036 finish_cleanup_try_block (tree try_block)
1038 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1041 /* Finish an implicitly generated try-block, with a cleanup is given
1045 finish_cleanup (tree cleanup, tree try_block)
1047 TRY_HANDLERS (try_block) = cleanup;
1048 CLEANUP_P (try_block) = 1;
1051 /* Likewise, for a function-try-block. */
1054 finish_function_try_block (tree try_block)
1056 finish_try_block (try_block);
1057 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1058 the try block, but moving it inside. */
1059 in_function_try_handler = 1;
1062 /* Finish a handler-sequence for a try-block, which may be given by
1066 finish_handler_sequence (tree try_block)
1068 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1069 check_handlers (TRY_HANDLERS (try_block));
1072 /* Finish the handler-seq for a function-try-block, given by
1073 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1074 begin_function_try_block. */
1077 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1079 in_function_try_handler = 0;
1080 finish_handler_sequence (try_block);
1081 finish_compound_stmt (compound_stmt);
1084 /* Begin a handler. Returns a HANDLER if appropriate. */
1087 begin_handler (void)
1091 r = build_stmt (HANDLER, NULL_TREE, NULL_TREE);
1094 /* Create a binding level for the eh_info and the exception object
1096 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1101 /* Finish the handler-parameters for a handler, which may be given by
1102 HANDLER. DECL is the declaration for the catch parameter, or NULL
1103 if this is a `catch (...)' clause. */
1106 finish_handler_parms (tree decl, tree handler)
1108 tree type = NULL_TREE;
1109 if (processing_template_decl)
1113 decl = pushdecl (decl);
1114 decl = push_template_decl (decl);
1115 HANDLER_PARMS (handler) = decl;
1116 type = TREE_TYPE (decl);
1120 type = expand_start_catch_block (decl);
1121 HANDLER_TYPE (handler) = type;
1122 if (!processing_template_decl && type)
1123 mark_used (eh_type_info (type));
1126 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1127 the return value from the matching call to finish_handler_parms. */
1130 finish_handler (tree handler)
1132 if (!processing_template_decl)
1133 expand_end_catch_block ();
1134 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1137 /* Begin a compound statement. FLAGS contains some bits that control the
1138 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1139 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1140 block of a function. If BCS_TRY_BLOCK is set, this is the block
1141 created on behalf of a TRY statement. Returns a token to be passed to
1142 finish_compound_stmt. */
1145 begin_compound_stmt (unsigned int flags)
1149 if (flags & BCS_NO_SCOPE)
1151 r = push_stmt_list ();
1152 STATEMENT_LIST_NO_SCOPE (r) = 1;
1154 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1155 But, if it's a statement-expression with a scopeless block, there's
1156 nothing to keep, and we don't want to accidentally keep a block
1157 *inside* the scopeless block. */
1158 keep_next_level (false);
1161 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1163 /* When processing a template, we need to remember where the braces were,
1164 so that we can set up identical scopes when instantiating the template
1165 later. BIND_EXPR is a handy candidate for this.
1166 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1167 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1168 processing templates. */
1169 if (processing_template_decl)
1171 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1172 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1173 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1174 TREE_SIDE_EFFECTS (r) = 1;
1180 /* Finish a compound-statement, which is given by STMT. */
1183 finish_compound_stmt (tree stmt)
1185 if (TREE_CODE (stmt) == BIND_EXPR)
1186 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1187 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1188 stmt = pop_stmt_list (stmt);
1191 /* Destroy any ObjC "super" receivers that may have been
1193 objc_clear_super_receiver ();
1195 stmt = do_poplevel (stmt);
1198 /* ??? See c_end_compound_stmt wrt statement expressions. */
1203 /* Finish an asm-statement, whose components are a STRING, some
1204 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1205 whether the asm-statement should be considered volatile. */
1208 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1209 tree input_operands, tree clobbers)
1213 int ninputs = list_length (input_operands);
1214 int noutputs = list_length (output_operands);
1216 if (!processing_template_decl)
1218 const char *constraint;
1219 const char **oconstraints;
1220 bool allows_mem, allows_reg, is_inout;
1224 oconstraints = (const char **) alloca (noutputs * sizeof (char *));
1226 string = resolve_asm_operand_names (string, output_operands,
1229 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1231 operand = TREE_VALUE (t);
1233 /* ??? Really, this should not be here. Users should be using a
1234 proper lvalue, dammit. But there's a long history of using
1235 casts in the output operands. In cases like longlong.h, this
1236 becomes a primitive form of typechecking -- if the cast can be
1237 removed, then the output operand had a type of the proper width;
1238 otherwise we'll get an error. Gross, but ... */
1239 STRIP_NOPS (operand);
1241 if (!lvalue_or_else (operand, lv_asm))
1242 operand = error_mark_node;
1244 if (operand != error_mark_node
1245 && (TREE_READONLY (operand)
1246 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1247 /* Functions are not modifiable, even though they are
1249 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1250 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1251 /* If it's an aggregate and any field is const, then it is
1252 effectively const. */
1253 || (CLASS_TYPE_P (TREE_TYPE (operand))
1254 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1255 readonly_error (operand, "assignment (via 'asm' output)");
1257 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1258 oconstraints[i] = constraint;
1260 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1261 &allows_mem, &allows_reg, &is_inout))
1263 /* If the operand is going to end up in memory,
1264 mark it addressable. */
1265 if (!allows_reg && !cxx_mark_addressable (operand))
1266 operand = error_mark_node;
1269 operand = error_mark_node;
1271 TREE_VALUE (t) = operand;
1274 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1276 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1277 operand = decay_conversion (TREE_VALUE (t));
1279 /* If the type of the operand hasn't been determined (e.g.,
1280 because it involves an overloaded function), then issue
1281 an error message. There's no context available to
1282 resolve the overloading. */
1283 if (TREE_TYPE (operand) == unknown_type_node)
1285 error ("type of asm operand %qE could not be determined",
1287 operand = error_mark_node;
1290 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1291 oconstraints, &allows_mem, &allows_reg))
1293 /* If the operand is going to end up in memory,
1294 mark it addressable. */
1295 if (!allows_reg && allows_mem)
1297 /* Strip the nops as we allow this case. FIXME, this really
1298 should be rejected or made deprecated. */
1299 STRIP_NOPS (operand);
1300 if (!cxx_mark_addressable (operand))
1301 operand = error_mark_node;
1305 operand = error_mark_node;
1307 TREE_VALUE (t) = operand;
1311 r = build_stmt (ASM_EXPR, string,
1312 output_operands, input_operands,
1314 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1315 r = maybe_cleanup_point_expr_void (r);
1316 return add_stmt (r);
1319 /* Finish a label with the indicated NAME. */
1322 finish_label_stmt (tree name)
1324 tree decl = define_label (input_location, name);
1326 if (decl == error_mark_node)
1327 return error_mark_node;
1329 return add_stmt (build_stmt (LABEL_EXPR, decl));
1332 /* Finish a series of declarations for local labels. G++ allows users
1333 to declare "local" labels, i.e., labels with scope. This extension
1334 is useful when writing code involving statement-expressions. */
1337 finish_label_decl (tree name)
1339 tree decl = declare_local_label (name);
1340 add_decl_expr (decl);
1343 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1346 finish_decl_cleanup (tree decl, tree cleanup)
1348 push_cleanup (decl, cleanup, false);
1351 /* If the current scope exits with an exception, run CLEANUP. */
1354 finish_eh_cleanup (tree cleanup)
1356 push_cleanup (NULL, cleanup, true);
1359 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1360 order they were written by the user. Each node is as for
1361 emit_mem_initializers. */
1364 finish_mem_initializers (tree mem_inits)
1366 /* Reorder the MEM_INITS so that they are in the order they appeared
1367 in the source program. */
1368 mem_inits = nreverse (mem_inits);
1370 if (processing_template_decl)
1374 for (mem = mem_inits; mem; mem = TREE_CHAIN (mem))
1376 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1377 check for bare parameter packs in the TREE_VALUE, because
1378 any parameter packs in the TREE_VALUE have already been
1379 bound as part of the TREE_PURPOSE. See
1380 make_pack_expansion for more information. */
1381 if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION)
1382 check_for_bare_parameter_packs (TREE_VALUE (mem));
1385 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1388 emit_mem_initializers (mem_inits);
1391 /* Finish a parenthesized expression EXPR. */
1394 finish_parenthesized_expr (tree expr)
1397 /* This inhibits warnings in c_common_truthvalue_conversion. */
1398 TREE_NO_WARNING (expr) = 1;
1400 if (TREE_CODE (expr) == OFFSET_REF)
1401 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1402 enclosed in parentheses. */
1403 PTRMEM_OK_P (expr) = 0;
1405 if (TREE_CODE (expr) == STRING_CST)
1406 PAREN_STRING_LITERAL_P (expr) = 1;
1411 /* Finish a reference to a non-static data member (DECL) that is not
1412 preceded by `.' or `->'. */
1415 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1417 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1421 if (current_function_decl
1422 && DECL_STATIC_FUNCTION_P (current_function_decl))
1423 error ("invalid use of member %q+D in static member function", decl);
1425 error ("invalid use of non-static data member %q+D", decl);
1426 error ("from this location");
1428 return error_mark_node;
1430 TREE_USED (current_class_ptr) = 1;
1431 if (processing_template_decl && !qualifying_scope)
1433 tree type = TREE_TYPE (decl);
1435 if (TREE_CODE (type) == REFERENCE_TYPE)
1436 type = TREE_TYPE (type);
1439 /* Set the cv qualifiers. */
1440 int quals = cp_type_quals (TREE_TYPE (current_class_ref));
1442 if (DECL_MUTABLE_P (decl))
1443 quals &= ~TYPE_QUAL_CONST;
1445 quals |= cp_type_quals (TREE_TYPE (decl));
1446 type = cp_build_qualified_type (type, quals);
1449 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1453 tree access_type = TREE_TYPE (object);
1454 tree lookup_context = context_for_name_lookup (decl);
1456 while (!DERIVED_FROM_P (lookup_context, access_type))
1458 access_type = TYPE_CONTEXT (access_type);
1459 while (access_type && DECL_P (access_type))
1460 access_type = DECL_CONTEXT (access_type);
1464 error ("object missing in reference to %q+D", decl);
1465 error ("from this location");
1466 return error_mark_node;
1470 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1471 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1473 if (processing_template_decl)
1474 return build_qualified_name (TREE_TYPE (decl),
1477 /*template_p=*/false);
1479 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1482 /* If the data member was named `C::M', convert `*this' to `C'
1484 if (qualifying_scope)
1486 tree binfo = NULL_TREE;
1487 object = build_scoped_ref (object, qualifying_scope,
1491 return build_class_member_access_expr (object, decl,
1492 /*access_path=*/NULL_TREE,
1493 /*preserve_reference=*/false);
1497 /* DECL was the declaration to which a qualified-id resolved. Issue
1498 an error message if it is not accessible. If OBJECT_TYPE is
1499 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1500 type of `*x', or `x', respectively. If the DECL was named as
1501 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1504 check_accessibility_of_qualified_id (tree decl,
1506 tree nested_name_specifier)
1509 tree qualifying_type = NULL_TREE;
1511 /* If we're not checking, return immediately. */
1512 if (deferred_access_no_check)
1515 /* Determine the SCOPE of DECL. */
1516 scope = context_for_name_lookup (decl);
1517 /* If the SCOPE is not a type, then DECL is not a member. */
1518 if (!TYPE_P (scope))
1520 /* Compute the scope through which DECL is being accessed. */
1522 /* OBJECT_TYPE might not be a class type; consider:
1524 class A { typedef int I; };
1528 In this case, we will have "A::I" as the DECL, but "I" as the
1530 && CLASS_TYPE_P (object_type)
1531 && DERIVED_FROM_P (scope, object_type))
1532 /* If we are processing a `->' or `.' expression, use the type of the
1534 qualifying_type = object_type;
1535 else if (nested_name_specifier)
1537 /* If the reference is to a non-static member of the
1538 current class, treat it as if it were referenced through
1540 if (DECL_NONSTATIC_MEMBER_P (decl)
1541 && current_class_ptr
1542 && DERIVED_FROM_P (scope, current_class_type))
1543 qualifying_type = current_class_type;
1544 /* Otherwise, use the type indicated by the
1545 nested-name-specifier. */
1547 qualifying_type = nested_name_specifier;
1550 /* Otherwise, the name must be from the current class or one of
1552 qualifying_type = currently_open_derived_class (scope);
1555 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1556 or similar in a default argument value. */
1557 && CLASS_TYPE_P (qualifying_type)
1558 && !dependent_type_p (qualifying_type))
1559 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1563 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1564 class named to the left of the "::" operator. DONE is true if this
1565 expression is a complete postfix-expression; it is false if this
1566 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1567 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1568 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1569 is true iff this qualified name appears as a template argument. */
1572 finish_qualified_id_expr (tree qualifying_class,
1577 bool template_arg_p)
1579 gcc_assert (TYPE_P (qualifying_class));
1581 if (error_operand_p (expr))
1582 return error_mark_node;
1584 if (DECL_P (expr) || BASELINK_P (expr))
1588 check_template_keyword (expr);
1590 /* If EXPR occurs as the operand of '&', use special handling that
1591 permits a pointer-to-member. */
1592 if (address_p && done)
1594 if (TREE_CODE (expr) == SCOPE_REF)
1595 expr = TREE_OPERAND (expr, 1);
1596 expr = build_offset_ref (qualifying_class, expr,
1597 /*address_p=*/true);
1601 /* Within the scope of a class, turn references to non-static
1602 members into expression of the form "this->...". */
1604 /* But, within a template argument, we do not want make the
1605 transformation, as there is no "this" pointer. */
1607 else if (TREE_CODE (expr) == FIELD_DECL)
1608 expr = finish_non_static_data_member (expr, current_class_ref,
1610 else if (BASELINK_P (expr) && !processing_template_decl)
1614 /* See if any of the functions are non-static members. */
1615 fns = BASELINK_FUNCTIONS (expr);
1616 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1617 fns = TREE_OPERAND (fns, 0);
1618 /* If so, the expression may be relative to the current
1620 if (!shared_member_p (fns)
1621 && current_class_type
1622 && DERIVED_FROM_P (qualifying_class, current_class_type))
1623 expr = (build_class_member_access_expr
1624 (maybe_dummy_object (qualifying_class, NULL),
1626 BASELINK_ACCESS_BINFO (expr),
1627 /*preserve_reference=*/false));
1629 /* The expression is a qualified name whose address is not
1631 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1637 /* Begin a statement-expression. The value returned must be passed to
1638 finish_stmt_expr. */
1641 begin_stmt_expr (void)
1643 return push_stmt_list ();
1646 /* Process the final expression of a statement expression. EXPR can be
1647 NULL, if the final expression is empty. Return a STATEMENT_LIST
1648 containing all the statements in the statement-expression, or
1649 ERROR_MARK_NODE if there was an error. */
1652 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1654 if (error_operand_p (expr))
1656 /* The type of the statement-expression is the type of the last
1658 TREE_TYPE (stmt_expr) = error_mark_node;
1659 return error_mark_node;
1662 /* If the last statement does not have "void" type, then the value
1663 of the last statement is the value of the entire expression. */
1666 tree type = TREE_TYPE (expr);
1668 if (processing_template_decl)
1670 expr = build_stmt (EXPR_STMT, expr);
1671 expr = add_stmt (expr);
1672 /* Mark the last statement so that we can recognize it as such at
1673 template-instantiation time. */
1674 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1676 else if (VOID_TYPE_P (type))
1678 /* Just treat this like an ordinary statement. */
1679 expr = finish_expr_stmt (expr);
1683 /* It actually has a value we need to deal with. First, force it
1684 to be an rvalue so that we won't need to build up a copy
1685 constructor call later when we try to assign it to something. */
1686 expr = force_rvalue (expr);
1687 if (error_operand_p (expr))
1688 return error_mark_node;
1690 /* Update for array-to-pointer decay. */
1691 type = TREE_TYPE (expr);
1693 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1694 normal statement, but don't convert to void or actually add
1696 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1697 expr = maybe_cleanup_point_expr (expr);
1701 /* The type of the statement-expression is the type of the last
1703 TREE_TYPE (stmt_expr) = type;
1709 /* Finish a statement-expression. EXPR should be the value returned
1710 by the previous begin_stmt_expr. Returns an expression
1711 representing the statement-expression. */
1714 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1719 if (error_operand_p (stmt_expr))
1720 return error_mark_node;
1722 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1724 type = TREE_TYPE (stmt_expr);
1725 result = pop_stmt_list (stmt_expr);
1726 TREE_TYPE (result) = type;
1728 if (processing_template_decl)
1730 result = build_min (STMT_EXPR, type, result);
1731 TREE_SIDE_EFFECTS (result) = 1;
1732 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1734 else if (CLASS_TYPE_P (type))
1736 /* Wrap the statement-expression in a TARGET_EXPR so that the
1737 temporary object created by the final expression is destroyed at
1738 the end of the full-expression containing the
1739 statement-expression. */
1740 result = force_target_expr (type, result);
1746 /* Perform Koenig lookup. FN is the postfix-expression representing
1747 the function (or functions) to call; ARGS are the arguments to the
1748 call. Returns the functions to be considered by overload
1752 perform_koenig_lookup (tree fn, tree args)
1754 tree identifier = NULL_TREE;
1755 tree functions = NULL_TREE;
1757 /* Find the name of the overloaded function. */
1758 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1760 else if (is_overloaded_fn (fn))
1763 identifier = DECL_NAME (get_first_fn (functions));
1765 else if (DECL_P (fn))
1768 identifier = DECL_NAME (fn);
1771 /* A call to a namespace-scope function using an unqualified name.
1773 Do Koenig lookup -- unless any of the arguments are
1775 if (!any_type_dependent_arguments_p (args))
1777 fn = lookup_arg_dependent (identifier, functions, args);
1779 /* The unqualified name could not be resolved. */
1780 fn = unqualified_fn_lookup_error (identifier);
1786 /* Generate an expression for `FN (ARGS)'.
1788 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1789 as a virtual call, even if FN is virtual. (This flag is set when
1790 encountering an expression where the function name is explicitly
1791 qualified. For example a call to `X::f' never generates a virtual
1794 Returns code for the call. */
1797 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p)
1803 if (fn == error_mark_node || args == error_mark_node)
1804 return error_mark_node;
1806 /* ARGS should be a list of arguments. */
1807 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1808 gcc_assert (!TYPE_P (fn));
1813 if (processing_template_decl)
1815 if (type_dependent_expression_p (fn)
1816 || any_type_dependent_arguments_p (args))
1818 result = build_nt_call_list (fn, args);
1819 KOENIG_LOOKUP_P (result) = koenig_p;
1822 if (!BASELINK_P (fn)
1823 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1824 && TREE_TYPE (fn) != unknown_type_node)
1825 fn = build_non_dependent_expr (fn);
1826 args = build_non_dependent_args (orig_args);
1829 if (is_overloaded_fn (fn))
1830 fn = baselink_for_fns (fn);
1833 if (BASELINK_P (fn))
1837 /* A call to a member function. From [over.call.func]:
1839 If the keyword this is in scope and refers to the class of
1840 that member function, or a derived class thereof, then the
1841 function call is transformed into a qualified function call
1842 using (*this) as the postfix-expression to the left of the
1843 . operator.... [Otherwise] a contrived object of type T
1844 becomes the implied object argument.
1846 This paragraph is unclear about this situation:
1848 struct A { void f(); };
1849 struct B : public A {};
1850 struct C : public A { void g() { B::f(); }};
1852 In particular, for `B::f', this paragraph does not make clear
1853 whether "the class of that member function" refers to `A' or
1854 to `B'. We believe it refers to `B'. */
1855 if (current_class_type
1856 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1858 && current_class_ref)
1859 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1863 tree representative_fn;
1865 representative_fn = BASELINK_FUNCTIONS (fn);
1866 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1867 representative_fn = TREE_OPERAND (representative_fn, 0);
1868 representative_fn = get_first_fn (representative_fn);
1869 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1872 if (processing_template_decl)
1874 if (type_dependent_expression_p (object))
1875 return build_nt_call_list (orig_fn, orig_args);
1876 object = build_non_dependent_expr (object);
1879 result = build_new_method_call (object, fn, args, NULL_TREE,
1881 ? LOOKUP_NONVIRTUAL : 0),
1884 else if (is_overloaded_fn (fn))
1886 /* If the function is an overloaded builtin, resolve it. */
1887 if (TREE_CODE (fn) == FUNCTION_DECL
1888 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
1889 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
1890 result = resolve_overloaded_builtin (fn, args);
1893 /* A call to a namespace-scope function. */
1894 result = build_new_function_call (fn, args, koenig_p);
1896 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1899 error ("arguments to destructor are not allowed");
1900 /* Mark the pseudo-destructor call as having side-effects so
1901 that we do not issue warnings about its use. */
1902 result = build1 (NOP_EXPR,
1904 TREE_OPERAND (fn, 0));
1905 TREE_SIDE_EFFECTS (result) = 1;
1907 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1908 /* If the "function" is really an object of class type, it might
1909 have an overloaded `operator ()'. */
1910 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1911 /*overloaded_p=*/NULL);
1914 /* A call where the function is unknown. */
1915 result = build_function_call (fn, args);
1917 if (processing_template_decl)
1919 result = build_call_list (TREE_TYPE (result), orig_fn, orig_args);
1920 KOENIG_LOOKUP_P (result) = koenig_p;
1925 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1926 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1927 POSTDECREMENT_EXPR.) */
1930 finish_increment_expr (tree expr, enum tree_code code)
1932 return build_x_unary_op (code, expr);
1935 /* Finish a use of `this'. Returns an expression for `this'. */
1938 finish_this_expr (void)
1942 if (current_class_ptr)
1944 result = current_class_ptr;
1946 else if (current_function_decl
1947 && DECL_STATIC_FUNCTION_P (current_function_decl))
1949 error ("%<this%> is unavailable for static member functions");
1950 result = error_mark_node;
1954 if (current_function_decl)
1955 error ("invalid use of %<this%> in non-member function");
1957 error ("invalid use of %<this%> at top level");
1958 result = error_mark_node;
1964 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
1965 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
1966 the TYPE for the type given. If SCOPE is non-NULL, the expression
1967 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
1970 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
1972 if (destructor == error_mark_node)
1973 return error_mark_node;
1975 gcc_assert (TYPE_P (destructor));
1977 if (!processing_template_decl)
1979 if (scope == error_mark_node)
1981 error ("invalid qualifying scope in pseudo-destructor name");
1982 return error_mark_node;
1984 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
1986 error ("qualified type %qT does not match destructor name ~%qT",
1988 return error_mark_node;
1992 /* [expr.pseudo] says both:
1994 The type designated by the pseudo-destructor-name shall be
1995 the same as the object type.
1999 The cv-unqualified versions of the object type and of the
2000 type designated by the pseudo-destructor-name shall be the
2003 We implement the more generous second sentence, since that is
2004 what most other compilers do. */
2005 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2008 error ("%qE is not of type %qT", object, destructor);
2009 return error_mark_node;
2013 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2016 /* Finish an expression of the form CODE EXPR. */
2019 finish_unary_op_expr (enum tree_code code, tree expr)
2021 tree result = build_x_unary_op (code, expr);
2022 /* Inside a template, build_x_unary_op does not fold the
2023 expression. So check whether the result is folded before
2024 setting TREE_NEGATED_INT. */
2025 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2026 && TREE_CODE (result) == INTEGER_CST
2027 && !TYPE_UNSIGNED (TREE_TYPE (result))
2028 && INT_CST_LT (result, integer_zero_node))
2030 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2031 setting TREE_NEGATED_INT. */
2032 result = copy_node (result);
2033 TREE_NEGATED_INT (result) = 1;
2035 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2036 overflow_warning (result);
2041 /* Finish a compound-literal expression. TYPE is the type to which
2042 the INITIALIZER_LIST is being cast. */
2045 finish_compound_literal (tree type, VEC(constructor_elt,gc) *initializer_list)
2048 tree compound_literal;
2050 if (!TYPE_OBJ_P (type))
2052 error ("compound literal of non-object type %qT", type);
2053 return error_mark_node;
2056 /* Build a CONSTRUCTOR for the INITIALIZER_LIST. */
2057 compound_literal = build_constructor (NULL_TREE, initializer_list);
2058 if (processing_template_decl)
2060 TREE_TYPE (compound_literal) = type;
2061 /* Mark the expression as a compound literal. */
2062 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2063 return compound_literal;
2066 /* Create a temporary variable to represent the compound literal. */
2067 var = create_temporary_var (type);
2068 if (!current_function_decl)
2070 /* If this compound-literal appears outside of a function, then
2071 the corresponding variable has static storage duration, just
2072 like the variable in whose initializer it appears. */
2073 TREE_STATIC (var) = 1;
2074 /* The variable has internal linkage, since there is no need to
2075 reference it from another translation unit. */
2076 TREE_PUBLIC (var) = 0;
2077 /* It must have a name, so that the name mangler can mangle it. */
2078 DECL_NAME (var) = make_anon_name ();
2080 /* We must call pushdecl, since the gimplifier complains if the
2081 variable has not been declared via a BIND_EXPR. */
2083 /* Initialize the variable as we would any other variable with a
2084 brace-enclosed initializer. */
2085 cp_finish_decl (var, compound_literal,
2086 /*init_const_expr_p=*/false,
2087 /*asmspec_tree=*/NULL_TREE,
2088 LOOKUP_ONLYCONVERTING);
2092 /* Return the declaration for the function-name variable indicated by
2096 finish_fname (tree id)
2100 decl = fname_decl (C_RID_CODE (id), id);
2101 if (processing_template_decl)
2102 decl = DECL_NAME (decl);
2106 /* Finish a translation unit. */
2109 finish_translation_unit (void)
2111 /* In case there were missing closebraces,
2112 get us back to the global binding level. */
2114 while (current_namespace != global_namespace)
2117 /* Do file scope __FUNCTION__ et al. */
2118 finish_fname_decls ();
2121 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2122 Returns the parameter. */
2125 finish_template_type_parm (tree aggr, tree identifier)
2127 if (aggr != class_type_node)
2129 pedwarn ("template type parameters must use the keyword %<class%> or %<typename%>");
2130 aggr = class_type_node;
2133 return build_tree_list (aggr, identifier);
2136 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2137 Returns the parameter. */
2140 finish_template_template_parm (tree aggr, tree identifier)
2142 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2143 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2144 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2145 DECL_TEMPLATE_RESULT (tmpl) = decl;
2146 DECL_ARTIFICIAL (decl) = 1;
2147 end_template_decl ();
2149 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2151 return finish_template_type_parm (aggr, tmpl);
2154 /* ARGUMENT is the default-argument value for a template template
2155 parameter. If ARGUMENT is invalid, issue error messages and return
2156 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2159 check_template_template_default_arg (tree argument)
2161 if (TREE_CODE (argument) != TEMPLATE_DECL
2162 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2163 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2165 if (TREE_CODE (argument) == TYPE_DECL)
2166 error ("invalid use of type %qT as a default value for a template "
2167 "template-parameter", TREE_TYPE (argument));
2169 error ("invalid default argument for a template template parameter");
2170 return error_mark_node;
2176 /* Begin a class definition, as indicated by T. */
2179 begin_class_definition (tree t, tree attributes)
2181 if (t == error_mark_node)
2182 return error_mark_node;
2184 if (processing_template_parmlist)
2186 error ("definition of %q#T inside template parameter list", t);
2187 return error_mark_node;
2189 /* A non-implicit typename comes from code like:
2191 template <typename T> struct A {
2192 template <typename U> struct A<T>::B ...
2194 This is erroneous. */
2195 else if (TREE_CODE (t) == TYPENAME_TYPE)
2197 error ("invalid definition of qualified type %qT", t);
2198 t = error_mark_node;
2201 if (t == error_mark_node || ! IS_AGGR_TYPE (t))
2203 t = make_aggr_type (RECORD_TYPE);
2204 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2207 /* Update the location of the decl. */
2208 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2210 if (TYPE_BEING_DEFINED (t))
2212 t = make_aggr_type (TREE_CODE (t));
2213 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2215 maybe_process_partial_specialization (t);
2217 TYPE_BEING_DEFINED (t) = 1;
2219 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2221 if (flag_pack_struct)
2224 TYPE_PACKED (t) = 1;
2225 /* Even though the type is being defined for the first time
2226 here, there might have been a forward declaration, so there
2227 might be cv-qualified variants of T. */
2228 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2229 TYPE_PACKED (v) = 1;
2231 /* Reset the interface data, at the earliest possible
2232 moment, as it might have been set via a class foo;
2234 if (! TYPE_ANONYMOUS_P (t))
2236 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2237 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2238 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2239 (t, finfo->interface_unknown);
2241 reset_specialization();
2243 /* Make a declaration for this class in its own scope. */
2244 build_self_reference ();
2249 /* Finish the member declaration given by DECL. */
2252 finish_member_declaration (tree decl)
2254 if (decl == error_mark_node || decl == NULL_TREE)
2257 if (decl == void_type_node)
2258 /* The COMPONENT was a friend, not a member, and so there's
2259 nothing for us to do. */
2262 /* We should see only one DECL at a time. */
2263 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2265 /* Set up access control for DECL. */
2267 = (current_access_specifier == access_private_node);
2268 TREE_PROTECTED (decl)
2269 = (current_access_specifier == access_protected_node);
2270 if (TREE_CODE (decl) == TEMPLATE_DECL)
2272 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2273 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2276 /* Mark the DECL as a member of the current class. */
2277 DECL_CONTEXT (decl) = current_class_type;
2281 A C language linkage is ignored for the names of class members
2282 and the member function type of class member functions. */
2283 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2284 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2286 /* Put functions on the TYPE_METHODS list and everything else on the
2287 TYPE_FIELDS list. Note that these are built up in reverse order.
2288 We reverse them (to obtain declaration order) in finish_struct. */
2289 if (TREE_CODE (decl) == FUNCTION_DECL
2290 || DECL_FUNCTION_TEMPLATE_P (decl))
2292 /* We also need to add this function to the
2293 CLASSTYPE_METHOD_VEC. */
2294 if (add_method (current_class_type, decl, NULL_TREE))
2296 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2297 TYPE_METHODS (current_class_type) = decl;
2299 maybe_add_class_template_decl_list (current_class_type, decl,
2303 /* Enter the DECL into the scope of the class. */
2304 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2305 || pushdecl_class_level (decl))
2307 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2308 go at the beginning. The reason is that lookup_field_1
2309 searches the list in order, and we want a field name to
2310 override a type name so that the "struct stat hack" will
2311 work. In particular:
2313 struct S { enum E { }; int E } s;
2316 is valid. In addition, the FIELD_DECLs must be maintained in
2317 declaration order so that class layout works as expected.
2318 However, we don't need that order until class layout, so we
2319 save a little time by putting FIELD_DECLs on in reverse order
2320 here, and then reversing them in finish_struct_1. (We could
2321 also keep a pointer to the correct insertion points in the
2324 if (TREE_CODE (decl) == TYPE_DECL)
2325 TYPE_FIELDS (current_class_type)
2326 = chainon (TYPE_FIELDS (current_class_type), decl);
2329 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2330 TYPE_FIELDS (current_class_type) = decl;
2333 maybe_add_class_template_decl_list (current_class_type, decl,
2338 note_decl_for_pch (decl);
2341 /* DECL has been declared while we are building a PCH file. Perform
2342 actions that we might normally undertake lazily, but which can be
2343 performed now so that they do not have to be performed in
2344 translation units which include the PCH file. */
2347 note_decl_for_pch (tree decl)
2349 gcc_assert (pch_file);
2351 /* There's a good chance that we'll have to mangle names at some
2352 point, even if only for emission in debugging information. */
2353 if ((TREE_CODE (decl) == VAR_DECL
2354 || TREE_CODE (decl) == FUNCTION_DECL)
2355 && !processing_template_decl)
2359 /* Finish processing a complete template declaration. The PARMS are
2360 the template parameters. */
2363 finish_template_decl (tree parms)
2366 end_template_decl ();
2368 end_specialization ();
2371 /* Finish processing a template-id (which names a type) of the form
2372 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2373 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2374 the scope of template-id indicated. */
2377 finish_template_type (tree name, tree args, int entering_scope)
2381 decl = lookup_template_class (name, args,
2382 NULL_TREE, NULL_TREE, entering_scope,
2383 tf_warning_or_error | tf_user);
2384 if (decl != error_mark_node)
2385 decl = TYPE_STUB_DECL (decl);
2390 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2391 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2392 BASE_CLASS, or NULL_TREE if an error occurred. The
2393 ACCESS_SPECIFIER is one of
2394 access_{default,public,protected_private}_node. For a virtual base
2395 we set TREE_TYPE. */
2398 finish_base_specifier (tree base, tree access, bool virtual_p)
2402 if (base == error_mark_node)
2404 error ("invalid base-class specification");
2407 else if (! is_aggr_type (base, 1))
2411 if (cp_type_quals (base) != 0)
2413 error ("base class %qT has cv qualifiers", base);
2414 base = TYPE_MAIN_VARIANT (base);
2416 result = build_tree_list (access, base);
2418 TREE_TYPE (result) = integer_type_node;
2424 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2425 what we found when we tried to do the lookup. */
2428 qualified_name_lookup_error (tree scope, tree name, tree decl)
2430 if (scope == error_mark_node)
2431 ; /* We already complained. */
2432 else if (TYPE_P (scope))
2434 if (!COMPLETE_TYPE_P (scope))
2435 error ("incomplete type %qT used in nested name specifier", scope);
2436 else if (TREE_CODE (decl) == TREE_LIST)
2438 error ("reference to %<%T::%D%> is ambiguous", scope, name);
2439 print_candidates (decl);
2442 error ("%qD is not a member of %qT", name, scope);
2444 else if (scope != global_namespace)
2445 error ("%qD is not a member of %qD", name, scope);
2447 error ("%<::%D%> has not been declared", name);
2450 /* If FNS is a member function, a set of member functions, or a
2451 template-id referring to one or more member functions, return a
2452 BASELINK for FNS, incorporating the current access context.
2453 Otherwise, return FNS unchanged. */
2456 baselink_for_fns (tree fns)
2461 if (BASELINK_P (fns)
2462 || error_operand_p (fns))
2466 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2467 fn = TREE_OPERAND (fn, 0);
2468 fn = get_first_fn (fn);
2469 if (!DECL_FUNCTION_MEMBER_P (fn))
2472 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2474 cl = DECL_CONTEXT (fn);
2475 cl = TYPE_BINFO (cl);
2476 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2479 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2480 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2481 if non-NULL, is the type or namespace used to explicitly qualify
2482 ID_EXPRESSION. DECL is the entity to which that name has been
2485 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2486 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2487 be set to true if this expression isn't permitted in a
2488 constant-expression, but it is otherwise not set by this function.
2489 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2490 constant-expression, but a non-constant expression is also
2493 DONE is true if this expression is a complete postfix-expression;
2494 it is false if this expression is followed by '->', '[', '(', etc.
2495 ADDRESS_P is true iff this expression is the operand of '&'.
2496 TEMPLATE_P is true iff the qualified-id was of the form
2497 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2498 appears as a template argument.
2500 If an error occurs, and it is the kind of error that might cause
2501 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2502 is the caller's responsibility to issue the message. *ERROR_MSG
2503 will be a string with static storage duration, so the caller need
2506 Return an expression for the entity, after issuing appropriate
2507 diagnostics. This function is also responsible for transforming a
2508 reference to a non-static member into a COMPONENT_REF that makes
2509 the use of "this" explicit.
2511 Upon return, *IDK will be filled in appropriately. */
2514 finish_id_expression (tree id_expression,
2518 bool integral_constant_expression_p,
2519 bool allow_non_integral_constant_expression_p,
2520 bool *non_integral_constant_expression_p,
2524 bool template_arg_p,
2525 const char **error_msg)
2527 /* Initialize the output parameters. */
2528 *idk = CP_ID_KIND_NONE;
2531 if (id_expression == error_mark_node)
2532 return error_mark_node;
2533 /* If we have a template-id, then no further lookup is
2534 required. If the template-id was for a template-class, we
2535 will sometimes have a TYPE_DECL at this point. */
2536 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2537 || TREE_CODE (decl) == TYPE_DECL)
2539 /* Look up the name. */
2542 if (decl == error_mark_node)
2544 /* Name lookup failed. */
2547 || (!dependent_type_p (scope)
2548 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2549 && IDENTIFIER_TYPENAME_P (id_expression)
2550 && dependent_type_p (TREE_TYPE (id_expression))))))
2552 /* If the qualifying type is non-dependent (and the name
2553 does not name a conversion operator to a dependent
2554 type), issue an error. */
2555 qualified_name_lookup_error (scope, id_expression, decl);
2556 return error_mark_node;
2560 /* It may be resolved via Koenig lookup. */
2561 *idk = CP_ID_KIND_UNQUALIFIED;
2562 return id_expression;
2565 decl = id_expression;
2567 /* If DECL is a variable that would be out of scope under
2568 ANSI/ISO rules, but in scope in the ARM, name lookup
2569 will succeed. Issue a diagnostic here. */
2571 decl = check_for_out_of_scope_variable (decl);
2573 /* Remember that the name was used in the definition of
2574 the current class so that we can check later to see if
2575 the meaning would have been different after the class
2576 was entirely defined. */
2577 if (!scope && decl != error_mark_node)
2578 maybe_note_name_used_in_class (id_expression, decl);
2580 /* Disallow uses of local variables from containing functions. */
2581 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2583 tree context = decl_function_context (decl);
2584 if (context != NULL_TREE && context != current_function_decl
2585 && ! TREE_STATIC (decl))
2587 error (TREE_CODE (decl) == VAR_DECL
2588 ? "use of %<auto%> variable from containing function"
2589 : "use of parameter from containing function");
2590 error (" %q+#D declared here", decl);
2591 return error_mark_node;
2596 /* If we didn't find anything, or what we found was a type,
2597 then this wasn't really an id-expression. */
2598 if (TREE_CODE (decl) == TEMPLATE_DECL
2599 && !DECL_FUNCTION_TEMPLATE_P (decl))
2601 *error_msg = "missing template arguments";
2602 return error_mark_node;
2604 else if (TREE_CODE (decl) == TYPE_DECL
2605 || TREE_CODE (decl) == NAMESPACE_DECL)
2607 *error_msg = "expected primary-expression";
2608 return error_mark_node;
2611 /* If the name resolved to a template parameter, there is no
2612 need to look it up again later. */
2613 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2614 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2618 *idk = CP_ID_KIND_NONE;
2619 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2620 decl = TEMPLATE_PARM_DECL (decl);
2621 r = convert_from_reference (DECL_INITIAL (decl));
2623 if (integral_constant_expression_p
2624 && !dependent_type_p (TREE_TYPE (decl))
2625 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2627 if (!allow_non_integral_constant_expression_p)
2628 error ("template parameter %qD of type %qT is not allowed in "
2629 "an integral constant expression because it is not of "
2630 "integral or enumeration type", decl, TREE_TYPE (decl));
2631 *non_integral_constant_expression_p = true;
2635 /* Similarly, we resolve enumeration constants to their
2636 underlying values. */
2637 else if (TREE_CODE (decl) == CONST_DECL)
2639 *idk = CP_ID_KIND_NONE;
2640 if (!processing_template_decl)
2642 used_types_insert (TREE_TYPE (decl));
2643 return DECL_INITIAL (decl);
2651 /* If the declaration was explicitly qualified indicate
2652 that. The semantics of `A::f(3)' are different than
2653 `f(3)' if `f' is virtual. */
2655 ? CP_ID_KIND_QUALIFIED
2656 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2657 ? CP_ID_KIND_TEMPLATE_ID
2658 : CP_ID_KIND_UNQUALIFIED));
2663 An id-expression is type-dependent if it contains an
2664 identifier that was declared with a dependent type.
2666 The standard is not very specific about an id-expression that
2667 names a set of overloaded functions. What if some of them
2668 have dependent types and some of them do not? Presumably,
2669 such a name should be treated as a dependent name. */
2670 /* Assume the name is not dependent. */
2671 dependent_p = false;
2672 if (!processing_template_decl)
2673 /* No names are dependent outside a template. */
2675 /* A template-id where the name of the template was not resolved
2676 is definitely dependent. */
2677 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2678 && (TREE_CODE (TREE_OPERAND (decl, 0))
2679 == IDENTIFIER_NODE))
2681 /* For anything except an overloaded function, just check its
2683 else if (!is_overloaded_fn (decl))
2685 = dependent_type_p (TREE_TYPE (decl));
2686 /* For a set of overloaded functions, check each of the
2692 if (BASELINK_P (fns))
2693 fns = BASELINK_FUNCTIONS (fns);
2695 /* For a template-id, check to see if the template
2696 arguments are dependent. */
2697 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2699 tree args = TREE_OPERAND (fns, 1);
2700 dependent_p = any_dependent_template_arguments_p (args);
2701 /* The functions are those referred to by the
2703 fns = TREE_OPERAND (fns, 0);
2706 /* If there are no dependent template arguments, go through
2707 the overloaded functions. */
2708 while (fns && !dependent_p)
2710 tree fn = OVL_CURRENT (fns);
2712 /* Member functions of dependent classes are
2714 if (TREE_CODE (fn) == FUNCTION_DECL
2715 && type_dependent_expression_p (fn))
2717 else if (TREE_CODE (fn) == TEMPLATE_DECL
2718 && dependent_template_p (fn))
2721 fns = OVL_NEXT (fns);
2725 /* If the name was dependent on a template parameter, we will
2726 resolve the name at instantiation time. */
2729 /* Create a SCOPE_REF for qualified names, if the scope is
2733 /* Since this name was dependent, the expression isn't
2734 constant -- yet. No error is issued because it might
2735 be constant when things are instantiated. */
2736 if (integral_constant_expression_p)
2737 *non_integral_constant_expression_p = true;
2740 if (address_p && done)
2741 decl = finish_qualified_id_expr (scope, decl,
2745 else if (dependent_type_p (scope))
2746 decl = build_qualified_name (/*type=*/NULL_TREE,
2750 else if (DECL_P (decl))
2751 decl = build_qualified_name (TREE_TYPE (decl),
2756 if (TREE_TYPE (decl))
2757 decl = convert_from_reference (decl);
2760 /* A TEMPLATE_ID already contains all the information we
2762 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2763 return id_expression;
2764 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2765 /* If we found a variable, then name lookup during the
2766 instantiation will always resolve to the same VAR_DECL
2767 (or an instantiation thereof). */
2768 if (TREE_CODE (decl) == VAR_DECL
2769 || TREE_CODE (decl) == PARM_DECL)
2770 return convert_from_reference (decl);
2771 /* The same is true for FIELD_DECL, but we also need to
2772 make sure that the syntax is correct. */
2773 else if (TREE_CODE (decl) == FIELD_DECL)
2775 /* Since SCOPE is NULL here, this is an unqualified name.
2776 Access checking has been performed during name lookup
2777 already. Turn off checking to avoid duplicate errors. */
2778 push_deferring_access_checks (dk_no_check);
2779 decl = finish_non_static_data_member
2780 (decl, current_class_ref,
2781 /*qualifying_scope=*/NULL_TREE);
2782 pop_deferring_access_checks ();
2785 return id_expression;
2788 /* Only certain kinds of names are allowed in constant
2789 expression. Enumerators and template parameters have already
2790 been handled above. */
2791 if (integral_constant_expression_p
2792 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2793 && ! builtin_valid_in_constant_expr_p (decl))
2795 if (!allow_non_integral_constant_expression_p)
2797 error ("%qD cannot appear in a constant-expression", decl);
2798 return error_mark_node;
2800 *non_integral_constant_expression_p = true;
2803 if (TREE_CODE (decl) == NAMESPACE_DECL)
2805 error ("use of namespace %qD as expression", decl);
2806 return error_mark_node;
2808 else if (DECL_CLASS_TEMPLATE_P (decl))
2810 error ("use of class template %qT as expression", decl);
2811 return error_mark_node;
2813 else if (TREE_CODE (decl) == TREE_LIST)
2815 /* Ambiguous reference to base members. */
2816 error ("request for member %qD is ambiguous in "
2817 "multiple inheritance lattice", id_expression);
2818 print_candidates (decl);
2819 return error_mark_node;
2822 /* Mark variable-like entities as used. Functions are similarly
2823 marked either below or after overload resolution. */
2824 if (TREE_CODE (decl) == VAR_DECL
2825 || TREE_CODE (decl) == PARM_DECL
2826 || TREE_CODE (decl) == RESULT_DECL)
2831 decl = (adjust_result_of_qualified_name_lookup
2832 (decl, scope, current_class_type));
2834 if (TREE_CODE (decl) == FUNCTION_DECL)
2837 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2838 decl = finish_qualified_id_expr (scope,
2846 tree r = convert_from_reference (decl);
2848 if (processing_template_decl && TYPE_P (scope))
2849 r = build_qualified_name (TREE_TYPE (r),
2855 else if (TREE_CODE (decl) == FIELD_DECL)
2857 /* Since SCOPE is NULL here, this is an unqualified name.
2858 Access checking has been performed during name lookup
2859 already. Turn off checking to avoid duplicate errors. */
2860 push_deferring_access_checks (dk_no_check);
2861 decl = finish_non_static_data_member (decl, current_class_ref,
2862 /*qualifying_scope=*/NULL_TREE);
2863 pop_deferring_access_checks ();
2865 else if (is_overloaded_fn (decl))
2870 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
2871 first_fn = TREE_OPERAND (first_fn, 0);
2872 first_fn = get_first_fn (first_fn);
2873 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2874 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2876 if (!really_overloaded_fn (decl))
2877 mark_used (first_fn);
2880 && TREE_CODE (first_fn) == FUNCTION_DECL
2881 && DECL_FUNCTION_MEMBER_P (first_fn)
2882 && !shared_member_p (decl))
2884 /* A set of member functions. */
2885 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
2886 return finish_class_member_access_expr (decl, id_expression,
2887 /*template_p=*/false);
2890 decl = baselink_for_fns (decl);
2894 if (DECL_P (decl) && DECL_NONLOCAL (decl)
2895 && DECL_CLASS_SCOPE_P (decl)
2896 && DECL_CONTEXT (decl) != current_class_type)
2900 path = currently_open_derived_class (DECL_CONTEXT (decl));
2901 perform_or_defer_access_check (TYPE_BINFO (path), decl, decl);
2904 decl = convert_from_reference (decl);
2908 if (TREE_DEPRECATED (decl))
2909 warn_deprecated_use (decl);
2914 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
2915 use as a type-specifier. */
2918 finish_typeof (tree expr)
2922 if (type_dependent_expression_p (expr))
2924 type = make_aggr_type (TYPEOF_TYPE);
2925 TYPEOF_TYPE_EXPR (type) = expr;
2930 type = TREE_TYPE (expr);
2932 if (!type || type == unknown_type_node)
2934 error ("type of %qE is unknown", expr);
2935 return error_mark_node;
2941 /* Perform C++-specific checks for __builtin_offsetof before calling
2945 finish_offsetof (tree expr)
2947 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
2949 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
2950 TREE_OPERAND (expr, 2));
2951 return error_mark_node;
2953 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
2954 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
2955 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
2957 if (TREE_CODE (expr) == COMPONENT_REF
2958 || TREE_CODE (expr) == COMPOUND_EXPR)
2959 expr = TREE_OPERAND (expr, 1);
2960 error ("cannot apply %<offsetof%> to member function %qD", expr);
2961 return error_mark_node;
2963 return fold_offsetof (expr, NULL_TREE);
2966 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
2967 with equivalent CALL_EXPRs. */
2970 simplify_aggr_init_exprs_r (tree* tp,
2972 void* data ATTRIBUTE_UNUSED)
2974 /* We don't need to walk into types; there's nothing in a type that
2975 needs simplification. (And, furthermore, there are places we
2976 actively don't want to go. For example, we don't want to wander
2977 into the default arguments for a FUNCTION_DECL that appears in a
2984 /* Only AGGR_INIT_EXPRs are interesting. */
2985 else if (TREE_CODE (*tp) != AGGR_INIT_EXPR)
2988 simplify_aggr_init_expr (tp);
2990 /* Keep iterating. */
2994 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
2995 function is broken out from the above for the benefit of the tree-ssa
2999 simplify_aggr_init_expr (tree *tp)
3001 tree aggr_init_expr = *tp;
3003 /* Form an appropriate CALL_EXPR. */
3004 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3005 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3006 tree type = TREE_TYPE (slot);
3009 enum style_t { ctor, arg, pcc } style;
3011 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3013 #ifdef PCC_STATIC_STRUCT_RETURN
3019 gcc_assert (TREE_ADDRESSABLE (type));
3023 call_expr = build_call_array (TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3025 aggr_init_expr_nargs (aggr_init_expr),
3026 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3030 /* Replace the first argument to the ctor with the address of the
3032 cxx_mark_addressable (slot);
3033 CALL_EXPR_ARG (call_expr, 0) =
3034 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3036 else if (style == arg)
3038 /* Just mark it addressable here, and leave the rest to
3039 expand_call{,_inline}. */
3040 cxx_mark_addressable (slot);
3041 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3042 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3044 else if (style == pcc)
3046 /* If we're using the non-reentrant PCC calling convention, then we
3047 need to copy the returned value out of the static buffer into the
3049 push_deferring_access_checks (dk_no_check);
3050 call_expr = build_aggr_init (slot, call_expr,
3051 DIRECT_BIND | LOOKUP_ONLYCONVERTING);
3052 pop_deferring_access_checks ();
3053 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3059 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3062 emit_associated_thunks (tree fn)
3064 /* When we use vcall offsets, we emit thunks with the virtual
3065 functions to which they thunk. The whole point of vcall offsets
3066 is so that you can know statically the entire set of thunks that
3067 will ever be needed for a given virtual function, thereby
3068 enabling you to output all the thunks with the function itself. */
3069 if (DECL_VIRTUAL_P (fn))
3073 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3075 if (!THUNK_ALIAS (thunk))
3077 use_thunk (thunk, /*emit_p=*/1);
3078 if (DECL_RESULT_THUNK_P (thunk))
3082 for (probe = DECL_THUNKS (thunk);
3083 probe; probe = TREE_CHAIN (probe))
3084 use_thunk (probe, /*emit_p=*/1);
3088 gcc_assert (!DECL_THUNKS (thunk));
3093 /* Generate RTL for FN. */
3096 expand_body (tree fn)
3098 tree saved_function;
3100 /* Compute the appropriate object-file linkage for inline
3102 if (DECL_DECLARED_INLINE_P (fn))
3103 import_export_decl (fn);
3105 /* If FN is external, then there's no point in generating RTL for
3106 it. This situation can arise with an inline function under
3107 `-fexternal-templates'; we instantiate the function, even though
3108 we're not planning on emitting it, in case we get a chance to
3110 if (DECL_EXTERNAL (fn))
3113 /* ??? When is this needed? */
3114 saved_function = current_function_decl;
3116 /* Emit any thunks that should be emitted at the same time as FN. */
3117 emit_associated_thunks (fn);
3119 /* This function is only called from cgraph, or recursively from
3120 emit_associated_thunks. In neither case should we be currently
3121 generating trees for a function. */
3122 gcc_assert (function_depth == 0);
3126 current_function_decl = saved_function;
3128 if (DECL_CLONED_FUNCTION_P (fn))
3130 /* If this is a clone, go through the other clones now and mark
3131 their parameters used. We have to do that here, as we don't
3132 know whether any particular clone will be expanded, and
3133 therefore cannot pick one arbitrarily. */
3136 for (probe = TREE_CHAIN (DECL_CLONED_FUNCTION (fn));
3137 probe && DECL_CLONED_FUNCTION_P (probe);
3138 probe = TREE_CHAIN (probe))
3142 for (parms = DECL_ARGUMENTS (probe);
3143 parms; parms = TREE_CHAIN (parms))
3144 TREE_USED (parms) = 1;
3149 /* Generate RTL for FN. */
3152 expand_or_defer_fn (tree fn)
3154 /* When the parser calls us after finishing the body of a template
3155 function, we don't really want to expand the body. */
3156 if (processing_template_decl)
3158 /* Normally, collection only occurs in rest_of_compilation. So,
3159 if we don't collect here, we never collect junk generated
3160 during the processing of templates until we hit a
3161 non-template function. It's not safe to do this inside a
3162 nested class, though, as the parser may have local state that
3163 is not a GC root. */
3164 if (!function_depth)
3169 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
3170 walk_tree_without_duplicates (&DECL_SAVED_TREE (fn),
3171 simplify_aggr_init_exprs_r,
3174 /* If this is a constructor or destructor body, we have to clone
3176 if (maybe_clone_body (fn))
3178 /* We don't want to process FN again, so pretend we've written
3179 it out, even though we haven't. */
3180 TREE_ASM_WRITTEN (fn) = 1;
3184 /* Keep track of functions declared with the "constructor" and
3185 "destructor" attribute. */
3186 c_record_cdtor_fn (fn);
3188 /* We make a decision about linkage for these functions at the end
3189 of the compilation. Until that point, we do not want the back
3190 end to output them -- but we do want it to see the bodies of
3191 these functions so that it can inline them as appropriate. */
3192 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3194 if (DECL_INTERFACE_KNOWN (fn))
3195 /* We've already made a decision as to how this function will
3199 DECL_EXTERNAL (fn) = 1;
3200 DECL_NOT_REALLY_EXTERN (fn) = 1;
3201 note_vague_linkage_fn (fn);
3202 /* A non-template inline function with external linkage will
3203 always be COMDAT. As we must eventually determine the
3204 linkage of all functions, and as that causes writes to
3205 the data mapped in from the PCH file, it's advantageous
3206 to mark the functions at this point. */
3207 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3209 /* This function must have external linkage, as
3210 otherwise DECL_INTERFACE_KNOWN would have been
3212 gcc_assert (TREE_PUBLIC (fn));
3213 comdat_linkage (fn);
3214 DECL_INTERFACE_KNOWN (fn) = 1;
3218 import_export_decl (fn);
3220 /* If the user wants us to keep all inline functions, then mark
3221 this function as needed so that finish_file will make sure to
3223 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3227 /* There's no reason to do any of the work here if we're only doing
3228 semantic analysis; this code just generates RTL. */
3229 if (flag_syntax_only)
3234 /* Expand or defer, at the whim of the compilation unit manager. */
3235 cgraph_finalize_function (fn, function_depth > 1);
3247 /* Helper function for walk_tree, used by finalize_nrv below. */
3250 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3252 struct nrv_data *dp = (struct nrv_data *)data;
3255 /* No need to walk into types. There wouldn't be any need to walk into
3256 non-statements, except that we have to consider STMT_EXPRs. */
3259 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3260 but differs from using NULL_TREE in that it indicates that we care
3261 about the value of the RESULT_DECL. */
3262 else if (TREE_CODE (*tp) == RETURN_EXPR)
3263 TREE_OPERAND (*tp, 0) = dp->result;
3264 /* Change all cleanups for the NRV to only run when an exception is
3266 else if (TREE_CODE (*tp) == CLEANUP_STMT
3267 && CLEANUP_DECL (*tp) == dp->var)
3268 CLEANUP_EH_ONLY (*tp) = 1;
3269 /* Replace the DECL_EXPR for the NRV with an initialization of the
3270 RESULT_DECL, if needed. */
3271 else if (TREE_CODE (*tp) == DECL_EXPR
3272 && DECL_EXPR_DECL (*tp) == dp->var)
3275 if (DECL_INITIAL (dp->var)
3276 && DECL_INITIAL (dp->var) != error_mark_node)
3278 init = build2 (INIT_EXPR, void_type_node, dp->result,
3279 DECL_INITIAL (dp->var));
3280 DECL_INITIAL (dp->var) = error_mark_node;
3283 init = build_empty_stmt ();
3284 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3287 /* And replace all uses of the NRV with the RESULT_DECL. */
3288 else if (*tp == dp->var)
3291 /* Avoid walking into the same tree more than once. Unfortunately, we
3292 can't just use walk_tree_without duplicates because it would only call
3293 us for the first occurrence of dp->var in the function body. */
3294 slot = htab_find_slot (dp->visited, *tp, INSERT);
3300 /* Keep iterating. */
3304 /* Called from finish_function to implement the named return value
3305 optimization by overriding all the RETURN_EXPRs and pertinent
3306 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3307 RESULT_DECL for the function. */
3310 finalize_nrv (tree *tp, tree var, tree result)
3312 struct nrv_data data;
3314 /* Copy debugging information from VAR to RESULT. */
3315 DECL_NAME (result) = DECL_NAME (var);
3316 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3317 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3318 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3319 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3320 /* Don't forget that we take its address. */
3321 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3324 data.result = result;
3325 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3326 walk_tree (tp, finalize_nrv_r, &data, 0);
3327 htab_delete (data.visited);
3330 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3331 Remove any elements from the list that are invalid. */
3334 finish_omp_clauses (tree clauses)
3336 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3337 tree c, t, *pc = &clauses;
3340 bitmap_obstack_initialize (NULL);
3341 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3342 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3343 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3345 for (pc = &clauses, c = clauses; c ; c = *pc)
3347 bool remove = false;
3349 switch (OMP_CLAUSE_CODE (c))
3351 case OMP_CLAUSE_SHARED:
3353 goto check_dup_generic;
3354 case OMP_CLAUSE_PRIVATE:
3356 goto check_dup_generic;
3357 case OMP_CLAUSE_REDUCTION:
3359 goto check_dup_generic;
3360 case OMP_CLAUSE_COPYPRIVATE:
3361 name = "copyprivate";
3362 goto check_dup_generic;
3363 case OMP_CLAUSE_COPYIN:
3365 goto check_dup_generic;
3367 t = OMP_CLAUSE_DECL (c);
3368 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3370 if (processing_template_decl)
3372 error ("%qE is not a variable in clause %qs", t, name);
3375 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3376 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3377 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3379 error ("%qE appears more than once in data clauses", t);
3383 bitmap_set_bit (&generic_head, DECL_UID (t));
3386 case OMP_CLAUSE_FIRSTPRIVATE:
3387 t = OMP_CLAUSE_DECL (c);
3388 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3390 if (processing_template_decl)
3392 error ("%qE is not a variable in clause %<firstprivate%>", t);
3395 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3396 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3398 error ("%qE appears more than once in data clauses", t);
3402 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3405 case OMP_CLAUSE_LASTPRIVATE:
3406 t = OMP_CLAUSE_DECL (c);
3407 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3409 if (processing_template_decl)
3411 error ("%qE is not a variable in clause %<lastprivate%>", t);
3414 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3415 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3417 error ("%qE appears more than once in data clauses", t);
3421 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3425 t = OMP_CLAUSE_IF_EXPR (c);
3426 t = maybe_convert_cond (t);
3427 if (t == error_mark_node)
3429 OMP_CLAUSE_IF_EXPR (c) = t;
3432 case OMP_CLAUSE_NUM_THREADS:
3433 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3434 if (t == error_mark_node)
3436 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
3437 && !type_dependent_expression_p (t))
3439 error ("num_threads expression must be integral");
3444 case OMP_CLAUSE_SCHEDULE:
3445 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3448 else if (t == error_mark_node)
3450 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
3451 && !type_dependent_expression_p (t))
3453 error ("schedule chunk size expression must be integral");
3458 case OMP_CLAUSE_NOWAIT:
3459 case OMP_CLAUSE_ORDERED:
3460 case OMP_CLAUSE_DEFAULT:
3468 *pc = OMP_CLAUSE_CHAIN (c);
3470 pc = &OMP_CLAUSE_CHAIN (c);
3473 for (pc = &clauses, c = clauses; c ; c = *pc)
3475 enum tree_code c_kind = OMP_CLAUSE_CODE (c);
3476 bool remove = false;
3477 bool need_complete_non_reference = false;
3478 bool need_default_ctor = false;
3479 bool need_copy_ctor = false;
3480 bool need_copy_assignment = false;
3481 bool need_implicitly_determined = false;
3482 tree type, inner_type;
3486 case OMP_CLAUSE_SHARED:
3488 need_implicitly_determined = true;
3490 case OMP_CLAUSE_PRIVATE:
3492 need_complete_non_reference = true;
3493 need_default_ctor = true;
3494 need_implicitly_determined = true;
3496 case OMP_CLAUSE_FIRSTPRIVATE:
3497 name = "firstprivate";
3498 need_complete_non_reference = true;
3499 need_copy_ctor = true;
3500 need_implicitly_determined = true;
3502 case OMP_CLAUSE_LASTPRIVATE:
3503 name = "lastprivate";
3504 need_complete_non_reference = true;
3505 need_copy_assignment = true;
3506 need_implicitly_determined = true;
3508 case OMP_CLAUSE_REDUCTION:
3510 need_implicitly_determined = true;
3512 case OMP_CLAUSE_COPYPRIVATE:
3513 name = "copyprivate";
3514 need_copy_assignment = true;
3516 case OMP_CLAUSE_COPYIN:
3518 need_copy_assignment = true;
3521 pc = &OMP_CLAUSE_CHAIN (c);
3525 t = OMP_CLAUSE_DECL (c);
3526 if (processing_template_decl
3527 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3529 pc = &OMP_CLAUSE_CHAIN (c);
3535 case OMP_CLAUSE_LASTPRIVATE:
3536 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3537 need_default_ctor = true;
3540 case OMP_CLAUSE_REDUCTION:
3541 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3542 || POINTER_TYPE_P (TREE_TYPE (t)))
3544 error ("%qE has invalid type for %<reduction%>", t);
3547 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3549 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3557 error ("%qE has invalid type for %<reduction(%s)%>",
3558 t, operator_name_info[r_code].name);
3564 case OMP_CLAUSE_COPYIN:
3565 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3567 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3576 if (need_complete_non_reference)
3578 t = require_complete_type (t);
3579 if (t == error_mark_node)
3581 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3583 error ("%qE has reference type for %qs", t, name);
3587 if (need_implicitly_determined)
3589 const char *share_name = NULL;
3591 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3592 share_name = "threadprivate";
3593 else switch (cxx_omp_predetermined_sharing (t))
3595 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3597 case OMP_CLAUSE_DEFAULT_SHARED:
3598 share_name = "shared";
3600 case OMP_CLAUSE_DEFAULT_PRIVATE:
3601 share_name = "private";
3608 error ("%qE is predetermined %qs for %qs",
3609 t, share_name, name);
3614 /* We're interested in the base element, not arrays. */
3615 inner_type = type = TREE_TYPE (t);
3616 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3617 inner_type = TREE_TYPE (inner_type);
3619 /* Check for special function availability by building a call to one.
3620 Save the results, because later we won't be in the right context
3621 for making these queries. */
3622 if (CLASS_TYPE_P (inner_type)
3623 && (need_default_ctor || need_copy_ctor || need_copy_assignment))
3625 int save_errorcount = errorcount;
3628 /* Always allocate 3 elements for simplicity. These are the
3629 function decls for the ctor, dtor, and assignment op.
3630 This layout is known to the three lang hooks,
3631 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3632 and cxx_omp_clause_assign_op. */
3633 info = make_tree_vec (3);
3634 CP_OMP_CLAUSE_INFO (c) = info;
3636 if (need_default_ctor
3638 && !TYPE_HAS_TRIVIAL_INIT_REF (inner_type)))
3640 if (need_default_ctor)
3644 t = build_int_cst (build_pointer_type (inner_type), 0);
3645 t = build1 (INDIRECT_REF, inner_type, t);
3646 t = build_tree_list (NULL, t);
3648 t = build_special_member_call (NULL_TREE,
3649 complete_ctor_identifier,
3650 t, inner_type, LOOKUP_NORMAL);
3651 t = get_callee_fndecl (t);
3652 TREE_VEC_ELT (info, 0) = t;
3655 if ((need_default_ctor || need_copy_ctor)
3656 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_type))
3658 t = build_int_cst (build_pointer_type (inner_type), 0);
3659 t = build1 (INDIRECT_REF, inner_type, t);
3660 t = build_special_member_call (t, complete_dtor_identifier,
3661 NULL, inner_type, LOOKUP_NORMAL);
3662 t = get_callee_fndecl (t);
3663 TREE_VEC_ELT (info, 1) = t;
3666 if (need_copy_assignment
3667 && !TYPE_HAS_TRIVIAL_ASSIGN_REF (inner_type))
3669 t = build_int_cst (build_pointer_type (inner_type), 0);
3670 t = build1 (INDIRECT_REF, inner_type, t);
3671 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3672 build_tree_list (NULL, t),
3673 inner_type, LOOKUP_NORMAL);
3675 /* We'll have called convert_from_reference on the call, which
3676 may well have added an indirect_ref. It's unneeded here,
3677 and in the way, so kill it. */
3678 if (TREE_CODE (t) == INDIRECT_REF)
3679 t = TREE_OPERAND (t, 0);
3681 t = get_callee_fndecl (t);
3682 TREE_VEC_ELT (info, 2) = t;
3685 if (errorcount != save_errorcount)
3690 *pc = OMP_CLAUSE_CHAIN (c);
3692 pc = &OMP_CLAUSE_CHAIN (c);
3695 bitmap_obstack_release (NULL);
3699 /* For all variables in the tree_list VARS, mark them as thread local. */
3702 finish_omp_threadprivate (tree vars)
3706 /* Mark every variable in VARS to be assigned thread local storage. */
3707 for (t = vars; t; t = TREE_CHAIN (t))
3709 tree v = TREE_PURPOSE (t);
3711 /* If V had already been marked threadprivate, it doesn't matter
3712 whether it had been used prior to this point. */
3714 && (DECL_LANG_SPECIFIC (v) == NULL
3715 || !CP_DECL_THREADPRIVATE_P (v)))
3716 error ("%qE declared %<threadprivate%> after first use", v);
3717 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3718 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3719 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3720 error ("%<threadprivate%> %qE has incomplete type", v);
3721 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v)))
3722 error ("%<threadprivate%> %qE is not file, namespace "
3723 "or block scope variable", v);
3726 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3727 if (DECL_LANG_SPECIFIC (v) == NULL)
3729 retrofit_lang_decl (v);
3731 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3732 after the allocation of the lang_decl structure. */
3733 if (DECL_DISCRIMINATOR_P (v))
3734 DECL_LANG_SPECIFIC (v)->decl_flags.u2sel = 1;
3737 if (! DECL_THREAD_LOCAL_P (v))
3739 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3740 /* If rtl has been already set for this var, call
3741 make_decl_rtl once again, so that encode_section_info
3742 has a chance to look at the new decl flags. */
3743 if (DECL_RTL_SET_P (v))
3746 CP_DECL_THREADPRIVATE_P (v) = 1;
3751 /* Build an OpenMP structured block. */
3754 begin_omp_structured_block (void)
3756 return do_pushlevel (sk_omp);
3760 finish_omp_structured_block (tree block)
3762 return do_poplevel (block);
3765 /* Similarly, except force the retention of the BLOCK. */
3768 begin_omp_parallel (void)
3770 keep_next_level (true);
3771 return begin_omp_structured_block ();
3775 finish_omp_parallel (tree clauses, tree body)
3779 body = finish_omp_structured_block (body);
3781 stmt = make_node (OMP_PARALLEL);
3782 TREE_TYPE (stmt) = void_type_node;
3783 OMP_PARALLEL_CLAUSES (stmt) = clauses;
3784 OMP_PARALLEL_BODY (stmt) = body;
3786 return add_stmt (stmt);
3789 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
3790 are directly for their associated operands in the statement. DECL
3791 and INIT are a combo; if DECL is NULL then INIT ought to be a
3792 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
3793 optional statements that need to go before the loop into its
3797 finish_omp_for (location_t locus, tree decl, tree init, tree cond,
3798 tree incr, tree body, tree pre_body)
3803 switch (TREE_CODE (init))
3806 decl = TREE_OPERAND (init, 0);
3807 init = TREE_OPERAND (init, 1);
3810 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
3812 decl = TREE_OPERAND (init, 0);
3813 init = TREE_OPERAND (init, 2);
3822 error ("expected iteration declaration or initialization");
3827 if (type_dependent_expression_p (decl)
3828 || type_dependent_expression_p (init)
3829 || (cond && type_dependent_expression_p (cond))
3830 || (incr && type_dependent_expression_p (incr)))
3836 error ("%Hmissing controlling predicate", &locus);
3842 error ("%Hmissing increment expression", &locus);
3846 stmt = make_node (OMP_FOR);
3848 /* This is really just a place-holder. We'll be decomposing this
3849 again and going through the build_modify_expr path below when
3850 we instantiate the thing. */
3851 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
3853 TREE_TYPE (stmt) = void_type_node;
3854 OMP_FOR_INIT (stmt) = init;
3855 OMP_FOR_COND (stmt) = cond;
3856 OMP_FOR_INCR (stmt) = incr;
3857 OMP_FOR_BODY (stmt) = body;
3858 OMP_FOR_PRE_BODY (stmt) = pre_body;
3860 SET_EXPR_LOCATION (stmt, locus);
3861 return add_stmt (stmt);
3866 error ("expected iteration declaration or initialization");
3870 if (pre_body == NULL || IS_EMPTY_STMT (pre_body))
3872 else if (! processing_template_decl)
3874 add_stmt (pre_body);
3877 init = build_modify_expr (decl, NOP_EXPR, init);
3878 return c_finish_omp_for (locus, decl, init, cond, incr, body, pre_body);
3882 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
3886 if (processing_template_decl
3887 && (type_dependent_expression_p (lhs)
3888 || type_dependent_expression_p (rhs)))
3889 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
3890 build2 (code, void_type_node, lhs, rhs));
3893 /* Even in a template, we can detect invalid uses of the atomic
3894 pragma if neither LHS nor RHS is type-dependent. */
3895 if (processing_template_decl)
3897 lhs = build_non_dependent_expr (lhs);
3898 rhs = build_non_dependent_expr (rhs);
3901 stmt = c_finish_omp_atomic (code, lhs, rhs);
3904 if (stmt != error_mark_node)
3909 finish_omp_barrier (void)
3911 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
3912 tree stmt = finish_call_expr (fn, NULL, false, false);
3913 finish_expr_stmt (stmt);
3917 finish_omp_flush (void)
3919 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
3920 tree stmt = finish_call_expr (fn, NULL, false, false);
3921 finish_expr_stmt (stmt);
3924 /* True if OpenMP sharing attribute of DECL is predetermined. */
3926 enum omp_clause_default_kind
3927 cxx_omp_predetermined_sharing (tree decl)
3929 enum omp_clause_default_kind kind;
3931 kind = c_omp_predetermined_sharing (decl);
3932 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
3935 /* Static data members are predetermined as shared. */
3936 if (TREE_STATIC (decl))
3938 tree ctx = CP_DECL_CONTEXT (decl);
3939 if (TYPE_P (ctx) && IS_AGGR_TYPE (ctx))
3940 return OMP_CLAUSE_DEFAULT_SHARED;
3943 return OMP_CLAUSE_DEFAULT_UNSPECIFIED;
3947 init_cp_semantics (void)
3951 /* Build a STATIC_ASSERT for a static assertion with the condition
3952 CONDITION and the message text MESSAGE. LOCATION is the location
3953 of the static assertion in the source code. When MEMBER_P, this
3954 static assertion is a member of a class. */
3956 finish_static_assert (tree condition, tree message, location_t location,
3959 if (type_dependent_expression_p (condition)
3960 || value_dependent_expression_p (condition))
3962 /* We're in a template; build a STATIC_ASSERT and put it in
3966 assertion = make_node (STATIC_ASSERT);
3967 STATIC_ASSERT_CONDITION (assertion) = condition;
3968 STATIC_ASSERT_MESSAGE (assertion) = message;
3969 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
3972 maybe_add_class_template_decl_list (current_class_type,
3976 add_stmt (assertion);
3981 /* Fold the expression and convert it to a boolean value. */
3982 condition = fold_non_dependent_expr (condition);
3983 condition = cp_convert (boolean_type_node, condition);
3985 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
3986 /* Do nothing; the condition is satisfied. */
3990 location_t saved_loc = input_location;
3992 input_location = location;
3993 if (TREE_CODE (condition) == INTEGER_CST
3994 && integer_zerop (condition))
3995 /* Report the error. */
3996 error ("static assertion failed: %E", message);
3997 else if (condition && condition != error_mark_node)
3998 error ("non-constant condition for static assertion");
3999 input_location = saved_loc;
4003 #include "gt-cp-semantics.h"