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 2008, 2009, 2010, 2011 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 3, 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 COPYING3. If not see
25 <http://www.gnu.org/licenses/>. */
29 #include "coretypes.h"
33 #include "c-family/c-common.h"
34 #include "c-family/c-objc.h"
35 #include "tree-inline.h"
36 #include "tree-mudflap.h"
42 #include "diagnostic.h"
44 #include "tree-iterator.h"
50 /* There routines provide a modular interface to perform many parsing
51 operations. They may therefore be used during actual parsing, or
52 during template instantiation, which may be regarded as a
53 degenerate form of parsing. */
55 static tree maybe_convert_cond (tree);
56 static tree finalize_nrv_r (tree *, int *, void *);
57 static tree capture_decltype (tree);
60 /* Deferred Access Checking Overview
61 ---------------------------------
63 Most C++ expressions and declarations require access checking
64 to be performed during parsing. However, in several cases,
65 this has to be treated differently.
67 For member declarations, access checking has to be deferred
68 until more information about the declaration is known. For
80 When we are parsing the function return type `A::X', we don't
81 really know if this is allowed until we parse the function name.
83 Furthermore, some contexts require that access checking is
84 never performed at all. These include class heads, and template
87 Typical use of access checking functions is described here:
89 1. When we enter a context that requires certain access checking
90 mode, the function `push_deferring_access_checks' is called with
91 DEFERRING argument specifying the desired mode. Access checking
92 may be performed immediately (dk_no_deferred), deferred
93 (dk_deferred), or not performed (dk_no_check).
95 2. When a declaration such as a type, or a variable, is encountered,
96 the function `perform_or_defer_access_check' is called. It
97 maintains a VEC of all deferred checks.
99 3. The global `current_class_type' or `current_function_decl' is then
100 setup by the parser. `enforce_access' relies on these information
103 4. Upon exiting the context mentioned in step 1,
104 `perform_deferred_access_checks' is called to check all declaration
105 stored in the VEC. `pop_deferring_access_checks' is then
106 called to restore the previous access checking mode.
108 In case of parsing error, we simply call `pop_deferring_access_checks'
109 without `perform_deferred_access_checks'. */
111 typedef struct GTY(()) deferred_access {
112 /* A VEC representing name-lookups for which we have deferred
113 checking access controls. We cannot check the accessibility of
114 names used in a decl-specifier-seq until we know what is being
115 declared because code like:
122 A::B* A::f() { return 0; }
124 is valid, even though `A::B' is not generally accessible. */
125 VEC (deferred_access_check,gc)* GTY(()) deferred_access_checks;
127 /* The current mode of access checks. */
128 enum deferring_kind deferring_access_checks_kind;
131 DEF_VEC_O (deferred_access);
132 DEF_VEC_ALLOC_O (deferred_access,gc);
134 /* Data for deferred access checking. */
135 static GTY(()) VEC(deferred_access,gc) *deferred_access_stack;
136 static GTY(()) unsigned deferred_access_no_check;
138 /* Save the current deferred access states and start deferred
139 access checking iff DEFER_P is true. */
142 push_deferring_access_checks (deferring_kind deferring)
144 /* For context like template instantiation, access checking
145 disabling applies to all nested context. */
146 if (deferred_access_no_check || deferring == dk_no_check)
147 deferred_access_no_check++;
150 deferred_access *ptr;
152 ptr = VEC_safe_push (deferred_access, gc, deferred_access_stack, NULL);
153 ptr->deferred_access_checks = NULL;
154 ptr->deferring_access_checks_kind = deferring;
158 /* Resume deferring access checks again after we stopped doing
162 resume_deferring_access_checks (void)
164 if (!deferred_access_no_check)
165 VEC_last (deferred_access, deferred_access_stack)
166 ->deferring_access_checks_kind = dk_deferred;
169 /* Stop deferring access checks. */
172 stop_deferring_access_checks (void)
174 if (!deferred_access_no_check)
175 VEC_last (deferred_access, deferred_access_stack)
176 ->deferring_access_checks_kind = dk_no_deferred;
179 /* Discard the current deferred access checks and restore the
183 pop_deferring_access_checks (void)
185 if (deferred_access_no_check)
186 deferred_access_no_check--;
188 VEC_pop (deferred_access, deferred_access_stack);
191 /* Returns a TREE_LIST representing the deferred checks.
192 The TREE_PURPOSE of each node is the type through which the
193 access occurred; the TREE_VALUE is the declaration named.
196 VEC (deferred_access_check,gc)*
197 get_deferred_access_checks (void)
199 if (deferred_access_no_check)
202 return (VEC_last (deferred_access, deferred_access_stack)
203 ->deferred_access_checks);
206 /* Take current deferred checks and combine with the
207 previous states if we also defer checks previously.
208 Otherwise perform checks now. */
211 pop_to_parent_deferring_access_checks (void)
213 if (deferred_access_no_check)
214 deferred_access_no_check--;
217 VEC (deferred_access_check,gc) *checks;
218 deferred_access *ptr;
220 checks = (VEC_last (deferred_access, deferred_access_stack)
221 ->deferred_access_checks);
223 VEC_pop (deferred_access, deferred_access_stack);
224 ptr = VEC_last (deferred_access, deferred_access_stack);
225 if (ptr->deferring_access_checks_kind == dk_no_deferred)
228 perform_access_checks (checks);
232 /* Merge with parent. */
234 deferred_access_check *chk, *probe;
236 FOR_EACH_VEC_ELT (deferred_access_check, checks, i, chk)
238 FOR_EACH_VEC_ELT (deferred_access_check,
239 ptr->deferred_access_checks, j, probe)
241 if (probe->binfo == chk->binfo &&
242 probe->decl == chk->decl &&
243 probe->diag_decl == chk->diag_decl)
246 /* Insert into parent's checks. */
247 VEC_safe_push (deferred_access_check, gc,
248 ptr->deferred_access_checks, chk);
255 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
256 is the BINFO indicating the qualifying scope used to access the
257 DECL node stored in the TREE_VALUE of the node. */
260 perform_access_checks (VEC (deferred_access_check,gc)* checks)
263 deferred_access_check *chk;
268 FOR_EACH_VEC_ELT (deferred_access_check, checks, i, chk)
269 enforce_access (chk->binfo, chk->decl, chk->diag_decl);
272 /* Perform the deferred access checks.
274 After performing the checks, we still have to keep the list
275 `deferred_access_stack->deferred_access_checks' since we may want
276 to check access for them again later in a different context.
283 A::X A::a, x; // No error for `A::a', error for `x'
285 We have to perform deferred access of `A::X', first with `A::a',
289 perform_deferred_access_checks (void)
291 perform_access_checks (get_deferred_access_checks ());
294 /* Defer checking the accessibility of DECL, when looked up in
295 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */
298 perform_or_defer_access_check (tree binfo, tree decl, tree diag_decl)
301 deferred_access *ptr;
302 deferred_access_check *chk;
303 deferred_access_check *new_access;
306 /* Exit if we are in a context that no access checking is performed.
308 if (deferred_access_no_check)
311 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
313 ptr = VEC_last (deferred_access, deferred_access_stack);
315 /* If we are not supposed to defer access checks, just check now. */
316 if (ptr->deferring_access_checks_kind == dk_no_deferred)
318 enforce_access (binfo, decl, diag_decl);
322 /* See if we are already going to perform this check. */
323 FOR_EACH_VEC_ELT (deferred_access_check,
324 ptr->deferred_access_checks, i, chk)
326 if (chk->decl == decl && chk->binfo == binfo &&
327 chk->diag_decl == diag_decl)
332 /* If not, record the check. */
334 VEC_safe_push (deferred_access_check, gc,
335 ptr->deferred_access_checks, 0);
336 new_access->binfo = binfo;
337 new_access->decl = decl;
338 new_access->diag_decl = diag_decl;
341 /* Used by build_over_call in LOOKUP_SPECULATIVE mode: return whether DECL
342 is accessible in BINFO, and possibly complain if not. If we're not
343 checking access, everything is accessible. */
346 speculative_access_check (tree binfo, tree decl, tree diag_decl,
349 if (deferred_access_no_check)
352 /* If we're checking for implicit delete, we don't want access
354 if (!accessible_p (binfo, decl, true))
356 /* Unless we're under maybe_explain_implicit_delete. */
358 enforce_access (binfo, decl, diag_decl);
365 /* Returns nonzero if the current statement is a full expression,
366 i.e. temporaries created during that statement should be destroyed
367 at the end of the statement. */
370 stmts_are_full_exprs_p (void)
372 return current_stmt_tree ()->stmts_are_full_exprs_p;
375 /* T is a statement. Add it to the statement-tree. This is the C++
376 version. The C/ObjC frontends have a slightly different version of
382 enum tree_code code = TREE_CODE (t);
384 if (EXPR_P (t) && code != LABEL_EXPR)
386 if (!EXPR_HAS_LOCATION (t))
387 SET_EXPR_LOCATION (t, input_location);
389 /* When we expand a statement-tree, we must know whether or not the
390 statements are full-expressions. We record that fact here. */
391 STMT_IS_FULL_EXPR_P (t) = stmts_are_full_exprs_p ();
394 /* Add T to the statement-tree. Non-side-effect statements need to be
395 recorded during statement expressions. */
396 gcc_checking_assert (!VEC_empty (tree, stmt_list_stack));
397 append_to_statement_list_force (t, &cur_stmt_list);
402 /* Returns the stmt_tree to which statements are currently being added. */
405 current_stmt_tree (void)
408 ? &cfun->language->base.x_stmt_tree
409 : &scope_chain->x_stmt_tree);
412 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
415 maybe_cleanup_point_expr (tree expr)
417 if (!processing_template_decl && stmts_are_full_exprs_p ())
418 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
422 /* Like maybe_cleanup_point_expr except have the type of the new expression be
423 void so we don't need to create a temporary variable to hold the inner
424 expression. The reason why we do this is because the original type might be
425 an aggregate and we cannot create a temporary variable for that type. */
428 maybe_cleanup_point_expr_void (tree expr)
430 if (!processing_template_decl && stmts_are_full_exprs_p ())
431 expr = fold_build_cleanup_point_expr (void_type_node, expr);
437 /* Create a declaration statement for the declaration given by the DECL. */
440 add_decl_expr (tree decl)
442 tree r = build_stmt (input_location, DECL_EXPR, decl);
443 if (DECL_INITIAL (decl)
444 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
445 r = maybe_cleanup_point_expr_void (r);
449 /* Finish a scope. */
452 do_poplevel (tree stmt_list)
456 if (stmts_are_full_exprs_p ())
457 block = poplevel (kept_level_p (), 1, 0);
459 stmt_list = pop_stmt_list (stmt_list);
461 if (!processing_template_decl)
463 stmt_list = c_build_bind_expr (input_location, block, stmt_list);
464 /* ??? See c_end_compound_stmt re statement expressions. */
470 /* Begin a new scope. */
473 do_pushlevel (scope_kind sk)
475 tree ret = push_stmt_list ();
476 if (stmts_are_full_exprs_p ())
477 begin_scope (sk, NULL);
481 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
482 when the current scope is exited. EH_ONLY is true when this is not
483 meant to apply to normal control flow transfer. */
486 push_cleanup (tree decl, tree cleanup, bool eh_only)
488 tree stmt = build_stmt (input_location, CLEANUP_STMT, NULL, cleanup, decl);
489 CLEANUP_EH_ONLY (stmt) = eh_only;
491 CLEANUP_BODY (stmt) = push_stmt_list ();
494 /* Begin a conditional that might contain a declaration. When generating
495 normal code, we want the declaration to appear before the statement
496 containing the conditional. When generating template code, we want the
497 conditional to be rendered as the raw DECL_EXPR. */
500 begin_cond (tree *cond_p)
502 if (processing_template_decl)
503 *cond_p = push_stmt_list ();
506 /* Finish such a conditional. */
509 finish_cond (tree *cond_p, tree expr)
511 if (processing_template_decl)
513 tree cond = pop_stmt_list (*cond_p);
514 if (TREE_CODE (cond) == DECL_EXPR)
517 if (check_for_bare_parameter_packs (expr))
518 *cond_p = error_mark_node;
523 /* If *COND_P specifies a conditional with a declaration, transform the
526 for (; A x = 42;) { }
528 while (true) { A x = 42; if (!x) break; }
529 for (;;) { A x = 42; if (!x) break; }
530 The statement list for BODY will be empty if the conditional did
531 not declare anything. */
534 simplify_loop_decl_cond (tree *cond_p, tree body)
538 if (!TREE_SIDE_EFFECTS (body))
542 *cond_p = boolean_true_node;
544 if_stmt = begin_if_stmt ();
545 cond = cp_build_unary_op (TRUTH_NOT_EXPR, cond, 0, tf_warning_or_error);
546 finish_if_stmt_cond (cond, if_stmt);
547 finish_break_stmt ();
548 finish_then_clause (if_stmt);
549 finish_if_stmt (if_stmt);
552 /* Finish a goto-statement. */
555 finish_goto_stmt (tree destination)
557 if (TREE_CODE (destination) == IDENTIFIER_NODE)
558 destination = lookup_label (destination);
560 /* We warn about unused labels with -Wunused. That means we have to
561 mark the used labels as used. */
562 if (TREE_CODE (destination) == LABEL_DECL)
563 TREE_USED (destination) = 1;
566 destination = mark_rvalue_use (destination);
567 if (!processing_template_decl)
569 destination = cp_convert (ptr_type_node, destination);
570 if (error_operand_p (destination))
575 check_goto (destination);
577 return add_stmt (build_stmt (input_location, GOTO_EXPR, destination));
580 /* COND is the condition-expression for an if, while, etc.,
581 statement. Convert it to a boolean value, if appropriate.
582 In addition, verify sequence points if -Wsequence-point is enabled. */
585 maybe_convert_cond (tree cond)
587 /* Empty conditions remain empty. */
591 /* Wait until we instantiate templates before doing conversion. */
592 if (processing_template_decl)
595 if (warn_sequence_point)
596 verify_sequence_points (cond);
598 /* Do the conversion. */
599 cond = convert_from_reference (cond);
601 if (TREE_CODE (cond) == MODIFY_EXPR
602 && !TREE_NO_WARNING (cond)
605 warning (OPT_Wparentheses,
606 "suggest parentheses around assignment used as truth value");
607 TREE_NO_WARNING (cond) = 1;
610 return condition_conversion (cond);
613 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
616 finish_expr_stmt (tree expr)
620 if (expr != NULL_TREE)
622 if (!processing_template_decl)
624 if (warn_sequence_point)
625 verify_sequence_points (expr);
626 expr = convert_to_void (expr, ICV_STATEMENT, tf_warning_or_error);
628 else if (!type_dependent_expression_p (expr))
629 convert_to_void (build_non_dependent_expr (expr), ICV_STATEMENT,
630 tf_warning_or_error);
632 if (check_for_bare_parameter_packs (expr))
633 expr = error_mark_node;
635 /* Simplification of inner statement expressions, compound exprs,
636 etc can result in us already having an EXPR_STMT. */
637 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
639 if (TREE_CODE (expr) != EXPR_STMT)
640 expr = build_stmt (input_location, EXPR_STMT, expr);
641 expr = maybe_cleanup_point_expr_void (expr);
653 /* Begin an if-statement. Returns a newly created IF_STMT if
660 scope = do_pushlevel (sk_cond);
661 r = build_stmt (input_location, IF_STMT, NULL_TREE,
662 NULL_TREE, NULL_TREE, scope);
663 begin_cond (&IF_COND (r));
667 /* Process the COND of an if-statement, which may be given by
671 finish_if_stmt_cond (tree cond, tree if_stmt)
673 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
675 THEN_CLAUSE (if_stmt) = push_stmt_list ();
678 /* Finish the then-clause of an if-statement, which may be given by
682 finish_then_clause (tree if_stmt)
684 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
688 /* Begin the else-clause of an if-statement. */
691 begin_else_clause (tree if_stmt)
693 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
696 /* Finish the else-clause of an if-statement, which may be given by
700 finish_else_clause (tree if_stmt)
702 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
705 /* Finish an if-statement. */
708 finish_if_stmt (tree if_stmt)
710 tree scope = IF_SCOPE (if_stmt);
711 IF_SCOPE (if_stmt) = NULL;
712 add_stmt (do_poplevel (scope));
716 /* Begin a while-statement. Returns a newly created WHILE_STMT if
720 begin_while_stmt (void)
723 r = build_stmt (input_location, WHILE_STMT, NULL_TREE, NULL_TREE);
725 WHILE_BODY (r) = do_pushlevel (sk_block);
726 begin_cond (&WHILE_COND (r));
730 /* Process the COND of a while-statement, which may be given by
734 finish_while_stmt_cond (tree cond, tree while_stmt)
736 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
737 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
740 /* Finish a while-statement, which may be given by WHILE_STMT. */
743 finish_while_stmt (tree while_stmt)
745 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
749 /* Begin a do-statement. Returns a newly created DO_STMT if
755 tree r = build_stmt (input_location, DO_STMT, NULL_TREE, NULL_TREE);
757 DO_BODY (r) = push_stmt_list ();
761 /* Finish the body of a do-statement, which may be given by DO_STMT. */
764 finish_do_body (tree do_stmt)
766 tree body = DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
768 if (TREE_CODE (body) == STATEMENT_LIST && STATEMENT_LIST_TAIL (body))
769 body = STATEMENT_LIST_TAIL (body)->stmt;
771 if (IS_EMPTY_STMT (body))
772 warning (OPT_Wempty_body,
773 "suggest explicit braces around empty body in %<do%> statement");
776 /* Finish a do-statement, which may be given by DO_STMT, and whose
777 COND is as indicated. */
780 finish_do_stmt (tree cond, tree do_stmt)
782 cond = maybe_convert_cond (cond);
783 DO_COND (do_stmt) = cond;
787 /* Finish a return-statement. The EXPRESSION returned, if any, is as
791 finish_return_stmt (tree expr)
796 expr = check_return_expr (expr, &no_warning);
798 if (flag_openmp && !check_omp_return ())
799 return error_mark_node;
800 if (!processing_template_decl)
802 if (warn_sequence_point)
803 verify_sequence_points (expr);
805 if (DECL_DESTRUCTOR_P (current_function_decl)
806 || (DECL_CONSTRUCTOR_P (current_function_decl)
807 && targetm.cxx.cdtor_returns_this ()))
809 /* Similarly, all destructors must run destructors for
810 base-classes before returning. So, all returns in a
811 destructor get sent to the DTOR_LABEL; finish_function emits
812 code to return a value there. */
813 return finish_goto_stmt (cdtor_label);
817 r = build_stmt (input_location, RETURN_EXPR, expr);
818 TREE_NO_WARNING (r) |= no_warning;
819 r = maybe_cleanup_point_expr_void (r);
826 /* Begin the scope of a for-statement or a range-for-statement.
827 Both the returned trees are to be used in a call to
828 begin_for_stmt or begin_range_for_stmt. */
831 begin_for_scope (tree *init)
833 tree scope = NULL_TREE;
834 if (flag_new_for_scope > 0)
835 scope = do_pushlevel (sk_for);
837 if (processing_template_decl)
838 *init = push_stmt_list ();
845 /* Begin a for-statement. Returns a new FOR_STMT.
846 SCOPE and INIT should be the return of begin_for_scope,
850 begin_for_stmt (tree scope, tree init)
854 r = build_stmt (input_location, FOR_STMT, NULL_TREE, NULL_TREE,
855 NULL_TREE, NULL_TREE, NULL_TREE);
857 if (scope == NULL_TREE)
859 gcc_assert (!init || !(flag_new_for_scope > 0));
861 scope = begin_for_scope (&init);
863 FOR_INIT_STMT (r) = init;
864 FOR_SCOPE (r) = scope;
869 /* Finish the for-init-statement of a for-statement, which may be
870 given by FOR_STMT. */
873 finish_for_init_stmt (tree for_stmt)
875 if (processing_template_decl)
876 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
878 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
879 begin_cond (&FOR_COND (for_stmt));
882 /* Finish the COND of a for-statement, which may be given by
886 finish_for_cond (tree cond, tree for_stmt)
888 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
889 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
892 /* Finish the increment-EXPRESSION in a for-statement, which may be
893 given by FOR_STMT. */
896 finish_for_expr (tree expr, tree for_stmt)
900 /* If EXPR is an overloaded function, issue an error; there is no
901 context available to use to perform overload resolution. */
902 if (type_unknown_p (expr))
904 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
905 expr = error_mark_node;
907 if (!processing_template_decl)
909 if (warn_sequence_point)
910 verify_sequence_points (expr);
911 expr = convert_to_void (expr, ICV_THIRD_IN_FOR,
912 tf_warning_or_error);
914 else if (!type_dependent_expression_p (expr))
915 convert_to_void (build_non_dependent_expr (expr), ICV_THIRD_IN_FOR,
916 tf_warning_or_error);
917 expr = maybe_cleanup_point_expr_void (expr);
918 if (check_for_bare_parameter_packs (expr))
919 expr = error_mark_node;
920 FOR_EXPR (for_stmt) = expr;
923 /* Finish the body of a for-statement, which may be given by
924 FOR_STMT. The increment-EXPR for the loop must be
926 It can also finish RANGE_FOR_STMT. */
929 finish_for_stmt (tree for_stmt)
931 if (TREE_CODE (for_stmt) == RANGE_FOR_STMT)
932 RANGE_FOR_BODY (for_stmt) = do_poplevel (RANGE_FOR_BODY (for_stmt));
934 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
936 /* Pop the scope for the body of the loop. */
937 if (flag_new_for_scope > 0)
940 tree *scope_ptr = (TREE_CODE (for_stmt) == RANGE_FOR_STMT
941 ? &RANGE_FOR_SCOPE (for_stmt)
942 : &FOR_SCOPE (for_stmt));
945 add_stmt (do_poplevel (scope));
951 /* Begin a range-for-statement. Returns a new RANGE_FOR_STMT.
952 SCOPE and INIT should be the return of begin_for_scope,
954 To finish it call finish_for_stmt(). */
957 begin_range_for_stmt (tree scope, tree init)
961 r = build_stmt (input_location, RANGE_FOR_STMT,
962 NULL_TREE, NULL_TREE, NULL_TREE, NULL_TREE);
964 if (scope == NULL_TREE)
966 gcc_assert (!init || !(flag_new_for_scope > 0));
968 scope = begin_for_scope (&init);
971 /* RANGE_FOR_STMTs do not use nor save the init tree, so we
974 pop_stmt_list (init);
975 RANGE_FOR_SCOPE (r) = scope;
980 /* Finish the head of a range-based for statement, which may
981 be given by RANGE_FOR_STMT. DECL must be the declaration
982 and EXPR must be the loop expression. */
985 finish_range_for_decl (tree range_for_stmt, tree decl, tree expr)
987 RANGE_FOR_DECL (range_for_stmt) = decl;
988 RANGE_FOR_EXPR (range_for_stmt) = expr;
989 add_stmt (range_for_stmt);
990 RANGE_FOR_BODY (range_for_stmt) = do_pushlevel (sk_block);
993 /* Finish a break-statement. */
996 finish_break_stmt (void)
998 return add_stmt (build_stmt (input_location, BREAK_STMT));
1001 /* Finish a continue-statement. */
1004 finish_continue_stmt (void)
1006 return add_stmt (build_stmt (input_location, CONTINUE_STMT));
1009 /* Begin a switch-statement. Returns a new SWITCH_STMT if
1013 begin_switch_stmt (void)
1017 scope = do_pushlevel (sk_cond);
1018 r = build_stmt (input_location, SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE, scope);
1020 begin_cond (&SWITCH_STMT_COND (r));
1025 /* Finish the cond of a switch-statement. */
1028 finish_switch_cond (tree cond, tree switch_stmt)
1030 tree orig_type = NULL;
1031 if (!processing_template_decl)
1033 /* Convert the condition to an integer or enumeration type. */
1034 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
1035 if (cond == NULL_TREE)
1037 error ("switch quantity not an integer");
1038 cond = error_mark_node;
1040 orig_type = TREE_TYPE (cond);
1041 if (cond != error_mark_node)
1045 Integral promotions are performed. */
1046 cond = perform_integral_promotions (cond);
1047 cond = maybe_cleanup_point_expr (cond);
1050 if (check_for_bare_parameter_packs (cond))
1051 cond = error_mark_node;
1052 else if (!processing_template_decl && warn_sequence_point)
1053 verify_sequence_points (cond);
1055 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
1056 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
1057 add_stmt (switch_stmt);
1058 push_switch (switch_stmt);
1059 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
1062 /* Finish the body of a switch-statement, which may be given by
1063 SWITCH_STMT. The COND to switch on is indicated. */
1066 finish_switch_stmt (tree switch_stmt)
1070 SWITCH_STMT_BODY (switch_stmt) =
1071 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
1075 scope = SWITCH_STMT_SCOPE (switch_stmt);
1076 SWITCH_STMT_SCOPE (switch_stmt) = NULL;
1077 add_stmt (do_poplevel (scope));
1080 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1084 begin_try_block (void)
1086 tree r = build_stmt (input_location, TRY_BLOCK, NULL_TREE, NULL_TREE);
1088 TRY_STMTS (r) = push_stmt_list ();
1092 /* Likewise, for a function-try-block. The block returned in
1093 *COMPOUND_STMT is an artificial outer scope, containing the
1094 function-try-block. */
1097 begin_function_try_block (tree *compound_stmt)
1100 /* This outer scope does not exist in the C++ standard, but we need
1101 a place to put __FUNCTION__ and similar variables. */
1102 *compound_stmt = begin_compound_stmt (0);
1103 r = begin_try_block ();
1104 FN_TRY_BLOCK_P (r) = 1;
1108 /* Finish a try-block, which may be given by TRY_BLOCK. */
1111 finish_try_block (tree try_block)
1113 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1114 TRY_HANDLERS (try_block) = push_stmt_list ();
1117 /* Finish the body of a cleanup try-block, which may be given by
1121 finish_cleanup_try_block (tree try_block)
1123 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1126 /* Finish an implicitly generated try-block, with a cleanup is given
1130 finish_cleanup (tree cleanup, tree try_block)
1132 TRY_HANDLERS (try_block) = cleanup;
1133 CLEANUP_P (try_block) = 1;
1136 /* Likewise, for a function-try-block. */
1139 finish_function_try_block (tree try_block)
1141 finish_try_block (try_block);
1142 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1143 the try block, but moving it inside. */
1144 in_function_try_handler = 1;
1147 /* Finish a handler-sequence for a try-block, which may be given by
1151 finish_handler_sequence (tree try_block)
1153 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1154 check_handlers (TRY_HANDLERS (try_block));
1157 /* Finish the handler-seq for a function-try-block, given by
1158 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1159 begin_function_try_block. */
1162 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1164 in_function_try_handler = 0;
1165 finish_handler_sequence (try_block);
1166 finish_compound_stmt (compound_stmt);
1169 /* Begin a handler. Returns a HANDLER if appropriate. */
1172 begin_handler (void)
1176 r = build_stmt (input_location, HANDLER, NULL_TREE, NULL_TREE);
1179 /* Create a binding level for the eh_info and the exception object
1181 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1186 /* Finish the handler-parameters for a handler, which may be given by
1187 HANDLER. DECL is the declaration for the catch parameter, or NULL
1188 if this is a `catch (...)' clause. */
1191 finish_handler_parms (tree decl, tree handler)
1193 tree type = NULL_TREE;
1194 if (processing_template_decl)
1198 decl = pushdecl (decl);
1199 decl = push_template_decl (decl);
1200 HANDLER_PARMS (handler) = decl;
1201 type = TREE_TYPE (decl);
1205 type = expand_start_catch_block (decl);
1206 HANDLER_TYPE (handler) = type;
1207 if (!processing_template_decl && type)
1208 mark_used (eh_type_info (type));
1211 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1212 the return value from the matching call to finish_handler_parms. */
1215 finish_handler (tree handler)
1217 if (!processing_template_decl)
1218 expand_end_catch_block ();
1219 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1222 /* Begin a compound statement. FLAGS contains some bits that control the
1223 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1224 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1225 block of a function. If BCS_TRY_BLOCK is set, this is the block
1226 created on behalf of a TRY statement. Returns a token to be passed to
1227 finish_compound_stmt. */
1230 begin_compound_stmt (unsigned int flags)
1234 if (flags & BCS_NO_SCOPE)
1236 r = push_stmt_list ();
1237 STATEMENT_LIST_NO_SCOPE (r) = 1;
1239 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1240 But, if it's a statement-expression with a scopeless block, there's
1241 nothing to keep, and we don't want to accidentally keep a block
1242 *inside* the scopeless block. */
1243 keep_next_level (false);
1246 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1248 /* When processing a template, we need to remember where the braces were,
1249 so that we can set up identical scopes when instantiating the template
1250 later. BIND_EXPR is a handy candidate for this.
1251 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1252 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1253 processing templates. */
1254 if (processing_template_decl)
1256 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1257 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1258 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1259 TREE_SIDE_EFFECTS (r) = 1;
1265 /* Finish a compound-statement, which is given by STMT. */
1268 finish_compound_stmt (tree stmt)
1270 if (TREE_CODE (stmt) == BIND_EXPR)
1272 tree body = do_poplevel (BIND_EXPR_BODY (stmt));
1273 /* If the STATEMENT_LIST is empty and this BIND_EXPR isn't special,
1274 discard the BIND_EXPR so it can be merged with the containing
1276 if (TREE_CODE (body) == STATEMENT_LIST
1277 && STATEMENT_LIST_HEAD (body) == NULL
1278 && !BIND_EXPR_BODY_BLOCK (stmt)
1279 && !BIND_EXPR_TRY_BLOCK (stmt))
1282 BIND_EXPR_BODY (stmt) = body;
1284 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1285 stmt = pop_stmt_list (stmt);
1288 /* Destroy any ObjC "super" receivers that may have been
1290 objc_clear_super_receiver ();
1292 stmt = do_poplevel (stmt);
1295 /* ??? See c_end_compound_stmt wrt statement expressions. */
1300 /* Finish an asm-statement, whose components are a STRING, some
1301 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1302 LABELS. Also note whether the asm-statement should be
1303 considered volatile. */
1306 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1307 tree input_operands, tree clobbers, tree labels)
1311 int ninputs = list_length (input_operands);
1312 int noutputs = list_length (output_operands);
1314 if (!processing_template_decl)
1316 const char *constraint;
1317 const char **oconstraints;
1318 bool allows_mem, allows_reg, is_inout;
1322 oconstraints = XALLOCAVEC (const char *, noutputs);
1324 string = resolve_asm_operand_names (string, output_operands,
1325 input_operands, labels);
1327 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1329 operand = TREE_VALUE (t);
1331 /* ??? Really, this should not be here. Users should be using a
1332 proper lvalue, dammit. But there's a long history of using
1333 casts in the output operands. In cases like longlong.h, this
1334 becomes a primitive form of typechecking -- if the cast can be
1335 removed, then the output operand had a type of the proper width;
1336 otherwise we'll get an error. Gross, but ... */
1337 STRIP_NOPS (operand);
1339 operand = mark_lvalue_use (operand);
1341 if (!lvalue_or_else (operand, lv_asm, tf_warning_or_error))
1342 operand = error_mark_node;
1344 if (operand != error_mark_node
1345 && (TREE_READONLY (operand)
1346 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1347 /* Functions are not modifiable, even though they are
1349 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1350 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1351 /* If it's an aggregate and any field is const, then it is
1352 effectively const. */
1353 || (CLASS_TYPE_P (TREE_TYPE (operand))
1354 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1355 cxx_readonly_error (operand, lv_asm);
1357 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1358 oconstraints[i] = constraint;
1360 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1361 &allows_mem, &allows_reg, &is_inout))
1363 /* If the operand is going to end up in memory,
1364 mark it addressable. */
1365 if (!allows_reg && !cxx_mark_addressable (operand))
1366 operand = error_mark_node;
1369 operand = error_mark_node;
1371 TREE_VALUE (t) = operand;
1374 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1376 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1377 operand = decay_conversion (TREE_VALUE (t));
1379 /* If the type of the operand hasn't been determined (e.g.,
1380 because it involves an overloaded function), then issue
1381 an error message. There's no context available to
1382 resolve the overloading. */
1383 if (TREE_TYPE (operand) == unknown_type_node)
1385 error ("type of asm operand %qE could not be determined",
1387 operand = error_mark_node;
1390 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1391 oconstraints, &allows_mem, &allows_reg))
1393 /* If the operand is going to end up in memory,
1394 mark it addressable. */
1395 if (!allows_reg && allows_mem)
1397 /* Strip the nops as we allow this case. FIXME, this really
1398 should be rejected or made deprecated. */
1399 STRIP_NOPS (operand);
1400 if (!cxx_mark_addressable (operand))
1401 operand = error_mark_node;
1405 operand = error_mark_node;
1407 TREE_VALUE (t) = operand;
1411 r = build_stmt (input_location, ASM_EXPR, string,
1412 output_operands, input_operands,
1414 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1415 r = maybe_cleanup_point_expr_void (r);
1416 return add_stmt (r);
1419 /* Finish a label with the indicated NAME. Returns the new label. */
1422 finish_label_stmt (tree name)
1424 tree decl = define_label (input_location, name);
1426 if (decl == error_mark_node)
1427 return error_mark_node;
1429 add_stmt (build_stmt (input_location, LABEL_EXPR, decl));
1434 /* Finish a series of declarations for local labels. G++ allows users
1435 to declare "local" labels, i.e., labels with scope. This extension
1436 is useful when writing code involving statement-expressions. */
1439 finish_label_decl (tree name)
1441 if (!at_function_scope_p ())
1443 error ("__label__ declarations are only allowed in function scopes");
1447 add_decl_expr (declare_local_label (name));
1450 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1453 finish_decl_cleanup (tree decl, tree cleanup)
1455 push_cleanup (decl, cleanup, false);
1458 /* If the current scope exits with an exception, run CLEANUP. */
1461 finish_eh_cleanup (tree cleanup)
1463 push_cleanup (NULL, cleanup, true);
1466 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1467 order they were written by the user. Each node is as for
1468 emit_mem_initializers. */
1471 finish_mem_initializers (tree mem_inits)
1473 /* Reorder the MEM_INITS so that they are in the order they appeared
1474 in the source program. */
1475 mem_inits = nreverse (mem_inits);
1477 if (processing_template_decl)
1481 for (mem = mem_inits; mem; mem = TREE_CHAIN (mem))
1483 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1484 check for bare parameter packs in the TREE_VALUE, because
1485 any parameter packs in the TREE_VALUE have already been
1486 bound as part of the TREE_PURPOSE. See
1487 make_pack_expansion for more information. */
1488 if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION
1489 && check_for_bare_parameter_packs (TREE_VALUE (mem)))
1490 TREE_VALUE (mem) = error_mark_node;
1493 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1496 emit_mem_initializers (mem_inits);
1499 /* Finish a parenthesized expression EXPR. */
1502 finish_parenthesized_expr (tree expr)
1505 /* This inhibits warnings in c_common_truthvalue_conversion. */
1506 TREE_NO_WARNING (expr) = 1;
1508 if (TREE_CODE (expr) == OFFSET_REF
1509 || TREE_CODE (expr) == SCOPE_REF)
1510 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1511 enclosed in parentheses. */
1512 PTRMEM_OK_P (expr) = 0;
1514 if (TREE_CODE (expr) == STRING_CST)
1515 PAREN_STRING_LITERAL_P (expr) = 1;
1520 /* Finish a reference to a non-static data member (DECL) that is not
1521 preceded by `.' or `->'. */
1524 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1526 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1530 tree scope = qualifying_scope;
1531 if (scope == NULL_TREE)
1532 scope = context_for_name_lookup (decl);
1533 object = maybe_dummy_object (scope, NULL);
1536 if (object == error_mark_node)
1537 return error_mark_node;
1539 /* DR 613: Can use non-static data members without an associated
1540 object in sizeof/decltype/alignof. */
1541 if (is_dummy_object (object) && cp_unevaluated_operand == 0
1542 && (!processing_template_decl || !current_class_ref))
1544 if (current_function_decl
1545 && DECL_STATIC_FUNCTION_P (current_function_decl))
1546 error ("invalid use of member %q+D in static member function", decl);
1548 error ("invalid use of non-static data member %q+D", decl);
1549 error ("from this location");
1551 return error_mark_node;
1554 if (current_class_ptr)
1555 TREE_USED (current_class_ptr) = 1;
1556 if (processing_template_decl && !qualifying_scope)
1558 tree type = TREE_TYPE (decl);
1560 if (TREE_CODE (type) == REFERENCE_TYPE)
1561 /* Quals on the object don't matter. */;
1564 /* Set the cv qualifiers. */
1565 int quals = (current_class_ref
1566 ? cp_type_quals (TREE_TYPE (current_class_ref))
1567 : TYPE_UNQUALIFIED);
1569 if (DECL_MUTABLE_P (decl))
1570 quals &= ~TYPE_QUAL_CONST;
1572 quals |= cp_type_quals (TREE_TYPE (decl));
1573 type = cp_build_qualified_type (type, quals);
1576 return (convert_from_reference
1577 (build_min (COMPONENT_REF, type, object, decl, NULL_TREE)));
1579 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1580 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1582 else if (processing_template_decl)
1583 return build_qualified_name (TREE_TYPE (decl),
1586 /*template_p=*/false);
1589 tree access_type = TREE_TYPE (object);
1591 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1594 /* If the data member was named `C::M', convert `*this' to `C'
1596 if (qualifying_scope)
1598 tree binfo = NULL_TREE;
1599 object = build_scoped_ref (object, qualifying_scope,
1603 return build_class_member_access_expr (object, decl,
1604 /*access_path=*/NULL_TREE,
1605 /*preserve_reference=*/false,
1606 tf_warning_or_error);
1610 /* If we are currently parsing a template and we encountered a typedef
1611 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1612 adds the typedef to a list tied to the current template.
1613 At tempate instantiatin time, that list is walked and access check
1614 performed for each typedef.
1615 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1618 add_typedef_to_current_template_for_access_check (tree typedef_decl,
1620 location_t location)
1622 tree template_info = NULL;
1623 tree cs = current_scope ();
1625 if (!is_typedef_decl (typedef_decl)
1627 || !CLASS_TYPE_P (context)
1631 if (CLASS_TYPE_P (cs) || TREE_CODE (cs) == FUNCTION_DECL)
1632 template_info = get_template_info (cs);
1635 && TI_TEMPLATE (template_info)
1636 && !currently_open_class (context))
1637 append_type_to_template_for_access_check (cs, typedef_decl,
1641 /* DECL was the declaration to which a qualified-id resolved. Issue
1642 an error message if it is not accessible. If OBJECT_TYPE is
1643 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1644 type of `*x', or `x', respectively. If the DECL was named as
1645 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1648 check_accessibility_of_qualified_id (tree decl,
1650 tree nested_name_specifier)
1653 tree qualifying_type = NULL_TREE;
1655 /* If we are parsing a template declaration and if decl is a typedef,
1656 add it to a list tied to the template.
1657 At template instantiation time, that list will be walked and
1658 access check performed. */
1659 add_typedef_to_current_template_for_access_check (decl,
1660 nested_name_specifier
1661 ? nested_name_specifier
1662 : DECL_CONTEXT (decl),
1665 /* If we're not checking, return immediately. */
1666 if (deferred_access_no_check)
1669 /* Determine the SCOPE of DECL. */
1670 scope = context_for_name_lookup (decl);
1671 /* If the SCOPE is not a type, then DECL is not a member. */
1672 if (!TYPE_P (scope))
1674 /* Compute the scope through which DECL is being accessed. */
1676 /* OBJECT_TYPE might not be a class type; consider:
1678 class A { typedef int I; };
1682 In this case, we will have "A::I" as the DECL, but "I" as the
1684 && CLASS_TYPE_P (object_type)
1685 && DERIVED_FROM_P (scope, object_type))
1686 /* If we are processing a `->' or `.' expression, use the type of the
1688 qualifying_type = object_type;
1689 else if (nested_name_specifier)
1691 /* If the reference is to a non-static member of the
1692 current class, treat it as if it were referenced through
1694 if (DECL_NONSTATIC_MEMBER_P (decl)
1695 && current_class_ptr
1696 && DERIVED_FROM_P (scope, current_class_type))
1697 qualifying_type = current_class_type;
1698 /* Otherwise, use the type indicated by the
1699 nested-name-specifier. */
1701 qualifying_type = nested_name_specifier;
1704 /* Otherwise, the name must be from the current class or one of
1706 qualifying_type = currently_open_derived_class (scope);
1709 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1710 or similar in a default argument value. */
1711 && CLASS_TYPE_P (qualifying_type)
1712 && !dependent_type_p (qualifying_type))
1713 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1717 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1718 class named to the left of the "::" operator. DONE is true if this
1719 expression is a complete postfix-expression; it is false if this
1720 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1721 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1722 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1723 is true iff this qualified name appears as a template argument. */
1726 finish_qualified_id_expr (tree qualifying_class,
1731 bool template_arg_p)
1733 gcc_assert (TYPE_P (qualifying_class));
1735 if (error_operand_p (expr))
1736 return error_mark_node;
1738 if (DECL_P (expr) || BASELINK_P (expr))
1742 check_template_keyword (expr);
1744 /* If EXPR occurs as the operand of '&', use special handling that
1745 permits a pointer-to-member. */
1746 if (address_p && done)
1748 if (TREE_CODE (expr) == SCOPE_REF)
1749 expr = TREE_OPERAND (expr, 1);
1750 expr = build_offset_ref (qualifying_class, expr,
1751 /*address_p=*/true);
1755 /* Within the scope of a class, turn references to non-static
1756 members into expression of the form "this->...". */
1758 /* But, within a template argument, we do not want make the
1759 transformation, as there is no "this" pointer. */
1761 else if (TREE_CODE (expr) == FIELD_DECL)
1763 push_deferring_access_checks (dk_no_check);
1764 expr = finish_non_static_data_member (expr, NULL_TREE,
1766 pop_deferring_access_checks ();
1768 else if (BASELINK_P (expr) && !processing_template_decl)
1772 /* See if any of the functions are non-static members. */
1773 /* If so, the expression may be relative to 'this'. */
1774 if (!shared_member_p (expr)
1775 && (ob = maybe_dummy_object (qualifying_class, NULL),
1776 !is_dummy_object (ob)))
1777 expr = (build_class_member_access_expr
1780 BASELINK_ACCESS_BINFO (expr),
1781 /*preserve_reference=*/false,
1782 tf_warning_or_error));
1784 /* The expression is a qualified name whose address is not
1786 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1792 /* Begin a statement-expression. The value returned must be passed to
1793 finish_stmt_expr. */
1796 begin_stmt_expr (void)
1798 return push_stmt_list ();
1801 /* Process the final expression of a statement expression. EXPR can be
1802 NULL, if the final expression is empty. Return a STATEMENT_LIST
1803 containing all the statements in the statement-expression, or
1804 ERROR_MARK_NODE if there was an error. */
1807 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1809 if (error_operand_p (expr))
1811 /* The type of the statement-expression is the type of the last
1813 TREE_TYPE (stmt_expr) = error_mark_node;
1814 return error_mark_node;
1817 /* If the last statement does not have "void" type, then the value
1818 of the last statement is the value of the entire expression. */
1821 tree type = TREE_TYPE (expr);
1823 if (processing_template_decl)
1825 expr = build_stmt (input_location, EXPR_STMT, expr);
1826 expr = add_stmt (expr);
1827 /* Mark the last statement so that we can recognize it as such at
1828 template-instantiation time. */
1829 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1831 else if (VOID_TYPE_P (type))
1833 /* Just treat this like an ordinary statement. */
1834 expr = finish_expr_stmt (expr);
1838 /* It actually has a value we need to deal with. First, force it
1839 to be an rvalue so that we won't need to build up a copy
1840 constructor call later when we try to assign it to something. */
1841 expr = force_rvalue (expr, tf_warning_or_error);
1842 if (error_operand_p (expr))
1843 return error_mark_node;
1845 /* Update for array-to-pointer decay. */
1846 type = TREE_TYPE (expr);
1848 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1849 normal statement, but don't convert to void or actually add
1851 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1852 expr = maybe_cleanup_point_expr (expr);
1856 /* The type of the statement-expression is the type of the last
1858 TREE_TYPE (stmt_expr) = type;
1864 /* Finish a statement-expression. EXPR should be the value returned
1865 by the previous begin_stmt_expr. Returns an expression
1866 representing the statement-expression. */
1869 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1874 if (error_operand_p (stmt_expr))
1876 pop_stmt_list (stmt_expr);
1877 return error_mark_node;
1880 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1882 type = TREE_TYPE (stmt_expr);
1883 result = pop_stmt_list (stmt_expr);
1884 TREE_TYPE (result) = type;
1886 if (processing_template_decl)
1888 result = build_min (STMT_EXPR, type, result);
1889 TREE_SIDE_EFFECTS (result) = 1;
1890 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1892 else if (CLASS_TYPE_P (type))
1894 /* Wrap the statement-expression in a TARGET_EXPR so that the
1895 temporary object created by the final expression is destroyed at
1896 the end of the full-expression containing the
1897 statement-expression. */
1898 result = force_target_expr (type, result, tf_warning_or_error);
1904 /* Returns the expression which provides the value of STMT_EXPR. */
1907 stmt_expr_value_expr (tree stmt_expr)
1909 tree t = STMT_EXPR_STMT (stmt_expr);
1911 if (TREE_CODE (t) == BIND_EXPR)
1912 t = BIND_EXPR_BODY (t);
1914 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1915 t = STATEMENT_LIST_TAIL (t)->stmt;
1917 if (TREE_CODE (t) == EXPR_STMT)
1918 t = EXPR_STMT_EXPR (t);
1923 /* Return TRUE iff EXPR_STMT is an empty list of
1924 expression statements. */
1927 empty_expr_stmt_p (tree expr_stmt)
1929 tree body = NULL_TREE;
1931 if (expr_stmt == void_zero_node)
1936 if (TREE_CODE (expr_stmt) == EXPR_STMT)
1937 body = EXPR_STMT_EXPR (expr_stmt);
1938 else if (TREE_CODE (expr_stmt) == STATEMENT_LIST)
1944 if (TREE_CODE (body) == STATEMENT_LIST)
1945 return tsi_end_p (tsi_start (body));
1947 return empty_expr_stmt_p (body);
1952 /* Perform Koenig lookup. FN is the postfix-expression representing
1953 the function (or functions) to call; ARGS are the arguments to the
1954 call; if INCLUDE_STD then the `std' namespace is automatically
1955 considered an associated namespace (used in range-based for loops).
1956 Returns the functions to be considered by overload resolution. */
1959 perform_koenig_lookup (tree fn, VEC(tree,gc) *args, bool include_std,
1960 tsubst_flags_t complain)
1962 tree identifier = NULL_TREE;
1963 tree functions = NULL_TREE;
1964 tree tmpl_args = NULL_TREE;
1965 bool template_id = false;
1967 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1969 /* Use a separate flag to handle null args. */
1971 tmpl_args = TREE_OPERAND (fn, 1);
1972 fn = TREE_OPERAND (fn, 0);
1975 /* Find the name of the overloaded function. */
1976 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1978 else if (is_overloaded_fn (fn))
1981 identifier = DECL_NAME (get_first_fn (functions));
1983 else if (DECL_P (fn))
1986 identifier = DECL_NAME (fn);
1989 /* A call to a namespace-scope function using an unqualified name.
1991 Do Koenig lookup -- unless any of the arguments are
1993 if (!any_type_dependent_arguments_p (args)
1994 && !any_dependent_template_arguments_p (tmpl_args))
1996 fn = lookup_arg_dependent (identifier, functions, args, include_std);
1999 /* The unqualified name could not be resolved. */
2001 fn = unqualified_fn_lookup_error (identifier);
2007 if (fn && template_id)
2008 fn = build2 (TEMPLATE_ID_EXPR, unknown_type_node, fn, tmpl_args);
2013 /* Generate an expression for `FN (ARGS)'. This may change the
2016 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2017 as a virtual call, even if FN is virtual. (This flag is set when
2018 encountering an expression where the function name is explicitly
2019 qualified. For example a call to `X::f' never generates a virtual
2022 Returns code for the call. */
2025 finish_call_expr (tree fn, VEC(tree,gc) **args, bool disallow_virtual,
2026 bool koenig_p, tsubst_flags_t complain)
2030 VEC(tree,gc) *orig_args = NULL;
2032 if (fn == error_mark_node)
2033 return error_mark_node;
2035 gcc_assert (!TYPE_P (fn));
2039 if (processing_template_decl)
2041 /* If the call expression is dependent, build a CALL_EXPR node
2042 with no type; type_dependent_expression_p recognizes
2043 expressions with no type as being dependent. */
2044 if (type_dependent_expression_p (fn)
2045 || any_type_dependent_arguments_p (*args)
2046 /* For a non-static member function that doesn't have an
2047 explicit object argument, we need to specifically
2048 test the type dependency of the "this" pointer because it
2049 is not included in *ARGS even though it is considered to
2050 be part of the list of arguments. Note that this is
2051 related to CWG issues 515 and 1005. */
2052 || (TREE_CODE (fn) != COMPONENT_REF
2053 && non_static_member_function_p (fn)
2054 && current_class_ref
2055 && type_dependent_expression_p (current_class_ref)))
2057 result = build_nt_call_vec (fn, *args);
2058 KOENIG_LOOKUP_P (result) = koenig_p;
2063 tree fndecl = OVL_CURRENT (fn);
2064 if (TREE_CODE (fndecl) != FUNCTION_DECL
2065 || !TREE_THIS_VOLATILE (fndecl))
2071 current_function_returns_abnormally = 1;
2075 orig_args = make_tree_vector_copy (*args);
2076 if (!BASELINK_P (fn)
2077 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
2078 && TREE_TYPE (fn) != unknown_type_node)
2079 fn = build_non_dependent_expr (fn);
2080 make_args_non_dependent (*args);
2083 if (TREE_CODE (fn) == COMPONENT_REF)
2085 tree member = TREE_OPERAND (fn, 1);
2086 if (BASELINK_P (member))
2088 tree object = TREE_OPERAND (fn, 0);
2089 return build_new_method_call (object, member,
2092 ? LOOKUP_NORMAL | LOOKUP_NONVIRTUAL
2099 if (is_overloaded_fn (fn))
2100 fn = baselink_for_fns (fn);
2103 if (BASELINK_P (fn))
2107 /* A call to a member function. From [over.call.func]:
2109 If the keyword this is in scope and refers to the class of
2110 that member function, or a derived class thereof, then the
2111 function call is transformed into a qualified function call
2112 using (*this) as the postfix-expression to the left of the
2113 . operator.... [Otherwise] a contrived object of type T
2114 becomes the implied object argument.
2118 struct A { void f(); };
2119 struct B : public A {};
2120 struct C : public A { void g() { B::f(); }};
2122 "the class of that member function" refers to `A'. But 11.2
2123 [class.access.base] says that we need to convert 'this' to B* as
2124 part of the access, so we pass 'B' to maybe_dummy_object. */
2126 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
2129 if (processing_template_decl)
2131 if (type_dependent_expression_p (object))
2133 tree ret = build_nt_call_vec (orig_fn, orig_args);
2134 release_tree_vector (orig_args);
2137 object = build_non_dependent_expr (object);
2140 result = build_new_method_call (object, fn, args, NULL_TREE,
2142 ? LOOKUP_NORMAL|LOOKUP_NONVIRTUAL
2147 else if (is_overloaded_fn (fn))
2149 /* If the function is an overloaded builtin, resolve it. */
2150 if (TREE_CODE (fn) == FUNCTION_DECL
2151 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2152 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
2153 result = resolve_overloaded_builtin (input_location, fn, *args);
2156 /* A call to a namespace-scope function. */
2157 result = build_new_function_call (fn, args, koenig_p, complain);
2159 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
2161 if (!VEC_empty (tree, *args))
2162 error ("arguments to destructor are not allowed");
2163 /* Mark the pseudo-destructor call as having side-effects so
2164 that we do not issue warnings about its use. */
2165 result = build1 (NOP_EXPR,
2167 TREE_OPERAND (fn, 0));
2168 TREE_SIDE_EFFECTS (result) = 1;
2170 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
2171 /* If the "function" is really an object of class type, it might
2172 have an overloaded `operator ()'. */
2173 result = build_op_call (fn, args, complain);
2176 /* A call where the function is unknown. */
2177 result = cp_build_function_call_vec (fn, args, complain);
2179 if (processing_template_decl && result != error_mark_node)
2181 if (TREE_CODE (result) == INDIRECT_REF)
2182 result = TREE_OPERAND (result, 0);
2183 result = build_call_vec (TREE_TYPE (result), orig_fn, orig_args);
2184 SET_EXPR_LOCATION (result, input_location);
2185 KOENIG_LOOKUP_P (result) = koenig_p;
2186 release_tree_vector (orig_args);
2187 result = convert_from_reference (result);
2192 /* Free garbage OVERLOADs from arg-dependent lookup. */
2193 tree next = NULL_TREE;
2195 fn && TREE_CODE (fn) == OVERLOAD && OVL_ARG_DEPENDENT (fn);
2198 if (processing_template_decl)
2199 /* In a template, we'll re-use them at instantiation time. */
2200 OVL_ARG_DEPENDENT (fn) = false;
2203 next = OVL_CHAIN (fn);
2212 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2213 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2214 POSTDECREMENT_EXPR.) */
2217 finish_increment_expr (tree expr, enum tree_code code)
2219 return build_x_unary_op (code, expr, tf_warning_or_error);
2222 /* Finish a use of `this'. Returns an expression for `this'. */
2225 finish_this_expr (void)
2229 if (current_class_ptr)
2231 tree type = TREE_TYPE (current_class_ref);
2233 /* In a lambda expression, 'this' refers to the captured 'this'. */
2234 if (LAMBDA_TYPE_P (type))
2235 result = lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type));
2237 result = current_class_ptr;
2240 else if (current_function_decl
2241 && DECL_STATIC_FUNCTION_P (current_function_decl))
2243 error ("%<this%> is unavailable for static member functions");
2244 result = error_mark_node;
2248 if (current_function_decl)
2249 error ("invalid use of %<this%> in non-member function");
2251 error ("invalid use of %<this%> at top level");
2252 result = error_mark_node;
2258 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2259 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2260 the TYPE for the type given. If SCOPE is non-NULL, the expression
2261 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2264 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2266 if (object == error_mark_node || destructor == error_mark_node)
2267 return error_mark_node;
2269 gcc_assert (TYPE_P (destructor));
2271 if (!processing_template_decl)
2273 if (scope == error_mark_node)
2275 error ("invalid qualifying scope in pseudo-destructor name");
2276 return error_mark_node;
2278 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2280 error ("qualified type %qT does not match destructor name ~%qT",
2282 return error_mark_node;
2286 /* [expr.pseudo] says both:
2288 The type designated by the pseudo-destructor-name shall be
2289 the same as the object type.
2293 The cv-unqualified versions of the object type and of the
2294 type designated by the pseudo-destructor-name shall be the
2297 We implement the more generous second sentence, since that is
2298 what most other compilers do. */
2299 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2302 error ("%qE is not of type %qT", object, destructor);
2303 return error_mark_node;
2307 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2310 /* Finish an expression of the form CODE EXPR. */
2313 finish_unary_op_expr (enum tree_code code, tree expr)
2315 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2316 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2317 overflow_warning (input_location, result);
2322 /* Finish a compound-literal expression. TYPE is the type to which
2323 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2326 finish_compound_literal (tree type, tree compound_literal,
2327 tsubst_flags_t complain)
2329 if (type == error_mark_node)
2330 return error_mark_node;
2332 if (TREE_CODE (type) == REFERENCE_TYPE)
2335 = finish_compound_literal (TREE_TYPE (type), compound_literal,
2337 return cp_build_c_cast (type, compound_literal, complain);
2340 if (!TYPE_OBJ_P (type))
2342 if (complain & tf_error)
2343 error ("compound literal of non-object type %qT", type);
2344 return error_mark_node;
2347 if (processing_template_decl)
2349 TREE_TYPE (compound_literal) = type;
2350 /* Mark the expression as a compound literal. */
2351 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2352 return compound_literal;
2355 type = complete_type (type);
2357 if (TYPE_NON_AGGREGATE_CLASS (type))
2359 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2360 everywhere that deals with function arguments would be a pain, so
2361 just wrap it in a TREE_LIST. The parser set a flag so we know
2362 that it came from T{} rather than T({}). */
2363 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2364 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2365 return build_functional_cast (type, compound_literal, complain);
2368 if (TREE_CODE (type) == ARRAY_TYPE
2369 && check_array_initializer (NULL_TREE, type, compound_literal))
2370 return error_mark_node;
2371 compound_literal = reshape_init (type, compound_literal, complain);
2372 if (SCALAR_TYPE_P (type)
2373 && !BRACE_ENCLOSED_INITIALIZER_P (compound_literal))
2374 check_narrowing (type, compound_literal);
2375 if (TREE_CODE (type) == ARRAY_TYPE
2376 && TYPE_DOMAIN (type) == NULL_TREE)
2378 cp_complete_array_type_or_error (&type, compound_literal,
2380 if (type == error_mark_node)
2381 return error_mark_node;
2383 compound_literal = digest_init (type, compound_literal, complain);
2384 if (TREE_CODE (compound_literal) == CONSTRUCTOR)
2385 TREE_HAS_CONSTRUCTOR (compound_literal) = true;
2386 /* Put static/constant array temporaries in static variables, but always
2387 represent class temporaries with TARGET_EXPR so we elide copies. */
2388 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type))
2389 && TREE_CODE (type) == ARRAY_TYPE
2390 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2391 && initializer_constant_valid_p (compound_literal, type))
2393 tree decl = create_temporary_var (type);
2394 DECL_INITIAL (decl) = compound_literal;
2395 TREE_STATIC (decl) = 1;
2396 if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type))
2398 /* 5.19 says that a constant expression can include an
2399 lvalue-rvalue conversion applied to "a glvalue of literal type
2400 that refers to a non-volatile temporary object initialized
2401 with a constant expression". Rather than try to communicate
2402 that this VAR_DECL is a temporary, just mark it constexpr. */
2403 DECL_DECLARED_CONSTEXPR_P (decl) = true;
2404 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true;
2405 TREE_CONSTANT (decl) = true;
2407 cp_apply_type_quals_to_decl (cp_type_quals (type), decl);
2408 decl = pushdecl_top_level (decl);
2409 DECL_NAME (decl) = make_anon_name ();
2410 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2414 return get_target_expr_sfinae (compound_literal, complain);
2417 /* Return the declaration for the function-name variable indicated by
2421 finish_fname (tree id)
2425 decl = fname_decl (input_location, C_RID_CODE (id), id);
2426 if (processing_template_decl && current_function_decl)
2427 decl = DECL_NAME (decl);
2431 /* Finish a translation unit. */
2434 finish_translation_unit (void)
2436 /* In case there were missing closebraces,
2437 get us back to the global binding level. */
2439 while (current_namespace != global_namespace)
2442 /* Do file scope __FUNCTION__ et al. */
2443 finish_fname_decls ();
2446 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2447 Returns the parameter. */
2450 finish_template_type_parm (tree aggr, tree identifier)
2452 if (aggr != class_type_node)
2454 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2455 aggr = class_type_node;
2458 return build_tree_list (aggr, identifier);
2461 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2462 Returns the parameter. */
2465 finish_template_template_parm (tree aggr, tree identifier)
2467 tree decl = build_decl (input_location,
2468 TYPE_DECL, identifier, NULL_TREE);
2469 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2470 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2471 DECL_TEMPLATE_RESULT (tmpl) = decl;
2472 DECL_ARTIFICIAL (decl) = 1;
2473 end_template_decl ();
2475 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2477 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2478 /*is_primary=*/true, /*is_partial=*/false,
2481 return finish_template_type_parm (aggr, tmpl);
2484 /* ARGUMENT is the default-argument value for a template template
2485 parameter. If ARGUMENT is invalid, issue error messages and return
2486 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2489 check_template_template_default_arg (tree argument)
2491 if (TREE_CODE (argument) != TEMPLATE_DECL
2492 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2493 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2495 if (TREE_CODE (argument) == TYPE_DECL)
2496 error ("invalid use of type %qT as a default value for a template "
2497 "template-parameter", TREE_TYPE (argument));
2499 error ("invalid default argument for a template template parameter");
2500 return error_mark_node;
2506 /* Begin a class definition, as indicated by T. */
2509 begin_class_definition (tree t, tree attributes)
2511 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2512 return error_mark_node;
2514 if (processing_template_parmlist)
2516 error ("definition of %q#T inside template parameter list", t);
2517 return error_mark_node;
2520 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2521 are passed the same as decimal scalar types. */
2522 if (TREE_CODE (t) == RECORD_TYPE
2523 && !processing_template_decl)
2525 tree ns = TYPE_CONTEXT (t);
2526 if (ns && TREE_CODE (ns) == NAMESPACE_DECL
2527 && DECL_CONTEXT (ns) == std_node
2529 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns)), "decimal"))
2531 const char *n = TYPE_NAME_STRING (t);
2532 if ((strcmp (n, "decimal32") == 0)
2533 || (strcmp (n, "decimal64") == 0)
2534 || (strcmp (n, "decimal128") == 0))
2535 TYPE_TRANSPARENT_AGGR (t) = 1;
2539 /* A non-implicit typename comes from code like:
2541 template <typename T> struct A {
2542 template <typename U> struct A<T>::B ...
2544 This is erroneous. */
2545 else if (TREE_CODE (t) == TYPENAME_TYPE)
2547 error ("invalid definition of qualified type %qT", t);
2548 t = error_mark_node;
2551 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2553 t = make_class_type (RECORD_TYPE);
2554 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2557 if (TYPE_BEING_DEFINED (t))
2559 t = make_class_type (TREE_CODE (t));
2560 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2562 maybe_process_partial_specialization (t);
2564 TYPE_BEING_DEFINED (t) = 1;
2566 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2567 fixup_attribute_variants (t);
2569 if (flag_pack_struct)
2572 TYPE_PACKED (t) = 1;
2573 /* Even though the type is being defined for the first time
2574 here, there might have been a forward declaration, so there
2575 might be cv-qualified variants of T. */
2576 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2577 TYPE_PACKED (v) = 1;
2579 /* Reset the interface data, at the earliest possible
2580 moment, as it might have been set via a class foo;
2582 if (! TYPE_ANONYMOUS_P (t))
2584 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2585 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2586 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2587 (t, finfo->interface_unknown);
2589 reset_specialization();
2591 /* Make a declaration for this class in its own scope. */
2592 build_self_reference ();
2597 /* Finish the member declaration given by DECL. */
2600 finish_member_declaration (tree decl)
2602 if (decl == error_mark_node || decl == NULL_TREE)
2605 if (decl == void_type_node)
2606 /* The COMPONENT was a friend, not a member, and so there's
2607 nothing for us to do. */
2610 /* We should see only one DECL at a time. */
2611 gcc_assert (DECL_CHAIN (decl) == NULL_TREE);
2613 /* Set up access control for DECL. */
2615 = (current_access_specifier == access_private_node);
2616 TREE_PROTECTED (decl)
2617 = (current_access_specifier == access_protected_node);
2618 if (TREE_CODE (decl) == TEMPLATE_DECL)
2620 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2621 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2624 /* Mark the DECL as a member of the current class. */
2625 DECL_CONTEXT (decl) = current_class_type;
2627 /* Check for bare parameter packs in the member variable declaration. */
2628 if (TREE_CODE (decl) == FIELD_DECL)
2630 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2631 TREE_TYPE (decl) = error_mark_node;
2632 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2633 DECL_ATTRIBUTES (decl) = NULL_TREE;
2638 A C language linkage is ignored for the names of class members
2639 and the member function type of class member functions. */
2640 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2641 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2643 /* Put functions on the TYPE_METHODS list and everything else on the
2644 TYPE_FIELDS list. Note that these are built up in reverse order.
2645 We reverse them (to obtain declaration order) in finish_struct. */
2646 if (TREE_CODE (decl) == FUNCTION_DECL
2647 || DECL_FUNCTION_TEMPLATE_P (decl))
2649 /* We also need to add this function to the
2650 CLASSTYPE_METHOD_VEC. */
2651 if (add_method (current_class_type, decl, NULL_TREE))
2653 DECL_CHAIN (decl) = TYPE_METHODS (current_class_type);
2654 TYPE_METHODS (current_class_type) = decl;
2656 maybe_add_class_template_decl_list (current_class_type, decl,
2660 /* Enter the DECL into the scope of the class. */
2661 else if (pushdecl_class_level (decl))
2663 if (TREE_CODE (decl) == USING_DECL)
2665 /* We need to add the target functions to the
2666 CLASSTYPE_METHOD_VEC if an enclosing scope is a template
2667 class, so that this function be found by lookup_fnfields_1
2668 when the using declaration is not instantiated yet. */
2670 tree target_decl = strip_using_decl (decl);
2671 if (dependent_type_p (current_class_type)
2672 && is_overloaded_fn (target_decl))
2674 tree t = target_decl;
2675 for (; t; t = OVL_NEXT (t))
2676 add_method (current_class_type, OVL_CURRENT (t), decl);
2679 /* For now, ignore class-scope USING_DECLS, so that
2680 debugging backends do not see them. */
2681 DECL_IGNORED_P (decl) = 1;
2684 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2685 go at the beginning. The reason is that lookup_field_1
2686 searches the list in order, and we want a field name to
2687 override a type name so that the "struct stat hack" will
2688 work. In particular:
2690 struct S { enum E { }; int E } s;
2693 is valid. In addition, the FIELD_DECLs must be maintained in
2694 declaration order so that class layout works as expected.
2695 However, we don't need that order until class layout, so we
2696 save a little time by putting FIELD_DECLs on in reverse order
2697 here, and then reversing them in finish_struct_1. (We could
2698 also keep a pointer to the correct insertion points in the
2701 if (TREE_CODE (decl) == TYPE_DECL)
2702 TYPE_FIELDS (current_class_type)
2703 = chainon (TYPE_FIELDS (current_class_type), decl);
2706 DECL_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2707 TYPE_FIELDS (current_class_type) = decl;
2710 maybe_add_class_template_decl_list (current_class_type, decl,
2715 note_decl_for_pch (decl);
2718 /* DECL has been declared while we are building a PCH file. Perform
2719 actions that we might normally undertake lazily, but which can be
2720 performed now so that they do not have to be performed in
2721 translation units which include the PCH file. */
2724 note_decl_for_pch (tree decl)
2726 gcc_assert (pch_file);
2728 /* There's a good chance that we'll have to mangle names at some
2729 point, even if only for emission in debugging information. */
2730 if ((TREE_CODE (decl) == VAR_DECL
2731 || TREE_CODE (decl) == FUNCTION_DECL)
2732 && !processing_template_decl)
2736 /* Finish processing a complete template declaration. The PARMS are
2737 the template parameters. */
2740 finish_template_decl (tree parms)
2743 end_template_decl ();
2745 end_specialization ();
2748 /* Finish processing a template-id (which names a type) of the form
2749 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2750 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2751 the scope of template-id indicated. */
2754 finish_template_type (tree name, tree args, int entering_scope)
2758 type = lookup_template_class (name, args,
2759 NULL_TREE, NULL_TREE, entering_scope,
2760 tf_warning_or_error | tf_user);
2761 if (type == error_mark_node)
2763 else if (CLASS_TYPE_P (type) && !alias_type_or_template_p (type))
2764 return TYPE_STUB_DECL (type);
2766 return TYPE_NAME (type);
2769 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2770 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2771 BASE_CLASS, or NULL_TREE if an error occurred. The
2772 ACCESS_SPECIFIER is one of
2773 access_{default,public,protected_private}_node. For a virtual base
2774 we set TREE_TYPE. */
2777 finish_base_specifier (tree base, tree access, bool virtual_p)
2781 if (base == error_mark_node)
2783 error ("invalid base-class specification");
2786 else if (! MAYBE_CLASS_TYPE_P (base))
2788 error ("%qT is not a class type", base);
2793 if (cp_type_quals (base) != 0)
2795 /* DR 484: Can a base-specifier name a cv-qualified
2797 base = TYPE_MAIN_VARIANT (base);
2799 result = build_tree_list (access, base);
2801 TREE_TYPE (result) = integer_type_node;
2807 /* If FNS is a member function, a set of member functions, or a
2808 template-id referring to one or more member functions, return a
2809 BASELINK for FNS, incorporating the current access context.
2810 Otherwise, return FNS unchanged. */
2813 baselink_for_fns (tree fns)
2818 if (BASELINK_P (fns)
2819 || error_operand_p (fns))
2823 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2824 fn = TREE_OPERAND (fn, 0);
2825 fn = get_first_fn (fn);
2826 if (!DECL_FUNCTION_MEMBER_P (fn))
2829 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2831 cl = DECL_CONTEXT (fn);
2832 cl = TYPE_BINFO (cl);
2833 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2836 /* Returns true iff DECL is an automatic variable from a function outside
2840 outer_automatic_var_p (tree decl)
2842 return ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2843 && DECL_FUNCTION_SCOPE_P (decl)
2844 && !TREE_STATIC (decl)
2845 && DECL_CONTEXT (decl) != current_function_decl);
2848 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2849 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2850 if non-NULL, is the type or namespace used to explicitly qualify
2851 ID_EXPRESSION. DECL is the entity to which that name has been
2854 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2855 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2856 be set to true if this expression isn't permitted in a
2857 constant-expression, but it is otherwise not set by this function.
2858 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2859 constant-expression, but a non-constant expression is also
2862 DONE is true if this expression is a complete postfix-expression;
2863 it is false if this expression is followed by '->', '[', '(', etc.
2864 ADDRESS_P is true iff this expression is the operand of '&'.
2865 TEMPLATE_P is true iff the qualified-id was of the form
2866 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2867 appears as a template argument.
2869 If an error occurs, and it is the kind of error that might cause
2870 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2871 is the caller's responsibility to issue the message. *ERROR_MSG
2872 will be a string with static storage duration, so the caller need
2875 Return an expression for the entity, after issuing appropriate
2876 diagnostics. This function is also responsible for transforming a
2877 reference to a non-static member into a COMPONENT_REF that makes
2878 the use of "this" explicit.
2880 Upon return, *IDK will be filled in appropriately. */
2882 finish_id_expression (tree id_expression,
2886 bool integral_constant_expression_p,
2887 bool allow_non_integral_constant_expression_p,
2888 bool *non_integral_constant_expression_p,
2892 bool template_arg_p,
2893 const char **error_msg,
2894 location_t location)
2896 decl = strip_using_decl (decl);
2898 /* Initialize the output parameters. */
2899 *idk = CP_ID_KIND_NONE;
2902 if (id_expression == error_mark_node)
2903 return error_mark_node;
2904 /* If we have a template-id, then no further lookup is
2905 required. If the template-id was for a template-class, we
2906 will sometimes have a TYPE_DECL at this point. */
2907 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2908 || TREE_CODE (decl) == TYPE_DECL)
2910 /* Look up the name. */
2913 if (decl == error_mark_node)
2915 /* Name lookup failed. */
2918 || (!dependent_type_p (scope)
2919 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2920 && IDENTIFIER_TYPENAME_P (id_expression)
2921 && dependent_type_p (TREE_TYPE (id_expression))))))
2923 /* If the qualifying type is non-dependent (and the name
2924 does not name a conversion operator to a dependent
2925 type), issue an error. */
2926 qualified_name_lookup_error (scope, id_expression, decl, location);
2927 return error_mark_node;
2931 /* It may be resolved via Koenig lookup. */
2932 *idk = CP_ID_KIND_UNQUALIFIED;
2933 return id_expression;
2936 decl = id_expression;
2938 /* If DECL is a variable that would be out of scope under
2939 ANSI/ISO rules, but in scope in the ARM, name lookup
2940 will succeed. Issue a diagnostic here. */
2942 decl = check_for_out_of_scope_variable (decl);
2944 /* Remember that the name was used in the definition of
2945 the current class so that we can check later to see if
2946 the meaning would have been different after the class
2947 was entirely defined. */
2948 if (!scope && decl != error_mark_node
2949 && TREE_CODE (id_expression) == IDENTIFIER_NODE)
2950 maybe_note_name_used_in_class (id_expression, decl);
2952 /* Disallow uses of local variables from containing functions, except
2953 within lambda-expressions. */
2954 if (outer_automatic_var_p (decl)
2955 /* It's not a use (3.2) if we're in an unevaluated context. */
2956 && !cp_unevaluated_operand)
2958 tree context = DECL_CONTEXT (decl);
2959 tree containing_function = current_function_decl;
2960 tree lambda_stack = NULL_TREE;
2961 tree lambda_expr = NULL_TREE;
2962 tree initializer = convert_from_reference (decl);
2964 /* Mark it as used now even if the use is ill-formed. */
2967 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2968 support for an approach in which a reference to a local
2969 [constant] automatic variable in a nested class or lambda body
2970 would enter the expression as an rvalue, which would reduce
2971 the complexity of the problem"
2973 FIXME update for final resolution of core issue 696. */
2974 if (decl_constant_var_p (decl))
2975 return integral_constant_value (decl);
2977 /* If we are in a lambda function, we can move out until we hit
2979 2. a non-lambda function, or
2980 3. a non-default capturing lambda function. */
2981 while (context != containing_function
2982 && LAMBDA_FUNCTION_P (containing_function))
2984 lambda_expr = CLASSTYPE_LAMBDA_EXPR
2985 (DECL_CONTEXT (containing_function));
2987 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr)
2991 lambda_stack = tree_cons (NULL_TREE,
2996 = decl_function_context (containing_function);
2999 if (context == containing_function)
3001 decl = add_default_capture (lambda_stack,
3002 /*id=*/DECL_NAME (decl),
3005 else if (lambda_expr)
3007 error ("%qD is not captured", decl);
3008 return error_mark_node;
3012 error (TREE_CODE (decl) == VAR_DECL
3013 ? G_("use of %<auto%> variable from containing function")
3014 : G_("use of parameter from containing function"));
3015 error (" %q+#D declared here", decl);
3016 return error_mark_node;
3020 /* Also disallow uses of function parameters outside the function
3021 body, except inside an unevaluated context (i.e. decltype). */
3022 if (TREE_CODE (decl) == PARM_DECL
3023 && DECL_CONTEXT (decl) == NULL_TREE
3024 && !cp_unevaluated_operand)
3026 error ("use of parameter %qD outside function body", decl);
3027 return error_mark_node;
3031 /* If we didn't find anything, or what we found was a type,
3032 then this wasn't really an id-expression. */
3033 if (TREE_CODE (decl) == TEMPLATE_DECL
3034 && !DECL_FUNCTION_TEMPLATE_P (decl))
3036 *error_msg = "missing template arguments";
3037 return error_mark_node;
3039 else if (TREE_CODE (decl) == TYPE_DECL
3040 || TREE_CODE (decl) == NAMESPACE_DECL)
3042 *error_msg = "expected primary-expression";
3043 return error_mark_node;
3046 /* If the name resolved to a template parameter, there is no
3047 need to look it up again later. */
3048 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
3049 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
3053 *idk = CP_ID_KIND_NONE;
3054 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
3055 decl = TEMPLATE_PARM_DECL (decl);
3056 r = convert_from_reference (DECL_INITIAL (decl));
3058 if (integral_constant_expression_p
3059 && !dependent_type_p (TREE_TYPE (decl))
3060 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
3062 if (!allow_non_integral_constant_expression_p)
3063 error ("template parameter %qD of type %qT is not allowed in "
3064 "an integral constant expression because it is not of "
3065 "integral or enumeration type", decl, TREE_TYPE (decl));
3066 *non_integral_constant_expression_p = true;
3070 /* Similarly, we resolve enumeration constants to their
3071 underlying values. */
3072 else if (TREE_CODE (decl) == CONST_DECL)
3074 *idk = CP_ID_KIND_NONE;
3075 if (!processing_template_decl)
3077 used_types_insert (TREE_TYPE (decl));
3078 return DECL_INITIAL (decl);
3086 /* If the declaration was explicitly qualified indicate
3087 that. The semantics of `A::f(3)' are different than
3088 `f(3)' if `f' is virtual. */
3090 ? CP_ID_KIND_QUALIFIED
3091 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
3092 ? CP_ID_KIND_TEMPLATE_ID
3093 : CP_ID_KIND_UNQUALIFIED));
3098 An id-expression is type-dependent if it contains an
3099 identifier that was declared with a dependent type.
3101 The standard is not very specific about an id-expression that
3102 names a set of overloaded functions. What if some of them
3103 have dependent types and some of them do not? Presumably,
3104 such a name should be treated as a dependent name. */
3105 /* Assume the name is not dependent. */
3106 dependent_p = false;
3107 if (!processing_template_decl)
3108 /* No names are dependent outside a template. */
3110 /* A template-id where the name of the template was not resolved
3111 is definitely dependent. */
3112 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
3113 && (TREE_CODE (TREE_OPERAND (decl, 0))
3114 == IDENTIFIER_NODE))
3116 /* For anything except an overloaded function, just check its
3118 else if (!is_overloaded_fn (decl))
3120 = dependent_type_p (TREE_TYPE (decl));
3121 /* For a set of overloaded functions, check each of the
3127 if (BASELINK_P (fns))
3128 fns = BASELINK_FUNCTIONS (fns);
3130 /* For a template-id, check to see if the template
3131 arguments are dependent. */
3132 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
3134 tree args = TREE_OPERAND (fns, 1);
3135 dependent_p = any_dependent_template_arguments_p (args);
3136 /* The functions are those referred to by the
3138 fns = TREE_OPERAND (fns, 0);
3141 /* If there are no dependent template arguments, go through
3142 the overloaded functions. */
3143 while (fns && !dependent_p)
3145 tree fn = OVL_CURRENT (fns);
3147 /* Member functions of dependent classes are
3149 if (TREE_CODE (fn) == FUNCTION_DECL
3150 && type_dependent_expression_p (fn))
3152 else if (TREE_CODE (fn) == TEMPLATE_DECL
3153 && dependent_template_p (fn))
3156 fns = OVL_NEXT (fns);
3160 /* If the name was dependent on a template parameter, we will
3161 resolve the name at instantiation time. */
3164 /* Create a SCOPE_REF for qualified names, if the scope is
3170 if (address_p && done)
3171 decl = finish_qualified_id_expr (scope, decl,
3177 tree type = NULL_TREE;
3178 if (DECL_P (decl) && !dependent_scope_p (scope))
3179 type = TREE_TYPE (decl);
3180 decl = build_qualified_name (type,
3186 if (TREE_TYPE (decl))
3187 decl = convert_from_reference (decl);
3190 /* A TEMPLATE_ID already contains all the information we
3192 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
3193 return id_expression;
3194 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
3195 /* If we found a variable, then name lookup during the
3196 instantiation will always resolve to the same VAR_DECL
3197 (or an instantiation thereof). */
3198 if (TREE_CODE (decl) == VAR_DECL
3199 || TREE_CODE (decl) == PARM_DECL)
3202 return convert_from_reference (decl);
3204 /* The same is true for FIELD_DECL, but we also need to
3205 make sure that the syntax is correct. */
3206 else if (TREE_CODE (decl) == FIELD_DECL)
3208 /* Since SCOPE is NULL here, this is an unqualified name.
3209 Access checking has been performed during name lookup
3210 already. Turn off checking to avoid duplicate errors. */
3211 push_deferring_access_checks (dk_no_check);
3212 decl = finish_non_static_data_member
3214 /*qualifying_scope=*/NULL_TREE);
3215 pop_deferring_access_checks ();
3218 return id_expression;
3221 if (TREE_CODE (decl) == NAMESPACE_DECL)
3223 error ("use of namespace %qD as expression", decl);
3224 return error_mark_node;
3226 else if (DECL_CLASS_TEMPLATE_P (decl))
3228 error ("use of class template %qT as expression", decl);
3229 return error_mark_node;
3231 else if (TREE_CODE (decl) == TREE_LIST)
3233 /* Ambiguous reference to base members. */
3234 error ("request for member %qD is ambiguous in "
3235 "multiple inheritance lattice", id_expression);
3236 print_candidates (decl);
3237 return error_mark_node;
3240 /* Mark variable-like entities as used. Functions are similarly
3241 marked either below or after overload resolution. */
3242 if (TREE_CODE (decl) == VAR_DECL
3243 || TREE_CODE (decl) == PARM_DECL
3244 || TREE_CODE (decl) == RESULT_DECL)
3247 /* Only certain kinds of names are allowed in constant
3248 expression. Enumerators and template parameters have already
3249 been handled above. */
3250 if (! error_operand_p (decl)
3251 && integral_constant_expression_p
3252 && ! decl_constant_var_p (decl)
3253 && ! builtin_valid_in_constant_expr_p (decl))
3255 if (!allow_non_integral_constant_expression_p)
3257 error ("%qD cannot appear in a constant-expression", decl);
3258 return error_mark_node;
3260 *non_integral_constant_expression_p = true;
3265 decl = (adjust_result_of_qualified_name_lookup
3266 (decl, scope, current_nonlambda_class_type()));
3268 if (TREE_CODE (decl) == FUNCTION_DECL)
3271 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
3272 decl = finish_qualified_id_expr (scope,
3280 tree r = convert_from_reference (decl);
3282 /* In a template, return a SCOPE_REF for most qualified-ids
3283 so that we can check access at instantiation time. But if
3284 we're looking at a member of the current instantiation, we
3285 know we have access and building up the SCOPE_REF confuses
3286 non-type template argument handling. */
3287 if (processing_template_decl && TYPE_P (scope)
3288 && !currently_open_class (scope))
3289 r = build_qualified_name (TREE_TYPE (r),
3295 else if (TREE_CODE (decl) == FIELD_DECL)
3297 /* Since SCOPE is NULL here, this is an unqualified name.
3298 Access checking has been performed during name lookup
3299 already. Turn off checking to avoid duplicate errors. */
3300 push_deferring_access_checks (dk_no_check);
3301 decl = finish_non_static_data_member (decl, NULL_TREE,
3302 /*qualifying_scope=*/NULL_TREE);
3303 pop_deferring_access_checks ();
3305 else if (is_overloaded_fn (decl))
3309 first_fn = get_first_fn (decl);
3310 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
3311 first_fn = DECL_TEMPLATE_RESULT (first_fn);
3313 if (!really_overloaded_fn (decl)
3314 && !mark_used (first_fn))
3315 return error_mark_node;
3318 && TREE_CODE (first_fn) == FUNCTION_DECL
3319 && DECL_FUNCTION_MEMBER_P (first_fn)
3320 && !shared_member_p (decl))
3322 /* A set of member functions. */
3323 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3324 return finish_class_member_access_expr (decl, id_expression,
3325 /*template_p=*/false,
3326 tf_warning_or_error);
3329 decl = baselink_for_fns (decl);
3333 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3334 && DECL_CLASS_SCOPE_P (decl))
3336 tree context = context_for_name_lookup (decl);
3337 if (context != current_class_type)
3339 tree path = currently_open_derived_class (context);
3340 perform_or_defer_access_check (TYPE_BINFO (path),
3345 decl = convert_from_reference (decl);
3349 if (TREE_DEPRECATED (decl))
3350 warn_deprecated_use (decl, NULL_TREE);
3355 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3356 use as a type-specifier. */
3359 finish_typeof (tree expr)
3363 if (type_dependent_expression_p (expr))
3365 type = cxx_make_type (TYPEOF_TYPE);
3366 TYPEOF_TYPE_EXPR (type) = expr;
3367 SET_TYPE_STRUCTURAL_EQUALITY (type);
3372 expr = mark_type_use (expr);
3374 type = unlowered_expr_type (expr);
3376 if (!type || type == unknown_type_node)
3378 error ("type of %qE is unknown", expr);
3379 return error_mark_node;
3385 /* Implement the __underlying_type keyword: Return the underlying
3386 type of TYPE, suitable for use as a type-specifier. */
3389 finish_underlying_type (tree type)
3391 tree underlying_type;
3393 if (processing_template_decl)
3395 underlying_type = cxx_make_type (UNDERLYING_TYPE);
3396 UNDERLYING_TYPE_TYPE (underlying_type) = type;
3397 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type);
3399 return underlying_type;
3402 complete_type (type);
3404 if (TREE_CODE (type) != ENUMERAL_TYPE)
3406 error ("%qT is not an enumeration type", type);
3407 return error_mark_node;
3410 underlying_type = ENUM_UNDERLYING_TYPE (type);
3412 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
3413 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
3414 See finish_enum_value_list for details. */
3415 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type))
3417 = c_common_type_for_mode (TYPE_MODE (underlying_type),
3418 TYPE_UNSIGNED (underlying_type));
3420 return underlying_type;
3423 /* Implement the __direct_bases keyword: Return the direct base classes
3427 calculate_direct_bases (tree type)
3429 VEC(tree, gc) *vector = make_tree_vector();
3430 tree bases_vec = NULL_TREE;
3431 VEC(tree, none) *base_binfos;
3435 complete_type (type);
3437 if (!NON_UNION_CLASS_TYPE_P (type))
3438 return make_tree_vec (0);
3440 base_binfos = BINFO_BASE_BINFOS (TYPE_BINFO (type));
3442 /* Virtual bases are initialized first */
3443 for (i = 0; VEC_iterate (tree, base_binfos, i, binfo); i++)
3445 if (BINFO_VIRTUAL_P (binfo))
3447 VEC_safe_push (tree, gc, vector, binfo);
3451 /* Now non-virtuals */
3452 for (i = 0; VEC_iterate (tree, base_binfos, i, binfo); i++)
3454 if (!BINFO_VIRTUAL_P (binfo))
3456 VEC_safe_push (tree, gc, vector, binfo);
3461 bases_vec = make_tree_vec (VEC_length (tree, vector));
3463 for (i = 0; i < VEC_length (tree, vector); ++i)
3465 TREE_VEC_ELT (bases_vec, i) = BINFO_TYPE (VEC_index (tree, vector, i));
3470 /* Implement the __bases keyword: Return the base classes
3473 /* Find morally non-virtual base classes by walking binfo hierarchy */
3474 /* Virtual base classes are handled separately in finish_bases */
3477 dfs_calculate_bases_pre (tree binfo, ATTRIBUTE_UNUSED void *data_)
3479 /* Don't walk bases of virtual bases */
3480 return BINFO_VIRTUAL_P (binfo) ? dfs_skip_bases : NULL_TREE;
3484 dfs_calculate_bases_post (tree binfo, void *data_)
3486 VEC(tree, gc) **data = (VEC(tree, gc) **) data_;
3487 if (!BINFO_VIRTUAL_P (binfo))
3489 VEC_safe_push (tree, gc, *data, BINFO_TYPE (binfo));
3494 /* Calculates the morally non-virtual base classes of a class */
3495 static VEC(tree, gc) *
3496 calculate_bases_helper (tree type)
3498 VEC(tree, gc) *vector = make_tree_vector();
3500 /* Now add non-virtual base classes in order of construction */
3501 dfs_walk_all (TYPE_BINFO (type),
3502 dfs_calculate_bases_pre, dfs_calculate_bases_post, &vector);
3507 calculate_bases (tree type)
3509 VEC(tree, gc) *vector = make_tree_vector();
3510 tree bases_vec = NULL_TREE;
3512 VEC(tree, gc) *vbases;
3513 VEC(tree, gc) *nonvbases;
3516 complete_type (type);
3518 if (!NON_UNION_CLASS_TYPE_P (type))
3519 return make_tree_vec (0);
3521 /* First go through virtual base classes */
3522 for (vbases = CLASSTYPE_VBASECLASSES (type), i = 0;
3523 VEC_iterate (tree, vbases, i, binfo); i++)
3525 VEC(tree, gc) *vbase_bases = calculate_bases_helper (BINFO_TYPE (binfo));
3526 VEC_safe_splice (tree, gc, vector, vbase_bases);
3527 release_tree_vector (vbase_bases);
3530 /* Now for the non-virtual bases */
3531 nonvbases = calculate_bases_helper (type);
3532 VEC_safe_splice (tree, gc, vector, nonvbases);
3533 release_tree_vector (nonvbases);
3535 /* Last element is entire class, so don't copy */
3536 bases_vec = make_tree_vec (VEC_length (tree, vector) - 1);
3538 for (i = 0; i < VEC_length (tree, vector) - 1; ++i)
3540 TREE_VEC_ELT (bases_vec, i) = VEC_index (tree, vector, i);
3542 release_tree_vector (vector);
3547 finish_bases (tree type, bool direct)
3549 tree bases = NULL_TREE;
3551 if (!processing_template_decl)
3553 /* Parameter packs can only be used in templates */
3554 error ("Parameter pack __bases only valid in template declaration");
3555 return error_mark_node;
3558 bases = cxx_make_type (BASES);
3559 BASES_TYPE (bases) = type;
3560 BASES_DIRECT (bases) = direct;
3561 SET_TYPE_STRUCTURAL_EQUALITY (bases);
3566 /* Perform C++-specific checks for __builtin_offsetof before calling
3570 finish_offsetof (tree expr)
3572 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3574 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3575 TREE_OPERAND (expr, 2));
3576 return error_mark_node;
3578 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3579 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3580 || TREE_TYPE (expr) == unknown_type_node)
3582 if (TREE_CODE (expr) == COMPONENT_REF
3583 || TREE_CODE (expr) == COMPOUND_EXPR)
3584 expr = TREE_OPERAND (expr, 1);
3585 error ("cannot apply %<offsetof%> to member function %qD", expr);
3586 return error_mark_node;
3588 if (REFERENCE_REF_P (expr))
3589 expr = TREE_OPERAND (expr, 0);
3590 if (TREE_CODE (expr) == COMPONENT_REF)
3592 tree object = TREE_OPERAND (expr, 0);
3593 if (!complete_type_or_else (TREE_TYPE (object), object))
3594 return error_mark_node;
3596 return fold_offsetof (expr);
3599 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3600 function is broken out from the above for the benefit of the tree-ssa
3604 simplify_aggr_init_expr (tree *tp)
3606 tree aggr_init_expr = *tp;
3608 /* Form an appropriate CALL_EXPR. */
3609 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3610 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3611 tree type = TREE_TYPE (slot);
3614 enum style_t { ctor, arg, pcc } style;
3616 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3618 #ifdef PCC_STATIC_STRUCT_RETURN
3624 gcc_assert (TREE_ADDRESSABLE (type));
3628 call_expr = build_call_array_loc (input_location,
3629 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3631 aggr_init_expr_nargs (aggr_init_expr),
3632 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3633 TREE_NOTHROW (call_expr) = TREE_NOTHROW (aggr_init_expr);
3637 /* Replace the first argument to the ctor with the address of the
3639 cxx_mark_addressable (slot);
3640 CALL_EXPR_ARG (call_expr, 0) =
3641 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3643 else if (style == arg)
3645 /* Just mark it addressable here, and leave the rest to
3646 expand_call{,_inline}. */
3647 cxx_mark_addressable (slot);
3648 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3649 call_expr = build2 (INIT_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3651 else if (style == pcc)
3653 /* If we're using the non-reentrant PCC calling convention, then we
3654 need to copy the returned value out of the static buffer into the
3656 push_deferring_access_checks (dk_no_check);
3657 call_expr = build_aggr_init (slot, call_expr,
3658 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3659 tf_warning_or_error);
3660 pop_deferring_access_checks ();
3661 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3664 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3666 tree init = build_zero_init (type, NULL_TREE,
3667 /*static_storage_p=*/false);
3668 init = build2 (INIT_EXPR, void_type_node, slot, init);
3669 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3676 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3679 emit_associated_thunks (tree fn)
3681 /* When we use vcall offsets, we emit thunks with the virtual
3682 functions to which they thunk. The whole point of vcall offsets
3683 is so that you can know statically the entire set of thunks that
3684 will ever be needed for a given virtual function, thereby
3685 enabling you to output all the thunks with the function itself. */
3686 if (DECL_VIRTUAL_P (fn)
3687 /* Do not emit thunks for extern template instantiations. */
3688 && ! DECL_REALLY_EXTERN (fn))
3692 for (thunk = DECL_THUNKS (fn); thunk; thunk = DECL_CHAIN (thunk))
3694 if (!THUNK_ALIAS (thunk))
3696 use_thunk (thunk, /*emit_p=*/1);
3697 if (DECL_RESULT_THUNK_P (thunk))
3701 for (probe = DECL_THUNKS (thunk);
3702 probe; probe = DECL_CHAIN (probe))
3703 use_thunk (probe, /*emit_p=*/1);
3707 gcc_assert (!DECL_THUNKS (thunk));
3712 /* Returns true iff FUN is an instantiation of a constexpr function
3716 is_instantiation_of_constexpr (tree fun)
3718 return (DECL_TEMPLOID_INSTANTIATION (fun)
3719 && DECL_DECLARED_CONSTEXPR_P (DECL_TEMPLATE_RESULT
3720 (DECL_TI_TEMPLATE (fun))));
3723 /* Generate RTL for FN. */
3726 expand_or_defer_fn_1 (tree fn)
3728 /* When the parser calls us after finishing the body of a template
3729 function, we don't really want to expand the body. */
3730 if (processing_template_decl)
3732 /* Normally, collection only occurs in rest_of_compilation. So,
3733 if we don't collect here, we never collect junk generated
3734 during the processing of templates until we hit a
3735 non-template function. It's not safe to do this inside a
3736 nested class, though, as the parser may have local state that
3737 is not a GC root. */
3738 if (!function_depth)
3743 gcc_assert (DECL_SAVED_TREE (fn));
3745 /* If this is a constructor or destructor body, we have to clone
3747 if (maybe_clone_body (fn))
3749 /* We don't want to process FN again, so pretend we've written
3750 it out, even though we haven't. */
3751 TREE_ASM_WRITTEN (fn) = 1;
3752 /* If this is an instantiation of a constexpr function, keep
3753 DECL_SAVED_TREE for explain_invalid_constexpr_fn. */
3754 if (!is_instantiation_of_constexpr (fn))
3755 DECL_SAVED_TREE (fn) = NULL_TREE;
3759 /* We make a decision about linkage for these functions at the end
3760 of the compilation. Until that point, we do not want the back
3761 end to output them -- but we do want it to see the bodies of
3762 these functions so that it can inline them as appropriate. */
3763 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3765 if (DECL_INTERFACE_KNOWN (fn))
3766 /* We've already made a decision as to how this function will
3770 DECL_EXTERNAL (fn) = 1;
3771 DECL_NOT_REALLY_EXTERN (fn) = 1;
3772 note_vague_linkage_fn (fn);
3773 /* A non-template inline function with external linkage will
3774 always be COMDAT. As we must eventually determine the
3775 linkage of all functions, and as that causes writes to
3776 the data mapped in from the PCH file, it's advantageous
3777 to mark the functions at this point. */
3778 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3780 /* This function must have external linkage, as
3781 otherwise DECL_INTERFACE_KNOWN would have been
3783 gcc_assert (TREE_PUBLIC (fn));
3784 comdat_linkage (fn);
3785 DECL_INTERFACE_KNOWN (fn) = 1;
3789 import_export_decl (fn);
3791 /* If the user wants us to keep all inline functions, then mark
3792 this function as needed so that finish_file will make sure to
3793 output it later. Similarly, all dllexport'd functions must
3794 be emitted; there may be callers in other DLLs. */
3795 if ((flag_keep_inline_functions
3796 && DECL_DECLARED_INLINE_P (fn)
3797 && !DECL_REALLY_EXTERN (fn))
3798 || (flag_keep_inline_dllexport
3799 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn))))
3802 DECL_EXTERNAL (fn) = 0;
3806 /* There's no reason to do any of the work here if we're only doing
3807 semantic analysis; this code just generates RTL. */
3808 if (flag_syntax_only)
3815 expand_or_defer_fn (tree fn)
3817 if (expand_or_defer_fn_1 (fn))
3821 /* Expand or defer, at the whim of the compilation unit manager. */
3822 cgraph_finalize_function (fn, function_depth > 1);
3823 emit_associated_thunks (fn);
3836 /* Helper function for walk_tree, used by finalize_nrv below. */
3839 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3841 struct nrv_data *dp = (struct nrv_data *)data;
3844 /* No need to walk into types. There wouldn't be any need to walk into
3845 non-statements, except that we have to consider STMT_EXPRs. */
3848 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3849 but differs from using NULL_TREE in that it indicates that we care
3850 about the value of the RESULT_DECL. */
3851 else if (TREE_CODE (*tp) == RETURN_EXPR)
3852 TREE_OPERAND (*tp, 0) = dp->result;
3853 /* Change all cleanups for the NRV to only run when an exception is
3855 else if (TREE_CODE (*tp) == CLEANUP_STMT
3856 && CLEANUP_DECL (*tp) == dp->var)
3857 CLEANUP_EH_ONLY (*tp) = 1;
3858 /* Replace the DECL_EXPR for the NRV with an initialization of the
3859 RESULT_DECL, if needed. */
3860 else if (TREE_CODE (*tp) == DECL_EXPR
3861 && DECL_EXPR_DECL (*tp) == dp->var)
3864 if (DECL_INITIAL (dp->var)
3865 && DECL_INITIAL (dp->var) != error_mark_node)
3866 init = build2 (INIT_EXPR, void_type_node, dp->result,
3867 DECL_INITIAL (dp->var));
3869 init = build_empty_stmt (EXPR_LOCATION (*tp));
3870 DECL_INITIAL (dp->var) = NULL_TREE;
3871 SET_EXPR_LOCATION (init, EXPR_LOCATION (*tp));
3874 /* And replace all uses of the NRV with the RESULT_DECL. */
3875 else if (*tp == dp->var)
3878 /* Avoid walking into the same tree more than once. Unfortunately, we
3879 can't just use walk_tree_without duplicates because it would only call
3880 us for the first occurrence of dp->var in the function body. */
3881 slot = htab_find_slot (dp->visited, *tp, INSERT);
3887 /* Keep iterating. */
3891 /* Called from finish_function to implement the named return value
3892 optimization by overriding all the RETURN_EXPRs and pertinent
3893 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3894 RESULT_DECL for the function. */
3897 finalize_nrv (tree *tp, tree var, tree result)
3899 struct nrv_data data;
3901 /* Copy name from VAR to RESULT. */
3902 DECL_NAME (result) = DECL_NAME (var);
3903 /* Don't forget that we take its address. */
3904 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3905 /* Finally set DECL_VALUE_EXPR to avoid assigning
3906 a stack slot at -O0 for the original var and debug info
3907 uses RESULT location for VAR. */
3908 SET_DECL_VALUE_EXPR (var, result);
3909 DECL_HAS_VALUE_EXPR_P (var) = 1;
3912 data.result = result;
3913 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3914 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3915 htab_delete (data.visited);
3918 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3921 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3922 bool need_copy_ctor, bool need_copy_assignment)
3924 int save_errorcount = errorcount;
3927 /* Always allocate 3 elements for simplicity. These are the
3928 function decls for the ctor, dtor, and assignment op.
3929 This layout is known to the three lang hooks,
3930 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3931 and cxx_omp_clause_assign_op. */
3932 info = make_tree_vec (3);
3933 CP_OMP_CLAUSE_INFO (c) = info;
3935 if (need_default_ctor || need_copy_ctor)
3937 if (need_default_ctor)
3938 t = get_default_ctor (type);
3940 t = get_copy_ctor (type, tf_warning_or_error);
3942 if (t && !trivial_fn_p (t))
3943 TREE_VEC_ELT (info, 0) = t;
3946 if ((need_default_ctor || need_copy_ctor)
3947 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3948 TREE_VEC_ELT (info, 1) = get_dtor (type, tf_warning_or_error);
3950 if (need_copy_assignment)
3952 t = get_copy_assign (type);
3954 if (t && !trivial_fn_p (t))
3955 TREE_VEC_ELT (info, 2) = t;
3958 return errorcount != save_errorcount;
3961 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3962 Remove any elements from the list that are invalid. */
3965 finish_omp_clauses (tree clauses)
3967 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3968 tree c, t, *pc = &clauses;
3971 bitmap_obstack_initialize (NULL);
3972 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3973 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3974 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3976 for (pc = &clauses, c = clauses; c ; c = *pc)
3978 bool remove = false;
3980 switch (OMP_CLAUSE_CODE (c))
3982 case OMP_CLAUSE_SHARED:
3984 goto check_dup_generic;
3985 case OMP_CLAUSE_PRIVATE:
3987 goto check_dup_generic;
3988 case OMP_CLAUSE_REDUCTION:
3990 goto check_dup_generic;
3991 case OMP_CLAUSE_COPYPRIVATE:
3992 name = "copyprivate";
3993 goto check_dup_generic;
3994 case OMP_CLAUSE_COPYIN:
3996 goto check_dup_generic;
3998 t = OMP_CLAUSE_DECL (c);
3999 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
4001 if (processing_template_decl)
4004 error ("%qD is not a variable in clause %qs", t, name);
4006 error ("%qE is not a variable in clause %qs", t, name);
4009 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
4010 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
4011 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
4013 error ("%qD appears more than once in data clauses", t);
4017 bitmap_set_bit (&generic_head, DECL_UID (t));
4020 case OMP_CLAUSE_FIRSTPRIVATE:
4021 t = OMP_CLAUSE_DECL (c);
4022 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
4024 if (processing_template_decl)
4027 error ("%qD is not a variable in clause %<firstprivate%>", t);
4029 error ("%qE is not a variable in clause %<firstprivate%>", t);
4032 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
4033 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
4035 error ("%qD appears more than once in data clauses", t);
4039 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
4042 case OMP_CLAUSE_LASTPRIVATE:
4043 t = OMP_CLAUSE_DECL (c);
4044 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
4046 if (processing_template_decl)
4049 error ("%qD is not a variable in clause %<lastprivate%>", t);
4051 error ("%qE is not a variable in clause %<lastprivate%>", t);
4054 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
4055 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
4057 error ("%qD appears more than once in data clauses", t);
4061 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
4065 t = OMP_CLAUSE_IF_EXPR (c);
4066 t = maybe_convert_cond (t);
4067 if (t == error_mark_node)
4069 OMP_CLAUSE_IF_EXPR (c) = t;
4072 case OMP_CLAUSE_FINAL:
4073 t = OMP_CLAUSE_FINAL_EXPR (c);
4074 t = maybe_convert_cond (t);
4075 if (t == error_mark_node)
4077 OMP_CLAUSE_FINAL_EXPR (c) = t;
4080 case OMP_CLAUSE_NUM_THREADS:
4081 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
4082 if (t == error_mark_node)
4084 else if (!type_dependent_expression_p (t)
4085 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
4087 error ("num_threads expression must be integral");
4092 case OMP_CLAUSE_SCHEDULE:
4093 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
4096 else if (t == error_mark_node)
4098 else if (!type_dependent_expression_p (t)
4099 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
4101 error ("schedule chunk size expression must be integral");
4106 case OMP_CLAUSE_NOWAIT:
4107 case OMP_CLAUSE_ORDERED:
4108 case OMP_CLAUSE_DEFAULT:
4109 case OMP_CLAUSE_UNTIED:
4110 case OMP_CLAUSE_COLLAPSE:
4111 case OMP_CLAUSE_MERGEABLE:
4119 *pc = OMP_CLAUSE_CHAIN (c);
4121 pc = &OMP_CLAUSE_CHAIN (c);
4124 for (pc = &clauses, c = clauses; c ; c = *pc)
4126 enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c);
4127 bool remove = false;
4128 bool need_complete_non_reference = false;
4129 bool need_default_ctor = false;
4130 bool need_copy_ctor = false;
4131 bool need_copy_assignment = false;
4132 bool need_implicitly_determined = false;
4133 tree type, inner_type;
4137 case OMP_CLAUSE_SHARED:
4139 need_implicitly_determined = true;
4141 case OMP_CLAUSE_PRIVATE:
4143 need_complete_non_reference = true;
4144 need_default_ctor = true;
4145 need_implicitly_determined = true;
4147 case OMP_CLAUSE_FIRSTPRIVATE:
4148 name = "firstprivate";
4149 need_complete_non_reference = true;
4150 need_copy_ctor = true;
4151 need_implicitly_determined = true;
4153 case OMP_CLAUSE_LASTPRIVATE:
4154 name = "lastprivate";
4155 need_complete_non_reference = true;
4156 need_copy_assignment = true;
4157 need_implicitly_determined = true;
4159 case OMP_CLAUSE_REDUCTION:
4161 need_implicitly_determined = true;
4163 case OMP_CLAUSE_COPYPRIVATE:
4164 name = "copyprivate";
4165 need_copy_assignment = true;
4167 case OMP_CLAUSE_COPYIN:
4169 need_copy_assignment = true;
4172 pc = &OMP_CLAUSE_CHAIN (c);
4176 t = OMP_CLAUSE_DECL (c);
4177 if (processing_template_decl
4178 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
4180 pc = &OMP_CLAUSE_CHAIN (c);
4186 case OMP_CLAUSE_LASTPRIVATE:
4187 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
4188 need_default_ctor = true;
4191 case OMP_CLAUSE_REDUCTION:
4192 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
4193 || POINTER_TYPE_P (TREE_TYPE (t)))
4195 error ("%qE has invalid type for %<reduction%>", t);
4198 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
4200 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
4210 error ("%qE has invalid type for %<reduction(%s)%>",
4211 t, operator_name_info[r_code].name);
4217 case OMP_CLAUSE_COPYIN:
4218 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
4220 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
4229 if (need_complete_non_reference || need_copy_assignment)
4231 t = require_complete_type (t);
4232 if (t == error_mark_node)
4234 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE
4235 && need_complete_non_reference)
4237 error ("%qE has reference type for %qs", t, name);
4241 if (need_implicitly_determined)
4243 const char *share_name = NULL;
4245 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
4246 share_name = "threadprivate";
4247 else switch (cxx_omp_predetermined_sharing (t))
4249 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
4251 case OMP_CLAUSE_DEFAULT_SHARED:
4252 /* const vars may be specified in firstprivate clause. */
4253 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_FIRSTPRIVATE
4254 && cxx_omp_const_qual_no_mutable (t))
4256 share_name = "shared";
4258 case OMP_CLAUSE_DEFAULT_PRIVATE:
4259 share_name = "private";
4266 error ("%qE is predetermined %qs for %qs",
4267 t, share_name, name);
4272 /* We're interested in the base element, not arrays. */
4273 inner_type = type = TREE_TYPE (t);
4274 while (TREE_CODE (inner_type) == ARRAY_TYPE)
4275 inner_type = TREE_TYPE (inner_type);
4277 /* Check for special function availability by building a call to one.
4278 Save the results, because later we won't be in the right context
4279 for making these queries. */
4280 if (CLASS_TYPE_P (inner_type)
4281 && COMPLETE_TYPE_P (inner_type)
4282 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
4283 && !type_dependent_expression_p (t)
4284 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
4285 need_copy_ctor, need_copy_assignment))
4289 *pc = OMP_CLAUSE_CHAIN (c);
4291 pc = &OMP_CLAUSE_CHAIN (c);
4294 bitmap_obstack_release (NULL);
4298 /* For all variables in the tree_list VARS, mark them as thread local. */
4301 finish_omp_threadprivate (tree vars)
4305 /* Mark every variable in VARS to be assigned thread local storage. */
4306 for (t = vars; t; t = TREE_CHAIN (t))
4308 tree v = TREE_PURPOSE (t);
4310 if (error_operand_p (v))
4312 else if (TREE_CODE (v) != VAR_DECL)
4313 error ("%<threadprivate%> %qD is not file, namespace "
4314 "or block scope variable", v);
4315 /* If V had already been marked threadprivate, it doesn't matter
4316 whether it had been used prior to this point. */
4317 else if (TREE_USED (v)
4318 && (DECL_LANG_SPECIFIC (v) == NULL
4319 || !CP_DECL_THREADPRIVATE_P (v)))
4320 error ("%qE declared %<threadprivate%> after first use", v);
4321 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
4322 error ("automatic variable %qE cannot be %<threadprivate%>", v);
4323 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
4324 error ("%<threadprivate%> %qE has incomplete type", v);
4325 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
4326 && CP_DECL_CONTEXT (v) != current_class_type)
4327 error ("%<threadprivate%> %qE directive not "
4328 "in %qT definition", v, CP_DECL_CONTEXT (v));
4331 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4332 if (DECL_LANG_SPECIFIC (v) == NULL)
4334 retrofit_lang_decl (v);
4336 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4337 after the allocation of the lang_decl structure. */
4338 if (DECL_DISCRIMINATOR_P (v))
4339 DECL_LANG_SPECIFIC (v)->u.base.u2sel = 1;
4342 if (! DECL_THREAD_LOCAL_P (v))
4344 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
4345 /* If rtl has been already set for this var, call
4346 make_decl_rtl once again, so that encode_section_info
4347 has a chance to look at the new decl flags. */
4348 if (DECL_RTL_SET_P (v))
4351 CP_DECL_THREADPRIVATE_P (v) = 1;
4356 /* Build an OpenMP structured block. */
4359 begin_omp_structured_block (void)
4361 return do_pushlevel (sk_omp);
4365 finish_omp_structured_block (tree block)
4367 return do_poplevel (block);
4370 /* Similarly, except force the retention of the BLOCK. */
4373 begin_omp_parallel (void)
4375 keep_next_level (true);
4376 return begin_omp_structured_block ();
4380 finish_omp_parallel (tree clauses, tree body)
4384 body = finish_omp_structured_block (body);
4386 stmt = make_node (OMP_PARALLEL);
4387 TREE_TYPE (stmt) = void_type_node;
4388 OMP_PARALLEL_CLAUSES (stmt) = clauses;
4389 OMP_PARALLEL_BODY (stmt) = body;
4391 return add_stmt (stmt);
4395 begin_omp_task (void)
4397 keep_next_level (true);
4398 return begin_omp_structured_block ();
4402 finish_omp_task (tree clauses, tree body)
4406 body = finish_omp_structured_block (body);
4408 stmt = make_node (OMP_TASK);
4409 TREE_TYPE (stmt) = void_type_node;
4410 OMP_TASK_CLAUSES (stmt) = clauses;
4411 OMP_TASK_BODY (stmt) = body;
4413 return add_stmt (stmt);
4416 /* Helper function for finish_omp_for. Convert Ith random access iterator
4417 into integral iterator. Return FALSE if successful. */
4420 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
4421 tree condv, tree incrv, tree *body,
4422 tree *pre_body, tree clauses)
4424 tree diff, iter_init, iter_incr = NULL, last;
4425 tree incr_var = NULL, orig_pre_body, orig_body, c;
4426 tree decl = TREE_VEC_ELT (declv, i);
4427 tree init = TREE_VEC_ELT (initv, i);
4428 tree cond = TREE_VEC_ELT (condv, i);
4429 tree incr = TREE_VEC_ELT (incrv, i);
4431 location_t elocus = locus;
4433 if (init && EXPR_HAS_LOCATION (init))
4434 elocus = EXPR_LOCATION (init);
4436 switch (TREE_CODE (cond))
4442 if (TREE_OPERAND (cond, 1) == iter)
4443 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
4444 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
4445 if (TREE_OPERAND (cond, 0) != iter)
4446 cond = error_mark_node;
4449 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
4450 TREE_OPERAND (cond, 1), ERROR_MARK,
4451 NULL, tf_warning_or_error);
4452 if (error_operand_p (tem))
4457 cond = error_mark_node;
4460 if (cond == error_mark_node)
4462 error_at (elocus, "invalid controlling predicate");
4465 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
4466 ERROR_MARK, iter, ERROR_MARK, NULL,
4467 tf_warning_or_error);
4468 if (error_operand_p (diff))
4470 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
4472 error_at (elocus, "difference between %qE and %qD does not have integer type",
4473 TREE_OPERAND (cond, 1), iter);
4477 switch (TREE_CODE (incr))
4479 case PREINCREMENT_EXPR:
4480 case PREDECREMENT_EXPR:
4481 case POSTINCREMENT_EXPR:
4482 case POSTDECREMENT_EXPR:
4483 if (TREE_OPERAND (incr, 0) != iter)
4485 incr = error_mark_node;
4488 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
4489 tf_warning_or_error);
4490 if (error_operand_p (iter_incr))
4492 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
4493 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4494 incr = integer_one_node;
4496 incr = integer_minus_one_node;
4499 if (TREE_OPERAND (incr, 0) != iter)
4500 incr = error_mark_node;
4501 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4502 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4504 tree rhs = TREE_OPERAND (incr, 1);
4505 if (TREE_OPERAND (rhs, 0) == iter)
4507 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4509 incr = error_mark_node;
4512 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4513 TREE_OPERAND (rhs, 1),
4514 tf_warning_or_error);
4515 if (error_operand_p (iter_incr))
4517 incr = TREE_OPERAND (rhs, 1);
4518 incr = cp_convert (TREE_TYPE (diff), incr);
4519 if (TREE_CODE (rhs) == MINUS_EXPR)
4521 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4522 incr = fold_if_not_in_template (incr);
4524 if (TREE_CODE (incr) != INTEGER_CST
4525 && (TREE_CODE (incr) != NOP_EXPR
4526 || (TREE_CODE (TREE_OPERAND (incr, 0))
4531 else if (TREE_OPERAND (rhs, 1) == iter)
4533 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4534 || TREE_CODE (rhs) != PLUS_EXPR)
4535 incr = error_mark_node;
4538 iter_incr = build_x_binary_op (PLUS_EXPR,
4539 TREE_OPERAND (rhs, 0),
4542 tf_warning_or_error);
4543 if (error_operand_p (iter_incr))
4545 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4547 tf_warning_or_error);
4548 if (error_operand_p (iter_incr))
4550 incr = TREE_OPERAND (rhs, 0);
4555 incr = error_mark_node;
4558 incr = error_mark_node;
4561 incr = error_mark_node;
4565 if (incr == error_mark_node)
4567 error_at (elocus, "invalid increment expression");
4571 incr = cp_convert (TREE_TYPE (diff), incr);
4572 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4573 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4574 && OMP_CLAUSE_DECL (c) == iter)
4577 decl = create_temporary_var (TREE_TYPE (diff));
4579 add_decl_expr (decl);
4580 last = create_temporary_var (TREE_TYPE (diff));
4582 add_decl_expr (last);
4583 if (c && iter_incr == NULL)
4585 incr_var = create_temporary_var (TREE_TYPE (diff));
4586 pushdecl (incr_var);
4587 add_decl_expr (incr_var);
4589 gcc_assert (stmts_are_full_exprs_p ());
4591 orig_pre_body = *pre_body;
4592 *pre_body = push_stmt_list ();
4594 add_stmt (orig_pre_body);
4596 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4597 tf_warning_or_error));
4598 init = build_int_cst (TREE_TYPE (diff), 0);
4599 if (c && iter_incr == NULL)
4601 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4602 incr, tf_warning_or_error));
4604 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4605 tf_warning_or_error);
4607 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4608 tf_warning_or_error));
4609 *pre_body = pop_stmt_list (*pre_body);
4611 cond = cp_build_binary_op (elocus,
4612 TREE_CODE (cond), decl, diff,
4613 tf_warning_or_error);
4614 incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR,
4615 elocus, incr, NULL_TREE);
4618 *body = push_stmt_list ();
4619 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4620 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4621 tf_warning_or_error);
4622 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4623 finish_expr_stmt (iter_init);
4624 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4625 tf_warning_or_error));
4626 add_stmt (orig_body);
4627 *body = pop_stmt_list (*body);
4631 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4632 finish_expr_stmt (iter_incr);
4633 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4634 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4637 TREE_VEC_ELT (declv, i) = decl;
4638 TREE_VEC_ELT (initv, i) = init;
4639 TREE_VEC_ELT (condv, i) = cond;
4640 TREE_VEC_ELT (incrv, i) = incr;
4645 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4646 are directly for their associated operands in the statement. DECL
4647 and INIT are a combo; if DECL is NULL then INIT ought to be a
4648 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4649 optional statements that need to go before the loop into its
4653 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4654 tree incrv, tree body, tree pre_body, tree clauses)
4656 tree omp_for = NULL, orig_incr = NULL;
4657 tree decl, init, cond, incr;
4661 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4662 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4663 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4664 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4666 decl = TREE_VEC_ELT (declv, i);
4667 init = TREE_VEC_ELT (initv, i);
4668 cond = TREE_VEC_ELT (condv, i);
4669 incr = TREE_VEC_ELT (incrv, i);
4675 switch (TREE_CODE (init))
4678 decl = TREE_OPERAND (init, 0);
4679 init = TREE_OPERAND (init, 1);
4682 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4684 decl = TREE_OPERAND (init, 0);
4685 init = TREE_OPERAND (init, 2);
4695 "expected iteration declaration or initialization");
4700 if (init && EXPR_HAS_LOCATION (init))
4701 elocus = EXPR_LOCATION (init);
4705 error_at (elocus, "missing controlling predicate");
4711 error_at (elocus, "missing increment expression");
4715 TREE_VEC_ELT (declv, i) = decl;
4716 TREE_VEC_ELT (initv, i) = init;
4719 if (dependent_omp_for_p (declv, initv, condv, incrv))
4723 stmt = make_node (OMP_FOR);
4725 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4727 /* This is really just a place-holder. We'll be decomposing this
4728 again and going through the cp_build_modify_expr path below when
4729 we instantiate the thing. */
4730 TREE_VEC_ELT (initv, i)
4731 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4732 TREE_VEC_ELT (initv, i));
4735 TREE_TYPE (stmt) = void_type_node;
4736 OMP_FOR_INIT (stmt) = initv;
4737 OMP_FOR_COND (stmt) = condv;
4738 OMP_FOR_INCR (stmt) = incrv;
4739 OMP_FOR_BODY (stmt) = body;
4740 OMP_FOR_PRE_BODY (stmt) = pre_body;
4741 OMP_FOR_CLAUSES (stmt) = clauses;
4743 SET_EXPR_LOCATION (stmt, locus);
4744 return add_stmt (stmt);
4747 if (processing_template_decl)
4748 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4750 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4752 decl = TREE_VEC_ELT (declv, i);
4753 init = TREE_VEC_ELT (initv, i);
4754 cond = TREE_VEC_ELT (condv, i);
4755 incr = TREE_VEC_ELT (incrv, i);
4757 TREE_VEC_ELT (orig_incr, i) = incr;
4760 if (init && EXPR_HAS_LOCATION (init))
4761 elocus = EXPR_LOCATION (init);
4765 error_at (elocus, "expected iteration declaration or initialization");
4769 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4772 TREE_VEC_ELT (orig_incr, i) = incr;
4773 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4774 TREE_CODE (TREE_OPERAND (incr, 1)),
4775 TREE_OPERAND (incr, 2),
4776 tf_warning_or_error);
4779 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4781 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4782 incrv, &body, &pre_body, clauses))
4787 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4788 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4790 error_at (elocus, "invalid type for iteration variable %qE", decl);
4794 if (!processing_template_decl)
4796 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4797 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4800 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4802 && TREE_SIDE_EFFECTS (cond)
4803 && COMPARISON_CLASS_P (cond)
4804 && !processing_template_decl)
4806 tree t = TREE_OPERAND (cond, 0);
4807 if (TREE_SIDE_EFFECTS (t)
4809 && (TREE_CODE (t) != NOP_EXPR
4810 || TREE_OPERAND (t, 0) != decl))
4811 TREE_OPERAND (cond, 0)
4812 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4814 t = TREE_OPERAND (cond, 1);
4815 if (TREE_SIDE_EFFECTS (t)
4817 && (TREE_CODE (t) != NOP_EXPR
4818 || TREE_OPERAND (t, 0) != decl))
4819 TREE_OPERAND (cond, 1)
4820 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4822 if (decl == error_mark_node || init == error_mark_node)
4825 TREE_VEC_ELT (declv, i) = decl;
4826 TREE_VEC_ELT (initv, i) = init;
4827 TREE_VEC_ELT (condv, i) = cond;
4828 TREE_VEC_ELT (incrv, i) = incr;
4832 if (IS_EMPTY_STMT (pre_body))
4835 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4838 if (omp_for == NULL)
4841 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4843 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4844 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4846 if (TREE_CODE (incr) != MODIFY_EXPR)
4849 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4850 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4851 && !processing_template_decl)
4853 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4854 if (TREE_SIDE_EFFECTS (t)
4856 && (TREE_CODE (t) != NOP_EXPR
4857 || TREE_OPERAND (t, 0) != decl))
4858 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4859 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4861 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4862 if (TREE_SIDE_EFFECTS (t)
4864 && (TREE_CODE (t) != NOP_EXPR
4865 || TREE_OPERAND (t, 0) != decl))
4866 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4867 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4871 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4873 if (omp_for != NULL)
4874 OMP_FOR_CLAUSES (omp_for) = clauses;
4879 finish_omp_atomic (enum tree_code code, enum tree_code opcode, tree lhs,
4880 tree rhs, tree v, tree lhs1, tree rhs1)
4895 dependent_p = false;
4898 /* Even in a template, we can detect invalid uses of the atomic
4899 pragma if neither LHS nor RHS is type-dependent. */
4900 if (processing_template_decl)
4902 dependent_p = (type_dependent_expression_p (lhs)
4903 || (rhs && type_dependent_expression_p (rhs))
4904 || (v && type_dependent_expression_p (v))
4905 || (lhs1 && type_dependent_expression_p (lhs1))
4906 || (rhs1 && type_dependent_expression_p (rhs1)));
4909 lhs = build_non_dependent_expr (lhs);
4911 rhs = build_non_dependent_expr (rhs);
4913 v = build_non_dependent_expr (v);
4915 lhs1 = build_non_dependent_expr (lhs1);
4917 rhs1 = build_non_dependent_expr (rhs1);
4922 stmt = c_finish_omp_atomic (input_location, code, opcode, lhs, rhs,
4924 if (stmt == error_mark_node)
4927 if (processing_template_decl)
4929 if (code == OMP_ATOMIC_READ)
4931 stmt = build_min_nt (OMP_ATOMIC_READ, orig_lhs);
4932 stmt = build2 (MODIFY_EXPR, void_type_node, orig_v, stmt);
4936 if (opcode == NOP_EXPR)
4937 stmt = build2 (MODIFY_EXPR, void_type_node, orig_lhs, orig_rhs);
4939 stmt = build2 (opcode, void_type_node, orig_lhs, orig_rhs);
4941 stmt = build_min_nt (COMPOUND_EXPR, orig_rhs1, stmt);
4942 if (code != OMP_ATOMIC)
4944 stmt = build_min_nt (code, orig_lhs1, stmt);
4945 stmt = build2 (MODIFY_EXPR, void_type_node, orig_v, stmt);
4948 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node, stmt);
4954 finish_omp_barrier (void)
4956 tree fn = builtin_decl_explicit (BUILT_IN_GOMP_BARRIER);
4957 VEC(tree,gc) *vec = make_tree_vector ();
4958 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4959 release_tree_vector (vec);
4960 finish_expr_stmt (stmt);
4964 finish_omp_flush (void)
4966 tree fn = builtin_decl_explicit (BUILT_IN_SYNC_SYNCHRONIZE);
4967 VEC(tree,gc) *vec = make_tree_vector ();
4968 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4969 release_tree_vector (vec);
4970 finish_expr_stmt (stmt);
4974 finish_omp_taskwait (void)
4976 tree fn = builtin_decl_explicit (BUILT_IN_GOMP_TASKWAIT);
4977 VEC(tree,gc) *vec = make_tree_vector ();
4978 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4979 release_tree_vector (vec);
4980 finish_expr_stmt (stmt);
4984 finish_omp_taskyield (void)
4986 tree fn = builtin_decl_explicit (BUILT_IN_GOMP_TASKYIELD);
4987 VEC(tree,gc) *vec = make_tree_vector ();
4988 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4989 release_tree_vector (vec);
4990 finish_expr_stmt (stmt);
4993 /* Begin a __transaction_atomic or __transaction_relaxed statement.
4994 If PCOMPOUND is non-null, this is for a function-transaction-block, and we
4995 should create an extra compound stmt. */
4998 begin_transaction_stmt (location_t loc, tree *pcompound, int flags)
5003 *pcompound = begin_compound_stmt (0);
5005 r = build_stmt (loc, TRANSACTION_EXPR, NULL_TREE);
5007 /* Only add the statement to the function if support enabled. */
5011 error_at (loc, ((flags & TM_STMT_ATTR_RELAXED) != 0
5012 ? G_("%<__transaction_relaxed%> without "
5013 "transactional memory support enabled")
5014 : G_("%<__transaction_atomic%> without "
5015 "transactional memory support enabled")));
5017 TRANSACTION_EXPR_BODY (r) = push_stmt_list ();
5021 /* End a __transaction_atomic or __transaction_relaxed statement.
5022 If COMPOUND_STMT is non-null, this is for a function-transaction-block,
5023 and we should end the compound. */
5026 finish_transaction_stmt (tree stmt, tree compound_stmt, int flags)
5028 TRANSACTION_EXPR_BODY (stmt) = pop_stmt_list (TRANSACTION_EXPR_BODY (stmt));
5029 TRANSACTION_EXPR_OUTER (stmt) = (flags & TM_STMT_ATTR_OUTER) != 0;
5030 TRANSACTION_EXPR_RELAXED (stmt) = (flags & TM_STMT_ATTR_RELAXED) != 0;
5031 TRANSACTION_EXPR_IS_STMT (stmt) = 1;
5034 finish_compound_stmt (compound_stmt);
5038 /* Build a __transaction_atomic or __transaction_relaxed expression. */
5041 build_transaction_expr (location_t loc, tree expr, int flags)
5044 ret = build1 (TRANSACTION_EXPR, TREE_TYPE (expr), expr);
5045 if (flags & TM_STMT_ATTR_RELAXED)
5046 TRANSACTION_EXPR_RELAXED (ret) = 1;
5047 SET_EXPR_LOCATION (ret, loc);
5052 init_cp_semantics (void)
5056 /* Build a STATIC_ASSERT for a static assertion with the condition
5057 CONDITION and the message text MESSAGE. LOCATION is the location
5058 of the static assertion in the source code. When MEMBER_P, this
5059 static assertion is a member of a class. */
5061 finish_static_assert (tree condition, tree message, location_t location,
5064 if (check_for_bare_parameter_packs (condition))
5065 condition = error_mark_node;
5067 if (type_dependent_expression_p (condition)
5068 || value_dependent_expression_p (condition))
5070 /* We're in a template; build a STATIC_ASSERT and put it in
5074 assertion = make_node (STATIC_ASSERT);
5075 STATIC_ASSERT_CONDITION (assertion) = condition;
5076 STATIC_ASSERT_MESSAGE (assertion) = message;
5077 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
5080 maybe_add_class_template_decl_list (current_class_type,
5084 add_stmt (assertion);
5089 /* Fold the expression and convert it to a boolean value. */
5090 condition = fold_non_dependent_expr (condition);
5091 condition = cp_convert (boolean_type_node, condition);
5092 condition = maybe_constant_value (condition);
5094 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
5095 /* Do nothing; the condition is satisfied. */
5099 location_t saved_loc = input_location;
5101 input_location = location;
5102 if (TREE_CODE (condition) == INTEGER_CST
5103 && integer_zerop (condition))
5104 /* Report the error. */
5105 error ("static assertion failed: %E", message);
5106 else if (condition && condition != error_mark_node)
5108 error ("non-constant condition for static assertion");
5109 cxx_constant_value (condition);
5111 input_location = saved_loc;
5115 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
5116 suitable for use as a type-specifier.
5118 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
5119 id-expression or a class member access, FALSE when it was parsed as
5120 a full expression. */
5123 finish_decltype_type (tree expr, bool id_expression_or_member_access_p,
5124 tsubst_flags_t complain)
5126 tree type = NULL_TREE;
5128 if (!expr || error_operand_p (expr))
5129 return error_mark_node;
5132 || TREE_CODE (expr) == TYPE_DECL
5133 || (TREE_CODE (expr) == BIT_NOT_EXPR
5134 && TYPE_P (TREE_OPERAND (expr, 0))))
5136 if (complain & tf_error)
5137 error ("argument to decltype must be an expression");
5138 return error_mark_node;
5141 /* FIXME instantiation-dependent */
5142 if (type_dependent_expression_p (expr)
5143 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
5144 if it isn't dependent, so that we can check access control at
5145 instantiation time, so defer the decltype as well (PR 42277). */
5146 || (id_expression_or_member_access_p
5147 && processing_template_decl
5148 && TREE_CODE (expr) == COMPONENT_REF))
5150 type = cxx_make_type (DECLTYPE_TYPE);
5151 DECLTYPE_TYPE_EXPR (type) = expr;
5152 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
5153 = id_expression_or_member_access_p;
5154 SET_TYPE_STRUCTURAL_EQUALITY (type);
5159 /* The type denoted by decltype(e) is defined as follows: */
5161 expr = resolve_nondeduced_context (expr);
5163 if (type_unknown_p (expr))
5165 if (complain & tf_error)
5166 error ("decltype cannot resolve address of overloaded function");
5167 return error_mark_node;
5170 if (invalid_nonstatic_memfn_p (expr, complain))
5171 return error_mark_node;
5173 /* To get the size of a static data member declared as an array of
5174 unknown bound, we need to instantiate it. */
5175 if (TREE_CODE (expr) == VAR_DECL
5176 && VAR_HAD_UNKNOWN_BOUND (expr)
5177 && DECL_TEMPLATE_INSTANTIATION (expr))
5178 instantiate_decl (expr, /*defer_ok*/true, /*expl_inst_mem*/false);
5180 if (id_expression_or_member_access_p)
5182 /* If e is an id-expression or a class member access (5.2.5
5183 [expr.ref]), decltype(e) is defined as the type of the entity
5184 named by e. If there is no such entity, or e names a set of
5185 overloaded functions, the program is ill-formed. */
5186 if (TREE_CODE (expr) == IDENTIFIER_NODE)
5187 expr = lookup_name (expr);
5189 if (TREE_CODE (expr) == INDIRECT_REF)
5190 /* This can happen when the expression is, e.g., "a.b". Just
5191 look at the underlying operand. */
5192 expr = TREE_OPERAND (expr, 0);
5194 if (TREE_CODE (expr) == OFFSET_REF
5195 || TREE_CODE (expr) == MEMBER_REF)
5196 /* We're only interested in the field itself. If it is a
5197 BASELINK, we will need to see through it in the next
5199 expr = TREE_OPERAND (expr, 1);
5201 if (BASELINK_P (expr))
5202 /* See through BASELINK nodes to the underlying function. */
5203 expr = BASELINK_FUNCTIONS (expr);
5205 switch (TREE_CODE (expr))
5208 if (DECL_BIT_FIELD_TYPE (expr))
5210 type = DECL_BIT_FIELD_TYPE (expr);
5213 /* Fall through for fields that aren't bitfields. */
5220 case TEMPLATE_PARM_INDEX:
5221 expr = mark_type_use (expr);
5222 type = TREE_TYPE (expr);
5226 type = error_mark_node;
5230 mark_type_use (expr);
5231 type = is_bitfield_expr_with_lowered_type (expr);
5233 type = TREE_TYPE (TREE_OPERAND (expr, 1));
5241 /* We can get here when the id-expression refers to an
5242 enumerator or non-type template parameter. */
5243 type = TREE_TYPE (expr);
5248 return error_mark_node;
5253 /* Within a lambda-expression:
5255 Every occurrence of decltype((x)) where x is a possibly
5256 parenthesized id-expression that names an entity of
5257 automatic storage duration is treated as if x were
5258 transformed into an access to a corresponding data member
5259 of the closure type that would have been declared if x
5260 were a use of the denoted entity. */
5261 if (outer_automatic_var_p (expr)
5262 && current_function_decl
5263 && LAMBDA_FUNCTION_P (current_function_decl))
5264 type = capture_decltype (expr);
5265 else if (error_operand_p (expr))
5266 type = error_mark_node;
5267 else if (expr == current_class_ptr)
5268 /* If the expression is just "this", we want the
5269 cv-unqualified pointer for the "this" type. */
5270 type = TYPE_MAIN_VARIANT (TREE_TYPE (expr));
5273 /* Otherwise, where T is the type of e, if e is an lvalue,
5274 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
5275 cp_lvalue_kind clk = lvalue_kind (expr);
5276 type = unlowered_expr_type (expr);
5277 gcc_assert (TREE_CODE (type) != REFERENCE_TYPE);
5278 if (clk != clk_none && !(clk & clk_class))
5279 type = cp_build_reference_type (type, (clk & clk_rvalueref));
5286 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
5287 __has_nothrow_copy, depending on assign_p. */
5290 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
5297 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
5300 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
5302 else if (TYPE_HAS_COPY_CTOR (type))
5304 /* If construction of the copy constructor was postponed, create
5306 if (CLASSTYPE_LAZY_COPY_CTOR (type))
5307 lazily_declare_fn (sfk_copy_constructor, type);
5308 if (CLASSTYPE_LAZY_MOVE_CTOR (type))
5309 lazily_declare_fn (sfk_move_constructor, type);
5310 fns = CLASSTYPE_CONSTRUCTORS (type);
5315 for (; fns; fns = OVL_NEXT (fns))
5317 tree fn = OVL_CURRENT (fns);
5321 if (copy_fn_p (fn) == 0)
5324 else if (copy_fn_p (fn) <= 0)
5327 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
5334 /* Actually evaluates the trait. */
5337 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
5339 enum tree_code type_code1;
5342 type_code1 = TREE_CODE (type1);
5346 case CPTK_HAS_NOTHROW_ASSIGN:
5347 type1 = strip_array_types (type1);
5348 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5349 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
5350 || (CLASS_TYPE_P (type1)
5351 && classtype_has_nothrow_assign_or_copy_p (type1,
5354 case CPTK_HAS_TRIVIAL_ASSIGN:
5355 /* ??? The standard seems to be missing the "or array of such a class
5356 type" wording for this trait. */
5357 type1 = strip_array_types (type1);
5358 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5359 && (trivial_type_p (type1)
5360 || (CLASS_TYPE_P (type1)
5361 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1))));
5363 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5364 type1 = strip_array_types (type1);
5365 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
5366 || (CLASS_TYPE_P (type1)
5367 && (t = locate_ctor (type1))
5368 && TYPE_NOTHROW_P (TREE_TYPE (t))));
5370 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5371 type1 = strip_array_types (type1);
5372 return (trivial_type_p (type1)
5373 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
5375 case CPTK_HAS_NOTHROW_COPY:
5376 type1 = strip_array_types (type1);
5377 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
5378 || (CLASS_TYPE_P (type1)
5379 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
5381 case CPTK_HAS_TRIVIAL_COPY:
5382 /* ??? The standard seems to be missing the "or array of such a class
5383 type" wording for this trait. */
5384 type1 = strip_array_types (type1);
5385 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5386 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1)));
5388 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5389 type1 = strip_array_types (type1);
5390 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5391 || (CLASS_TYPE_P (type1)
5392 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
5394 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5395 return type_has_virtual_destructor (type1);
5397 case CPTK_IS_ABSTRACT:
5398 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
5400 case CPTK_IS_BASE_OF:
5401 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5402 && DERIVED_FROM_P (type1, type2));
5405 return (NON_UNION_CLASS_TYPE_P (type1));
5407 case CPTK_IS_CONVERTIBLE_TO:
5412 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
5415 return (type_code1 == ENUMERAL_TYPE);
5417 case CPTK_IS_LITERAL_TYPE:
5418 return (literal_type_p (type1));
5421 return (pod_type_p (type1));
5423 case CPTK_IS_POLYMORPHIC:
5424 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
5426 case CPTK_IS_STD_LAYOUT:
5427 return (std_layout_type_p (type1));
5429 case CPTK_IS_TRIVIAL:
5430 return (trivial_type_p (type1));
5433 return (type_code1 == UNION_TYPE);
5441 /* If TYPE is an array of unknown bound, or (possibly cv-qualified)
5442 void, or a complete type, returns it, otherwise NULL_TREE. */
5445 check_trait_type (tree type)
5447 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type)
5448 && COMPLETE_TYPE_P (TREE_TYPE (type)))
5451 if (VOID_TYPE_P (type))
5454 return complete_type_or_else (strip_array_types (type), NULL_TREE);
5457 /* Process a trait expression. */
5460 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
5462 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
5463 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
5464 || kind == CPTK_HAS_NOTHROW_COPY
5465 || kind == CPTK_HAS_TRIVIAL_ASSIGN
5466 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
5467 || kind == CPTK_HAS_TRIVIAL_COPY
5468 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
5469 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
5470 || kind == CPTK_IS_ABSTRACT
5471 || kind == CPTK_IS_BASE_OF
5472 || kind == CPTK_IS_CLASS
5473 || kind == CPTK_IS_CONVERTIBLE_TO
5474 || kind == CPTK_IS_EMPTY
5475 || kind == CPTK_IS_ENUM
5476 || kind == CPTK_IS_LITERAL_TYPE
5477 || kind == CPTK_IS_POD
5478 || kind == CPTK_IS_POLYMORPHIC
5479 || kind == CPTK_IS_STD_LAYOUT
5480 || kind == CPTK_IS_TRIVIAL
5481 || kind == CPTK_IS_UNION);
5483 if (kind == CPTK_IS_CONVERTIBLE_TO)
5485 sorry ("__is_convertible_to");
5486 return error_mark_node;
5489 if (type1 == error_mark_node
5490 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
5491 && type2 == error_mark_node))
5492 return error_mark_node;
5494 if (processing_template_decl)
5496 tree trait_expr = make_node (TRAIT_EXPR);
5497 TREE_TYPE (trait_expr) = boolean_type_node;
5498 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
5499 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
5500 TRAIT_EXPR_KIND (trait_expr) = kind;
5506 case CPTK_HAS_NOTHROW_ASSIGN:
5507 case CPTK_HAS_TRIVIAL_ASSIGN:
5508 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5509 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5510 case CPTK_HAS_NOTHROW_COPY:
5511 case CPTK_HAS_TRIVIAL_COPY:
5512 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5513 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5514 case CPTK_IS_ABSTRACT:
5516 case CPTK_IS_LITERAL_TYPE:
5518 case CPTK_IS_POLYMORPHIC:
5519 case CPTK_IS_STD_LAYOUT:
5520 case CPTK_IS_TRIVIAL:
5521 if (!check_trait_type (type1))
5522 return error_mark_node;
5525 case CPTK_IS_BASE_OF:
5526 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5527 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5528 && !complete_type_or_else (type2, NULL_TREE))
5529 /* We already issued an error. */
5530 return error_mark_node;
5538 case CPTK_IS_CONVERTIBLE_TO:
5543 return (trait_expr_value (kind, type1, type2)
5544 ? boolean_true_node : boolean_false_node);
5547 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5548 which is ignored for C++. */
5551 set_float_const_decimal64 (void)
5556 clear_float_const_decimal64 (void)
5561 float_const_decimal64_p (void)
5567 /* Return true if T is a literal type. */
5570 literal_type_p (tree t)
5572 if (SCALAR_TYPE_P (t)
5573 || TREE_CODE (t) == REFERENCE_TYPE)
5575 if (CLASS_TYPE_P (t))
5577 t = complete_type (t);
5578 gcc_assert (COMPLETE_TYPE_P (t) || errorcount);
5579 return CLASSTYPE_LITERAL_P (t);
5581 if (TREE_CODE (t) == ARRAY_TYPE)
5582 return literal_type_p (strip_array_types (t));
5586 /* If DECL is a variable declared `constexpr', require its type
5587 be literal. Return the DECL if OK, otherwise NULL. */
5590 ensure_literal_type_for_constexpr_object (tree decl)
5592 tree type = TREE_TYPE (decl);
5593 if (TREE_CODE (decl) == VAR_DECL && DECL_DECLARED_CONSTEXPR_P (decl)
5594 && !processing_template_decl)
5596 if (CLASS_TYPE_P (type) && !COMPLETE_TYPE_P (complete_type (type)))
5597 /* Don't complain here, we'll complain about incompleteness
5598 when we try to initialize the variable. */;
5599 else if (!literal_type_p (type))
5601 error ("the type %qT of constexpr variable %qD is not literal",
5603 explain_non_literal_class (type);
5610 /* Representation of entries in the constexpr function definition table. */
5612 typedef struct GTY(()) constexpr_fundef {
5617 /* This table holds all constexpr function definitions seen in
5618 the current translation unit. */
5620 static GTY ((param_is (constexpr_fundef))) htab_t constexpr_fundef_table;
5622 /* Utility function used for managing the constexpr function table.
5623 Return true if the entries pointed to by P and Q are for the
5624 same constexpr function. */
5627 constexpr_fundef_equal (const void *p, const void *q)
5629 const constexpr_fundef *lhs = (const constexpr_fundef *) p;
5630 const constexpr_fundef *rhs = (const constexpr_fundef *) q;
5631 return lhs->decl == rhs->decl;
5634 /* Utility function used for managing the constexpr function table.
5635 Return a hash value for the entry pointed to by Q. */
5637 static inline hashval_t
5638 constexpr_fundef_hash (const void *p)
5640 const constexpr_fundef *fundef = (const constexpr_fundef *) p;
5641 return DECL_UID (fundef->decl);
5644 /* Return a previously saved definition of function FUN. */
5646 static constexpr_fundef *
5647 retrieve_constexpr_fundef (tree fun)
5649 constexpr_fundef fundef = { NULL, NULL };
5650 if (constexpr_fundef_table == NULL)
5654 return (constexpr_fundef *) htab_find (constexpr_fundef_table, &fundef);
5657 /* Check whether the parameter and return types of FUN are valid for a
5658 constexpr function, and complain if COMPLAIN. */
5661 is_valid_constexpr_fn (tree fun, bool complain)
5663 tree parm = FUNCTION_FIRST_USER_PARM (fun);
5665 for (; parm != NULL; parm = TREE_CHAIN (parm))
5666 if (!literal_type_p (TREE_TYPE (parm)))
5671 error ("invalid type for parameter %d of constexpr "
5672 "function %q+#D", DECL_PARM_INDEX (parm), fun);
5673 explain_non_literal_class (TREE_TYPE (parm));
5677 if (!DECL_CONSTRUCTOR_P (fun))
5679 tree rettype = TREE_TYPE (TREE_TYPE (fun));
5680 if (!literal_type_p (rettype))
5685 error ("invalid return type %qT of constexpr function %q+D",
5687 explain_non_literal_class (rettype);
5691 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun)
5692 && !CLASSTYPE_LITERAL_P (DECL_CONTEXT (fun)))
5697 error ("enclosing class of constexpr non-static member "
5698 "function %q+#D is not a literal type", fun);
5699 explain_non_literal_class (DECL_CONTEXT (fun));
5707 /* Subroutine of build_constexpr_constructor_member_initializers.
5708 The expression tree T represents a data member initialization
5709 in a (constexpr) constructor definition. Build a pairing of
5710 the data member with its initializer, and prepend that pair
5711 to the existing initialization pair INITS. */
5714 build_data_member_initialization (tree t, VEC(constructor_elt,gc) **vec)
5717 if (TREE_CODE (t) == CLEANUP_POINT_EXPR)
5718 t = TREE_OPERAND (t, 0);
5719 if (TREE_CODE (t) == EXPR_STMT)
5720 t = TREE_OPERAND (t, 0);
5721 if (t == error_mark_node)
5723 if (TREE_CODE (t) == STATEMENT_LIST)
5725 tree_stmt_iterator i;
5726 for (i = tsi_start (t); !tsi_end_p (i); tsi_next (&i))
5728 if (! build_data_member_initialization (tsi_stmt (i), vec))
5733 if (TREE_CODE (t) == CLEANUP_STMT)
5735 /* We can't see a CLEANUP_STMT in a constructor for a literal class,
5736 but we can in a constexpr constructor for a non-literal class. Just
5737 ignore it; either all the initialization will be constant, in which
5738 case the cleanup can't run, or it can't be constexpr.
5739 Still recurse into CLEANUP_BODY. */
5740 return build_data_member_initialization (CLEANUP_BODY (t), vec);
5742 if (TREE_CODE (t) == CONVERT_EXPR)
5743 t = TREE_OPERAND (t, 0);
5744 if (TREE_CODE (t) == INIT_EXPR
5745 || TREE_CODE (t) == MODIFY_EXPR)
5747 member = TREE_OPERAND (t, 0);
5748 init = unshare_expr (TREE_OPERAND (t, 1));
5752 gcc_assert (TREE_CODE (t) == CALL_EXPR);
5753 member = CALL_EXPR_ARG (t, 0);
5754 /* We don't use build_cplus_new here because it complains about
5755 abstract bases. Leaving the call unwrapped means that it has the
5756 wrong type, but cxx_eval_constant_expression doesn't care. */
5757 init = unshare_expr (t);
5759 if (TREE_CODE (member) == INDIRECT_REF)
5760 member = TREE_OPERAND (member, 0);
5761 if (TREE_CODE (member) == NOP_EXPR)
5765 if (TREE_CODE (op) == ADDR_EXPR)
5767 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5768 (TREE_TYPE (TREE_TYPE (op)),
5769 TREE_TYPE (TREE_TYPE (member))));
5770 /* Initializing a cv-qualified member; we need to look through
5776 /* We don't put out anything for an empty base. */
5777 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (member))));
5778 /* But if the initializer isn't constexpr, leave it in so we
5780 if (potential_constant_expression (init))
5784 if (TREE_CODE (member) == ADDR_EXPR)
5785 member = TREE_OPERAND (member, 0);
5786 if (TREE_CODE (member) == COMPONENT_REF
5787 /* If we're initializing a member of a subaggregate, it's a vtable
5788 pointer. Leave it as COMPONENT_REF so we remember the path to get
5790 && TREE_CODE (TREE_OPERAND (member, 0)) != COMPONENT_REF)
5791 member = TREE_OPERAND (member, 1);
5792 CONSTRUCTOR_APPEND_ELT (*vec, member, init);
5796 /* Make sure that there are no statements after LAST in the constructor
5797 body represented by LIST. */
5800 check_constexpr_ctor_body (tree last, tree list)
5803 if (TREE_CODE (list) == STATEMENT_LIST)
5805 tree_stmt_iterator i = tsi_last (list);
5806 for (; !tsi_end_p (i); tsi_prev (&i))
5808 tree t = tsi_stmt (i);
5811 if (TREE_CODE (t) == BIND_EXPR)
5813 if (!check_constexpr_ctor_body (last, BIND_EXPR_BODY (t)))
5818 /* We currently allow typedefs and static_assert.
5819 FIXME allow them in the standard, too. */
5820 if (TREE_CODE (t) != STATIC_ASSERT)
5827 else if (list != last
5828 && TREE_CODE (list) != STATIC_ASSERT)
5832 error ("constexpr constructor does not have empty body");
5833 DECL_DECLARED_CONSTEXPR_P (current_function_decl) = false;
5838 /* Build compile-time evalable representations of member-initializer list
5839 for a constexpr constructor. */
5842 build_constexpr_constructor_member_initializers (tree type, tree body)
5844 VEC(constructor_elt,gc) *vec = NULL;
5846 if (TREE_CODE (body) == MUST_NOT_THROW_EXPR
5847 || TREE_CODE (body) == EH_SPEC_BLOCK)
5848 body = TREE_OPERAND (body, 0);
5849 if (TREE_CODE (body) == STATEMENT_LIST)
5850 body = STATEMENT_LIST_HEAD (body)->stmt;
5851 body = BIND_EXPR_BODY (body);
5852 if (TREE_CODE (body) == CLEANUP_POINT_EXPR)
5854 body = TREE_OPERAND (body, 0);
5855 if (TREE_CODE (body) == EXPR_STMT)
5856 body = TREE_OPERAND (body, 0);
5857 if (TREE_CODE (body) == INIT_EXPR
5858 && (same_type_ignoring_top_level_qualifiers_p
5859 (TREE_TYPE (TREE_OPERAND (body, 0)),
5860 current_class_type)))
5863 return TREE_OPERAND (body, 1);
5865 ok = build_data_member_initialization (body, &vec);
5867 else if (TREE_CODE (body) == STATEMENT_LIST)
5869 tree_stmt_iterator i;
5870 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
5872 ok = build_data_member_initialization (tsi_stmt (i), &vec);
5878 gcc_assert (errorcount > 0);
5880 return build_constructor (type, vec);
5882 return error_mark_node;
5885 /* Subroutine of register_constexpr_fundef. BODY is the body of a function
5886 declared to be constexpr, or a sub-statement thereof. Returns the
5887 return value if suitable, error_mark_node for a statement not allowed in
5888 a constexpr function, or NULL_TREE if no return value was found. */
5891 constexpr_fn_retval (tree body)
5893 switch (TREE_CODE (body))
5895 case STATEMENT_LIST:
5897 tree_stmt_iterator i;
5898 tree expr = NULL_TREE;
5899 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
5901 tree s = constexpr_fn_retval (tsi_stmt (i));
5902 if (s == error_mark_node)
5903 return error_mark_node;
5904 else if (s == NULL_TREE)
5905 /* Keep iterating. */;
5907 /* Multiple return statements. */
5908 return error_mark_node;
5916 return unshare_expr (TREE_OPERAND (body, 0));
5919 if (TREE_CODE (DECL_EXPR_DECL (body)) == USING_DECL)
5921 return error_mark_node;
5923 case CLEANUP_POINT_EXPR:
5924 return constexpr_fn_retval (TREE_OPERAND (body, 0));
5930 return error_mark_node;
5934 /* Subroutine of register_constexpr_fundef. BODY is the DECL_SAVED_TREE of
5935 FUN; do the necessary transformations to turn it into a single expression
5936 that we can store in the hash table. */
5939 massage_constexpr_body (tree fun, tree body)
5941 if (DECL_CONSTRUCTOR_P (fun))
5942 body = build_constexpr_constructor_member_initializers
5943 (DECL_CONTEXT (fun), body);
5946 if (TREE_CODE (body) == BIND_EXPR)
5947 body = BIND_EXPR_BODY (body);
5948 if (TREE_CODE (body) == EH_SPEC_BLOCK)
5949 body = EH_SPEC_STMTS (body);
5950 if (TREE_CODE (body) == MUST_NOT_THROW_EXPR)
5951 body = TREE_OPERAND (body, 0);
5952 body = constexpr_fn_retval (body);
5957 /* FUN is a constexpr constructor with massaged body BODY. Return true
5958 if some bases/fields are uninitialized, and complain if COMPLAIN. */
5961 cx_check_missing_mem_inits (tree fun, tree body, bool complain)
5967 if (TREE_CODE (body) != CONSTRUCTOR)
5971 nelts = CONSTRUCTOR_NELTS (body);
5972 field = TYPE_FIELDS (DECL_CONTEXT (fun));
5973 for (i = 0; i <= nelts; ++i)
5980 index = CONSTRUCTOR_ELT (body, i)->index;
5981 /* Skip base and vtable inits. */
5982 if (TREE_CODE (index) != FIELD_DECL)
5985 for (; field != index; field = DECL_CHAIN (field))
5988 if (TREE_CODE (field) != FIELD_DECL
5989 || (DECL_C_BIT_FIELD (field) && !DECL_NAME (field)))
5993 ftype = strip_array_types (TREE_TYPE (field));
5994 if (type_has_constexpr_default_constructor (ftype))
5996 /* It's OK to skip a member with a trivial constexpr ctor.
5997 A constexpr ctor that isn't trivial should have been
5999 gcc_checking_assert (!TYPE_HAS_COMPLEX_DFLT (ftype));
6002 error ("uninitialized member %qD in %<constexpr%> constructor",
6006 if (field == NULL_TREE)
6008 field = DECL_CHAIN (field);
6014 /* We are processing the definition of the constexpr function FUN.
6015 Check that its BODY fulfills the propriate requirements and
6016 enter it in the constexpr function definition table.
6017 For constructor BODY is actually the TREE_LIST of the
6018 member-initializer list. */
6021 register_constexpr_fundef (tree fun, tree body)
6023 constexpr_fundef entry;
6024 constexpr_fundef **slot;
6026 if (!is_valid_constexpr_fn (fun, !DECL_GENERATED_P (fun)))
6029 body = massage_constexpr_body (fun, body);
6030 if (body == NULL_TREE || body == error_mark_node)
6032 if (!DECL_CONSTRUCTOR_P (fun))
6033 error ("body of constexpr function %qD not a return-statement", fun);
6037 if (!potential_rvalue_constant_expression (body))
6039 if (!DECL_GENERATED_P (fun))
6040 require_potential_rvalue_constant_expression (body);
6044 if (DECL_CONSTRUCTOR_P (fun)
6045 && cx_check_missing_mem_inits (fun, body, !DECL_GENERATED_P (fun)))
6048 /* Create the constexpr function table if necessary. */
6049 if (constexpr_fundef_table == NULL)
6050 constexpr_fundef_table = htab_create_ggc (101,
6051 constexpr_fundef_hash,
6052 constexpr_fundef_equal,
6056 slot = (constexpr_fundef **)
6057 htab_find_slot (constexpr_fundef_table, &entry, INSERT);
6059 gcc_assert (*slot == NULL);
6060 *slot = ggc_alloc_constexpr_fundef ();
6066 /* FUN is a non-constexpr function called in a context that requires a
6067 constant expression. If it comes from a constexpr template, explain why
6068 the instantiation isn't constexpr. */
6071 explain_invalid_constexpr_fn (tree fun)
6073 static struct pointer_set_t *diagnosed;
6075 location_t save_loc;
6076 /* Only diagnose defaulted functions or instantiations. */
6077 if (!DECL_DEFAULTED_FN (fun)
6078 && !is_instantiation_of_constexpr (fun))
6080 if (diagnosed == NULL)
6081 diagnosed = pointer_set_create ();
6082 if (pointer_set_insert (diagnosed, fun) != 0)
6083 /* Already explained. */
6086 save_loc = input_location;
6087 input_location = DECL_SOURCE_LOCATION (fun);
6088 inform (0, "%q+D is not usable as a constexpr function because:", fun);
6089 /* First check the declaration. */
6090 if (is_valid_constexpr_fn (fun, true))
6092 /* Then if it's OK, the body. */
6093 if (DECL_DEFAULTED_FN (fun))
6094 explain_implicit_non_constexpr (fun);
6097 body = massage_constexpr_body (fun, DECL_SAVED_TREE (fun));
6098 require_potential_rvalue_constant_expression (body);
6099 if (DECL_CONSTRUCTOR_P (fun))
6100 cx_check_missing_mem_inits (fun, body, true);
6103 input_location = save_loc;
6106 /* Objects of this type represent calls to constexpr functions
6107 along with the bindings of parameters to their arguments, for
6108 the purpose of compile time evaluation. */
6110 typedef struct GTY(()) constexpr_call {
6111 /* Description of the constexpr function definition. */
6112 constexpr_fundef *fundef;
6113 /* Parameter bindings enironment. A TREE_LIST where each TREE_PURPOSE
6114 is a parameter _DECL and the TREE_VALUE is the value of the parameter.
6115 Note: This arrangement is made to accomodate the use of
6116 iterative_hash_template_arg (see pt.c). If you change this
6117 representation, also change the hash calculation in
6118 cxx_eval_call_expression. */
6120 /* Result of the call.
6121 NULL means the call is being evaluated.
6122 error_mark_node means that the evaluation was erroneous;
6123 otherwise, the actuall value of the call. */
6125 /* The hash of this call; we remember it here to avoid having to
6126 recalculate it when expanding the hash table. */
6130 /* A table of all constexpr calls that have been evaluated by the
6131 compiler in this translation unit. */
6133 static GTY ((param_is (constexpr_call))) htab_t constexpr_call_table;
6135 static tree cxx_eval_constant_expression (const constexpr_call *, tree,
6136 bool, bool, bool *);
6138 /* Compute a hash value for a constexpr call representation. */
6141 constexpr_call_hash (const void *p)
6143 const constexpr_call *info = (const constexpr_call *) p;
6147 /* Return 1 if the objects pointed to by P and Q represent calls
6148 to the same constexpr function with the same arguments.
6149 Otherwise, return 0. */
6152 constexpr_call_equal (const void *p, const void *q)
6154 const constexpr_call *lhs = (const constexpr_call *) p;
6155 const constexpr_call *rhs = (const constexpr_call *) q;
6160 if (!constexpr_fundef_equal (lhs->fundef, rhs->fundef))
6162 lhs_bindings = lhs->bindings;
6163 rhs_bindings = rhs->bindings;
6164 while (lhs_bindings != NULL && rhs_bindings != NULL)
6166 tree lhs_arg = TREE_VALUE (lhs_bindings);
6167 tree rhs_arg = TREE_VALUE (rhs_bindings);
6168 gcc_assert (TREE_TYPE (lhs_arg) == TREE_TYPE (rhs_arg));
6169 if (!cp_tree_equal (lhs_arg, rhs_arg))
6171 lhs_bindings = TREE_CHAIN (lhs_bindings);
6172 rhs_bindings = TREE_CHAIN (rhs_bindings);
6174 return lhs_bindings == rhs_bindings;
6177 /* Initialize the constexpr call table, if needed. */
6180 maybe_initialize_constexpr_call_table (void)
6182 if (constexpr_call_table == NULL)
6183 constexpr_call_table = htab_create_ggc (101,
6184 constexpr_call_hash,
6185 constexpr_call_equal,
6189 /* Return true if T designates the implied `this' parameter. */
6192 is_this_parameter (tree t)
6194 return t == current_class_ptr;
6197 /* We have an expression tree T that represents a call, either CALL_EXPR
6198 or AGGR_INIT_EXPR. If the call is lexically to a named function,
6199 retrun the _DECL for that function. */
6202 get_function_named_in_call (tree t)
6205 switch (TREE_CODE (t))
6208 fun = CALL_EXPR_FN (t);
6211 case AGGR_INIT_EXPR:
6212 fun = AGGR_INIT_EXPR_FN (t);
6219 if (TREE_CODE (fun) == ADDR_EXPR
6220 && TREE_CODE (TREE_OPERAND (fun, 0)) == FUNCTION_DECL)
6221 fun = TREE_OPERAND (fun, 0);
6225 /* We have an expression tree T that represents a call, either CALL_EXPR
6226 or AGGR_INIT_EXPR. Return the Nth argument. */
6229 get_nth_callarg (tree t, int n)
6231 switch (TREE_CODE (t))
6234 return CALL_EXPR_ARG (t, n);
6236 case AGGR_INIT_EXPR:
6237 return AGGR_INIT_EXPR_ARG (t, n);
6245 /* Look up the binding of the function parameter T in a constexpr
6246 function call context CALL. */
6249 lookup_parameter_binding (const constexpr_call *call, tree t)
6251 tree b = purpose_member (t, call->bindings);
6252 return TREE_VALUE (b);
6255 /* Attempt to evaluate T which represents a call to a builtin function.
6256 We assume here that all builtin functions evaluate to scalar types
6257 represented by _CST nodes. */
6260 cxx_eval_builtin_function_call (const constexpr_call *call, tree t,
6261 bool allow_non_constant, bool addr,
6262 bool *non_constant_p)
6264 const int nargs = call_expr_nargs (t);
6265 tree *args = (tree *) alloca (nargs * sizeof (tree));
6268 for (i = 0; i < nargs; ++i)
6270 args[i] = cxx_eval_constant_expression (call, CALL_EXPR_ARG (t, i),
6271 allow_non_constant, addr,
6273 if (allow_non_constant && *non_constant_p)
6276 if (*non_constant_p)
6278 new_call = build_call_array_loc (EXPR_LOCATION (t), TREE_TYPE (t),
6279 CALL_EXPR_FN (t), nargs, args);
6280 return fold (new_call);
6283 /* TEMP is the constant value of a temporary object of type TYPE. Adjust
6284 the type of the value to match. */
6287 adjust_temp_type (tree type, tree temp)
6289 if (TREE_TYPE (temp) == type)
6291 /* Avoid wrapping an aggregate value in a NOP_EXPR. */
6292 if (TREE_CODE (temp) == CONSTRUCTOR)
6293 return build_constructor (type, CONSTRUCTOR_ELTS (temp));
6294 gcc_assert (SCALAR_TYPE_P (type));
6295 return cp_fold_convert (type, temp);
6298 /* Subroutine of cxx_eval_call_expression.
6299 We are processing a call expression (either CALL_EXPR or
6300 AGGR_INIT_EXPR) in the call context of OLD_CALL. Evaluate
6301 all arguments and bind their values to correspondings
6302 parameters, making up the NEW_CALL context. */
6305 cxx_bind_parameters_in_call (const constexpr_call *old_call, tree t,
6306 constexpr_call *new_call,
6307 bool allow_non_constant,
6308 bool *non_constant_p)
6310 const int nargs = call_expr_nargs (t);
6311 tree fun = new_call->fundef->decl;
6312 tree parms = DECL_ARGUMENTS (fun);
6314 for (i = 0; i < nargs; ++i)
6317 tree type = parms ? TREE_TYPE (parms) : void_type_node;
6318 /* For member function, the first argument is a pointer to the implied
6319 object. And for an object contruction, don't bind `this' before
6320 it is fully constructed. */
6321 if (i == 0 && DECL_CONSTRUCTOR_P (fun))
6323 x = get_nth_callarg (t, i);
6324 arg = cxx_eval_constant_expression (old_call, x, allow_non_constant,
6325 TREE_CODE (type) == REFERENCE_TYPE,
6327 /* Don't VERIFY_CONSTANT here. */
6328 if (*non_constant_p && allow_non_constant)
6330 /* Just discard ellipsis args after checking their constantitude. */
6333 if (*non_constant_p)
6334 /* Don't try to adjust the type of non-constant args. */
6337 /* Make sure the binding has the same type as the parm. */
6338 if (TREE_CODE (type) != REFERENCE_TYPE)
6339 arg = adjust_temp_type (type, arg);
6340 new_call->bindings = tree_cons (parms, arg, new_call->bindings);
6342 parms = TREE_CHAIN (parms);
6346 /* Variables and functions to manage constexpr call expansion context.
6347 These do not need to be marked for PCH or GC. */
6349 /* FIXME remember and print actual constant arguments. */
6350 static VEC(tree,heap) *call_stack = NULL;
6351 static int call_stack_tick;
6352 static int last_cx_error_tick;
6355 push_cx_call_context (tree call)
6358 if (!EXPR_HAS_LOCATION (call))
6359 SET_EXPR_LOCATION (call, input_location);
6360 VEC_safe_push (tree, heap, call_stack, call);
6361 if (VEC_length (tree, call_stack) > (unsigned) max_constexpr_depth)
6367 pop_cx_call_context (void)
6370 VEC_pop (tree, call_stack);
6374 cx_error_context (void)
6376 VEC(tree,heap) *r = NULL;
6377 if (call_stack_tick != last_cx_error_tick
6378 && !VEC_empty (tree, call_stack))
6380 last_cx_error_tick = call_stack_tick;
6384 /* Subroutine of cxx_eval_constant_expression.
6385 Evaluate the call expression tree T in the context of OLD_CALL expression
6389 cxx_eval_call_expression (const constexpr_call *old_call, tree t,
6390 bool allow_non_constant, bool addr,
6391 bool *non_constant_p)
6393 location_t loc = EXPR_LOC_OR_HERE (t);
6394 tree fun = get_function_named_in_call (t);
6396 constexpr_call new_call = { NULL, NULL, NULL, 0 };
6397 constexpr_call **slot;
6398 constexpr_call *entry;
6401 if (TREE_CODE (fun) != FUNCTION_DECL)
6403 /* Might be a constexpr function pointer. */
6404 fun = cxx_eval_constant_expression (old_call, fun, allow_non_constant,
6405 /*addr*/false, non_constant_p);
6406 if (TREE_CODE (fun) == ADDR_EXPR)
6407 fun = TREE_OPERAND (fun, 0);
6409 if (TREE_CODE (fun) != FUNCTION_DECL)
6411 if (!allow_non_constant && !*non_constant_p)
6412 error_at (loc, "expression %qE does not designate a constexpr "
6414 *non_constant_p = true;
6417 if (DECL_CLONED_FUNCTION_P (fun))
6418 fun = DECL_CLONED_FUNCTION (fun);
6419 if (is_builtin_fn (fun))
6420 return cxx_eval_builtin_function_call (old_call, t, allow_non_constant,
6421 addr, non_constant_p);
6422 if (!DECL_DECLARED_CONSTEXPR_P (fun))
6424 if (!allow_non_constant)
6426 error_at (loc, "call to non-constexpr function %qD", fun);
6427 explain_invalid_constexpr_fn (fun);
6429 *non_constant_p = true;
6433 /* Shortcut trivial copy constructor/op=. */
6434 if (call_expr_nargs (t) == 2 && trivial_fn_p (fun))
6436 tree arg = convert_from_reference (get_nth_callarg (t, 1));
6437 return cxx_eval_constant_expression (old_call, arg, allow_non_constant,
6438 addr, non_constant_p);
6441 /* If in direct recursive call, optimize definition search. */
6442 if (old_call != NULL && old_call->fundef->decl == fun)
6443 new_call.fundef = old_call->fundef;
6446 new_call.fundef = retrieve_constexpr_fundef (fun);
6447 if (new_call.fundef == NULL || new_call.fundef->body == NULL)
6449 if (!allow_non_constant)
6451 if (DECL_INITIAL (fun))
6453 /* The definition of fun was somehow unsuitable. */
6454 error_at (loc, "%qD called in a constant expression", fun);
6455 explain_invalid_constexpr_fn (fun);
6458 error_at (loc, "%qD used before its definition", fun);
6460 *non_constant_p = true;
6464 cxx_bind_parameters_in_call (old_call, t, &new_call,
6465 allow_non_constant, non_constant_p);
6466 if (*non_constant_p)
6469 depth_ok = push_cx_call_context (t);
6472 = iterative_hash_template_arg (new_call.bindings,
6473 constexpr_fundef_hash (new_call.fundef));
6475 /* If we have seen this call before, we are done. */
6476 maybe_initialize_constexpr_call_table ();
6477 slot = (constexpr_call **)
6478 htab_find_slot (constexpr_call_table, &new_call, INSERT);
6482 /* We need to keep a pointer to the entry, not just the slot, as the
6483 slot can move in the call to cxx_eval_builtin_function_call. */
6484 *slot = entry = ggc_alloc_constexpr_call ();
6487 /* Calls which are in progress have their result set to NULL
6488 so that we can detect circular dependencies. */
6489 else if (entry->result == NULL)
6491 if (!allow_non_constant)
6492 error ("call has circular dependency");
6493 *non_constant_p = true;
6494 entry->result = result = error_mark_node;
6499 if (!allow_non_constant)
6500 error ("constexpr evaluation depth exceeds maximum of %d (use "
6501 "-fconstexpr-depth= to increase the maximum)",
6502 max_constexpr_depth);
6503 *non_constant_p = true;
6504 entry->result = result = error_mark_node;
6508 result = entry->result;
6509 if (!result || (result == error_mark_node && !allow_non_constant))
6510 result = (cxx_eval_constant_expression
6511 (&new_call, new_call.fundef->body,
6512 allow_non_constant, addr,
6514 if (result == error_mark_node)
6515 *non_constant_p = true;
6516 if (*non_constant_p)
6517 entry->result = result = error_mark_node;
6520 /* If this was a call to initialize an object, set the type of
6521 the CONSTRUCTOR to the type of that object. */
6522 if (DECL_CONSTRUCTOR_P (fun))
6524 tree ob_arg = get_nth_callarg (t, 0);
6525 STRIP_NOPS (ob_arg);
6526 gcc_assert (TREE_CODE (TREE_TYPE (ob_arg)) == POINTER_TYPE
6527 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (ob_arg))));
6528 result = adjust_temp_type (TREE_TYPE (TREE_TYPE (ob_arg)),
6531 entry->result = result;
6535 pop_cx_call_context ();
6536 return unshare_expr (result);
6539 /* FIXME speed this up, it's taking 16% of compile time on sieve testcase. */
6542 reduced_constant_expression_p (tree t)
6544 if (TREE_OVERFLOW_P (t))
6545 /* Integer overflow makes this not a constant expression. */
6547 /* FIXME are we calling this too much? */
6548 return initializer_constant_valid_p (t, TREE_TYPE (t)) != NULL_TREE;
6551 /* Some expressions may have constant operands but are not constant
6552 themselves, such as 1/0. Call this function (or rather, the macro
6553 following it) to check for that condition.
6555 We only call this in places that require an arithmetic constant, not in
6556 places where we might have a non-constant expression that can be a
6557 component of a constant expression, such as the address of a constexpr
6558 variable that might be dereferenced later. */
6561 verify_constant (tree t, bool allow_non_constant, bool *non_constant_p)
6563 if (!*non_constant_p && !reduced_constant_expression_p (t))
6565 if (!allow_non_constant)
6567 /* If T was already folded to a _CST with TREE_OVERFLOW set,
6568 printing the folded constant isn't helpful. */
6569 if (TREE_OVERFLOW_P (t))
6571 permerror (input_location, "overflow in constant expression");
6572 /* If we're being permissive (and are in an enforcing
6573 context), consider this constant. */
6574 if (flag_permissive)
6578 error ("%q+E is not a constant expression", t);
6580 *non_constant_p = true;
6582 return *non_constant_p;
6584 #define VERIFY_CONSTANT(X) \
6586 if (verify_constant ((X), allow_non_constant, non_constant_p)) \
6590 /* Subroutine of cxx_eval_constant_expression.
6591 Attempt to reduce the unary expression tree T to a compile time value.
6592 If successful, return the value. Otherwise issue a diagnostic
6593 and return error_mark_node. */
6596 cxx_eval_unary_expression (const constexpr_call *call, tree t,
6597 bool allow_non_constant, bool addr,
6598 bool *non_constant_p)
6601 tree orig_arg = TREE_OPERAND (t, 0);
6602 tree arg = cxx_eval_constant_expression (call, orig_arg, allow_non_constant,
6603 addr, non_constant_p);
6604 VERIFY_CONSTANT (arg);
6605 if (arg == orig_arg)
6607 r = fold_build1 (TREE_CODE (t), TREE_TYPE (t), arg);
6608 VERIFY_CONSTANT (r);
6612 /* Subroutine of cxx_eval_constant_expression.
6613 Like cxx_eval_unary_expression, except for binary expressions. */
6616 cxx_eval_binary_expression (const constexpr_call *call, tree t,
6617 bool allow_non_constant, bool addr,
6618 bool *non_constant_p)
6621 tree orig_lhs = TREE_OPERAND (t, 0);
6622 tree orig_rhs = TREE_OPERAND (t, 1);
6624 lhs = cxx_eval_constant_expression (call, orig_lhs,
6625 allow_non_constant, addr,
6627 VERIFY_CONSTANT (lhs);
6628 rhs = cxx_eval_constant_expression (call, orig_rhs,
6629 allow_non_constant, addr,
6631 VERIFY_CONSTANT (rhs);
6632 if (lhs == orig_lhs && rhs == orig_rhs)
6634 r = fold_build2 (TREE_CODE (t), TREE_TYPE (t), lhs, rhs);
6635 VERIFY_CONSTANT (r);
6639 /* Subroutine of cxx_eval_constant_expression.
6640 Attempt to evaluate condition expressions. Dead branches are not
6644 cxx_eval_conditional_expression (const constexpr_call *call, tree t,
6645 bool allow_non_constant, bool addr,
6646 bool *non_constant_p)
6648 tree val = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
6649 allow_non_constant, addr,
6651 VERIFY_CONSTANT (val);
6652 /* Don't VERIFY_CONSTANT the other operands. */
6653 if (integer_zerop (val))
6654 return cxx_eval_constant_expression (call, TREE_OPERAND (t, 2),
6655 allow_non_constant, addr,
6657 return cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
6658 allow_non_constant, addr,
6662 /* Subroutine of cxx_eval_constant_expression.
6663 Attempt to reduce a reference to an array slot. */
6666 cxx_eval_array_reference (const constexpr_call *call, tree t,
6667 bool allow_non_constant, bool addr,
6668 bool *non_constant_p)
6670 tree oldary = TREE_OPERAND (t, 0);
6671 tree ary = cxx_eval_constant_expression (call, oldary,
6672 allow_non_constant, addr,
6677 unsigned len, elem_nchars = 1;
6678 if (*non_constant_p)
6680 oldidx = TREE_OPERAND (t, 1);
6681 index = cxx_eval_constant_expression (call, oldidx,
6682 allow_non_constant, false,
6684 VERIFY_CONSTANT (index);
6685 if (addr && ary == oldary && index == oldidx)
6688 return build4 (ARRAY_REF, TREE_TYPE (t), ary, index, NULL, NULL);
6689 elem_type = TREE_TYPE (TREE_TYPE (ary));
6690 if (TREE_CODE (ary) == CONSTRUCTOR)
6691 len = CONSTRUCTOR_NELTS (ary);
6692 else if (TREE_CODE (ary) == STRING_CST)
6694 elem_nchars = (TYPE_PRECISION (elem_type)
6695 / TYPE_PRECISION (char_type_node));
6696 len = (unsigned) TREE_STRING_LENGTH (ary) / elem_nchars;
6700 /* We can't do anything with other tree codes, so use
6701 VERIFY_CONSTANT to complain and fail. */
6702 VERIFY_CONSTANT (ary);
6705 if (compare_tree_int (index, len) >= 0)
6707 if (tree_int_cst_lt (index, array_type_nelts_top (TREE_TYPE (ary))))
6709 /* If it's within the array bounds but doesn't have an explicit
6710 initializer, it's value-initialized. */
6711 tree val = build_value_init (elem_type, tf_warning_or_error);
6712 return cxx_eval_constant_expression (call, val,
6713 allow_non_constant, addr,
6717 if (!allow_non_constant)
6718 error ("array subscript out of bound");
6719 *non_constant_p = true;
6722 i = tree_low_cst (index, 0);
6723 if (TREE_CODE (ary) == CONSTRUCTOR)
6724 return VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ary), i)->value;
6725 else if (elem_nchars == 1)
6726 return build_int_cst (cv_unqualified (TREE_TYPE (TREE_TYPE (ary))),
6727 TREE_STRING_POINTER (ary)[i]);
6730 tree type = cv_unqualified (TREE_TYPE (TREE_TYPE (ary)));
6731 return native_interpret_expr (type, (const unsigned char *)
6732 TREE_STRING_POINTER (ary)
6733 + i * elem_nchars, elem_nchars);
6735 /* Don't VERIFY_CONSTANT here. */
6738 /* Subroutine of cxx_eval_constant_expression.
6739 Attempt to reduce a field access of a value of class type. */
6742 cxx_eval_component_reference (const constexpr_call *call, tree t,
6743 bool allow_non_constant, bool addr,
6744 bool *non_constant_p)
6746 unsigned HOST_WIDE_INT i;
6749 tree part = TREE_OPERAND (t, 1);
6750 tree orig_whole = TREE_OPERAND (t, 0);
6751 tree whole = cxx_eval_constant_expression (call, orig_whole,
6752 allow_non_constant, addr,
6754 if (whole == orig_whole)
6757 return fold_build3 (COMPONENT_REF, TREE_TYPE (t),
6758 whole, part, NULL_TREE);
6759 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6761 if (!*non_constant_p && TREE_CODE (whole) != CONSTRUCTOR)
6763 if (!allow_non_constant)
6764 error ("%qE is not a constant expression", orig_whole);
6765 *non_constant_p = true;
6767 if (DECL_MUTABLE_P (part))
6769 if (!allow_non_constant)
6770 error ("mutable %qD is not usable in a constant expression", part);
6771 *non_constant_p = true;
6773 if (*non_constant_p)
6775 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole), i, field, value)
6780 if (TREE_CODE (TREE_TYPE (whole)) == UNION_TYPE
6781 && CONSTRUCTOR_NELTS (whole) > 0)
6783 /* DR 1188 says we don't have to deal with this. */
6784 if (!allow_non_constant)
6785 error ("accessing %qD member instead of initialized %qD member in "
6786 "constant expression", part, CONSTRUCTOR_ELT (whole, 0)->index);
6787 *non_constant_p = true;
6791 /* If there's no explicit init for this field, it's value-initialized. */
6792 value = build_value_init (TREE_TYPE (t), tf_warning_or_error);
6793 return cxx_eval_constant_expression (call, value,
6794 allow_non_constant, addr,
6798 /* Subroutine of cxx_eval_constant_expression.
6799 Attempt to reduce a field access of a value of class type that is
6800 expressed as a BIT_FIELD_REF. */
6803 cxx_eval_bit_field_ref (const constexpr_call *call, tree t,
6804 bool allow_non_constant, bool addr,
6805 bool *non_constant_p)
6807 tree orig_whole = TREE_OPERAND (t, 0);
6808 tree retval, fldval, utype, mask;
6809 bool fld_seen = false;
6810 HOST_WIDE_INT istart, isize;
6811 tree whole = cxx_eval_constant_expression (call, orig_whole,
6812 allow_non_constant, addr,
6814 tree start, field, value;
6815 unsigned HOST_WIDE_INT i;
6817 if (whole == orig_whole)
6819 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6821 if (!*non_constant_p && TREE_CODE (whole) != CONSTRUCTOR)
6823 if (!allow_non_constant)
6824 error ("%qE is not a constant expression", orig_whole);
6825 *non_constant_p = true;
6827 if (*non_constant_p)
6830 start = TREE_OPERAND (t, 2);
6831 istart = tree_low_cst (start, 0);
6832 isize = tree_low_cst (TREE_OPERAND (t, 1), 0);
6833 utype = TREE_TYPE (t);
6834 if (!TYPE_UNSIGNED (utype))
6835 utype = build_nonstandard_integer_type (TYPE_PRECISION (utype), 1);
6836 retval = build_int_cst (utype, 0);
6837 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole), i, field, value)
6839 tree bitpos = bit_position (field);
6840 if (bitpos == start && DECL_SIZE (field) == TREE_OPERAND (t, 1))
6842 if (TREE_CODE (TREE_TYPE (field)) == INTEGER_TYPE
6843 && TREE_CODE (value) == INTEGER_CST
6844 && host_integerp (bitpos, 0)
6845 && host_integerp (DECL_SIZE (field), 0))
6847 HOST_WIDE_INT bit = tree_low_cst (bitpos, 0);
6848 HOST_WIDE_INT sz = tree_low_cst (DECL_SIZE (field), 0);
6849 HOST_WIDE_INT shift;
6850 if (bit >= istart && bit + sz <= istart + isize)
6852 fldval = fold_convert (utype, value);
6853 mask = build_int_cst_type (utype, -1);
6854 mask = fold_build2 (LSHIFT_EXPR, utype, mask,
6855 size_int (TYPE_PRECISION (utype) - sz));
6856 mask = fold_build2 (RSHIFT_EXPR, utype, mask,
6857 size_int (TYPE_PRECISION (utype) - sz));
6858 fldval = fold_build2 (BIT_AND_EXPR, utype, fldval, mask);
6859 shift = bit - istart;
6860 if (BYTES_BIG_ENDIAN)
6861 shift = TYPE_PRECISION (utype) - shift - sz;
6862 fldval = fold_build2 (LSHIFT_EXPR, utype, fldval,
6864 retval = fold_build2 (BIT_IOR_EXPR, utype, retval, fldval);
6870 return fold_convert (TREE_TYPE (t), retval);
6872 return error_mark_node;
6875 /* Subroutine of cxx_eval_constant_expression.
6876 Evaluate a short-circuited logical expression T in the context
6877 of a given constexpr CALL. BAILOUT_VALUE is the value for
6878 early return. CONTINUE_VALUE is used here purely for
6879 sanity check purposes. */
6882 cxx_eval_logical_expression (const constexpr_call *call, tree t,
6883 tree bailout_value, tree continue_value,
6884 bool allow_non_constant, bool addr,
6885 bool *non_constant_p)
6888 tree lhs = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
6889 allow_non_constant, addr,
6891 VERIFY_CONSTANT (lhs);
6892 if (tree_int_cst_equal (lhs, bailout_value))
6894 gcc_assert (tree_int_cst_equal (lhs, continue_value));
6895 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
6896 allow_non_constant, addr, non_constant_p);
6897 VERIFY_CONSTANT (r);
6901 /* REF is a COMPONENT_REF designating a particular field. V is a vector of
6902 CONSTRUCTOR elements to initialize (part of) an object containing that
6903 field. Return a pointer to the constructor_elt corresponding to the
6904 initialization of the field. */
6906 static constructor_elt *
6907 base_field_constructor_elt (VEC(constructor_elt,gc) *v, tree ref)
6909 tree aggr = TREE_OPERAND (ref, 0);
6910 tree field = TREE_OPERAND (ref, 1);
6912 constructor_elt *ce;
6914 gcc_assert (TREE_CODE (ref) == COMPONENT_REF);
6916 if (TREE_CODE (aggr) == COMPONENT_REF)
6918 constructor_elt *base_ce
6919 = base_field_constructor_elt (v, aggr);
6920 v = CONSTRUCTOR_ELTS (base_ce->value);
6923 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
6924 if (ce->index == field)
6931 /* Subroutine of cxx_eval_constant_expression.
6932 The expression tree T denotes a C-style array or a C-style
6933 aggregate. Reduce it to a constant expression. */
6936 cxx_eval_bare_aggregate (const constexpr_call *call, tree t,
6937 bool allow_non_constant, bool addr,
6938 bool *non_constant_p)
6940 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (t);
6941 VEC(constructor_elt,gc) *n = VEC_alloc (constructor_elt, gc,
6942 VEC_length (constructor_elt, v));
6943 constructor_elt *ce;
6945 bool changed = false;
6946 gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (t));
6947 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
6949 tree elt = cxx_eval_constant_expression (call, ce->value,
6950 allow_non_constant, addr,
6952 /* Don't VERIFY_CONSTANT here. */
6953 if (allow_non_constant && *non_constant_p)
6955 if (elt != ce->value)
6957 if (TREE_CODE (ce->index) == COMPONENT_REF)
6959 /* This is an initialization of a vfield inside a base
6960 subaggregate that we already initialized; push this
6961 initialization into the previous initialization. */
6962 constructor_elt *inner = base_field_constructor_elt (n, ce->index);
6966 CONSTRUCTOR_APPEND_ELT (n, ce->index, elt);
6968 if (*non_constant_p || !changed)
6971 VEC_free (constructor_elt, gc, n);
6974 t = build_constructor (TREE_TYPE (t), n);
6975 TREE_CONSTANT (t) = true;
6979 /* Subroutine of cxx_eval_constant_expression.
6980 The expression tree T is a VEC_INIT_EXPR which denotes the desired
6981 initialization of a non-static data member of array type. Reduce it to a
6984 Note that apart from value-initialization (when VALUE_INIT is true),
6985 this is only intended to support value-initialization and the
6986 initializations done by defaulted constructors for classes with
6987 non-static data members of array type. In this case, VEC_INIT_EXPR_INIT
6988 will either be NULL_TREE for the default constructor, or a COMPONENT_REF
6989 for the copy/move constructor. */
6992 cxx_eval_vec_init_1 (const constexpr_call *call, tree atype, tree init,
6993 bool value_init, bool allow_non_constant, bool addr,
6994 bool *non_constant_p)
6996 tree elttype = TREE_TYPE (atype);
6997 int max = tree_low_cst (array_type_nelts (atype), 0);
6998 VEC(constructor_elt,gc) *n = VEC_alloc (constructor_elt, gc, max + 1);
6999 bool pre_init = false;
7002 /* For the default constructor, build up a call to the default
7003 constructor of the element type. We only need to handle class types
7004 here, as for a constructor to be constexpr, all members must be
7005 initialized, which for a defaulted default constructor means they must
7006 be of a class type with a constexpr default constructor. */
7007 if (TREE_CODE (elttype) == ARRAY_TYPE)
7008 /* We only do this at the lowest level. */;
7009 else if (value_init)
7011 init = build_value_init (elttype, tf_warning_or_error);
7012 init = cxx_eval_constant_expression
7013 (call, init, allow_non_constant, addr, non_constant_p);
7018 VEC(tree,gc) *argvec = make_tree_vector ();
7019 init = build_special_member_call (NULL_TREE, complete_ctor_identifier,
7020 &argvec, elttype, LOOKUP_NORMAL,
7021 tf_warning_or_error);
7022 release_tree_vector (argvec);
7023 init = cxx_eval_constant_expression (call, init, allow_non_constant,
7024 addr, non_constant_p);
7028 if (*non_constant_p && !allow_non_constant)
7031 for (i = 0; i <= max; ++i)
7033 tree idx = build_int_cst (size_type_node, i);
7035 if (TREE_CODE (elttype) == ARRAY_TYPE)
7037 /* A multidimensional array; recurse. */
7039 eltinit = NULL_TREE;
7041 eltinit = cp_build_array_ref (input_location, init, idx,
7042 tf_warning_or_error);
7043 eltinit = cxx_eval_vec_init_1 (call, elttype, eltinit, value_init,
7044 allow_non_constant, addr,
7049 /* Initializing an element using value or default initialization
7050 we just pre-built above. */
7054 eltinit = unshare_expr (init);
7058 /* Copying an element. */
7059 VEC(tree,gc) *argvec;
7060 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7061 (atype, TREE_TYPE (init)));
7062 eltinit = cp_build_array_ref (input_location, init, idx,
7063 tf_warning_or_error);
7064 if (!real_lvalue_p (init))
7065 eltinit = move (eltinit);
7066 argvec = make_tree_vector ();
7067 VEC_quick_push (tree, argvec, eltinit);
7068 eltinit = (build_special_member_call
7069 (NULL_TREE, complete_ctor_identifier, &argvec,
7070 elttype, LOOKUP_NORMAL, tf_warning_or_error));
7071 release_tree_vector (argvec);
7072 eltinit = cxx_eval_constant_expression
7073 (call, eltinit, allow_non_constant, addr, non_constant_p);
7075 if (*non_constant_p && !allow_non_constant)
7077 CONSTRUCTOR_APPEND_ELT (n, idx, eltinit);
7080 if (!*non_constant_p)
7082 init = build_constructor (atype, n);
7083 TREE_CONSTANT (init) = true;
7088 VEC_free (constructor_elt, gc, n);
7093 cxx_eval_vec_init (const constexpr_call *call, tree t,
7094 bool allow_non_constant, bool addr,
7095 bool *non_constant_p)
7097 tree atype = TREE_TYPE (t);
7098 tree init = VEC_INIT_EXPR_INIT (t);
7099 tree r = cxx_eval_vec_init_1 (call, atype, init,
7100 VEC_INIT_EXPR_VALUE_INIT (t),
7101 allow_non_constant, addr, non_constant_p);
7102 if (*non_constant_p)
7108 /* A less strict version of fold_indirect_ref_1, which requires cv-quals to
7109 match. We want to be less strict for simple *& folding; if we have a
7110 non-const temporary that we access through a const pointer, that should
7111 work. We handle this here rather than change fold_indirect_ref_1
7112 because we're dealing with things like ADDR_EXPR of INTEGER_CST which
7113 don't really make sense outside of constant expression evaluation. Also
7114 we want to allow folding to COMPONENT_REF, which could cause trouble
7115 with TBAA in fold_indirect_ref_1.
7117 Try to keep this function synced with fold_indirect_ref_1. */
7120 cxx_fold_indirect_ref (location_t loc, tree type, tree op0, bool *empty_base)
7126 subtype = TREE_TYPE (sub);
7127 gcc_assert (POINTER_TYPE_P (subtype));
7129 if (TREE_CODE (sub) == ADDR_EXPR)
7131 tree op = TREE_OPERAND (sub, 0);
7132 tree optype = TREE_TYPE (op);
7134 /* *&CONST_DECL -> to the value of the const decl. */
7135 if (TREE_CODE (op) == CONST_DECL)
7136 return DECL_INITIAL (op);
7137 /* *&p => p; make sure to handle *&"str"[cst] here. */
7138 if (same_type_ignoring_top_level_qualifiers_p (optype, type))
7140 tree fop = fold_read_from_constant_string (op);
7146 /* *(foo *)&fooarray => fooarray[0] */
7147 else if (TREE_CODE (optype) == ARRAY_TYPE
7148 && (same_type_ignoring_top_level_qualifiers_p
7149 (type, TREE_TYPE (optype))))
7151 tree type_domain = TYPE_DOMAIN (optype);
7152 tree min_val = size_zero_node;
7153 if (type_domain && TYPE_MIN_VALUE (type_domain))
7154 min_val = TYPE_MIN_VALUE (type_domain);
7155 return build4_loc (loc, ARRAY_REF, type, op, min_val,
7156 NULL_TREE, NULL_TREE);
7158 /* *(foo *)&complexfoo => __real__ complexfoo */
7159 else if (TREE_CODE (optype) == COMPLEX_TYPE
7160 && (same_type_ignoring_top_level_qualifiers_p
7161 (type, TREE_TYPE (optype))))
7162 return fold_build1_loc (loc, REALPART_EXPR, type, op);
7163 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
7164 else if (TREE_CODE (optype) == VECTOR_TYPE
7165 && (same_type_ignoring_top_level_qualifiers_p
7166 (type, TREE_TYPE (optype))))
7168 tree part_width = TYPE_SIZE (type);
7169 tree index = bitsize_int (0);
7170 return fold_build3_loc (loc, BIT_FIELD_REF, type, op, part_width, index);
7172 /* Also handle conversion to an empty base class, which
7173 is represented with a NOP_EXPR. */
7174 else if (is_empty_class (type)
7175 && CLASS_TYPE_P (optype)
7176 && DERIVED_FROM_P (type, optype))
7181 /* *(foo *)&struct_with_foo_field => COMPONENT_REF */
7182 else if (RECORD_OR_UNION_TYPE_P (optype))
7184 tree field = TYPE_FIELDS (optype);
7185 for (; field; field = DECL_CHAIN (field))
7186 if (TREE_CODE (field) == FIELD_DECL
7187 && integer_zerop (byte_position (field))
7188 && (same_type_ignoring_top_level_qualifiers_p
7189 (TREE_TYPE (field), type)))
7191 return fold_build3 (COMPONENT_REF, type, op, field, NULL_TREE);
7196 else if (TREE_CODE (sub) == POINTER_PLUS_EXPR
7197 && TREE_CODE (TREE_OPERAND (sub, 1)) == INTEGER_CST)
7199 tree op00 = TREE_OPERAND (sub, 0);
7200 tree op01 = TREE_OPERAND (sub, 1);
7203 if (TREE_CODE (op00) == ADDR_EXPR)
7206 op00 = TREE_OPERAND (op00, 0);
7207 op00type = TREE_TYPE (op00);
7209 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
7210 if (TREE_CODE (op00type) == VECTOR_TYPE
7211 && (same_type_ignoring_top_level_qualifiers_p
7212 (type, TREE_TYPE (op00type))))
7214 HOST_WIDE_INT offset = tree_low_cst (op01, 0);
7215 tree part_width = TYPE_SIZE (type);
7216 unsigned HOST_WIDE_INT part_widthi = tree_low_cst (part_width, 0)/BITS_PER_UNIT;
7217 unsigned HOST_WIDE_INT indexi = offset * BITS_PER_UNIT;
7218 tree index = bitsize_int (indexi);
7220 if (offset/part_widthi <= TYPE_VECTOR_SUBPARTS (op00type))
7221 return fold_build3_loc (loc,
7222 BIT_FIELD_REF, type, op00,
7226 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
7227 else if (TREE_CODE (op00type) == COMPLEX_TYPE
7228 && (same_type_ignoring_top_level_qualifiers_p
7229 (type, TREE_TYPE (op00type))))
7231 tree size = TYPE_SIZE_UNIT (type);
7232 if (tree_int_cst_equal (size, op01))
7233 return fold_build1_loc (loc, IMAGPART_EXPR, type, op00);
7235 /* ((foo *)&fooarray)[1] => fooarray[1] */
7236 else if (TREE_CODE (op00type) == ARRAY_TYPE
7237 && (same_type_ignoring_top_level_qualifiers_p
7238 (type, TREE_TYPE (op00type))))
7240 tree type_domain = TYPE_DOMAIN (op00type);
7241 tree min_val = size_zero_node;
7242 if (type_domain && TYPE_MIN_VALUE (type_domain))
7243 min_val = TYPE_MIN_VALUE (type_domain);
7244 op01 = size_binop_loc (loc, EXACT_DIV_EXPR, op01,
7245 TYPE_SIZE_UNIT (type));
7246 op01 = size_binop_loc (loc, PLUS_EXPR, op01, min_val);
7247 return build4_loc (loc, ARRAY_REF, type, op00, op01,
7248 NULL_TREE, NULL_TREE);
7250 /* ((foo *)&struct_with_foo_field)[1] => COMPONENT_REF */
7251 else if (RECORD_OR_UNION_TYPE_P (op00type))
7253 tree field = TYPE_FIELDS (op00type);
7254 for (; field; field = DECL_CHAIN (field))
7255 if (TREE_CODE (field) == FIELD_DECL
7256 && tree_int_cst_equal (byte_position (field), op01)
7257 && (same_type_ignoring_top_level_qualifiers_p
7258 (TREE_TYPE (field), type)))
7260 return fold_build3 (COMPONENT_REF, type, op00,
7267 /* *(foo *)fooarrptreturn> (*fooarrptr)[0] */
7268 else if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
7269 && (same_type_ignoring_top_level_qualifiers_p
7270 (type, TREE_TYPE (TREE_TYPE (subtype)))))
7273 tree min_val = size_zero_node;
7274 sub = cxx_fold_indirect_ref (loc, TREE_TYPE (subtype), sub, NULL);
7276 sub = build1_loc (loc, INDIRECT_REF, TREE_TYPE (subtype), sub);
7277 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
7278 if (type_domain && TYPE_MIN_VALUE (type_domain))
7279 min_val = TYPE_MIN_VALUE (type_domain);
7280 return build4_loc (loc, ARRAY_REF, type, sub, min_val, NULL_TREE,
7288 cxx_eval_indirect_ref (const constexpr_call *call, tree t,
7289 bool allow_non_constant, bool addr,
7290 bool *non_constant_p)
7292 tree orig_op0 = TREE_OPERAND (t, 0);
7293 tree op0 = cxx_eval_constant_expression (call, orig_op0, allow_non_constant,
7294 /*addr*/false, non_constant_p);
7295 bool empty_base = false;
7298 /* Don't VERIFY_CONSTANT here. */
7299 if (*non_constant_p)
7302 r = cxx_fold_indirect_ref (EXPR_LOCATION (t), TREE_TYPE (t), op0,
7306 r = cxx_eval_constant_expression (call, r, allow_non_constant,
7307 addr, non_constant_p);
7312 if (TREE_CODE (sub) == ADDR_EXPR
7313 || TREE_CODE (sub) == POINTER_PLUS_EXPR)
7315 gcc_assert (!same_type_ignoring_top_level_qualifiers_p
7316 (TREE_TYPE (TREE_TYPE (sub)), TREE_TYPE (t)));
7317 /* DR 1188 says we don't have to deal with this. */
7318 if (!allow_non_constant)
7319 error ("accessing value of %qE through a %qT glvalue in a "
7320 "constant expression", build_fold_indirect_ref (sub),
7322 *non_constant_p = true;
7327 /* If we're pulling out the value of an empty base, make sure
7328 that the whole object is constant and then return an empty
7332 VERIFY_CONSTANT (r);
7333 r = build_constructor (TREE_TYPE (t), NULL);
7334 TREE_CONSTANT (r) = true;
7342 /* Complain about R, a VAR_DECL, not being usable in a constant expression.
7343 Shared between potential_constant_expression and
7344 cxx_eval_constant_expression. */
7347 non_const_var_error (tree r)
7349 tree type = TREE_TYPE (r);
7350 error ("the value of %qD is not usable in a constant "
7352 /* Avoid error cascade. */
7353 if (DECL_INITIAL (r) == error_mark_node)
7355 if (DECL_DECLARED_CONSTEXPR_P (r))
7356 inform (DECL_SOURCE_LOCATION (r),
7357 "%qD used in its own initializer", r);
7358 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type))
7360 if (!CP_TYPE_CONST_P (type))
7361 inform (DECL_SOURCE_LOCATION (r),
7362 "%q#D is not const", r);
7363 else if (CP_TYPE_VOLATILE_P (type))
7364 inform (DECL_SOURCE_LOCATION (r),
7365 "%q#D is volatile", r);
7366 else if (!DECL_INITIAL (r)
7367 || !TREE_CONSTANT (DECL_INITIAL (r)))
7368 inform (DECL_SOURCE_LOCATION (r),
7369 "%qD was not initialized with a constant "
7376 if (cxx_dialect >= cxx0x && !DECL_DECLARED_CONSTEXPR_P (r))
7377 inform (DECL_SOURCE_LOCATION (r),
7378 "%qD was not declared %<constexpr%>", r);
7380 inform (DECL_SOURCE_LOCATION (r),
7381 "%qD does not have integral or enumeration type",
7386 /* Attempt to reduce the expression T to a constant value.
7387 On failure, issue diagnostic and return error_mark_node. */
7388 /* FIXME unify with c_fully_fold */
7391 cxx_eval_constant_expression (const constexpr_call *call, tree t,
7392 bool allow_non_constant, bool addr,
7393 bool *non_constant_p)
7397 if (t == error_mark_node)
7399 *non_constant_p = true;
7402 if (CONSTANT_CLASS_P (t))
7404 if (TREE_CODE (t) == PTRMEM_CST)
7405 t = cplus_expand_constant (t);
7408 if (TREE_CODE (t) != NOP_EXPR
7409 && reduced_constant_expression_p (t))
7412 switch (TREE_CODE (t))
7417 /* else fall through. */
7419 r = integral_constant_value (t);
7420 if (TREE_CODE (r) == TARGET_EXPR
7421 && TREE_CODE (TARGET_EXPR_INITIAL (r)) == CONSTRUCTOR)
7422 r = TARGET_EXPR_INITIAL (r);
7425 if (!allow_non_constant)
7426 non_const_var_error (r);
7427 *non_constant_p = true;
7437 if (call && DECL_CONTEXT (t) == call->fundef->decl)
7439 if (DECL_ARTIFICIAL (t) && DECL_CONSTRUCTOR_P (DECL_CONTEXT (t)))
7441 if (!allow_non_constant)
7442 sorry ("use of the value of the object being constructed "
7443 "in a constant expression");
7444 *non_constant_p = true;
7447 r = lookup_parameter_binding (call, t);
7450 /* Defer in case this is only used for its type. */;
7453 if (!allow_non_constant)
7454 error ("%qE is not a constant expression", t);
7455 *non_constant_p = true;
7460 case AGGR_INIT_EXPR:
7461 r = cxx_eval_call_expression (call, t, allow_non_constant, addr,
7466 if (!literal_type_p (TREE_TYPE (t)))
7468 if (!allow_non_constant)
7470 error ("temporary of non-literal type %qT in a "
7471 "constant expression", TREE_TYPE (t));
7472 explain_non_literal_class (TREE_TYPE (t));
7474 *non_constant_p = true;
7477 /* else fall through. */
7479 /* Pass false for 'addr' because these codes indicate
7480 initialization of a temporary. */
7481 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
7482 allow_non_constant, false,
7484 if (!*non_constant_p)
7485 /* Adjust the type of the result to the type of the temporary. */
7486 r = adjust_temp_type (TREE_TYPE (t), r);
7490 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
7491 allow_non_constant, addr,
7496 case NON_LVALUE_EXPR:
7497 case TRY_CATCH_EXPR:
7498 case CLEANUP_POINT_EXPR:
7499 case MUST_NOT_THROW_EXPR:
7501 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
7502 allow_non_constant, addr,
7506 /* These differ from cxx_eval_unary_expression in that this doesn't
7507 check for a constant operand or result; an address can be
7508 constant without its operand being, and vice versa. */
7510 r = cxx_eval_indirect_ref (call, t, allow_non_constant, addr,
7516 tree oldop = TREE_OPERAND (t, 0);
7517 tree op = cxx_eval_constant_expression (call, oldop,
7521 /* Don't VERIFY_CONSTANT here. */
7522 if (*non_constant_p)
7524 /* This function does more aggressive folding than fold itself. */
7525 r = build_fold_addr_expr_with_type (op, TREE_TYPE (t));
7526 if (TREE_CODE (r) == ADDR_EXPR && TREE_OPERAND (r, 0) == oldop)
7534 case FIX_TRUNC_EXPR:
7539 case TRUTH_NOT_EXPR:
7540 case FIXED_CONVERT_EXPR:
7541 r = cxx_eval_unary_expression (call, t, allow_non_constant, addr,
7547 /* check_return_expr sometimes wraps a TARGET_EXPR in a
7548 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
7549 introduced by build_call_a. */
7550 tree op0 = TREE_OPERAND (t, 0);
7551 tree op1 = TREE_OPERAND (t, 1);
7553 if ((TREE_CODE (op0) == TARGET_EXPR && op1 == TARGET_EXPR_SLOT (op0))
7554 || TREE_CODE (op1) == EMPTY_CLASS_EXPR)
7555 r = cxx_eval_constant_expression (call, op0, allow_non_constant,
7556 addr, non_constant_p);
7559 /* Check that the LHS is constant and then discard it. */
7560 cxx_eval_constant_expression (call, op0, allow_non_constant,
7561 false, non_constant_p);
7562 r = cxx_eval_constant_expression (call, op1, allow_non_constant,
7563 addr, non_constant_p);
7568 case POINTER_PLUS_EXPR:
7572 case TRUNC_DIV_EXPR:
7574 case FLOOR_DIV_EXPR:
7575 case ROUND_DIV_EXPR:
7576 case TRUNC_MOD_EXPR:
7578 case ROUND_MOD_EXPR:
7580 case EXACT_DIV_EXPR:
7590 case TRUTH_XOR_EXPR:
7597 case UNORDERED_EXPR:
7606 r = cxx_eval_binary_expression (call, t, allow_non_constant, addr,
7610 /* fold can introduce non-IF versions of these; still treat them as
7611 short-circuiting. */
7612 case TRUTH_AND_EXPR:
7613 case TRUTH_ANDIF_EXPR:
7614 r = cxx_eval_logical_expression (call, t, boolean_false_node,
7616 allow_non_constant, addr,
7621 case TRUTH_ORIF_EXPR:
7622 r = cxx_eval_logical_expression (call, t, boolean_true_node,
7624 allow_non_constant, addr,
7629 r = cxx_eval_array_reference (call, t, allow_non_constant, addr,
7634 r = cxx_eval_component_reference (call, t, allow_non_constant, addr,
7639 r = cxx_eval_bit_field_ref (call, t, allow_non_constant, addr,
7645 r = cxx_eval_conditional_expression (call, t, allow_non_constant, addr,
7650 r = cxx_eval_bare_aggregate (call, t, allow_non_constant, addr,
7655 /* We can get this in a defaulted constructor for a class with a
7656 non-static data member of array type. Either the initializer will
7657 be NULL, meaning default-initialization, or it will be an lvalue
7658 or xvalue of the same type, meaning direct-initialization from the
7659 corresponding member. */
7660 r = cxx_eval_vec_init (call, t, allow_non_constant, addr,
7665 case VIEW_CONVERT_EXPR:
7668 tree oldop = TREE_OPERAND (t, 0);
7670 tree to = TREE_TYPE (t);
7671 tree source = TREE_TYPE (op);
7672 if (TYPE_PTR_P (source) && ARITHMETIC_TYPE_P (to)
7673 && !(TREE_CODE (op) == COMPONENT_REF
7674 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (op, 0)))))
7676 if (!allow_non_constant)
7677 error ("conversion of expression %qE of pointer type "
7678 "cannot yield a constant expression", op);
7679 *non_constant_p = true;
7682 op = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
7683 allow_non_constant, addr,
7685 if (*non_constant_p)
7688 /* We didn't fold at the top so we could check for ptr-int
7691 r = fold_build1 (TREE_CODE (t), to, op);
7692 /* Conversion of an out-of-range value has implementation-defined
7693 behavior; the language considers it different from arithmetic
7694 overflow, which is undefined. */
7695 if (TREE_OVERFLOW_P (r) && !TREE_OVERFLOW_P (op))
7696 TREE_OVERFLOW (r) = false;
7700 case EMPTY_CLASS_EXPR:
7701 /* This is good enough for a function argument that might not get
7702 used, and they can't do anything with it, so just return it. */
7706 case PREINCREMENT_EXPR:
7707 case POSTINCREMENT_EXPR:
7708 case PREDECREMENT_EXPR:
7709 case POSTDECREMENT_EXPR:
7713 case VEC_DELETE_EXPR:
7717 /* GCC internal stuff. */
7720 case WITH_CLEANUP_EXPR:
7721 case STATEMENT_LIST:
7723 case NON_DEPENDENT_EXPR:
7727 if (!allow_non_constant)
7728 error_at (EXPR_LOC_OR_HERE (t),
7729 "expression %qE is not a constant-expression", t);
7730 *non_constant_p = true;
7734 internal_error ("unexpected expression %qE of kind %s", t,
7735 tree_code_name[TREE_CODE (t)]);
7736 *non_constant_p = true;
7740 if (r == error_mark_node)
7741 *non_constant_p = true;
7743 if (*non_constant_p)
7750 cxx_eval_outermost_constant_expr (tree t, bool allow_non_constant)
7752 bool non_constant_p = false;
7753 tree r = cxx_eval_constant_expression (NULL, t, allow_non_constant,
7754 false, &non_constant_p);
7756 verify_constant (r, allow_non_constant, &non_constant_p);
7758 if (TREE_CODE (t) != CONSTRUCTOR
7759 && cp_has_mutable_p (TREE_TYPE (t)))
7761 /* We allow a mutable type if the original expression was a
7762 CONSTRUCTOR so that we can do aggregate initialization of
7763 constexpr variables. */
7764 if (!allow_non_constant)
7765 error ("%qT cannot be the type of a complete constant expression "
7766 "because it has mutable sub-objects", TREE_TYPE (t));
7767 non_constant_p = true;
7770 if (non_constant_p && !allow_non_constant)
7771 return error_mark_node;
7772 else if (non_constant_p && TREE_CONSTANT (t))
7774 /* This isn't actually constant, so unset TREE_CONSTANT. */
7775 if (EXPR_P (t) || TREE_CODE (t) == CONSTRUCTOR)
7778 r = build_nop (TREE_TYPE (t), t);
7779 TREE_CONSTANT (r) = false;
7782 else if (non_constant_p || r == t)
7784 else if (TREE_CODE (r) == CONSTRUCTOR && CLASS_TYPE_P (TREE_TYPE (r)))
7786 if (TREE_CODE (t) == TARGET_EXPR
7787 && TARGET_EXPR_INITIAL (t) == r)
7791 r = get_target_expr (r);
7792 TREE_CONSTANT (r) = true;
7800 /* Returns true if T is a valid subexpression of a constant expression,
7801 even if it isn't itself a constant expression. */
7804 is_sub_constant_expr (tree t)
7806 bool non_constant_p = false;
7807 cxx_eval_constant_expression (NULL, t, true, false, &non_constant_p);
7808 return !non_constant_p;
7811 /* If T represents a constant expression returns its reduced value.
7812 Otherwise return error_mark_node. If T is dependent, then
7816 cxx_constant_value (tree t)
7818 return cxx_eval_outermost_constant_expr (t, false);
7821 /* If T is a constant expression, returns its reduced value.
7822 Otherwise, if T does not have TREE_CONSTANT set, returns T.
7823 Otherwise, returns a version of T without TREE_CONSTANT. */
7826 maybe_constant_value (tree t)
7830 if (type_dependent_expression_p (t)
7831 || type_unknown_p (t)
7832 || BRACE_ENCLOSED_INITIALIZER_P (t)
7833 || !potential_constant_expression (t)
7834 || value_dependent_expression_p (t))
7836 if (TREE_OVERFLOW_P (t))
7838 t = build_nop (TREE_TYPE (t), t);
7839 TREE_CONSTANT (t) = false;
7844 r = cxx_eval_outermost_constant_expr (t, true);
7845 #ifdef ENABLE_CHECKING
7846 /* cp_tree_equal looks through NOPs, so allow them. */
7848 || CONVERT_EXPR_P (t)
7849 || (TREE_CONSTANT (t) && !TREE_CONSTANT (r))
7850 || !cp_tree_equal (r, t));
7855 /* Like maybe_constant_value, but returns a CONSTRUCTOR directly, rather
7856 than wrapped in a TARGET_EXPR. */
7859 maybe_constant_init (tree t)
7861 t = maybe_constant_value (t);
7862 if (TREE_CODE (t) == TARGET_EXPR)
7864 tree init = TARGET_EXPR_INITIAL (t);
7865 if (TREE_CODE (init) == CONSTRUCTOR
7866 && TREE_CONSTANT (init))
7873 /* FIXME see ADDR_EXPR section in potential_constant_expression_1. */
7874 /* Return true if the object referred to by REF has automatic or thread
7877 enum { ck_ok, ck_bad, ck_unknown };
7879 check_automatic_or_tls (tree ref)
7881 enum machine_mode mode;
7882 HOST_WIDE_INT bitsize, bitpos;
7884 int volatilep = 0, unsignedp = 0;
7885 tree decl = get_inner_reference (ref, &bitsize, &bitpos, &offset,
7886 &mode, &unsignedp, &volatilep, false);
7889 /* If there isn't a decl in the middle, we don't know the linkage here,
7890 and this isn't a constant expression anyway. */
7893 dk = decl_storage_duration (decl);
7894 return (dk == dk_auto || dk == dk_thread) ? ck_bad : ck_ok;
7898 /* Return true if T denotes a potentially constant expression. Issue
7899 diagnostic as appropriate under control of FLAGS. If WANT_RVAL is true,
7900 an lvalue-rvalue conversion is implied.
7902 C++0x [expr.const] used to say
7904 6 An expression is a potential constant expression if it is
7905 a constant expression where all occurences of function
7906 parameters are replaced by arbitrary constant expressions
7907 of the appropriate type.
7909 2 A conditional expression is a constant expression unless it
7910 involves one of the following as a potentially evaluated
7911 subexpression (3.2), but subexpressions of logical AND (5.14),
7912 logical OR (5.15), and conditional (5.16) operations that are
7913 not evaluated are not considered. */
7916 potential_constant_expression_1 (tree t, bool want_rval, tsubst_flags_t flags)
7918 enum { any = false, rval = true };
7922 /* C++98 has different rules for the form of a constant expression that
7923 are enforced in the parser, so we can assume that anything that gets
7924 this far is suitable. */
7925 if (cxx_dialect < cxx0x)
7928 if (t == error_mark_node)
7932 if (TREE_THIS_VOLATILE (t))
7934 if (flags & tf_error)
7935 error ("expression %qE has side-effects", t);
7938 if (CONSTANT_CLASS_P (t))
7940 if (TREE_OVERFLOW (t))
7942 if (flags & tf_error)
7944 permerror (EXPR_LOC_OR_HERE (t),
7945 "overflow in constant expression");
7946 if (flag_permissive)
7954 switch (TREE_CODE (t))
7960 case TEMPLATE_ID_EXPR:
7967 case TEMPLATE_PARM_INDEX:
7969 case IDENTIFIER_NODE:
7970 case USERDEF_LITERAL:
7971 /* We can see a FIELD_DECL in a pointer-to-member expression. */
7977 case AGGR_INIT_EXPR:
7979 /* -- an invocation of a function other than a constexpr function
7980 or a constexpr constructor. */
7982 tree fun = get_function_named_in_call (t);
7983 const int nargs = call_expr_nargs (t);
7986 if (is_overloaded_fn (fun))
7988 if (TREE_CODE (fun) == FUNCTION_DECL)
7990 if (builtin_valid_in_constant_expr_p (fun))
7992 if (!DECL_DECLARED_CONSTEXPR_P (fun)
7993 /* Allow any built-in function; if the expansion
7994 isn't constant, we'll deal with that then. */
7995 && !is_builtin_fn (fun))
7997 if (flags & tf_error)
7999 error_at (EXPR_LOC_OR_HERE (t),
8000 "call to non-constexpr function %qD", fun);
8001 explain_invalid_constexpr_fn (fun);
8005 /* A call to a non-static member function takes the address
8006 of the object as the first argument. But in a constant
8007 expression the address will be folded away, so look
8009 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun)
8010 && !DECL_CONSTRUCTOR_P (fun))
8012 tree x = get_nth_callarg (t, 0);
8013 if (is_this_parameter (x))
8015 if (DECL_CONSTRUCTOR_P (DECL_CONTEXT (x)))
8017 if (flags & tf_error)
8018 sorry ("calling a member function of the "
8019 "object being constructed in a constant "
8023 /* Otherwise OK. */;
8025 else if (!potential_constant_expression_1 (x, rval, flags))
8031 fun = get_first_fn (fun);
8032 /* Skip initial arguments to base constructors. */
8033 if (DECL_BASE_CONSTRUCTOR_P (fun))
8034 i = num_artificial_parms_for (fun);
8035 fun = DECL_ORIGIN (fun);
8039 if (potential_constant_expression_1 (fun, rval, flags))
8040 /* Might end up being a constant function pointer. */;
8044 for (; i < nargs; ++i)
8046 tree x = get_nth_callarg (t, i);
8047 if (!potential_constant_expression_1 (x, rval, flags))
8053 case NON_LVALUE_EXPR:
8054 /* -- an lvalue-to-rvalue conversion (4.1) unless it is applied to
8055 -- an lvalue of integral type that refers to a non-volatile
8056 const variable or static data member initialized with
8057 constant expressions, or
8059 -- an lvalue of literal type that refers to non-volatile
8060 object defined with constexpr, or that refers to a
8061 sub-object of such an object; */
8062 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval, flags);
8065 if (want_rval && !decl_constant_var_p (t)
8066 && !dependent_type_p (TREE_TYPE (t)))
8068 if (flags & tf_error)
8069 non_const_var_error (t);
8076 case VIEW_CONVERT_EXPR:
8077 /* -- an array-to-pointer conversion that is applied to an lvalue
8078 that designates an object with thread or automatic storage
8079 duration; FIXME not implemented as it breaks constexpr arrays;
8080 need to fix the standard
8081 -- a type conversion from a pointer or pointer-to-member type
8082 to a literal type. */
8084 tree from = TREE_OPERAND (t, 0);
8085 tree source = TREE_TYPE (from);
8086 tree target = TREE_TYPE (t);
8087 if (TYPE_PTR_P (source) && ARITHMETIC_TYPE_P (target)
8088 && !(TREE_CODE (from) == COMPONENT_REF
8089 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (from, 0)))))
8091 if (flags & tf_error)
8092 error ("conversion of expression %qE of pointer type "
8093 "cannot yield a constant expression", from);
8096 return (potential_constant_expression_1
8097 (from, TREE_CODE (t) != VIEW_CONVERT_EXPR, flags));
8101 /* -- a unary operator & that is applied to an lvalue that
8102 designates an object with thread or automatic storage
8104 t = TREE_OPERAND (t, 0);
8106 /* FIXME adjust when issue 1197 is fully resolved. For now don't do
8107 any checking here, as we might dereference the pointer later. If
8108 we remove this code, also remove check_automatic_or_tls. */
8109 i = check_automatic_or_tls (t);
8114 if (flags & tf_error)
8115 error ("address-of an object %qE with thread local or "
8116 "automatic storage is not a constant expression", t);
8120 return potential_constant_expression_1 (t, any, flags);
8126 /* -- a class member access unless its postfix-expression is
8127 of literal type or of pointer to literal type. */
8128 /* This test would be redundant, as it follows from the
8129 postfix-expression being a potential constant expression. */
8130 return potential_constant_expression_1 (TREE_OPERAND (t, 0),
8133 case EXPR_PACK_EXPANSION:
8134 return potential_constant_expression_1 (PACK_EXPANSION_PATTERN (t),
8139 tree x = TREE_OPERAND (t, 0);
8141 if (is_this_parameter (x))
8143 if (want_rval && DECL_CONTEXT (x)
8144 && DECL_CONSTRUCTOR_P (DECL_CONTEXT (x)))
8146 if (flags & tf_error)
8147 sorry ("use of the value of the object being constructed "
8148 "in a constant expression");
8153 return potential_constant_expression_1 (x, rval, flags);
8157 case DYNAMIC_CAST_EXPR:
8158 case PSEUDO_DTOR_EXPR:
8159 case PREINCREMENT_EXPR:
8160 case POSTINCREMENT_EXPR:
8161 case PREDECREMENT_EXPR:
8162 case POSTDECREMENT_EXPR:
8166 case VEC_DELETE_EXPR:
8170 /* GCC internal stuff. */
8173 case WITH_CLEANUP_EXPR:
8174 case CLEANUP_POINT_EXPR:
8175 case MUST_NOT_THROW_EXPR:
8176 case TRY_CATCH_EXPR:
8177 case STATEMENT_LIST:
8178 /* Don't bother trying to define a subset of statement-expressions to
8179 be constant-expressions, at least for now. */
8183 case TRANSACTION_EXPR:
8188 if (flags & tf_error)
8189 error ("expression %qE is not a constant-expression", t);
8193 /* -- a typeid expression whose operand is of polymorphic
8196 tree e = TREE_OPERAND (t, 0);
8197 if (!TYPE_P (e) && !type_dependent_expression_p (e)
8198 && TYPE_POLYMORPHIC_P (TREE_TYPE (e)))
8200 if (flags & tf_error)
8201 error ("typeid-expression is not a constant expression "
8202 "because %qE is of polymorphic type", e);
8209 /* -- a subtraction where both operands are pointers. */
8210 if (TYPE_PTR_P (TREE_OPERAND (t, 0))
8211 && TYPE_PTR_P (TREE_OPERAND (t, 1)))
8213 if (flags & tf_error)
8214 error ("difference of two pointer expressions is not "
8215 "a constant expression");
8227 /* -- a relational or equality operator where at least
8228 one of the operands is a pointer. */
8229 if (TYPE_PTR_P (TREE_OPERAND (t, 0))
8230 || TYPE_PTR_P (TREE_OPERAND (t, 1)))
8232 if (flags & tf_error)
8233 error ("pointer comparison expression is not a "
8234 "constant expression");
8242 if (TYPE_P (TREE_OPERAND (t, 0)))
8244 /* else fall through. */
8250 case FIX_TRUNC_EXPR:
8254 case TRUTH_NOT_EXPR:
8255 case FIXED_CONVERT_EXPR:
8256 case UNARY_PLUS_EXPR:
8257 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval,
8261 case CONST_CAST_EXPR:
8262 case STATIC_CAST_EXPR:
8263 case REINTERPRET_CAST_EXPR:
8264 case IMPLICIT_CONV_EXPR:
8265 return (potential_constant_expression_1
8266 (TREE_OPERAND (t, 0),
8267 TREE_CODE (TREE_TYPE (t)) != REFERENCE_TYPE, flags));
8270 case NON_DEPENDENT_EXPR:
8271 /* For convenience. */
8273 return potential_constant_expression_1 (TREE_OPERAND (t, 0),
8277 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
8281 if (!literal_type_p (TREE_TYPE (t)))
8283 if (flags & tf_error)
8285 error ("temporary of non-literal type %qT in a "
8286 "constant expression", TREE_TYPE (t));
8287 explain_non_literal_class (TREE_TYPE (t));
8292 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
8297 VEC(constructor_elt, gc) *v = CONSTRUCTOR_ELTS (t);
8298 constructor_elt *ce;
8299 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
8300 if (!potential_constant_expression_1 (ce->value, want_rval, flags))
8307 gcc_assert (TREE_PURPOSE (t) == NULL_TREE
8308 || DECL_P (TREE_PURPOSE (t)));
8309 if (!potential_constant_expression_1 (TREE_VALUE (t), want_rval,
8312 if (TREE_CHAIN (t) == NULL_TREE)
8314 return potential_constant_expression_1 (TREE_CHAIN (t), want_rval,
8318 case TRUNC_DIV_EXPR:
8320 case FLOOR_DIV_EXPR:
8321 case ROUND_DIV_EXPR:
8322 case TRUNC_MOD_EXPR:
8324 case ROUND_MOD_EXPR:
8326 tree denom = TREE_OPERAND (t, 1);
8327 /* We can't call maybe_constant_value on an expression
8328 that hasn't been through fold_non_dependent_expr yet. */
8329 if (!processing_template_decl)
8330 denom = maybe_constant_value (denom);
8331 if (integer_zerop (denom))
8333 if (flags & tf_error)
8334 error ("division by zero is not a constant-expression");
8346 /* check_return_expr sometimes wraps a TARGET_EXPR in a
8347 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
8348 introduced by build_call_a. */
8349 tree op0 = TREE_OPERAND (t, 0);
8350 tree op1 = TREE_OPERAND (t, 1);
8352 if ((TREE_CODE (op0) == TARGET_EXPR && op1 == TARGET_EXPR_SLOT (op0))
8353 || TREE_CODE (op1) == EMPTY_CLASS_EXPR)
8354 return potential_constant_expression_1 (op0, want_rval, flags);
8359 /* If the first operand is the non-short-circuit constant, look at
8360 the second operand; otherwise we only care about the first one for
8362 case TRUTH_AND_EXPR:
8363 case TRUTH_ANDIF_EXPR:
8364 tmp = boolean_true_node;
8367 case TRUTH_ORIF_EXPR:
8368 tmp = boolean_false_node;
8370 if (TREE_OPERAND (t, 0) == tmp)
8371 return potential_constant_expression_1 (TREE_OPERAND (t, 1), rval, flags);
8373 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval, flags);
8377 case POINTER_PLUS_EXPR:
8379 case EXACT_DIV_EXPR:
8389 case TRUTH_XOR_EXPR:
8390 case UNORDERED_EXPR:
8402 case ARRAY_RANGE_REF:
8406 for (i = 0; i < 2; ++i)
8407 if (!potential_constant_expression_1 (TREE_OPERAND (t, i),
8413 for (i = 0; i < 3; ++i)
8414 if (!potential_constant_expression_1 (TREE_OPERAND (t, i),
8421 /* If the condition is a known constant, we know which of the legs we
8422 care about; otherwise we only require that the condition and
8423 either of the legs be potentially constant. */
8424 tmp = TREE_OPERAND (t, 0);
8425 if (!potential_constant_expression_1 (tmp, rval, flags))
8427 else if (integer_zerop (tmp))
8428 return potential_constant_expression_1 (TREE_OPERAND (t, 2),
8430 else if (TREE_CODE (tmp) == INTEGER_CST)
8431 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
8433 for (i = 1; i < 3; ++i)
8434 if (potential_constant_expression_1 (TREE_OPERAND (t, i),
8435 want_rval, tf_none))
8437 if (flags & tf_error)
8438 error ("expression %qE is not a constant-expression", t);
8442 if (VEC_INIT_EXPR_IS_CONSTEXPR (t))
8444 if (flags & tf_error)
8446 error ("non-constant array initialization");
8447 diagnose_non_constexpr_vec_init (t);
8452 sorry ("unexpected AST of kind %s", tree_code_name[TREE_CODE (t)]);
8458 /* The main entry point to the above. */
8461 potential_constant_expression (tree t)
8463 return potential_constant_expression_1 (t, false, tf_none);
8466 /* As above, but require a constant rvalue. */
8469 potential_rvalue_constant_expression (tree t)
8471 return potential_constant_expression_1 (t, true, tf_none);
8474 /* Like above, but complain about non-constant expressions. */
8477 require_potential_constant_expression (tree t)
8479 return potential_constant_expression_1 (t, false, tf_warning_or_error);
8482 /* Cross product of the above. */
8485 require_potential_rvalue_constant_expression (tree t)
8487 return potential_constant_expression_1 (t, true, tf_warning_or_error);
8490 /* Constructor for a lambda expression. */
8493 build_lambda_expr (void)
8495 tree lambda = make_node (LAMBDA_EXPR);
8496 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) = CPLD_NONE;
8497 LAMBDA_EXPR_CAPTURE_LIST (lambda) = NULL_TREE;
8498 LAMBDA_EXPR_THIS_CAPTURE (lambda) = NULL_TREE;
8499 LAMBDA_EXPR_PENDING_PROXIES (lambda) = NULL;
8500 LAMBDA_EXPR_RETURN_TYPE (lambda) = NULL_TREE;
8501 LAMBDA_EXPR_MUTABLE_P (lambda) = false;
8505 /* Create the closure object for a LAMBDA_EXPR. */
8508 build_lambda_object (tree lambda_expr)
8510 /* Build aggregate constructor call.
8511 - cp_parser_braced_list
8512 - cp_parser_functional_cast */
8513 VEC(constructor_elt,gc) *elts = NULL;
8514 tree node, expr, type;
8515 location_t saved_loc;
8517 if (processing_template_decl)
8520 /* Make sure any error messages refer to the lambda-introducer. */
8521 saved_loc = input_location;
8522 input_location = LAMBDA_EXPR_LOCATION (lambda_expr);
8524 for (node = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr);
8526 node = TREE_CHAIN (node))
8528 tree field = TREE_PURPOSE (node);
8529 tree val = TREE_VALUE (node);
8531 if (field == error_mark_node)
8533 expr = error_mark_node;
8540 /* Mere mortals can't copy arrays with aggregate initialization, so
8541 do some magic to make it work here. */
8542 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE)
8543 val = build_array_copy (val);
8544 else if (DECL_NORMAL_CAPTURE_P (field)
8545 && TREE_CODE (TREE_TYPE (field)) != REFERENCE_TYPE)
8547 /* "the entities that are captured by copy are used to
8548 direct-initialize each corresponding non-static data
8549 member of the resulting closure object."
8551 There's normally no way to express direct-initialization
8552 from an element of a CONSTRUCTOR, so we build up a special
8553 TARGET_EXPR to bypass the usual copy-initialization. */
8554 val = force_rvalue (val, tf_warning_or_error);
8555 if (TREE_CODE (val) == TARGET_EXPR)
8556 TARGET_EXPR_DIRECT_INIT_P (val) = true;
8559 CONSTRUCTOR_APPEND_ELT (elts, DECL_NAME (field), val);
8562 expr = build_constructor (init_list_type_node, elts);
8563 CONSTRUCTOR_IS_DIRECT_INIT (expr) = 1;
8565 /* N2927: "[The closure] class type is not an aggregate."
8566 But we briefly treat it as an aggregate to make this simpler. */
8567 type = LAMBDA_EXPR_CLOSURE (lambda_expr);
8568 CLASSTYPE_NON_AGGREGATE (type) = 0;
8569 expr = finish_compound_literal (type, expr, tf_warning_or_error);
8570 CLASSTYPE_NON_AGGREGATE (type) = 1;
8573 input_location = saved_loc;
8577 /* Return an initialized RECORD_TYPE for LAMBDA.
8578 LAMBDA must have its explicit captures already. */
8581 begin_lambda_type (tree lambda)
8586 /* Unique name. This is just like an unnamed class, but we cannot use
8587 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
8589 name = make_lambda_name ();
8591 /* Create the new RECORD_TYPE for this lambda. */
8592 type = xref_tag (/*tag_code=*/record_type,
8594 /*scope=*/ts_within_enclosing_non_class,
8595 /*template_header_p=*/false);
8598 /* Designate it as a struct so that we can use aggregate initialization. */
8599 CLASSTYPE_DECLARED_CLASS (type) = false;
8601 /* Clear base types. */
8602 xref_basetypes (type, /*bases=*/NULL_TREE);
8604 /* Start the class. */
8605 type = begin_class_definition (type, /*attributes=*/NULL_TREE);
8607 /* Cross-reference the expression and the type. */
8608 LAMBDA_EXPR_CLOSURE (lambda) = type;
8609 CLASSTYPE_LAMBDA_EXPR (type) = lambda;
8614 /* Returns the type to use for the return type of the operator() of a
8618 lambda_return_type (tree expr)
8621 if (type_unknown_p (expr)
8622 || BRACE_ENCLOSED_INITIALIZER_P (expr))
8624 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
8625 return void_type_node;
8627 if (type_dependent_expression_p (expr))
8628 type = dependent_lambda_return_type_node;
8630 type = cv_unqualified (type_decays_to (unlowered_expr_type (expr)));
8634 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
8638 lambda_function (tree lambda)
8641 if (TREE_CODE (lambda) == LAMBDA_EXPR)
8642 type = LAMBDA_EXPR_CLOSURE (lambda);
8645 gcc_assert (LAMBDA_TYPE_P (type));
8646 /* Don't let debug_tree cause instantiation. */
8647 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type)
8648 && !COMPLETE_OR_OPEN_TYPE_P (type))
8650 lambda = lookup_member (type, ansi_opname (CALL_EXPR),
8651 /*protect=*/0, /*want_type=*/false,
8652 tf_warning_or_error);
8654 lambda = BASELINK_FUNCTIONS (lambda);
8658 /* Returns the type to use for the FIELD_DECL corresponding to the
8660 The caller should add REFERENCE_TYPE for capture by reference. */
8663 lambda_capture_field_type (tree expr)
8666 if (type_dependent_expression_p (expr))
8668 type = cxx_make_type (DECLTYPE_TYPE);
8669 DECLTYPE_TYPE_EXPR (type) = expr;
8670 DECLTYPE_FOR_LAMBDA_CAPTURE (type) = true;
8671 SET_TYPE_STRUCTURAL_EQUALITY (type);
8674 type = non_reference (unlowered_expr_type (expr));
8678 /* Recompute the return type for LAMBDA with body of the form:
8679 { return EXPR ; } */
8682 apply_lambda_return_type (tree lambda, tree return_type)
8684 tree fco = lambda_function (lambda);
8687 LAMBDA_EXPR_RETURN_TYPE (lambda) = return_type;
8689 if (return_type == error_mark_node)
8691 if (TREE_TYPE (TREE_TYPE (fco)) == return_type)
8694 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
8695 TREE_TYPE (METHOD_TYPE) == return-type */
8696 TREE_TYPE (fco) = change_return_type (return_type, TREE_TYPE (fco));
8698 result = DECL_RESULT (fco);
8699 if (result == NULL_TREE)
8702 /* We already have a DECL_RESULT from start_preparsed_function.
8703 Now we need to redo the work it and allocate_struct_function
8704 did to reflect the new type. */
8705 gcc_assert (current_function_decl == fco);
8706 result = build_decl (input_location, RESULT_DECL, NULL_TREE,
8707 TYPE_MAIN_VARIANT (return_type));
8708 DECL_ARTIFICIAL (result) = 1;
8709 DECL_IGNORED_P (result) = 1;
8710 cp_apply_type_quals_to_decl (cp_type_quals (return_type),
8713 DECL_RESULT (fco) = result;
8715 if (!processing_template_decl && aggregate_value_p (result, fco))
8717 #ifdef PCC_STATIC_STRUCT_RETURN
8718 cfun->returns_pcc_struct = 1;
8720 cfun->returns_struct = 1;
8725 /* DECL is a local variable or parameter from the surrounding scope of a
8726 lambda-expression. Returns the decltype for a use of the capture field
8727 for DECL even if it hasn't been captured yet. */
8730 capture_decltype (tree decl)
8732 tree lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
8733 /* FIXME do lookup instead of list walk? */
8734 tree cap = value_member (decl, LAMBDA_EXPR_CAPTURE_LIST (lam));
8738 type = TREE_TYPE (TREE_PURPOSE (cap));
8740 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam))
8743 error ("%qD is not captured", decl);
8744 return error_mark_node;
8747 type = TREE_TYPE (decl);
8748 if (TREE_CODE (type) == REFERENCE_TYPE
8749 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
8750 type = TREE_TYPE (type);
8753 case CPLD_REFERENCE:
8754 type = TREE_TYPE (decl);
8755 if (TREE_CODE (type) != REFERENCE_TYPE)
8756 type = build_reference_type (TREE_TYPE (decl));
8763 if (TREE_CODE (type) != REFERENCE_TYPE)
8765 if (!LAMBDA_EXPR_MUTABLE_P (lam))
8766 type = cp_build_qualified_type (type, (cp_type_quals (type)
8768 type = build_reference_type (type);
8773 /* Returns true iff DECL is a lambda capture proxy variable created by
8774 build_capture_proxy. */
8777 is_capture_proxy (tree decl)
8779 return (TREE_CODE (decl) == VAR_DECL
8780 && DECL_HAS_VALUE_EXPR_P (decl)
8781 && !DECL_ANON_UNION_VAR_P (decl)
8782 && LAMBDA_FUNCTION_P (DECL_CONTEXT (decl)));
8785 /* Returns true iff DECL is a capture proxy for a normal capture
8786 (i.e. without explicit initializer). */
8789 is_normal_capture_proxy (tree decl)
8793 if (!is_capture_proxy (decl))
8794 /* It's not a capture proxy. */
8797 /* It is a capture proxy, is it a normal capture? */
8798 val = DECL_VALUE_EXPR (decl);
8799 gcc_assert (TREE_CODE (val) == COMPONENT_REF);
8800 val = TREE_OPERAND (val, 1);
8801 return DECL_NORMAL_CAPTURE_P (val);
8804 /* VAR is a capture proxy created by build_capture_proxy; add it to the
8805 current function, which is the operator() for the appropriate lambda. */
8808 insert_capture_proxy (tree var)
8810 cp_binding_level *b;
8814 /* Put the capture proxy in the extra body block so that it won't clash
8815 with a later local variable. */
8816 b = current_binding_level;
8817 for (skip = 0; ; ++skip)
8819 cp_binding_level *n = b->level_chain;
8820 if (n->kind == sk_function_parms)
8824 pushdecl_with_scope (var, b, false);
8826 /* And put a DECL_EXPR in the STATEMENT_LIST for the same block. */
8827 var = build_stmt (DECL_SOURCE_LOCATION (var), DECL_EXPR, var);
8828 stmt_list = VEC_index (tree, stmt_list_stack,
8829 VEC_length (tree, stmt_list_stack) - 1 - skip);
8830 gcc_assert (stmt_list);
8831 append_to_statement_list_force (var, &stmt_list);
8834 /* We've just finished processing a lambda; if the containing scope is also
8835 a lambda, insert any capture proxies that were created while processing
8836 the nested lambda. */
8839 insert_pending_capture_proxies (void)
8842 VEC(tree,gc) *proxies;
8845 if (!current_function_decl || !LAMBDA_FUNCTION_P (current_function_decl))
8848 lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
8849 proxies = LAMBDA_EXPR_PENDING_PROXIES (lam);
8850 for (i = 0; i < VEC_length (tree, proxies); ++i)
8852 tree var = VEC_index (tree, proxies, i);
8853 insert_capture_proxy (var);
8855 release_tree_vector (LAMBDA_EXPR_PENDING_PROXIES (lam));
8856 LAMBDA_EXPR_PENDING_PROXIES (lam) = NULL;
8859 /* Given REF, a COMPONENT_REF designating a field in the lambda closure,
8860 return the type we want the proxy to have: the type of the field itself,
8861 with added const-qualification if the lambda isn't mutable and the
8862 capture is by value. */
8865 lambda_proxy_type (tree ref)
8868 if (REFERENCE_REF_P (ref))
8869 ref = TREE_OPERAND (ref, 0);
8870 type = TREE_TYPE (ref);
8871 if (!dependent_type_p (type))
8873 type = cxx_make_type (DECLTYPE_TYPE);
8874 DECLTYPE_TYPE_EXPR (type) = ref;
8875 DECLTYPE_FOR_LAMBDA_PROXY (type) = true;
8876 SET_TYPE_STRUCTURAL_EQUALITY (type);
8880 /* MEMBER is a capture field in a lambda closure class. Now that we're
8881 inside the operator(), build a placeholder var for future lookups and
8885 build_capture_proxy (tree member)
8887 tree var, object, fn, closure, name, lam, type;
8889 closure = DECL_CONTEXT (member);
8890 fn = lambda_function (closure);
8891 lam = CLASSTYPE_LAMBDA_EXPR (closure);
8893 /* The proxy variable forwards to the capture field. */
8894 object = build_fold_indirect_ref (DECL_ARGUMENTS (fn));
8895 object = finish_non_static_data_member (member, object, NULL_TREE);
8896 if (REFERENCE_REF_P (object))
8897 object = TREE_OPERAND (object, 0);
8899 /* Remove the __ inserted by add_capture. */
8900 name = get_identifier (IDENTIFIER_POINTER (DECL_NAME (member)) + 2);
8902 type = lambda_proxy_type (object);
8903 var = build_decl (input_location, VAR_DECL, name, type);
8904 SET_DECL_VALUE_EXPR (var, object);
8905 DECL_HAS_VALUE_EXPR_P (var) = 1;
8906 DECL_ARTIFICIAL (var) = 1;
8907 TREE_USED (var) = 1;
8908 DECL_CONTEXT (var) = fn;
8910 if (name == this_identifier)
8912 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (lam) == member);
8913 LAMBDA_EXPR_THIS_CAPTURE (lam) = var;
8916 if (fn == current_function_decl)
8917 insert_capture_proxy (var);
8919 VEC_safe_push (tree, gc, LAMBDA_EXPR_PENDING_PROXIES (lam), var);
8924 /* From an ID and INITIALIZER, create a capture (by reference if
8925 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
8929 add_capture (tree lambda, tree id, tree initializer, bool by_reference_p,
8930 bool explicit_init_p)
8933 tree type, member, name;
8935 type = lambda_capture_field_type (initializer);
8938 type = build_reference_type (type);
8939 if (!real_lvalue_p (initializer))
8940 error ("cannot capture %qE by reference", initializer);
8943 /* Capture by copy requires a complete type. */
8944 type = complete_type (type);
8946 /* Add __ to the beginning of the field name so that user code
8947 won't find the field with name lookup. We can't just leave the name
8948 unset because template instantiation uses the name to find
8949 instantiated fields. */
8950 buf = (char *) alloca (IDENTIFIER_LENGTH (id) + 3);
8951 buf[1] = buf[0] = '_';
8952 memcpy (buf + 2, IDENTIFIER_POINTER (id),
8953 IDENTIFIER_LENGTH (id) + 1);
8954 name = get_identifier (buf);
8956 /* If TREE_TYPE isn't set, we're still in the introducer, so check
8958 if (!LAMBDA_EXPR_CLOSURE (lambda))
8960 if (IDENTIFIER_MARKED (name))
8962 pedwarn (input_location, 0,
8963 "already captured %qD in lambda expression", id);
8966 IDENTIFIER_MARKED (name) = true;
8969 /* Make member variable. */
8970 member = build_lang_decl (FIELD_DECL, name, type);
8972 if (!explicit_init_p)
8973 /* Normal captures are invisible to name lookup but uses are replaced
8974 with references to the capture field; we implement this by only
8975 really making them invisible in unevaluated context; see
8976 qualify_lookup. For now, let's make explicitly initialized captures
8978 DECL_NORMAL_CAPTURE_P (member) = true;
8980 if (id == this_identifier)
8981 LAMBDA_EXPR_THIS_CAPTURE (lambda) = member;
8983 /* Add it to the appropriate closure class if we've started it. */
8984 if (current_class_type
8985 && current_class_type == LAMBDA_EXPR_CLOSURE (lambda))
8986 finish_member_declaration (member);
8988 LAMBDA_EXPR_CAPTURE_LIST (lambda)
8989 = tree_cons (member, initializer, LAMBDA_EXPR_CAPTURE_LIST (lambda));
8991 if (LAMBDA_EXPR_CLOSURE (lambda))
8992 return build_capture_proxy (member);
8993 /* For explicit captures we haven't started the function yet, so we wait
8994 and build the proxy from cp_parser_lambda_body. */
8998 /* Register all the capture members on the list CAPTURES, which is the
8999 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
9002 register_capture_members (tree captures)
9004 if (captures == NULL_TREE)
9007 register_capture_members (TREE_CHAIN (captures));
9008 /* We set this in add_capture to avoid duplicates. */
9009 IDENTIFIER_MARKED (DECL_NAME (TREE_PURPOSE (captures))) = false;
9010 finish_member_declaration (TREE_PURPOSE (captures));
9013 /* Similar to add_capture, except this works on a stack of nested lambdas.
9014 BY_REFERENCE_P in this case is derived from the default capture mode.
9015 Returns the capture for the lambda at the bottom of the stack. */
9018 add_default_capture (tree lambda_stack, tree id, tree initializer)
9020 bool this_capture_p = (id == this_identifier);
9022 tree var = NULL_TREE;
9024 tree saved_class_type = current_class_type;
9028 for (node = lambda_stack;
9030 node = TREE_CHAIN (node))
9032 tree lambda = TREE_VALUE (node);
9034 current_class_type = LAMBDA_EXPR_CLOSURE (lambda);
9035 var = add_capture (lambda,
9040 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda)
9041 == CPLD_REFERENCE)),
9042 /*explicit_init_p=*/false);
9043 initializer = convert_from_reference (var);
9046 current_class_type = saved_class_type;
9051 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
9052 INDIRECT_REF, possibly adding it through default capturing. */
9055 lambda_expr_this_capture (tree lambda)
9059 tree this_capture = LAMBDA_EXPR_THIS_CAPTURE (lambda);
9061 /* Try to default capture 'this' if we can. */
9063 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) != CPLD_NONE)
9065 tree containing_function = TYPE_CONTEXT (LAMBDA_EXPR_CLOSURE (lambda));
9066 tree lambda_stack = tree_cons (NULL_TREE, lambda, NULL_TREE);
9067 tree init = NULL_TREE;
9069 /* If we are in a lambda function, we can move out until we hit:
9070 1. a non-lambda function,
9071 2. a lambda function capturing 'this', or
9072 3. a non-default capturing lambda function. */
9073 while (LAMBDA_FUNCTION_P (containing_function))
9076 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function));
9078 if (LAMBDA_EXPR_THIS_CAPTURE (lambda))
9080 /* An outer lambda has already captured 'this'. */
9081 init = LAMBDA_EXPR_THIS_CAPTURE (lambda);
9085 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) == CPLD_NONE)
9086 /* An outer lambda won't let us capture 'this'. */
9089 lambda_stack = tree_cons (NULL_TREE,
9093 containing_function = decl_function_context (containing_function);
9096 if (!init && DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function)
9097 && !LAMBDA_FUNCTION_P (containing_function))
9098 /* First parameter is 'this'. */
9099 init = DECL_ARGUMENTS (containing_function);
9102 this_capture = add_default_capture (lambda_stack,
9103 /*id=*/this_identifier,
9109 error ("%<this%> was not captured for this lambda function");
9110 result = error_mark_node;
9114 /* To make sure that current_class_ref is for the lambda. */
9115 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref))
9116 == LAMBDA_EXPR_CLOSURE (lambda));
9118 result = this_capture;
9120 /* If 'this' is captured, each use of 'this' is transformed into an
9121 access to the corresponding unnamed data member of the closure
9122 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
9123 ensures that the transformed expression is an rvalue. ] */
9124 result = rvalue (result);
9130 /* Returns the method basetype of the innermost non-lambda function, or
9131 NULL_TREE if none. */
9134 nonlambda_method_basetype (void)
9137 if (!current_class_ref)
9140 type = current_class_type;
9141 if (!LAMBDA_TYPE_P (type))
9144 /* Find the nearest enclosing non-lambda function. */
9145 fn = TYPE_NAME (type);
9147 fn = decl_function_context (fn);
9148 while (fn && LAMBDA_FUNCTION_P (fn));
9150 if (!fn || !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
9153 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn));
9156 /* If the closure TYPE has a static op(), also add a conversion to function
9160 maybe_add_lambda_conv_op (tree type)
9162 bool nested = (current_function_decl != NULL_TREE);
9163 tree callop = lambda_function (type);
9164 tree rettype, name, fntype, fn, body, compound_stmt;
9165 tree thistype, stattype, statfn, convfn, call, arg;
9166 VEC (tree, gc) *argvec;
9168 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type)) != NULL_TREE)
9171 if (processing_template_decl)
9174 stattype = build_function_type (TREE_TYPE (TREE_TYPE (callop)),
9175 FUNCTION_ARG_CHAIN (callop));
9177 /* First build up the conversion op. */
9179 rettype = build_pointer_type (stattype);
9180 name = mangle_conv_op_name_for_type (rettype);
9181 thistype = cp_build_qualified_type (type, TYPE_QUAL_CONST);
9182 fntype = build_method_type_directly (thistype, rettype, void_list_node);
9183 fn = convfn = build_lang_decl (FUNCTION_DECL, name, fntype);
9184 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
9186 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
9187 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
9188 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
9190 SET_OVERLOADED_OPERATOR_CODE (fn, TYPE_EXPR);
9191 grokclassfn (type, fn, NO_SPECIAL);
9192 set_linkage_according_to_type (type, fn);
9193 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
9194 DECL_IN_AGGR_P (fn) = 1;
9195 DECL_ARTIFICIAL (fn) = 1;
9196 DECL_NOT_REALLY_EXTERN (fn) = 1;
9197 DECL_DECLARED_INLINE_P (fn) = 1;
9198 DECL_ARGUMENTS (fn) = build_this_parm (fntype, TYPE_QUAL_CONST);
9200 DECL_INTERFACE_KNOWN (fn) = 1;
9202 add_method (type, fn, NULL_TREE);
9204 /* Generic thunk code fails for varargs; we'll complain in mark_used if
9205 the conversion op is used. */
9206 if (varargs_function_p (callop))
9208 DECL_DELETED_FN (fn) = 1;
9212 /* Now build up the thunk to be returned. */
9214 name = get_identifier ("_FUN");
9215 fn = statfn = build_lang_decl (FUNCTION_DECL, name, stattype);
9216 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
9217 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
9218 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
9219 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
9220 grokclassfn (type, fn, NO_SPECIAL);
9221 set_linkage_according_to_type (type, fn);
9222 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
9223 DECL_IN_AGGR_P (fn) = 1;
9224 DECL_ARTIFICIAL (fn) = 1;
9225 DECL_NOT_REALLY_EXTERN (fn) = 1;
9226 DECL_DECLARED_INLINE_P (fn) = 1;
9227 DECL_STATIC_FUNCTION_P (fn) = 1;
9228 DECL_ARGUMENTS (fn) = copy_list (DECL_CHAIN (DECL_ARGUMENTS (callop)));
9229 for (arg = DECL_ARGUMENTS (fn); arg; arg = DECL_CHAIN (arg))
9230 DECL_CONTEXT (arg) = fn;
9232 DECL_INTERFACE_KNOWN (fn) = 1;
9234 add_method (type, fn, NULL_TREE);
9237 push_function_context ();
9239 /* Still increment function_depth so that we don't GC in the
9240 middle of an expression. */
9243 /* Generate the body of the thunk. */
9245 start_preparsed_function (statfn, NULL_TREE,
9246 SF_PRE_PARSED | SF_INCLASS_INLINE);
9247 if (DECL_ONE_ONLY (statfn))
9249 /* Put the thunk in the same comdat group as the call op. */
9250 cgraph_add_to_same_comdat_group (cgraph_get_create_node (statfn),
9251 cgraph_get_create_node (callop));
9253 body = begin_function_body ();
9254 compound_stmt = begin_compound_stmt (0);
9256 arg = build1 (NOP_EXPR, TREE_TYPE (DECL_ARGUMENTS (callop)),
9258 argvec = make_tree_vector ();
9259 VEC_quick_push (tree, argvec, arg);
9260 for (arg = DECL_ARGUMENTS (statfn); arg; arg = DECL_CHAIN (arg))
9262 mark_exp_read (arg);
9263 VEC_safe_push (tree, gc, argvec, arg);
9265 call = build_call_a (callop, VEC_length (tree, argvec),
9266 VEC_address (tree, argvec));
9267 CALL_FROM_THUNK_P (call) = 1;
9268 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call)))
9269 call = build_cplus_new (TREE_TYPE (call), call, tf_warning_or_error);
9270 call = convert_from_reference (call);
9271 finish_return_stmt (call);
9273 finish_compound_stmt (compound_stmt);
9274 finish_function_body (body);
9276 expand_or_defer_fn (finish_function (2));
9278 /* Generate the body of the conversion op. */
9280 start_preparsed_function (convfn, NULL_TREE,
9281 SF_PRE_PARSED | SF_INCLASS_INLINE);
9282 body = begin_function_body ();
9283 compound_stmt = begin_compound_stmt (0);
9285 finish_return_stmt (decay_conversion (statfn));
9287 finish_compound_stmt (compound_stmt);
9288 finish_function_body (body);
9290 expand_or_defer_fn (finish_function (2));
9293 pop_function_context ();
9298 /* Returns true iff VAL is a lambda-related declaration which should
9299 be ignored by unqualified lookup. */
9302 is_lambda_ignored_entity (tree val)
9304 /* In unevaluated context, look past normal capture proxies. */
9305 if (cp_unevaluated_operand && is_normal_capture_proxy (val))
9308 /* Always ignore lambda fields, their names are only for debugging. */
9309 if (TREE_CODE (val) == FIELD_DECL
9310 && CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (val)))
9313 /* None of the lookups that use qualify_lookup want the op() from the
9314 lambda; they want the one from the enclosing class. */
9315 if (TREE_CODE (val) == FUNCTION_DECL && LAMBDA_FUNCTION_P (val))
9321 #include "gt-cp-semantics.h"