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"
41 #include "diagnostic.h"
43 #include "tree-iterator.h"
49 /* There routines provide a modular interface to perform many parsing
50 operations. They may therefore be used during actual parsing, or
51 during template instantiation, which may be regarded as a
52 degenerate form of parsing. */
54 static tree maybe_convert_cond (tree);
55 static tree finalize_nrv_r (tree *, int *, void *);
56 static tree capture_decltype (tree);
57 static tree thisify_lambda_field (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 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1510 enclosed in parentheses. */
1511 PTRMEM_OK_P (expr) = 0;
1513 if (TREE_CODE (expr) == STRING_CST)
1514 PAREN_STRING_LITERAL_P (expr) = 1;
1519 /* Finish a reference to a non-static data member (DECL) that is not
1520 preceded by `.' or `->'. */
1523 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1525 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1529 tree scope = qualifying_scope;
1530 if (scope == NULL_TREE)
1531 scope = context_for_name_lookup (decl);
1532 object = maybe_dummy_object (scope, NULL);
1535 if (object == error_mark_node)
1536 return error_mark_node;
1538 /* DR 613: Can use non-static data members without an associated
1539 object in sizeof/decltype/alignof. */
1540 if (is_dummy_object (object) && cp_unevaluated_operand == 0
1541 && (!processing_template_decl || !current_class_ref))
1543 if (current_function_decl
1544 && DECL_STATIC_FUNCTION_P (current_function_decl))
1545 error ("invalid use of member %q+D in static member function", decl);
1547 error ("invalid use of non-static data member %q+D", decl);
1548 error ("from this location");
1550 return error_mark_node;
1553 if (current_class_ptr)
1554 TREE_USED (current_class_ptr) = 1;
1555 if (processing_template_decl && !qualifying_scope)
1557 tree type = TREE_TYPE (decl);
1559 if (TREE_CODE (type) == REFERENCE_TYPE)
1560 type = TREE_TYPE (type);
1563 /* Set the cv qualifiers. */
1564 int quals = (current_class_ref
1565 ? cp_type_quals (TREE_TYPE (current_class_ref))
1566 : TYPE_UNQUALIFIED);
1568 if (DECL_MUTABLE_P (decl))
1569 quals &= ~TYPE_QUAL_CONST;
1571 quals |= cp_type_quals (TREE_TYPE (decl));
1572 type = cp_build_qualified_type (type, quals);
1575 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1577 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1578 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1580 else if (processing_template_decl)
1581 return build_qualified_name (TREE_TYPE (decl),
1584 /*template_p=*/false);
1587 tree access_type = TREE_TYPE (object);
1589 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1592 /* If the data member was named `C::M', convert `*this' to `C'
1594 if (qualifying_scope)
1596 tree binfo = NULL_TREE;
1597 object = build_scoped_ref (object, qualifying_scope,
1601 return build_class_member_access_expr (object, decl,
1602 /*access_path=*/NULL_TREE,
1603 /*preserve_reference=*/false,
1604 tf_warning_or_error);
1608 /* If we are currently parsing a template and we encountered a typedef
1609 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1610 adds the typedef to a list tied to the current template.
1611 At tempate instantiatin time, that list is walked and access check
1612 performed for each typedef.
1613 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1616 add_typedef_to_current_template_for_access_check (tree typedef_decl,
1618 location_t location)
1620 tree template_info = NULL;
1621 tree cs = current_scope ();
1623 if (!is_typedef_decl (typedef_decl)
1625 || !CLASS_TYPE_P (context)
1629 if (CLASS_TYPE_P (cs) || TREE_CODE (cs) == FUNCTION_DECL)
1630 template_info = get_template_info (cs);
1633 && TI_TEMPLATE (template_info)
1634 && !currently_open_class (context))
1635 append_type_to_template_for_access_check (cs, typedef_decl,
1639 /* DECL was the declaration to which a qualified-id resolved. Issue
1640 an error message if it is not accessible. If OBJECT_TYPE is
1641 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1642 type of `*x', or `x', respectively. If the DECL was named as
1643 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1646 check_accessibility_of_qualified_id (tree decl,
1648 tree nested_name_specifier)
1651 tree qualifying_type = NULL_TREE;
1653 /* If we are parsing a template declaration and if decl is a typedef,
1654 add it to a list tied to the template.
1655 At template instantiation time, that list will be walked and
1656 access check performed. */
1657 add_typedef_to_current_template_for_access_check (decl,
1658 nested_name_specifier
1659 ? nested_name_specifier
1660 : DECL_CONTEXT (decl),
1663 /* If we're not checking, return immediately. */
1664 if (deferred_access_no_check)
1667 /* Determine the SCOPE of DECL. */
1668 scope = context_for_name_lookup (decl);
1669 /* If the SCOPE is not a type, then DECL is not a member. */
1670 if (!TYPE_P (scope))
1672 /* Compute the scope through which DECL is being accessed. */
1674 /* OBJECT_TYPE might not be a class type; consider:
1676 class A { typedef int I; };
1680 In this case, we will have "A::I" as the DECL, but "I" as the
1682 && CLASS_TYPE_P (object_type)
1683 && DERIVED_FROM_P (scope, object_type))
1684 /* If we are processing a `->' or `.' expression, use the type of the
1686 qualifying_type = object_type;
1687 else if (nested_name_specifier)
1689 /* If the reference is to a non-static member of the
1690 current class, treat it as if it were referenced through
1692 if (DECL_NONSTATIC_MEMBER_P (decl)
1693 && current_class_ptr
1694 && DERIVED_FROM_P (scope, current_class_type))
1695 qualifying_type = current_class_type;
1696 /* Otherwise, use the type indicated by the
1697 nested-name-specifier. */
1699 qualifying_type = nested_name_specifier;
1702 /* Otherwise, the name must be from the current class or one of
1704 qualifying_type = currently_open_derived_class (scope);
1707 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1708 or similar in a default argument value. */
1709 && CLASS_TYPE_P (qualifying_type)
1710 && !dependent_type_p (qualifying_type))
1711 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1715 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1716 class named to the left of the "::" operator. DONE is true if this
1717 expression is a complete postfix-expression; it is false if this
1718 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1719 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1720 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1721 is true iff this qualified name appears as a template argument. */
1724 finish_qualified_id_expr (tree qualifying_class,
1729 bool template_arg_p)
1731 gcc_assert (TYPE_P (qualifying_class));
1733 if (error_operand_p (expr))
1734 return error_mark_node;
1736 if (DECL_P (expr) || BASELINK_P (expr))
1740 check_template_keyword (expr);
1742 /* If EXPR occurs as the operand of '&', use special handling that
1743 permits a pointer-to-member. */
1744 if (address_p && done)
1746 if (TREE_CODE (expr) == SCOPE_REF)
1747 expr = TREE_OPERAND (expr, 1);
1748 expr = build_offset_ref (qualifying_class, expr,
1749 /*address_p=*/true);
1753 /* Within the scope of a class, turn references to non-static
1754 members into expression of the form "this->...". */
1756 /* But, within a template argument, we do not want make the
1757 transformation, as there is no "this" pointer. */
1759 else if (TREE_CODE (expr) == FIELD_DECL)
1761 push_deferring_access_checks (dk_no_check);
1762 expr = finish_non_static_data_member (expr, NULL_TREE,
1764 pop_deferring_access_checks ();
1766 else if (BASELINK_P (expr) && !processing_template_decl)
1770 /* See if any of the functions are non-static members. */
1771 /* If so, the expression may be relative to 'this'. */
1772 if (!shared_member_p (expr)
1773 && (ob = maybe_dummy_object (qualifying_class, NULL),
1774 !is_dummy_object (ob)))
1775 expr = (build_class_member_access_expr
1778 BASELINK_ACCESS_BINFO (expr),
1779 /*preserve_reference=*/false,
1780 tf_warning_or_error));
1782 /* The expression is a qualified name whose address is not
1784 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1790 /* Begin a statement-expression. The value returned must be passed to
1791 finish_stmt_expr. */
1794 begin_stmt_expr (void)
1796 return push_stmt_list ();
1799 /* Process the final expression of a statement expression. EXPR can be
1800 NULL, if the final expression is empty. Return a STATEMENT_LIST
1801 containing all the statements in the statement-expression, or
1802 ERROR_MARK_NODE if there was an error. */
1805 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1807 if (error_operand_p (expr))
1809 /* The type of the statement-expression is the type of the last
1811 TREE_TYPE (stmt_expr) = error_mark_node;
1812 return error_mark_node;
1815 /* If the last statement does not have "void" type, then the value
1816 of the last statement is the value of the entire expression. */
1819 tree type = TREE_TYPE (expr);
1821 if (processing_template_decl)
1823 expr = build_stmt (input_location, EXPR_STMT, expr);
1824 expr = add_stmt (expr);
1825 /* Mark the last statement so that we can recognize it as such at
1826 template-instantiation time. */
1827 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1829 else if (VOID_TYPE_P (type))
1831 /* Just treat this like an ordinary statement. */
1832 expr = finish_expr_stmt (expr);
1836 /* It actually has a value we need to deal with. First, force it
1837 to be an rvalue so that we won't need to build up a copy
1838 constructor call later when we try to assign it to something. */
1839 expr = force_rvalue (expr, tf_warning_or_error);
1840 if (error_operand_p (expr))
1841 return error_mark_node;
1843 /* Update for array-to-pointer decay. */
1844 type = TREE_TYPE (expr);
1846 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1847 normal statement, but don't convert to void or actually add
1849 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1850 expr = maybe_cleanup_point_expr (expr);
1854 /* The type of the statement-expression is the type of the last
1856 TREE_TYPE (stmt_expr) = type;
1862 /* Finish a statement-expression. EXPR should be the value returned
1863 by the previous begin_stmt_expr. Returns an expression
1864 representing the statement-expression. */
1867 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1872 if (error_operand_p (stmt_expr))
1874 pop_stmt_list (stmt_expr);
1875 return error_mark_node;
1878 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1880 type = TREE_TYPE (stmt_expr);
1881 result = pop_stmt_list (stmt_expr);
1882 TREE_TYPE (result) = type;
1884 if (processing_template_decl)
1886 result = build_min (STMT_EXPR, type, result);
1887 TREE_SIDE_EFFECTS (result) = 1;
1888 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1890 else if (CLASS_TYPE_P (type))
1892 /* Wrap the statement-expression in a TARGET_EXPR so that the
1893 temporary object created by the final expression is destroyed at
1894 the end of the full-expression containing the
1895 statement-expression. */
1896 result = force_target_expr (type, result, tf_warning_or_error);
1902 /* Returns the expression which provides the value of STMT_EXPR. */
1905 stmt_expr_value_expr (tree stmt_expr)
1907 tree t = STMT_EXPR_STMT (stmt_expr);
1909 if (TREE_CODE (t) == BIND_EXPR)
1910 t = BIND_EXPR_BODY (t);
1912 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1913 t = STATEMENT_LIST_TAIL (t)->stmt;
1915 if (TREE_CODE (t) == EXPR_STMT)
1916 t = EXPR_STMT_EXPR (t);
1921 /* Return TRUE iff EXPR_STMT is an empty list of
1922 expression statements. */
1925 empty_expr_stmt_p (tree expr_stmt)
1927 tree body = NULL_TREE;
1929 if (expr_stmt == void_zero_node)
1934 if (TREE_CODE (expr_stmt) == EXPR_STMT)
1935 body = EXPR_STMT_EXPR (expr_stmt);
1936 else if (TREE_CODE (expr_stmt) == STATEMENT_LIST)
1942 if (TREE_CODE (body) == STATEMENT_LIST)
1943 return tsi_end_p (tsi_start (body));
1945 return empty_expr_stmt_p (body);
1950 /* Perform Koenig lookup. FN is the postfix-expression representing
1951 the function (or functions) to call; ARGS are the arguments to the
1952 call; if INCLUDE_STD then the `std' namespace is automatically
1953 considered an associated namespace (used in range-based for loops).
1954 Returns the functions to be considered by overload resolution. */
1957 perform_koenig_lookup (tree fn, VEC(tree,gc) *args, bool include_std,
1958 tsubst_flags_t complain)
1960 tree identifier = NULL_TREE;
1961 tree functions = NULL_TREE;
1962 tree tmpl_args = NULL_TREE;
1963 bool template_id = false;
1965 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1967 /* Use a separate flag to handle null args. */
1969 tmpl_args = TREE_OPERAND (fn, 1);
1970 fn = TREE_OPERAND (fn, 0);
1973 /* Find the name of the overloaded function. */
1974 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1976 else if (is_overloaded_fn (fn))
1979 identifier = DECL_NAME (get_first_fn (functions));
1981 else if (DECL_P (fn))
1984 identifier = DECL_NAME (fn);
1987 /* A call to a namespace-scope function using an unqualified name.
1989 Do Koenig lookup -- unless any of the arguments are
1991 if (!any_type_dependent_arguments_p (args)
1992 && !any_dependent_template_arguments_p (tmpl_args))
1994 fn = lookup_arg_dependent (identifier, functions, args, include_std);
1997 /* The unqualified name could not be resolved. */
1999 fn = unqualified_fn_lookup_error (identifier);
2005 if (fn && template_id)
2006 fn = build2 (TEMPLATE_ID_EXPR, unknown_type_node, fn, tmpl_args);
2011 /* Generate an expression for `FN (ARGS)'. This may change the
2014 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2015 as a virtual call, even if FN is virtual. (This flag is set when
2016 encountering an expression where the function name is explicitly
2017 qualified. For example a call to `X::f' never generates a virtual
2020 Returns code for the call. */
2023 finish_call_expr (tree fn, VEC(tree,gc) **args, bool disallow_virtual,
2024 bool koenig_p, tsubst_flags_t complain)
2028 VEC(tree,gc) *orig_args = NULL;
2030 if (fn == error_mark_node)
2031 return error_mark_node;
2033 gcc_assert (!TYPE_P (fn));
2037 if (processing_template_decl)
2039 /* If the call expression is dependent, build a CALL_EXPR node
2040 with no type; type_dependent_expression_p recognizes
2041 expressions with no type as being dependent. */
2042 if (type_dependent_expression_p (fn)
2043 || any_type_dependent_arguments_p (*args)
2044 /* For a non-static member function, we need to specifically
2045 test the type dependency of the "this" pointer because it
2046 is not included in *ARGS even though it is considered to
2047 be part of the list of arguments. Note that this is
2048 related to CWG issues 515 and 1005. */
2049 || (non_static_member_function_p (fn)
2050 && current_class_ref
2051 && type_dependent_expression_p (current_class_ref)))
2053 result = build_nt_call_vec (fn, *args);
2054 KOENIG_LOOKUP_P (result) = koenig_p;
2059 tree fndecl = OVL_CURRENT (fn);
2060 if (TREE_CODE (fndecl) != FUNCTION_DECL
2061 || !TREE_THIS_VOLATILE (fndecl))
2067 current_function_returns_abnormally = 1;
2071 orig_args = make_tree_vector_copy (*args);
2072 if (!BASELINK_P (fn)
2073 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
2074 && TREE_TYPE (fn) != unknown_type_node)
2075 fn = build_non_dependent_expr (fn);
2076 make_args_non_dependent (*args);
2079 if (TREE_CODE (fn) == COMPONENT_REF)
2081 tree member = TREE_OPERAND (fn, 1);
2082 if (BASELINK_P (member))
2084 tree object = TREE_OPERAND (fn, 0);
2085 return build_new_method_call (object, member,
2088 ? LOOKUP_NORMAL | LOOKUP_NONVIRTUAL
2095 if (is_overloaded_fn (fn))
2096 fn = baselink_for_fns (fn);
2099 if (BASELINK_P (fn))
2103 /* A call to a member function. From [over.call.func]:
2105 If the keyword this is in scope and refers to the class of
2106 that member function, or a derived class thereof, then the
2107 function call is transformed into a qualified function call
2108 using (*this) as the postfix-expression to the left of the
2109 . operator.... [Otherwise] a contrived object of type T
2110 becomes the implied object argument.
2114 struct A { void f(); };
2115 struct B : public A {};
2116 struct C : public A { void g() { B::f(); }};
2118 "the class of that member function" refers to `A'. But 11.2
2119 [class.access.base] says that we need to convert 'this' to B* as
2120 part of the access, so we pass 'B' to maybe_dummy_object. */
2122 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
2125 if (processing_template_decl)
2127 if (type_dependent_expression_p (object))
2129 tree ret = build_nt_call_vec (orig_fn, orig_args);
2130 release_tree_vector (orig_args);
2133 object = build_non_dependent_expr (object);
2136 result = build_new_method_call (object, fn, args, NULL_TREE,
2138 ? LOOKUP_NORMAL|LOOKUP_NONVIRTUAL
2143 else if (is_overloaded_fn (fn))
2145 /* If the function is an overloaded builtin, resolve it. */
2146 if (TREE_CODE (fn) == FUNCTION_DECL
2147 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2148 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
2149 result = resolve_overloaded_builtin (input_location, fn, *args);
2152 /* A call to a namespace-scope function. */
2153 result = build_new_function_call (fn, args, koenig_p, complain);
2155 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
2157 if (!VEC_empty (tree, *args))
2158 error ("arguments to destructor are not allowed");
2159 /* Mark the pseudo-destructor call as having side-effects so
2160 that we do not issue warnings about its use. */
2161 result = build1 (NOP_EXPR,
2163 TREE_OPERAND (fn, 0));
2164 TREE_SIDE_EFFECTS (result) = 1;
2166 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
2167 /* If the "function" is really an object of class type, it might
2168 have an overloaded `operator ()'. */
2169 result = build_op_call (fn, args, complain);
2172 /* A call where the function is unknown. */
2173 result = cp_build_function_call_vec (fn, args, complain);
2175 if (processing_template_decl && result != error_mark_node)
2177 if (TREE_CODE (result) == INDIRECT_REF)
2178 result = TREE_OPERAND (result, 0);
2179 result = build_call_vec (TREE_TYPE (result), orig_fn, orig_args);
2180 SET_EXPR_LOCATION (result, input_location);
2181 KOENIG_LOOKUP_P (result) = koenig_p;
2182 release_tree_vector (orig_args);
2183 result = convert_from_reference (result);
2188 /* Free garbage OVERLOADs from arg-dependent lookup. */
2189 tree next = NULL_TREE;
2191 fn && TREE_CODE (fn) == OVERLOAD && OVL_ARG_DEPENDENT (fn);
2194 if (processing_template_decl)
2195 /* In a template, we'll re-use them at instantiation time. */
2196 OVL_ARG_DEPENDENT (fn) = false;
2199 next = OVL_CHAIN (fn);
2208 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2209 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2210 POSTDECREMENT_EXPR.) */
2213 finish_increment_expr (tree expr, enum tree_code code)
2215 return build_x_unary_op (code, expr, tf_warning_or_error);
2218 /* Finish a use of `this'. Returns an expression for `this'. */
2221 finish_this_expr (void)
2225 if (current_class_ptr)
2227 tree type = TREE_TYPE (current_class_ref);
2229 /* In a lambda expression, 'this' refers to the captured 'this'. */
2230 if (LAMBDA_TYPE_P (type))
2231 result = lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type));
2233 result = current_class_ptr;
2236 else if (current_function_decl
2237 && DECL_STATIC_FUNCTION_P (current_function_decl))
2239 error ("%<this%> is unavailable for static member functions");
2240 result = error_mark_node;
2244 if (current_function_decl)
2245 error ("invalid use of %<this%> in non-member function");
2247 error ("invalid use of %<this%> at top level");
2248 result = error_mark_node;
2254 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2255 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2256 the TYPE for the type given. If SCOPE is non-NULL, the expression
2257 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2260 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2262 if (object == error_mark_node || destructor == error_mark_node)
2263 return error_mark_node;
2265 gcc_assert (TYPE_P (destructor));
2267 if (!processing_template_decl)
2269 if (scope == error_mark_node)
2271 error ("invalid qualifying scope in pseudo-destructor name");
2272 return error_mark_node;
2274 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2276 error ("qualified type %qT does not match destructor name ~%qT",
2278 return error_mark_node;
2282 /* [expr.pseudo] says both:
2284 The type designated by the pseudo-destructor-name shall be
2285 the same as the object type.
2289 The cv-unqualified versions of the object type and of the
2290 type designated by the pseudo-destructor-name shall be the
2293 We implement the more generous second sentence, since that is
2294 what most other compilers do. */
2295 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2298 error ("%qE is not of type %qT", object, destructor);
2299 return error_mark_node;
2303 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2306 /* Finish an expression of the form CODE EXPR. */
2309 finish_unary_op_expr (enum tree_code code, tree expr)
2311 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2312 /* Inside a template, build_x_unary_op does not fold the
2313 expression. So check whether the result is folded before
2314 setting TREE_NEGATED_INT. */
2315 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2316 && TREE_CODE (result) == INTEGER_CST
2317 && !TYPE_UNSIGNED (TREE_TYPE (result))
2318 && INT_CST_LT (result, integer_zero_node))
2320 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2321 setting TREE_NEGATED_INT. */
2322 result = copy_node (result);
2323 TREE_NEGATED_INT (result) = 1;
2325 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2326 overflow_warning (input_location, result);
2331 /* Finish a compound-literal expression. TYPE is the type to which
2332 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2335 finish_compound_literal (tree type, tree compound_literal,
2336 tsubst_flags_t complain)
2338 if (type == error_mark_node)
2339 return error_mark_node;
2341 if (TREE_CODE (type) == REFERENCE_TYPE)
2344 = finish_compound_literal (TREE_TYPE (type), compound_literal,
2346 return cp_build_c_cast (type, compound_literal, complain);
2349 if (!TYPE_OBJ_P (type))
2351 if (complain & tf_error)
2352 error ("compound literal of non-object type %qT", type);
2353 return error_mark_node;
2356 if (processing_template_decl)
2358 TREE_TYPE (compound_literal) = type;
2359 /* Mark the expression as a compound literal. */
2360 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2361 return compound_literal;
2364 type = complete_type (type);
2366 if (TYPE_NON_AGGREGATE_CLASS (type))
2368 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2369 everywhere that deals with function arguments would be a pain, so
2370 just wrap it in a TREE_LIST. The parser set a flag so we know
2371 that it came from T{} rather than T({}). */
2372 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2373 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2374 return build_functional_cast (type, compound_literal, complain);
2377 if (TREE_CODE (type) == ARRAY_TYPE
2378 && check_array_initializer (NULL_TREE, type, compound_literal))
2379 return error_mark_node;
2380 compound_literal = reshape_init (type, compound_literal, complain);
2381 if (TREE_CODE (type) == ARRAY_TYPE
2382 && TYPE_DOMAIN (type) == NULL_TREE)
2384 cp_complete_array_type_or_error (&type, compound_literal,
2386 if (type == error_mark_node)
2387 return error_mark_node;
2389 compound_literal = digest_init (type, compound_literal, complain);
2390 if (TREE_CODE (compound_literal) == CONSTRUCTOR)
2391 TREE_HAS_CONSTRUCTOR (compound_literal) = true;
2392 /* Put static/constant array temporaries in static variables, but always
2393 represent class temporaries with TARGET_EXPR so we elide copies. */
2394 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type))
2395 && TREE_CODE (type) == ARRAY_TYPE
2396 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2397 && initializer_constant_valid_p (compound_literal, type))
2399 tree decl = create_temporary_var (type);
2400 DECL_INITIAL (decl) = compound_literal;
2401 TREE_STATIC (decl) = 1;
2402 if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type))
2404 /* 5.19 says that a constant expression can include an
2405 lvalue-rvalue conversion applied to "a glvalue of literal type
2406 that refers to a non-volatile temporary object initialized
2407 with a constant expression". Rather than try to communicate
2408 that this VAR_DECL is a temporary, just mark it constexpr. */
2409 DECL_DECLARED_CONSTEXPR_P (decl) = true;
2410 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true;
2411 TREE_CONSTANT (decl) = true;
2413 cp_apply_type_quals_to_decl (cp_type_quals (type), decl);
2414 decl = pushdecl_top_level (decl);
2415 DECL_NAME (decl) = make_anon_name ();
2416 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2420 return get_target_expr_sfinae (compound_literal, complain);
2423 /* Return the declaration for the function-name variable indicated by
2427 finish_fname (tree id)
2431 decl = fname_decl (input_location, C_RID_CODE (id), id);
2432 if (processing_template_decl && current_function_decl)
2433 decl = DECL_NAME (decl);
2437 /* Finish a translation unit. */
2440 finish_translation_unit (void)
2442 /* In case there were missing closebraces,
2443 get us back to the global binding level. */
2445 while (current_namespace != global_namespace)
2448 /* Do file scope __FUNCTION__ et al. */
2449 finish_fname_decls ();
2452 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2453 Returns the parameter. */
2456 finish_template_type_parm (tree aggr, tree identifier)
2458 if (aggr != class_type_node)
2460 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2461 aggr = class_type_node;
2464 return build_tree_list (aggr, identifier);
2467 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2468 Returns the parameter. */
2471 finish_template_template_parm (tree aggr, tree identifier)
2473 tree decl = build_decl (input_location,
2474 TYPE_DECL, identifier, NULL_TREE);
2475 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2476 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2477 DECL_TEMPLATE_RESULT (tmpl) = decl;
2478 DECL_ARTIFICIAL (decl) = 1;
2479 end_template_decl ();
2481 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2483 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2484 /*is_primary=*/true, /*is_partial=*/false,
2487 return finish_template_type_parm (aggr, tmpl);
2490 /* ARGUMENT is the default-argument value for a template template
2491 parameter. If ARGUMENT is invalid, issue error messages and return
2492 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2495 check_template_template_default_arg (tree argument)
2497 if (TREE_CODE (argument) != TEMPLATE_DECL
2498 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2499 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2501 if (TREE_CODE (argument) == TYPE_DECL)
2502 error ("invalid use of type %qT as a default value for a template "
2503 "template-parameter", TREE_TYPE (argument));
2505 error ("invalid default argument for a template template parameter");
2506 return error_mark_node;
2512 /* Begin a class definition, as indicated by T. */
2515 begin_class_definition (tree t, tree attributes)
2517 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2518 return error_mark_node;
2520 if (processing_template_parmlist)
2522 error ("definition of %q#T inside template parameter list", t);
2523 return error_mark_node;
2526 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2527 are passed the same as decimal scalar types. */
2528 if (TREE_CODE (t) == RECORD_TYPE
2529 && !processing_template_decl)
2531 tree ns = TYPE_CONTEXT (t);
2532 if (ns && TREE_CODE (ns) == NAMESPACE_DECL
2533 && DECL_CONTEXT (ns) == std_node
2535 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns)), "decimal"))
2537 const char *n = TYPE_NAME_STRING (t);
2538 if ((strcmp (n, "decimal32") == 0)
2539 || (strcmp (n, "decimal64") == 0)
2540 || (strcmp (n, "decimal128") == 0))
2541 TYPE_TRANSPARENT_AGGR (t) = 1;
2545 /* A non-implicit typename comes from code like:
2547 template <typename T> struct A {
2548 template <typename U> struct A<T>::B ...
2550 This is erroneous. */
2551 else if (TREE_CODE (t) == TYPENAME_TYPE)
2553 error ("invalid definition of qualified type %qT", t);
2554 t = error_mark_node;
2557 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2559 t = make_class_type (RECORD_TYPE);
2560 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2563 if (TYPE_BEING_DEFINED (t))
2565 t = make_class_type (TREE_CODE (t));
2566 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2568 maybe_process_partial_specialization (t);
2570 TYPE_BEING_DEFINED (t) = 1;
2572 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2573 fixup_attribute_variants (t);
2575 if (flag_pack_struct)
2578 TYPE_PACKED (t) = 1;
2579 /* Even though the type is being defined for the first time
2580 here, there might have been a forward declaration, so there
2581 might be cv-qualified variants of T. */
2582 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2583 TYPE_PACKED (v) = 1;
2585 /* Reset the interface data, at the earliest possible
2586 moment, as it might have been set via a class foo;
2588 if (! TYPE_ANONYMOUS_P (t))
2590 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2591 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2592 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2593 (t, finfo->interface_unknown);
2595 reset_specialization();
2597 /* Make a declaration for this class in its own scope. */
2598 build_self_reference ();
2603 /* Finish the member declaration given by DECL. */
2606 finish_member_declaration (tree decl)
2608 if (decl == error_mark_node || decl == NULL_TREE)
2611 if (decl == void_type_node)
2612 /* The COMPONENT was a friend, not a member, and so there's
2613 nothing for us to do. */
2616 /* We should see only one DECL at a time. */
2617 gcc_assert (DECL_CHAIN (decl) == NULL_TREE);
2619 /* Set up access control for DECL. */
2621 = (current_access_specifier == access_private_node);
2622 TREE_PROTECTED (decl)
2623 = (current_access_specifier == access_protected_node);
2624 if (TREE_CODE (decl) == TEMPLATE_DECL)
2626 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2627 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2630 /* Mark the DECL as a member of the current class. */
2631 DECL_CONTEXT (decl) = current_class_type;
2633 /* Check for bare parameter packs in the member variable declaration. */
2634 if (TREE_CODE (decl) == FIELD_DECL)
2636 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2637 TREE_TYPE (decl) = error_mark_node;
2638 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2639 DECL_ATTRIBUTES (decl) = NULL_TREE;
2644 A C language linkage is ignored for the names of class members
2645 and the member function type of class member functions. */
2646 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2647 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2649 /* Put functions on the TYPE_METHODS list and everything else on the
2650 TYPE_FIELDS list. Note that these are built up in reverse order.
2651 We reverse them (to obtain declaration order) in finish_struct. */
2652 if (TREE_CODE (decl) == FUNCTION_DECL
2653 || DECL_FUNCTION_TEMPLATE_P (decl))
2655 /* We also need to add this function to the
2656 CLASSTYPE_METHOD_VEC. */
2657 if (add_method (current_class_type, decl, NULL_TREE))
2659 DECL_CHAIN (decl) = TYPE_METHODS (current_class_type);
2660 TYPE_METHODS (current_class_type) = decl;
2662 maybe_add_class_template_decl_list (current_class_type, decl,
2666 /* Enter the DECL into the scope of the class. */
2667 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2668 || pushdecl_class_level (decl))
2670 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2671 go at the beginning. The reason is that lookup_field_1
2672 searches the list in order, and we want a field name to
2673 override a type name so that the "struct stat hack" will
2674 work. In particular:
2676 struct S { enum E { }; int E } s;
2679 is valid. In addition, the FIELD_DECLs must be maintained in
2680 declaration order so that class layout works as expected.
2681 However, we don't need that order until class layout, so we
2682 save a little time by putting FIELD_DECLs on in reverse order
2683 here, and then reversing them in finish_struct_1. (We could
2684 also keep a pointer to the correct insertion points in the
2687 if (TREE_CODE (decl) == TYPE_DECL)
2688 TYPE_FIELDS (current_class_type)
2689 = chainon (TYPE_FIELDS (current_class_type), decl);
2692 DECL_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2693 TYPE_FIELDS (current_class_type) = decl;
2696 maybe_add_class_template_decl_list (current_class_type, decl,
2701 note_decl_for_pch (decl);
2704 /* DECL has been declared while we are building a PCH file. Perform
2705 actions that we might normally undertake lazily, but which can be
2706 performed now so that they do not have to be performed in
2707 translation units which include the PCH file. */
2710 note_decl_for_pch (tree decl)
2712 gcc_assert (pch_file);
2714 /* There's a good chance that we'll have to mangle names at some
2715 point, even if only for emission in debugging information. */
2716 if ((TREE_CODE (decl) == VAR_DECL
2717 || TREE_CODE (decl) == FUNCTION_DECL)
2718 && !processing_template_decl)
2722 /* Finish processing a complete template declaration. The PARMS are
2723 the template parameters. */
2726 finish_template_decl (tree parms)
2729 end_template_decl ();
2731 end_specialization ();
2734 /* Finish processing a template-id (which names a type) of the form
2735 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2736 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2737 the scope of template-id indicated. */
2740 finish_template_type (tree name, tree args, int entering_scope)
2744 decl = lookup_template_class (name, args,
2745 NULL_TREE, NULL_TREE, entering_scope,
2746 tf_warning_or_error | tf_user);
2747 if (decl != error_mark_node)
2748 decl = TYPE_STUB_DECL (decl);
2753 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2754 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2755 BASE_CLASS, or NULL_TREE if an error occurred. The
2756 ACCESS_SPECIFIER is one of
2757 access_{default,public,protected_private}_node. For a virtual base
2758 we set TREE_TYPE. */
2761 finish_base_specifier (tree base, tree access, bool virtual_p)
2765 if (base == error_mark_node)
2767 error ("invalid base-class specification");
2770 else if (! MAYBE_CLASS_TYPE_P (base))
2772 error ("%qT is not a class type", base);
2777 if (cp_type_quals (base) != 0)
2779 /* DR 484: Can a base-specifier name a cv-qualified
2781 base = TYPE_MAIN_VARIANT (base);
2783 result = build_tree_list (access, base);
2785 TREE_TYPE (result) = integer_type_node;
2791 /* If FNS is a member function, a set of member functions, or a
2792 template-id referring to one or more member functions, return a
2793 BASELINK for FNS, incorporating the current access context.
2794 Otherwise, return FNS unchanged. */
2797 baselink_for_fns (tree fns)
2802 if (BASELINK_P (fns)
2803 || error_operand_p (fns))
2807 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2808 fn = TREE_OPERAND (fn, 0);
2809 fn = get_first_fn (fn);
2810 if (!DECL_FUNCTION_MEMBER_P (fn))
2813 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2815 cl = DECL_CONTEXT (fn);
2816 cl = TYPE_BINFO (cl);
2817 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2820 /* Returns true iff DECL is an automatic variable from a function outside
2824 outer_automatic_var_p (tree decl)
2826 return ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2827 && DECL_FUNCTION_SCOPE_P (decl)
2828 && !TREE_STATIC (decl)
2829 && DECL_CONTEXT (decl) != current_function_decl);
2832 /* Returns true iff DECL is a capture field from a lambda that is not our
2833 immediate context. */
2836 outer_lambda_capture_p (tree decl)
2838 return (TREE_CODE (decl) == FIELD_DECL
2839 && LAMBDA_TYPE_P (DECL_CONTEXT (decl))
2840 && (!current_class_type
2841 || !DERIVED_FROM_P (DECL_CONTEXT (decl), current_class_type)));
2844 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2845 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2846 if non-NULL, is the type or namespace used to explicitly qualify
2847 ID_EXPRESSION. DECL is the entity to which that name has been
2850 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2851 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2852 be set to true if this expression isn't permitted in a
2853 constant-expression, but it is otherwise not set by this function.
2854 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2855 constant-expression, but a non-constant expression is also
2858 DONE is true if this expression is a complete postfix-expression;
2859 it is false if this expression is followed by '->', '[', '(', etc.
2860 ADDRESS_P is true iff this expression is the operand of '&'.
2861 TEMPLATE_P is true iff the qualified-id was of the form
2862 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2863 appears as a template argument.
2865 If an error occurs, and it is the kind of error that might cause
2866 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2867 is the caller's responsibility to issue the message. *ERROR_MSG
2868 will be a string with static storage duration, so the caller need
2871 Return an expression for the entity, after issuing appropriate
2872 diagnostics. This function is also responsible for transforming a
2873 reference to a non-static member into a COMPONENT_REF that makes
2874 the use of "this" explicit.
2876 Upon return, *IDK will be filled in appropriately. */
2878 finish_id_expression (tree id_expression,
2882 bool integral_constant_expression_p,
2883 bool allow_non_integral_constant_expression_p,
2884 bool *non_integral_constant_expression_p,
2888 bool template_arg_p,
2889 const char **error_msg,
2890 location_t location)
2892 /* Initialize the output parameters. */
2893 *idk = CP_ID_KIND_NONE;
2896 if (id_expression == error_mark_node)
2897 return error_mark_node;
2898 /* If we have a template-id, then no further lookup is
2899 required. If the template-id was for a template-class, we
2900 will sometimes have a TYPE_DECL at this point. */
2901 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2902 || TREE_CODE (decl) == TYPE_DECL)
2904 /* Look up the name. */
2907 if (decl == error_mark_node)
2909 /* Name lookup failed. */
2912 || (!dependent_type_p (scope)
2913 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2914 && IDENTIFIER_TYPENAME_P (id_expression)
2915 && dependent_type_p (TREE_TYPE (id_expression))))))
2917 /* If the qualifying type is non-dependent (and the name
2918 does not name a conversion operator to a dependent
2919 type), issue an error. */
2920 qualified_name_lookup_error (scope, id_expression, decl, location);
2921 return error_mark_node;
2925 /* It may be resolved via Koenig lookup. */
2926 *idk = CP_ID_KIND_UNQUALIFIED;
2927 return id_expression;
2930 decl = id_expression;
2932 /* If DECL is a variable that would be out of scope under
2933 ANSI/ISO rules, but in scope in the ARM, name lookup
2934 will succeed. Issue a diagnostic here. */
2936 decl = check_for_out_of_scope_variable (decl);
2938 /* Remember that the name was used in the definition of
2939 the current class so that we can check later to see if
2940 the meaning would have been different after the class
2941 was entirely defined. */
2942 if (!scope && decl != error_mark_node
2943 && TREE_CODE (id_expression) == IDENTIFIER_NODE)
2944 maybe_note_name_used_in_class (id_expression, decl);
2946 /* Disallow uses of local variables from containing functions, except
2947 within lambda-expressions. */
2948 if ((outer_automatic_var_p (decl)
2949 || outer_lambda_capture_p (decl))
2950 /* It's not a use (3.2) if we're in an unevaluated context. */
2951 && !cp_unevaluated_operand)
2953 tree context = DECL_CONTEXT (decl);
2954 tree containing_function = current_function_decl;
2955 tree lambda_stack = NULL_TREE;
2956 tree lambda_expr = NULL_TREE;
2957 tree initializer = decl;
2959 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2960 support for an approach in which a reference to a local
2961 [constant] automatic variable in a nested class or lambda body
2962 would enter the expression as an rvalue, which would reduce
2963 the complexity of the problem"
2965 FIXME update for final resolution of core issue 696. */
2966 if (decl_constant_var_p (decl))
2967 return integral_constant_value (decl);
2969 if (TYPE_P (context))
2971 /* Implicit capture of an explicit capture. */
2972 context = lambda_function (context);
2973 initializer = thisify_lambda_field (decl);
2976 /* If we are in a lambda function, we can move out until we hit
2978 2. a non-lambda function, or
2979 3. a non-default capturing lambda function. */
2980 while (context != containing_function
2981 && LAMBDA_FUNCTION_P (containing_function))
2983 lambda_expr = CLASSTYPE_LAMBDA_EXPR
2984 (DECL_CONTEXT (containing_function));
2986 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr)
2990 lambda_stack = tree_cons (NULL_TREE,
2995 = decl_function_context (containing_function);
2998 if (context == containing_function)
3000 decl = add_default_capture (lambda_stack,
3001 /*id=*/DECL_NAME (decl),
3004 else if (lambda_expr)
3006 error ("%qD is not captured", decl);
3007 return error_mark_node;
3011 error (TREE_CODE (decl) == VAR_DECL
3012 ? "use of %<auto%> variable from containing function"
3013 : "use of parameter from containing function");
3014 error (" %q+#D declared here", decl);
3015 return error_mark_node;
3019 /* Also disallow uses of function parameters outside the function
3020 body, except inside an unevaluated context (i.e. decltype). */
3021 if (TREE_CODE (decl) == PARM_DECL
3022 && DECL_CONTEXT (decl) == NULL_TREE
3023 && !cp_unevaluated_operand)
3025 error ("use of parameter %qD outside function body", decl);
3026 return error_mark_node;
3030 /* If we didn't find anything, or what we found was a type,
3031 then this wasn't really an id-expression. */
3032 if (TREE_CODE (decl) == TEMPLATE_DECL
3033 && !DECL_FUNCTION_TEMPLATE_P (decl))
3035 *error_msg = "missing template arguments";
3036 return error_mark_node;
3038 else if (TREE_CODE (decl) == TYPE_DECL
3039 || TREE_CODE (decl) == NAMESPACE_DECL)
3041 *error_msg = "expected primary-expression";
3042 return error_mark_node;
3045 /* If the name resolved to a template parameter, there is no
3046 need to look it up again later. */
3047 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
3048 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
3052 *idk = CP_ID_KIND_NONE;
3053 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
3054 decl = TEMPLATE_PARM_DECL (decl);
3055 r = convert_from_reference (DECL_INITIAL (decl));
3057 if (integral_constant_expression_p
3058 && !dependent_type_p (TREE_TYPE (decl))
3059 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
3061 if (!allow_non_integral_constant_expression_p)
3062 error ("template parameter %qD of type %qT is not allowed in "
3063 "an integral constant expression because it is not of "
3064 "integral or enumeration type", decl, TREE_TYPE (decl));
3065 *non_integral_constant_expression_p = true;
3069 /* Similarly, we resolve enumeration constants to their
3070 underlying values. */
3071 else if (TREE_CODE (decl) == CONST_DECL)
3073 *idk = CP_ID_KIND_NONE;
3074 if (!processing_template_decl)
3076 used_types_insert (TREE_TYPE (decl));
3077 return DECL_INITIAL (decl);
3085 /* If the declaration was explicitly qualified indicate
3086 that. The semantics of `A::f(3)' are different than
3087 `f(3)' if `f' is virtual. */
3089 ? CP_ID_KIND_QUALIFIED
3090 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
3091 ? CP_ID_KIND_TEMPLATE_ID
3092 : CP_ID_KIND_UNQUALIFIED));
3097 An id-expression is type-dependent if it contains an
3098 identifier that was declared with a dependent type.
3100 The standard is not very specific about an id-expression that
3101 names a set of overloaded functions. What if some of them
3102 have dependent types and some of them do not? Presumably,
3103 such a name should be treated as a dependent name. */
3104 /* Assume the name is not dependent. */
3105 dependent_p = false;
3106 if (!processing_template_decl)
3107 /* No names are dependent outside a template. */
3109 /* A template-id where the name of the template was not resolved
3110 is definitely dependent. */
3111 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
3112 && (TREE_CODE (TREE_OPERAND (decl, 0))
3113 == IDENTIFIER_NODE))
3115 /* For anything except an overloaded function, just check its
3117 else if (!is_overloaded_fn (decl))
3119 = dependent_type_p (TREE_TYPE (decl));
3120 /* For a set of overloaded functions, check each of the
3126 if (BASELINK_P (fns))
3127 fns = BASELINK_FUNCTIONS (fns);
3129 /* For a template-id, check to see if the template
3130 arguments are dependent. */
3131 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
3133 tree args = TREE_OPERAND (fns, 1);
3134 dependent_p = any_dependent_template_arguments_p (args);
3135 /* The functions are those referred to by the
3137 fns = TREE_OPERAND (fns, 0);
3140 /* If there are no dependent template arguments, go through
3141 the overloaded functions. */
3142 while (fns && !dependent_p)
3144 tree fn = OVL_CURRENT (fns);
3146 /* Member functions of dependent classes are
3148 if (TREE_CODE (fn) == FUNCTION_DECL
3149 && type_dependent_expression_p (fn))
3151 else if (TREE_CODE (fn) == TEMPLATE_DECL
3152 && dependent_template_p (fn))
3155 fns = OVL_NEXT (fns);
3159 /* If the name was dependent on a template parameter, we will
3160 resolve the name at instantiation time. */
3163 /* Create a SCOPE_REF for qualified names, if the scope is
3169 if (address_p && done)
3170 decl = finish_qualified_id_expr (scope, decl,
3176 tree type = NULL_TREE;
3177 if (DECL_P (decl) && !dependent_scope_p (scope))
3178 type = TREE_TYPE (decl);
3179 decl = build_qualified_name (type,
3185 if (TREE_TYPE (decl))
3186 decl = convert_from_reference (decl);
3189 /* A TEMPLATE_ID already contains all the information we
3191 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
3192 return id_expression;
3193 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
3194 /* If we found a variable, then name lookup during the
3195 instantiation will always resolve to the same VAR_DECL
3196 (or an instantiation thereof). */
3197 if (TREE_CODE (decl) == VAR_DECL
3198 || TREE_CODE (decl) == PARM_DECL)
3199 return convert_from_reference (decl);
3200 /* The same is true for FIELD_DECL, but we also need to
3201 make sure that the syntax is correct. */
3202 else if (TREE_CODE (decl) == FIELD_DECL)
3204 /* Since SCOPE is NULL here, this is an unqualified name.
3205 Access checking has been performed during name lookup
3206 already. Turn off checking to avoid duplicate errors. */
3207 push_deferring_access_checks (dk_no_check);
3208 decl = finish_non_static_data_member
3210 /*qualifying_scope=*/NULL_TREE);
3211 pop_deferring_access_checks ();
3214 return id_expression;
3217 if (TREE_CODE (decl) == NAMESPACE_DECL)
3219 error ("use of namespace %qD as expression", decl);
3220 return error_mark_node;
3222 else if (DECL_CLASS_TEMPLATE_P (decl))
3224 error ("use of class template %qT as expression", decl);
3225 return error_mark_node;
3227 else if (TREE_CODE (decl) == TREE_LIST)
3229 /* Ambiguous reference to base members. */
3230 error ("request for member %qD is ambiguous in "
3231 "multiple inheritance lattice", id_expression);
3232 print_candidates (decl);
3233 return error_mark_node;
3236 /* Mark variable-like entities as used. Functions are similarly
3237 marked either below or after overload resolution. */
3238 if (TREE_CODE (decl) == VAR_DECL
3239 || TREE_CODE (decl) == PARM_DECL
3240 || TREE_CODE (decl) == RESULT_DECL)
3243 /* Only certain kinds of names are allowed in constant
3244 expression. Enumerators and template parameters have already
3245 been handled above. */
3246 if (! error_operand_p (decl)
3247 && integral_constant_expression_p
3248 && ! decl_constant_var_p (decl)
3249 && ! builtin_valid_in_constant_expr_p (decl))
3251 if (!allow_non_integral_constant_expression_p)
3253 error ("%qD cannot appear in a constant-expression", decl);
3254 return error_mark_node;
3256 *non_integral_constant_expression_p = true;
3261 decl = (adjust_result_of_qualified_name_lookup
3262 (decl, scope, current_class_type));
3264 if (TREE_CODE (decl) == FUNCTION_DECL)
3267 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
3268 decl = finish_qualified_id_expr (scope,
3276 tree r = convert_from_reference (decl);
3278 /* In a template, return a SCOPE_REF for most qualified-ids
3279 so that we can check access at instantiation time. But if
3280 we're looking at a member of the current instantiation, we
3281 know we have access and building up the SCOPE_REF confuses
3282 non-type template argument handling. */
3283 if (processing_template_decl && TYPE_P (scope)
3284 && !currently_open_class (scope))
3285 r = build_qualified_name (TREE_TYPE (r),
3291 else if (TREE_CODE (decl) == FIELD_DECL)
3293 /* Since SCOPE is NULL here, this is an unqualified name.
3294 Access checking has been performed during name lookup
3295 already. Turn off checking to avoid duplicate errors. */
3296 push_deferring_access_checks (dk_no_check);
3297 decl = finish_non_static_data_member (decl, NULL_TREE,
3298 /*qualifying_scope=*/NULL_TREE);
3299 pop_deferring_access_checks ();
3301 else if (is_overloaded_fn (decl))
3305 first_fn = get_first_fn (decl);
3306 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
3307 first_fn = DECL_TEMPLATE_RESULT (first_fn);
3309 if (!really_overloaded_fn (decl))
3310 mark_used (first_fn);
3313 && TREE_CODE (first_fn) == FUNCTION_DECL
3314 && DECL_FUNCTION_MEMBER_P (first_fn)
3315 && !shared_member_p (decl))
3317 /* A set of member functions. */
3318 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3319 return finish_class_member_access_expr (decl, id_expression,
3320 /*template_p=*/false,
3321 tf_warning_or_error);
3324 decl = baselink_for_fns (decl);
3328 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3329 && DECL_CLASS_SCOPE_P (decl))
3331 tree context = context_for_name_lookup (decl);
3332 if (context != current_class_type)
3334 tree path = currently_open_derived_class (context);
3335 perform_or_defer_access_check (TYPE_BINFO (path),
3340 decl = convert_from_reference (decl);
3344 if (TREE_DEPRECATED (decl))
3345 warn_deprecated_use (decl, NULL_TREE);
3350 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3351 use as a type-specifier. */
3354 finish_typeof (tree expr)
3358 if (type_dependent_expression_p (expr))
3360 type = cxx_make_type (TYPEOF_TYPE);
3361 TYPEOF_TYPE_EXPR (type) = expr;
3362 SET_TYPE_STRUCTURAL_EQUALITY (type);
3367 expr = mark_type_use (expr);
3369 type = unlowered_expr_type (expr);
3371 if (!type || type == unknown_type_node)
3373 error ("type of %qE is unknown", expr);
3374 return error_mark_node;
3380 /* Implement the __underlying_type keyword: Return the underlying
3381 type of TYPE, suitable for use as a type-specifier. */
3384 finish_underlying_type (tree type)
3386 tree underlying_type;
3388 if (processing_template_decl)
3390 underlying_type = cxx_make_type (UNDERLYING_TYPE);
3391 UNDERLYING_TYPE_TYPE (underlying_type) = type;
3392 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type);
3394 return underlying_type;
3397 complete_type (type);
3399 if (TREE_CODE (type) != ENUMERAL_TYPE)
3401 error ("%qE is not an enumeration type", type);
3402 return error_mark_node;
3405 underlying_type = ENUM_UNDERLYING_TYPE (type);
3407 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
3408 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
3409 See finish_enum_value_list for details. */
3410 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type))
3412 = c_common_type_for_mode (TYPE_MODE (underlying_type),
3413 TYPE_UNSIGNED (underlying_type));
3415 return underlying_type;
3418 /* Perform C++-specific checks for __builtin_offsetof before calling
3422 finish_offsetof (tree expr)
3424 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3426 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3427 TREE_OPERAND (expr, 2));
3428 return error_mark_node;
3430 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3431 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3432 || TREE_TYPE (expr) == unknown_type_node)
3434 if (TREE_CODE (expr) == COMPONENT_REF
3435 || TREE_CODE (expr) == COMPOUND_EXPR)
3436 expr = TREE_OPERAND (expr, 1);
3437 error ("cannot apply %<offsetof%> to member function %qD", expr);
3438 return error_mark_node;
3440 if (REFERENCE_REF_P (expr))
3441 expr = TREE_OPERAND (expr, 0);
3442 return fold_offsetof (expr, NULL_TREE);
3445 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3446 function is broken out from the above for the benefit of the tree-ssa
3450 simplify_aggr_init_expr (tree *tp)
3452 tree aggr_init_expr = *tp;
3454 /* Form an appropriate CALL_EXPR. */
3455 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3456 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3457 tree type = TREE_TYPE (slot);
3460 enum style_t { ctor, arg, pcc } style;
3462 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3464 #ifdef PCC_STATIC_STRUCT_RETURN
3470 gcc_assert (TREE_ADDRESSABLE (type));
3474 call_expr = build_call_array_loc (input_location,
3475 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3477 aggr_init_expr_nargs (aggr_init_expr),
3478 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3479 TREE_NOTHROW (call_expr) = TREE_NOTHROW (aggr_init_expr);
3483 /* Replace the first argument to the ctor with the address of the
3485 cxx_mark_addressable (slot);
3486 CALL_EXPR_ARG (call_expr, 0) =
3487 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3489 else if (style == arg)
3491 /* Just mark it addressable here, and leave the rest to
3492 expand_call{,_inline}. */
3493 cxx_mark_addressable (slot);
3494 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3495 call_expr = build2 (INIT_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3497 else if (style == pcc)
3499 /* If we're using the non-reentrant PCC calling convention, then we
3500 need to copy the returned value out of the static buffer into the
3502 push_deferring_access_checks (dk_no_check);
3503 call_expr = build_aggr_init (slot, call_expr,
3504 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3505 tf_warning_or_error);
3506 pop_deferring_access_checks ();
3507 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3510 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3512 tree init = build_zero_init (type, NULL_TREE,
3513 /*static_storage_p=*/false);
3514 init = build2 (INIT_EXPR, void_type_node, slot, init);
3515 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3522 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3525 emit_associated_thunks (tree fn)
3527 /* When we use vcall offsets, we emit thunks with the virtual
3528 functions to which they thunk. The whole point of vcall offsets
3529 is so that you can know statically the entire set of thunks that
3530 will ever be needed for a given virtual function, thereby
3531 enabling you to output all the thunks with the function itself. */
3532 if (DECL_VIRTUAL_P (fn)
3533 /* Do not emit thunks for extern template instantiations. */
3534 && ! DECL_REALLY_EXTERN (fn))
3538 for (thunk = DECL_THUNKS (fn); thunk; thunk = DECL_CHAIN (thunk))
3540 if (!THUNK_ALIAS (thunk))
3542 use_thunk (thunk, /*emit_p=*/1);
3543 if (DECL_RESULT_THUNK_P (thunk))
3547 for (probe = DECL_THUNKS (thunk);
3548 probe; probe = DECL_CHAIN (probe))
3549 use_thunk (probe, /*emit_p=*/1);
3553 gcc_assert (!DECL_THUNKS (thunk));
3558 /* Generate RTL for FN. */
3561 expand_or_defer_fn_1 (tree fn)
3563 /* When the parser calls us after finishing the body of a template
3564 function, we don't really want to expand the body. */
3565 if (processing_template_decl)
3567 /* Normally, collection only occurs in rest_of_compilation. So,
3568 if we don't collect here, we never collect junk generated
3569 during the processing of templates until we hit a
3570 non-template function. It's not safe to do this inside a
3571 nested class, though, as the parser may have local state that
3572 is not a GC root. */
3573 if (!function_depth)
3578 gcc_assert (DECL_SAVED_TREE (fn));
3580 /* If this is a constructor or destructor body, we have to clone
3582 if (maybe_clone_body (fn))
3584 /* We don't want to process FN again, so pretend we've written
3585 it out, even though we haven't. */
3586 TREE_ASM_WRITTEN (fn) = 1;
3587 DECL_SAVED_TREE (fn) = NULL_TREE;
3591 /* We make a decision about linkage for these functions at the end
3592 of the compilation. Until that point, we do not want the back
3593 end to output them -- but we do want it to see the bodies of
3594 these functions so that it can inline them as appropriate. */
3595 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3597 if (DECL_INTERFACE_KNOWN (fn))
3598 /* We've already made a decision as to how this function will
3602 DECL_EXTERNAL (fn) = 1;
3603 DECL_NOT_REALLY_EXTERN (fn) = 1;
3604 note_vague_linkage_fn (fn);
3605 /* A non-template inline function with external linkage will
3606 always be COMDAT. As we must eventually determine the
3607 linkage of all functions, and as that causes writes to
3608 the data mapped in from the PCH file, it's advantageous
3609 to mark the functions at this point. */
3610 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3612 /* This function must have external linkage, as
3613 otherwise DECL_INTERFACE_KNOWN would have been
3615 gcc_assert (TREE_PUBLIC (fn));
3616 comdat_linkage (fn);
3617 DECL_INTERFACE_KNOWN (fn) = 1;
3621 import_export_decl (fn);
3623 /* If the user wants us to keep all inline functions, then mark
3624 this function as needed so that finish_file will make sure to
3625 output it later. Similarly, all dllexport'd functions must
3626 be emitted; there may be callers in other DLLs. */
3627 if ((flag_keep_inline_functions
3628 && DECL_DECLARED_INLINE_P (fn)
3629 && !DECL_REALLY_EXTERN (fn))
3630 || (flag_keep_inline_dllexport
3631 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn))))
3635 /* There's no reason to do any of the work here if we're only doing
3636 semantic analysis; this code just generates RTL. */
3637 if (flag_syntax_only)
3644 expand_or_defer_fn (tree fn)
3646 if (expand_or_defer_fn_1 (fn))
3650 /* Expand or defer, at the whim of the compilation unit manager. */
3651 cgraph_finalize_function (fn, function_depth > 1);
3652 emit_associated_thunks (fn);
3665 /* Helper function for walk_tree, used by finalize_nrv below. */
3668 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3670 struct nrv_data *dp = (struct nrv_data *)data;
3673 /* No need to walk into types. There wouldn't be any need to walk into
3674 non-statements, except that we have to consider STMT_EXPRs. */
3677 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3678 but differs from using NULL_TREE in that it indicates that we care
3679 about the value of the RESULT_DECL. */
3680 else if (TREE_CODE (*tp) == RETURN_EXPR)
3681 TREE_OPERAND (*tp, 0) = dp->result;
3682 /* Change all cleanups for the NRV to only run when an exception is
3684 else if (TREE_CODE (*tp) == CLEANUP_STMT
3685 && CLEANUP_DECL (*tp) == dp->var)
3686 CLEANUP_EH_ONLY (*tp) = 1;
3687 /* Replace the DECL_EXPR for the NRV with an initialization of the
3688 RESULT_DECL, if needed. */
3689 else if (TREE_CODE (*tp) == DECL_EXPR
3690 && DECL_EXPR_DECL (*tp) == dp->var)
3693 if (DECL_INITIAL (dp->var)
3694 && DECL_INITIAL (dp->var) != error_mark_node)
3695 init = build2 (INIT_EXPR, void_type_node, dp->result,
3696 DECL_INITIAL (dp->var));
3698 init = build_empty_stmt (EXPR_LOCATION (*tp));
3699 DECL_INITIAL (dp->var) = NULL_TREE;
3700 SET_EXPR_LOCATION (init, EXPR_LOCATION (*tp));
3703 /* And replace all uses of the NRV with the RESULT_DECL. */
3704 else if (*tp == dp->var)
3707 /* Avoid walking into the same tree more than once. Unfortunately, we
3708 can't just use walk_tree_without duplicates because it would only call
3709 us for the first occurrence of dp->var in the function body. */
3710 slot = htab_find_slot (dp->visited, *tp, INSERT);
3716 /* Keep iterating. */
3720 /* Called from finish_function to implement the named return value
3721 optimization by overriding all the RETURN_EXPRs and pertinent
3722 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3723 RESULT_DECL for the function. */
3726 finalize_nrv (tree *tp, tree var, tree result)
3728 struct nrv_data data;
3730 /* Copy name from VAR to RESULT. */
3731 DECL_NAME (result) = DECL_NAME (var);
3732 /* Don't forget that we take its address. */
3733 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3734 /* Finally set DECL_VALUE_EXPR to avoid assigning
3735 a stack slot at -O0 for the original var and debug info
3736 uses RESULT location for VAR. */
3737 SET_DECL_VALUE_EXPR (var, result);
3738 DECL_HAS_VALUE_EXPR_P (var) = 1;
3741 data.result = result;
3742 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3743 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3744 htab_delete (data.visited);
3747 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3750 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3751 bool need_copy_ctor, bool need_copy_assignment)
3753 int save_errorcount = errorcount;
3756 /* Always allocate 3 elements for simplicity. These are the
3757 function decls for the ctor, dtor, and assignment op.
3758 This layout is known to the three lang hooks,
3759 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3760 and cxx_omp_clause_assign_op. */
3761 info = make_tree_vec (3);
3762 CP_OMP_CLAUSE_INFO (c) = info;
3764 if (need_default_ctor || need_copy_ctor)
3766 if (need_default_ctor)
3767 t = get_default_ctor (type);
3769 t = get_copy_ctor (type, tf_warning_or_error);
3771 if (t && !trivial_fn_p (t))
3772 TREE_VEC_ELT (info, 0) = t;
3775 if ((need_default_ctor || need_copy_ctor)
3776 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3777 TREE_VEC_ELT (info, 1) = get_dtor (type, tf_warning_or_error);
3779 if (need_copy_assignment)
3781 t = get_copy_assign (type);
3783 if (t && !trivial_fn_p (t))
3784 TREE_VEC_ELT (info, 2) = t;
3787 return errorcount != save_errorcount;
3790 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3791 Remove any elements from the list that are invalid. */
3794 finish_omp_clauses (tree clauses)
3796 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3797 tree c, t, *pc = &clauses;
3800 bitmap_obstack_initialize (NULL);
3801 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3802 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3803 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3805 for (pc = &clauses, c = clauses; c ; c = *pc)
3807 bool remove = false;
3809 switch (OMP_CLAUSE_CODE (c))
3811 case OMP_CLAUSE_SHARED:
3813 goto check_dup_generic;
3814 case OMP_CLAUSE_PRIVATE:
3816 goto check_dup_generic;
3817 case OMP_CLAUSE_REDUCTION:
3819 goto check_dup_generic;
3820 case OMP_CLAUSE_COPYPRIVATE:
3821 name = "copyprivate";
3822 goto check_dup_generic;
3823 case OMP_CLAUSE_COPYIN:
3825 goto check_dup_generic;
3827 t = OMP_CLAUSE_DECL (c);
3828 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3830 if (processing_template_decl)
3833 error ("%qD is not a variable in clause %qs", t, name);
3835 error ("%qE is not a variable in clause %qs", t, name);
3838 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3839 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3840 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3842 error ("%qD appears more than once in data clauses", t);
3846 bitmap_set_bit (&generic_head, DECL_UID (t));
3849 case OMP_CLAUSE_FIRSTPRIVATE:
3850 t = OMP_CLAUSE_DECL (c);
3851 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3853 if (processing_template_decl)
3856 error ("%qD is not a variable in clause %<firstprivate%>", t);
3858 error ("%qE is not a variable in clause %<firstprivate%>", t);
3861 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3862 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3864 error ("%qD appears more than once in data clauses", t);
3868 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3871 case OMP_CLAUSE_LASTPRIVATE:
3872 t = OMP_CLAUSE_DECL (c);
3873 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3875 if (processing_template_decl)
3878 error ("%qD is not a variable in clause %<lastprivate%>", t);
3880 error ("%qE is not a variable in clause %<lastprivate%>", t);
3883 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3884 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3886 error ("%qD appears more than once in data clauses", t);
3890 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3894 t = OMP_CLAUSE_IF_EXPR (c);
3895 t = maybe_convert_cond (t);
3896 if (t == error_mark_node)
3898 OMP_CLAUSE_IF_EXPR (c) = t;
3901 case OMP_CLAUSE_NUM_THREADS:
3902 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3903 if (t == error_mark_node)
3905 else if (!type_dependent_expression_p (t)
3906 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3908 error ("num_threads expression must be integral");
3913 case OMP_CLAUSE_SCHEDULE:
3914 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3917 else if (t == error_mark_node)
3919 else if (!type_dependent_expression_p (t)
3920 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3922 error ("schedule chunk size expression must be integral");
3927 case OMP_CLAUSE_NOWAIT:
3928 case OMP_CLAUSE_ORDERED:
3929 case OMP_CLAUSE_DEFAULT:
3930 case OMP_CLAUSE_UNTIED:
3931 case OMP_CLAUSE_COLLAPSE:
3939 *pc = OMP_CLAUSE_CHAIN (c);
3941 pc = &OMP_CLAUSE_CHAIN (c);
3944 for (pc = &clauses, c = clauses; c ; c = *pc)
3946 enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c);
3947 bool remove = false;
3948 bool need_complete_non_reference = false;
3949 bool need_default_ctor = false;
3950 bool need_copy_ctor = false;
3951 bool need_copy_assignment = false;
3952 bool need_implicitly_determined = false;
3953 tree type, inner_type;
3957 case OMP_CLAUSE_SHARED:
3959 need_implicitly_determined = true;
3961 case OMP_CLAUSE_PRIVATE:
3963 need_complete_non_reference = true;
3964 need_default_ctor = true;
3965 need_implicitly_determined = true;
3967 case OMP_CLAUSE_FIRSTPRIVATE:
3968 name = "firstprivate";
3969 need_complete_non_reference = true;
3970 need_copy_ctor = true;
3971 need_implicitly_determined = true;
3973 case OMP_CLAUSE_LASTPRIVATE:
3974 name = "lastprivate";
3975 need_complete_non_reference = true;
3976 need_copy_assignment = true;
3977 need_implicitly_determined = true;
3979 case OMP_CLAUSE_REDUCTION:
3981 need_implicitly_determined = true;
3983 case OMP_CLAUSE_COPYPRIVATE:
3984 name = "copyprivate";
3985 need_copy_assignment = true;
3987 case OMP_CLAUSE_COPYIN:
3989 need_copy_assignment = true;
3992 pc = &OMP_CLAUSE_CHAIN (c);
3996 t = OMP_CLAUSE_DECL (c);
3997 if (processing_template_decl
3998 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
4000 pc = &OMP_CLAUSE_CHAIN (c);
4006 case OMP_CLAUSE_LASTPRIVATE:
4007 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
4008 need_default_ctor = true;
4011 case OMP_CLAUSE_REDUCTION:
4012 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
4013 || POINTER_TYPE_P (TREE_TYPE (t)))
4015 error ("%qE has invalid type for %<reduction%>", t);
4018 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
4020 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
4028 error ("%qE has invalid type for %<reduction(%s)%>",
4029 t, operator_name_info[r_code].name);
4035 case OMP_CLAUSE_COPYIN:
4036 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
4038 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
4047 if (need_complete_non_reference || need_copy_assignment)
4049 t = require_complete_type (t);
4050 if (t == error_mark_node)
4052 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE
4053 && need_complete_non_reference)
4055 error ("%qE has reference type for %qs", t, name);
4059 if (need_implicitly_determined)
4061 const char *share_name = NULL;
4063 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
4064 share_name = "threadprivate";
4065 else switch (cxx_omp_predetermined_sharing (t))
4067 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
4069 case OMP_CLAUSE_DEFAULT_SHARED:
4070 share_name = "shared";
4072 case OMP_CLAUSE_DEFAULT_PRIVATE:
4073 share_name = "private";
4080 error ("%qE is predetermined %qs for %qs",
4081 t, share_name, name);
4086 /* We're interested in the base element, not arrays. */
4087 inner_type = type = TREE_TYPE (t);
4088 while (TREE_CODE (inner_type) == ARRAY_TYPE)
4089 inner_type = TREE_TYPE (inner_type);
4091 /* Check for special function availability by building a call to one.
4092 Save the results, because later we won't be in the right context
4093 for making these queries. */
4094 if (CLASS_TYPE_P (inner_type)
4095 && COMPLETE_TYPE_P (inner_type)
4096 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
4097 && !type_dependent_expression_p (t)
4098 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
4099 need_copy_ctor, need_copy_assignment))
4103 *pc = OMP_CLAUSE_CHAIN (c);
4105 pc = &OMP_CLAUSE_CHAIN (c);
4108 bitmap_obstack_release (NULL);
4112 /* For all variables in the tree_list VARS, mark them as thread local. */
4115 finish_omp_threadprivate (tree vars)
4119 /* Mark every variable in VARS to be assigned thread local storage. */
4120 for (t = vars; t; t = TREE_CHAIN (t))
4122 tree v = TREE_PURPOSE (t);
4124 if (error_operand_p (v))
4126 else if (TREE_CODE (v) != VAR_DECL)
4127 error ("%<threadprivate%> %qD is not file, namespace "
4128 "or block scope variable", v);
4129 /* If V had already been marked threadprivate, it doesn't matter
4130 whether it had been used prior to this point. */
4131 else if (TREE_USED (v)
4132 && (DECL_LANG_SPECIFIC (v) == NULL
4133 || !CP_DECL_THREADPRIVATE_P (v)))
4134 error ("%qE declared %<threadprivate%> after first use", v);
4135 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
4136 error ("automatic variable %qE cannot be %<threadprivate%>", v);
4137 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
4138 error ("%<threadprivate%> %qE has incomplete type", v);
4139 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
4140 && CP_DECL_CONTEXT (v) != current_class_type)
4141 error ("%<threadprivate%> %qE directive not "
4142 "in %qT definition", v, CP_DECL_CONTEXT (v));
4145 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4146 if (DECL_LANG_SPECIFIC (v) == NULL)
4148 retrofit_lang_decl (v);
4150 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4151 after the allocation of the lang_decl structure. */
4152 if (DECL_DISCRIMINATOR_P (v))
4153 DECL_LANG_SPECIFIC (v)->u.base.u2sel = 1;
4156 if (! DECL_THREAD_LOCAL_P (v))
4158 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
4159 /* If rtl has been already set for this var, call
4160 make_decl_rtl once again, so that encode_section_info
4161 has a chance to look at the new decl flags. */
4162 if (DECL_RTL_SET_P (v))
4165 CP_DECL_THREADPRIVATE_P (v) = 1;
4170 /* Build an OpenMP structured block. */
4173 begin_omp_structured_block (void)
4175 return do_pushlevel (sk_omp);
4179 finish_omp_structured_block (tree block)
4181 return do_poplevel (block);
4184 /* Similarly, except force the retention of the BLOCK. */
4187 begin_omp_parallel (void)
4189 keep_next_level (true);
4190 return begin_omp_structured_block ();
4194 finish_omp_parallel (tree clauses, tree body)
4198 body = finish_omp_structured_block (body);
4200 stmt = make_node (OMP_PARALLEL);
4201 TREE_TYPE (stmt) = void_type_node;
4202 OMP_PARALLEL_CLAUSES (stmt) = clauses;
4203 OMP_PARALLEL_BODY (stmt) = body;
4205 return add_stmt (stmt);
4209 begin_omp_task (void)
4211 keep_next_level (true);
4212 return begin_omp_structured_block ();
4216 finish_omp_task (tree clauses, tree body)
4220 body = finish_omp_structured_block (body);
4222 stmt = make_node (OMP_TASK);
4223 TREE_TYPE (stmt) = void_type_node;
4224 OMP_TASK_CLAUSES (stmt) = clauses;
4225 OMP_TASK_BODY (stmt) = body;
4227 return add_stmt (stmt);
4230 /* Helper function for finish_omp_for. Convert Ith random access iterator
4231 into integral iterator. Return FALSE if successful. */
4234 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
4235 tree condv, tree incrv, tree *body,
4236 tree *pre_body, tree clauses)
4238 tree diff, iter_init, iter_incr = NULL, last;
4239 tree incr_var = NULL, orig_pre_body, orig_body, c;
4240 tree decl = TREE_VEC_ELT (declv, i);
4241 tree init = TREE_VEC_ELT (initv, i);
4242 tree cond = TREE_VEC_ELT (condv, i);
4243 tree incr = TREE_VEC_ELT (incrv, i);
4245 location_t elocus = locus;
4247 if (init && EXPR_HAS_LOCATION (init))
4248 elocus = EXPR_LOCATION (init);
4250 switch (TREE_CODE (cond))
4256 if (TREE_OPERAND (cond, 1) == iter)
4257 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
4258 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
4259 if (TREE_OPERAND (cond, 0) != iter)
4260 cond = error_mark_node;
4263 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
4264 TREE_OPERAND (cond, 1), ERROR_MARK,
4265 NULL, tf_warning_or_error);
4266 if (error_operand_p (tem))
4271 cond = error_mark_node;
4274 if (cond == error_mark_node)
4276 error_at (elocus, "invalid controlling predicate");
4279 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
4280 ERROR_MARK, iter, ERROR_MARK, NULL,
4281 tf_warning_or_error);
4282 if (error_operand_p (diff))
4284 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
4286 error_at (elocus, "difference between %qE and %qD does not have integer type",
4287 TREE_OPERAND (cond, 1), iter);
4291 switch (TREE_CODE (incr))
4293 case PREINCREMENT_EXPR:
4294 case PREDECREMENT_EXPR:
4295 case POSTINCREMENT_EXPR:
4296 case POSTDECREMENT_EXPR:
4297 if (TREE_OPERAND (incr, 0) != iter)
4299 incr = error_mark_node;
4302 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
4303 tf_warning_or_error);
4304 if (error_operand_p (iter_incr))
4306 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
4307 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4308 incr = integer_one_node;
4310 incr = integer_minus_one_node;
4313 if (TREE_OPERAND (incr, 0) != iter)
4314 incr = error_mark_node;
4315 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4316 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4318 tree rhs = TREE_OPERAND (incr, 1);
4319 if (TREE_OPERAND (rhs, 0) == iter)
4321 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4323 incr = error_mark_node;
4326 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4327 TREE_OPERAND (rhs, 1),
4328 tf_warning_or_error);
4329 if (error_operand_p (iter_incr))
4331 incr = TREE_OPERAND (rhs, 1);
4332 incr = cp_convert (TREE_TYPE (diff), incr);
4333 if (TREE_CODE (rhs) == MINUS_EXPR)
4335 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4336 incr = fold_if_not_in_template (incr);
4338 if (TREE_CODE (incr) != INTEGER_CST
4339 && (TREE_CODE (incr) != NOP_EXPR
4340 || (TREE_CODE (TREE_OPERAND (incr, 0))
4345 else if (TREE_OPERAND (rhs, 1) == iter)
4347 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4348 || TREE_CODE (rhs) != PLUS_EXPR)
4349 incr = error_mark_node;
4352 iter_incr = build_x_binary_op (PLUS_EXPR,
4353 TREE_OPERAND (rhs, 0),
4356 tf_warning_or_error);
4357 if (error_operand_p (iter_incr))
4359 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4361 tf_warning_or_error);
4362 if (error_operand_p (iter_incr))
4364 incr = TREE_OPERAND (rhs, 0);
4369 incr = error_mark_node;
4372 incr = error_mark_node;
4375 incr = error_mark_node;
4379 if (incr == error_mark_node)
4381 error_at (elocus, "invalid increment expression");
4385 incr = cp_convert (TREE_TYPE (diff), incr);
4386 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4387 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4388 && OMP_CLAUSE_DECL (c) == iter)
4391 decl = create_temporary_var (TREE_TYPE (diff));
4393 add_decl_expr (decl);
4394 last = create_temporary_var (TREE_TYPE (diff));
4396 add_decl_expr (last);
4397 if (c && iter_incr == NULL)
4399 incr_var = create_temporary_var (TREE_TYPE (diff));
4400 pushdecl (incr_var);
4401 add_decl_expr (incr_var);
4403 gcc_assert (stmts_are_full_exprs_p ());
4405 orig_pre_body = *pre_body;
4406 *pre_body = push_stmt_list ();
4408 add_stmt (orig_pre_body);
4410 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4411 tf_warning_or_error));
4412 init = build_int_cst (TREE_TYPE (diff), 0);
4413 if (c && iter_incr == NULL)
4415 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4416 incr, tf_warning_or_error));
4418 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4419 tf_warning_or_error);
4421 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4422 tf_warning_or_error));
4423 *pre_body = pop_stmt_list (*pre_body);
4425 cond = cp_build_binary_op (elocus,
4426 TREE_CODE (cond), decl, diff,
4427 tf_warning_or_error);
4428 incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR,
4429 elocus, incr, NULL_TREE);
4432 *body = push_stmt_list ();
4433 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4434 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4435 tf_warning_or_error);
4436 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4437 finish_expr_stmt (iter_init);
4438 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4439 tf_warning_or_error));
4440 add_stmt (orig_body);
4441 *body = pop_stmt_list (*body);
4445 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4446 finish_expr_stmt (iter_incr);
4447 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4448 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4451 TREE_VEC_ELT (declv, i) = decl;
4452 TREE_VEC_ELT (initv, i) = init;
4453 TREE_VEC_ELT (condv, i) = cond;
4454 TREE_VEC_ELT (incrv, i) = incr;
4459 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4460 are directly for their associated operands in the statement. DECL
4461 and INIT are a combo; if DECL is NULL then INIT ought to be a
4462 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4463 optional statements that need to go before the loop into its
4467 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4468 tree incrv, tree body, tree pre_body, tree clauses)
4470 tree omp_for = NULL, orig_incr = NULL;
4471 tree decl, init, cond, incr;
4475 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4476 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4477 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4478 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4480 decl = TREE_VEC_ELT (declv, i);
4481 init = TREE_VEC_ELT (initv, i);
4482 cond = TREE_VEC_ELT (condv, i);
4483 incr = TREE_VEC_ELT (incrv, i);
4489 switch (TREE_CODE (init))
4492 decl = TREE_OPERAND (init, 0);
4493 init = TREE_OPERAND (init, 1);
4496 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4498 decl = TREE_OPERAND (init, 0);
4499 init = TREE_OPERAND (init, 2);
4509 "expected iteration declaration or initialization");
4514 if (init && EXPR_HAS_LOCATION (init))
4515 elocus = EXPR_LOCATION (init);
4519 error_at (elocus, "missing controlling predicate");
4525 error_at (elocus, "missing increment expression");
4529 TREE_VEC_ELT (declv, i) = decl;
4530 TREE_VEC_ELT (initv, i) = init;
4533 if (dependent_omp_for_p (declv, initv, condv, incrv))
4537 stmt = make_node (OMP_FOR);
4539 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4541 /* This is really just a place-holder. We'll be decomposing this
4542 again and going through the cp_build_modify_expr path below when
4543 we instantiate the thing. */
4544 TREE_VEC_ELT (initv, i)
4545 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4546 TREE_VEC_ELT (initv, i));
4549 TREE_TYPE (stmt) = void_type_node;
4550 OMP_FOR_INIT (stmt) = initv;
4551 OMP_FOR_COND (stmt) = condv;
4552 OMP_FOR_INCR (stmt) = incrv;
4553 OMP_FOR_BODY (stmt) = body;
4554 OMP_FOR_PRE_BODY (stmt) = pre_body;
4555 OMP_FOR_CLAUSES (stmt) = clauses;
4557 SET_EXPR_LOCATION (stmt, locus);
4558 return add_stmt (stmt);
4561 if (processing_template_decl)
4562 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4564 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4566 decl = TREE_VEC_ELT (declv, i);
4567 init = TREE_VEC_ELT (initv, i);
4568 cond = TREE_VEC_ELT (condv, i);
4569 incr = TREE_VEC_ELT (incrv, i);
4571 TREE_VEC_ELT (orig_incr, i) = incr;
4574 if (init && EXPR_HAS_LOCATION (init))
4575 elocus = EXPR_LOCATION (init);
4579 error_at (elocus, "expected iteration declaration or initialization");
4583 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4586 TREE_VEC_ELT (orig_incr, i) = incr;
4587 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4588 TREE_CODE (TREE_OPERAND (incr, 1)),
4589 TREE_OPERAND (incr, 2),
4590 tf_warning_or_error);
4593 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4595 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4596 incrv, &body, &pre_body, clauses))
4601 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4602 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4604 error_at (elocus, "invalid type for iteration variable %qE", decl);
4608 if (!processing_template_decl)
4610 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4611 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4614 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4616 && TREE_SIDE_EFFECTS (cond)
4617 && COMPARISON_CLASS_P (cond)
4618 && !processing_template_decl)
4620 tree t = TREE_OPERAND (cond, 0);
4621 if (TREE_SIDE_EFFECTS (t)
4623 && (TREE_CODE (t) != NOP_EXPR
4624 || TREE_OPERAND (t, 0) != decl))
4625 TREE_OPERAND (cond, 0)
4626 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4628 t = TREE_OPERAND (cond, 1);
4629 if (TREE_SIDE_EFFECTS (t)
4631 && (TREE_CODE (t) != NOP_EXPR
4632 || TREE_OPERAND (t, 0) != decl))
4633 TREE_OPERAND (cond, 1)
4634 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4636 if (decl == error_mark_node || init == error_mark_node)
4639 TREE_VEC_ELT (declv, i) = decl;
4640 TREE_VEC_ELT (initv, i) = init;
4641 TREE_VEC_ELT (condv, i) = cond;
4642 TREE_VEC_ELT (incrv, i) = incr;
4646 if (IS_EMPTY_STMT (pre_body))
4649 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4652 if (omp_for == NULL)
4655 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4657 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4658 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4660 if (TREE_CODE (incr) != MODIFY_EXPR)
4663 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4664 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4665 && !processing_template_decl)
4667 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4668 if (TREE_SIDE_EFFECTS (t)
4670 && (TREE_CODE (t) != NOP_EXPR
4671 || TREE_OPERAND (t, 0) != decl))
4672 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4673 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4675 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4676 if (TREE_SIDE_EFFECTS (t)
4678 && (TREE_CODE (t) != NOP_EXPR
4679 || TREE_OPERAND (t, 0) != decl))
4680 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4681 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4685 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4687 if (omp_for != NULL)
4688 OMP_FOR_CLAUSES (omp_for) = clauses;
4693 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4702 dependent_p = false;
4705 /* Even in a template, we can detect invalid uses of the atomic
4706 pragma if neither LHS nor RHS is type-dependent. */
4707 if (processing_template_decl)
4709 dependent_p = (type_dependent_expression_p (lhs)
4710 || type_dependent_expression_p (rhs));
4713 lhs = build_non_dependent_expr (lhs);
4714 rhs = build_non_dependent_expr (rhs);
4719 stmt = c_finish_omp_atomic (input_location, code, lhs, rhs);
4720 if (stmt == error_mark_node)
4723 if (processing_template_decl)
4724 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4725 build2 (code, void_type_node, orig_lhs, orig_rhs));
4730 finish_omp_barrier (void)
4732 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4733 VEC(tree,gc) *vec = make_tree_vector ();
4734 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4735 release_tree_vector (vec);
4736 finish_expr_stmt (stmt);
4740 finish_omp_flush (void)
4742 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4743 VEC(tree,gc) *vec = make_tree_vector ();
4744 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4745 release_tree_vector (vec);
4746 finish_expr_stmt (stmt);
4750 finish_omp_taskwait (void)
4752 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4753 VEC(tree,gc) *vec = make_tree_vector ();
4754 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4755 release_tree_vector (vec);
4756 finish_expr_stmt (stmt);
4760 init_cp_semantics (void)
4764 /* Build a STATIC_ASSERT for a static assertion with the condition
4765 CONDITION and the message text MESSAGE. LOCATION is the location
4766 of the static assertion in the source code. When MEMBER_P, this
4767 static assertion is a member of a class. */
4769 finish_static_assert (tree condition, tree message, location_t location,
4772 if (check_for_bare_parameter_packs (condition))
4773 condition = error_mark_node;
4775 if (type_dependent_expression_p (condition)
4776 || value_dependent_expression_p (condition))
4778 /* We're in a template; build a STATIC_ASSERT and put it in
4782 assertion = make_node (STATIC_ASSERT);
4783 STATIC_ASSERT_CONDITION (assertion) = condition;
4784 STATIC_ASSERT_MESSAGE (assertion) = message;
4785 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4788 maybe_add_class_template_decl_list (current_class_type,
4792 add_stmt (assertion);
4797 /* Fold the expression and convert it to a boolean value. */
4798 condition = fold_non_dependent_expr (condition);
4799 condition = cp_convert (boolean_type_node, condition);
4800 condition = maybe_constant_value (condition);
4802 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4803 /* Do nothing; the condition is satisfied. */
4807 location_t saved_loc = input_location;
4809 input_location = location;
4810 if (TREE_CODE (condition) == INTEGER_CST
4811 && integer_zerop (condition))
4812 /* Report the error. */
4813 error ("static assertion failed: %E", message);
4814 else if (condition && condition != error_mark_node)
4816 error ("non-constant condition for static assertion");
4817 cxx_constant_value (condition);
4819 input_location = saved_loc;
4823 /* Returns the type of EXPR for cases where we can determine it even though
4824 EXPR is a type-dependent expression. */
4827 describable_type (tree expr)
4829 tree type = NULL_TREE;
4831 if (! type_dependent_expression_p (expr)
4832 && ! type_unknown_p (expr))
4834 type = unlowered_expr_type (expr);
4835 if (real_lvalue_p (expr))
4836 type = build_reference_type (type);
4842 switch (TREE_CODE (expr))
4848 return TREE_TYPE (expr);
4853 case TEMPLATE_PARM_INDEX:
4855 case STATIC_CAST_EXPR:
4856 case REINTERPRET_CAST_EXPR:
4857 case CONST_CAST_EXPR:
4858 case DYNAMIC_CAST_EXPR:
4859 type = TREE_TYPE (expr);
4864 tree ptrtype = describable_type (TREE_OPERAND (expr, 0));
4865 if (ptrtype && POINTER_TYPE_P (ptrtype))
4866 type = build_reference_type (TREE_TYPE (ptrtype));
4871 if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant)
4872 type = TREE_TYPE (expr);
4876 if (type && type_uses_auto (type))
4882 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4883 suitable for use as a type-specifier.
4885 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4886 id-expression or a class member access, FALSE when it was parsed as
4887 a full expression. */
4890 finish_decltype_type (tree expr, bool id_expression_or_member_access_p,
4891 tsubst_flags_t complain)
4893 tree type = NULL_TREE;
4895 if (!expr || error_operand_p (expr))
4896 return error_mark_node;
4899 || TREE_CODE (expr) == TYPE_DECL
4900 || (TREE_CODE (expr) == BIT_NOT_EXPR
4901 && TYPE_P (TREE_OPERAND (expr, 0))))
4903 if (complain & tf_error)
4904 error ("argument to decltype must be an expression");
4905 return error_mark_node;
4908 /* FIXME instantiation-dependent */
4909 if (type_dependent_expression_p (expr)
4910 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
4911 if it isn't dependent, so that we can check access control at
4912 instantiation time, so defer the decltype as well (PR 42277). */
4913 || (id_expression_or_member_access_p
4914 && processing_template_decl
4915 && TREE_CODE (expr) == COMPONENT_REF))
4917 type = cxx_make_type (DECLTYPE_TYPE);
4918 DECLTYPE_TYPE_EXPR (type) = expr;
4919 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4920 = id_expression_or_member_access_p;
4921 SET_TYPE_STRUCTURAL_EQUALITY (type);
4926 /* The type denoted by decltype(e) is defined as follows: */
4928 expr = resolve_nondeduced_context (expr);
4930 if (type_unknown_p (expr))
4932 if (complain & tf_error)
4933 error ("decltype cannot resolve address of overloaded function");
4934 return error_mark_node;
4937 /* To get the size of a static data member declared as an array of
4938 unknown bound, we need to instantiate it. */
4939 if (TREE_CODE (expr) == VAR_DECL
4940 && VAR_HAD_UNKNOWN_BOUND (expr)
4941 && DECL_TEMPLATE_INSTANTIATION (expr))
4942 instantiate_decl (expr, /*defer_ok*/true, /*expl_inst_mem*/false);
4944 if (id_expression_or_member_access_p)
4946 /* If e is an id-expression or a class member access (5.2.5
4947 [expr.ref]), decltype(e) is defined as the type of the entity
4948 named by e. If there is no such entity, or e names a set of
4949 overloaded functions, the program is ill-formed. */
4950 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4951 expr = lookup_name (expr);
4953 if (TREE_CODE (expr) == INDIRECT_REF)
4954 /* This can happen when the expression is, e.g., "a.b". Just
4955 look at the underlying operand. */
4956 expr = TREE_OPERAND (expr, 0);
4958 if (TREE_CODE (expr) == OFFSET_REF
4959 || TREE_CODE (expr) == MEMBER_REF)
4960 /* We're only interested in the field itself. If it is a
4961 BASELINK, we will need to see through it in the next
4963 expr = TREE_OPERAND (expr, 1);
4965 if (TREE_CODE (expr) == BASELINK)
4966 /* See through BASELINK nodes to the underlying function. */
4967 expr = BASELINK_FUNCTIONS (expr);
4969 switch (TREE_CODE (expr))
4972 if (DECL_BIT_FIELD_TYPE (expr))
4974 type = DECL_BIT_FIELD_TYPE (expr);
4977 /* Fall through for fields that aren't bitfields. */
4984 case TEMPLATE_PARM_INDEX:
4985 expr = mark_type_use (expr);
4986 type = TREE_TYPE (expr);
4990 type = error_mark_node;
4994 mark_type_use (expr);
4995 type = is_bitfield_expr_with_lowered_type (expr);
4997 type = TREE_TYPE (TREE_OPERAND (expr, 1));
5004 /* We can get here when the id-expression refers to an
5006 type = TREE_TYPE (expr);
5011 return error_mark_node;
5016 /* Within a lambda-expression:
5018 Every occurrence of decltype((x)) where x is a possibly
5019 parenthesized id-expression that names an entity of
5020 automatic storage duration is treated as if x were
5021 transformed into an access to a corresponding data member
5022 of the closure type that would have been declared if x
5023 were a use of the denoted entity. */
5024 if (outer_automatic_var_p (expr)
5025 && current_function_decl
5026 && LAMBDA_FUNCTION_P (current_function_decl))
5027 type = capture_decltype (expr);
5028 else if (error_operand_p (expr))
5029 type = error_mark_node;
5030 else if (expr == current_class_ptr)
5031 /* If the expression is just "this", we want the
5032 cv-unqualified pointer for the "this" type. */
5033 type = TYPE_MAIN_VARIANT (TREE_TYPE (expr));
5036 /* Otherwise, where T is the type of e, if e is an lvalue,
5037 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
5038 cp_lvalue_kind clk = lvalue_kind (expr);
5039 type = unlowered_expr_type (expr);
5040 gcc_assert (TREE_CODE (type) != REFERENCE_TYPE);
5041 if (clk != clk_none && !(clk & clk_class))
5042 type = cp_build_reference_type (type, (clk & clk_rvalueref));
5049 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
5050 __has_nothrow_copy, depending on assign_p. */
5053 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
5060 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
5063 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
5065 else if (TYPE_HAS_COPY_CTOR (type))
5067 /* If construction of the copy constructor was postponed, create
5069 if (CLASSTYPE_LAZY_COPY_CTOR (type))
5070 lazily_declare_fn (sfk_copy_constructor, type);
5071 if (CLASSTYPE_LAZY_MOVE_CTOR (type))
5072 lazily_declare_fn (sfk_move_constructor, type);
5073 fns = CLASSTYPE_CONSTRUCTORS (type);
5078 for (; fns; fns = OVL_NEXT (fns))
5080 tree fn = OVL_CURRENT (fns);
5084 if (copy_fn_p (fn) == 0)
5087 else if (copy_fn_p (fn) <= 0)
5090 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
5097 /* Actually evaluates the trait. */
5100 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
5102 enum tree_code type_code1;
5105 type_code1 = TREE_CODE (type1);
5109 case CPTK_HAS_NOTHROW_ASSIGN:
5110 type1 = strip_array_types (type1);
5111 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5112 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
5113 || (CLASS_TYPE_P (type1)
5114 && classtype_has_nothrow_assign_or_copy_p (type1,
5117 case CPTK_HAS_TRIVIAL_ASSIGN:
5118 /* ??? The standard seems to be missing the "or array of such a class
5119 type" wording for this trait. */
5120 type1 = strip_array_types (type1);
5121 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5122 && (trivial_type_p (type1)
5123 || (CLASS_TYPE_P (type1)
5124 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1))));
5126 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5127 type1 = strip_array_types (type1);
5128 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
5129 || (CLASS_TYPE_P (type1)
5130 && (t = locate_ctor (type1))
5131 && TYPE_NOTHROW_P (TREE_TYPE (t))));
5133 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5134 type1 = strip_array_types (type1);
5135 return (trivial_type_p (type1)
5136 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
5138 case CPTK_HAS_NOTHROW_COPY:
5139 type1 = strip_array_types (type1);
5140 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
5141 || (CLASS_TYPE_P (type1)
5142 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
5144 case CPTK_HAS_TRIVIAL_COPY:
5145 /* ??? The standard seems to be missing the "or array of such a class
5146 type" wording for this trait. */
5147 type1 = strip_array_types (type1);
5148 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5149 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1)));
5151 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5152 type1 = strip_array_types (type1);
5153 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5154 || (CLASS_TYPE_P (type1)
5155 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
5157 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5158 return type_has_virtual_destructor (type1);
5160 case CPTK_IS_ABSTRACT:
5161 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
5163 case CPTK_IS_BASE_OF:
5164 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5165 && DERIVED_FROM_P (type1, type2));
5168 return (NON_UNION_CLASS_TYPE_P (type1));
5170 case CPTK_IS_CONVERTIBLE_TO:
5175 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
5178 return (type_code1 == ENUMERAL_TYPE);
5180 case CPTK_IS_LITERAL_TYPE:
5181 return (literal_type_p (type1));
5184 return (pod_type_p (type1));
5186 case CPTK_IS_POLYMORPHIC:
5187 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
5189 case CPTK_IS_STD_LAYOUT:
5190 return (std_layout_type_p (type1));
5192 case CPTK_IS_TRIVIAL:
5193 return (trivial_type_p (type1));
5196 return (type_code1 == UNION_TYPE);
5204 /* Returns true if TYPE is a complete type, an array of unknown bound,
5205 or (possibly cv-qualified) void, returns false otherwise. */
5208 check_trait_type (tree type)
5210 if (COMPLETE_TYPE_P (type))
5213 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type)
5214 && COMPLETE_TYPE_P (TREE_TYPE (type)))
5217 if (VOID_TYPE_P (type))
5223 /* Process a trait expression. */
5226 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
5228 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
5229 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
5230 || kind == CPTK_HAS_NOTHROW_COPY
5231 || kind == CPTK_HAS_TRIVIAL_ASSIGN
5232 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
5233 || kind == CPTK_HAS_TRIVIAL_COPY
5234 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
5235 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
5236 || kind == CPTK_IS_ABSTRACT
5237 || kind == CPTK_IS_BASE_OF
5238 || kind == CPTK_IS_CLASS
5239 || kind == CPTK_IS_CONVERTIBLE_TO
5240 || kind == CPTK_IS_EMPTY
5241 || kind == CPTK_IS_ENUM
5242 || kind == CPTK_IS_LITERAL_TYPE
5243 || kind == CPTK_IS_POD
5244 || kind == CPTK_IS_POLYMORPHIC
5245 || kind == CPTK_IS_STD_LAYOUT
5246 || kind == CPTK_IS_TRIVIAL
5247 || kind == CPTK_IS_UNION);
5249 if (kind == CPTK_IS_CONVERTIBLE_TO)
5251 sorry ("__is_convertible_to");
5252 return error_mark_node;
5255 if (type1 == error_mark_node
5256 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
5257 && type2 == error_mark_node))
5258 return error_mark_node;
5260 if (processing_template_decl)
5262 tree trait_expr = make_node (TRAIT_EXPR);
5263 TREE_TYPE (trait_expr) = boolean_type_node;
5264 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
5265 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
5266 TRAIT_EXPR_KIND (trait_expr) = kind;
5270 complete_type (type1);
5272 complete_type (type2);
5276 case CPTK_HAS_NOTHROW_ASSIGN:
5277 case CPTK_HAS_TRIVIAL_ASSIGN:
5278 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5279 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5280 case CPTK_HAS_NOTHROW_COPY:
5281 case CPTK_HAS_TRIVIAL_COPY:
5282 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5283 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5284 case CPTK_IS_ABSTRACT:
5286 case CPTK_IS_LITERAL_TYPE:
5288 case CPTK_IS_POLYMORPHIC:
5289 case CPTK_IS_STD_LAYOUT:
5290 case CPTK_IS_TRIVIAL:
5291 if (!check_trait_type (type1))
5293 error ("incomplete type %qT not allowed", type1);
5294 return error_mark_node;
5298 case CPTK_IS_BASE_OF:
5299 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5300 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5301 && !COMPLETE_TYPE_P (type2))
5303 error ("incomplete type %qT not allowed", type2);
5304 return error_mark_node;
5313 case CPTK_IS_CONVERTIBLE_TO:
5318 return (trait_expr_value (kind, type1, type2)
5319 ? boolean_true_node : boolean_false_node);
5322 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5323 which is ignored for C++. */
5326 set_float_const_decimal64 (void)
5331 clear_float_const_decimal64 (void)
5336 float_const_decimal64_p (void)
5342 /* Return true if T is a literal type. */
5345 literal_type_p (tree t)
5347 if (SCALAR_TYPE_P (t)
5348 || TREE_CODE (t) == REFERENCE_TYPE)
5350 if (CLASS_TYPE_P (t))
5352 t = complete_type (t);
5353 gcc_assert (COMPLETE_TYPE_P (t) || errorcount);
5354 return CLASSTYPE_LITERAL_P (t);
5356 if (TREE_CODE (t) == ARRAY_TYPE)
5357 return literal_type_p (strip_array_types (t));
5361 /* If DECL is a variable declared `constexpr', require its type
5362 be literal. Return the DECL if OK, otherwise NULL. */
5365 ensure_literal_type_for_constexpr_object (tree decl)
5367 tree type = TREE_TYPE (decl);
5368 if (TREE_CODE (decl) == VAR_DECL && DECL_DECLARED_CONSTEXPR_P (decl)
5369 && !processing_template_decl)
5371 if (CLASS_TYPE_P (type) && !COMPLETE_TYPE_P (complete_type (type)))
5372 /* Don't complain here, we'll complain about incompleteness
5373 when we try to initialize the variable. */;
5374 else if (!literal_type_p (type))
5376 error ("the type %qT of constexpr variable %qD is not literal",
5384 /* Representation of entries in the constexpr function definition table. */
5386 typedef struct GTY(()) constexpr_fundef {
5391 /* This table holds all constexpr function definitions seen in
5392 the current translation unit. */
5394 static GTY ((param_is (constexpr_fundef))) htab_t constexpr_fundef_table;
5396 /* Utility function used for managing the constexpr function table.
5397 Return true if the entries pointed to by P and Q are for the
5398 same constexpr function. */
5401 constexpr_fundef_equal (const void *p, const void *q)
5403 const constexpr_fundef *lhs = (const constexpr_fundef *) p;
5404 const constexpr_fundef *rhs = (const constexpr_fundef *) q;
5405 return lhs->decl == rhs->decl;
5408 /* Utility function used for managing the constexpr function table.
5409 Return a hash value for the entry pointed to by Q. */
5411 static inline hashval_t
5412 constexpr_fundef_hash (const void *p)
5414 const constexpr_fundef *fundef = (const constexpr_fundef *) p;
5415 return DECL_UID (fundef->decl);
5418 /* Return a previously saved definition of function FUN. */
5420 static constexpr_fundef *
5421 retrieve_constexpr_fundef (tree fun)
5423 constexpr_fundef fundef = { NULL, NULL };
5424 if (constexpr_fundef_table == NULL)
5428 return (constexpr_fundef *) htab_find (constexpr_fundef_table, &fundef);
5431 /* Check whether the parameter and return types of FUN are valid for a
5432 constexpr function, and complain if COMPLAIN. */
5435 is_valid_constexpr_fn (tree fun, bool complain)
5437 tree parm = FUNCTION_FIRST_USER_PARM (fun);
5439 for (; parm != NULL; parm = TREE_CHAIN (parm))
5440 if (!literal_type_p (TREE_TYPE (parm)))
5444 error ("invalid type for parameter %d of constexpr "
5445 "function %q+#D", DECL_PARM_INDEX (parm), fun);
5448 if (!DECL_CONSTRUCTOR_P (fun))
5450 tree rettype = TREE_TYPE (TREE_TYPE (fun));
5451 if (!literal_type_p (rettype))
5455 error ("invalid return type %qT of constexpr function %q+D",
5459 /* Check this again here for cxx_eval_call_expression. */
5460 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun)
5461 && !CLASSTYPE_LITERAL_P (DECL_CONTEXT (fun)))
5465 error ("enclosing class of %q+#D is not a literal type", fun);
5472 /* Return non-null if FUN certainly designates a valid constexpr function
5473 declaration. Otherwise return NULL. Issue appropriate diagnostics
5474 if necessary. Note that we only check the declaration, not the body
5478 validate_constexpr_fundecl (tree fun)
5480 if (processing_template_decl || !DECL_DECLARED_CONSTEXPR_P (fun))
5482 else if (DECL_CLONED_FUNCTION_P (fun))
5483 /* We already checked the original function. */
5486 if (!is_valid_constexpr_fn (fun, !DECL_TEMPLATE_INFO (fun)))
5488 DECL_DECLARED_CONSTEXPR_P (fun) = false;
5495 /* Subroutine of build_constexpr_constructor_member_initializers.
5496 The expression tree T represents a data member initialization
5497 in a (constexpr) constructor definition. Build a pairing of
5498 the data member with its initializer, and prepend that pair
5499 to the existing initialization pair INITS. */
5502 build_data_member_initialization (tree t, VEC(constructor_elt,gc) **vec)
5505 if (TREE_CODE (t) == CLEANUP_POINT_EXPR)
5506 t = TREE_OPERAND (t, 0);
5507 if (TREE_CODE (t) == EXPR_STMT)
5508 t = TREE_OPERAND (t, 0);
5509 if (t == error_mark_node)
5511 if (TREE_CODE (t) == STATEMENT_LIST)
5513 tree_stmt_iterator i;
5514 for (i = tsi_start (t); !tsi_end_p (i); tsi_next (&i))
5516 if (! build_data_member_initialization (tsi_stmt (i), vec))
5521 if (TREE_CODE (t) == CLEANUP_STMT)
5523 /* We can't see a CLEANUP_STMT in a constructor for a literal class,
5524 but we can in a constexpr constructor for a non-literal class. Just
5525 ignore it; either all the initialization will be constant, in which
5526 case the cleanup can't run, or it can't be constexpr.
5527 Still recurse into CLEANUP_BODY. */
5528 return build_data_member_initialization (CLEANUP_BODY (t), vec);
5530 if (TREE_CODE (t) == CONVERT_EXPR)
5531 t = TREE_OPERAND (t, 0);
5532 if (TREE_CODE (t) == INIT_EXPR
5533 || TREE_CODE (t) == MODIFY_EXPR)
5535 member = TREE_OPERAND (t, 0);
5536 init = unshare_expr (TREE_OPERAND (t, 1));
5540 gcc_assert (TREE_CODE (t) == CALL_EXPR);
5541 member = CALL_EXPR_ARG (t, 0);
5542 /* We don't use build_cplus_new here because it complains about
5543 abstract bases. Leaving the call unwrapped means that it has the
5544 wrong type, but cxx_eval_constant_expression doesn't care. */
5545 init = unshare_expr (t);
5547 if (TREE_CODE (member) == INDIRECT_REF)
5548 member = TREE_OPERAND (member, 0);
5549 if (TREE_CODE (member) == NOP_EXPR)
5553 if (TREE_CODE (op) == ADDR_EXPR)
5555 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5556 (TREE_TYPE (TREE_TYPE (op)),
5557 TREE_TYPE (TREE_TYPE (member))));
5558 /* Initializing a cv-qualified member; we need to look through
5564 /* We don't put out anything for an empty base. */
5565 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (member))));
5566 /* But if the initializer isn't constexpr, leave it in so we
5568 if (potential_constant_expression (init))
5572 if (TREE_CODE (member) == ADDR_EXPR)
5573 member = TREE_OPERAND (member, 0);
5574 if (TREE_CODE (member) == COMPONENT_REF
5575 /* If we're initializing a member of a subaggregate, it's a vtable
5576 pointer. Leave it as COMPONENT_REF so we remember the path to get
5578 && TREE_CODE (TREE_OPERAND (member, 0)) != COMPONENT_REF)
5579 member = TREE_OPERAND (member, 1);
5580 CONSTRUCTOR_APPEND_ELT (*vec, member, init);
5584 /* Make sure that there are no statements after LAST in the constructor
5585 body represented by LIST. */
5588 check_constexpr_ctor_body (tree last, tree list)
5591 if (TREE_CODE (list) == STATEMENT_LIST)
5593 tree_stmt_iterator i = tsi_last (list);
5594 for (; !tsi_end_p (i); tsi_prev (&i))
5596 tree t = tsi_stmt (i);
5599 if (TREE_CODE (t) == BIND_EXPR)
5601 if (!check_constexpr_ctor_body (last, BIND_EXPR_BODY (t)))
5606 /* We currently allow typedefs and static_assert.
5607 FIXME allow them in the standard, too. */
5608 if (TREE_CODE (t) != STATIC_ASSERT)
5615 else if (list != last
5616 && TREE_CODE (list) != STATIC_ASSERT)
5620 error ("constexpr constructor does not have empty body");
5621 DECL_DECLARED_CONSTEXPR_P (current_function_decl) = false;
5626 /* Build compile-time evalable representations of member-initializer list
5627 for a constexpr constructor. */
5630 build_constexpr_constructor_member_initializers (tree type, tree body)
5632 VEC(constructor_elt,gc) *vec = NULL;
5634 if (TREE_CODE (body) == MUST_NOT_THROW_EXPR
5635 || TREE_CODE (body) == EH_SPEC_BLOCK)
5636 body = TREE_OPERAND (body, 0);
5637 if (TREE_CODE (body) == STATEMENT_LIST)
5638 body = STATEMENT_LIST_HEAD (body)->stmt;
5639 body = BIND_EXPR_BODY (body);
5640 if (TREE_CODE (body) == CLEANUP_POINT_EXPR)
5642 body = TREE_OPERAND (body, 0);
5643 if (TREE_CODE (body) == EXPR_STMT)
5644 body = TREE_OPERAND (body, 0);
5645 if (TREE_CODE (body) == INIT_EXPR
5646 && (same_type_ignoring_top_level_qualifiers_p
5647 (TREE_TYPE (TREE_OPERAND (body, 0)),
5648 current_class_type)))
5651 return TREE_OPERAND (body, 1);
5653 ok = build_data_member_initialization (body, &vec);
5655 else if (TREE_CODE (body) == STATEMENT_LIST)
5657 tree_stmt_iterator i;
5658 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
5660 ok = build_data_member_initialization (tsi_stmt (i), &vec);
5666 gcc_assert (errorcount > 0);
5668 return build_constructor (type, vec);
5670 return error_mark_node;
5673 /* Subroutine of register_constexpr_fundef. BODY is the body of a function
5674 declared to be constexpr, or a sub-statement thereof. Returns the
5675 return value if suitable, error_mark_node for a statement not allowed in
5676 a constexpr function, or NULL_TREE if no return value was found. */
5679 constexpr_fn_retval (tree body)
5681 switch (TREE_CODE (body))
5683 case STATEMENT_LIST:
5685 tree_stmt_iterator i;
5686 tree expr = NULL_TREE;
5687 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
5689 tree s = constexpr_fn_retval (tsi_stmt (i));
5690 if (s == error_mark_node)
5691 return error_mark_node;
5692 else if (s == NULL_TREE)
5693 /* Keep iterating. */;
5695 /* Multiple return statements. */
5696 return error_mark_node;
5704 return unshare_expr (TREE_OPERAND (body, 0));
5707 if (TREE_CODE (DECL_EXPR_DECL (body)) == USING_DECL)
5709 return error_mark_node;
5715 return error_mark_node;
5719 /* We are processing the definition of the constexpr function FUN.
5720 Check that its BODY fulfills the propriate requirements and
5721 enter it in the constexpr function definition table.
5722 For constructor BODY is actually the TREE_LIST of the
5723 member-initializer list. */
5726 register_constexpr_fundef (tree fun, tree body)
5728 constexpr_fundef entry;
5729 constexpr_fundef **slot;
5731 if (DECL_CONSTRUCTOR_P (fun))
5732 body = build_constexpr_constructor_member_initializers
5733 (DECL_CONTEXT (fun), body);
5736 if (TREE_CODE (body) == BIND_EXPR)
5737 body = BIND_EXPR_BODY (body);
5738 if (TREE_CODE (body) == EH_SPEC_BLOCK)
5739 body = EH_SPEC_STMTS (body);
5740 if (TREE_CODE (body) == MUST_NOT_THROW_EXPR)
5741 body = TREE_OPERAND (body, 0);
5742 if (TREE_CODE (body) == CLEANUP_POINT_EXPR)
5743 body = TREE_OPERAND (body, 0);
5744 body = constexpr_fn_retval (body);
5745 if (body == NULL_TREE || body == error_mark_node)
5747 error ("body of constexpr function %qD not a return-statement", fun);
5748 DECL_DECLARED_CONSTEXPR_P (fun) = false;
5753 if (!potential_rvalue_constant_expression (body))
5755 DECL_DECLARED_CONSTEXPR_P (fun) = false;
5756 if (!DECL_TEMPLATE_INFO (fun))
5757 require_potential_rvalue_constant_expression (body);
5761 /* Create the constexpr function table if necessary. */
5762 if (constexpr_fundef_table == NULL)
5763 constexpr_fundef_table = htab_create_ggc (101,
5764 constexpr_fundef_hash,
5765 constexpr_fundef_equal,
5769 slot = (constexpr_fundef **)
5770 htab_find_slot (constexpr_fundef_table, &entry, INSERT);
5772 gcc_assert (*slot == NULL);
5773 *slot = ggc_alloc_constexpr_fundef ();
5779 /* Objects of this type represent calls to constexpr functions
5780 along with the bindings of parameters to their arguments, for
5781 the purpose of compile time evaluation. */
5783 typedef struct GTY(()) constexpr_call {
5784 /* Description of the constexpr function definition. */
5785 constexpr_fundef *fundef;
5786 /* Parameter bindings enironment. A TREE_LIST where each TREE_PURPOSE
5787 is a parameter _DECL and the TREE_VALUE is the value of the parameter.
5788 Note: This arrangement is made to accomodate the use of
5789 iterative_hash_template_arg (see pt.c). If you change this
5790 representation, also change the hash calculation in
5791 cxx_eval_call_expression. */
5793 /* Result of the call.
5794 NULL means the call is being evaluated.
5795 error_mark_node means that the evaluation was erroneous;
5796 otherwise, the actuall value of the call. */
5798 /* The hash of this call; we remember it here to avoid having to
5799 recalculate it when expanding the hash table. */
5803 /* A table of all constexpr calls that have been evaluated by the
5804 compiler in this translation unit. */
5806 static GTY ((param_is (constexpr_call))) htab_t constexpr_call_table;
5808 static tree cxx_eval_constant_expression (const constexpr_call *, tree,
5809 bool, bool, bool *);
5811 /* Compute a hash value for a constexpr call representation. */
5814 constexpr_call_hash (const void *p)
5816 const constexpr_call *info = (const constexpr_call *) p;
5820 /* Return 1 if the objects pointed to by P and Q represent calls
5821 to the same constexpr function with the same arguments.
5822 Otherwise, return 0. */
5825 constexpr_call_equal (const void *p, const void *q)
5827 const constexpr_call *lhs = (const constexpr_call *) p;
5828 const constexpr_call *rhs = (const constexpr_call *) q;
5833 if (!constexpr_fundef_equal (lhs->fundef, rhs->fundef))
5835 lhs_bindings = lhs->bindings;
5836 rhs_bindings = rhs->bindings;
5837 while (lhs_bindings != NULL && rhs_bindings != NULL)
5839 tree lhs_arg = TREE_VALUE (lhs_bindings);
5840 tree rhs_arg = TREE_VALUE (rhs_bindings);
5841 gcc_assert (TREE_TYPE (lhs_arg) == TREE_TYPE (rhs_arg));
5842 if (!cp_tree_equal (lhs_arg, rhs_arg))
5844 lhs_bindings = TREE_CHAIN (lhs_bindings);
5845 rhs_bindings = TREE_CHAIN (rhs_bindings);
5847 return lhs_bindings == rhs_bindings;
5850 /* Initialize the constexpr call table, if needed. */
5853 maybe_initialize_constexpr_call_table (void)
5855 if (constexpr_call_table == NULL)
5856 constexpr_call_table = htab_create_ggc (101,
5857 constexpr_call_hash,
5858 constexpr_call_equal,
5862 /* Return true if T designates the implied `this' parameter. */
5865 is_this_parameter (tree t)
5867 return t == current_class_ptr;
5870 /* We have an expression tree T that represents a call, either CALL_EXPR
5871 or AGGR_INIT_EXPR. If the call is lexically to a named function,
5872 retrun the _DECL for that function. */
5875 get_function_named_in_call (tree t)
5878 switch (TREE_CODE (t))
5881 fun = CALL_EXPR_FN (t);
5884 case AGGR_INIT_EXPR:
5885 fun = AGGR_INIT_EXPR_FN (t);
5892 if (TREE_CODE (fun) == ADDR_EXPR
5893 && TREE_CODE (TREE_OPERAND (fun, 0)) == FUNCTION_DECL)
5894 fun = TREE_OPERAND (fun, 0);
5898 /* We have an expression tree T that represents a call, either CALL_EXPR
5899 or AGGR_INIT_EXPR. Return the Nth argument. */
5902 get_nth_callarg (tree t, int n)
5904 switch (TREE_CODE (t))
5907 return CALL_EXPR_ARG (t, n);
5909 case AGGR_INIT_EXPR:
5910 return AGGR_INIT_EXPR_ARG (t, n);
5918 /* Look up the binding of the function parameter T in a constexpr
5919 function call context CALL. */
5922 lookup_parameter_binding (const constexpr_call *call, tree t)
5924 tree b = purpose_member (t, call->bindings);
5925 return TREE_VALUE (b);
5928 /* Attempt to evaluate T which represents a call to a builtin function.
5929 We assume here that all builtin functions evaluate to scalar types
5930 represented by _CST nodes. */
5933 cxx_eval_builtin_function_call (const constexpr_call *call, tree t,
5934 bool allow_non_constant, bool addr,
5935 bool *non_constant_p)
5937 const int nargs = call_expr_nargs (t);
5938 tree *args = (tree *) alloca (nargs * sizeof (tree));
5941 for (i = 0; i < nargs; ++i)
5943 args[i] = cxx_eval_constant_expression (call, CALL_EXPR_ARG (t, i),
5944 allow_non_constant, addr,
5946 if (allow_non_constant && *non_constant_p)
5949 if (*non_constant_p)
5951 new_call = build_call_array_loc (EXPR_LOCATION (t), TREE_TYPE (t),
5952 CALL_EXPR_FN (t), nargs, args);
5953 return fold (new_call);
5956 /* TEMP is the constant value of a temporary object of type TYPE. Adjust
5957 the type of the value to match. */
5960 adjust_temp_type (tree type, tree temp)
5962 if (TREE_TYPE (temp) == type)
5964 /* Avoid wrapping an aggregate value in a NOP_EXPR. */
5965 if (TREE_CODE (temp) == CONSTRUCTOR)
5966 return build_constructor (type, CONSTRUCTOR_ELTS (temp));
5967 gcc_assert (SCALAR_TYPE_P (type));
5968 return cp_fold_convert (type, temp);
5971 /* Subroutine of cxx_eval_call_expression.
5972 We are processing a call expression (either CALL_EXPR or
5973 AGGR_INIT_EXPR) in the call context of OLD_CALL. Evaluate
5974 all arguments and bind their values to correspondings
5975 parameters, making up the NEW_CALL context. */
5978 cxx_bind_parameters_in_call (const constexpr_call *old_call, tree t,
5979 constexpr_call *new_call,
5980 bool allow_non_constant,
5981 bool *non_constant_p)
5983 const int nargs = call_expr_nargs (t);
5984 tree fun = new_call->fundef->decl;
5985 tree parms = DECL_ARGUMENTS (fun);
5987 for (i = 0; i < nargs; ++i)
5990 tree type = parms ? TREE_TYPE (parms) : void_type_node;
5991 /* For member function, the first argument is a pointer to the implied
5992 object. And for an object contruction, don't bind `this' before
5993 it is fully constructed. */
5994 if (i == 0 && DECL_CONSTRUCTOR_P (fun))
5996 x = get_nth_callarg (t, i);
5997 arg = cxx_eval_constant_expression (old_call, x, allow_non_constant,
5998 TREE_CODE (type) == REFERENCE_TYPE,
6000 /* Don't VERIFY_CONSTANT here. */
6001 if (*non_constant_p && allow_non_constant)
6003 /* Just discard ellipsis args after checking their constantitude. */
6006 if (*non_constant_p)
6007 /* Don't try to adjust the type of non-constant args. */
6010 /* Make sure the binding has the same type as the parm. */
6011 if (TREE_CODE (type) != REFERENCE_TYPE)
6012 arg = adjust_temp_type (type, arg);
6013 new_call->bindings = tree_cons (parms, arg, new_call->bindings);
6015 parms = TREE_CHAIN (parms);
6019 /* Variables and functions to manage constexpr call expansion context.
6020 These do not need to be marked for PCH or GC. */
6022 /* FIXME remember and print actual constant arguments. */
6023 static VEC(tree,heap) *call_stack = NULL;
6024 static int call_stack_tick;
6025 static int last_cx_error_tick;
6028 push_cx_call_context (tree call)
6031 if (!EXPR_HAS_LOCATION (call))
6032 SET_EXPR_LOCATION (call, input_location);
6033 VEC_safe_push (tree, heap, call_stack, call);
6034 if (VEC_length (tree, call_stack) > (unsigned) max_constexpr_depth)
6040 pop_cx_call_context (void)
6043 VEC_pop (tree, call_stack);
6047 cx_error_context (void)
6049 VEC(tree,heap) *r = NULL;
6050 if (call_stack_tick != last_cx_error_tick
6051 && !VEC_empty (tree, call_stack))
6053 last_cx_error_tick = call_stack_tick;
6057 /* Subroutine of cxx_eval_constant_expression.
6058 Evaluate the call expression tree T in the context of OLD_CALL expression
6062 cxx_eval_call_expression (const constexpr_call *old_call, tree t,
6063 bool allow_non_constant, bool addr,
6064 bool *non_constant_p)
6066 location_t loc = EXPR_LOC_OR_HERE (t);
6067 tree fun = get_function_named_in_call (t);
6069 constexpr_call new_call = { NULL, NULL, NULL, 0 };
6070 constexpr_call **slot;
6071 constexpr_call *entry;
6074 if (TREE_CODE (fun) != FUNCTION_DECL)
6076 /* Might be a constexpr function pointer. */
6077 fun = cxx_eval_constant_expression (old_call, fun, allow_non_constant,
6078 /*addr*/false, non_constant_p);
6079 if (TREE_CODE (fun) == ADDR_EXPR)
6080 fun = TREE_OPERAND (fun, 0);
6082 if (TREE_CODE (fun) != FUNCTION_DECL)
6084 if (!allow_non_constant)
6085 error_at (loc, "expression %qE does not designate a constexpr "
6087 *non_constant_p = true;
6090 if (DECL_CLONED_FUNCTION_P (fun))
6091 fun = DECL_CLONED_FUNCTION (fun);
6092 if (is_builtin_fn (fun))
6093 return cxx_eval_builtin_function_call (old_call, t, allow_non_constant,
6094 addr, non_constant_p);
6095 if (!DECL_DECLARED_CONSTEXPR_P (fun))
6097 if (!allow_non_constant)
6099 error_at (loc, "%qD is not a constexpr function", fun);
6100 if (DECL_TEMPLATE_INFO (fun)
6101 && DECL_DECLARED_CONSTEXPR_P (DECL_TEMPLATE_RESULT
6102 (DECL_TI_TEMPLATE (fun))))
6103 is_valid_constexpr_fn (fun, true);
6105 *non_constant_p = true;
6109 /* Shortcut trivial copy constructor/op=. */
6110 if (call_expr_nargs (t) == 2 && trivial_fn_p (fun))
6112 tree arg = convert_from_reference (get_nth_callarg (t, 1));
6113 return cxx_eval_constant_expression (old_call, arg, allow_non_constant,
6114 addr, non_constant_p);
6117 /* If in direct recursive call, optimize definition search. */
6118 if (old_call != NULL && old_call->fundef->decl == fun)
6119 new_call.fundef = old_call->fundef;
6122 new_call.fundef = retrieve_constexpr_fundef (fun);
6123 if (new_call.fundef == NULL || new_call.fundef->body == NULL)
6125 if (!allow_non_constant)
6126 error_at (loc, "%qD used before its definition", fun);
6127 *non_constant_p = true;
6131 cxx_bind_parameters_in_call (old_call, t, &new_call,
6132 allow_non_constant, non_constant_p);
6133 if (*non_constant_p)
6136 depth_ok = push_cx_call_context (t);
6139 = iterative_hash_template_arg (new_call.bindings,
6140 constexpr_fundef_hash (new_call.fundef));
6142 /* If we have seen this call before, we are done. */
6143 maybe_initialize_constexpr_call_table ();
6144 slot = (constexpr_call **)
6145 htab_find_slot (constexpr_call_table, &new_call, INSERT);
6149 /* We need to keep a pointer to the entry, not just the slot, as the
6150 slot can move in the call to cxx_eval_builtin_function_call. */
6151 *slot = entry = ggc_alloc_constexpr_call ();
6154 /* Calls which are in progress have their result set to NULL
6155 so that we can detect circular dependencies. */
6156 else if (entry->result == NULL)
6158 if (!allow_non_constant)
6159 error ("call has circular dependency");
6160 *non_constant_p = true;
6161 entry->result = result = error_mark_node;
6166 if (!allow_non_constant)
6167 error ("constexpr evaluation depth exceeds maximum of %d (use "
6168 "-fconstexpr-depth= to increase the maximum)",
6169 max_constexpr_depth);
6170 *non_constant_p = true;
6171 entry->result = result = error_mark_node;
6175 result = entry->result;
6176 if (!result || (result == error_mark_node && !allow_non_constant))
6177 result = (cxx_eval_constant_expression
6178 (&new_call, new_call.fundef->body,
6179 allow_non_constant, addr,
6181 if (result == error_mark_node)
6182 *non_constant_p = true;
6183 if (*non_constant_p)
6184 entry->result = result = error_mark_node;
6187 /* If this was a call to initialize an object, set the type of
6188 the CONSTRUCTOR to the type of that object. */
6189 if (DECL_CONSTRUCTOR_P (fun))
6191 tree ob_arg = get_nth_callarg (t, 0);
6192 STRIP_NOPS (ob_arg);
6193 gcc_assert (TREE_CODE (TREE_TYPE (ob_arg)) == POINTER_TYPE
6194 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (ob_arg))));
6195 result = adjust_temp_type (TREE_TYPE (TREE_TYPE (ob_arg)),
6198 entry->result = result;
6202 pop_cx_call_context ();
6203 return unshare_expr (result);
6206 /* FIXME speed this up, it's taking 16% of compile time on sieve testcase. */
6209 reduced_constant_expression_p (tree t)
6211 if (TREE_OVERFLOW_P (t))
6212 /* Integer overflow makes this not a constant expression. */
6214 /* FIXME are we calling this too much? */
6215 return initializer_constant_valid_p (t, TREE_TYPE (t)) != NULL_TREE;
6218 /* Some expressions may have constant operands but are not constant
6219 themselves, such as 1/0. Call this function (or rather, the macro
6220 following it) to check for that condition.
6222 We only call this in places that require an arithmetic constant, not in
6223 places where we might have a non-constant expression that can be a
6224 component of a constant expression, such as the address of a constexpr
6225 variable that might be dereferenced later. */
6228 verify_constant (tree t, bool allow_non_constant, bool *non_constant_p)
6230 if (!*non_constant_p && !reduced_constant_expression_p (t))
6232 if (!allow_non_constant)
6234 /* If T was already folded to a _CST with TREE_OVERFLOW set,
6235 printing the folded constant isn't helpful. */
6236 if (TREE_OVERFLOW_P (t))
6238 permerror (input_location, "overflow in constant expression");
6239 /* If we're being permissive (and are in an enforcing
6240 context), consider this constant. */
6241 if (flag_permissive)
6245 error ("%q+E is not a constant expression", t);
6247 *non_constant_p = true;
6249 return *non_constant_p;
6251 #define VERIFY_CONSTANT(X) \
6253 if (verify_constant ((X), allow_non_constant, non_constant_p)) \
6257 /* Subroutine of cxx_eval_constant_expression.
6258 Attempt to reduce the unary expression tree T to a compile time value.
6259 If successful, return the value. Otherwise issue a diagnostic
6260 and return error_mark_node. */
6263 cxx_eval_unary_expression (const constexpr_call *call, tree t,
6264 bool allow_non_constant, bool addr,
6265 bool *non_constant_p)
6268 tree orig_arg = TREE_OPERAND (t, 0);
6269 tree arg = cxx_eval_constant_expression (call, orig_arg, allow_non_constant,
6270 addr, non_constant_p);
6271 VERIFY_CONSTANT (arg);
6272 if (arg == orig_arg)
6274 r = fold_build1 (TREE_CODE (t), TREE_TYPE (t), arg);
6275 VERIFY_CONSTANT (r);
6279 /* Subroutine of cxx_eval_constant_expression.
6280 Like cxx_eval_unary_expression, except for binary expressions. */
6283 cxx_eval_binary_expression (const constexpr_call *call, tree t,
6284 bool allow_non_constant, bool addr,
6285 bool *non_constant_p)
6288 tree orig_lhs = TREE_OPERAND (t, 0);
6289 tree orig_rhs = TREE_OPERAND (t, 1);
6291 lhs = cxx_eval_constant_expression (call, orig_lhs,
6292 allow_non_constant, addr,
6294 VERIFY_CONSTANT (lhs);
6295 rhs = cxx_eval_constant_expression (call, orig_rhs,
6296 allow_non_constant, addr,
6298 VERIFY_CONSTANT (rhs);
6299 if (lhs == orig_lhs && rhs == orig_rhs)
6301 r = fold_build2 (TREE_CODE (t), TREE_TYPE (t), lhs, rhs);
6302 VERIFY_CONSTANT (r);
6306 /* Subroutine of cxx_eval_constant_expression.
6307 Attempt to evaluate condition expressions. Dead branches are not
6311 cxx_eval_conditional_expression (const constexpr_call *call, tree t,
6312 bool allow_non_constant, bool addr,
6313 bool *non_constant_p)
6315 tree val = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
6316 allow_non_constant, addr,
6318 VERIFY_CONSTANT (val);
6319 /* Don't VERIFY_CONSTANT the other operands. */
6320 if (integer_zerop (val))
6321 return cxx_eval_constant_expression (call, TREE_OPERAND (t, 2),
6322 allow_non_constant, addr,
6324 return cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
6325 allow_non_constant, addr,
6329 /* Subroutine of cxx_eval_constant_expression.
6330 Attempt to reduce a reference to an array slot. */
6333 cxx_eval_array_reference (const constexpr_call *call, tree t,
6334 bool allow_non_constant, bool addr,
6335 bool *non_constant_p)
6337 tree oldary = TREE_OPERAND (t, 0);
6338 tree ary = cxx_eval_constant_expression (call, oldary,
6339 allow_non_constant, addr,
6344 unsigned len, elem_nchars = 1;
6345 if (*non_constant_p)
6347 oldidx = TREE_OPERAND (t, 1);
6348 index = cxx_eval_constant_expression (call, oldidx,
6349 allow_non_constant, false,
6351 VERIFY_CONSTANT (index);
6352 if (addr && ary == oldary && index == oldidx)
6355 return build4 (ARRAY_REF, TREE_TYPE (t), ary, index, NULL, NULL);
6356 elem_type = TREE_TYPE (TREE_TYPE (ary));
6357 if (TREE_CODE (ary) == CONSTRUCTOR)
6358 len = CONSTRUCTOR_NELTS (ary);
6361 elem_nchars = (TYPE_PRECISION (elem_type)
6362 / TYPE_PRECISION (char_type_node));
6363 len = (unsigned) TREE_STRING_LENGTH (ary) / elem_nchars;
6365 if (compare_tree_int (index, len) >= 0)
6367 if (tree_int_cst_lt (index, array_type_nelts_top (TREE_TYPE (ary))))
6369 /* If it's within the array bounds but doesn't have an explicit
6370 initializer, it's value-initialized. */
6371 tree val = build_value_init (elem_type, tf_warning_or_error);
6372 return cxx_eval_constant_expression (call, val,
6373 allow_non_constant, addr,
6377 if (!allow_non_constant)
6378 error ("array subscript out of bound");
6379 *non_constant_p = true;
6382 i = tree_low_cst (index, 0);
6383 if (TREE_CODE (ary) == CONSTRUCTOR)
6384 return VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ary), i)->value;
6385 else if (elem_nchars == 1)
6386 return build_int_cst (cv_unqualified (TREE_TYPE (TREE_TYPE (ary))),
6387 TREE_STRING_POINTER (ary)[i]);
6390 tree type = cv_unqualified (TREE_TYPE (TREE_TYPE (ary)));
6391 return native_interpret_expr (type, (const unsigned char *)
6392 TREE_STRING_POINTER (ary)
6393 + i * elem_nchars, elem_nchars);
6395 /* Don't VERIFY_CONSTANT here. */
6398 /* Subroutine of cxx_eval_constant_expression.
6399 Attempt to reduce a field access of a value of class type. */
6402 cxx_eval_component_reference (const constexpr_call *call, tree t,
6403 bool allow_non_constant, bool addr,
6404 bool *non_constant_p)
6406 unsigned HOST_WIDE_INT i;
6409 tree part = TREE_OPERAND (t, 1);
6410 tree orig_whole = TREE_OPERAND (t, 0);
6411 tree whole = cxx_eval_constant_expression (call, orig_whole,
6412 allow_non_constant, addr,
6414 if (whole == orig_whole)
6417 return fold_build3 (COMPONENT_REF, TREE_TYPE (t),
6418 whole, part, NULL_TREE);
6419 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6421 if (!*non_constant_p && TREE_CODE (whole) != CONSTRUCTOR)
6423 if (!allow_non_constant)
6424 error ("%qE is not a constant expression", orig_whole);
6425 *non_constant_p = true;
6427 if (*non_constant_p)
6429 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole), i, field, value)
6434 if (TREE_CODE (TREE_TYPE (whole)) == UNION_TYPE)
6436 /* FIXME Mike Miller wants this to be OK. */
6437 if (!allow_non_constant)
6438 error ("accessing %qD member instead of initialized %qD member in "
6439 "constant expression", part, CONSTRUCTOR_ELT (whole, 0)->index);
6440 *non_constant_p = true;
6444 return error_mark_node;
6447 /* Subroutine of cxx_eval_constant_expression.
6448 Attempt to reduce a field access of a value of class type that is
6449 expressed as a BIT_FIELD_REF. */
6452 cxx_eval_bit_field_ref (const constexpr_call *call, tree t,
6453 bool allow_non_constant, bool addr,
6454 bool *non_constant_p)
6456 tree orig_whole = TREE_OPERAND (t, 0);
6457 tree retval, fldval, utype, mask;
6458 bool fld_seen = false;
6459 HOST_WIDE_INT istart, isize;
6460 tree whole = cxx_eval_constant_expression (call, orig_whole,
6461 allow_non_constant, addr,
6463 tree start, field, value;
6464 unsigned HOST_WIDE_INT i;
6466 if (whole == orig_whole)
6468 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6470 if (!*non_constant_p && TREE_CODE (whole) != CONSTRUCTOR)
6472 if (!allow_non_constant)
6473 error ("%qE is not a constant expression", orig_whole);
6474 *non_constant_p = true;
6476 if (*non_constant_p)
6479 start = TREE_OPERAND (t, 2);
6480 istart = tree_low_cst (start, 0);
6481 isize = tree_low_cst (TREE_OPERAND (t, 1), 0);
6482 utype = TREE_TYPE (t);
6483 if (!TYPE_UNSIGNED (utype))
6484 utype = build_nonstandard_integer_type (TYPE_PRECISION (utype), 1);
6485 retval = build_int_cst (utype, 0);
6486 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole), i, field, value)
6488 tree bitpos = bit_position (field);
6489 if (bitpos == start && DECL_SIZE (field) == TREE_OPERAND (t, 1))
6491 if (TREE_CODE (TREE_TYPE (field)) == INTEGER_TYPE
6492 && TREE_CODE (value) == INTEGER_CST
6493 && host_integerp (bitpos, 0)
6494 && host_integerp (DECL_SIZE (field), 0))
6496 HOST_WIDE_INT bit = tree_low_cst (bitpos, 0);
6497 HOST_WIDE_INT sz = tree_low_cst (DECL_SIZE (field), 0);
6498 HOST_WIDE_INT shift;
6499 if (bit >= istart && bit + sz <= istart + isize)
6501 fldval = fold_convert (utype, value);
6502 mask = build_int_cst_type (utype, -1);
6503 mask = fold_build2 (LSHIFT_EXPR, utype, mask,
6504 size_int (TYPE_PRECISION (utype) - sz));
6505 mask = fold_build2 (RSHIFT_EXPR, utype, mask,
6506 size_int (TYPE_PRECISION (utype) - sz));
6507 fldval = fold_build2 (BIT_AND_EXPR, utype, fldval, mask);
6508 shift = bit - istart;
6509 if (BYTES_BIG_ENDIAN)
6510 shift = TYPE_PRECISION (utype) - shift - sz;
6511 fldval = fold_build2 (LSHIFT_EXPR, utype, fldval,
6513 retval = fold_build2 (BIT_IOR_EXPR, utype, retval, fldval);
6519 return fold_convert (TREE_TYPE (t), retval);
6521 return error_mark_node;
6524 /* Subroutine of cxx_eval_constant_expression.
6525 Evaluate a short-circuited logical expression T in the context
6526 of a given constexpr CALL. BAILOUT_VALUE is the value for
6527 early return. CONTINUE_VALUE is used here purely for
6528 sanity check purposes. */
6531 cxx_eval_logical_expression (const constexpr_call *call, tree t,
6532 tree bailout_value, tree continue_value,
6533 bool allow_non_constant, bool addr,
6534 bool *non_constant_p)
6537 tree lhs = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
6538 allow_non_constant, addr,
6540 VERIFY_CONSTANT (lhs);
6541 if (lhs == bailout_value)
6543 gcc_assert (lhs == continue_value);
6544 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
6545 allow_non_constant, addr, non_constant_p);
6546 VERIFY_CONSTANT (r);
6550 /* REF is a COMPONENT_REF designating a particular field. V is a vector of
6551 CONSTRUCTOR elements to initialize (part of) an object containing that
6552 field. Return a pointer to the constructor_elt corresponding to the
6553 initialization of the field. */
6555 static constructor_elt *
6556 base_field_constructor_elt (VEC(constructor_elt,gc) *v, tree ref)
6558 tree aggr = TREE_OPERAND (ref, 0);
6559 tree field = TREE_OPERAND (ref, 1);
6561 constructor_elt *ce;
6563 gcc_assert (TREE_CODE (ref) == COMPONENT_REF);
6565 if (TREE_CODE (aggr) == COMPONENT_REF)
6567 constructor_elt *base_ce
6568 = base_field_constructor_elt (v, aggr);
6569 v = CONSTRUCTOR_ELTS (base_ce->value);
6572 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
6573 if (ce->index == field)
6580 /* Subroutine of cxx_eval_constant_expression.
6581 The expression tree T denotes a C-style array or a C-style
6582 aggregate. Reduce it to a constant expression. */
6585 cxx_eval_bare_aggregate (const constexpr_call *call, tree t,
6586 bool allow_non_constant, bool addr,
6587 bool *non_constant_p)
6589 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (t);
6590 VEC(constructor_elt,gc) *n = VEC_alloc (constructor_elt, gc,
6591 VEC_length (constructor_elt, v));
6592 constructor_elt *ce;
6594 bool changed = false;
6595 gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (t));
6596 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
6598 tree elt = cxx_eval_constant_expression (call, ce->value,
6599 allow_non_constant, addr,
6601 /* Don't VERIFY_CONSTANT here. */
6602 if (allow_non_constant && *non_constant_p)
6604 if (elt != ce->value)
6606 if (TREE_CODE (ce->index) == COMPONENT_REF)
6608 /* This is an initialization of a vfield inside a base
6609 subaggregate that we already initialized; push this
6610 initialization into the previous initialization. */
6611 constructor_elt *inner = base_field_constructor_elt (n, ce->index);
6615 CONSTRUCTOR_APPEND_ELT (n, ce->index, elt);
6617 if (*non_constant_p || !changed)
6620 VEC_free (constructor_elt, gc, n);
6623 t = build_constructor (TREE_TYPE (t), n);
6624 TREE_CONSTANT (t) = true;
6628 /* Subroutine of cxx_eval_constant_expression.
6629 The expression tree T is a VEC_INIT_EXPR which denotes the desired
6630 initialization of a non-static data member of array type. Reduce it to a
6633 Note that apart from value-initialization (when VALUE_INIT is true),
6634 this is only intended to support value-initialization and the
6635 initializations done by defaulted constructors for classes with
6636 non-static data members of array type. In this case, VEC_INIT_EXPR_INIT
6637 will either be NULL_TREE for the default constructor, or a COMPONENT_REF
6638 for the copy/move constructor. */
6641 cxx_eval_vec_init_1 (const constexpr_call *call, tree atype, tree init,
6642 bool value_init, bool allow_non_constant, bool addr,
6643 bool *non_constant_p)
6645 tree elttype = TREE_TYPE (atype);
6646 int max = tree_low_cst (array_type_nelts (atype), 0);
6647 VEC(constructor_elt,gc) *n = VEC_alloc (constructor_elt, gc, max + 1);
6650 /* For the default constructor, build up a call to the default
6651 constructor of the element type. We only need to handle class types
6652 here, as for a constructor to be constexpr, all members must be
6653 initialized, which for a defaulted default constructor means they must
6654 be of a class type with a constexpr default constructor. */
6659 VEC(tree,gc) *argvec = make_tree_vector ();
6660 init = build_special_member_call (NULL_TREE, complete_ctor_identifier,
6661 &argvec, elttype, LOOKUP_NORMAL,
6662 tf_warning_or_error);
6663 release_tree_vector (argvec);
6664 init = cxx_eval_constant_expression (call, init, allow_non_constant,
6665 addr, non_constant_p);
6668 if (*non_constant_p && !allow_non_constant)
6671 for (i = 0; i <= max; ++i)
6673 tree idx = build_int_cst (size_type_node, i);
6675 if (TREE_CODE (elttype) == ARRAY_TYPE)
6677 /* A multidimensional array; recurse. */
6679 eltinit = NULL_TREE;
6681 eltinit = cp_build_array_ref (input_location, init, idx,
6682 tf_warning_or_error);
6683 eltinit = cxx_eval_vec_init_1 (call, elttype, eltinit, value_init,
6684 allow_non_constant, addr,
6687 else if (value_init)
6689 eltinit = build_value_init (elttype, tf_warning_or_error);
6690 eltinit = cxx_eval_constant_expression
6691 (call, eltinit, allow_non_constant, addr, non_constant_p);
6693 else if (TREE_CODE (init) == CONSTRUCTOR)
6695 /* Initializing an element using the call to the default
6696 constructor we just built above. */
6697 eltinit = unshare_expr (init);
6701 /* Copying an element. */
6702 VEC(tree,gc) *argvec;
6703 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6704 (atype, TREE_TYPE (init)));
6705 eltinit = cp_build_array_ref (input_location, init, idx,
6706 tf_warning_or_error);
6707 if (!real_lvalue_p (init))
6708 eltinit = move (eltinit);
6709 argvec = make_tree_vector ();
6710 VEC_quick_push (tree, argvec, eltinit);
6711 eltinit = (build_special_member_call
6712 (NULL_TREE, complete_ctor_identifier, &argvec,
6713 elttype, LOOKUP_NORMAL, tf_warning_or_error));
6714 release_tree_vector (argvec);
6715 eltinit = cxx_eval_constant_expression
6716 (call, eltinit, allow_non_constant, addr, non_constant_p);
6718 if (*non_constant_p && !allow_non_constant)
6720 CONSTRUCTOR_APPEND_ELT (n, idx, eltinit);
6723 if (!*non_constant_p)
6725 init = build_constructor (TREE_TYPE (atype), n);
6726 TREE_CONSTANT (init) = true;
6731 VEC_free (constructor_elt, gc, n);
6736 cxx_eval_vec_init (const constexpr_call *call, tree t,
6737 bool allow_non_constant, bool addr,
6738 bool *non_constant_p)
6740 tree atype = TREE_TYPE (t);
6741 tree init = VEC_INIT_EXPR_INIT (t);
6742 tree r = cxx_eval_vec_init_1 (call, atype, init,
6743 VEC_INIT_EXPR_VALUE_INIT (t),
6744 allow_non_constant, addr, non_constant_p);
6745 if (*non_constant_p)
6751 /* A less strict version of fold_indirect_ref_1, which requires cv-quals to
6752 match. We want to be less strict for simple *& folding; if we have a
6753 non-const temporary that we access through a const pointer, that should
6754 work. We handle this here rather than change fold_indirect_ref_1
6755 because we're dealing with things like ADDR_EXPR of INTEGER_CST which
6756 don't really make sense outside of constant expression evaluation. Also
6757 we want to allow folding to COMPONENT_REF, which could cause trouble
6758 with TBAA in fold_indirect_ref_1.
6760 Try to keep this function synced with fold_indirect_ref_1. */
6763 cxx_fold_indirect_ref (location_t loc, tree type, tree op0, bool *empty_base)
6769 subtype = TREE_TYPE (sub);
6770 gcc_assert (POINTER_TYPE_P (subtype));
6772 if (TREE_CODE (sub) == ADDR_EXPR)
6774 tree op = TREE_OPERAND (sub, 0);
6775 tree optype = TREE_TYPE (op);
6777 /* *&CONST_DECL -> to the value of the const decl. */
6778 if (TREE_CODE (op) == CONST_DECL)
6779 return DECL_INITIAL (op);
6780 /* *&p => p; make sure to handle *&"str"[cst] here. */
6781 if (same_type_ignoring_top_level_qualifiers_p (optype, type))
6783 tree fop = fold_read_from_constant_string (op);
6789 /* *(foo *)&fooarray => fooarray[0] */
6790 else if (TREE_CODE (optype) == ARRAY_TYPE
6791 && (same_type_ignoring_top_level_qualifiers_p
6792 (type, TREE_TYPE (optype))))
6794 tree type_domain = TYPE_DOMAIN (optype);
6795 tree min_val = size_zero_node;
6796 if (type_domain && TYPE_MIN_VALUE (type_domain))
6797 min_val = TYPE_MIN_VALUE (type_domain);
6798 return build4_loc (loc, ARRAY_REF, type, op, min_val,
6799 NULL_TREE, NULL_TREE);
6801 /* *(foo *)&complexfoo => __real__ complexfoo */
6802 else if (TREE_CODE (optype) == COMPLEX_TYPE
6803 && (same_type_ignoring_top_level_qualifiers_p
6804 (type, TREE_TYPE (optype))))
6805 return fold_build1_loc (loc, REALPART_EXPR, type, op);
6806 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
6807 else if (TREE_CODE (optype) == VECTOR_TYPE
6808 && (same_type_ignoring_top_level_qualifiers_p
6809 (type, TREE_TYPE (optype))))
6811 tree part_width = TYPE_SIZE (type);
6812 tree index = bitsize_int (0);
6813 return fold_build3_loc (loc, BIT_FIELD_REF, type, op, part_width, index);
6815 /* Also handle conversion to an empty base class, which
6816 is represented with a NOP_EXPR. */
6817 else if (is_empty_class (type)
6818 && CLASS_TYPE_P (optype)
6819 && DERIVED_FROM_P (type, optype))
6824 /* *(foo *)&struct_with_foo_field => COMPONENT_REF */
6825 else if (RECORD_OR_UNION_TYPE_P (optype))
6827 tree field = TYPE_FIELDS (optype);
6828 for (; field; field = DECL_CHAIN (field))
6829 if (TREE_CODE (field) == FIELD_DECL
6830 && integer_zerop (byte_position (field))
6831 && (same_type_ignoring_top_level_qualifiers_p
6832 (TREE_TYPE (field), type)))
6834 return fold_build3 (COMPONENT_REF, type, op, field, NULL_TREE);
6839 else if (TREE_CODE (sub) == POINTER_PLUS_EXPR
6840 && TREE_CODE (TREE_OPERAND (sub, 1)) == INTEGER_CST)
6842 tree op00 = TREE_OPERAND (sub, 0);
6843 tree op01 = TREE_OPERAND (sub, 1);
6846 if (TREE_CODE (op00) == ADDR_EXPR)
6849 op00 = TREE_OPERAND (op00, 0);
6850 op00type = TREE_TYPE (op00);
6852 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
6853 if (TREE_CODE (op00type) == VECTOR_TYPE
6854 && (same_type_ignoring_top_level_qualifiers_p
6855 (type, TREE_TYPE (op00type))))
6857 HOST_WIDE_INT offset = tree_low_cst (op01, 0);
6858 tree part_width = TYPE_SIZE (type);
6859 unsigned HOST_WIDE_INT part_widthi = tree_low_cst (part_width, 0)/BITS_PER_UNIT;
6860 unsigned HOST_WIDE_INT indexi = offset * BITS_PER_UNIT;
6861 tree index = bitsize_int (indexi);
6863 if (offset/part_widthi <= TYPE_VECTOR_SUBPARTS (op00type))
6864 return fold_build3_loc (loc,
6865 BIT_FIELD_REF, type, op00,
6869 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
6870 else if (TREE_CODE (op00type) == COMPLEX_TYPE
6871 && (same_type_ignoring_top_level_qualifiers_p
6872 (type, TREE_TYPE (op00type))))
6874 tree size = TYPE_SIZE_UNIT (type);
6875 if (tree_int_cst_equal (size, op01))
6876 return fold_build1_loc (loc, IMAGPART_EXPR, type, op00);
6878 /* ((foo *)&fooarray)[1] => fooarray[1] */
6879 else if (TREE_CODE (op00type) == ARRAY_TYPE
6880 && (same_type_ignoring_top_level_qualifiers_p
6881 (type, TREE_TYPE (op00type))))
6883 tree type_domain = TYPE_DOMAIN (op00type);
6884 tree min_val = size_zero_node;
6885 if (type_domain && TYPE_MIN_VALUE (type_domain))
6886 min_val = TYPE_MIN_VALUE (type_domain);
6887 op01 = size_binop_loc (loc, EXACT_DIV_EXPR, op01,
6888 TYPE_SIZE_UNIT (type));
6889 op01 = size_binop_loc (loc, PLUS_EXPR, op01, min_val);
6890 return build4_loc (loc, ARRAY_REF, type, op00, op01,
6891 NULL_TREE, NULL_TREE);
6893 /* ((foo *)&struct_with_foo_field)[1] => COMPONENT_REF */
6894 else if (RECORD_OR_UNION_TYPE_P (op00type))
6896 tree field = TYPE_FIELDS (op00type);
6897 for (; field; field = DECL_CHAIN (field))
6898 if (TREE_CODE (field) == FIELD_DECL
6899 && tree_int_cst_equal (byte_position (field), op01)
6900 && (same_type_ignoring_top_level_qualifiers_p
6901 (TREE_TYPE (field), type)))
6903 return fold_build3 (COMPONENT_REF, type, op00,
6910 /* *(foo *)fooarrptreturn> (*fooarrptr)[0] */
6911 else if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
6912 && (same_type_ignoring_top_level_qualifiers_p
6913 (type, TREE_TYPE (TREE_TYPE (subtype)))))
6916 tree min_val = size_zero_node;
6917 sub = cxx_fold_indirect_ref (loc, TREE_TYPE (subtype), sub, NULL);
6919 sub = build1_loc (loc, INDIRECT_REF, TREE_TYPE (subtype), sub);
6920 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
6921 if (type_domain && TYPE_MIN_VALUE (type_domain))
6922 min_val = TYPE_MIN_VALUE (type_domain);
6923 return build4_loc (loc, ARRAY_REF, type, sub, min_val, NULL_TREE,
6931 cxx_eval_indirect_ref (const constexpr_call *call, tree t,
6932 bool allow_non_constant, bool addr,
6933 bool *non_constant_p)
6935 tree orig_op0 = TREE_OPERAND (t, 0);
6936 tree op0 = cxx_eval_constant_expression (call, orig_op0, allow_non_constant,
6937 /*addr*/false, non_constant_p);
6938 bool empty_base = false;
6941 /* Don't VERIFY_CONSTANT here. */
6942 if (*non_constant_p)
6945 r = cxx_fold_indirect_ref (EXPR_LOCATION (t), TREE_TYPE (t), op0,
6949 r = cxx_eval_constant_expression (call, r, allow_non_constant,
6950 addr, non_constant_p);
6955 if (TREE_CODE (sub) == ADDR_EXPR
6956 || TREE_CODE (sub) == POINTER_PLUS_EXPR)
6958 gcc_assert (!same_type_ignoring_top_level_qualifiers_p
6959 (TREE_TYPE (TREE_TYPE (sub)), TREE_TYPE (t)));
6960 /* FIXME Mike Miller wants this to be OK. */
6961 if (!allow_non_constant)
6962 error ("accessing value of %qE through a %qT glvalue in a "
6963 "constant expression", build_fold_indirect_ref (sub),
6965 *non_constant_p = true;
6970 /* If we're pulling out the value of an empty base, make sure
6971 that the whole object is constant and then return an empty
6975 VERIFY_CONSTANT (r);
6976 r = build_constructor (TREE_TYPE (t), NULL);
6977 TREE_CONSTANT (r) = true;
6985 /* Complain about R, a VAR_DECL, not being usable in a constant expression.
6986 Shared between potential_constant_expression and
6987 cxx_eval_constant_expression. */
6990 non_const_var_error (tree r)
6992 tree type = TREE_TYPE (r);
6993 error ("the value of %qD is not usable in a constant "
6995 /* Avoid error cascade. */
6996 if (DECL_INITIAL (r) == error_mark_node)
6998 if (DECL_DECLARED_CONSTEXPR_P (r))
6999 inform (DECL_SOURCE_LOCATION (r),
7000 "%qD used in its own initializer", r);
7001 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type))
7003 if (!CP_TYPE_CONST_P (type))
7004 inform (DECL_SOURCE_LOCATION (r),
7005 "%q#D is not const", r);
7006 else if (CP_TYPE_VOLATILE_P (type))
7007 inform (DECL_SOURCE_LOCATION (r),
7008 "%q#D is volatile", r);
7009 else if (!DECL_INITIAL (r)
7010 || !TREE_CONSTANT (DECL_INITIAL (r)))
7011 inform (DECL_SOURCE_LOCATION (r),
7012 "%qD was not initialized with a constant "
7019 if (cxx_dialect >= cxx0x && !DECL_DECLARED_CONSTEXPR_P (r))
7020 inform (DECL_SOURCE_LOCATION (r),
7021 "%qD was not declared %<constexpr%>", r);
7023 inform (DECL_SOURCE_LOCATION (r),
7024 "%qD does not have integral or enumeration type",
7029 /* Attempt to reduce the expression T to a constant value.
7030 On failure, issue diagnostic and return error_mark_node. */
7031 /* FIXME unify with c_fully_fold */
7034 cxx_eval_constant_expression (const constexpr_call *call, tree t,
7035 bool allow_non_constant, bool addr,
7036 bool *non_constant_p)
7040 if (t == error_mark_node)
7042 *non_constant_p = true;
7045 if (CONSTANT_CLASS_P (t))
7047 if (TREE_CODE (t) == PTRMEM_CST)
7048 t = cplus_expand_constant (t);
7051 if (TREE_CODE (t) != NOP_EXPR
7052 && reduced_constant_expression_p (t))
7055 switch (TREE_CODE (t))
7060 /* else fall through. */
7062 r = integral_constant_value (t);
7063 if (TREE_CODE (r) == TARGET_EXPR
7064 && TREE_CODE (TARGET_EXPR_INITIAL (r)) == CONSTRUCTOR)
7065 r = TARGET_EXPR_INITIAL (r);
7068 if (!allow_non_constant)
7069 non_const_var_error (r);
7070 *non_constant_p = true;
7080 if (call && DECL_CONTEXT (t) == call->fundef->decl)
7081 r = lookup_parameter_binding (call, t);
7083 /* Defer in case this is only used for its type. */;
7086 if (!allow_non_constant)
7087 error ("%qE is not a constant expression", t);
7088 *non_constant_p = true;
7093 case AGGR_INIT_EXPR:
7094 r = cxx_eval_call_expression (call, t, allow_non_constant, addr,
7100 /* Pass false for 'addr' because these codes indicate
7101 initialization of a temporary. */
7102 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
7103 allow_non_constant, false,
7105 if (!*non_constant_p)
7106 /* Adjust the type of the result to the type of the temporary. */
7107 r = adjust_temp_type (TREE_TYPE (t), r);
7111 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
7112 allow_non_constant, addr,
7117 case NON_LVALUE_EXPR:
7118 case TRY_CATCH_EXPR:
7119 case CLEANUP_POINT_EXPR:
7120 case MUST_NOT_THROW_EXPR:
7122 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
7123 allow_non_constant, addr,
7127 /* These differ from cxx_eval_unary_expression in that this doesn't
7128 check for a constant operand or result; an address can be
7129 constant without its operand being, and vice versa. */
7131 r = cxx_eval_indirect_ref (call, t, allow_non_constant, addr,
7137 tree oldop = TREE_OPERAND (t, 0);
7138 tree op = cxx_eval_constant_expression (call, oldop,
7142 /* Don't VERIFY_CONSTANT here. */
7143 if (*non_constant_p)
7145 /* This function does more aggressive folding than fold itself. */
7146 r = build_fold_addr_expr_with_type (op, TREE_TYPE (t));
7147 if (TREE_CODE (r) == ADDR_EXPR && TREE_OPERAND (r, 0) == oldop)
7155 case FIX_TRUNC_EXPR:
7160 case TRUTH_NOT_EXPR:
7161 case FIXED_CONVERT_EXPR:
7162 r = cxx_eval_unary_expression (call, t, allow_non_constant, addr,
7168 /* check_return_expr sometimes wraps a TARGET_EXPR in a
7169 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
7170 introduced by build_call_a. */
7171 tree op0 = TREE_OPERAND (t, 0);
7172 tree op1 = TREE_OPERAND (t, 1);
7174 if ((TREE_CODE (op0) == TARGET_EXPR && op1 == TARGET_EXPR_SLOT (op0))
7175 || TREE_CODE (op1) == EMPTY_CLASS_EXPR)
7176 r = cxx_eval_constant_expression (call, op0, allow_non_constant,
7177 addr, non_constant_p);
7180 /* Check that the LHS is constant and then discard it. */
7181 cxx_eval_constant_expression (call, op0, allow_non_constant,
7182 false, non_constant_p);
7183 r = cxx_eval_constant_expression (call, op1, allow_non_constant,
7184 addr, non_constant_p);
7189 case POINTER_PLUS_EXPR:
7193 case TRUNC_DIV_EXPR:
7195 case FLOOR_DIV_EXPR:
7196 case ROUND_DIV_EXPR:
7197 case TRUNC_MOD_EXPR:
7199 case ROUND_MOD_EXPR:
7201 case EXACT_DIV_EXPR:
7211 case TRUTH_XOR_EXPR:
7218 case UNORDERED_EXPR:
7227 r = cxx_eval_binary_expression (call, t, allow_non_constant, addr,
7231 /* fold can introduce non-IF versions of these; still treat them as
7232 short-circuiting. */
7233 case TRUTH_AND_EXPR:
7234 case TRUTH_ANDIF_EXPR:
7235 r = cxx_eval_logical_expression (call, t, boolean_false_node,
7237 allow_non_constant, addr,
7242 case TRUTH_ORIF_EXPR:
7243 r = cxx_eval_logical_expression (call, t, boolean_true_node,
7245 allow_non_constant, addr,
7250 r = cxx_eval_array_reference (call, t, allow_non_constant, addr,
7255 r = cxx_eval_component_reference (call, t, allow_non_constant, addr,
7260 r = cxx_eval_bit_field_ref (call, t, allow_non_constant, addr,
7266 r = cxx_eval_conditional_expression (call, t, allow_non_constant, addr,
7271 r = cxx_eval_bare_aggregate (call, t, allow_non_constant, addr,
7276 /* We can get this in a defaulted constructor for a class with a
7277 non-static data member of array type. Either the initializer will
7278 be NULL, meaning default-initialization, or it will be an lvalue
7279 or xvalue of the same type, meaning direct-initialization from the
7280 corresponding member. */
7281 r = cxx_eval_vec_init (call, t, allow_non_constant, addr,
7286 case VIEW_CONVERT_EXPR:
7289 tree oldop = TREE_OPERAND (t, 0);
7291 tree to = TREE_TYPE (t);
7292 tree source = TREE_TYPE (op);
7293 if (TYPE_PTR_P (source) && ARITHMETIC_TYPE_P (to)
7294 && !(TREE_CODE (op) == COMPONENT_REF
7295 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (op, 0)))))
7297 if (!allow_non_constant)
7298 error ("conversion of expression %qE of pointer type "
7299 "cannot yield a constant expression", op);
7300 *non_constant_p = true;
7303 op = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
7304 allow_non_constant, addr,
7306 if (*non_constant_p)
7309 /* We didn't fold at the top so we could check for ptr-int
7312 r = fold_build1 (TREE_CODE (t), to, op);
7313 /* Conversion of an out-of-range value has implementation-defined
7314 behavior; the language considers it different from arithmetic
7315 overflow, which is undefined. */
7316 if (TREE_OVERFLOW_P (r) && !TREE_OVERFLOW_P (op))
7317 TREE_OVERFLOW (r) = false;
7321 case EMPTY_CLASS_EXPR:
7322 /* This is good enough for a function argument that might not get
7323 used, and they can't do anything with it, so just return it. */
7327 case DYNAMIC_CAST_EXPR:
7328 case PSEUDO_DTOR_EXPR:
7329 case PREINCREMENT_EXPR:
7330 case POSTINCREMENT_EXPR:
7331 case PREDECREMENT_EXPR:
7332 case POSTDECREMENT_EXPR:
7336 case VEC_DELETE_EXPR:
7340 /* GCC internal stuff. */
7343 case WITH_CLEANUP_EXPR:
7344 case STATEMENT_LIST:
7346 case NON_DEPENDENT_EXPR:
7350 if (!allow_non_constant)
7351 error_at (EXPR_LOC_OR_HERE (t),
7352 "expression %qE is not a constant-expression", t);
7353 *non_constant_p = true;
7357 internal_error ("unexpected expression %qE of kind %s", t,
7358 tree_code_name[TREE_CODE (t)]);
7359 *non_constant_p = true;
7363 if (r == error_mark_node)
7364 *non_constant_p = true;
7366 if (*non_constant_p)
7373 cxx_eval_outermost_constant_expr (tree t, bool allow_non_constant)
7375 bool non_constant_p = false;
7376 tree r = cxx_eval_constant_expression (NULL, t, allow_non_constant,
7377 false, &non_constant_p);
7379 verify_constant (r, allow_non_constant, &non_constant_p);
7381 if (non_constant_p && !allow_non_constant)
7382 return error_mark_node;
7383 else if (non_constant_p && TREE_CONSTANT (t))
7385 /* This isn't actually constant, so unset TREE_CONSTANT. */
7386 if (EXPR_P (t) || TREE_CODE (t) == CONSTRUCTOR)
7389 r = build_nop (TREE_TYPE (t), t);
7390 TREE_CONSTANT (r) = false;
7393 else if (non_constant_p || r == t)
7395 else if (TREE_CODE (r) == CONSTRUCTOR && CLASS_TYPE_P (TREE_TYPE (r)))
7397 if (TREE_CODE (t) == TARGET_EXPR
7398 && TARGET_EXPR_INITIAL (t) == r)
7402 r = get_target_expr (r);
7403 TREE_CONSTANT (r) = true;
7411 /* Returns true if T is a valid subexpression of a constant expression,
7412 even if it isn't itself a constant expression. */
7415 is_sub_constant_expr (tree t)
7417 bool non_constant_p = false;
7418 cxx_eval_constant_expression (NULL, t, true, false, &non_constant_p);
7419 return !non_constant_p;
7422 /* If T represents a constant expression returns its reduced value.
7423 Otherwise return error_mark_node. If T is dependent, then
7427 cxx_constant_value (tree t)
7429 return cxx_eval_outermost_constant_expr (t, false);
7432 /* If T is a constant expression, returns its reduced value.
7433 Otherwise, if T does not have TREE_CONSTANT set, returns T.
7434 Otherwise, returns a version of T without TREE_CONSTANT. */
7437 maybe_constant_value (tree t)
7441 if (type_dependent_expression_p (t)
7442 || type_unknown_p (t)
7443 || !potential_constant_expression (t)
7444 || value_dependent_expression_p (t))
7446 if (TREE_OVERFLOW_P (t))
7448 t = build_nop (TREE_TYPE (t), t);
7449 TREE_CONSTANT (t) = false;
7454 r = cxx_eval_outermost_constant_expr (t, true);
7455 #ifdef ENABLE_CHECKING
7456 /* cp_tree_equal looks through NOPs, so allow them. */
7458 || CONVERT_EXPR_P (t)
7459 || (TREE_CONSTANT (t) && !TREE_CONSTANT (r))
7460 || !cp_tree_equal (r, t));
7465 /* Like maybe_constant_value, but returns a CONSTRUCTOR directly, rather
7466 than wrapped in a TARGET_EXPR. */
7469 maybe_constant_init (tree t)
7471 t = maybe_constant_value (t);
7472 if (TREE_CODE (t) == TARGET_EXPR)
7474 tree init = TARGET_EXPR_INITIAL (t);
7475 if (TREE_CODE (init) == CONSTRUCTOR
7476 && TREE_CONSTANT (init))
7483 /* FIXME see ADDR_EXPR section in potential_constant_expression_1. */
7484 /* Return true if the object referred to by REF has automatic or thread
7487 enum { ck_ok, ck_bad, ck_unknown };
7489 check_automatic_or_tls (tree ref)
7491 enum machine_mode mode;
7492 HOST_WIDE_INT bitsize, bitpos;
7494 int volatilep = 0, unsignedp = 0;
7495 tree decl = get_inner_reference (ref, &bitsize, &bitpos, &offset,
7496 &mode, &unsignedp, &volatilep, false);
7499 /* If there isn't a decl in the middle, we don't know the linkage here,
7500 and this isn't a constant expression anyway. */
7503 dk = decl_storage_duration (decl);
7504 return (dk == dk_auto || dk == dk_thread) ? ck_bad : ck_ok;
7508 /* Return true if the DECL designates a builtin function that is
7509 morally constexpr, in the sense that its parameter types and
7510 return type are literal types and the compiler is allowed to
7511 fold its invocations. */
7514 morally_constexpr_builtin_function_p (tree decl)
7516 tree funtype = TREE_TYPE (decl);
7519 if (!is_builtin_fn (decl))
7521 if (!literal_type_p (TREE_TYPE (funtype)))
7523 for (t = TYPE_ARG_TYPES (funtype); t != NULL ; t = TREE_CHAIN (t))
7525 if (t == void_list_node)
7527 if (!literal_type_p (TREE_VALUE (t)))
7530 /* We assume no varargs builtins are suitable. */
7534 /* Return true if T denotes a potentially constant expression. Issue
7535 diagnostic as appropriate under control of FLAGS. If WANT_RVAL is true,
7536 an lvalue-rvalue conversion is implied.
7538 C++0x [expr.const] used to say
7540 6 An expression is a potential constant expression if it is
7541 a constant expression where all occurences of function
7542 parameters are replaced by arbitrary constant expressions
7543 of the appropriate type.
7545 2 A conditional expression is a constant expression unless it
7546 involves one of the following as a potentially evaluated
7547 subexpression (3.2), but subexpressions of logical AND (5.14),
7548 logical OR (5.15), and conditional (5.16) operations that are
7549 not evaluated are not considered. */
7552 potential_constant_expression_1 (tree t, bool want_rval, tsubst_flags_t flags)
7554 enum { any = false, rval = true };
7558 /* C++98 has different rules for the form of a constant expression that
7559 are enforced in the parser, so we can assume that anything that gets
7560 this far is suitable. */
7561 if (cxx_dialect < cxx0x)
7564 if (t == error_mark_node)
7568 if (TREE_THIS_VOLATILE (t))
7570 if (flags & tf_error)
7571 error ("expression %qE has side-effects", t);
7574 if (CONSTANT_CLASS_P (t))
7576 if (TREE_OVERFLOW (t))
7578 if (flags & tf_error)
7580 permerror (EXPR_LOC_OR_HERE (t),
7581 "overflow in constant expression");
7582 if (flag_permissive)
7590 switch (TREE_CODE (t))
7596 case TEMPLATE_ID_EXPR:
7603 case TEMPLATE_PARM_INDEX:
7605 case IDENTIFIER_NODE:
7606 /* We can see a FIELD_DECL in a pointer-to-member expression. */
7611 /* -- this (5.1) unless it appears as the postfix-expression in a
7612 class member access expression, including the result of the
7613 implicit transformation in the body of the non-static
7614 member function (9.3.1); */
7615 /* FIXME this restriction seems pointless since the standard dropped
7616 "potential constant expression". */
7617 if (is_this_parameter (t))
7619 if (flags & tf_error)
7620 error ("%qE is not a potential constant expression", t);
7625 case AGGR_INIT_EXPR:
7627 /* -- an invocation of a function other than a constexpr function
7628 or a constexpr constructor. */
7630 tree fun = get_function_named_in_call (t);
7631 const int nargs = call_expr_nargs (t);
7634 if (is_overloaded_fn (fun))
7636 if (TREE_CODE (fun) == FUNCTION_DECL)
7638 if (builtin_valid_in_constant_expr_p (fun))
7640 if (!DECL_DECLARED_CONSTEXPR_P (fun)
7641 && !morally_constexpr_builtin_function_p (fun))
7643 if (flags & tf_error)
7644 error ("%qD is not %<constexpr%>", fun);
7647 /* A call to a non-static member function takes the address
7648 of the object as the first argument. But in a constant
7649 expression the address will be folded away, so look
7651 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun)
7652 && !DECL_CONSTRUCTOR_P (fun))
7654 tree x = get_nth_callarg (t, 0);
7655 if (is_this_parameter (x))
7657 else if (!potential_constant_expression_1 (x, rval, flags))
7659 if (flags & tf_error)
7660 error ("object argument is not a potential "
7661 "constant expression");
7668 fun = get_first_fn (fun);
7669 /* Skip initial arguments to base constructors. */
7670 if (DECL_BASE_CONSTRUCTOR_P (fun))
7671 i = num_artificial_parms_for (fun);
7672 fun = DECL_ORIGIN (fun);
7676 if (potential_constant_expression_1 (fun, rval, flags))
7677 /* Might end up being a constant function pointer. */;
7680 if (flags & tf_error)
7681 error ("%qE is not a function name", fun);
7685 for (; i < nargs; ++i)
7687 tree x = get_nth_callarg (t, i);
7688 if (!potential_constant_expression_1 (x, rval, flags))
7690 if (flags & tf_error)
7691 error ("argument in position %qP is not a "
7692 "potential constant expression", i);
7699 case NON_LVALUE_EXPR:
7700 /* -- an lvalue-to-rvalue conversion (4.1) unless it is applied to
7701 -- an lvalue of integral type that refers to a non-volatile
7702 const variable or static data member initialized with
7703 constant expressions, or
7705 -- an lvalue of literal type that refers to non-volatile
7706 object defined with constexpr, or that refers to a
7707 sub-object of such an object; */
7708 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval, flags);
7711 if (want_rval && !decl_constant_var_p (t)
7712 && !dependent_type_p (TREE_TYPE (t)))
7714 if (flags & tf_error)
7715 non_const_var_error (t);
7722 case VIEW_CONVERT_EXPR:
7723 /* -- an array-to-pointer conversion that is applied to an lvalue
7724 that designates an object with thread or automatic storage
7725 duration; FIXME not implemented as it breaks constexpr arrays;
7726 need to fix the standard
7727 -- a type conversion from a pointer or pointer-to-member type
7728 to a literal type. */
7730 tree from = TREE_OPERAND (t, 0);
7731 tree source = TREE_TYPE (from);
7732 tree target = TREE_TYPE (t);
7733 if (TYPE_PTR_P (source) && ARITHMETIC_TYPE_P (target)
7734 && !(TREE_CODE (from) == COMPONENT_REF
7735 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (from, 0)))))
7737 if (flags & tf_error)
7738 error ("conversion of expression %qE of pointer type "
7739 "cannot yield a constant expression", from);
7742 return (potential_constant_expression_1
7743 (from, TREE_CODE (t) != VIEW_CONVERT_EXPR, flags));
7747 /* -- a unary operator & that is applied to an lvalue that
7748 designates an object with thread or automatic storage
7750 t = TREE_OPERAND (t, 0);
7752 /* FIXME adjust when issue 1197 is fully resolved. For now don't do
7753 any checking here, as we might dereference the pointer later. If
7754 we remove this code, also remove check_automatic_or_tls. */
7755 i = check_automatic_or_tls (t);
7760 if (flags & tf_error)
7761 error ("address-of an object %qE with thread local or "
7762 "automatic storage is not a constant expression", t);
7766 return potential_constant_expression_1 (t, any, flags);
7772 /* -- a class member access unless its postfix-expression is
7773 of literal type or of pointer to literal type. */
7774 /* This test would be redundant, as it follows from the
7775 postfix-expression being a potential constant expression. */
7776 return potential_constant_expression_1 (TREE_OPERAND (t, 0),
7779 case EXPR_PACK_EXPANSION:
7780 return potential_constant_expression_1 (PACK_EXPANSION_PATTERN (t),
7785 tree x = TREE_OPERAND (t, 0);
7787 if (is_this_parameter (x))
7789 if (DECL_CONSTRUCTOR_P (DECL_CONTEXT (x)) && want_rval)
7791 if (flags & tf_error)
7792 sorry ("use of the value of the object being constructed "
7793 "in a constant expression");
7798 return potential_constant_expression_1 (x, rval, flags);
7802 case DYNAMIC_CAST_EXPR:
7803 case PSEUDO_DTOR_EXPR:
7804 case PREINCREMENT_EXPR:
7805 case POSTINCREMENT_EXPR:
7806 case PREDECREMENT_EXPR:
7807 case POSTDECREMENT_EXPR:
7811 case VEC_DELETE_EXPR:
7815 /* GCC internal stuff. */
7818 case WITH_CLEANUP_EXPR:
7819 case CLEANUP_POINT_EXPR:
7820 case MUST_NOT_THROW_EXPR:
7821 case TRY_CATCH_EXPR:
7822 case STATEMENT_LIST:
7823 /* Don't bother trying to define a subset of statement-expressions to
7824 be constant-expressions, at least for now. */
7828 if (flags & tf_error)
7829 error ("expression %qE is not a constant-expression", t);
7833 /* -- a typeid expression whose operand is of polymorphic
7836 tree e = TREE_OPERAND (t, 0);
7837 if (!TYPE_P (e) && !type_dependent_expression_p (e)
7838 && TYPE_POLYMORPHIC_P (TREE_TYPE (e)))
7840 if (flags & tf_error)
7841 error ("typeid-expression is not a constant expression "
7842 "because %qE is of polymorphic type", e);
7849 /* -- a subtraction where both operands are pointers. */
7850 if (TYPE_PTR_P (TREE_OPERAND (t, 0))
7851 && TYPE_PTR_P (TREE_OPERAND (t, 1)))
7853 if (flags & tf_error)
7854 error ("difference of two pointer expressions is not "
7855 "a constant expression");
7867 /* -- a relational or equality operator where at least
7868 one of the operands is a pointer. */
7869 if (TYPE_PTR_P (TREE_OPERAND (t, 0))
7870 || TYPE_PTR_P (TREE_OPERAND (t, 1)))
7872 if (flags & tf_error)
7873 error ("pointer comparison expression is not a "
7874 "constant expression");
7882 if (TYPE_P (TREE_OPERAND (t, 0)))
7884 /* else fall through. */
7890 case FIX_TRUNC_EXPR:
7894 case TRUTH_NOT_EXPR:
7895 case FIXED_CONVERT_EXPR:
7896 case UNARY_PLUS_EXPR:
7897 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval,
7901 case CONST_CAST_EXPR:
7902 case STATIC_CAST_EXPR:
7903 case REINTERPRET_CAST_EXPR:
7904 return (potential_constant_expression_1
7905 (TREE_OPERAND (t, 0),
7906 TREE_CODE (TREE_TYPE (t)) != REFERENCE_TYPE, flags));
7909 case NON_DEPENDENT_EXPR:
7910 /* For convenience. */
7912 return potential_constant_expression_1 (TREE_OPERAND (t, 0),
7916 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
7921 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
7926 VEC(constructor_elt, gc) *v = CONSTRUCTOR_ELTS (t);
7927 constructor_elt *ce;
7928 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
7929 if (!potential_constant_expression_1 (ce->value, want_rval, flags))
7936 gcc_assert (TREE_PURPOSE (t) == NULL_TREE
7937 || DECL_P (TREE_PURPOSE (t)));
7938 if (!potential_constant_expression_1 (TREE_VALUE (t), want_rval,
7941 if (TREE_CHAIN (t) == NULL_TREE)
7943 return potential_constant_expression_1 (TREE_CHAIN (t), want_rval,
7947 case TRUNC_DIV_EXPR:
7949 case FLOOR_DIV_EXPR:
7950 case ROUND_DIV_EXPR:
7951 case TRUNC_MOD_EXPR:
7953 case ROUND_MOD_EXPR:
7955 tree denom = TREE_OPERAND (t, 1);
7956 /* We can't call maybe_constant_value on an expression
7957 that hasn't been through fold_non_dependent_expr yet. */
7958 if (!processing_template_decl)
7959 denom = maybe_constant_value (denom);
7960 if (integer_zerop (denom))
7962 if (flags & tf_error)
7963 error ("division by zero is not a constant-expression");
7975 /* check_return_expr sometimes wraps a TARGET_EXPR in a
7976 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
7977 introduced by build_call_a. */
7978 tree op0 = TREE_OPERAND (t, 0);
7979 tree op1 = TREE_OPERAND (t, 1);
7981 if ((TREE_CODE (op0) == TARGET_EXPR && op1 == TARGET_EXPR_SLOT (op0))
7982 || TREE_CODE (op1) == EMPTY_CLASS_EXPR)
7983 return potential_constant_expression_1 (op0, want_rval, flags);
7988 /* If the first operand is the non-short-circuit constant, look at
7989 the second operand; otherwise we only care about the first one for
7991 case TRUTH_AND_EXPR:
7992 case TRUTH_ANDIF_EXPR:
7993 tmp = boolean_true_node;
7996 case TRUTH_ORIF_EXPR:
7997 tmp = boolean_false_node;
7999 if (TREE_OPERAND (t, 0) == tmp)
8000 return potential_constant_expression_1 (TREE_OPERAND (t, 1), rval, flags);
8002 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval, flags);
8006 case POINTER_PLUS_EXPR:
8008 case EXACT_DIV_EXPR:
8018 case TRUTH_XOR_EXPR:
8019 case UNORDERED_EXPR:
8031 case ARRAY_RANGE_REF:
8035 for (i = 0; i < 2; ++i)
8036 if (!potential_constant_expression_1 (TREE_OPERAND (t, i),
8043 /* If the condition is a known constant, we know which of the legs we
8044 care about; otherwise we only require that the condition and
8045 either of the legs be potentially constant. */
8046 tmp = TREE_OPERAND (t, 0);
8047 if (!potential_constant_expression_1 (tmp, rval, flags))
8049 else if (integer_zerop (tmp))
8050 return potential_constant_expression_1 (TREE_OPERAND (t, 2),
8052 else if (TREE_CODE (tmp) == INTEGER_CST)
8053 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
8055 for (i = 1; i < 3; ++i)
8056 if (potential_constant_expression_1 (TREE_OPERAND (t, i),
8057 want_rval, tf_none))
8059 if (flags & tf_error)
8060 error ("expression %qE is not a constant-expression", t);
8064 if (VEC_INIT_EXPR_IS_CONSTEXPR (t))
8066 if (flags & tf_error)
8068 error ("non-constant array initialization");
8069 diagnose_non_constexpr_vec_init (t);
8074 sorry ("unexpected ast of kind %s", tree_code_name[TREE_CODE (t)]);
8080 /* The main entry point to the above. */
8083 potential_constant_expression (tree t)
8085 return potential_constant_expression_1 (t, false, tf_none);
8088 /* As above, but require a constant rvalue. */
8091 potential_rvalue_constant_expression (tree t)
8093 return potential_constant_expression_1 (t, true, tf_none);
8096 /* Like above, but complain about non-constant expressions. */
8099 require_potential_constant_expression (tree t)
8101 return potential_constant_expression_1 (t, false, tf_warning_or_error);
8104 /* Cross product of the above. */
8107 require_potential_rvalue_constant_expression (tree t)
8109 return potential_constant_expression_1 (t, true, tf_warning_or_error);
8112 /* Constructor for a lambda expression. */
8115 build_lambda_expr (void)
8117 tree lambda = make_node (LAMBDA_EXPR);
8118 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) = CPLD_NONE;
8119 LAMBDA_EXPR_CAPTURE_LIST (lambda) = NULL_TREE;
8120 LAMBDA_EXPR_THIS_CAPTURE (lambda) = NULL_TREE;
8121 LAMBDA_EXPR_RETURN_TYPE (lambda) = NULL_TREE;
8122 LAMBDA_EXPR_MUTABLE_P (lambda) = false;
8126 /* Create the closure object for a LAMBDA_EXPR. */
8129 build_lambda_object (tree lambda_expr)
8131 /* Build aggregate constructor call.
8132 - cp_parser_braced_list
8133 - cp_parser_functional_cast */
8134 VEC(constructor_elt,gc) *elts = NULL;
8135 tree node, expr, type;
8136 location_t saved_loc;
8138 if (processing_template_decl)
8141 /* Make sure any error messages refer to the lambda-introducer. */
8142 saved_loc = input_location;
8143 input_location = LAMBDA_EXPR_LOCATION (lambda_expr);
8145 for (node = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr);
8147 node = TREE_CHAIN (node))
8149 tree field = TREE_PURPOSE (node);
8150 tree val = TREE_VALUE (node);
8152 if (field == error_mark_node)
8154 expr = error_mark_node;
8161 /* Mere mortals can't copy arrays with aggregate initialization, so
8162 do some magic to make it work here. */
8163 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE)
8164 val = build_array_copy (val);
8165 else if (DECL_NORMAL_CAPTURE_P (field)
8166 && TREE_CODE (TREE_TYPE (field)) != REFERENCE_TYPE)
8168 /* "the entities that are captured by copy are used to
8169 direct-initialize each corresponding non-static data
8170 member of the resulting closure object."
8172 There's normally no way to express direct-initialization
8173 from an element of a CONSTRUCTOR, so we build up a special
8174 TARGET_EXPR to bypass the usual copy-initialization. */
8175 val = force_rvalue (val, tf_warning_or_error);
8176 if (TREE_CODE (val) == TARGET_EXPR)
8177 TARGET_EXPR_DIRECT_INIT_P (val) = true;
8180 CONSTRUCTOR_APPEND_ELT (elts, DECL_NAME (field), val);
8183 expr = build_constructor (init_list_type_node, elts);
8184 CONSTRUCTOR_IS_DIRECT_INIT (expr) = 1;
8186 /* N2927: "[The closure] class type is not an aggregate."
8187 But we briefly treat it as an aggregate to make this simpler. */
8188 type = TREE_TYPE (lambda_expr);
8189 CLASSTYPE_NON_AGGREGATE (type) = 0;
8190 expr = finish_compound_literal (type, expr, tf_warning_or_error);
8191 CLASSTYPE_NON_AGGREGATE (type) = 1;
8194 input_location = saved_loc;
8198 /* Return an initialized RECORD_TYPE for LAMBDA.
8199 LAMBDA must have its explicit captures already. */
8202 begin_lambda_type (tree lambda)
8207 /* Unique name. This is just like an unnamed class, but we cannot use
8208 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
8210 name = make_lambda_name ();
8212 /* Create the new RECORD_TYPE for this lambda. */
8213 type = xref_tag (/*tag_code=*/record_type,
8215 /*scope=*/ts_within_enclosing_non_class,
8216 /*template_header_p=*/false);
8219 /* Designate it as a struct so that we can use aggregate initialization. */
8220 CLASSTYPE_DECLARED_CLASS (type) = false;
8222 /* Clear base types. */
8223 xref_basetypes (type, /*bases=*/NULL_TREE);
8225 /* Start the class. */
8226 type = begin_class_definition (type, /*attributes=*/NULL_TREE);
8228 /* Cross-reference the expression and the type. */
8229 TREE_TYPE (lambda) = type;
8230 CLASSTYPE_LAMBDA_EXPR (type) = lambda;
8235 /* Returns the type to use for the return type of the operator() of a
8239 lambda_return_type (tree expr)
8242 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
8244 warning (0, "cannot deduce lambda return type from a braced-init-list");
8245 return void_type_node;
8247 if (type_dependent_expression_p (expr))
8249 type = cxx_make_type (DECLTYPE_TYPE);
8250 DECLTYPE_TYPE_EXPR (type) = expr;
8251 DECLTYPE_FOR_LAMBDA_RETURN (type) = true;
8252 SET_TYPE_STRUCTURAL_EQUALITY (type);
8255 type = type_decays_to (unlowered_expr_type (expr));
8259 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
8263 lambda_function (tree lambda)
8266 if (TREE_CODE (lambda) == LAMBDA_EXPR)
8267 type = TREE_TYPE (lambda);
8270 gcc_assert (LAMBDA_TYPE_P (type));
8271 /* Don't let debug_tree cause instantiation. */
8272 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type)
8273 && !COMPLETE_OR_OPEN_TYPE_P (type))
8275 lambda = lookup_member (type, ansi_opname (CALL_EXPR),
8276 /*protect=*/0, /*want_type=*/false);
8278 lambda = BASELINK_FUNCTIONS (lambda);
8282 /* Returns the type to use for the FIELD_DECL corresponding to the
8284 The caller should add REFERENCE_TYPE for capture by reference. */
8287 lambda_capture_field_type (tree expr)
8290 if (type_dependent_expression_p (expr))
8292 type = cxx_make_type (DECLTYPE_TYPE);
8293 DECLTYPE_TYPE_EXPR (type) = expr;
8294 DECLTYPE_FOR_LAMBDA_CAPTURE (type) = true;
8295 SET_TYPE_STRUCTURAL_EQUALITY (type);
8298 type = non_reference (unlowered_expr_type (expr));
8302 /* Recompute the return type for LAMBDA with body of the form:
8303 { return EXPR ; } */
8306 apply_lambda_return_type (tree lambda, tree return_type)
8308 tree fco = lambda_function (lambda);
8311 LAMBDA_EXPR_RETURN_TYPE (lambda) = return_type;
8313 /* If we got a DECLTYPE_TYPE, don't stick it in the function yet,
8314 it would interfere with instantiating the closure type. */
8315 if (dependent_type_p (return_type))
8317 if (return_type == error_mark_node)
8320 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
8321 TREE_TYPE (METHOD_TYPE) == return-type */
8322 TREE_TYPE (fco) = change_return_type (return_type, TREE_TYPE (fco));
8324 result = DECL_RESULT (fco);
8325 if (result == NULL_TREE)
8328 /* We already have a DECL_RESULT from start_preparsed_function.
8329 Now we need to redo the work it and allocate_struct_function
8330 did to reflect the new type. */
8331 result = build_decl (input_location, RESULT_DECL, NULL_TREE,
8332 TYPE_MAIN_VARIANT (return_type));
8333 DECL_ARTIFICIAL (result) = 1;
8334 DECL_IGNORED_P (result) = 1;
8335 cp_apply_type_quals_to_decl (cp_type_quals (return_type),
8338 DECL_RESULT (fco) = result;
8340 if (!processing_template_decl && aggregate_value_p (result, fco))
8342 #ifdef PCC_STATIC_STRUCT_RETURN
8343 cfun->returns_pcc_struct = 1;
8345 cfun->returns_struct = 1;
8350 /* DECL is a local variable or parameter from the surrounding scope of a
8351 lambda-expression. Returns the decltype for a use of the capture field
8352 for DECL even if it hasn't been captured yet. */
8355 capture_decltype (tree decl)
8357 tree lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
8358 /* FIXME do lookup instead of list walk? */
8359 tree cap = value_member (decl, LAMBDA_EXPR_CAPTURE_LIST (lam));
8363 type = TREE_TYPE (TREE_PURPOSE (cap));
8365 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam))
8368 error ("%qD is not captured", decl);
8369 return error_mark_node;
8372 type = TREE_TYPE (decl);
8373 if (TREE_CODE (type) == REFERENCE_TYPE
8374 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
8375 type = TREE_TYPE (type);
8378 case CPLD_REFERENCE:
8379 type = TREE_TYPE (decl);
8380 if (TREE_CODE (type) != REFERENCE_TYPE)
8381 type = build_reference_type (TREE_TYPE (decl));
8388 if (TREE_CODE (type) != REFERENCE_TYPE)
8390 if (!LAMBDA_EXPR_MUTABLE_P (lam))
8391 type = cp_build_qualified_type (type, (cp_type_quals (type)
8393 type = build_reference_type (type);
8398 /* From an ID and INITIALIZER, create a capture (by reference if
8399 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
8403 add_capture (tree lambda, tree id, tree initializer, bool by_reference_p,
8404 bool explicit_init_p)
8409 type = lambda_capture_field_type (initializer);
8412 type = build_reference_type (type);
8413 if (!real_lvalue_p (initializer))
8414 error ("cannot capture %qE by reference", initializer);
8417 /* Make member variable. */
8418 member = build_lang_decl (FIELD_DECL, id, type);
8419 if (!explicit_init_p)
8420 /* Normal captures are invisible to name lookup but uses are replaced
8421 with references to the capture field; we implement this by only
8422 really making them invisible in unevaluated context; see
8423 qualify_lookup. For now, let's make explicitly initialized captures
8425 DECL_NORMAL_CAPTURE_P (member) = true;
8427 /* Add it to the appropriate closure class if we've started it. */
8428 if (current_class_type && current_class_type == TREE_TYPE (lambda))
8429 finish_member_declaration (member);
8431 LAMBDA_EXPR_CAPTURE_LIST (lambda)
8432 = tree_cons (member, initializer, LAMBDA_EXPR_CAPTURE_LIST (lambda));
8434 if (id == get_identifier ("__this"))
8436 if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda))
8437 error ("already captured %<this%> in lambda expression");
8438 LAMBDA_EXPR_THIS_CAPTURE (lambda) = member;
8444 /* Register all the capture members on the list CAPTURES, which is the
8445 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
8447 void register_capture_members (tree captures)
8451 register_capture_members (TREE_CHAIN (captures));
8452 finish_member_declaration (TREE_PURPOSE (captures));
8456 /* Given a FIELD_DECL decl belonging to a closure type, return a
8457 COMPONENT_REF of it relative to the 'this' parameter of the op() for
8461 thisify_lambda_field (tree decl)
8463 tree context = lambda_function (DECL_CONTEXT (decl));
8464 tree object = cp_build_indirect_ref (DECL_ARGUMENTS (context),
8466 tf_warning_or_error);
8467 return finish_non_static_data_member (decl, object,
8468 /*qualifying_scope*/NULL_TREE);
8471 /* Similar to add_capture, except this works on a stack of nested lambdas.
8472 BY_REFERENCE_P in this case is derived from the default capture mode.
8473 Returns the capture for the lambda at the bottom of the stack. */
8476 add_default_capture (tree lambda_stack, tree id, tree initializer)
8478 bool this_capture_p = (id == get_identifier ("__this"));
8480 tree member = NULL_TREE;
8482 tree saved_class_type = current_class_type;
8486 for (node = lambda_stack;
8488 node = TREE_CHAIN (node))
8490 tree lambda = TREE_VALUE (node);
8492 current_class_type = TREE_TYPE (lambda);
8493 member = add_capture (lambda,
8498 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda)
8499 == CPLD_REFERENCE)),
8500 /*explicit_init_p=*/false);
8501 initializer = thisify_lambda_field (member);
8504 current_class_type = saved_class_type;
8509 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
8510 INDIRECT_REF, possibly adding it through default capturing. */
8513 lambda_expr_this_capture (tree lambda)
8517 tree this_capture = LAMBDA_EXPR_THIS_CAPTURE (lambda);
8519 /* Try to default capture 'this' if we can. */
8521 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) != CPLD_NONE)
8523 tree containing_function = TYPE_CONTEXT (TREE_TYPE (lambda));
8524 tree lambda_stack = tree_cons (NULL_TREE, lambda, NULL_TREE);
8525 tree init = NULL_TREE;
8527 /* If we are in a lambda function, we can move out until we hit:
8528 1. a non-lambda function,
8529 2. a lambda function capturing 'this', or
8530 3. a non-default capturing lambda function. */
8531 while (LAMBDA_FUNCTION_P (containing_function))
8534 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function));
8536 if (LAMBDA_EXPR_THIS_CAPTURE (lambda))
8538 /* An outer lambda has already captured 'this'. */
8539 tree cap = LAMBDA_EXPR_THIS_CAPTURE (lambda);
8540 init = thisify_lambda_field (cap);
8544 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) == CPLD_NONE)
8545 /* An outer lambda won't let us capture 'this'. */
8548 lambda_stack = tree_cons (NULL_TREE,
8552 containing_function = decl_function_context (containing_function);
8555 if (!init && DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function)
8556 && !LAMBDA_FUNCTION_P (containing_function))
8557 /* First parameter is 'this'. */
8558 init = DECL_ARGUMENTS (containing_function);
8561 this_capture = add_default_capture (lambda_stack,
8562 /*id=*/get_identifier ("__this"),
8568 error ("%<this%> was not captured for this lambda function");
8569 result = error_mark_node;
8573 /* To make sure that current_class_ref is for the lambda. */
8574 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)) == TREE_TYPE (lambda));
8576 result = finish_non_static_data_member (this_capture,
8578 /*qualifying_scope=*/NULL_TREE);
8580 /* If 'this' is captured, each use of 'this' is transformed into an
8581 access to the corresponding unnamed data member of the closure
8582 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
8583 ensures that the transformed expression is an rvalue. ] */
8584 result = rvalue (result);
8590 /* Returns the method basetype of the innermost non-lambda function, or
8591 NULL_TREE if none. */
8594 nonlambda_method_basetype (void)
8597 if (!current_class_ref)
8600 type = current_class_type;
8601 if (!LAMBDA_TYPE_P (type))
8604 /* Find the nearest enclosing non-lambda function. */
8605 fn = TYPE_NAME (type);
8607 fn = decl_function_context (fn);
8608 while (fn && LAMBDA_FUNCTION_P (fn));
8610 if (!fn || !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
8613 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn));
8616 /* If the closure TYPE has a static op(), also add a conversion to function
8620 maybe_add_lambda_conv_op (tree type)
8622 bool nested = (current_function_decl != NULL_TREE);
8623 tree callop = lambda_function (type);
8624 tree rettype, name, fntype, fn, body, compound_stmt;
8625 tree thistype, stattype, statfn, convfn, call, arg;
8626 VEC (tree, gc) *argvec;
8628 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type)) != NULL_TREE)
8631 stattype = build_function_type (TREE_TYPE (TREE_TYPE (callop)),
8632 FUNCTION_ARG_CHAIN (callop));
8634 /* First build up the conversion op. */
8636 rettype = build_pointer_type (stattype);
8637 name = mangle_conv_op_name_for_type (rettype);
8638 thistype = cp_build_qualified_type (type, TYPE_QUAL_CONST);
8639 fntype = build_method_type_directly (thistype, rettype, void_list_node);
8640 fn = convfn = build_lang_decl (FUNCTION_DECL, name, fntype);
8641 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
8643 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
8644 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
8645 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
8647 SET_OVERLOADED_OPERATOR_CODE (fn, TYPE_EXPR);
8648 grokclassfn (type, fn, NO_SPECIAL);
8649 set_linkage_according_to_type (type, fn);
8650 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
8651 DECL_IN_AGGR_P (fn) = 1;
8652 DECL_ARTIFICIAL (fn) = 1;
8653 DECL_NOT_REALLY_EXTERN (fn) = 1;
8654 DECL_DECLARED_INLINE_P (fn) = 1;
8655 DECL_ARGUMENTS (fn) = build_this_parm (fntype, TYPE_QUAL_CONST);
8657 DECL_INTERFACE_KNOWN (fn) = 1;
8659 add_method (type, fn, NULL_TREE);
8661 /* Generic thunk code fails for varargs; we'll complain in mark_used if
8662 the conversion op is used. */
8663 if (varargs_function_p (callop))
8665 DECL_DELETED_FN (fn) = 1;
8669 /* Now build up the thunk to be returned. */
8671 name = get_identifier ("_FUN");
8672 fn = statfn = build_lang_decl (FUNCTION_DECL, name, stattype);
8673 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
8674 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
8675 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
8676 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
8677 grokclassfn (type, fn, NO_SPECIAL);
8678 set_linkage_according_to_type (type, fn);
8679 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
8680 DECL_IN_AGGR_P (fn) = 1;
8681 DECL_ARTIFICIAL (fn) = 1;
8682 DECL_NOT_REALLY_EXTERN (fn) = 1;
8683 DECL_DECLARED_INLINE_P (fn) = 1;
8684 DECL_STATIC_FUNCTION_P (fn) = 1;
8685 DECL_ARGUMENTS (fn) = copy_list (DECL_CHAIN (DECL_ARGUMENTS (callop)));
8686 for (arg = DECL_ARGUMENTS (fn); arg; arg = DECL_CHAIN (arg))
8687 DECL_CONTEXT (arg) = fn;
8689 DECL_INTERFACE_KNOWN (fn) = 1;
8691 add_method (type, fn, NULL_TREE);
8694 push_function_context ();
8696 /* Generate the body of the thunk. */
8698 start_preparsed_function (statfn, NULL_TREE,
8699 SF_PRE_PARSED | SF_INCLASS_INLINE);
8700 if (DECL_ONE_ONLY (statfn))
8702 /* Put the thunk in the same comdat group as the call op. */
8703 struct cgraph_node *callop_node, *thunk_node;
8704 DECL_COMDAT_GROUP (statfn) = cxx_comdat_group (callop);
8705 callop_node = cgraph_get_create_node (callop);
8706 thunk_node = cgraph_get_create_node (statfn);
8707 gcc_assert (callop_node->same_comdat_group == NULL);
8708 gcc_assert (thunk_node->same_comdat_group == NULL);
8709 callop_node->same_comdat_group = thunk_node;
8710 thunk_node->same_comdat_group = callop_node;
8712 body = begin_function_body ();
8713 compound_stmt = begin_compound_stmt (0);
8715 arg = build1 (NOP_EXPR, TREE_TYPE (DECL_ARGUMENTS (callop)),
8717 argvec = make_tree_vector ();
8718 VEC_quick_push (tree, argvec, arg);
8719 for (arg = DECL_ARGUMENTS (statfn); arg; arg = DECL_CHAIN (arg))
8720 VEC_safe_push (tree, gc, argvec, arg);
8721 call = build_call_a (callop, VEC_length (tree, argvec),
8722 VEC_address (tree, argvec));
8723 CALL_FROM_THUNK_P (call) = 1;
8724 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call)))
8725 call = build_cplus_new (TREE_TYPE (call), call, tf_warning_or_error);
8726 call = convert_from_reference (call);
8727 finish_return_stmt (call);
8729 finish_compound_stmt (compound_stmt);
8730 finish_function_body (body);
8732 expand_or_defer_fn (finish_function (2));
8734 /* Generate the body of the conversion op. */
8736 start_preparsed_function (convfn, NULL_TREE,
8737 SF_PRE_PARSED | SF_INCLASS_INLINE);
8738 body = begin_function_body ();
8739 compound_stmt = begin_compound_stmt (0);
8741 finish_return_stmt (decay_conversion (statfn));
8743 finish_compound_stmt (compound_stmt);
8744 finish_function_body (body);
8746 expand_or_defer_fn (finish_function (2));
8749 pop_function_context ();
8751 #include "gt-cp-semantics.h"