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);
59 /* Deferred Access Checking Overview
60 ---------------------------------
62 Most C++ expressions and declarations require access checking
63 to be performed during parsing. However, in several cases,
64 this has to be treated differently.
66 For member declarations, access checking has to be deferred
67 until more information about the declaration is known. For
79 When we are parsing the function return type `A::X', we don't
80 really know if this is allowed until we parse the function name.
82 Furthermore, some contexts require that access checking is
83 never performed at all. These include class heads, and template
86 Typical use of access checking functions is described here:
88 1. When we enter a context that requires certain access checking
89 mode, the function `push_deferring_access_checks' is called with
90 DEFERRING argument specifying the desired mode. Access checking
91 may be performed immediately (dk_no_deferred), deferred
92 (dk_deferred), or not performed (dk_no_check).
94 2. When a declaration such as a type, or a variable, is encountered,
95 the function `perform_or_defer_access_check' is called. It
96 maintains a VEC of all deferred checks.
98 3. The global `current_class_type' or `current_function_decl' is then
99 setup by the parser. `enforce_access' relies on these information
102 4. Upon exiting the context mentioned in step 1,
103 `perform_deferred_access_checks' is called to check all declaration
104 stored in the VEC. `pop_deferring_access_checks' is then
105 called to restore the previous access checking mode.
107 In case of parsing error, we simply call `pop_deferring_access_checks'
108 without `perform_deferred_access_checks'. */
110 typedef struct GTY(()) deferred_access {
111 /* A VEC representing name-lookups for which we have deferred
112 checking access controls. We cannot check the accessibility of
113 names used in a decl-specifier-seq until we know what is being
114 declared because code like:
121 A::B* A::f() { return 0; }
123 is valid, even though `A::B' is not generally accessible. */
124 VEC (deferred_access_check,gc)* GTY(()) deferred_access_checks;
126 /* The current mode of access checks. */
127 enum deferring_kind deferring_access_checks_kind;
130 DEF_VEC_O (deferred_access);
131 DEF_VEC_ALLOC_O (deferred_access,gc);
133 /* Data for deferred access checking. */
134 static GTY(()) VEC(deferred_access,gc) *deferred_access_stack;
135 static GTY(()) unsigned deferred_access_no_check;
137 /* Save the current deferred access states and start deferred
138 access checking iff DEFER_P is true. */
141 push_deferring_access_checks (deferring_kind deferring)
143 /* For context like template instantiation, access checking
144 disabling applies to all nested context. */
145 if (deferred_access_no_check || deferring == dk_no_check)
146 deferred_access_no_check++;
149 deferred_access *ptr;
151 ptr = VEC_safe_push (deferred_access, gc, deferred_access_stack, NULL);
152 ptr->deferred_access_checks = NULL;
153 ptr->deferring_access_checks_kind = deferring;
157 /* Resume deferring access checks again after we stopped doing
161 resume_deferring_access_checks (void)
163 if (!deferred_access_no_check)
164 VEC_last (deferred_access, deferred_access_stack)
165 ->deferring_access_checks_kind = dk_deferred;
168 /* Stop deferring access checks. */
171 stop_deferring_access_checks (void)
173 if (!deferred_access_no_check)
174 VEC_last (deferred_access, deferred_access_stack)
175 ->deferring_access_checks_kind = dk_no_deferred;
178 /* Discard the current deferred access checks and restore the
182 pop_deferring_access_checks (void)
184 if (deferred_access_no_check)
185 deferred_access_no_check--;
187 VEC_pop (deferred_access, deferred_access_stack);
190 /* Returns a TREE_LIST representing the deferred checks.
191 The TREE_PURPOSE of each node is the type through which the
192 access occurred; the TREE_VALUE is the declaration named.
195 VEC (deferred_access_check,gc)*
196 get_deferred_access_checks (void)
198 if (deferred_access_no_check)
201 return (VEC_last (deferred_access, deferred_access_stack)
202 ->deferred_access_checks);
205 /* Take current deferred checks and combine with the
206 previous states if we also defer checks previously.
207 Otherwise perform checks now. */
210 pop_to_parent_deferring_access_checks (void)
212 if (deferred_access_no_check)
213 deferred_access_no_check--;
216 VEC (deferred_access_check,gc) *checks;
217 deferred_access *ptr;
219 checks = (VEC_last (deferred_access, deferred_access_stack)
220 ->deferred_access_checks);
222 VEC_pop (deferred_access, deferred_access_stack);
223 ptr = VEC_last (deferred_access, deferred_access_stack);
224 if (ptr->deferring_access_checks_kind == dk_no_deferred)
227 perform_access_checks (checks);
231 /* Merge with parent. */
233 deferred_access_check *chk, *probe;
235 FOR_EACH_VEC_ELT (deferred_access_check, checks, i, chk)
237 FOR_EACH_VEC_ELT (deferred_access_check,
238 ptr->deferred_access_checks, j, probe)
240 if (probe->binfo == chk->binfo &&
241 probe->decl == chk->decl &&
242 probe->diag_decl == chk->diag_decl)
245 /* Insert into parent's checks. */
246 VEC_safe_push (deferred_access_check, gc,
247 ptr->deferred_access_checks, chk);
254 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
255 is the BINFO indicating the qualifying scope used to access the
256 DECL node stored in the TREE_VALUE of the node. */
259 perform_access_checks (VEC (deferred_access_check,gc)* checks)
262 deferred_access_check *chk;
267 FOR_EACH_VEC_ELT (deferred_access_check, checks, i, chk)
268 enforce_access (chk->binfo, chk->decl, chk->diag_decl);
271 /* Perform the deferred access checks.
273 After performing the checks, we still have to keep the list
274 `deferred_access_stack->deferred_access_checks' since we may want
275 to check access for them again later in a different context.
282 A::X A::a, x; // No error for `A::a', error for `x'
284 We have to perform deferred access of `A::X', first with `A::a',
288 perform_deferred_access_checks (void)
290 perform_access_checks (get_deferred_access_checks ());
293 /* Defer checking the accessibility of DECL, when looked up in
294 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */
297 perform_or_defer_access_check (tree binfo, tree decl, tree diag_decl)
300 deferred_access *ptr;
301 deferred_access_check *chk;
302 deferred_access_check *new_access;
305 /* Exit if we are in a context that no access checking is performed.
307 if (deferred_access_no_check)
310 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
312 ptr = VEC_last (deferred_access, deferred_access_stack);
314 /* If we are not supposed to defer access checks, just check now. */
315 if (ptr->deferring_access_checks_kind == dk_no_deferred)
317 enforce_access (binfo, decl, diag_decl);
321 /* See if we are already going to perform this check. */
322 FOR_EACH_VEC_ELT (deferred_access_check,
323 ptr->deferred_access_checks, i, chk)
325 if (chk->decl == decl && chk->binfo == binfo &&
326 chk->diag_decl == diag_decl)
331 /* If not, record the check. */
333 VEC_safe_push (deferred_access_check, gc,
334 ptr->deferred_access_checks, 0);
335 new_access->binfo = binfo;
336 new_access->decl = decl;
337 new_access->diag_decl = diag_decl;
340 /* Used by build_over_call in LOOKUP_SPECULATIVE mode: return whether DECL
341 is accessible in BINFO, and possibly complain if not. If we're not
342 checking access, everything is accessible. */
345 speculative_access_check (tree binfo, tree decl, tree diag_decl,
348 if (deferred_access_no_check)
351 /* If we're checking for implicit delete, we don't want access
353 if (!accessible_p (binfo, decl, true))
355 /* Unless we're under maybe_explain_implicit_delete. */
357 enforce_access (binfo, decl, diag_decl);
364 /* Returns nonzero if the current statement is a full expression,
365 i.e. temporaries created during that statement should be destroyed
366 at the end of the statement. */
369 stmts_are_full_exprs_p (void)
371 return current_stmt_tree ()->stmts_are_full_exprs_p;
374 /* T is a statement. Add it to the statement-tree. This is the C++
375 version. The C/ObjC frontends have a slightly different version of
381 enum tree_code code = TREE_CODE (t);
383 if (EXPR_P (t) && code != LABEL_EXPR)
385 if (!EXPR_HAS_LOCATION (t))
386 SET_EXPR_LOCATION (t, input_location);
388 /* When we expand a statement-tree, we must know whether or not the
389 statements are full-expressions. We record that fact here. */
390 STMT_IS_FULL_EXPR_P (t) = stmts_are_full_exprs_p ();
393 /* Add T to the statement-tree. Non-side-effect statements need to be
394 recorded during statement expressions. */
395 gcc_checking_assert (!VEC_empty (tree, stmt_list_stack));
396 append_to_statement_list_force (t, &cur_stmt_list);
401 /* Returns the stmt_tree to which statements are currently being added. */
404 current_stmt_tree (void)
407 ? &cfun->language->base.x_stmt_tree
408 : &scope_chain->x_stmt_tree);
411 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
414 maybe_cleanup_point_expr (tree expr)
416 if (!processing_template_decl && stmts_are_full_exprs_p ())
417 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
421 /* Like maybe_cleanup_point_expr except have the type of the new expression be
422 void so we don't need to create a temporary variable to hold the inner
423 expression. The reason why we do this is because the original type might be
424 an aggregate and we cannot create a temporary variable for that type. */
427 maybe_cleanup_point_expr_void (tree expr)
429 if (!processing_template_decl && stmts_are_full_exprs_p ())
430 expr = fold_build_cleanup_point_expr (void_type_node, expr);
436 /* Create a declaration statement for the declaration given by the DECL. */
439 add_decl_expr (tree decl)
441 tree r = build_stmt (input_location, DECL_EXPR, decl);
442 if (DECL_INITIAL (decl)
443 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
444 r = maybe_cleanup_point_expr_void (r);
448 /* Finish a scope. */
451 do_poplevel (tree stmt_list)
455 if (stmts_are_full_exprs_p ())
456 block = poplevel (kept_level_p (), 1, 0);
458 stmt_list = pop_stmt_list (stmt_list);
460 if (!processing_template_decl)
462 stmt_list = c_build_bind_expr (input_location, block, stmt_list);
463 /* ??? See c_end_compound_stmt re statement expressions. */
469 /* Begin a new scope. */
472 do_pushlevel (scope_kind sk)
474 tree ret = push_stmt_list ();
475 if (stmts_are_full_exprs_p ())
476 begin_scope (sk, NULL);
480 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
481 when the current scope is exited. EH_ONLY is true when this is not
482 meant to apply to normal control flow transfer. */
485 push_cleanup (tree decl, tree cleanup, bool eh_only)
487 tree stmt = build_stmt (input_location, CLEANUP_STMT, NULL, cleanup, decl);
488 CLEANUP_EH_ONLY (stmt) = eh_only;
490 CLEANUP_BODY (stmt) = push_stmt_list ();
493 /* Begin a conditional that might contain a declaration. When generating
494 normal code, we want the declaration to appear before the statement
495 containing the conditional. When generating template code, we want the
496 conditional to be rendered as the raw DECL_EXPR. */
499 begin_cond (tree *cond_p)
501 if (processing_template_decl)
502 *cond_p = push_stmt_list ();
505 /* Finish such a conditional. */
508 finish_cond (tree *cond_p, tree expr)
510 if (processing_template_decl)
512 tree cond = pop_stmt_list (*cond_p);
513 if (TREE_CODE (cond) == DECL_EXPR)
516 if (check_for_bare_parameter_packs (expr))
517 *cond_p = error_mark_node;
522 /* If *COND_P specifies a conditional with a declaration, transform the
525 for (; A x = 42;) { }
527 while (true) { A x = 42; if (!x) break; }
528 for (;;) { A x = 42; if (!x) break; }
529 The statement list for BODY will be empty if the conditional did
530 not declare anything. */
533 simplify_loop_decl_cond (tree *cond_p, tree body)
537 if (!TREE_SIDE_EFFECTS (body))
541 *cond_p = boolean_true_node;
543 if_stmt = begin_if_stmt ();
544 cond = cp_build_unary_op (TRUTH_NOT_EXPR, cond, 0, tf_warning_or_error);
545 finish_if_stmt_cond (cond, if_stmt);
546 finish_break_stmt ();
547 finish_then_clause (if_stmt);
548 finish_if_stmt (if_stmt);
551 /* Finish a goto-statement. */
554 finish_goto_stmt (tree destination)
556 if (TREE_CODE (destination) == IDENTIFIER_NODE)
557 destination = lookup_label (destination);
559 /* We warn about unused labels with -Wunused. That means we have to
560 mark the used labels as used. */
561 if (TREE_CODE (destination) == LABEL_DECL)
562 TREE_USED (destination) = 1;
565 destination = mark_rvalue_use (destination);
566 if (!processing_template_decl)
568 destination = cp_convert (ptr_type_node, destination);
569 if (error_operand_p (destination))
574 check_goto (destination);
576 return add_stmt (build_stmt (input_location, GOTO_EXPR, destination));
579 /* COND is the condition-expression for an if, while, etc.,
580 statement. Convert it to a boolean value, if appropriate.
581 In addition, verify sequence points if -Wsequence-point is enabled. */
584 maybe_convert_cond (tree cond)
586 /* Empty conditions remain empty. */
590 /* Wait until we instantiate templates before doing conversion. */
591 if (processing_template_decl)
594 if (warn_sequence_point)
595 verify_sequence_points (cond);
597 /* Do the conversion. */
598 cond = convert_from_reference (cond);
600 if (TREE_CODE (cond) == MODIFY_EXPR
601 && !TREE_NO_WARNING (cond)
604 warning (OPT_Wparentheses,
605 "suggest parentheses around assignment used as truth value");
606 TREE_NO_WARNING (cond) = 1;
609 return condition_conversion (cond);
612 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
615 finish_expr_stmt (tree expr)
619 if (expr != NULL_TREE)
621 if (!processing_template_decl)
623 if (warn_sequence_point)
624 verify_sequence_points (expr);
625 expr = convert_to_void (expr, ICV_STATEMENT, tf_warning_or_error);
627 else if (!type_dependent_expression_p (expr))
628 convert_to_void (build_non_dependent_expr (expr), ICV_STATEMENT,
629 tf_warning_or_error);
631 if (check_for_bare_parameter_packs (expr))
632 expr = error_mark_node;
634 /* Simplification of inner statement expressions, compound exprs,
635 etc can result in us already having an EXPR_STMT. */
636 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
638 if (TREE_CODE (expr) != EXPR_STMT)
639 expr = build_stmt (input_location, EXPR_STMT, expr);
640 expr = maybe_cleanup_point_expr_void (expr);
652 /* Begin an if-statement. Returns a newly created IF_STMT if
659 scope = do_pushlevel (sk_cond);
660 r = build_stmt (input_location, IF_STMT, NULL_TREE,
661 NULL_TREE, NULL_TREE, scope);
662 begin_cond (&IF_COND (r));
666 /* Process the COND of an if-statement, which may be given by
670 finish_if_stmt_cond (tree cond, tree if_stmt)
672 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
674 THEN_CLAUSE (if_stmt) = push_stmt_list ();
677 /* Finish the then-clause of an if-statement, which may be given by
681 finish_then_clause (tree if_stmt)
683 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
687 /* Begin the else-clause of an if-statement. */
690 begin_else_clause (tree if_stmt)
692 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
695 /* Finish the else-clause of an if-statement, which may be given by
699 finish_else_clause (tree if_stmt)
701 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
704 /* Finish an if-statement. */
707 finish_if_stmt (tree if_stmt)
709 tree scope = IF_SCOPE (if_stmt);
710 IF_SCOPE (if_stmt) = NULL;
711 add_stmt (do_poplevel (scope));
715 /* Begin a while-statement. Returns a newly created WHILE_STMT if
719 begin_while_stmt (void)
722 r = build_stmt (input_location, WHILE_STMT, NULL_TREE, NULL_TREE);
724 WHILE_BODY (r) = do_pushlevel (sk_block);
725 begin_cond (&WHILE_COND (r));
729 /* Process the COND of a while-statement, which may be given by
733 finish_while_stmt_cond (tree cond, tree while_stmt)
735 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
736 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
739 /* Finish a while-statement, which may be given by WHILE_STMT. */
742 finish_while_stmt (tree while_stmt)
744 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
748 /* Begin a do-statement. Returns a newly created DO_STMT if
754 tree r = build_stmt (input_location, DO_STMT, NULL_TREE, NULL_TREE);
756 DO_BODY (r) = push_stmt_list ();
760 /* Finish the body of a do-statement, which may be given by DO_STMT. */
763 finish_do_body (tree do_stmt)
765 tree body = DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
767 if (TREE_CODE (body) == STATEMENT_LIST && STATEMENT_LIST_TAIL (body))
768 body = STATEMENT_LIST_TAIL (body)->stmt;
770 if (IS_EMPTY_STMT (body))
771 warning (OPT_Wempty_body,
772 "suggest explicit braces around empty body in %<do%> statement");
775 /* Finish a do-statement, which may be given by DO_STMT, and whose
776 COND is as indicated. */
779 finish_do_stmt (tree cond, tree do_stmt)
781 cond = maybe_convert_cond (cond);
782 DO_COND (do_stmt) = cond;
786 /* Finish a return-statement. The EXPRESSION returned, if any, is as
790 finish_return_stmt (tree expr)
795 expr = check_return_expr (expr, &no_warning);
797 if (flag_openmp && !check_omp_return ())
798 return error_mark_node;
799 if (!processing_template_decl)
801 if (warn_sequence_point)
802 verify_sequence_points (expr);
804 if (DECL_DESTRUCTOR_P (current_function_decl)
805 || (DECL_CONSTRUCTOR_P (current_function_decl)
806 && targetm.cxx.cdtor_returns_this ()))
808 /* Similarly, all destructors must run destructors for
809 base-classes before returning. So, all returns in a
810 destructor get sent to the DTOR_LABEL; finish_function emits
811 code to return a value there. */
812 return finish_goto_stmt (cdtor_label);
816 r = build_stmt (input_location, RETURN_EXPR, expr);
817 TREE_NO_WARNING (r) |= no_warning;
818 r = maybe_cleanup_point_expr_void (r);
825 /* Begin the scope of a for-statement or a range-for-statement.
826 Both the returned trees are to be used in a call to
827 begin_for_stmt or begin_range_for_stmt. */
830 begin_for_scope (tree *init)
832 tree scope = NULL_TREE;
833 if (flag_new_for_scope > 0)
834 scope = do_pushlevel (sk_for);
836 if (processing_template_decl)
837 *init = push_stmt_list ();
844 /* Begin a for-statement. Returns a new FOR_STMT.
845 SCOPE and INIT should be the return of begin_for_scope,
849 begin_for_stmt (tree scope, tree init)
853 r = build_stmt (input_location, FOR_STMT, NULL_TREE, NULL_TREE,
854 NULL_TREE, NULL_TREE, NULL_TREE);
856 if (scope == NULL_TREE)
858 gcc_assert (!init || !(flag_new_for_scope > 0));
860 scope = begin_for_scope (&init);
862 FOR_INIT_STMT (r) = init;
863 FOR_SCOPE (r) = scope;
868 /* Finish the for-init-statement of a for-statement, which may be
869 given by FOR_STMT. */
872 finish_for_init_stmt (tree for_stmt)
874 if (processing_template_decl)
875 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
877 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
878 begin_cond (&FOR_COND (for_stmt));
881 /* Finish the COND of a for-statement, which may be given by
885 finish_for_cond (tree cond, tree for_stmt)
887 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
888 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
891 /* Finish the increment-EXPRESSION in a for-statement, which may be
892 given by FOR_STMT. */
895 finish_for_expr (tree expr, tree for_stmt)
899 /* If EXPR is an overloaded function, issue an error; there is no
900 context available to use to perform overload resolution. */
901 if (type_unknown_p (expr))
903 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
904 expr = error_mark_node;
906 if (!processing_template_decl)
908 if (warn_sequence_point)
909 verify_sequence_points (expr);
910 expr = convert_to_void (expr, ICV_THIRD_IN_FOR,
911 tf_warning_or_error);
913 else if (!type_dependent_expression_p (expr))
914 convert_to_void (build_non_dependent_expr (expr), ICV_THIRD_IN_FOR,
915 tf_warning_or_error);
916 expr = maybe_cleanup_point_expr_void (expr);
917 if (check_for_bare_parameter_packs (expr))
918 expr = error_mark_node;
919 FOR_EXPR (for_stmt) = expr;
922 /* Finish the body of a for-statement, which may be given by
923 FOR_STMT. The increment-EXPR for the loop must be
925 It can also finish RANGE_FOR_STMT. */
928 finish_for_stmt (tree for_stmt)
930 if (TREE_CODE (for_stmt) == RANGE_FOR_STMT)
931 RANGE_FOR_BODY (for_stmt) = do_poplevel (RANGE_FOR_BODY (for_stmt));
933 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
935 /* Pop the scope for the body of the loop. */
936 if (flag_new_for_scope > 0)
939 tree *scope_ptr = (TREE_CODE (for_stmt) == RANGE_FOR_STMT
940 ? &RANGE_FOR_SCOPE (for_stmt)
941 : &FOR_SCOPE (for_stmt));
944 add_stmt (do_poplevel (scope));
950 /* Begin a range-for-statement. Returns a new RANGE_FOR_STMT.
951 SCOPE and INIT should be the return of begin_for_scope,
953 To finish it call finish_for_stmt(). */
956 begin_range_for_stmt (tree scope, tree init)
960 r = build_stmt (input_location, RANGE_FOR_STMT,
961 NULL_TREE, NULL_TREE, NULL_TREE, NULL_TREE);
963 if (scope == NULL_TREE)
965 gcc_assert (!init || !(flag_new_for_scope > 0));
967 scope = begin_for_scope (&init);
970 /* RANGE_FOR_STMTs do not use nor save the init tree, so we
973 pop_stmt_list (init);
974 RANGE_FOR_SCOPE (r) = scope;
979 /* Finish the head of a range-based for statement, which may
980 be given by RANGE_FOR_STMT. DECL must be the declaration
981 and EXPR must be the loop expression. */
984 finish_range_for_decl (tree range_for_stmt, tree decl, tree expr)
986 RANGE_FOR_DECL (range_for_stmt) = decl;
987 RANGE_FOR_EXPR (range_for_stmt) = expr;
988 add_stmt (range_for_stmt);
989 RANGE_FOR_BODY (range_for_stmt) = do_pushlevel (sk_block);
992 /* Finish a break-statement. */
995 finish_break_stmt (void)
997 return add_stmt (build_stmt (input_location, BREAK_STMT));
1000 /* Finish a continue-statement. */
1003 finish_continue_stmt (void)
1005 return add_stmt (build_stmt (input_location, CONTINUE_STMT));
1008 /* Begin a switch-statement. Returns a new SWITCH_STMT if
1012 begin_switch_stmt (void)
1016 scope = do_pushlevel (sk_cond);
1017 r = build_stmt (input_location, SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE, scope);
1019 begin_cond (&SWITCH_STMT_COND (r));
1024 /* Finish the cond of a switch-statement. */
1027 finish_switch_cond (tree cond, tree switch_stmt)
1029 tree orig_type = NULL;
1030 if (!processing_template_decl)
1032 /* Convert the condition to an integer or enumeration type. */
1033 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
1034 if (cond == NULL_TREE)
1036 error ("switch quantity not an integer");
1037 cond = error_mark_node;
1039 orig_type = TREE_TYPE (cond);
1040 if (cond != error_mark_node)
1044 Integral promotions are performed. */
1045 cond = perform_integral_promotions (cond);
1046 cond = maybe_cleanup_point_expr (cond);
1049 if (check_for_bare_parameter_packs (cond))
1050 cond = error_mark_node;
1051 else if (!processing_template_decl && warn_sequence_point)
1052 verify_sequence_points (cond);
1054 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
1055 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
1056 add_stmt (switch_stmt);
1057 push_switch (switch_stmt);
1058 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
1061 /* Finish the body of a switch-statement, which may be given by
1062 SWITCH_STMT. The COND to switch on is indicated. */
1065 finish_switch_stmt (tree switch_stmt)
1069 SWITCH_STMT_BODY (switch_stmt) =
1070 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
1074 scope = SWITCH_STMT_SCOPE (switch_stmt);
1075 SWITCH_STMT_SCOPE (switch_stmt) = NULL;
1076 add_stmt (do_poplevel (scope));
1079 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1083 begin_try_block (void)
1085 tree r = build_stmt (input_location, TRY_BLOCK, NULL_TREE, NULL_TREE);
1087 TRY_STMTS (r) = push_stmt_list ();
1091 /* Likewise, for a function-try-block. The block returned in
1092 *COMPOUND_STMT is an artificial outer scope, containing the
1093 function-try-block. */
1096 begin_function_try_block (tree *compound_stmt)
1099 /* This outer scope does not exist in the C++ standard, but we need
1100 a place to put __FUNCTION__ and similar variables. */
1101 *compound_stmt = begin_compound_stmt (0);
1102 r = begin_try_block ();
1103 FN_TRY_BLOCK_P (r) = 1;
1107 /* Finish a try-block, which may be given by TRY_BLOCK. */
1110 finish_try_block (tree try_block)
1112 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1113 TRY_HANDLERS (try_block) = push_stmt_list ();
1116 /* Finish the body of a cleanup try-block, which may be given by
1120 finish_cleanup_try_block (tree try_block)
1122 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1125 /* Finish an implicitly generated try-block, with a cleanup is given
1129 finish_cleanup (tree cleanup, tree try_block)
1131 TRY_HANDLERS (try_block) = cleanup;
1132 CLEANUP_P (try_block) = 1;
1135 /* Likewise, for a function-try-block. */
1138 finish_function_try_block (tree try_block)
1140 finish_try_block (try_block);
1141 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1142 the try block, but moving it inside. */
1143 in_function_try_handler = 1;
1146 /* Finish a handler-sequence for a try-block, which may be given by
1150 finish_handler_sequence (tree try_block)
1152 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1153 check_handlers (TRY_HANDLERS (try_block));
1156 /* Finish the handler-seq for a function-try-block, given by
1157 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1158 begin_function_try_block. */
1161 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1163 in_function_try_handler = 0;
1164 finish_handler_sequence (try_block);
1165 finish_compound_stmt (compound_stmt);
1168 /* Begin a handler. Returns a HANDLER if appropriate. */
1171 begin_handler (void)
1175 r = build_stmt (input_location, HANDLER, NULL_TREE, NULL_TREE);
1178 /* Create a binding level for the eh_info and the exception object
1180 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1185 /* Finish the handler-parameters for a handler, which may be given by
1186 HANDLER. DECL is the declaration for the catch parameter, or NULL
1187 if this is a `catch (...)' clause. */
1190 finish_handler_parms (tree decl, tree handler)
1192 tree type = NULL_TREE;
1193 if (processing_template_decl)
1197 decl = pushdecl (decl);
1198 decl = push_template_decl (decl);
1199 HANDLER_PARMS (handler) = decl;
1200 type = TREE_TYPE (decl);
1204 type = expand_start_catch_block (decl);
1205 HANDLER_TYPE (handler) = type;
1206 if (!processing_template_decl && type)
1207 mark_used (eh_type_info (type));
1210 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1211 the return value from the matching call to finish_handler_parms. */
1214 finish_handler (tree handler)
1216 if (!processing_template_decl)
1217 expand_end_catch_block ();
1218 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1221 /* Begin a compound statement. FLAGS contains some bits that control the
1222 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1223 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1224 block of a function. If BCS_TRY_BLOCK is set, this is the block
1225 created on behalf of a TRY statement. Returns a token to be passed to
1226 finish_compound_stmt. */
1229 begin_compound_stmt (unsigned int flags)
1233 if (flags & BCS_NO_SCOPE)
1235 r = push_stmt_list ();
1236 STATEMENT_LIST_NO_SCOPE (r) = 1;
1238 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1239 But, if it's a statement-expression with a scopeless block, there's
1240 nothing to keep, and we don't want to accidentally keep a block
1241 *inside* the scopeless block. */
1242 keep_next_level (false);
1245 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1247 /* When processing a template, we need to remember where the braces were,
1248 so that we can set up identical scopes when instantiating the template
1249 later. BIND_EXPR is a handy candidate for this.
1250 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1251 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1252 processing templates. */
1253 if (processing_template_decl)
1255 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1256 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1257 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1258 TREE_SIDE_EFFECTS (r) = 1;
1264 /* Finish a compound-statement, which is given by STMT. */
1267 finish_compound_stmt (tree stmt)
1269 if (TREE_CODE (stmt) == BIND_EXPR)
1271 tree body = do_poplevel (BIND_EXPR_BODY (stmt));
1272 /* If the STATEMENT_LIST is empty and this BIND_EXPR isn't special,
1273 discard the BIND_EXPR so it can be merged with the containing
1275 if (TREE_CODE (body) == STATEMENT_LIST
1276 && STATEMENT_LIST_HEAD (body) == NULL
1277 && !BIND_EXPR_BODY_BLOCK (stmt)
1278 && !BIND_EXPR_TRY_BLOCK (stmt))
1281 BIND_EXPR_BODY (stmt) = body;
1283 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1284 stmt = pop_stmt_list (stmt);
1287 /* Destroy any ObjC "super" receivers that may have been
1289 objc_clear_super_receiver ();
1291 stmt = do_poplevel (stmt);
1294 /* ??? See c_end_compound_stmt wrt statement expressions. */
1299 /* Finish an asm-statement, whose components are a STRING, some
1300 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1301 LABELS. Also note whether the asm-statement should be
1302 considered volatile. */
1305 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1306 tree input_operands, tree clobbers, tree labels)
1310 int ninputs = list_length (input_operands);
1311 int noutputs = list_length (output_operands);
1313 if (!processing_template_decl)
1315 const char *constraint;
1316 const char **oconstraints;
1317 bool allows_mem, allows_reg, is_inout;
1321 oconstraints = XALLOCAVEC (const char *, noutputs);
1323 string = resolve_asm_operand_names (string, output_operands,
1324 input_operands, labels);
1326 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1328 operand = TREE_VALUE (t);
1330 /* ??? Really, this should not be here. Users should be using a
1331 proper lvalue, dammit. But there's a long history of using
1332 casts in the output operands. In cases like longlong.h, this
1333 becomes a primitive form of typechecking -- if the cast can be
1334 removed, then the output operand had a type of the proper width;
1335 otherwise we'll get an error. Gross, but ... */
1336 STRIP_NOPS (operand);
1338 operand = mark_lvalue_use (operand);
1340 if (!lvalue_or_else (operand, lv_asm, tf_warning_or_error))
1341 operand = error_mark_node;
1343 if (operand != error_mark_node
1344 && (TREE_READONLY (operand)
1345 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1346 /* Functions are not modifiable, even though they are
1348 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1349 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1350 /* If it's an aggregate and any field is const, then it is
1351 effectively const. */
1352 || (CLASS_TYPE_P (TREE_TYPE (operand))
1353 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1354 cxx_readonly_error (operand, lv_asm);
1356 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1357 oconstraints[i] = constraint;
1359 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1360 &allows_mem, &allows_reg, &is_inout))
1362 /* If the operand is going to end up in memory,
1363 mark it addressable. */
1364 if (!allows_reg && !cxx_mark_addressable (operand))
1365 operand = error_mark_node;
1368 operand = error_mark_node;
1370 TREE_VALUE (t) = operand;
1373 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1375 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1376 operand = decay_conversion (TREE_VALUE (t));
1378 /* If the type of the operand hasn't been determined (e.g.,
1379 because it involves an overloaded function), then issue
1380 an error message. There's no context available to
1381 resolve the overloading. */
1382 if (TREE_TYPE (operand) == unknown_type_node)
1384 error ("type of asm operand %qE could not be determined",
1386 operand = error_mark_node;
1389 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1390 oconstraints, &allows_mem, &allows_reg))
1392 /* If the operand is going to end up in memory,
1393 mark it addressable. */
1394 if (!allows_reg && allows_mem)
1396 /* Strip the nops as we allow this case. FIXME, this really
1397 should be rejected or made deprecated. */
1398 STRIP_NOPS (operand);
1399 if (!cxx_mark_addressable (operand))
1400 operand = error_mark_node;
1404 operand = error_mark_node;
1406 TREE_VALUE (t) = operand;
1410 r = build_stmt (input_location, ASM_EXPR, string,
1411 output_operands, input_operands,
1413 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1414 r = maybe_cleanup_point_expr_void (r);
1415 return add_stmt (r);
1418 /* Finish a label with the indicated NAME. Returns the new label. */
1421 finish_label_stmt (tree name)
1423 tree decl = define_label (input_location, name);
1425 if (decl == error_mark_node)
1426 return error_mark_node;
1428 add_stmt (build_stmt (input_location, LABEL_EXPR, decl));
1433 /* Finish a series of declarations for local labels. G++ allows users
1434 to declare "local" labels, i.e., labels with scope. This extension
1435 is useful when writing code involving statement-expressions. */
1438 finish_label_decl (tree name)
1440 if (!at_function_scope_p ())
1442 error ("__label__ declarations are only allowed in function scopes");
1446 add_decl_expr (declare_local_label (name));
1449 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1452 finish_decl_cleanup (tree decl, tree cleanup)
1454 push_cleanup (decl, cleanup, false);
1457 /* If the current scope exits with an exception, run CLEANUP. */
1460 finish_eh_cleanup (tree cleanup)
1462 push_cleanup (NULL, cleanup, true);
1465 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1466 order they were written by the user. Each node is as for
1467 emit_mem_initializers. */
1470 finish_mem_initializers (tree mem_inits)
1472 /* Reorder the MEM_INITS so that they are in the order they appeared
1473 in the source program. */
1474 mem_inits = nreverse (mem_inits);
1476 if (processing_template_decl)
1480 for (mem = mem_inits; mem; mem = TREE_CHAIN (mem))
1482 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1483 check for bare parameter packs in the TREE_VALUE, because
1484 any parameter packs in the TREE_VALUE have already been
1485 bound as part of the TREE_PURPOSE. See
1486 make_pack_expansion for more information. */
1487 if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION
1488 && check_for_bare_parameter_packs (TREE_VALUE (mem)))
1489 TREE_VALUE (mem) = error_mark_node;
1492 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1495 emit_mem_initializers (mem_inits);
1498 /* Finish a parenthesized expression EXPR. */
1501 finish_parenthesized_expr (tree expr)
1504 /* This inhibits warnings in c_common_truthvalue_conversion. */
1505 TREE_NO_WARNING (expr) = 1;
1507 if (TREE_CODE (expr) == OFFSET_REF
1508 || TREE_CODE (expr) == SCOPE_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 /* Quals on the object don't matter. */;
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 (convert_from_reference
1576 (build_min (COMPONENT_REF, type, object, decl, NULL_TREE)));
1578 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1579 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1581 else if (processing_template_decl)
1582 return build_qualified_name (TREE_TYPE (decl),
1585 /*template_p=*/false);
1588 tree access_type = TREE_TYPE (object);
1590 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1593 /* If the data member was named `C::M', convert `*this' to `C'
1595 if (qualifying_scope)
1597 tree binfo = NULL_TREE;
1598 object = build_scoped_ref (object, qualifying_scope,
1602 return build_class_member_access_expr (object, decl,
1603 /*access_path=*/NULL_TREE,
1604 /*preserve_reference=*/false,
1605 tf_warning_or_error);
1609 /* If we are currently parsing a template and we encountered a typedef
1610 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1611 adds the typedef to a list tied to the current template.
1612 At tempate instantiatin time, that list is walked and access check
1613 performed for each typedef.
1614 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1617 add_typedef_to_current_template_for_access_check (tree typedef_decl,
1619 location_t location)
1621 tree template_info = NULL;
1622 tree cs = current_scope ();
1624 if (!is_typedef_decl (typedef_decl)
1626 || !CLASS_TYPE_P (context)
1630 if (CLASS_TYPE_P (cs) || TREE_CODE (cs) == FUNCTION_DECL)
1631 template_info = get_template_info (cs);
1634 && TI_TEMPLATE (template_info)
1635 && !currently_open_class (context))
1636 append_type_to_template_for_access_check (cs, typedef_decl,
1640 /* DECL was the declaration to which a qualified-id resolved. Issue
1641 an error message if it is not accessible. If OBJECT_TYPE is
1642 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1643 type of `*x', or `x', respectively. If the DECL was named as
1644 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1647 check_accessibility_of_qualified_id (tree decl,
1649 tree nested_name_specifier)
1652 tree qualifying_type = NULL_TREE;
1654 /* If we are parsing a template declaration and if decl is a typedef,
1655 add it to a list tied to the template.
1656 At template instantiation time, that list will be walked and
1657 access check performed. */
1658 add_typedef_to_current_template_for_access_check (decl,
1659 nested_name_specifier
1660 ? nested_name_specifier
1661 : DECL_CONTEXT (decl),
1664 /* If we're not checking, return immediately. */
1665 if (deferred_access_no_check)
1668 /* Determine the SCOPE of DECL. */
1669 scope = context_for_name_lookup (decl);
1670 /* If the SCOPE is not a type, then DECL is not a member. */
1671 if (!TYPE_P (scope))
1673 /* Compute the scope through which DECL is being accessed. */
1675 /* OBJECT_TYPE might not be a class type; consider:
1677 class A { typedef int I; };
1681 In this case, we will have "A::I" as the DECL, but "I" as the
1683 && CLASS_TYPE_P (object_type)
1684 && DERIVED_FROM_P (scope, object_type))
1685 /* If we are processing a `->' or `.' expression, use the type of the
1687 qualifying_type = object_type;
1688 else if (nested_name_specifier)
1690 /* If the reference is to a non-static member of the
1691 current class, treat it as if it were referenced through
1693 if (DECL_NONSTATIC_MEMBER_P (decl)
1694 && current_class_ptr
1695 && DERIVED_FROM_P (scope, current_class_type))
1696 qualifying_type = current_class_type;
1697 /* Otherwise, use the type indicated by the
1698 nested-name-specifier. */
1700 qualifying_type = nested_name_specifier;
1703 /* Otherwise, the name must be from the current class or one of
1705 qualifying_type = currently_open_derived_class (scope);
1708 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1709 or similar in a default argument value. */
1710 && CLASS_TYPE_P (qualifying_type)
1711 && !dependent_type_p (qualifying_type))
1712 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1716 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1717 class named to the left of the "::" operator. DONE is true if this
1718 expression is a complete postfix-expression; it is false if this
1719 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1720 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1721 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1722 is true iff this qualified name appears as a template argument. */
1725 finish_qualified_id_expr (tree qualifying_class,
1730 bool template_arg_p)
1732 gcc_assert (TYPE_P (qualifying_class));
1734 if (error_operand_p (expr))
1735 return error_mark_node;
1737 if (DECL_P (expr) || BASELINK_P (expr))
1741 check_template_keyword (expr);
1743 /* If EXPR occurs as the operand of '&', use special handling that
1744 permits a pointer-to-member. */
1745 if (address_p && done)
1747 if (TREE_CODE (expr) == SCOPE_REF)
1748 expr = TREE_OPERAND (expr, 1);
1749 expr = build_offset_ref (qualifying_class, expr,
1750 /*address_p=*/true);
1754 /* Within the scope of a class, turn references to non-static
1755 members into expression of the form "this->...". */
1757 /* But, within a template argument, we do not want make the
1758 transformation, as there is no "this" pointer. */
1760 else if (TREE_CODE (expr) == FIELD_DECL)
1762 push_deferring_access_checks (dk_no_check);
1763 expr = finish_non_static_data_member (expr, NULL_TREE,
1765 pop_deferring_access_checks ();
1767 else if (BASELINK_P (expr) && !processing_template_decl)
1771 /* See if any of the functions are non-static members. */
1772 /* If so, the expression may be relative to 'this'. */
1773 if (!shared_member_p (expr)
1774 && (ob = maybe_dummy_object (qualifying_class, NULL),
1775 !is_dummy_object (ob)))
1776 expr = (build_class_member_access_expr
1779 BASELINK_ACCESS_BINFO (expr),
1780 /*preserve_reference=*/false,
1781 tf_warning_or_error));
1783 /* The expression is a qualified name whose address is not
1785 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1791 /* Begin a statement-expression. The value returned must be passed to
1792 finish_stmt_expr. */
1795 begin_stmt_expr (void)
1797 return push_stmt_list ();
1800 /* Process the final expression of a statement expression. EXPR can be
1801 NULL, if the final expression is empty. Return a STATEMENT_LIST
1802 containing all the statements in the statement-expression, or
1803 ERROR_MARK_NODE if there was an error. */
1806 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1808 if (error_operand_p (expr))
1810 /* The type of the statement-expression is the type of the last
1812 TREE_TYPE (stmt_expr) = error_mark_node;
1813 return error_mark_node;
1816 /* If the last statement does not have "void" type, then the value
1817 of the last statement is the value of the entire expression. */
1820 tree type = TREE_TYPE (expr);
1822 if (processing_template_decl)
1824 expr = build_stmt (input_location, EXPR_STMT, expr);
1825 expr = add_stmt (expr);
1826 /* Mark the last statement so that we can recognize it as such at
1827 template-instantiation time. */
1828 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1830 else if (VOID_TYPE_P (type))
1832 /* Just treat this like an ordinary statement. */
1833 expr = finish_expr_stmt (expr);
1837 /* It actually has a value we need to deal with. First, force it
1838 to be an rvalue so that we won't need to build up a copy
1839 constructor call later when we try to assign it to something. */
1840 expr = force_rvalue (expr, tf_warning_or_error);
1841 if (error_operand_p (expr))
1842 return error_mark_node;
1844 /* Update for array-to-pointer decay. */
1845 type = TREE_TYPE (expr);
1847 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1848 normal statement, but don't convert to void or actually add
1850 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1851 expr = maybe_cleanup_point_expr (expr);
1855 /* The type of the statement-expression is the type of the last
1857 TREE_TYPE (stmt_expr) = type;
1863 /* Finish a statement-expression. EXPR should be the value returned
1864 by the previous begin_stmt_expr. Returns an expression
1865 representing the statement-expression. */
1868 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1873 if (error_operand_p (stmt_expr))
1875 pop_stmt_list (stmt_expr);
1876 return error_mark_node;
1879 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1881 type = TREE_TYPE (stmt_expr);
1882 result = pop_stmt_list (stmt_expr);
1883 TREE_TYPE (result) = type;
1885 if (processing_template_decl)
1887 result = build_min (STMT_EXPR, type, result);
1888 TREE_SIDE_EFFECTS (result) = 1;
1889 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1891 else if (CLASS_TYPE_P (type))
1893 /* Wrap the statement-expression in a TARGET_EXPR so that the
1894 temporary object created by the final expression is destroyed at
1895 the end of the full-expression containing the
1896 statement-expression. */
1897 result = force_target_expr (type, result, tf_warning_or_error);
1903 /* Returns the expression which provides the value of STMT_EXPR. */
1906 stmt_expr_value_expr (tree stmt_expr)
1908 tree t = STMT_EXPR_STMT (stmt_expr);
1910 if (TREE_CODE (t) == BIND_EXPR)
1911 t = BIND_EXPR_BODY (t);
1913 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1914 t = STATEMENT_LIST_TAIL (t)->stmt;
1916 if (TREE_CODE (t) == EXPR_STMT)
1917 t = EXPR_STMT_EXPR (t);
1922 /* Return TRUE iff EXPR_STMT is an empty list of
1923 expression statements. */
1926 empty_expr_stmt_p (tree expr_stmt)
1928 tree body = NULL_TREE;
1930 if (expr_stmt == void_zero_node)
1935 if (TREE_CODE (expr_stmt) == EXPR_STMT)
1936 body = EXPR_STMT_EXPR (expr_stmt);
1937 else if (TREE_CODE (expr_stmt) == STATEMENT_LIST)
1943 if (TREE_CODE (body) == STATEMENT_LIST)
1944 return tsi_end_p (tsi_start (body));
1946 return empty_expr_stmt_p (body);
1951 /* Perform Koenig lookup. FN is the postfix-expression representing
1952 the function (or functions) to call; ARGS are the arguments to the
1953 call; if INCLUDE_STD then the `std' namespace is automatically
1954 considered an associated namespace (used in range-based for loops).
1955 Returns the functions to be considered by overload resolution. */
1958 perform_koenig_lookup (tree fn, VEC(tree,gc) *args, bool include_std,
1959 tsubst_flags_t complain)
1961 tree identifier = NULL_TREE;
1962 tree functions = NULL_TREE;
1963 tree tmpl_args = NULL_TREE;
1964 bool template_id = false;
1966 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1968 /* Use a separate flag to handle null args. */
1970 tmpl_args = TREE_OPERAND (fn, 1);
1971 fn = TREE_OPERAND (fn, 0);
1974 /* Find the name of the overloaded function. */
1975 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1977 else if (is_overloaded_fn (fn))
1980 identifier = DECL_NAME (get_first_fn (functions));
1982 else if (DECL_P (fn))
1985 identifier = DECL_NAME (fn);
1988 /* A call to a namespace-scope function using an unqualified name.
1990 Do Koenig lookup -- unless any of the arguments are
1992 if (!any_type_dependent_arguments_p (args)
1993 && !any_dependent_template_arguments_p (tmpl_args))
1995 fn = lookup_arg_dependent (identifier, functions, args, include_std);
1998 /* The unqualified name could not be resolved. */
2000 fn = unqualified_fn_lookup_error (identifier);
2006 if (fn && template_id)
2007 fn = build2 (TEMPLATE_ID_EXPR, unknown_type_node, fn, tmpl_args);
2012 /* Generate an expression for `FN (ARGS)'. This may change the
2015 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2016 as a virtual call, even if FN is virtual. (This flag is set when
2017 encountering an expression where the function name is explicitly
2018 qualified. For example a call to `X::f' never generates a virtual
2021 Returns code for the call. */
2024 finish_call_expr (tree fn, VEC(tree,gc) **args, bool disallow_virtual,
2025 bool koenig_p, tsubst_flags_t complain)
2029 VEC(tree,gc) *orig_args = NULL;
2031 if (fn == error_mark_node)
2032 return error_mark_node;
2034 gcc_assert (!TYPE_P (fn));
2038 if (processing_template_decl)
2040 /* If the call expression is dependent, build a CALL_EXPR node
2041 with no type; type_dependent_expression_p recognizes
2042 expressions with no type as being dependent. */
2043 if (type_dependent_expression_p (fn)
2044 || any_type_dependent_arguments_p (*args)
2045 /* For a non-static member function that doesn't have an
2046 explicit object argument, we need to specifically
2047 test the type dependency of the "this" pointer because it
2048 is not included in *ARGS even though it is considered to
2049 be part of the list of arguments. Note that this is
2050 related to CWG issues 515 and 1005. */
2051 || (TREE_CODE (fn) != COMPONENT_REF
2052 && non_static_member_function_p (fn)
2053 && current_class_ref
2054 && type_dependent_expression_p (current_class_ref)))
2056 result = build_nt_call_vec (fn, *args);
2057 KOENIG_LOOKUP_P (result) = koenig_p;
2062 tree fndecl = OVL_CURRENT (fn);
2063 if (TREE_CODE (fndecl) != FUNCTION_DECL
2064 || !TREE_THIS_VOLATILE (fndecl))
2070 current_function_returns_abnormally = 1;
2074 orig_args = make_tree_vector_copy (*args);
2075 if (!BASELINK_P (fn)
2076 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
2077 && TREE_TYPE (fn) != unknown_type_node)
2078 fn = build_non_dependent_expr (fn);
2079 make_args_non_dependent (*args);
2082 if (TREE_CODE (fn) == COMPONENT_REF)
2084 tree member = TREE_OPERAND (fn, 1);
2085 if (BASELINK_P (member))
2087 tree object = TREE_OPERAND (fn, 0);
2088 return build_new_method_call (object, member,
2091 ? LOOKUP_NORMAL | LOOKUP_NONVIRTUAL
2098 if (is_overloaded_fn (fn))
2099 fn = baselink_for_fns (fn);
2102 if (BASELINK_P (fn))
2106 /* A call to a member function. From [over.call.func]:
2108 If the keyword this is in scope and refers to the class of
2109 that member function, or a derived class thereof, then the
2110 function call is transformed into a qualified function call
2111 using (*this) as the postfix-expression to the left of the
2112 . operator.... [Otherwise] a contrived object of type T
2113 becomes the implied object argument.
2117 struct A { void f(); };
2118 struct B : public A {};
2119 struct C : public A { void g() { B::f(); }};
2121 "the class of that member function" refers to `A'. But 11.2
2122 [class.access.base] says that we need to convert 'this' to B* as
2123 part of the access, so we pass 'B' to maybe_dummy_object. */
2125 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
2128 if (processing_template_decl)
2130 if (type_dependent_expression_p (object))
2132 tree ret = build_nt_call_vec (orig_fn, orig_args);
2133 release_tree_vector (orig_args);
2136 object = build_non_dependent_expr (object);
2139 result = build_new_method_call (object, fn, args, NULL_TREE,
2141 ? LOOKUP_NORMAL|LOOKUP_NONVIRTUAL
2146 else if (is_overloaded_fn (fn))
2148 /* If the function is an overloaded builtin, resolve it. */
2149 if (TREE_CODE (fn) == FUNCTION_DECL
2150 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2151 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
2152 result = resolve_overloaded_builtin (input_location, fn, *args);
2155 /* A call to a namespace-scope function. */
2156 result = build_new_function_call (fn, args, koenig_p, complain);
2158 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
2160 if (!VEC_empty (tree, *args))
2161 error ("arguments to destructor are not allowed");
2162 /* Mark the pseudo-destructor call as having side-effects so
2163 that we do not issue warnings about its use. */
2164 result = build1 (NOP_EXPR,
2166 TREE_OPERAND (fn, 0));
2167 TREE_SIDE_EFFECTS (result) = 1;
2169 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
2170 /* If the "function" is really an object of class type, it might
2171 have an overloaded `operator ()'. */
2172 result = build_op_call (fn, args, complain);
2175 /* A call where the function is unknown. */
2176 result = cp_build_function_call_vec (fn, args, complain);
2178 if (processing_template_decl && result != error_mark_node)
2180 if (TREE_CODE (result) == INDIRECT_REF)
2181 result = TREE_OPERAND (result, 0);
2182 result = build_call_vec (TREE_TYPE (result), orig_fn, orig_args);
2183 SET_EXPR_LOCATION (result, input_location);
2184 KOENIG_LOOKUP_P (result) = koenig_p;
2185 release_tree_vector (orig_args);
2186 result = convert_from_reference (result);
2191 /* Free garbage OVERLOADs from arg-dependent lookup. */
2192 tree next = NULL_TREE;
2194 fn && TREE_CODE (fn) == OVERLOAD && OVL_ARG_DEPENDENT (fn);
2197 if (processing_template_decl)
2198 /* In a template, we'll re-use them at instantiation time. */
2199 OVL_ARG_DEPENDENT (fn) = false;
2202 next = OVL_CHAIN (fn);
2211 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2212 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2213 POSTDECREMENT_EXPR.) */
2216 finish_increment_expr (tree expr, enum tree_code code)
2218 return build_x_unary_op (code, expr, tf_warning_or_error);
2221 /* Finish a use of `this'. Returns an expression for `this'. */
2224 finish_this_expr (void)
2228 if (current_class_ptr)
2230 tree type = TREE_TYPE (current_class_ref);
2232 /* In a lambda expression, 'this' refers to the captured 'this'. */
2233 if (LAMBDA_TYPE_P (type))
2234 result = lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type));
2236 result = current_class_ptr;
2239 else if (current_function_decl
2240 && DECL_STATIC_FUNCTION_P (current_function_decl))
2242 error ("%<this%> is unavailable for static member functions");
2243 result = error_mark_node;
2247 if (current_function_decl)
2248 error ("invalid use of %<this%> in non-member function");
2250 error ("invalid use of %<this%> at top level");
2251 result = error_mark_node;
2257 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2258 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2259 the TYPE for the type given. If SCOPE is non-NULL, the expression
2260 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2263 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2265 if (object == error_mark_node || destructor == error_mark_node)
2266 return error_mark_node;
2268 gcc_assert (TYPE_P (destructor));
2270 if (!processing_template_decl)
2272 if (scope == error_mark_node)
2274 error ("invalid qualifying scope in pseudo-destructor name");
2275 return error_mark_node;
2277 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2279 error ("qualified type %qT does not match destructor name ~%qT",
2281 return error_mark_node;
2285 /* [expr.pseudo] says both:
2287 The type designated by the pseudo-destructor-name shall be
2288 the same as the object type.
2292 The cv-unqualified versions of the object type and of the
2293 type designated by the pseudo-destructor-name shall be the
2296 We implement the more generous second sentence, since that is
2297 what most other compilers do. */
2298 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2301 error ("%qE is not of type %qT", object, destructor);
2302 return error_mark_node;
2306 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2309 /* Finish an expression of the form CODE EXPR. */
2312 finish_unary_op_expr (enum tree_code code, tree expr)
2314 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2315 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2316 overflow_warning (input_location, result);
2321 /* Finish a compound-literal expression. TYPE is the type to which
2322 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2325 finish_compound_literal (tree type, tree compound_literal,
2326 tsubst_flags_t complain)
2328 if (type == error_mark_node)
2329 return error_mark_node;
2331 if (TREE_CODE (type) == REFERENCE_TYPE)
2334 = finish_compound_literal (TREE_TYPE (type), compound_literal,
2336 return cp_build_c_cast (type, compound_literal, complain);
2339 if (!TYPE_OBJ_P (type))
2341 if (complain & tf_error)
2342 error ("compound literal of non-object type %qT", type);
2343 return error_mark_node;
2346 if (processing_template_decl)
2348 TREE_TYPE (compound_literal) = type;
2349 /* Mark the expression as a compound literal. */
2350 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2351 return compound_literal;
2354 type = complete_type (type);
2356 if (TYPE_NON_AGGREGATE_CLASS (type))
2358 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2359 everywhere that deals with function arguments would be a pain, so
2360 just wrap it in a TREE_LIST. The parser set a flag so we know
2361 that it came from T{} rather than T({}). */
2362 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2363 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2364 return build_functional_cast (type, compound_literal, complain);
2367 if (TREE_CODE (type) == ARRAY_TYPE
2368 && check_array_initializer (NULL_TREE, type, compound_literal))
2369 return error_mark_node;
2370 compound_literal = reshape_init (type, compound_literal, complain);
2371 if (cxx_dialect >= cxx0x && SCALAR_TYPE_P (type)
2372 && !BRACE_ENCLOSED_INITIALIZER_P (compound_literal))
2373 check_narrowing (type, compound_literal);
2374 if (TREE_CODE (type) == ARRAY_TYPE
2375 && TYPE_DOMAIN (type) == NULL_TREE)
2377 cp_complete_array_type_or_error (&type, compound_literal,
2379 if (type == error_mark_node)
2380 return error_mark_node;
2382 compound_literal = digest_init (type, compound_literal, complain);
2383 if (TREE_CODE (compound_literal) == CONSTRUCTOR)
2384 TREE_HAS_CONSTRUCTOR (compound_literal) = true;
2385 /* Put static/constant array temporaries in static variables, but always
2386 represent class temporaries with TARGET_EXPR so we elide copies. */
2387 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type))
2388 && TREE_CODE (type) == ARRAY_TYPE
2389 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2390 && initializer_constant_valid_p (compound_literal, type))
2392 tree decl = create_temporary_var (type);
2393 DECL_INITIAL (decl) = compound_literal;
2394 TREE_STATIC (decl) = 1;
2395 if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type))
2397 /* 5.19 says that a constant expression can include an
2398 lvalue-rvalue conversion applied to "a glvalue of literal type
2399 that refers to a non-volatile temporary object initialized
2400 with a constant expression". Rather than try to communicate
2401 that this VAR_DECL is a temporary, just mark it constexpr. */
2402 DECL_DECLARED_CONSTEXPR_P (decl) = true;
2403 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true;
2404 TREE_CONSTANT (decl) = true;
2406 cp_apply_type_quals_to_decl (cp_type_quals (type), decl);
2407 decl = pushdecl_top_level (decl);
2408 DECL_NAME (decl) = make_anon_name ();
2409 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2413 return get_target_expr_sfinae (compound_literal, complain);
2416 /* Return the declaration for the function-name variable indicated by
2420 finish_fname (tree id)
2424 decl = fname_decl (input_location, C_RID_CODE (id), id);
2425 if (processing_template_decl && current_function_decl)
2426 decl = DECL_NAME (decl);
2430 /* Finish a translation unit. */
2433 finish_translation_unit (void)
2435 /* In case there were missing closebraces,
2436 get us back to the global binding level. */
2438 while (current_namespace != global_namespace)
2441 /* Do file scope __FUNCTION__ et al. */
2442 finish_fname_decls ();
2445 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2446 Returns the parameter. */
2449 finish_template_type_parm (tree aggr, tree identifier)
2451 if (aggr != class_type_node)
2453 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2454 aggr = class_type_node;
2457 return build_tree_list (aggr, identifier);
2460 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2461 Returns the parameter. */
2464 finish_template_template_parm (tree aggr, tree identifier)
2466 tree decl = build_decl (input_location,
2467 TYPE_DECL, identifier, NULL_TREE);
2468 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2469 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2470 DECL_TEMPLATE_RESULT (tmpl) = decl;
2471 DECL_ARTIFICIAL (decl) = 1;
2472 end_template_decl ();
2474 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2476 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2477 /*is_primary=*/true, /*is_partial=*/false,
2480 return finish_template_type_parm (aggr, tmpl);
2483 /* ARGUMENT is the default-argument value for a template template
2484 parameter. If ARGUMENT is invalid, issue error messages and return
2485 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2488 check_template_template_default_arg (tree argument)
2490 if (TREE_CODE (argument) != TEMPLATE_DECL
2491 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2492 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2494 if (TREE_CODE (argument) == TYPE_DECL)
2495 error ("invalid use of type %qT as a default value for a template "
2496 "template-parameter", TREE_TYPE (argument));
2498 error ("invalid default argument for a template template parameter");
2499 return error_mark_node;
2505 /* Begin a class definition, as indicated by T. */
2508 begin_class_definition (tree t, tree attributes)
2510 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2511 return error_mark_node;
2513 if (processing_template_parmlist)
2515 error ("definition of %q#T inside template parameter list", t);
2516 return error_mark_node;
2519 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2520 are passed the same as decimal scalar types. */
2521 if (TREE_CODE (t) == RECORD_TYPE
2522 && !processing_template_decl)
2524 tree ns = TYPE_CONTEXT (t);
2525 if (ns && TREE_CODE (ns) == NAMESPACE_DECL
2526 && DECL_CONTEXT (ns) == std_node
2528 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns)), "decimal"))
2530 const char *n = TYPE_NAME_STRING (t);
2531 if ((strcmp (n, "decimal32") == 0)
2532 || (strcmp (n, "decimal64") == 0)
2533 || (strcmp (n, "decimal128") == 0))
2534 TYPE_TRANSPARENT_AGGR (t) = 1;
2538 /* A non-implicit typename comes from code like:
2540 template <typename T> struct A {
2541 template <typename U> struct A<T>::B ...
2543 This is erroneous. */
2544 else if (TREE_CODE (t) == TYPENAME_TYPE)
2546 error ("invalid definition of qualified type %qT", t);
2547 t = error_mark_node;
2550 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2552 t = make_class_type (RECORD_TYPE);
2553 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2556 if (TYPE_BEING_DEFINED (t))
2558 t = make_class_type (TREE_CODE (t));
2559 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2561 maybe_process_partial_specialization (t);
2563 TYPE_BEING_DEFINED (t) = 1;
2565 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2566 fixup_attribute_variants (t);
2568 if (flag_pack_struct)
2571 TYPE_PACKED (t) = 1;
2572 /* Even though the type is being defined for the first time
2573 here, there might have been a forward declaration, so there
2574 might be cv-qualified variants of T. */
2575 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2576 TYPE_PACKED (v) = 1;
2578 /* Reset the interface data, at the earliest possible
2579 moment, as it might have been set via a class foo;
2581 if (! TYPE_ANONYMOUS_P (t))
2583 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2584 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2585 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2586 (t, finfo->interface_unknown);
2588 reset_specialization();
2590 /* Make a declaration for this class in its own scope. */
2591 build_self_reference ();
2596 /* Finish the member declaration given by DECL. */
2599 finish_member_declaration (tree decl)
2601 if (decl == error_mark_node || decl == NULL_TREE)
2604 if (decl == void_type_node)
2605 /* The COMPONENT was a friend, not a member, and so there's
2606 nothing for us to do. */
2609 /* We should see only one DECL at a time. */
2610 gcc_assert (DECL_CHAIN (decl) == NULL_TREE);
2612 /* Set up access control for DECL. */
2614 = (current_access_specifier == access_private_node);
2615 TREE_PROTECTED (decl)
2616 = (current_access_specifier == access_protected_node);
2617 if (TREE_CODE (decl) == TEMPLATE_DECL)
2619 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2620 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2623 /* Mark the DECL as a member of the current class. */
2624 DECL_CONTEXT (decl) = current_class_type;
2626 /* Check for bare parameter packs in the member variable declaration. */
2627 if (TREE_CODE (decl) == FIELD_DECL)
2629 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2630 TREE_TYPE (decl) = error_mark_node;
2631 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2632 DECL_ATTRIBUTES (decl) = NULL_TREE;
2637 A C language linkage is ignored for the names of class members
2638 and the member function type of class member functions. */
2639 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2640 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2642 /* Put functions on the TYPE_METHODS list and everything else on the
2643 TYPE_FIELDS list. Note that these are built up in reverse order.
2644 We reverse them (to obtain declaration order) in finish_struct. */
2645 if (TREE_CODE (decl) == FUNCTION_DECL
2646 || DECL_FUNCTION_TEMPLATE_P (decl))
2648 /* We also need to add this function to the
2649 CLASSTYPE_METHOD_VEC. */
2650 if (add_method (current_class_type, decl, NULL_TREE))
2652 DECL_CHAIN (decl) = TYPE_METHODS (current_class_type);
2653 TYPE_METHODS (current_class_type) = decl;
2655 maybe_add_class_template_decl_list (current_class_type, decl,
2659 /* Enter the DECL into the scope of the class. */
2660 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2661 || pushdecl_class_level (decl))
2663 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2664 go at the beginning. The reason is that lookup_field_1
2665 searches the list in order, and we want a field name to
2666 override a type name so that the "struct stat hack" will
2667 work. In particular:
2669 struct S { enum E { }; int E } s;
2672 is valid. In addition, the FIELD_DECLs must be maintained in
2673 declaration order so that class layout works as expected.
2674 However, we don't need that order until class layout, so we
2675 save a little time by putting FIELD_DECLs on in reverse order
2676 here, and then reversing them in finish_struct_1. (We could
2677 also keep a pointer to the correct insertion points in the
2680 if (TREE_CODE (decl) == TYPE_DECL)
2681 TYPE_FIELDS (current_class_type)
2682 = chainon (TYPE_FIELDS (current_class_type), decl);
2685 DECL_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2686 TYPE_FIELDS (current_class_type) = decl;
2689 maybe_add_class_template_decl_list (current_class_type, decl,
2694 note_decl_for_pch (decl);
2697 /* DECL has been declared while we are building a PCH file. Perform
2698 actions that we might normally undertake lazily, but which can be
2699 performed now so that they do not have to be performed in
2700 translation units which include the PCH file. */
2703 note_decl_for_pch (tree decl)
2705 gcc_assert (pch_file);
2707 /* There's a good chance that we'll have to mangle names at some
2708 point, even if only for emission in debugging information. */
2709 if ((TREE_CODE (decl) == VAR_DECL
2710 || TREE_CODE (decl) == FUNCTION_DECL)
2711 && !processing_template_decl)
2715 /* Finish processing a complete template declaration. The PARMS are
2716 the template parameters. */
2719 finish_template_decl (tree parms)
2722 end_template_decl ();
2724 end_specialization ();
2727 /* Finish processing a template-id (which names a type) of the form
2728 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2729 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2730 the scope of template-id indicated. */
2733 finish_template_type (tree name, tree args, int entering_scope)
2737 decl = lookup_template_class (name, args,
2738 NULL_TREE, NULL_TREE, entering_scope,
2739 tf_warning_or_error | tf_user);
2740 if (decl != error_mark_node)
2741 decl = TYPE_STUB_DECL (decl);
2746 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2747 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2748 BASE_CLASS, or NULL_TREE if an error occurred. The
2749 ACCESS_SPECIFIER is one of
2750 access_{default,public,protected_private}_node. For a virtual base
2751 we set TREE_TYPE. */
2754 finish_base_specifier (tree base, tree access, bool virtual_p)
2758 if (base == error_mark_node)
2760 error ("invalid base-class specification");
2763 else if (! MAYBE_CLASS_TYPE_P (base))
2765 error ("%qT is not a class type", base);
2770 if (cp_type_quals (base) != 0)
2772 /* DR 484: Can a base-specifier name a cv-qualified
2774 base = TYPE_MAIN_VARIANT (base);
2776 result = build_tree_list (access, base);
2778 TREE_TYPE (result) = integer_type_node;
2784 /* If FNS is a member function, a set of member functions, or a
2785 template-id referring to one or more member functions, return a
2786 BASELINK for FNS, incorporating the current access context.
2787 Otherwise, return FNS unchanged. */
2790 baselink_for_fns (tree fns)
2795 if (BASELINK_P (fns)
2796 || error_operand_p (fns))
2800 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2801 fn = TREE_OPERAND (fn, 0);
2802 fn = get_first_fn (fn);
2803 if (!DECL_FUNCTION_MEMBER_P (fn))
2806 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2808 cl = DECL_CONTEXT (fn);
2809 cl = TYPE_BINFO (cl);
2810 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2813 /* Returns true iff DECL is an automatic variable from a function outside
2817 outer_automatic_var_p (tree decl)
2819 return ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2820 && DECL_FUNCTION_SCOPE_P (decl)
2821 && !TREE_STATIC (decl)
2822 && DECL_CONTEXT (decl) != current_function_decl);
2825 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2826 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2827 if non-NULL, is the type or namespace used to explicitly qualify
2828 ID_EXPRESSION. DECL is the entity to which that name has been
2831 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2832 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2833 be set to true if this expression isn't permitted in a
2834 constant-expression, but it is otherwise not set by this function.
2835 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2836 constant-expression, but a non-constant expression is also
2839 DONE is true if this expression is a complete postfix-expression;
2840 it is false if this expression is followed by '->', '[', '(', etc.
2841 ADDRESS_P is true iff this expression is the operand of '&'.
2842 TEMPLATE_P is true iff the qualified-id was of the form
2843 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2844 appears as a template argument.
2846 If an error occurs, and it is the kind of error that might cause
2847 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2848 is the caller's responsibility to issue the message. *ERROR_MSG
2849 will be a string with static storage duration, so the caller need
2852 Return an expression for the entity, after issuing appropriate
2853 diagnostics. This function is also responsible for transforming a
2854 reference to a non-static member into a COMPONENT_REF that makes
2855 the use of "this" explicit.
2857 Upon return, *IDK will be filled in appropriately. */
2859 finish_id_expression (tree id_expression,
2863 bool integral_constant_expression_p,
2864 bool allow_non_integral_constant_expression_p,
2865 bool *non_integral_constant_expression_p,
2869 bool template_arg_p,
2870 const char **error_msg,
2871 location_t location)
2873 /* Initialize the output parameters. */
2874 *idk = CP_ID_KIND_NONE;
2877 if (id_expression == error_mark_node)
2878 return error_mark_node;
2879 /* If we have a template-id, then no further lookup is
2880 required. If the template-id was for a template-class, we
2881 will sometimes have a TYPE_DECL at this point. */
2882 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2883 || TREE_CODE (decl) == TYPE_DECL)
2885 /* Look up the name. */
2888 if (decl == error_mark_node)
2890 /* Name lookup failed. */
2893 || (!dependent_type_p (scope)
2894 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2895 && IDENTIFIER_TYPENAME_P (id_expression)
2896 && dependent_type_p (TREE_TYPE (id_expression))))))
2898 /* If the qualifying type is non-dependent (and the name
2899 does not name a conversion operator to a dependent
2900 type), issue an error. */
2901 qualified_name_lookup_error (scope, id_expression, decl, location);
2902 return error_mark_node;
2906 /* It may be resolved via Koenig lookup. */
2907 *idk = CP_ID_KIND_UNQUALIFIED;
2908 return id_expression;
2911 decl = id_expression;
2913 /* If DECL is a variable that would be out of scope under
2914 ANSI/ISO rules, but in scope in the ARM, name lookup
2915 will succeed. Issue a diagnostic here. */
2917 decl = check_for_out_of_scope_variable (decl);
2919 /* Remember that the name was used in the definition of
2920 the current class so that we can check later to see if
2921 the meaning would have been different after the class
2922 was entirely defined. */
2923 if (!scope && decl != error_mark_node
2924 && TREE_CODE (id_expression) == IDENTIFIER_NODE)
2925 maybe_note_name_used_in_class (id_expression, decl);
2927 /* Disallow uses of local variables from containing functions, except
2928 within lambda-expressions. */
2929 if (outer_automatic_var_p (decl)
2930 /* It's not a use (3.2) if we're in an unevaluated context. */
2931 && !cp_unevaluated_operand)
2933 tree context = DECL_CONTEXT (decl);
2934 tree containing_function = current_function_decl;
2935 tree lambda_stack = NULL_TREE;
2936 tree lambda_expr = NULL_TREE;
2937 tree initializer = convert_from_reference (decl);
2939 /* Mark it as used now even if the use is ill-formed. */
2942 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2943 support for an approach in which a reference to a local
2944 [constant] automatic variable in a nested class or lambda body
2945 would enter the expression as an rvalue, which would reduce
2946 the complexity of the problem"
2948 FIXME update for final resolution of core issue 696. */
2949 if (decl_constant_var_p (decl))
2950 return integral_constant_value (decl);
2952 /* If we are in a lambda function, we can move out until we hit
2954 2. a non-lambda function, or
2955 3. a non-default capturing lambda function. */
2956 while (context != containing_function
2957 && LAMBDA_FUNCTION_P (containing_function))
2959 lambda_expr = CLASSTYPE_LAMBDA_EXPR
2960 (DECL_CONTEXT (containing_function));
2962 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr)
2966 lambda_stack = tree_cons (NULL_TREE,
2971 = decl_function_context (containing_function);
2974 if (context == containing_function)
2976 decl = add_default_capture (lambda_stack,
2977 /*id=*/DECL_NAME (decl),
2980 else if (lambda_expr)
2982 error ("%qD is not captured", decl);
2983 return error_mark_node;
2987 error (TREE_CODE (decl) == VAR_DECL
2988 ? "use of %<auto%> variable from containing function"
2989 : "use of parameter from containing function");
2990 error (" %q+#D declared here", decl);
2991 return error_mark_node;
2995 /* Also disallow uses of function parameters outside the function
2996 body, except inside an unevaluated context (i.e. decltype). */
2997 if (TREE_CODE (decl) == PARM_DECL
2998 && DECL_CONTEXT (decl) == NULL_TREE
2999 && !cp_unevaluated_operand)
3001 error ("use of parameter %qD outside function body", decl);
3002 return error_mark_node;
3006 /* If we didn't find anything, or what we found was a type,
3007 then this wasn't really an id-expression. */
3008 if (TREE_CODE (decl) == TEMPLATE_DECL
3009 && !DECL_FUNCTION_TEMPLATE_P (decl))
3011 *error_msg = "missing template arguments";
3012 return error_mark_node;
3014 else if (TREE_CODE (decl) == TYPE_DECL
3015 || TREE_CODE (decl) == NAMESPACE_DECL)
3017 *error_msg = "expected primary-expression";
3018 return error_mark_node;
3021 /* If the name resolved to a template parameter, there is no
3022 need to look it up again later. */
3023 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
3024 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
3028 *idk = CP_ID_KIND_NONE;
3029 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
3030 decl = TEMPLATE_PARM_DECL (decl);
3031 r = convert_from_reference (DECL_INITIAL (decl));
3033 if (integral_constant_expression_p
3034 && !dependent_type_p (TREE_TYPE (decl))
3035 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
3037 if (!allow_non_integral_constant_expression_p)
3038 error ("template parameter %qD of type %qT is not allowed in "
3039 "an integral constant expression because it is not of "
3040 "integral or enumeration type", decl, TREE_TYPE (decl));
3041 *non_integral_constant_expression_p = true;
3045 /* Similarly, we resolve enumeration constants to their
3046 underlying values. */
3047 else if (TREE_CODE (decl) == CONST_DECL)
3049 *idk = CP_ID_KIND_NONE;
3050 if (!processing_template_decl)
3052 used_types_insert (TREE_TYPE (decl));
3053 return DECL_INITIAL (decl);
3061 /* If the declaration was explicitly qualified indicate
3062 that. The semantics of `A::f(3)' are different than
3063 `f(3)' if `f' is virtual. */
3065 ? CP_ID_KIND_QUALIFIED
3066 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
3067 ? CP_ID_KIND_TEMPLATE_ID
3068 : CP_ID_KIND_UNQUALIFIED));
3073 An id-expression is type-dependent if it contains an
3074 identifier that was declared with a dependent type.
3076 The standard is not very specific about an id-expression that
3077 names a set of overloaded functions. What if some of them
3078 have dependent types and some of them do not? Presumably,
3079 such a name should be treated as a dependent name. */
3080 /* Assume the name is not dependent. */
3081 dependent_p = false;
3082 if (!processing_template_decl)
3083 /* No names are dependent outside a template. */
3085 /* A template-id where the name of the template was not resolved
3086 is definitely dependent. */
3087 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
3088 && (TREE_CODE (TREE_OPERAND (decl, 0))
3089 == IDENTIFIER_NODE))
3091 /* For anything except an overloaded function, just check its
3093 else if (!is_overloaded_fn (decl))
3095 = dependent_type_p (TREE_TYPE (decl));
3096 /* For a set of overloaded functions, check each of the
3102 if (BASELINK_P (fns))
3103 fns = BASELINK_FUNCTIONS (fns);
3105 /* For a template-id, check to see if the template
3106 arguments are dependent. */
3107 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
3109 tree args = TREE_OPERAND (fns, 1);
3110 dependent_p = any_dependent_template_arguments_p (args);
3111 /* The functions are those referred to by the
3113 fns = TREE_OPERAND (fns, 0);
3116 /* If there are no dependent template arguments, go through
3117 the overloaded functions. */
3118 while (fns && !dependent_p)
3120 tree fn = OVL_CURRENT (fns);
3122 /* Member functions of dependent classes are
3124 if (TREE_CODE (fn) == FUNCTION_DECL
3125 && type_dependent_expression_p (fn))
3127 else if (TREE_CODE (fn) == TEMPLATE_DECL
3128 && dependent_template_p (fn))
3131 fns = OVL_NEXT (fns);
3135 /* If the name was dependent on a template parameter, we will
3136 resolve the name at instantiation time. */
3139 /* Create a SCOPE_REF for qualified names, if the scope is
3145 if (address_p && done)
3146 decl = finish_qualified_id_expr (scope, decl,
3152 tree type = NULL_TREE;
3153 if (DECL_P (decl) && !dependent_scope_p (scope))
3154 type = TREE_TYPE (decl);
3155 decl = build_qualified_name (type,
3161 if (TREE_TYPE (decl))
3162 decl = convert_from_reference (decl);
3165 /* A TEMPLATE_ID already contains all the information we
3167 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
3168 return id_expression;
3169 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
3170 /* If we found a variable, then name lookup during the
3171 instantiation will always resolve to the same VAR_DECL
3172 (or an instantiation thereof). */
3173 if (TREE_CODE (decl) == VAR_DECL
3174 || TREE_CODE (decl) == PARM_DECL)
3177 return convert_from_reference (decl);
3179 /* The same is true for FIELD_DECL, but we also need to
3180 make sure that the syntax is correct. */
3181 else if (TREE_CODE (decl) == FIELD_DECL)
3183 /* Since SCOPE is NULL here, this is an unqualified name.
3184 Access checking has been performed during name lookup
3185 already. Turn off checking to avoid duplicate errors. */
3186 push_deferring_access_checks (dk_no_check);
3187 decl = finish_non_static_data_member
3189 /*qualifying_scope=*/NULL_TREE);
3190 pop_deferring_access_checks ();
3193 return id_expression;
3196 if (TREE_CODE (decl) == NAMESPACE_DECL)
3198 error ("use of namespace %qD as expression", decl);
3199 return error_mark_node;
3201 else if (DECL_CLASS_TEMPLATE_P (decl))
3203 error ("use of class template %qT as expression", decl);
3204 return error_mark_node;
3206 else if (TREE_CODE (decl) == TREE_LIST)
3208 /* Ambiguous reference to base members. */
3209 error ("request for member %qD is ambiguous in "
3210 "multiple inheritance lattice", id_expression);
3211 print_candidates (decl);
3212 return error_mark_node;
3215 /* Mark variable-like entities as used. Functions are similarly
3216 marked either below or after overload resolution. */
3217 if (TREE_CODE (decl) == VAR_DECL
3218 || TREE_CODE (decl) == PARM_DECL
3219 || TREE_CODE (decl) == RESULT_DECL)
3222 /* Only certain kinds of names are allowed in constant
3223 expression. Enumerators and template parameters have already
3224 been handled above. */
3225 if (! error_operand_p (decl)
3226 && integral_constant_expression_p
3227 && ! decl_constant_var_p (decl)
3228 && ! builtin_valid_in_constant_expr_p (decl))
3230 if (!allow_non_integral_constant_expression_p)
3232 error ("%qD cannot appear in a constant-expression", decl);
3233 return error_mark_node;
3235 *non_integral_constant_expression_p = true;
3240 decl = (adjust_result_of_qualified_name_lookup
3241 (decl, scope, current_nonlambda_class_type()));
3243 if (TREE_CODE (decl) == FUNCTION_DECL)
3246 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
3247 decl = finish_qualified_id_expr (scope,
3255 tree r = convert_from_reference (decl);
3257 /* In a template, return a SCOPE_REF for most qualified-ids
3258 so that we can check access at instantiation time. But if
3259 we're looking at a member of the current instantiation, we
3260 know we have access and building up the SCOPE_REF confuses
3261 non-type template argument handling. */
3262 if (processing_template_decl && TYPE_P (scope)
3263 && !currently_open_class (scope))
3264 r = build_qualified_name (TREE_TYPE (r),
3270 else if (TREE_CODE (decl) == FIELD_DECL)
3272 /* Since SCOPE is NULL here, this is an unqualified name.
3273 Access checking has been performed during name lookup
3274 already. Turn off checking to avoid duplicate errors. */
3275 push_deferring_access_checks (dk_no_check);
3276 decl = finish_non_static_data_member (decl, NULL_TREE,
3277 /*qualifying_scope=*/NULL_TREE);
3278 pop_deferring_access_checks ();
3280 else if (is_overloaded_fn (decl))
3284 first_fn = get_first_fn (decl);
3285 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
3286 first_fn = DECL_TEMPLATE_RESULT (first_fn);
3288 if (!really_overloaded_fn (decl))
3289 mark_used (first_fn);
3292 && TREE_CODE (first_fn) == FUNCTION_DECL
3293 && DECL_FUNCTION_MEMBER_P (first_fn)
3294 && !shared_member_p (decl))
3296 /* A set of member functions. */
3297 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3298 return finish_class_member_access_expr (decl, id_expression,
3299 /*template_p=*/false,
3300 tf_warning_or_error);
3303 decl = baselink_for_fns (decl);
3307 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3308 && DECL_CLASS_SCOPE_P (decl))
3310 tree context = context_for_name_lookup (decl);
3311 if (context != current_class_type)
3313 tree path = currently_open_derived_class (context);
3314 perform_or_defer_access_check (TYPE_BINFO (path),
3319 decl = convert_from_reference (decl);
3323 if (TREE_DEPRECATED (decl))
3324 warn_deprecated_use (decl, NULL_TREE);
3329 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3330 use as a type-specifier. */
3333 finish_typeof (tree expr)
3337 if (type_dependent_expression_p (expr))
3339 type = cxx_make_type (TYPEOF_TYPE);
3340 TYPEOF_TYPE_EXPR (type) = expr;
3341 SET_TYPE_STRUCTURAL_EQUALITY (type);
3346 expr = mark_type_use (expr);
3348 type = unlowered_expr_type (expr);
3350 if (!type || type == unknown_type_node)
3352 error ("type of %qE is unknown", expr);
3353 return error_mark_node;
3359 /* Implement the __underlying_type keyword: Return the underlying
3360 type of TYPE, suitable for use as a type-specifier. */
3363 finish_underlying_type (tree type)
3365 tree underlying_type;
3367 if (processing_template_decl)
3369 underlying_type = cxx_make_type (UNDERLYING_TYPE);
3370 UNDERLYING_TYPE_TYPE (underlying_type) = type;
3371 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type);
3373 return underlying_type;
3376 complete_type (type);
3378 if (TREE_CODE (type) != ENUMERAL_TYPE)
3380 error ("%qE is not an enumeration type", type);
3381 return error_mark_node;
3384 underlying_type = ENUM_UNDERLYING_TYPE (type);
3386 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
3387 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
3388 See finish_enum_value_list for details. */
3389 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type))
3391 = c_common_type_for_mode (TYPE_MODE (underlying_type),
3392 TYPE_UNSIGNED (underlying_type));
3394 return underlying_type;
3397 /* Implement the __direct_bases keyword: Return the direct base classes
3401 calculate_direct_bases (tree type)
3403 VEC(tree, gc) *vector = make_tree_vector();
3404 tree bases_vec = NULL_TREE;
3405 VEC(tree, none) *base_binfos;
3409 complete_type (type);
3411 if (!NON_UNION_CLASS_TYPE_P (type))
3412 return make_tree_vec (0);
3414 base_binfos = BINFO_BASE_BINFOS (TYPE_BINFO (type));
3416 /* Virtual bases are initialized first */
3417 for (i = 0; VEC_iterate (tree, base_binfos, i, binfo); i++)
3419 if (BINFO_VIRTUAL_P (binfo))
3421 VEC_safe_push (tree, gc, vector, binfo);
3425 /* Now non-virtuals */
3426 for (i = 0; VEC_iterate (tree, base_binfos, i, binfo); i++)
3428 if (!BINFO_VIRTUAL_P (binfo))
3430 VEC_safe_push (tree, gc, vector, binfo);
3435 bases_vec = make_tree_vec (VEC_length (tree, vector));
3437 for (i = 0; i < VEC_length (tree, vector); ++i)
3439 TREE_VEC_ELT (bases_vec, i) = BINFO_TYPE (VEC_index (tree, vector, i));
3444 /* Implement the __bases keyword: Return the base classes
3447 /* Find morally non-virtual base classes by walking binfo hierarchy */
3448 /* Virtual base classes are handled separately in finish_bases */
3451 dfs_calculate_bases_pre (tree binfo, ATTRIBUTE_UNUSED void *data_)
3453 /* Don't walk bases of virtual bases */
3454 return BINFO_VIRTUAL_P (binfo) ? dfs_skip_bases : NULL_TREE;
3458 dfs_calculate_bases_post (tree binfo, void *data_)
3460 VEC(tree, gc) **data = (VEC(tree, gc) **) data_;
3461 if (!BINFO_VIRTUAL_P (binfo))
3463 VEC_safe_push (tree, gc, *data, BINFO_TYPE (binfo));
3468 /* Calculates the morally non-virtual base classes of a class */
3469 static VEC(tree, gc) *
3470 calculate_bases_helper (tree type)
3472 VEC(tree, gc) *vector = make_tree_vector();
3474 /* Now add non-virtual base classes in order of construction */
3475 dfs_walk_all (TYPE_BINFO (type),
3476 dfs_calculate_bases_pre, dfs_calculate_bases_post, &vector);
3481 calculate_bases (tree type)
3483 VEC(tree, gc) *vector = make_tree_vector();
3484 tree bases_vec = NULL_TREE;
3486 VEC(tree, gc) *vbases;
3487 VEC(tree, gc) *nonvbases;
3490 complete_type (type);
3492 if (!NON_UNION_CLASS_TYPE_P (type))
3493 return make_tree_vec (0);
3495 /* First go through virtual base classes */
3496 for (vbases = CLASSTYPE_VBASECLASSES (type), i = 0;
3497 VEC_iterate (tree, vbases, i, binfo); i++)
3499 VEC(tree, gc) *vbase_bases = calculate_bases_helper (BINFO_TYPE (binfo));
3500 VEC_safe_splice (tree, gc, vector, vbase_bases);
3501 release_tree_vector (vbase_bases);
3504 /* Now for the non-virtual bases */
3505 nonvbases = calculate_bases_helper (type);
3506 VEC_safe_splice (tree, gc, vector, nonvbases);
3507 release_tree_vector (nonvbases);
3509 /* Last element is entire class, so don't copy */
3510 bases_vec = make_tree_vec (VEC_length (tree, vector) - 1);
3512 for (i = 0; i < VEC_length (tree, vector) - 1; ++i)
3514 TREE_VEC_ELT (bases_vec, i) = VEC_index (tree, vector, i);
3516 release_tree_vector (vector);
3521 finish_bases (tree type, bool direct)
3523 tree bases = NULL_TREE;
3525 if (!processing_template_decl)
3527 /* Parameter packs can only be used in templates */
3528 error ("Parameter pack __bases only valid in template declaration");
3529 return error_mark_node;
3532 bases = cxx_make_type (BASES);
3533 BASES_TYPE (bases) = type;
3534 BASES_DIRECT (bases) = direct;
3535 SET_TYPE_STRUCTURAL_EQUALITY (bases);
3540 /* Perform C++-specific checks for __builtin_offsetof before calling
3544 finish_offsetof (tree expr)
3546 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3548 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3549 TREE_OPERAND (expr, 2));
3550 return error_mark_node;
3552 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3553 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3554 || TREE_TYPE (expr) == unknown_type_node)
3556 if (TREE_CODE (expr) == COMPONENT_REF
3557 || TREE_CODE (expr) == COMPOUND_EXPR)
3558 expr = TREE_OPERAND (expr, 1);
3559 error ("cannot apply %<offsetof%> to member function %qD", expr);
3560 return error_mark_node;
3562 if (REFERENCE_REF_P (expr))
3563 expr = TREE_OPERAND (expr, 0);
3564 if (TREE_CODE (expr) == COMPONENT_REF)
3566 tree object = TREE_OPERAND (expr, 0);
3567 if (!complete_type_or_else (TREE_TYPE (object), object))
3568 return error_mark_node;
3570 return fold_offsetof (expr, NULL_TREE);
3573 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3574 function is broken out from the above for the benefit of the tree-ssa
3578 simplify_aggr_init_expr (tree *tp)
3580 tree aggr_init_expr = *tp;
3582 /* Form an appropriate CALL_EXPR. */
3583 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3584 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3585 tree type = TREE_TYPE (slot);
3588 enum style_t { ctor, arg, pcc } style;
3590 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3592 #ifdef PCC_STATIC_STRUCT_RETURN
3598 gcc_assert (TREE_ADDRESSABLE (type));
3602 call_expr = build_call_array_loc (input_location,
3603 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3605 aggr_init_expr_nargs (aggr_init_expr),
3606 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3607 TREE_NOTHROW (call_expr) = TREE_NOTHROW (aggr_init_expr);
3611 /* Replace the first argument to the ctor with the address of the
3613 cxx_mark_addressable (slot);
3614 CALL_EXPR_ARG (call_expr, 0) =
3615 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3617 else if (style == arg)
3619 /* Just mark it addressable here, and leave the rest to
3620 expand_call{,_inline}. */
3621 cxx_mark_addressable (slot);
3622 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3623 call_expr = build2 (INIT_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3625 else if (style == pcc)
3627 /* If we're using the non-reentrant PCC calling convention, then we
3628 need to copy the returned value out of the static buffer into the
3630 push_deferring_access_checks (dk_no_check);
3631 call_expr = build_aggr_init (slot, call_expr,
3632 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3633 tf_warning_or_error);
3634 pop_deferring_access_checks ();
3635 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3638 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3640 tree init = build_zero_init (type, NULL_TREE,
3641 /*static_storage_p=*/false);
3642 init = build2 (INIT_EXPR, void_type_node, slot, init);
3643 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3650 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3653 emit_associated_thunks (tree fn)
3655 /* When we use vcall offsets, we emit thunks with the virtual
3656 functions to which they thunk. The whole point of vcall offsets
3657 is so that you can know statically the entire set of thunks that
3658 will ever be needed for a given virtual function, thereby
3659 enabling you to output all the thunks with the function itself. */
3660 if (DECL_VIRTUAL_P (fn)
3661 /* Do not emit thunks for extern template instantiations. */
3662 && ! DECL_REALLY_EXTERN (fn))
3666 for (thunk = DECL_THUNKS (fn); thunk; thunk = DECL_CHAIN (thunk))
3668 if (!THUNK_ALIAS (thunk))
3670 use_thunk (thunk, /*emit_p=*/1);
3671 if (DECL_RESULT_THUNK_P (thunk))
3675 for (probe = DECL_THUNKS (thunk);
3676 probe; probe = DECL_CHAIN (probe))
3677 use_thunk (probe, /*emit_p=*/1);
3681 gcc_assert (!DECL_THUNKS (thunk));
3686 /* Returns true iff FUN is an instantiation of a constexpr function
3690 is_instantiation_of_constexpr (tree fun)
3692 return (DECL_TEMPLOID_INSTANTIATION (fun)
3693 && DECL_DECLARED_CONSTEXPR_P (DECL_TEMPLATE_RESULT
3694 (DECL_TI_TEMPLATE (fun))));
3697 /* Generate RTL for FN. */
3700 expand_or_defer_fn_1 (tree fn)
3702 /* When the parser calls us after finishing the body of a template
3703 function, we don't really want to expand the body. */
3704 if (processing_template_decl)
3706 /* Normally, collection only occurs in rest_of_compilation. So,
3707 if we don't collect here, we never collect junk generated
3708 during the processing of templates until we hit a
3709 non-template function. It's not safe to do this inside a
3710 nested class, though, as the parser may have local state that
3711 is not a GC root. */
3712 if (!function_depth)
3717 gcc_assert (DECL_SAVED_TREE (fn));
3719 /* If this is a constructor or destructor body, we have to clone
3721 if (maybe_clone_body (fn))
3723 /* We don't want to process FN again, so pretend we've written
3724 it out, even though we haven't. */
3725 TREE_ASM_WRITTEN (fn) = 1;
3726 /* If this is an instantiation of a constexpr function, keep
3727 DECL_SAVED_TREE for explain_invalid_constexpr_fn. */
3728 if (!is_instantiation_of_constexpr (fn))
3729 DECL_SAVED_TREE (fn) = NULL_TREE;
3733 /* We make a decision about linkage for these functions at the end
3734 of the compilation. Until that point, we do not want the back
3735 end to output them -- but we do want it to see the bodies of
3736 these functions so that it can inline them as appropriate. */
3737 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3739 if (DECL_INTERFACE_KNOWN (fn))
3740 /* We've already made a decision as to how this function will
3744 DECL_EXTERNAL (fn) = 1;
3745 DECL_NOT_REALLY_EXTERN (fn) = 1;
3746 note_vague_linkage_fn (fn);
3747 /* A non-template inline function with external linkage will
3748 always be COMDAT. As we must eventually determine the
3749 linkage of all functions, and as that causes writes to
3750 the data mapped in from the PCH file, it's advantageous
3751 to mark the functions at this point. */
3752 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3754 /* This function must have external linkage, as
3755 otherwise DECL_INTERFACE_KNOWN would have been
3757 gcc_assert (TREE_PUBLIC (fn));
3758 comdat_linkage (fn);
3759 DECL_INTERFACE_KNOWN (fn) = 1;
3763 import_export_decl (fn);
3765 /* If the user wants us to keep all inline functions, then mark
3766 this function as needed so that finish_file will make sure to
3767 output it later. Similarly, all dllexport'd functions must
3768 be emitted; there may be callers in other DLLs. */
3769 if ((flag_keep_inline_functions
3770 && DECL_DECLARED_INLINE_P (fn)
3771 && !DECL_REALLY_EXTERN (fn))
3772 || (flag_keep_inline_dllexport
3773 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn))))
3776 DECL_EXTERNAL (fn) = 0;
3780 /* There's no reason to do any of the work here if we're only doing
3781 semantic analysis; this code just generates RTL. */
3782 if (flag_syntax_only)
3789 expand_or_defer_fn (tree fn)
3791 if (expand_or_defer_fn_1 (fn))
3795 /* Expand or defer, at the whim of the compilation unit manager. */
3796 cgraph_finalize_function (fn, function_depth > 1);
3797 emit_associated_thunks (fn);
3810 /* Helper function for walk_tree, used by finalize_nrv below. */
3813 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3815 struct nrv_data *dp = (struct nrv_data *)data;
3818 /* No need to walk into types. There wouldn't be any need to walk into
3819 non-statements, except that we have to consider STMT_EXPRs. */
3822 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3823 but differs from using NULL_TREE in that it indicates that we care
3824 about the value of the RESULT_DECL. */
3825 else if (TREE_CODE (*tp) == RETURN_EXPR)
3826 TREE_OPERAND (*tp, 0) = dp->result;
3827 /* Change all cleanups for the NRV to only run when an exception is
3829 else if (TREE_CODE (*tp) == CLEANUP_STMT
3830 && CLEANUP_DECL (*tp) == dp->var)
3831 CLEANUP_EH_ONLY (*tp) = 1;
3832 /* Replace the DECL_EXPR for the NRV with an initialization of the
3833 RESULT_DECL, if needed. */
3834 else if (TREE_CODE (*tp) == DECL_EXPR
3835 && DECL_EXPR_DECL (*tp) == dp->var)
3838 if (DECL_INITIAL (dp->var)
3839 && DECL_INITIAL (dp->var) != error_mark_node)
3840 init = build2 (INIT_EXPR, void_type_node, dp->result,
3841 DECL_INITIAL (dp->var));
3843 init = build_empty_stmt (EXPR_LOCATION (*tp));
3844 DECL_INITIAL (dp->var) = NULL_TREE;
3845 SET_EXPR_LOCATION (init, EXPR_LOCATION (*tp));
3848 /* And replace all uses of the NRV with the RESULT_DECL. */
3849 else if (*tp == dp->var)
3852 /* Avoid walking into the same tree more than once. Unfortunately, we
3853 can't just use walk_tree_without duplicates because it would only call
3854 us for the first occurrence of dp->var in the function body. */
3855 slot = htab_find_slot (dp->visited, *tp, INSERT);
3861 /* Keep iterating. */
3865 /* Called from finish_function to implement the named return value
3866 optimization by overriding all the RETURN_EXPRs and pertinent
3867 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3868 RESULT_DECL for the function. */
3871 finalize_nrv (tree *tp, tree var, tree result)
3873 struct nrv_data data;
3875 /* Copy name from VAR to RESULT. */
3876 DECL_NAME (result) = DECL_NAME (var);
3877 /* Don't forget that we take its address. */
3878 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3879 /* Finally set DECL_VALUE_EXPR to avoid assigning
3880 a stack slot at -O0 for the original var and debug info
3881 uses RESULT location for VAR. */
3882 SET_DECL_VALUE_EXPR (var, result);
3883 DECL_HAS_VALUE_EXPR_P (var) = 1;
3886 data.result = result;
3887 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3888 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3889 htab_delete (data.visited);
3892 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3895 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3896 bool need_copy_ctor, bool need_copy_assignment)
3898 int save_errorcount = errorcount;
3901 /* Always allocate 3 elements for simplicity. These are the
3902 function decls for the ctor, dtor, and assignment op.
3903 This layout is known to the three lang hooks,
3904 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3905 and cxx_omp_clause_assign_op. */
3906 info = make_tree_vec (3);
3907 CP_OMP_CLAUSE_INFO (c) = info;
3909 if (need_default_ctor || need_copy_ctor)
3911 if (need_default_ctor)
3912 t = get_default_ctor (type);
3914 t = get_copy_ctor (type, tf_warning_or_error);
3916 if (t && !trivial_fn_p (t))
3917 TREE_VEC_ELT (info, 0) = t;
3920 if ((need_default_ctor || need_copy_ctor)
3921 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3922 TREE_VEC_ELT (info, 1) = get_dtor (type, tf_warning_or_error);
3924 if (need_copy_assignment)
3926 t = get_copy_assign (type);
3928 if (t && !trivial_fn_p (t))
3929 TREE_VEC_ELT (info, 2) = t;
3932 return errorcount != save_errorcount;
3935 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3936 Remove any elements from the list that are invalid. */
3939 finish_omp_clauses (tree clauses)
3941 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3942 tree c, t, *pc = &clauses;
3945 bitmap_obstack_initialize (NULL);
3946 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3947 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3948 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3950 for (pc = &clauses, c = clauses; c ; c = *pc)
3952 bool remove = false;
3954 switch (OMP_CLAUSE_CODE (c))
3956 case OMP_CLAUSE_SHARED:
3958 goto check_dup_generic;
3959 case OMP_CLAUSE_PRIVATE:
3961 goto check_dup_generic;
3962 case OMP_CLAUSE_REDUCTION:
3964 goto check_dup_generic;
3965 case OMP_CLAUSE_COPYPRIVATE:
3966 name = "copyprivate";
3967 goto check_dup_generic;
3968 case OMP_CLAUSE_COPYIN:
3970 goto check_dup_generic;
3972 t = OMP_CLAUSE_DECL (c);
3973 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3975 if (processing_template_decl)
3978 error ("%qD is not a variable in clause %qs", t, name);
3980 error ("%qE is not a variable in clause %qs", t, name);
3983 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3984 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3985 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3987 error ("%qD appears more than once in data clauses", t);
3991 bitmap_set_bit (&generic_head, DECL_UID (t));
3994 case OMP_CLAUSE_FIRSTPRIVATE:
3995 t = OMP_CLAUSE_DECL (c);
3996 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3998 if (processing_template_decl)
4001 error ("%qD is not a variable in clause %<firstprivate%>", t);
4003 error ("%qE is not a variable in clause %<firstprivate%>", t);
4006 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
4007 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
4009 error ("%qD appears more than once in data clauses", t);
4013 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
4016 case OMP_CLAUSE_LASTPRIVATE:
4017 t = OMP_CLAUSE_DECL (c);
4018 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
4020 if (processing_template_decl)
4023 error ("%qD is not a variable in clause %<lastprivate%>", t);
4025 error ("%qE is not a variable in clause %<lastprivate%>", t);
4028 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
4029 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
4031 error ("%qD appears more than once in data clauses", t);
4035 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
4039 t = OMP_CLAUSE_IF_EXPR (c);
4040 t = maybe_convert_cond (t);
4041 if (t == error_mark_node)
4043 OMP_CLAUSE_IF_EXPR (c) = t;
4046 case OMP_CLAUSE_FINAL:
4047 t = OMP_CLAUSE_FINAL_EXPR (c);
4048 t = maybe_convert_cond (t);
4049 if (t == error_mark_node)
4051 OMP_CLAUSE_FINAL_EXPR (c) = t;
4054 case OMP_CLAUSE_NUM_THREADS:
4055 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
4056 if (t == error_mark_node)
4058 else if (!type_dependent_expression_p (t)
4059 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
4061 error ("num_threads expression must be integral");
4066 case OMP_CLAUSE_SCHEDULE:
4067 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
4070 else if (t == error_mark_node)
4072 else if (!type_dependent_expression_p (t)
4073 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
4075 error ("schedule chunk size expression must be integral");
4080 case OMP_CLAUSE_NOWAIT:
4081 case OMP_CLAUSE_ORDERED:
4082 case OMP_CLAUSE_DEFAULT:
4083 case OMP_CLAUSE_UNTIED:
4084 case OMP_CLAUSE_COLLAPSE:
4085 case OMP_CLAUSE_MERGEABLE:
4093 *pc = OMP_CLAUSE_CHAIN (c);
4095 pc = &OMP_CLAUSE_CHAIN (c);
4098 for (pc = &clauses, c = clauses; c ; c = *pc)
4100 enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c);
4101 bool remove = false;
4102 bool need_complete_non_reference = false;
4103 bool need_default_ctor = false;
4104 bool need_copy_ctor = false;
4105 bool need_copy_assignment = false;
4106 bool need_implicitly_determined = false;
4107 tree type, inner_type;
4111 case OMP_CLAUSE_SHARED:
4113 need_implicitly_determined = true;
4115 case OMP_CLAUSE_PRIVATE:
4117 need_complete_non_reference = true;
4118 need_default_ctor = true;
4119 need_implicitly_determined = true;
4121 case OMP_CLAUSE_FIRSTPRIVATE:
4122 name = "firstprivate";
4123 need_complete_non_reference = true;
4124 need_copy_ctor = true;
4125 need_implicitly_determined = true;
4127 case OMP_CLAUSE_LASTPRIVATE:
4128 name = "lastprivate";
4129 need_complete_non_reference = true;
4130 need_copy_assignment = true;
4131 need_implicitly_determined = true;
4133 case OMP_CLAUSE_REDUCTION:
4135 need_implicitly_determined = true;
4137 case OMP_CLAUSE_COPYPRIVATE:
4138 name = "copyprivate";
4139 need_copy_assignment = true;
4141 case OMP_CLAUSE_COPYIN:
4143 need_copy_assignment = true;
4146 pc = &OMP_CLAUSE_CHAIN (c);
4150 t = OMP_CLAUSE_DECL (c);
4151 if (processing_template_decl
4152 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
4154 pc = &OMP_CLAUSE_CHAIN (c);
4160 case OMP_CLAUSE_LASTPRIVATE:
4161 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
4162 need_default_ctor = true;
4165 case OMP_CLAUSE_REDUCTION:
4166 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
4167 || POINTER_TYPE_P (TREE_TYPE (t)))
4169 error ("%qE has invalid type for %<reduction%>", t);
4172 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
4174 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
4184 error ("%qE has invalid type for %<reduction(%s)%>",
4185 t, operator_name_info[r_code].name);
4191 case OMP_CLAUSE_COPYIN:
4192 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
4194 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
4203 if (need_complete_non_reference || need_copy_assignment)
4205 t = require_complete_type (t);
4206 if (t == error_mark_node)
4208 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE
4209 && need_complete_non_reference)
4211 error ("%qE has reference type for %qs", t, name);
4215 if (need_implicitly_determined)
4217 const char *share_name = NULL;
4219 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
4220 share_name = "threadprivate";
4221 else switch (cxx_omp_predetermined_sharing (t))
4223 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
4225 case OMP_CLAUSE_DEFAULT_SHARED:
4226 /* const vars may be specified in firstprivate clause. */
4227 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_FIRSTPRIVATE
4228 && cxx_omp_const_qual_no_mutable (t))
4230 share_name = "shared";
4232 case OMP_CLAUSE_DEFAULT_PRIVATE:
4233 share_name = "private";
4240 error ("%qE is predetermined %qs for %qs",
4241 t, share_name, name);
4246 /* We're interested in the base element, not arrays. */
4247 inner_type = type = TREE_TYPE (t);
4248 while (TREE_CODE (inner_type) == ARRAY_TYPE)
4249 inner_type = TREE_TYPE (inner_type);
4251 /* Check for special function availability by building a call to one.
4252 Save the results, because later we won't be in the right context
4253 for making these queries. */
4254 if (CLASS_TYPE_P (inner_type)
4255 && COMPLETE_TYPE_P (inner_type)
4256 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
4257 && !type_dependent_expression_p (t)
4258 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
4259 need_copy_ctor, need_copy_assignment))
4263 *pc = OMP_CLAUSE_CHAIN (c);
4265 pc = &OMP_CLAUSE_CHAIN (c);
4268 bitmap_obstack_release (NULL);
4272 /* For all variables in the tree_list VARS, mark them as thread local. */
4275 finish_omp_threadprivate (tree vars)
4279 /* Mark every variable in VARS to be assigned thread local storage. */
4280 for (t = vars; t; t = TREE_CHAIN (t))
4282 tree v = TREE_PURPOSE (t);
4284 if (error_operand_p (v))
4286 else if (TREE_CODE (v) != VAR_DECL)
4287 error ("%<threadprivate%> %qD is not file, namespace "
4288 "or block scope variable", v);
4289 /* If V had already been marked threadprivate, it doesn't matter
4290 whether it had been used prior to this point. */
4291 else if (TREE_USED (v)
4292 && (DECL_LANG_SPECIFIC (v) == NULL
4293 || !CP_DECL_THREADPRIVATE_P (v)))
4294 error ("%qE declared %<threadprivate%> after first use", v);
4295 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
4296 error ("automatic variable %qE cannot be %<threadprivate%>", v);
4297 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
4298 error ("%<threadprivate%> %qE has incomplete type", v);
4299 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
4300 && CP_DECL_CONTEXT (v) != current_class_type)
4301 error ("%<threadprivate%> %qE directive not "
4302 "in %qT definition", v, CP_DECL_CONTEXT (v));
4305 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4306 if (DECL_LANG_SPECIFIC (v) == NULL)
4308 retrofit_lang_decl (v);
4310 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4311 after the allocation of the lang_decl structure. */
4312 if (DECL_DISCRIMINATOR_P (v))
4313 DECL_LANG_SPECIFIC (v)->u.base.u2sel = 1;
4316 if (! DECL_THREAD_LOCAL_P (v))
4318 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
4319 /* If rtl has been already set for this var, call
4320 make_decl_rtl once again, so that encode_section_info
4321 has a chance to look at the new decl flags. */
4322 if (DECL_RTL_SET_P (v))
4325 CP_DECL_THREADPRIVATE_P (v) = 1;
4330 /* Build an OpenMP structured block. */
4333 begin_omp_structured_block (void)
4335 return do_pushlevel (sk_omp);
4339 finish_omp_structured_block (tree block)
4341 return do_poplevel (block);
4344 /* Similarly, except force the retention of the BLOCK. */
4347 begin_omp_parallel (void)
4349 keep_next_level (true);
4350 return begin_omp_structured_block ();
4354 finish_omp_parallel (tree clauses, tree body)
4358 body = finish_omp_structured_block (body);
4360 stmt = make_node (OMP_PARALLEL);
4361 TREE_TYPE (stmt) = void_type_node;
4362 OMP_PARALLEL_CLAUSES (stmt) = clauses;
4363 OMP_PARALLEL_BODY (stmt) = body;
4365 return add_stmt (stmt);
4369 begin_omp_task (void)
4371 keep_next_level (true);
4372 return begin_omp_structured_block ();
4376 finish_omp_task (tree clauses, tree body)
4380 body = finish_omp_structured_block (body);
4382 stmt = make_node (OMP_TASK);
4383 TREE_TYPE (stmt) = void_type_node;
4384 OMP_TASK_CLAUSES (stmt) = clauses;
4385 OMP_TASK_BODY (stmt) = body;
4387 return add_stmt (stmt);
4390 /* Helper function for finish_omp_for. Convert Ith random access iterator
4391 into integral iterator. Return FALSE if successful. */
4394 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
4395 tree condv, tree incrv, tree *body,
4396 tree *pre_body, tree clauses)
4398 tree diff, iter_init, iter_incr = NULL, last;
4399 tree incr_var = NULL, orig_pre_body, orig_body, c;
4400 tree decl = TREE_VEC_ELT (declv, i);
4401 tree init = TREE_VEC_ELT (initv, i);
4402 tree cond = TREE_VEC_ELT (condv, i);
4403 tree incr = TREE_VEC_ELT (incrv, i);
4405 location_t elocus = locus;
4407 if (init && EXPR_HAS_LOCATION (init))
4408 elocus = EXPR_LOCATION (init);
4410 switch (TREE_CODE (cond))
4416 if (TREE_OPERAND (cond, 1) == iter)
4417 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
4418 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
4419 if (TREE_OPERAND (cond, 0) != iter)
4420 cond = error_mark_node;
4423 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
4424 TREE_OPERAND (cond, 1), ERROR_MARK,
4425 NULL, tf_warning_or_error);
4426 if (error_operand_p (tem))
4431 cond = error_mark_node;
4434 if (cond == error_mark_node)
4436 error_at (elocus, "invalid controlling predicate");
4439 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
4440 ERROR_MARK, iter, ERROR_MARK, NULL,
4441 tf_warning_or_error);
4442 if (error_operand_p (diff))
4444 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
4446 error_at (elocus, "difference between %qE and %qD does not have integer type",
4447 TREE_OPERAND (cond, 1), iter);
4451 switch (TREE_CODE (incr))
4453 case PREINCREMENT_EXPR:
4454 case PREDECREMENT_EXPR:
4455 case POSTINCREMENT_EXPR:
4456 case POSTDECREMENT_EXPR:
4457 if (TREE_OPERAND (incr, 0) != iter)
4459 incr = error_mark_node;
4462 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
4463 tf_warning_or_error);
4464 if (error_operand_p (iter_incr))
4466 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
4467 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4468 incr = integer_one_node;
4470 incr = integer_minus_one_node;
4473 if (TREE_OPERAND (incr, 0) != iter)
4474 incr = error_mark_node;
4475 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4476 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4478 tree rhs = TREE_OPERAND (incr, 1);
4479 if (TREE_OPERAND (rhs, 0) == iter)
4481 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4483 incr = error_mark_node;
4486 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4487 TREE_OPERAND (rhs, 1),
4488 tf_warning_or_error);
4489 if (error_operand_p (iter_incr))
4491 incr = TREE_OPERAND (rhs, 1);
4492 incr = cp_convert (TREE_TYPE (diff), incr);
4493 if (TREE_CODE (rhs) == MINUS_EXPR)
4495 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4496 incr = fold_if_not_in_template (incr);
4498 if (TREE_CODE (incr) != INTEGER_CST
4499 && (TREE_CODE (incr) != NOP_EXPR
4500 || (TREE_CODE (TREE_OPERAND (incr, 0))
4505 else if (TREE_OPERAND (rhs, 1) == iter)
4507 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4508 || TREE_CODE (rhs) != PLUS_EXPR)
4509 incr = error_mark_node;
4512 iter_incr = build_x_binary_op (PLUS_EXPR,
4513 TREE_OPERAND (rhs, 0),
4516 tf_warning_or_error);
4517 if (error_operand_p (iter_incr))
4519 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4521 tf_warning_or_error);
4522 if (error_operand_p (iter_incr))
4524 incr = TREE_OPERAND (rhs, 0);
4529 incr = error_mark_node;
4532 incr = error_mark_node;
4535 incr = error_mark_node;
4539 if (incr == error_mark_node)
4541 error_at (elocus, "invalid increment expression");
4545 incr = cp_convert (TREE_TYPE (diff), incr);
4546 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4547 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4548 && OMP_CLAUSE_DECL (c) == iter)
4551 decl = create_temporary_var (TREE_TYPE (diff));
4553 add_decl_expr (decl);
4554 last = create_temporary_var (TREE_TYPE (diff));
4556 add_decl_expr (last);
4557 if (c && iter_incr == NULL)
4559 incr_var = create_temporary_var (TREE_TYPE (diff));
4560 pushdecl (incr_var);
4561 add_decl_expr (incr_var);
4563 gcc_assert (stmts_are_full_exprs_p ());
4565 orig_pre_body = *pre_body;
4566 *pre_body = push_stmt_list ();
4568 add_stmt (orig_pre_body);
4570 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4571 tf_warning_or_error));
4572 init = build_int_cst (TREE_TYPE (diff), 0);
4573 if (c && iter_incr == NULL)
4575 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4576 incr, tf_warning_or_error));
4578 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4579 tf_warning_or_error);
4581 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4582 tf_warning_or_error));
4583 *pre_body = pop_stmt_list (*pre_body);
4585 cond = cp_build_binary_op (elocus,
4586 TREE_CODE (cond), decl, diff,
4587 tf_warning_or_error);
4588 incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR,
4589 elocus, incr, NULL_TREE);
4592 *body = push_stmt_list ();
4593 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4594 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4595 tf_warning_or_error);
4596 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4597 finish_expr_stmt (iter_init);
4598 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4599 tf_warning_or_error));
4600 add_stmt (orig_body);
4601 *body = pop_stmt_list (*body);
4605 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4606 finish_expr_stmt (iter_incr);
4607 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4608 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4611 TREE_VEC_ELT (declv, i) = decl;
4612 TREE_VEC_ELT (initv, i) = init;
4613 TREE_VEC_ELT (condv, i) = cond;
4614 TREE_VEC_ELT (incrv, i) = incr;
4619 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4620 are directly for their associated operands in the statement. DECL
4621 and INIT are a combo; if DECL is NULL then INIT ought to be a
4622 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4623 optional statements that need to go before the loop into its
4627 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4628 tree incrv, tree body, tree pre_body, tree clauses)
4630 tree omp_for = NULL, orig_incr = NULL;
4631 tree decl, init, cond, incr;
4635 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4636 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4637 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4638 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4640 decl = TREE_VEC_ELT (declv, i);
4641 init = TREE_VEC_ELT (initv, i);
4642 cond = TREE_VEC_ELT (condv, i);
4643 incr = TREE_VEC_ELT (incrv, i);
4649 switch (TREE_CODE (init))
4652 decl = TREE_OPERAND (init, 0);
4653 init = TREE_OPERAND (init, 1);
4656 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4658 decl = TREE_OPERAND (init, 0);
4659 init = TREE_OPERAND (init, 2);
4669 "expected iteration declaration or initialization");
4674 if (init && EXPR_HAS_LOCATION (init))
4675 elocus = EXPR_LOCATION (init);
4679 error_at (elocus, "missing controlling predicate");
4685 error_at (elocus, "missing increment expression");
4689 TREE_VEC_ELT (declv, i) = decl;
4690 TREE_VEC_ELT (initv, i) = init;
4693 if (dependent_omp_for_p (declv, initv, condv, incrv))
4697 stmt = make_node (OMP_FOR);
4699 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4701 /* This is really just a place-holder. We'll be decomposing this
4702 again and going through the cp_build_modify_expr path below when
4703 we instantiate the thing. */
4704 TREE_VEC_ELT (initv, i)
4705 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4706 TREE_VEC_ELT (initv, i));
4709 TREE_TYPE (stmt) = void_type_node;
4710 OMP_FOR_INIT (stmt) = initv;
4711 OMP_FOR_COND (stmt) = condv;
4712 OMP_FOR_INCR (stmt) = incrv;
4713 OMP_FOR_BODY (stmt) = body;
4714 OMP_FOR_PRE_BODY (stmt) = pre_body;
4715 OMP_FOR_CLAUSES (stmt) = clauses;
4717 SET_EXPR_LOCATION (stmt, locus);
4718 return add_stmt (stmt);
4721 if (processing_template_decl)
4722 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4724 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4726 decl = TREE_VEC_ELT (declv, i);
4727 init = TREE_VEC_ELT (initv, i);
4728 cond = TREE_VEC_ELT (condv, i);
4729 incr = TREE_VEC_ELT (incrv, i);
4731 TREE_VEC_ELT (orig_incr, i) = incr;
4734 if (init && EXPR_HAS_LOCATION (init))
4735 elocus = EXPR_LOCATION (init);
4739 error_at (elocus, "expected iteration declaration or initialization");
4743 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4746 TREE_VEC_ELT (orig_incr, i) = incr;
4747 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4748 TREE_CODE (TREE_OPERAND (incr, 1)),
4749 TREE_OPERAND (incr, 2),
4750 tf_warning_or_error);
4753 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4755 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4756 incrv, &body, &pre_body, clauses))
4761 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4762 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4764 error_at (elocus, "invalid type for iteration variable %qE", decl);
4768 if (!processing_template_decl)
4770 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4771 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4774 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4776 && TREE_SIDE_EFFECTS (cond)
4777 && COMPARISON_CLASS_P (cond)
4778 && !processing_template_decl)
4780 tree t = TREE_OPERAND (cond, 0);
4781 if (TREE_SIDE_EFFECTS (t)
4783 && (TREE_CODE (t) != NOP_EXPR
4784 || TREE_OPERAND (t, 0) != decl))
4785 TREE_OPERAND (cond, 0)
4786 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4788 t = TREE_OPERAND (cond, 1);
4789 if (TREE_SIDE_EFFECTS (t)
4791 && (TREE_CODE (t) != NOP_EXPR
4792 || TREE_OPERAND (t, 0) != decl))
4793 TREE_OPERAND (cond, 1)
4794 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4796 if (decl == error_mark_node || init == error_mark_node)
4799 TREE_VEC_ELT (declv, i) = decl;
4800 TREE_VEC_ELT (initv, i) = init;
4801 TREE_VEC_ELT (condv, i) = cond;
4802 TREE_VEC_ELT (incrv, i) = incr;
4806 if (IS_EMPTY_STMT (pre_body))
4809 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4812 if (omp_for == NULL)
4815 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4817 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4818 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4820 if (TREE_CODE (incr) != MODIFY_EXPR)
4823 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4824 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4825 && !processing_template_decl)
4827 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4828 if (TREE_SIDE_EFFECTS (t)
4830 && (TREE_CODE (t) != NOP_EXPR
4831 || TREE_OPERAND (t, 0) != decl))
4832 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4833 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4835 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4836 if (TREE_SIDE_EFFECTS (t)
4838 && (TREE_CODE (t) != NOP_EXPR
4839 || TREE_OPERAND (t, 0) != decl))
4840 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4841 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4845 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4847 if (omp_for != NULL)
4848 OMP_FOR_CLAUSES (omp_for) = clauses;
4853 finish_omp_atomic (enum tree_code code, enum tree_code opcode, tree lhs,
4854 tree rhs, tree v, tree lhs1, tree rhs1)
4869 dependent_p = false;
4872 /* Even in a template, we can detect invalid uses of the atomic
4873 pragma if neither LHS nor RHS is type-dependent. */
4874 if (processing_template_decl)
4876 dependent_p = (type_dependent_expression_p (lhs)
4877 || (rhs && type_dependent_expression_p (rhs))
4878 || (v && type_dependent_expression_p (v))
4879 || (lhs1 && type_dependent_expression_p (lhs1))
4880 || (rhs1 && type_dependent_expression_p (rhs1)));
4883 lhs = build_non_dependent_expr (lhs);
4885 rhs = build_non_dependent_expr (rhs);
4887 v = build_non_dependent_expr (v);
4889 lhs1 = build_non_dependent_expr (lhs1);
4891 rhs1 = build_non_dependent_expr (rhs1);
4896 stmt = c_finish_omp_atomic (input_location, code, opcode, lhs, rhs,
4898 if (stmt == error_mark_node)
4901 if (processing_template_decl)
4903 if (code == OMP_ATOMIC_READ)
4905 stmt = build_min_nt (OMP_ATOMIC_READ, orig_lhs);
4906 stmt = build2 (MODIFY_EXPR, void_type_node, orig_v, stmt);
4910 if (opcode == NOP_EXPR)
4911 stmt = build2 (MODIFY_EXPR, void_type_node, orig_lhs, orig_rhs);
4913 stmt = build2 (opcode, void_type_node, orig_lhs, orig_rhs);
4915 stmt = build_min_nt (COMPOUND_EXPR, orig_rhs1, stmt);
4916 if (code != OMP_ATOMIC)
4918 stmt = build_min_nt (code, orig_lhs1, stmt);
4919 stmt = build2 (MODIFY_EXPR, void_type_node, orig_v, stmt);
4922 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node, stmt);
4928 finish_omp_barrier (void)
4930 tree fn = builtin_decl_explicit (BUILT_IN_GOMP_BARRIER);
4931 VEC(tree,gc) *vec = make_tree_vector ();
4932 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4933 release_tree_vector (vec);
4934 finish_expr_stmt (stmt);
4938 finish_omp_flush (void)
4940 tree fn = builtin_decl_explicit (BUILT_IN_SYNC_SYNCHRONIZE);
4941 VEC(tree,gc) *vec = make_tree_vector ();
4942 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4943 release_tree_vector (vec);
4944 finish_expr_stmt (stmt);
4948 finish_omp_taskwait (void)
4950 tree fn = builtin_decl_explicit (BUILT_IN_GOMP_TASKWAIT);
4951 VEC(tree,gc) *vec = make_tree_vector ();
4952 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4953 release_tree_vector (vec);
4954 finish_expr_stmt (stmt);
4958 finish_omp_taskyield (void)
4960 tree fn = builtin_decl_explicit (BUILT_IN_GOMP_TASKYIELD);
4961 VEC(tree,gc) *vec = make_tree_vector ();
4962 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4963 release_tree_vector (vec);
4964 finish_expr_stmt (stmt);
4968 init_cp_semantics (void)
4972 /* Build a STATIC_ASSERT for a static assertion with the condition
4973 CONDITION and the message text MESSAGE. LOCATION is the location
4974 of the static assertion in the source code. When MEMBER_P, this
4975 static assertion is a member of a class. */
4977 finish_static_assert (tree condition, tree message, location_t location,
4980 if (check_for_bare_parameter_packs (condition))
4981 condition = error_mark_node;
4983 if (type_dependent_expression_p (condition)
4984 || value_dependent_expression_p (condition))
4986 /* We're in a template; build a STATIC_ASSERT and put it in
4990 assertion = make_node (STATIC_ASSERT);
4991 STATIC_ASSERT_CONDITION (assertion) = condition;
4992 STATIC_ASSERT_MESSAGE (assertion) = message;
4993 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4996 maybe_add_class_template_decl_list (current_class_type,
5000 add_stmt (assertion);
5005 /* Fold the expression and convert it to a boolean value. */
5006 condition = fold_non_dependent_expr (condition);
5007 condition = cp_convert (boolean_type_node, condition);
5008 condition = maybe_constant_value (condition);
5010 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
5011 /* Do nothing; the condition is satisfied. */
5015 location_t saved_loc = input_location;
5017 input_location = location;
5018 if (TREE_CODE (condition) == INTEGER_CST
5019 && integer_zerop (condition))
5020 /* Report the error. */
5021 error ("static assertion failed: %E", message);
5022 else if (condition && condition != error_mark_node)
5024 error ("non-constant condition for static assertion");
5025 cxx_constant_value (condition);
5027 input_location = saved_loc;
5031 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
5032 suitable for use as a type-specifier.
5034 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
5035 id-expression or a class member access, FALSE when it was parsed as
5036 a full expression. */
5039 finish_decltype_type (tree expr, bool id_expression_or_member_access_p,
5040 tsubst_flags_t complain)
5042 tree type = NULL_TREE;
5044 if (!expr || error_operand_p (expr))
5045 return error_mark_node;
5048 || TREE_CODE (expr) == TYPE_DECL
5049 || (TREE_CODE (expr) == BIT_NOT_EXPR
5050 && TYPE_P (TREE_OPERAND (expr, 0))))
5052 if (complain & tf_error)
5053 error ("argument to decltype must be an expression");
5054 return error_mark_node;
5057 /* FIXME instantiation-dependent */
5058 if (type_dependent_expression_p (expr)
5059 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
5060 if it isn't dependent, so that we can check access control at
5061 instantiation time, so defer the decltype as well (PR 42277). */
5062 || (id_expression_or_member_access_p
5063 && processing_template_decl
5064 && TREE_CODE (expr) == COMPONENT_REF))
5066 type = cxx_make_type (DECLTYPE_TYPE);
5067 DECLTYPE_TYPE_EXPR (type) = expr;
5068 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
5069 = id_expression_or_member_access_p;
5070 SET_TYPE_STRUCTURAL_EQUALITY (type);
5075 /* The type denoted by decltype(e) is defined as follows: */
5077 expr = resolve_nondeduced_context (expr);
5079 if (type_unknown_p (expr))
5081 if (complain & tf_error)
5082 error ("decltype cannot resolve address of overloaded function");
5083 return error_mark_node;
5086 if (invalid_nonstatic_memfn_p (expr, complain))
5087 return error_mark_node;
5089 /* To get the size of a static data member declared as an array of
5090 unknown bound, we need to instantiate it. */
5091 if (TREE_CODE (expr) == VAR_DECL
5092 && VAR_HAD_UNKNOWN_BOUND (expr)
5093 && DECL_TEMPLATE_INSTANTIATION (expr))
5094 instantiate_decl (expr, /*defer_ok*/true, /*expl_inst_mem*/false);
5096 if (id_expression_or_member_access_p)
5098 /* If e is an id-expression or a class member access (5.2.5
5099 [expr.ref]), decltype(e) is defined as the type of the entity
5100 named by e. If there is no such entity, or e names a set of
5101 overloaded functions, the program is ill-formed. */
5102 if (TREE_CODE (expr) == IDENTIFIER_NODE)
5103 expr = lookup_name (expr);
5105 if (TREE_CODE (expr) == INDIRECT_REF)
5106 /* This can happen when the expression is, e.g., "a.b". Just
5107 look at the underlying operand. */
5108 expr = TREE_OPERAND (expr, 0);
5110 if (TREE_CODE (expr) == OFFSET_REF
5111 || TREE_CODE (expr) == MEMBER_REF)
5112 /* We're only interested in the field itself. If it is a
5113 BASELINK, we will need to see through it in the next
5115 expr = TREE_OPERAND (expr, 1);
5117 if (TREE_CODE (expr) == BASELINK)
5118 /* See through BASELINK nodes to the underlying function. */
5119 expr = BASELINK_FUNCTIONS (expr);
5121 switch (TREE_CODE (expr))
5124 if (DECL_BIT_FIELD_TYPE (expr))
5126 type = DECL_BIT_FIELD_TYPE (expr);
5129 /* Fall through for fields that aren't bitfields. */
5136 case TEMPLATE_PARM_INDEX:
5137 expr = mark_type_use (expr);
5138 type = TREE_TYPE (expr);
5142 type = error_mark_node;
5146 mark_type_use (expr);
5147 type = is_bitfield_expr_with_lowered_type (expr);
5149 type = TREE_TYPE (TREE_OPERAND (expr, 1));
5156 /* We can get here when the id-expression refers to an
5158 type = TREE_TYPE (expr);
5163 return error_mark_node;
5168 /* Within a lambda-expression:
5170 Every occurrence of decltype((x)) where x is a possibly
5171 parenthesized id-expression that names an entity of
5172 automatic storage duration is treated as if x were
5173 transformed into an access to a corresponding data member
5174 of the closure type that would have been declared if x
5175 were a use of the denoted entity. */
5176 if (outer_automatic_var_p (expr)
5177 && current_function_decl
5178 && LAMBDA_FUNCTION_P (current_function_decl))
5179 type = capture_decltype (expr);
5180 else if (error_operand_p (expr))
5181 type = error_mark_node;
5182 else if (expr == current_class_ptr)
5183 /* If the expression is just "this", we want the
5184 cv-unqualified pointer for the "this" type. */
5185 type = TYPE_MAIN_VARIANT (TREE_TYPE (expr));
5188 /* Otherwise, where T is the type of e, if e is an lvalue,
5189 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
5190 cp_lvalue_kind clk = lvalue_kind (expr);
5191 type = unlowered_expr_type (expr);
5192 gcc_assert (TREE_CODE (type) != REFERENCE_TYPE);
5193 if (clk != clk_none && !(clk & clk_class))
5194 type = cp_build_reference_type (type, (clk & clk_rvalueref));
5201 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
5202 __has_nothrow_copy, depending on assign_p. */
5205 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
5212 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
5215 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
5217 else if (TYPE_HAS_COPY_CTOR (type))
5219 /* If construction of the copy constructor was postponed, create
5221 if (CLASSTYPE_LAZY_COPY_CTOR (type))
5222 lazily_declare_fn (sfk_copy_constructor, type);
5223 if (CLASSTYPE_LAZY_MOVE_CTOR (type))
5224 lazily_declare_fn (sfk_move_constructor, type);
5225 fns = CLASSTYPE_CONSTRUCTORS (type);
5230 for (; fns; fns = OVL_NEXT (fns))
5232 tree fn = OVL_CURRENT (fns);
5236 if (copy_fn_p (fn) == 0)
5239 else if (copy_fn_p (fn) <= 0)
5242 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
5249 /* Actually evaluates the trait. */
5252 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
5254 enum tree_code type_code1;
5257 type_code1 = TREE_CODE (type1);
5261 case CPTK_HAS_NOTHROW_ASSIGN:
5262 type1 = strip_array_types (type1);
5263 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5264 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
5265 || (CLASS_TYPE_P (type1)
5266 && classtype_has_nothrow_assign_or_copy_p (type1,
5269 case CPTK_HAS_TRIVIAL_ASSIGN:
5270 /* ??? The standard seems to be missing the "or array of such a class
5271 type" wording for this trait. */
5272 type1 = strip_array_types (type1);
5273 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5274 && (trivial_type_p (type1)
5275 || (CLASS_TYPE_P (type1)
5276 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1))));
5278 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5279 type1 = strip_array_types (type1);
5280 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
5281 || (CLASS_TYPE_P (type1)
5282 && (t = locate_ctor (type1))
5283 && TYPE_NOTHROW_P (TREE_TYPE (t))));
5285 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5286 type1 = strip_array_types (type1);
5287 return (trivial_type_p (type1)
5288 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
5290 case CPTK_HAS_NOTHROW_COPY:
5291 type1 = strip_array_types (type1);
5292 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
5293 || (CLASS_TYPE_P (type1)
5294 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
5296 case CPTK_HAS_TRIVIAL_COPY:
5297 /* ??? The standard seems to be missing the "or array of such a class
5298 type" wording for this trait. */
5299 type1 = strip_array_types (type1);
5300 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5301 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1)));
5303 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5304 type1 = strip_array_types (type1);
5305 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5306 || (CLASS_TYPE_P (type1)
5307 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
5309 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5310 return type_has_virtual_destructor (type1);
5312 case CPTK_IS_ABSTRACT:
5313 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
5315 case CPTK_IS_BASE_OF:
5316 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5317 && DERIVED_FROM_P (type1, type2));
5320 return (NON_UNION_CLASS_TYPE_P (type1));
5322 case CPTK_IS_CONVERTIBLE_TO:
5327 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
5330 return (type_code1 == ENUMERAL_TYPE);
5332 case CPTK_IS_LITERAL_TYPE:
5333 return (literal_type_p (type1));
5336 return (pod_type_p (type1));
5338 case CPTK_IS_POLYMORPHIC:
5339 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
5341 case CPTK_IS_STD_LAYOUT:
5342 return (std_layout_type_p (type1));
5344 case CPTK_IS_TRIVIAL:
5345 return (trivial_type_p (type1));
5348 return (type_code1 == UNION_TYPE);
5356 /* If TYPE is an array of unknown bound, or (possibly cv-qualified)
5357 void, or a complete type, returns it, otherwise NULL_TREE. */
5360 check_trait_type (tree type)
5362 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type)
5363 && COMPLETE_TYPE_P (TREE_TYPE (type)))
5366 if (VOID_TYPE_P (type))
5369 return complete_type_or_else (strip_array_types (type), NULL_TREE);
5372 /* Process a trait expression. */
5375 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
5377 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
5378 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
5379 || kind == CPTK_HAS_NOTHROW_COPY
5380 || kind == CPTK_HAS_TRIVIAL_ASSIGN
5381 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
5382 || kind == CPTK_HAS_TRIVIAL_COPY
5383 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
5384 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
5385 || kind == CPTK_IS_ABSTRACT
5386 || kind == CPTK_IS_BASE_OF
5387 || kind == CPTK_IS_CLASS
5388 || kind == CPTK_IS_CONVERTIBLE_TO
5389 || kind == CPTK_IS_EMPTY
5390 || kind == CPTK_IS_ENUM
5391 || kind == CPTK_IS_LITERAL_TYPE
5392 || kind == CPTK_IS_POD
5393 || kind == CPTK_IS_POLYMORPHIC
5394 || kind == CPTK_IS_STD_LAYOUT
5395 || kind == CPTK_IS_TRIVIAL
5396 || kind == CPTK_IS_UNION);
5398 if (kind == CPTK_IS_CONVERTIBLE_TO)
5400 sorry ("__is_convertible_to");
5401 return error_mark_node;
5404 if (type1 == error_mark_node
5405 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
5406 && type2 == error_mark_node))
5407 return error_mark_node;
5409 if (processing_template_decl)
5411 tree trait_expr = make_node (TRAIT_EXPR);
5412 TREE_TYPE (trait_expr) = boolean_type_node;
5413 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
5414 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
5415 TRAIT_EXPR_KIND (trait_expr) = kind;
5421 case CPTK_HAS_NOTHROW_ASSIGN:
5422 case CPTK_HAS_TRIVIAL_ASSIGN:
5423 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5424 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5425 case CPTK_HAS_NOTHROW_COPY:
5426 case CPTK_HAS_TRIVIAL_COPY:
5427 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5428 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5429 case CPTK_IS_ABSTRACT:
5431 case CPTK_IS_LITERAL_TYPE:
5433 case CPTK_IS_POLYMORPHIC:
5434 case CPTK_IS_STD_LAYOUT:
5435 case CPTK_IS_TRIVIAL:
5436 if (!check_trait_type (type1))
5437 return error_mark_node;
5440 case CPTK_IS_BASE_OF:
5441 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5442 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5443 && !complete_type_or_else (type2, NULL_TREE))
5444 /* We already issued an error. */
5445 return error_mark_node;
5453 case CPTK_IS_CONVERTIBLE_TO:
5458 return (trait_expr_value (kind, type1, type2)
5459 ? boolean_true_node : boolean_false_node);
5462 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5463 which is ignored for C++. */
5466 set_float_const_decimal64 (void)
5471 clear_float_const_decimal64 (void)
5476 float_const_decimal64_p (void)
5482 /* Return true if T is a literal type. */
5485 literal_type_p (tree t)
5487 if (SCALAR_TYPE_P (t)
5488 || TREE_CODE (t) == REFERENCE_TYPE)
5490 if (CLASS_TYPE_P (t))
5492 t = complete_type (t);
5493 gcc_assert (COMPLETE_TYPE_P (t) || errorcount);
5494 return CLASSTYPE_LITERAL_P (t);
5496 if (TREE_CODE (t) == ARRAY_TYPE)
5497 return literal_type_p (strip_array_types (t));
5501 /* If DECL is a variable declared `constexpr', require its type
5502 be literal. Return the DECL if OK, otherwise NULL. */
5505 ensure_literal_type_for_constexpr_object (tree decl)
5507 tree type = TREE_TYPE (decl);
5508 if (TREE_CODE (decl) == VAR_DECL && DECL_DECLARED_CONSTEXPR_P (decl)
5509 && !processing_template_decl)
5511 if (CLASS_TYPE_P (type) && !COMPLETE_TYPE_P (complete_type (type)))
5512 /* Don't complain here, we'll complain about incompleteness
5513 when we try to initialize the variable. */;
5514 else if (!literal_type_p (type))
5516 error ("the type %qT of constexpr variable %qD is not literal",
5518 explain_non_literal_class (type);
5525 /* Representation of entries in the constexpr function definition table. */
5527 typedef struct GTY(()) constexpr_fundef {
5532 /* This table holds all constexpr function definitions seen in
5533 the current translation unit. */
5535 static GTY ((param_is (constexpr_fundef))) htab_t constexpr_fundef_table;
5537 /* Utility function used for managing the constexpr function table.
5538 Return true if the entries pointed to by P and Q are for the
5539 same constexpr function. */
5542 constexpr_fundef_equal (const void *p, const void *q)
5544 const constexpr_fundef *lhs = (const constexpr_fundef *) p;
5545 const constexpr_fundef *rhs = (const constexpr_fundef *) q;
5546 return lhs->decl == rhs->decl;
5549 /* Utility function used for managing the constexpr function table.
5550 Return a hash value for the entry pointed to by Q. */
5552 static inline hashval_t
5553 constexpr_fundef_hash (const void *p)
5555 const constexpr_fundef *fundef = (const constexpr_fundef *) p;
5556 return DECL_UID (fundef->decl);
5559 /* Return a previously saved definition of function FUN. */
5561 static constexpr_fundef *
5562 retrieve_constexpr_fundef (tree fun)
5564 constexpr_fundef fundef = { NULL, NULL };
5565 if (constexpr_fundef_table == NULL)
5569 return (constexpr_fundef *) htab_find (constexpr_fundef_table, &fundef);
5572 /* Check whether the parameter and return types of FUN are valid for a
5573 constexpr function, and complain if COMPLAIN. */
5576 is_valid_constexpr_fn (tree fun, bool complain)
5578 tree parm = FUNCTION_FIRST_USER_PARM (fun);
5580 for (; parm != NULL; parm = TREE_CHAIN (parm))
5581 if (!literal_type_p (TREE_TYPE (parm)))
5586 error ("invalid type for parameter %d of constexpr "
5587 "function %q+#D", DECL_PARM_INDEX (parm), fun);
5588 explain_non_literal_class (TREE_TYPE (parm));
5592 if (!DECL_CONSTRUCTOR_P (fun))
5594 tree rettype = TREE_TYPE (TREE_TYPE (fun));
5595 if (!literal_type_p (rettype))
5600 error ("invalid return type %qT of constexpr function %q+D",
5602 explain_non_literal_class (rettype);
5606 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun)
5607 && !CLASSTYPE_LITERAL_P (DECL_CONTEXT (fun)))
5612 error ("enclosing class of constexpr non-static member "
5613 "function %q+#D is not a literal type", fun);
5614 explain_non_literal_class (DECL_CONTEXT (fun));
5622 /* Subroutine of build_constexpr_constructor_member_initializers.
5623 The expression tree T represents a data member initialization
5624 in a (constexpr) constructor definition. Build a pairing of
5625 the data member with its initializer, and prepend that pair
5626 to the existing initialization pair INITS. */
5629 build_data_member_initialization (tree t, VEC(constructor_elt,gc) **vec)
5632 if (TREE_CODE (t) == CLEANUP_POINT_EXPR)
5633 t = TREE_OPERAND (t, 0);
5634 if (TREE_CODE (t) == EXPR_STMT)
5635 t = TREE_OPERAND (t, 0);
5636 if (t == error_mark_node)
5638 if (TREE_CODE (t) == STATEMENT_LIST)
5640 tree_stmt_iterator i;
5641 for (i = tsi_start (t); !tsi_end_p (i); tsi_next (&i))
5643 if (! build_data_member_initialization (tsi_stmt (i), vec))
5648 if (TREE_CODE (t) == CLEANUP_STMT)
5650 /* We can't see a CLEANUP_STMT in a constructor for a literal class,
5651 but we can in a constexpr constructor for a non-literal class. Just
5652 ignore it; either all the initialization will be constant, in which
5653 case the cleanup can't run, or it can't be constexpr.
5654 Still recurse into CLEANUP_BODY. */
5655 return build_data_member_initialization (CLEANUP_BODY (t), vec);
5657 if (TREE_CODE (t) == CONVERT_EXPR)
5658 t = TREE_OPERAND (t, 0);
5659 if (TREE_CODE (t) == INIT_EXPR
5660 || TREE_CODE (t) == MODIFY_EXPR)
5662 member = TREE_OPERAND (t, 0);
5663 init = unshare_expr (TREE_OPERAND (t, 1));
5667 gcc_assert (TREE_CODE (t) == CALL_EXPR);
5668 member = CALL_EXPR_ARG (t, 0);
5669 /* We don't use build_cplus_new here because it complains about
5670 abstract bases. Leaving the call unwrapped means that it has the
5671 wrong type, but cxx_eval_constant_expression doesn't care. */
5672 init = unshare_expr (t);
5674 if (TREE_CODE (member) == INDIRECT_REF)
5675 member = TREE_OPERAND (member, 0);
5676 if (TREE_CODE (member) == NOP_EXPR)
5680 if (TREE_CODE (op) == ADDR_EXPR)
5682 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5683 (TREE_TYPE (TREE_TYPE (op)),
5684 TREE_TYPE (TREE_TYPE (member))));
5685 /* Initializing a cv-qualified member; we need to look through
5691 /* We don't put out anything for an empty base. */
5692 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (member))));
5693 /* But if the initializer isn't constexpr, leave it in so we
5695 if (potential_constant_expression (init))
5699 if (TREE_CODE (member) == ADDR_EXPR)
5700 member = TREE_OPERAND (member, 0);
5701 if (TREE_CODE (member) == COMPONENT_REF
5702 /* If we're initializing a member of a subaggregate, it's a vtable
5703 pointer. Leave it as COMPONENT_REF so we remember the path to get
5705 && TREE_CODE (TREE_OPERAND (member, 0)) != COMPONENT_REF)
5706 member = TREE_OPERAND (member, 1);
5707 CONSTRUCTOR_APPEND_ELT (*vec, member, init);
5711 /* Make sure that there are no statements after LAST in the constructor
5712 body represented by LIST. */
5715 check_constexpr_ctor_body (tree last, tree list)
5718 if (TREE_CODE (list) == STATEMENT_LIST)
5720 tree_stmt_iterator i = tsi_last (list);
5721 for (; !tsi_end_p (i); tsi_prev (&i))
5723 tree t = tsi_stmt (i);
5726 if (TREE_CODE (t) == BIND_EXPR)
5728 if (!check_constexpr_ctor_body (last, BIND_EXPR_BODY (t)))
5733 /* We currently allow typedefs and static_assert.
5734 FIXME allow them in the standard, too. */
5735 if (TREE_CODE (t) != STATIC_ASSERT)
5742 else if (list != last
5743 && TREE_CODE (list) != STATIC_ASSERT)
5747 error ("constexpr constructor does not have empty body");
5748 DECL_DECLARED_CONSTEXPR_P (current_function_decl) = false;
5753 /* Build compile-time evalable representations of member-initializer list
5754 for a constexpr constructor. */
5757 build_constexpr_constructor_member_initializers (tree type, tree body)
5759 VEC(constructor_elt,gc) *vec = NULL;
5761 if (TREE_CODE (body) == MUST_NOT_THROW_EXPR
5762 || TREE_CODE (body) == EH_SPEC_BLOCK)
5763 body = TREE_OPERAND (body, 0);
5764 if (TREE_CODE (body) == STATEMENT_LIST)
5765 body = STATEMENT_LIST_HEAD (body)->stmt;
5766 body = BIND_EXPR_BODY (body);
5767 if (TREE_CODE (body) == CLEANUP_POINT_EXPR)
5769 body = TREE_OPERAND (body, 0);
5770 if (TREE_CODE (body) == EXPR_STMT)
5771 body = TREE_OPERAND (body, 0);
5772 if (TREE_CODE (body) == INIT_EXPR
5773 && (same_type_ignoring_top_level_qualifiers_p
5774 (TREE_TYPE (TREE_OPERAND (body, 0)),
5775 current_class_type)))
5778 return TREE_OPERAND (body, 1);
5780 ok = build_data_member_initialization (body, &vec);
5782 else if (TREE_CODE (body) == STATEMENT_LIST)
5784 tree_stmt_iterator i;
5785 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
5787 ok = build_data_member_initialization (tsi_stmt (i), &vec);
5793 gcc_assert (errorcount > 0);
5795 return build_constructor (type, vec);
5797 return error_mark_node;
5800 /* Subroutine of register_constexpr_fundef. BODY is the body of a function
5801 declared to be constexpr, or a sub-statement thereof. Returns the
5802 return value if suitable, error_mark_node for a statement not allowed in
5803 a constexpr function, or NULL_TREE if no return value was found. */
5806 constexpr_fn_retval (tree body)
5808 switch (TREE_CODE (body))
5810 case STATEMENT_LIST:
5812 tree_stmt_iterator i;
5813 tree expr = NULL_TREE;
5814 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
5816 tree s = constexpr_fn_retval (tsi_stmt (i));
5817 if (s == error_mark_node)
5818 return error_mark_node;
5819 else if (s == NULL_TREE)
5820 /* Keep iterating. */;
5822 /* Multiple return statements. */
5823 return error_mark_node;
5831 return unshare_expr (TREE_OPERAND (body, 0));
5834 if (TREE_CODE (DECL_EXPR_DECL (body)) == USING_DECL)
5836 return error_mark_node;
5838 case CLEANUP_POINT_EXPR:
5839 return constexpr_fn_retval (TREE_OPERAND (body, 0));
5845 return error_mark_node;
5849 /* Subroutine of register_constexpr_fundef. BODY is the DECL_SAVED_TREE of
5850 FUN; do the necessary transformations to turn it into a single expression
5851 that we can store in the hash table. */
5854 massage_constexpr_body (tree fun, tree body)
5856 if (DECL_CONSTRUCTOR_P (fun))
5857 body = build_constexpr_constructor_member_initializers
5858 (DECL_CONTEXT (fun), body);
5861 if (TREE_CODE (body) == BIND_EXPR)
5862 body = BIND_EXPR_BODY (body);
5863 if (TREE_CODE (body) == EH_SPEC_BLOCK)
5864 body = EH_SPEC_STMTS (body);
5865 if (TREE_CODE (body) == MUST_NOT_THROW_EXPR)
5866 body = TREE_OPERAND (body, 0);
5867 body = constexpr_fn_retval (body);
5872 /* FUN is a constexpr constructor with massaged body BODY. Return true
5873 if some bases/fields are uninitialized, and complain if COMPLAIN. */
5876 cx_check_missing_mem_inits (tree fun, tree body, bool complain)
5882 if (TREE_CODE (body) != CONSTRUCTOR)
5886 nelts = CONSTRUCTOR_NELTS (body);
5887 field = TYPE_FIELDS (DECL_CONTEXT (fun));
5888 for (i = 0; i <= nelts; ++i)
5895 index = CONSTRUCTOR_ELT (body, i)->index;
5896 /* Skip base and vtable inits. */
5897 if (TREE_CODE (index) != FIELD_DECL)
5900 for (; field != index; field = DECL_CHAIN (field))
5903 if (TREE_CODE (field) != FIELD_DECL
5904 || (DECL_C_BIT_FIELD (field) && !DECL_NAME (field)))
5908 ftype = strip_array_types (TREE_TYPE (field));
5909 if (type_has_constexpr_default_constructor (ftype))
5911 /* It's OK to skip a member with a trivial constexpr ctor.
5912 A constexpr ctor that isn't trivial should have been
5914 gcc_checking_assert (!TYPE_HAS_COMPLEX_DFLT (ftype));
5917 error ("uninitialized member %qD in %<constexpr%> constructor",
5921 if (field == NULL_TREE)
5923 field = DECL_CHAIN (field);
5929 /* We are processing the definition of the constexpr function FUN.
5930 Check that its BODY fulfills the propriate requirements and
5931 enter it in the constexpr function definition table.
5932 For constructor BODY is actually the TREE_LIST of the
5933 member-initializer list. */
5936 register_constexpr_fundef (tree fun, tree body)
5938 constexpr_fundef entry;
5939 constexpr_fundef **slot;
5941 if (!is_valid_constexpr_fn (fun, !DECL_GENERATED_P (fun)))
5944 body = massage_constexpr_body (fun, body);
5945 if (body == NULL_TREE || body == error_mark_node)
5947 if (!DECL_CONSTRUCTOR_P (fun))
5948 error ("body of constexpr function %qD not a return-statement", fun);
5952 if (!potential_rvalue_constant_expression (body))
5954 if (!DECL_GENERATED_P (fun))
5955 require_potential_rvalue_constant_expression (body);
5959 if (DECL_CONSTRUCTOR_P (fun)
5960 && cx_check_missing_mem_inits (fun, body, !DECL_GENERATED_P (fun)))
5963 /* Create the constexpr function table if necessary. */
5964 if (constexpr_fundef_table == NULL)
5965 constexpr_fundef_table = htab_create_ggc (101,
5966 constexpr_fundef_hash,
5967 constexpr_fundef_equal,
5971 slot = (constexpr_fundef **)
5972 htab_find_slot (constexpr_fundef_table, &entry, INSERT);
5974 gcc_assert (*slot == NULL);
5975 *slot = ggc_alloc_constexpr_fundef ();
5981 /* FUN is a non-constexpr function called in a context that requires a
5982 constant expression. If it comes from a constexpr template, explain why
5983 the instantiation isn't constexpr. */
5986 explain_invalid_constexpr_fn (tree fun)
5988 static struct pointer_set_t *diagnosed;
5990 location_t save_loc;
5991 /* Only diagnose defaulted functions or instantiations. */
5992 if (!DECL_DEFAULTED_FN (fun)
5993 && !is_instantiation_of_constexpr (fun))
5995 if (diagnosed == NULL)
5996 diagnosed = pointer_set_create ();
5997 if (pointer_set_insert (diagnosed, fun) != 0)
5998 /* Already explained. */
6001 save_loc = input_location;
6002 input_location = DECL_SOURCE_LOCATION (fun);
6003 inform (0, "%q+D is not usable as a constexpr function because:", fun);
6004 /* First check the declaration. */
6005 if (is_valid_constexpr_fn (fun, true))
6007 /* Then if it's OK, the body. */
6008 if (DECL_DEFAULTED_FN (fun))
6009 explain_implicit_non_constexpr (fun);
6012 body = massage_constexpr_body (fun, DECL_SAVED_TREE (fun));
6013 require_potential_rvalue_constant_expression (body);
6014 if (DECL_CONSTRUCTOR_P (fun))
6015 cx_check_missing_mem_inits (fun, body, true);
6018 input_location = save_loc;
6021 /* Objects of this type represent calls to constexpr functions
6022 along with the bindings of parameters to their arguments, for
6023 the purpose of compile time evaluation. */
6025 typedef struct GTY(()) constexpr_call {
6026 /* Description of the constexpr function definition. */
6027 constexpr_fundef *fundef;
6028 /* Parameter bindings enironment. A TREE_LIST where each TREE_PURPOSE
6029 is a parameter _DECL and the TREE_VALUE is the value of the parameter.
6030 Note: This arrangement is made to accomodate the use of
6031 iterative_hash_template_arg (see pt.c). If you change this
6032 representation, also change the hash calculation in
6033 cxx_eval_call_expression. */
6035 /* Result of the call.
6036 NULL means the call is being evaluated.
6037 error_mark_node means that the evaluation was erroneous;
6038 otherwise, the actuall value of the call. */
6040 /* The hash of this call; we remember it here to avoid having to
6041 recalculate it when expanding the hash table. */
6045 /* A table of all constexpr calls that have been evaluated by the
6046 compiler in this translation unit. */
6048 static GTY ((param_is (constexpr_call))) htab_t constexpr_call_table;
6050 static tree cxx_eval_constant_expression (const constexpr_call *, tree,
6051 bool, bool, bool *);
6053 /* Compute a hash value for a constexpr call representation. */
6056 constexpr_call_hash (const void *p)
6058 const constexpr_call *info = (const constexpr_call *) p;
6062 /* Return 1 if the objects pointed to by P and Q represent calls
6063 to the same constexpr function with the same arguments.
6064 Otherwise, return 0. */
6067 constexpr_call_equal (const void *p, const void *q)
6069 const constexpr_call *lhs = (const constexpr_call *) p;
6070 const constexpr_call *rhs = (const constexpr_call *) q;
6075 if (!constexpr_fundef_equal (lhs->fundef, rhs->fundef))
6077 lhs_bindings = lhs->bindings;
6078 rhs_bindings = rhs->bindings;
6079 while (lhs_bindings != NULL && rhs_bindings != NULL)
6081 tree lhs_arg = TREE_VALUE (lhs_bindings);
6082 tree rhs_arg = TREE_VALUE (rhs_bindings);
6083 gcc_assert (TREE_TYPE (lhs_arg) == TREE_TYPE (rhs_arg));
6084 if (!cp_tree_equal (lhs_arg, rhs_arg))
6086 lhs_bindings = TREE_CHAIN (lhs_bindings);
6087 rhs_bindings = TREE_CHAIN (rhs_bindings);
6089 return lhs_bindings == rhs_bindings;
6092 /* Initialize the constexpr call table, if needed. */
6095 maybe_initialize_constexpr_call_table (void)
6097 if (constexpr_call_table == NULL)
6098 constexpr_call_table = htab_create_ggc (101,
6099 constexpr_call_hash,
6100 constexpr_call_equal,
6104 /* Return true if T designates the implied `this' parameter. */
6107 is_this_parameter (tree t)
6109 return t == current_class_ptr;
6112 /* We have an expression tree T that represents a call, either CALL_EXPR
6113 or AGGR_INIT_EXPR. If the call is lexically to a named function,
6114 retrun the _DECL for that function. */
6117 get_function_named_in_call (tree t)
6120 switch (TREE_CODE (t))
6123 fun = CALL_EXPR_FN (t);
6126 case AGGR_INIT_EXPR:
6127 fun = AGGR_INIT_EXPR_FN (t);
6134 if (TREE_CODE (fun) == ADDR_EXPR
6135 && TREE_CODE (TREE_OPERAND (fun, 0)) == FUNCTION_DECL)
6136 fun = TREE_OPERAND (fun, 0);
6140 /* We have an expression tree T that represents a call, either CALL_EXPR
6141 or AGGR_INIT_EXPR. Return the Nth argument. */
6144 get_nth_callarg (tree t, int n)
6146 switch (TREE_CODE (t))
6149 return CALL_EXPR_ARG (t, n);
6151 case AGGR_INIT_EXPR:
6152 return AGGR_INIT_EXPR_ARG (t, n);
6160 /* Look up the binding of the function parameter T in a constexpr
6161 function call context CALL. */
6164 lookup_parameter_binding (const constexpr_call *call, tree t)
6166 tree b = purpose_member (t, call->bindings);
6167 return TREE_VALUE (b);
6170 /* Attempt to evaluate T which represents a call to a builtin function.
6171 We assume here that all builtin functions evaluate to scalar types
6172 represented by _CST nodes. */
6175 cxx_eval_builtin_function_call (const constexpr_call *call, tree t,
6176 bool allow_non_constant, bool addr,
6177 bool *non_constant_p)
6179 const int nargs = call_expr_nargs (t);
6180 tree *args = (tree *) alloca (nargs * sizeof (tree));
6183 for (i = 0; i < nargs; ++i)
6185 args[i] = cxx_eval_constant_expression (call, CALL_EXPR_ARG (t, i),
6186 allow_non_constant, addr,
6188 if (allow_non_constant && *non_constant_p)
6191 if (*non_constant_p)
6193 new_call = build_call_array_loc (EXPR_LOCATION (t), TREE_TYPE (t),
6194 CALL_EXPR_FN (t), nargs, args);
6195 return fold (new_call);
6198 /* TEMP is the constant value of a temporary object of type TYPE. Adjust
6199 the type of the value to match. */
6202 adjust_temp_type (tree type, tree temp)
6204 if (TREE_TYPE (temp) == type)
6206 /* Avoid wrapping an aggregate value in a NOP_EXPR. */
6207 if (TREE_CODE (temp) == CONSTRUCTOR)
6208 return build_constructor (type, CONSTRUCTOR_ELTS (temp));
6209 gcc_assert (SCALAR_TYPE_P (type));
6210 return cp_fold_convert (type, temp);
6213 /* Subroutine of cxx_eval_call_expression.
6214 We are processing a call expression (either CALL_EXPR or
6215 AGGR_INIT_EXPR) in the call context of OLD_CALL. Evaluate
6216 all arguments and bind their values to correspondings
6217 parameters, making up the NEW_CALL context. */
6220 cxx_bind_parameters_in_call (const constexpr_call *old_call, tree t,
6221 constexpr_call *new_call,
6222 bool allow_non_constant,
6223 bool *non_constant_p)
6225 const int nargs = call_expr_nargs (t);
6226 tree fun = new_call->fundef->decl;
6227 tree parms = DECL_ARGUMENTS (fun);
6229 for (i = 0; i < nargs; ++i)
6232 tree type = parms ? TREE_TYPE (parms) : void_type_node;
6233 /* For member function, the first argument is a pointer to the implied
6234 object. And for an object contruction, don't bind `this' before
6235 it is fully constructed. */
6236 if (i == 0 && DECL_CONSTRUCTOR_P (fun))
6238 x = get_nth_callarg (t, i);
6239 arg = cxx_eval_constant_expression (old_call, x, allow_non_constant,
6240 TREE_CODE (type) == REFERENCE_TYPE,
6242 /* Don't VERIFY_CONSTANT here. */
6243 if (*non_constant_p && allow_non_constant)
6245 /* Just discard ellipsis args after checking their constantitude. */
6248 if (*non_constant_p)
6249 /* Don't try to adjust the type of non-constant args. */
6252 /* Make sure the binding has the same type as the parm. */
6253 if (TREE_CODE (type) != REFERENCE_TYPE)
6254 arg = adjust_temp_type (type, arg);
6255 new_call->bindings = tree_cons (parms, arg, new_call->bindings);
6257 parms = TREE_CHAIN (parms);
6261 /* Variables and functions to manage constexpr call expansion context.
6262 These do not need to be marked for PCH or GC. */
6264 /* FIXME remember and print actual constant arguments. */
6265 static VEC(tree,heap) *call_stack = NULL;
6266 static int call_stack_tick;
6267 static int last_cx_error_tick;
6270 push_cx_call_context (tree call)
6273 if (!EXPR_HAS_LOCATION (call))
6274 SET_EXPR_LOCATION (call, input_location);
6275 VEC_safe_push (tree, heap, call_stack, call);
6276 if (VEC_length (tree, call_stack) > (unsigned) max_constexpr_depth)
6282 pop_cx_call_context (void)
6285 VEC_pop (tree, call_stack);
6289 cx_error_context (void)
6291 VEC(tree,heap) *r = NULL;
6292 if (call_stack_tick != last_cx_error_tick
6293 && !VEC_empty (tree, call_stack))
6295 last_cx_error_tick = call_stack_tick;
6299 /* Subroutine of cxx_eval_constant_expression.
6300 Evaluate the call expression tree T in the context of OLD_CALL expression
6304 cxx_eval_call_expression (const constexpr_call *old_call, tree t,
6305 bool allow_non_constant, bool addr,
6306 bool *non_constant_p)
6308 location_t loc = EXPR_LOC_OR_HERE (t);
6309 tree fun = get_function_named_in_call (t);
6311 constexpr_call new_call = { NULL, NULL, NULL, 0 };
6312 constexpr_call **slot;
6313 constexpr_call *entry;
6316 if (TREE_CODE (fun) != FUNCTION_DECL)
6318 /* Might be a constexpr function pointer. */
6319 fun = cxx_eval_constant_expression (old_call, fun, allow_non_constant,
6320 /*addr*/false, non_constant_p);
6321 if (TREE_CODE (fun) == ADDR_EXPR)
6322 fun = TREE_OPERAND (fun, 0);
6324 if (TREE_CODE (fun) != FUNCTION_DECL)
6326 if (!allow_non_constant && !*non_constant_p)
6327 error_at (loc, "expression %qE does not designate a constexpr "
6329 *non_constant_p = true;
6332 if (DECL_CLONED_FUNCTION_P (fun))
6333 fun = DECL_CLONED_FUNCTION (fun);
6334 if (is_builtin_fn (fun))
6335 return cxx_eval_builtin_function_call (old_call, t, allow_non_constant,
6336 addr, non_constant_p);
6337 if (!DECL_DECLARED_CONSTEXPR_P (fun))
6339 if (!allow_non_constant)
6341 error_at (loc, "call to non-constexpr function %qD", fun);
6342 explain_invalid_constexpr_fn (fun);
6344 *non_constant_p = true;
6348 /* Shortcut trivial copy constructor/op=. */
6349 if (call_expr_nargs (t) == 2 && trivial_fn_p (fun))
6351 tree arg = convert_from_reference (get_nth_callarg (t, 1));
6352 return cxx_eval_constant_expression (old_call, arg, allow_non_constant,
6353 addr, non_constant_p);
6356 /* If in direct recursive call, optimize definition search. */
6357 if (old_call != NULL && old_call->fundef->decl == fun)
6358 new_call.fundef = old_call->fundef;
6361 new_call.fundef = retrieve_constexpr_fundef (fun);
6362 if (new_call.fundef == NULL || new_call.fundef->body == NULL)
6364 if (!allow_non_constant)
6366 if (DECL_INITIAL (fun))
6368 /* The definition of fun was somehow unsuitable. */
6369 error_at (loc, "%qD called in a constant expression", fun);
6370 explain_invalid_constexpr_fn (fun);
6373 error_at (loc, "%qD used before its definition", fun);
6375 *non_constant_p = true;
6379 cxx_bind_parameters_in_call (old_call, t, &new_call,
6380 allow_non_constant, non_constant_p);
6381 if (*non_constant_p)
6384 depth_ok = push_cx_call_context (t);
6387 = iterative_hash_template_arg (new_call.bindings,
6388 constexpr_fundef_hash (new_call.fundef));
6390 /* If we have seen this call before, we are done. */
6391 maybe_initialize_constexpr_call_table ();
6392 slot = (constexpr_call **)
6393 htab_find_slot (constexpr_call_table, &new_call, INSERT);
6397 /* We need to keep a pointer to the entry, not just the slot, as the
6398 slot can move in the call to cxx_eval_builtin_function_call. */
6399 *slot = entry = ggc_alloc_constexpr_call ();
6402 /* Calls which are in progress have their result set to NULL
6403 so that we can detect circular dependencies. */
6404 else if (entry->result == NULL)
6406 if (!allow_non_constant)
6407 error ("call has circular dependency");
6408 *non_constant_p = true;
6409 entry->result = result = error_mark_node;
6414 if (!allow_non_constant)
6415 error ("constexpr evaluation depth exceeds maximum of %d (use "
6416 "-fconstexpr-depth= to increase the maximum)",
6417 max_constexpr_depth);
6418 *non_constant_p = true;
6419 entry->result = result = error_mark_node;
6423 result = entry->result;
6424 if (!result || (result == error_mark_node && !allow_non_constant))
6425 result = (cxx_eval_constant_expression
6426 (&new_call, new_call.fundef->body,
6427 allow_non_constant, addr,
6429 if (result == error_mark_node)
6430 *non_constant_p = true;
6431 if (*non_constant_p)
6432 entry->result = result = error_mark_node;
6435 /* If this was a call to initialize an object, set the type of
6436 the CONSTRUCTOR to the type of that object. */
6437 if (DECL_CONSTRUCTOR_P (fun))
6439 tree ob_arg = get_nth_callarg (t, 0);
6440 STRIP_NOPS (ob_arg);
6441 gcc_assert (TREE_CODE (TREE_TYPE (ob_arg)) == POINTER_TYPE
6442 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (ob_arg))));
6443 result = adjust_temp_type (TREE_TYPE (TREE_TYPE (ob_arg)),
6446 entry->result = result;
6450 pop_cx_call_context ();
6451 return unshare_expr (result);
6454 /* FIXME speed this up, it's taking 16% of compile time on sieve testcase. */
6457 reduced_constant_expression_p (tree t)
6459 if (TREE_OVERFLOW_P (t))
6460 /* Integer overflow makes this not a constant expression. */
6462 /* FIXME are we calling this too much? */
6463 return initializer_constant_valid_p (t, TREE_TYPE (t)) != NULL_TREE;
6466 /* Some expressions may have constant operands but are not constant
6467 themselves, such as 1/0. Call this function (or rather, the macro
6468 following it) to check for that condition.
6470 We only call this in places that require an arithmetic constant, not in
6471 places where we might have a non-constant expression that can be a
6472 component of a constant expression, such as the address of a constexpr
6473 variable that might be dereferenced later. */
6476 verify_constant (tree t, bool allow_non_constant, bool *non_constant_p)
6478 if (!*non_constant_p && !reduced_constant_expression_p (t))
6480 if (!allow_non_constant)
6482 /* If T was already folded to a _CST with TREE_OVERFLOW set,
6483 printing the folded constant isn't helpful. */
6484 if (TREE_OVERFLOW_P (t))
6486 permerror (input_location, "overflow in constant expression");
6487 /* If we're being permissive (and are in an enforcing
6488 context), consider this constant. */
6489 if (flag_permissive)
6493 error ("%q+E is not a constant expression", t);
6495 *non_constant_p = true;
6497 return *non_constant_p;
6499 #define VERIFY_CONSTANT(X) \
6501 if (verify_constant ((X), allow_non_constant, non_constant_p)) \
6505 /* Subroutine of cxx_eval_constant_expression.
6506 Attempt to reduce the unary expression tree T to a compile time value.
6507 If successful, return the value. Otherwise issue a diagnostic
6508 and return error_mark_node. */
6511 cxx_eval_unary_expression (const constexpr_call *call, tree t,
6512 bool allow_non_constant, bool addr,
6513 bool *non_constant_p)
6516 tree orig_arg = TREE_OPERAND (t, 0);
6517 tree arg = cxx_eval_constant_expression (call, orig_arg, allow_non_constant,
6518 addr, non_constant_p);
6519 VERIFY_CONSTANT (arg);
6520 if (arg == orig_arg)
6522 r = fold_build1 (TREE_CODE (t), TREE_TYPE (t), arg);
6523 VERIFY_CONSTANT (r);
6527 /* Subroutine of cxx_eval_constant_expression.
6528 Like cxx_eval_unary_expression, except for binary expressions. */
6531 cxx_eval_binary_expression (const constexpr_call *call, tree t,
6532 bool allow_non_constant, bool addr,
6533 bool *non_constant_p)
6536 tree orig_lhs = TREE_OPERAND (t, 0);
6537 tree orig_rhs = TREE_OPERAND (t, 1);
6539 lhs = cxx_eval_constant_expression (call, orig_lhs,
6540 allow_non_constant, addr,
6542 VERIFY_CONSTANT (lhs);
6543 rhs = cxx_eval_constant_expression (call, orig_rhs,
6544 allow_non_constant, addr,
6546 VERIFY_CONSTANT (rhs);
6547 if (lhs == orig_lhs && rhs == orig_rhs)
6549 r = fold_build2 (TREE_CODE (t), TREE_TYPE (t), lhs, rhs);
6550 VERIFY_CONSTANT (r);
6554 /* Subroutine of cxx_eval_constant_expression.
6555 Attempt to evaluate condition expressions. Dead branches are not
6559 cxx_eval_conditional_expression (const constexpr_call *call, tree t,
6560 bool allow_non_constant, bool addr,
6561 bool *non_constant_p)
6563 tree val = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
6564 allow_non_constant, addr,
6566 VERIFY_CONSTANT (val);
6567 /* Don't VERIFY_CONSTANT the other operands. */
6568 if (integer_zerop (val))
6569 return cxx_eval_constant_expression (call, TREE_OPERAND (t, 2),
6570 allow_non_constant, addr,
6572 return cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
6573 allow_non_constant, addr,
6577 /* Subroutine of cxx_eval_constant_expression.
6578 Attempt to reduce a reference to an array slot. */
6581 cxx_eval_array_reference (const constexpr_call *call, tree t,
6582 bool allow_non_constant, bool addr,
6583 bool *non_constant_p)
6585 tree oldary = TREE_OPERAND (t, 0);
6586 tree ary = cxx_eval_constant_expression (call, oldary,
6587 allow_non_constant, addr,
6592 unsigned len, elem_nchars = 1;
6593 if (*non_constant_p)
6595 oldidx = TREE_OPERAND (t, 1);
6596 index = cxx_eval_constant_expression (call, oldidx,
6597 allow_non_constant, false,
6599 VERIFY_CONSTANT (index);
6600 if (addr && ary == oldary && index == oldidx)
6603 return build4 (ARRAY_REF, TREE_TYPE (t), ary, index, NULL, NULL);
6604 elem_type = TREE_TYPE (TREE_TYPE (ary));
6605 if (TREE_CODE (ary) == CONSTRUCTOR)
6606 len = CONSTRUCTOR_NELTS (ary);
6607 else if (TREE_CODE (ary) == STRING_CST)
6609 elem_nchars = (TYPE_PRECISION (elem_type)
6610 / TYPE_PRECISION (char_type_node));
6611 len = (unsigned) TREE_STRING_LENGTH (ary) / elem_nchars;
6615 /* We can't do anything with other tree codes, so use
6616 VERIFY_CONSTANT to complain and fail. */
6617 VERIFY_CONSTANT (ary);
6620 if (compare_tree_int (index, len) >= 0)
6622 if (tree_int_cst_lt (index, array_type_nelts_top (TREE_TYPE (ary))))
6624 /* If it's within the array bounds but doesn't have an explicit
6625 initializer, it's value-initialized. */
6626 tree val = build_value_init (elem_type, tf_warning_or_error);
6627 return cxx_eval_constant_expression (call, val,
6628 allow_non_constant, addr,
6632 if (!allow_non_constant)
6633 error ("array subscript out of bound");
6634 *non_constant_p = true;
6637 i = tree_low_cst (index, 0);
6638 if (TREE_CODE (ary) == CONSTRUCTOR)
6639 return VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ary), i)->value;
6640 else if (elem_nchars == 1)
6641 return build_int_cst (cv_unqualified (TREE_TYPE (TREE_TYPE (ary))),
6642 TREE_STRING_POINTER (ary)[i]);
6645 tree type = cv_unqualified (TREE_TYPE (TREE_TYPE (ary)));
6646 return native_interpret_expr (type, (const unsigned char *)
6647 TREE_STRING_POINTER (ary)
6648 + i * elem_nchars, elem_nchars);
6650 /* Don't VERIFY_CONSTANT here. */
6653 /* Subroutine of cxx_eval_constant_expression.
6654 Attempt to reduce a field access of a value of class type. */
6657 cxx_eval_component_reference (const constexpr_call *call, tree t,
6658 bool allow_non_constant, bool addr,
6659 bool *non_constant_p)
6661 unsigned HOST_WIDE_INT i;
6664 tree part = TREE_OPERAND (t, 1);
6665 tree orig_whole = TREE_OPERAND (t, 0);
6666 tree whole = cxx_eval_constant_expression (call, orig_whole,
6667 allow_non_constant, addr,
6669 if (whole == orig_whole)
6672 return fold_build3 (COMPONENT_REF, TREE_TYPE (t),
6673 whole, part, NULL_TREE);
6674 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6676 if (!*non_constant_p && TREE_CODE (whole) != CONSTRUCTOR)
6678 if (!allow_non_constant)
6679 error ("%qE is not a constant expression", orig_whole);
6680 *non_constant_p = true;
6682 if (*non_constant_p)
6684 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole), i, field, value)
6689 if (TREE_CODE (TREE_TYPE (whole)) == UNION_TYPE
6690 && CONSTRUCTOR_NELTS (whole) > 0)
6692 /* DR 1188 says we don't have to deal with this. */
6693 if (!allow_non_constant)
6694 error ("accessing %qD member instead of initialized %qD member in "
6695 "constant expression", part, CONSTRUCTOR_ELT (whole, 0)->index);
6696 *non_constant_p = true;
6700 /* If there's no explicit init for this field, it's value-initialized. */
6701 value = build_value_init (TREE_TYPE (t), tf_warning_or_error);
6702 return cxx_eval_constant_expression (call, value,
6703 allow_non_constant, addr,
6707 /* Subroutine of cxx_eval_constant_expression.
6708 Attempt to reduce a field access of a value of class type that is
6709 expressed as a BIT_FIELD_REF. */
6712 cxx_eval_bit_field_ref (const constexpr_call *call, tree t,
6713 bool allow_non_constant, bool addr,
6714 bool *non_constant_p)
6716 tree orig_whole = TREE_OPERAND (t, 0);
6717 tree retval, fldval, utype, mask;
6718 bool fld_seen = false;
6719 HOST_WIDE_INT istart, isize;
6720 tree whole = cxx_eval_constant_expression (call, orig_whole,
6721 allow_non_constant, addr,
6723 tree start, field, value;
6724 unsigned HOST_WIDE_INT i;
6726 if (whole == orig_whole)
6728 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6730 if (!*non_constant_p && TREE_CODE (whole) != CONSTRUCTOR)
6732 if (!allow_non_constant)
6733 error ("%qE is not a constant expression", orig_whole);
6734 *non_constant_p = true;
6736 if (*non_constant_p)
6739 start = TREE_OPERAND (t, 2);
6740 istart = tree_low_cst (start, 0);
6741 isize = tree_low_cst (TREE_OPERAND (t, 1), 0);
6742 utype = TREE_TYPE (t);
6743 if (!TYPE_UNSIGNED (utype))
6744 utype = build_nonstandard_integer_type (TYPE_PRECISION (utype), 1);
6745 retval = build_int_cst (utype, 0);
6746 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole), i, field, value)
6748 tree bitpos = bit_position (field);
6749 if (bitpos == start && DECL_SIZE (field) == TREE_OPERAND (t, 1))
6751 if (TREE_CODE (TREE_TYPE (field)) == INTEGER_TYPE
6752 && TREE_CODE (value) == INTEGER_CST
6753 && host_integerp (bitpos, 0)
6754 && host_integerp (DECL_SIZE (field), 0))
6756 HOST_WIDE_INT bit = tree_low_cst (bitpos, 0);
6757 HOST_WIDE_INT sz = tree_low_cst (DECL_SIZE (field), 0);
6758 HOST_WIDE_INT shift;
6759 if (bit >= istart && bit + sz <= istart + isize)
6761 fldval = fold_convert (utype, value);
6762 mask = build_int_cst_type (utype, -1);
6763 mask = fold_build2 (LSHIFT_EXPR, utype, mask,
6764 size_int (TYPE_PRECISION (utype) - sz));
6765 mask = fold_build2 (RSHIFT_EXPR, utype, mask,
6766 size_int (TYPE_PRECISION (utype) - sz));
6767 fldval = fold_build2 (BIT_AND_EXPR, utype, fldval, mask);
6768 shift = bit - istart;
6769 if (BYTES_BIG_ENDIAN)
6770 shift = TYPE_PRECISION (utype) - shift - sz;
6771 fldval = fold_build2 (LSHIFT_EXPR, utype, fldval,
6773 retval = fold_build2 (BIT_IOR_EXPR, utype, retval, fldval);
6779 return fold_convert (TREE_TYPE (t), retval);
6781 return error_mark_node;
6784 /* Subroutine of cxx_eval_constant_expression.
6785 Evaluate a short-circuited logical expression T in the context
6786 of a given constexpr CALL. BAILOUT_VALUE is the value for
6787 early return. CONTINUE_VALUE is used here purely for
6788 sanity check purposes. */
6791 cxx_eval_logical_expression (const constexpr_call *call, tree t,
6792 tree bailout_value, tree continue_value,
6793 bool allow_non_constant, bool addr,
6794 bool *non_constant_p)
6797 tree lhs = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
6798 allow_non_constant, addr,
6800 VERIFY_CONSTANT (lhs);
6801 if (tree_int_cst_equal (lhs, bailout_value))
6803 gcc_assert (tree_int_cst_equal (lhs, continue_value));
6804 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
6805 allow_non_constant, addr, non_constant_p);
6806 VERIFY_CONSTANT (r);
6810 /* REF is a COMPONENT_REF designating a particular field. V is a vector of
6811 CONSTRUCTOR elements to initialize (part of) an object containing that
6812 field. Return a pointer to the constructor_elt corresponding to the
6813 initialization of the field. */
6815 static constructor_elt *
6816 base_field_constructor_elt (VEC(constructor_elt,gc) *v, tree ref)
6818 tree aggr = TREE_OPERAND (ref, 0);
6819 tree field = TREE_OPERAND (ref, 1);
6821 constructor_elt *ce;
6823 gcc_assert (TREE_CODE (ref) == COMPONENT_REF);
6825 if (TREE_CODE (aggr) == COMPONENT_REF)
6827 constructor_elt *base_ce
6828 = base_field_constructor_elt (v, aggr);
6829 v = CONSTRUCTOR_ELTS (base_ce->value);
6832 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
6833 if (ce->index == field)
6840 /* Subroutine of cxx_eval_constant_expression.
6841 The expression tree T denotes a C-style array or a C-style
6842 aggregate. Reduce it to a constant expression. */
6845 cxx_eval_bare_aggregate (const constexpr_call *call, tree t,
6846 bool allow_non_constant, bool addr,
6847 bool *non_constant_p)
6849 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (t);
6850 VEC(constructor_elt,gc) *n = VEC_alloc (constructor_elt, gc,
6851 VEC_length (constructor_elt, v));
6852 constructor_elt *ce;
6854 bool changed = false;
6855 gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (t));
6856 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
6858 tree elt = cxx_eval_constant_expression (call, ce->value,
6859 allow_non_constant, addr,
6861 /* Don't VERIFY_CONSTANT here. */
6862 if (allow_non_constant && *non_constant_p)
6864 if (elt != ce->value)
6866 if (TREE_CODE (ce->index) == COMPONENT_REF)
6868 /* This is an initialization of a vfield inside a base
6869 subaggregate that we already initialized; push this
6870 initialization into the previous initialization. */
6871 constructor_elt *inner = base_field_constructor_elt (n, ce->index);
6875 CONSTRUCTOR_APPEND_ELT (n, ce->index, elt);
6877 if (*non_constant_p || !changed)
6880 VEC_free (constructor_elt, gc, n);
6883 t = build_constructor (TREE_TYPE (t), n);
6884 TREE_CONSTANT (t) = true;
6888 /* Subroutine of cxx_eval_constant_expression.
6889 The expression tree T is a VEC_INIT_EXPR which denotes the desired
6890 initialization of a non-static data member of array type. Reduce it to a
6893 Note that apart from value-initialization (when VALUE_INIT is true),
6894 this is only intended to support value-initialization and the
6895 initializations done by defaulted constructors for classes with
6896 non-static data members of array type. In this case, VEC_INIT_EXPR_INIT
6897 will either be NULL_TREE for the default constructor, or a COMPONENT_REF
6898 for the copy/move constructor. */
6901 cxx_eval_vec_init_1 (const constexpr_call *call, tree atype, tree init,
6902 bool value_init, bool allow_non_constant, bool addr,
6903 bool *non_constant_p)
6905 tree elttype = TREE_TYPE (atype);
6906 int max = tree_low_cst (array_type_nelts (atype), 0);
6907 VEC(constructor_elt,gc) *n = VEC_alloc (constructor_elt, gc, max + 1);
6908 bool pre_init = false;
6911 /* For the default constructor, build up a call to the default
6912 constructor of the element type. We only need to handle class types
6913 here, as for a constructor to be constexpr, all members must be
6914 initialized, which for a defaulted default constructor means they must
6915 be of a class type with a constexpr default constructor. */
6916 if (TREE_CODE (elttype) == ARRAY_TYPE)
6917 /* We only do this at the lowest level. */;
6918 else if (value_init)
6920 init = build_value_init (elttype, tf_warning_or_error);
6921 init = cxx_eval_constant_expression
6922 (call, init, allow_non_constant, addr, non_constant_p);
6927 VEC(tree,gc) *argvec = make_tree_vector ();
6928 init = build_special_member_call (NULL_TREE, complete_ctor_identifier,
6929 &argvec, elttype, LOOKUP_NORMAL,
6930 tf_warning_or_error);
6931 release_tree_vector (argvec);
6932 init = cxx_eval_constant_expression (call, init, allow_non_constant,
6933 addr, non_constant_p);
6937 if (*non_constant_p && !allow_non_constant)
6940 for (i = 0; i <= max; ++i)
6942 tree idx = build_int_cst (size_type_node, i);
6944 if (TREE_CODE (elttype) == ARRAY_TYPE)
6946 /* A multidimensional array; recurse. */
6948 eltinit = NULL_TREE;
6950 eltinit = cp_build_array_ref (input_location, init, idx,
6951 tf_warning_or_error);
6952 eltinit = cxx_eval_vec_init_1 (call, elttype, eltinit, value_init,
6953 allow_non_constant, addr,
6958 /* Initializing an element using value or default initialization
6959 we just pre-built above. */
6963 eltinit = unshare_expr (init);
6967 /* Copying an element. */
6968 VEC(tree,gc) *argvec;
6969 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6970 (atype, TREE_TYPE (init)));
6971 eltinit = cp_build_array_ref (input_location, init, idx,
6972 tf_warning_or_error);
6973 if (!real_lvalue_p (init))
6974 eltinit = move (eltinit);
6975 argvec = make_tree_vector ();
6976 VEC_quick_push (tree, argvec, eltinit);
6977 eltinit = (build_special_member_call
6978 (NULL_TREE, complete_ctor_identifier, &argvec,
6979 elttype, LOOKUP_NORMAL, tf_warning_or_error));
6980 release_tree_vector (argvec);
6981 eltinit = cxx_eval_constant_expression
6982 (call, eltinit, allow_non_constant, addr, non_constant_p);
6984 if (*non_constant_p && !allow_non_constant)
6986 CONSTRUCTOR_APPEND_ELT (n, idx, eltinit);
6989 if (!*non_constant_p)
6991 init = build_constructor (atype, n);
6992 TREE_CONSTANT (init) = true;
6997 VEC_free (constructor_elt, gc, n);
7002 cxx_eval_vec_init (const constexpr_call *call, tree t,
7003 bool allow_non_constant, bool addr,
7004 bool *non_constant_p)
7006 tree atype = TREE_TYPE (t);
7007 tree init = VEC_INIT_EXPR_INIT (t);
7008 tree r = cxx_eval_vec_init_1 (call, atype, init,
7009 VEC_INIT_EXPR_VALUE_INIT (t),
7010 allow_non_constant, addr, non_constant_p);
7011 if (*non_constant_p)
7017 /* A less strict version of fold_indirect_ref_1, which requires cv-quals to
7018 match. We want to be less strict for simple *& folding; if we have a
7019 non-const temporary that we access through a const pointer, that should
7020 work. We handle this here rather than change fold_indirect_ref_1
7021 because we're dealing with things like ADDR_EXPR of INTEGER_CST which
7022 don't really make sense outside of constant expression evaluation. Also
7023 we want to allow folding to COMPONENT_REF, which could cause trouble
7024 with TBAA in fold_indirect_ref_1.
7026 Try to keep this function synced with fold_indirect_ref_1. */
7029 cxx_fold_indirect_ref (location_t loc, tree type, tree op0, bool *empty_base)
7035 subtype = TREE_TYPE (sub);
7036 gcc_assert (POINTER_TYPE_P (subtype));
7038 if (TREE_CODE (sub) == ADDR_EXPR)
7040 tree op = TREE_OPERAND (sub, 0);
7041 tree optype = TREE_TYPE (op);
7043 /* *&CONST_DECL -> to the value of the const decl. */
7044 if (TREE_CODE (op) == CONST_DECL)
7045 return DECL_INITIAL (op);
7046 /* *&p => p; make sure to handle *&"str"[cst] here. */
7047 if (same_type_ignoring_top_level_qualifiers_p (optype, type))
7049 tree fop = fold_read_from_constant_string (op);
7055 /* *(foo *)&fooarray => fooarray[0] */
7056 else if (TREE_CODE (optype) == ARRAY_TYPE
7057 && (same_type_ignoring_top_level_qualifiers_p
7058 (type, TREE_TYPE (optype))))
7060 tree type_domain = TYPE_DOMAIN (optype);
7061 tree min_val = size_zero_node;
7062 if (type_domain && TYPE_MIN_VALUE (type_domain))
7063 min_val = TYPE_MIN_VALUE (type_domain);
7064 return build4_loc (loc, ARRAY_REF, type, op, min_val,
7065 NULL_TREE, NULL_TREE);
7067 /* *(foo *)&complexfoo => __real__ complexfoo */
7068 else if (TREE_CODE (optype) == COMPLEX_TYPE
7069 && (same_type_ignoring_top_level_qualifiers_p
7070 (type, TREE_TYPE (optype))))
7071 return fold_build1_loc (loc, REALPART_EXPR, type, op);
7072 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
7073 else if (TREE_CODE (optype) == VECTOR_TYPE
7074 && (same_type_ignoring_top_level_qualifiers_p
7075 (type, TREE_TYPE (optype))))
7077 tree part_width = TYPE_SIZE (type);
7078 tree index = bitsize_int (0);
7079 return fold_build3_loc (loc, BIT_FIELD_REF, type, op, part_width, index);
7081 /* Also handle conversion to an empty base class, which
7082 is represented with a NOP_EXPR. */
7083 else if (is_empty_class (type)
7084 && CLASS_TYPE_P (optype)
7085 && DERIVED_FROM_P (type, optype))
7090 /* *(foo *)&struct_with_foo_field => COMPONENT_REF */
7091 else if (RECORD_OR_UNION_TYPE_P (optype))
7093 tree field = TYPE_FIELDS (optype);
7094 for (; field; field = DECL_CHAIN (field))
7095 if (TREE_CODE (field) == FIELD_DECL
7096 && integer_zerop (byte_position (field))
7097 && (same_type_ignoring_top_level_qualifiers_p
7098 (TREE_TYPE (field), type)))
7100 return fold_build3 (COMPONENT_REF, type, op, field, NULL_TREE);
7105 else if (TREE_CODE (sub) == POINTER_PLUS_EXPR
7106 && TREE_CODE (TREE_OPERAND (sub, 1)) == INTEGER_CST)
7108 tree op00 = TREE_OPERAND (sub, 0);
7109 tree op01 = TREE_OPERAND (sub, 1);
7112 if (TREE_CODE (op00) == ADDR_EXPR)
7115 op00 = TREE_OPERAND (op00, 0);
7116 op00type = TREE_TYPE (op00);
7118 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
7119 if (TREE_CODE (op00type) == VECTOR_TYPE
7120 && (same_type_ignoring_top_level_qualifiers_p
7121 (type, TREE_TYPE (op00type))))
7123 HOST_WIDE_INT offset = tree_low_cst (op01, 0);
7124 tree part_width = TYPE_SIZE (type);
7125 unsigned HOST_WIDE_INT part_widthi = tree_low_cst (part_width, 0)/BITS_PER_UNIT;
7126 unsigned HOST_WIDE_INT indexi = offset * BITS_PER_UNIT;
7127 tree index = bitsize_int (indexi);
7129 if (offset/part_widthi <= TYPE_VECTOR_SUBPARTS (op00type))
7130 return fold_build3_loc (loc,
7131 BIT_FIELD_REF, type, op00,
7135 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
7136 else if (TREE_CODE (op00type) == COMPLEX_TYPE
7137 && (same_type_ignoring_top_level_qualifiers_p
7138 (type, TREE_TYPE (op00type))))
7140 tree size = TYPE_SIZE_UNIT (type);
7141 if (tree_int_cst_equal (size, op01))
7142 return fold_build1_loc (loc, IMAGPART_EXPR, type, op00);
7144 /* ((foo *)&fooarray)[1] => fooarray[1] */
7145 else if (TREE_CODE (op00type) == ARRAY_TYPE
7146 && (same_type_ignoring_top_level_qualifiers_p
7147 (type, TREE_TYPE (op00type))))
7149 tree type_domain = TYPE_DOMAIN (op00type);
7150 tree min_val = size_zero_node;
7151 if (type_domain && TYPE_MIN_VALUE (type_domain))
7152 min_val = TYPE_MIN_VALUE (type_domain);
7153 op01 = size_binop_loc (loc, EXACT_DIV_EXPR, op01,
7154 TYPE_SIZE_UNIT (type));
7155 op01 = size_binop_loc (loc, PLUS_EXPR, op01, min_val);
7156 return build4_loc (loc, ARRAY_REF, type, op00, op01,
7157 NULL_TREE, NULL_TREE);
7159 /* ((foo *)&struct_with_foo_field)[1] => COMPONENT_REF */
7160 else if (RECORD_OR_UNION_TYPE_P (op00type))
7162 tree field = TYPE_FIELDS (op00type);
7163 for (; field; field = DECL_CHAIN (field))
7164 if (TREE_CODE (field) == FIELD_DECL
7165 && tree_int_cst_equal (byte_position (field), op01)
7166 && (same_type_ignoring_top_level_qualifiers_p
7167 (TREE_TYPE (field), type)))
7169 return fold_build3 (COMPONENT_REF, type, op00,
7176 /* *(foo *)fooarrptreturn> (*fooarrptr)[0] */
7177 else if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
7178 && (same_type_ignoring_top_level_qualifiers_p
7179 (type, TREE_TYPE (TREE_TYPE (subtype)))))
7182 tree min_val = size_zero_node;
7183 sub = cxx_fold_indirect_ref (loc, TREE_TYPE (subtype), sub, NULL);
7185 sub = build1_loc (loc, INDIRECT_REF, TREE_TYPE (subtype), sub);
7186 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
7187 if (type_domain && TYPE_MIN_VALUE (type_domain))
7188 min_val = TYPE_MIN_VALUE (type_domain);
7189 return build4_loc (loc, ARRAY_REF, type, sub, min_val, NULL_TREE,
7197 cxx_eval_indirect_ref (const constexpr_call *call, tree t,
7198 bool allow_non_constant, bool addr,
7199 bool *non_constant_p)
7201 tree orig_op0 = TREE_OPERAND (t, 0);
7202 tree op0 = cxx_eval_constant_expression (call, orig_op0, allow_non_constant,
7203 /*addr*/false, non_constant_p);
7204 bool empty_base = false;
7207 /* Don't VERIFY_CONSTANT here. */
7208 if (*non_constant_p)
7211 r = cxx_fold_indirect_ref (EXPR_LOCATION (t), TREE_TYPE (t), op0,
7215 r = cxx_eval_constant_expression (call, r, allow_non_constant,
7216 addr, non_constant_p);
7221 if (TREE_CODE (sub) == ADDR_EXPR
7222 || TREE_CODE (sub) == POINTER_PLUS_EXPR)
7224 gcc_assert (!same_type_ignoring_top_level_qualifiers_p
7225 (TREE_TYPE (TREE_TYPE (sub)), TREE_TYPE (t)));
7226 /* DR 1188 says we don't have to deal with this. */
7227 if (!allow_non_constant)
7228 error ("accessing value of %qE through a %qT glvalue in a "
7229 "constant expression", build_fold_indirect_ref (sub),
7231 *non_constant_p = true;
7236 /* If we're pulling out the value of an empty base, make sure
7237 that the whole object is constant and then return an empty
7241 VERIFY_CONSTANT (r);
7242 r = build_constructor (TREE_TYPE (t), NULL);
7243 TREE_CONSTANT (r) = true;
7251 /* Complain about R, a VAR_DECL, not being usable in a constant expression.
7252 Shared between potential_constant_expression and
7253 cxx_eval_constant_expression. */
7256 non_const_var_error (tree r)
7258 tree type = TREE_TYPE (r);
7259 error ("the value of %qD is not usable in a constant "
7261 /* Avoid error cascade. */
7262 if (DECL_INITIAL (r) == error_mark_node)
7264 if (DECL_DECLARED_CONSTEXPR_P (r))
7265 inform (DECL_SOURCE_LOCATION (r),
7266 "%qD used in its own initializer", r);
7267 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type))
7269 if (!CP_TYPE_CONST_P (type))
7270 inform (DECL_SOURCE_LOCATION (r),
7271 "%q#D is not const", r);
7272 else if (CP_TYPE_VOLATILE_P (type))
7273 inform (DECL_SOURCE_LOCATION (r),
7274 "%q#D is volatile", r);
7275 else if (!DECL_INITIAL (r)
7276 || !TREE_CONSTANT (DECL_INITIAL (r)))
7277 inform (DECL_SOURCE_LOCATION (r),
7278 "%qD was not initialized with a constant "
7285 if (cxx_dialect >= cxx0x && !DECL_DECLARED_CONSTEXPR_P (r))
7286 inform (DECL_SOURCE_LOCATION (r),
7287 "%qD was not declared %<constexpr%>", r);
7289 inform (DECL_SOURCE_LOCATION (r),
7290 "%qD does not have integral or enumeration type",
7295 /* Attempt to reduce the expression T to a constant value.
7296 On failure, issue diagnostic and return error_mark_node. */
7297 /* FIXME unify with c_fully_fold */
7300 cxx_eval_constant_expression (const constexpr_call *call, tree t,
7301 bool allow_non_constant, bool addr,
7302 bool *non_constant_p)
7306 if (t == error_mark_node)
7308 *non_constant_p = true;
7311 if (CONSTANT_CLASS_P (t))
7313 if (TREE_CODE (t) == PTRMEM_CST)
7314 t = cplus_expand_constant (t);
7317 if (TREE_CODE (t) != NOP_EXPR
7318 && reduced_constant_expression_p (t))
7321 switch (TREE_CODE (t))
7326 /* else fall through. */
7328 r = integral_constant_value (t);
7329 if (TREE_CODE (r) == TARGET_EXPR
7330 && TREE_CODE (TARGET_EXPR_INITIAL (r)) == CONSTRUCTOR)
7331 r = TARGET_EXPR_INITIAL (r);
7334 if (!allow_non_constant)
7335 non_const_var_error (r);
7336 *non_constant_p = true;
7346 if (call && DECL_CONTEXT (t) == call->fundef->decl)
7348 if (DECL_ARTIFICIAL (t) && DECL_CONSTRUCTOR_P (DECL_CONTEXT (t)))
7350 if (!allow_non_constant)
7351 sorry ("use of the value of the object being constructed "
7352 "in a constant expression");
7353 *non_constant_p = true;
7356 r = lookup_parameter_binding (call, t);
7359 /* Defer in case this is only used for its type. */;
7362 if (!allow_non_constant)
7363 error ("%qE is not a constant expression", t);
7364 *non_constant_p = true;
7369 case AGGR_INIT_EXPR:
7370 r = cxx_eval_call_expression (call, t, allow_non_constant, addr,
7375 if (!literal_type_p (TREE_TYPE (t)))
7377 if (!allow_non_constant)
7379 error ("temporary of non-literal type %qT in a "
7380 "constant expression", TREE_TYPE (t));
7381 explain_non_literal_class (TREE_TYPE (t));
7383 *non_constant_p = true;
7386 /* else fall through. */
7388 /* Pass false for 'addr' because these codes indicate
7389 initialization of a temporary. */
7390 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
7391 allow_non_constant, false,
7393 if (!*non_constant_p)
7394 /* Adjust the type of the result to the type of the temporary. */
7395 r = adjust_temp_type (TREE_TYPE (t), r);
7399 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
7400 allow_non_constant, addr,
7405 case NON_LVALUE_EXPR:
7406 case TRY_CATCH_EXPR:
7407 case CLEANUP_POINT_EXPR:
7408 case MUST_NOT_THROW_EXPR:
7410 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
7411 allow_non_constant, addr,
7415 /* These differ from cxx_eval_unary_expression in that this doesn't
7416 check for a constant operand or result; an address can be
7417 constant without its operand being, and vice versa. */
7419 r = cxx_eval_indirect_ref (call, t, allow_non_constant, addr,
7425 tree oldop = TREE_OPERAND (t, 0);
7426 tree op = cxx_eval_constant_expression (call, oldop,
7430 /* Don't VERIFY_CONSTANT here. */
7431 if (*non_constant_p)
7433 /* This function does more aggressive folding than fold itself. */
7434 r = build_fold_addr_expr_with_type (op, TREE_TYPE (t));
7435 if (TREE_CODE (r) == ADDR_EXPR && TREE_OPERAND (r, 0) == oldop)
7443 case FIX_TRUNC_EXPR:
7448 case TRUTH_NOT_EXPR:
7449 case FIXED_CONVERT_EXPR:
7450 r = cxx_eval_unary_expression (call, t, allow_non_constant, addr,
7456 /* check_return_expr sometimes wraps a TARGET_EXPR in a
7457 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
7458 introduced by build_call_a. */
7459 tree op0 = TREE_OPERAND (t, 0);
7460 tree op1 = TREE_OPERAND (t, 1);
7462 if ((TREE_CODE (op0) == TARGET_EXPR && op1 == TARGET_EXPR_SLOT (op0))
7463 || TREE_CODE (op1) == EMPTY_CLASS_EXPR)
7464 r = cxx_eval_constant_expression (call, op0, allow_non_constant,
7465 addr, non_constant_p);
7468 /* Check that the LHS is constant and then discard it. */
7469 cxx_eval_constant_expression (call, op0, allow_non_constant,
7470 false, non_constant_p);
7471 r = cxx_eval_constant_expression (call, op1, allow_non_constant,
7472 addr, non_constant_p);
7477 case POINTER_PLUS_EXPR:
7481 case TRUNC_DIV_EXPR:
7483 case FLOOR_DIV_EXPR:
7484 case ROUND_DIV_EXPR:
7485 case TRUNC_MOD_EXPR:
7487 case ROUND_MOD_EXPR:
7489 case EXACT_DIV_EXPR:
7499 case TRUTH_XOR_EXPR:
7506 case UNORDERED_EXPR:
7515 r = cxx_eval_binary_expression (call, t, allow_non_constant, addr,
7519 /* fold can introduce non-IF versions of these; still treat them as
7520 short-circuiting. */
7521 case TRUTH_AND_EXPR:
7522 case TRUTH_ANDIF_EXPR:
7523 r = cxx_eval_logical_expression (call, t, boolean_false_node,
7525 allow_non_constant, addr,
7530 case TRUTH_ORIF_EXPR:
7531 r = cxx_eval_logical_expression (call, t, boolean_true_node,
7533 allow_non_constant, addr,
7538 r = cxx_eval_array_reference (call, t, allow_non_constant, addr,
7543 r = cxx_eval_component_reference (call, t, allow_non_constant, addr,
7548 r = cxx_eval_bit_field_ref (call, t, allow_non_constant, addr,
7554 r = cxx_eval_conditional_expression (call, t, allow_non_constant, addr,
7559 r = cxx_eval_bare_aggregate (call, t, allow_non_constant, addr,
7564 /* We can get this in a defaulted constructor for a class with a
7565 non-static data member of array type. Either the initializer will
7566 be NULL, meaning default-initialization, or it will be an lvalue
7567 or xvalue of the same type, meaning direct-initialization from the
7568 corresponding member. */
7569 r = cxx_eval_vec_init (call, t, allow_non_constant, addr,
7574 case VIEW_CONVERT_EXPR:
7577 tree oldop = TREE_OPERAND (t, 0);
7579 tree to = TREE_TYPE (t);
7580 tree source = TREE_TYPE (op);
7581 if (TYPE_PTR_P (source) && ARITHMETIC_TYPE_P (to)
7582 && !(TREE_CODE (op) == COMPONENT_REF
7583 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (op, 0)))))
7585 if (!allow_non_constant)
7586 error ("conversion of expression %qE of pointer type "
7587 "cannot yield a constant expression", op);
7588 *non_constant_p = true;
7591 op = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
7592 allow_non_constant, addr,
7594 if (*non_constant_p)
7597 /* We didn't fold at the top so we could check for ptr-int
7600 r = fold_build1 (TREE_CODE (t), to, op);
7601 /* Conversion of an out-of-range value has implementation-defined
7602 behavior; the language considers it different from arithmetic
7603 overflow, which is undefined. */
7604 if (TREE_OVERFLOW_P (r) && !TREE_OVERFLOW_P (op))
7605 TREE_OVERFLOW (r) = false;
7609 case EMPTY_CLASS_EXPR:
7610 /* This is good enough for a function argument that might not get
7611 used, and they can't do anything with it, so just return it. */
7615 case PREINCREMENT_EXPR:
7616 case POSTINCREMENT_EXPR:
7617 case PREDECREMENT_EXPR:
7618 case POSTDECREMENT_EXPR:
7622 case VEC_DELETE_EXPR:
7626 /* GCC internal stuff. */
7629 case WITH_CLEANUP_EXPR:
7630 case STATEMENT_LIST:
7632 case NON_DEPENDENT_EXPR:
7636 if (!allow_non_constant)
7637 error_at (EXPR_LOC_OR_HERE (t),
7638 "expression %qE is not a constant-expression", t);
7639 *non_constant_p = true;
7643 internal_error ("unexpected expression %qE of kind %s", t,
7644 tree_code_name[TREE_CODE (t)]);
7645 *non_constant_p = true;
7649 if (r == error_mark_node)
7650 *non_constant_p = true;
7652 if (*non_constant_p)
7659 cxx_eval_outermost_constant_expr (tree t, bool allow_non_constant)
7661 bool non_constant_p = false;
7662 tree r = cxx_eval_constant_expression (NULL, t, allow_non_constant,
7663 false, &non_constant_p);
7665 verify_constant (r, allow_non_constant, &non_constant_p);
7667 if (non_constant_p && !allow_non_constant)
7668 return error_mark_node;
7669 else if (non_constant_p && TREE_CONSTANT (t))
7671 /* This isn't actually constant, so unset TREE_CONSTANT. */
7672 if (EXPR_P (t) || TREE_CODE (t) == CONSTRUCTOR)
7675 r = build_nop (TREE_TYPE (t), t);
7676 TREE_CONSTANT (r) = false;
7679 else if (non_constant_p || r == t)
7681 else if (TREE_CODE (r) == CONSTRUCTOR && CLASS_TYPE_P (TREE_TYPE (r)))
7683 if (TREE_CODE (t) == TARGET_EXPR
7684 && TARGET_EXPR_INITIAL (t) == r)
7688 r = get_target_expr (r);
7689 TREE_CONSTANT (r) = true;
7697 /* Returns true if T is a valid subexpression of a constant expression,
7698 even if it isn't itself a constant expression. */
7701 is_sub_constant_expr (tree t)
7703 bool non_constant_p = false;
7704 cxx_eval_constant_expression (NULL, t, true, false, &non_constant_p);
7705 return !non_constant_p;
7708 /* If T represents a constant expression returns its reduced value.
7709 Otherwise return error_mark_node. If T is dependent, then
7713 cxx_constant_value (tree t)
7715 return cxx_eval_outermost_constant_expr (t, false);
7718 /* If T is a constant expression, returns its reduced value.
7719 Otherwise, if T does not have TREE_CONSTANT set, returns T.
7720 Otherwise, returns a version of T without TREE_CONSTANT. */
7723 maybe_constant_value (tree t)
7727 if (type_dependent_expression_p (t)
7728 || type_unknown_p (t)
7729 || BRACE_ENCLOSED_INITIALIZER_P (t)
7730 || !potential_constant_expression (t)
7731 || value_dependent_expression_p (t))
7733 if (TREE_OVERFLOW_P (t))
7735 t = build_nop (TREE_TYPE (t), t);
7736 TREE_CONSTANT (t) = false;
7741 r = cxx_eval_outermost_constant_expr (t, true);
7742 #ifdef ENABLE_CHECKING
7743 /* cp_tree_equal looks through NOPs, so allow them. */
7745 || CONVERT_EXPR_P (t)
7746 || (TREE_CONSTANT (t) && !TREE_CONSTANT (r))
7747 || !cp_tree_equal (r, t));
7752 /* Like maybe_constant_value, but returns a CONSTRUCTOR directly, rather
7753 than wrapped in a TARGET_EXPR. */
7756 maybe_constant_init (tree t)
7758 t = maybe_constant_value (t);
7759 if (TREE_CODE (t) == TARGET_EXPR)
7761 tree init = TARGET_EXPR_INITIAL (t);
7762 if (TREE_CODE (init) == CONSTRUCTOR
7763 && TREE_CONSTANT (init))
7770 /* FIXME see ADDR_EXPR section in potential_constant_expression_1. */
7771 /* Return true if the object referred to by REF has automatic or thread
7774 enum { ck_ok, ck_bad, ck_unknown };
7776 check_automatic_or_tls (tree ref)
7778 enum machine_mode mode;
7779 HOST_WIDE_INT bitsize, bitpos;
7781 int volatilep = 0, unsignedp = 0;
7782 tree decl = get_inner_reference (ref, &bitsize, &bitpos, &offset,
7783 &mode, &unsignedp, &volatilep, false);
7786 /* If there isn't a decl in the middle, we don't know the linkage here,
7787 and this isn't a constant expression anyway. */
7790 dk = decl_storage_duration (decl);
7791 return (dk == dk_auto || dk == dk_thread) ? ck_bad : ck_ok;
7795 /* Return true if T denotes a potentially constant expression. Issue
7796 diagnostic as appropriate under control of FLAGS. If WANT_RVAL is true,
7797 an lvalue-rvalue conversion is implied.
7799 C++0x [expr.const] used to say
7801 6 An expression is a potential constant expression if it is
7802 a constant expression where all occurences of function
7803 parameters are replaced by arbitrary constant expressions
7804 of the appropriate type.
7806 2 A conditional expression is a constant expression unless it
7807 involves one of the following as a potentially evaluated
7808 subexpression (3.2), but subexpressions of logical AND (5.14),
7809 logical OR (5.15), and conditional (5.16) operations that are
7810 not evaluated are not considered. */
7813 potential_constant_expression_1 (tree t, bool want_rval, tsubst_flags_t flags)
7815 enum { any = false, rval = true };
7819 /* C++98 has different rules for the form of a constant expression that
7820 are enforced in the parser, so we can assume that anything that gets
7821 this far is suitable. */
7822 if (cxx_dialect < cxx0x)
7825 if (t == error_mark_node)
7829 if (TREE_THIS_VOLATILE (t))
7831 if (flags & tf_error)
7832 error ("expression %qE has side-effects", t);
7835 if (CONSTANT_CLASS_P (t))
7837 if (TREE_OVERFLOW (t))
7839 if (flags & tf_error)
7841 permerror (EXPR_LOC_OR_HERE (t),
7842 "overflow in constant expression");
7843 if (flag_permissive)
7851 switch (TREE_CODE (t))
7857 case TEMPLATE_ID_EXPR:
7864 case TEMPLATE_PARM_INDEX:
7866 case IDENTIFIER_NODE:
7867 /* We can see a FIELD_DECL in a pointer-to-member expression. */
7873 case AGGR_INIT_EXPR:
7875 /* -- an invocation of a function other than a constexpr function
7876 or a constexpr constructor. */
7878 tree fun = get_function_named_in_call (t);
7879 const int nargs = call_expr_nargs (t);
7882 if (is_overloaded_fn (fun))
7884 if (TREE_CODE (fun) == FUNCTION_DECL)
7886 if (builtin_valid_in_constant_expr_p (fun))
7888 if (!DECL_DECLARED_CONSTEXPR_P (fun)
7889 /* Allow any built-in function; if the expansion
7890 isn't constant, we'll deal with that then. */
7891 && !is_builtin_fn (fun))
7893 if (flags & tf_error)
7895 error_at (EXPR_LOC_OR_HERE (t),
7896 "call to non-constexpr function %qD", fun);
7897 explain_invalid_constexpr_fn (fun);
7901 /* A call to a non-static member function takes the address
7902 of the object as the first argument. But in a constant
7903 expression the address will be folded away, so look
7905 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun)
7906 && !DECL_CONSTRUCTOR_P (fun))
7908 tree x = get_nth_callarg (t, 0);
7909 if (is_this_parameter (x))
7911 if (DECL_CONSTRUCTOR_P (DECL_CONTEXT (x)))
7913 if (flags & tf_error)
7914 sorry ("calling a member function of the "
7915 "object being constructed in a constant "
7919 /* Otherwise OK. */;
7921 else if (!potential_constant_expression_1 (x, rval, flags))
7927 fun = get_first_fn (fun);
7928 /* Skip initial arguments to base constructors. */
7929 if (DECL_BASE_CONSTRUCTOR_P (fun))
7930 i = num_artificial_parms_for (fun);
7931 fun = DECL_ORIGIN (fun);
7935 if (potential_constant_expression_1 (fun, rval, flags))
7936 /* Might end up being a constant function pointer. */;
7940 for (; i < nargs; ++i)
7942 tree x = get_nth_callarg (t, i);
7943 if (!potential_constant_expression_1 (x, rval, flags))
7949 case NON_LVALUE_EXPR:
7950 /* -- an lvalue-to-rvalue conversion (4.1) unless it is applied to
7951 -- an lvalue of integral type that refers to a non-volatile
7952 const variable or static data member initialized with
7953 constant expressions, or
7955 -- an lvalue of literal type that refers to non-volatile
7956 object defined with constexpr, or that refers to a
7957 sub-object of such an object; */
7958 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval, flags);
7961 if (want_rval && !decl_constant_var_p (t)
7962 && !dependent_type_p (TREE_TYPE (t)))
7964 if (flags & tf_error)
7965 non_const_var_error (t);
7972 case VIEW_CONVERT_EXPR:
7973 /* -- an array-to-pointer conversion that is applied to an lvalue
7974 that designates an object with thread or automatic storage
7975 duration; FIXME not implemented as it breaks constexpr arrays;
7976 need to fix the standard
7977 -- a type conversion from a pointer or pointer-to-member type
7978 to a literal type. */
7980 tree from = TREE_OPERAND (t, 0);
7981 tree source = TREE_TYPE (from);
7982 tree target = TREE_TYPE (t);
7983 if (TYPE_PTR_P (source) && ARITHMETIC_TYPE_P (target)
7984 && !(TREE_CODE (from) == COMPONENT_REF
7985 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (from, 0)))))
7987 if (flags & tf_error)
7988 error ("conversion of expression %qE of pointer type "
7989 "cannot yield a constant expression", from);
7992 return (potential_constant_expression_1
7993 (from, TREE_CODE (t) != VIEW_CONVERT_EXPR, flags));
7997 /* -- a unary operator & that is applied to an lvalue that
7998 designates an object with thread or automatic storage
8000 t = TREE_OPERAND (t, 0);
8002 /* FIXME adjust when issue 1197 is fully resolved. For now don't do
8003 any checking here, as we might dereference the pointer later. If
8004 we remove this code, also remove check_automatic_or_tls. */
8005 i = check_automatic_or_tls (t);
8010 if (flags & tf_error)
8011 error ("address-of an object %qE with thread local or "
8012 "automatic storage is not a constant expression", t);
8016 return potential_constant_expression_1 (t, any, flags);
8022 /* -- a class member access unless its postfix-expression is
8023 of literal type or of pointer to literal type. */
8024 /* This test would be redundant, as it follows from the
8025 postfix-expression being a potential constant expression. */
8026 return potential_constant_expression_1 (TREE_OPERAND (t, 0),
8029 case EXPR_PACK_EXPANSION:
8030 return potential_constant_expression_1 (PACK_EXPANSION_PATTERN (t),
8035 tree x = TREE_OPERAND (t, 0);
8037 if (is_this_parameter (x))
8039 if (want_rval && DECL_CONTEXT (x)
8040 && DECL_CONSTRUCTOR_P (DECL_CONTEXT (x)))
8042 if (flags & tf_error)
8043 sorry ("use of the value of the object being constructed "
8044 "in a constant expression");
8049 return potential_constant_expression_1 (x, rval, flags);
8053 case DYNAMIC_CAST_EXPR:
8054 case PSEUDO_DTOR_EXPR:
8055 case PREINCREMENT_EXPR:
8056 case POSTINCREMENT_EXPR:
8057 case PREDECREMENT_EXPR:
8058 case POSTDECREMENT_EXPR:
8062 case VEC_DELETE_EXPR:
8066 /* GCC internal stuff. */
8069 case WITH_CLEANUP_EXPR:
8070 case CLEANUP_POINT_EXPR:
8071 case MUST_NOT_THROW_EXPR:
8072 case TRY_CATCH_EXPR:
8073 case STATEMENT_LIST:
8074 /* Don't bother trying to define a subset of statement-expressions to
8075 be constant-expressions, at least for now. */
8079 if (flags & tf_error)
8080 error ("expression %qE is not a constant-expression", t);
8084 /* -- a typeid expression whose operand is of polymorphic
8087 tree e = TREE_OPERAND (t, 0);
8088 if (!TYPE_P (e) && !type_dependent_expression_p (e)
8089 && TYPE_POLYMORPHIC_P (TREE_TYPE (e)))
8091 if (flags & tf_error)
8092 error ("typeid-expression is not a constant expression "
8093 "because %qE is of polymorphic type", e);
8100 /* -- a subtraction where both operands are pointers. */
8101 if (TYPE_PTR_P (TREE_OPERAND (t, 0))
8102 && TYPE_PTR_P (TREE_OPERAND (t, 1)))
8104 if (flags & tf_error)
8105 error ("difference of two pointer expressions is not "
8106 "a constant expression");
8118 /* -- a relational or equality operator where at least
8119 one of the operands is a pointer. */
8120 if (TYPE_PTR_P (TREE_OPERAND (t, 0))
8121 || TYPE_PTR_P (TREE_OPERAND (t, 1)))
8123 if (flags & tf_error)
8124 error ("pointer comparison expression is not a "
8125 "constant expression");
8133 if (TYPE_P (TREE_OPERAND (t, 0)))
8135 /* else fall through. */
8141 case FIX_TRUNC_EXPR:
8145 case TRUTH_NOT_EXPR:
8146 case FIXED_CONVERT_EXPR:
8147 case UNARY_PLUS_EXPR:
8148 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval,
8152 case CONST_CAST_EXPR:
8153 case STATIC_CAST_EXPR:
8154 case REINTERPRET_CAST_EXPR:
8155 case IMPLICIT_CONV_EXPR:
8156 return (potential_constant_expression_1
8157 (TREE_OPERAND (t, 0),
8158 TREE_CODE (TREE_TYPE (t)) != REFERENCE_TYPE, flags));
8161 case NON_DEPENDENT_EXPR:
8162 /* For convenience. */
8164 return potential_constant_expression_1 (TREE_OPERAND (t, 0),
8168 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
8172 if (!literal_type_p (TREE_TYPE (t)))
8174 if (flags & tf_error)
8176 error ("temporary of non-literal type %qT in a "
8177 "constant expression", TREE_TYPE (t));
8178 explain_non_literal_class (TREE_TYPE (t));
8183 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
8188 VEC(constructor_elt, gc) *v = CONSTRUCTOR_ELTS (t);
8189 constructor_elt *ce;
8190 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
8191 if (!potential_constant_expression_1 (ce->value, want_rval, flags))
8198 gcc_assert (TREE_PURPOSE (t) == NULL_TREE
8199 || DECL_P (TREE_PURPOSE (t)));
8200 if (!potential_constant_expression_1 (TREE_VALUE (t), want_rval,
8203 if (TREE_CHAIN (t) == NULL_TREE)
8205 return potential_constant_expression_1 (TREE_CHAIN (t), want_rval,
8209 case TRUNC_DIV_EXPR:
8211 case FLOOR_DIV_EXPR:
8212 case ROUND_DIV_EXPR:
8213 case TRUNC_MOD_EXPR:
8215 case ROUND_MOD_EXPR:
8217 tree denom = TREE_OPERAND (t, 1);
8218 /* We can't call maybe_constant_value on an expression
8219 that hasn't been through fold_non_dependent_expr yet. */
8220 if (!processing_template_decl)
8221 denom = maybe_constant_value (denom);
8222 if (integer_zerop (denom))
8224 if (flags & tf_error)
8225 error ("division by zero is not a constant-expression");
8237 /* check_return_expr sometimes wraps a TARGET_EXPR in a
8238 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
8239 introduced by build_call_a. */
8240 tree op0 = TREE_OPERAND (t, 0);
8241 tree op1 = TREE_OPERAND (t, 1);
8243 if ((TREE_CODE (op0) == TARGET_EXPR && op1 == TARGET_EXPR_SLOT (op0))
8244 || TREE_CODE (op1) == EMPTY_CLASS_EXPR)
8245 return potential_constant_expression_1 (op0, want_rval, flags);
8250 /* If the first operand is the non-short-circuit constant, look at
8251 the second operand; otherwise we only care about the first one for
8253 case TRUTH_AND_EXPR:
8254 case TRUTH_ANDIF_EXPR:
8255 tmp = boolean_true_node;
8258 case TRUTH_ORIF_EXPR:
8259 tmp = boolean_false_node;
8261 if (TREE_OPERAND (t, 0) == tmp)
8262 return potential_constant_expression_1 (TREE_OPERAND (t, 1), rval, flags);
8264 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval, flags);
8268 case POINTER_PLUS_EXPR:
8270 case EXACT_DIV_EXPR:
8280 case TRUTH_XOR_EXPR:
8281 case UNORDERED_EXPR:
8293 case ARRAY_RANGE_REF:
8297 for (i = 0; i < 2; ++i)
8298 if (!potential_constant_expression_1 (TREE_OPERAND (t, i),
8304 for (i = 0; i < 3; ++i)
8305 if (!potential_constant_expression_1 (TREE_OPERAND (t, i),
8312 /* If the condition is a known constant, we know which of the legs we
8313 care about; otherwise we only require that the condition and
8314 either of the legs be potentially constant. */
8315 tmp = TREE_OPERAND (t, 0);
8316 if (!potential_constant_expression_1 (tmp, rval, flags))
8318 else if (integer_zerop (tmp))
8319 return potential_constant_expression_1 (TREE_OPERAND (t, 2),
8321 else if (TREE_CODE (tmp) == INTEGER_CST)
8322 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
8324 for (i = 1; i < 3; ++i)
8325 if (potential_constant_expression_1 (TREE_OPERAND (t, i),
8326 want_rval, tf_none))
8328 if (flags & tf_error)
8329 error ("expression %qE is not a constant-expression", t);
8333 if (VEC_INIT_EXPR_IS_CONSTEXPR (t))
8335 if (flags & tf_error)
8337 error ("non-constant array initialization");
8338 diagnose_non_constexpr_vec_init (t);
8343 sorry ("unexpected ast of kind %s", tree_code_name[TREE_CODE (t)]);
8349 /* The main entry point to the above. */
8352 potential_constant_expression (tree t)
8354 return potential_constant_expression_1 (t, false, tf_none);
8357 /* As above, but require a constant rvalue. */
8360 potential_rvalue_constant_expression (tree t)
8362 return potential_constant_expression_1 (t, true, tf_none);
8365 /* Like above, but complain about non-constant expressions. */
8368 require_potential_constant_expression (tree t)
8370 return potential_constant_expression_1 (t, false, tf_warning_or_error);
8373 /* Cross product of the above. */
8376 require_potential_rvalue_constant_expression (tree t)
8378 return potential_constant_expression_1 (t, true, tf_warning_or_error);
8381 /* Constructor for a lambda expression. */
8384 build_lambda_expr (void)
8386 tree lambda = make_node (LAMBDA_EXPR);
8387 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) = CPLD_NONE;
8388 LAMBDA_EXPR_CAPTURE_LIST (lambda) = NULL_TREE;
8389 LAMBDA_EXPR_THIS_CAPTURE (lambda) = NULL_TREE;
8390 LAMBDA_EXPR_PENDING_PROXIES (lambda) = NULL;
8391 LAMBDA_EXPR_RETURN_TYPE (lambda) = NULL_TREE;
8392 LAMBDA_EXPR_MUTABLE_P (lambda) = false;
8396 /* Create the closure object for a LAMBDA_EXPR. */
8399 build_lambda_object (tree lambda_expr)
8401 /* Build aggregate constructor call.
8402 - cp_parser_braced_list
8403 - cp_parser_functional_cast */
8404 VEC(constructor_elt,gc) *elts = NULL;
8405 tree node, expr, type;
8406 location_t saved_loc;
8408 if (processing_template_decl)
8411 /* Make sure any error messages refer to the lambda-introducer. */
8412 saved_loc = input_location;
8413 input_location = LAMBDA_EXPR_LOCATION (lambda_expr);
8415 for (node = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr);
8417 node = TREE_CHAIN (node))
8419 tree field = TREE_PURPOSE (node);
8420 tree val = TREE_VALUE (node);
8422 if (field == error_mark_node)
8424 expr = error_mark_node;
8431 /* Mere mortals can't copy arrays with aggregate initialization, so
8432 do some magic to make it work here. */
8433 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE)
8434 val = build_array_copy (val);
8435 else if (DECL_NORMAL_CAPTURE_P (field)
8436 && TREE_CODE (TREE_TYPE (field)) != REFERENCE_TYPE)
8438 /* "the entities that are captured by copy are used to
8439 direct-initialize each corresponding non-static data
8440 member of the resulting closure object."
8442 There's normally no way to express direct-initialization
8443 from an element of a CONSTRUCTOR, so we build up a special
8444 TARGET_EXPR to bypass the usual copy-initialization. */
8445 val = force_rvalue (val, tf_warning_or_error);
8446 if (TREE_CODE (val) == TARGET_EXPR)
8447 TARGET_EXPR_DIRECT_INIT_P (val) = true;
8450 CONSTRUCTOR_APPEND_ELT (elts, DECL_NAME (field), val);
8453 expr = build_constructor (init_list_type_node, elts);
8454 CONSTRUCTOR_IS_DIRECT_INIT (expr) = 1;
8456 /* N2927: "[The closure] class type is not an aggregate."
8457 But we briefly treat it as an aggregate to make this simpler. */
8458 type = LAMBDA_EXPR_CLOSURE (lambda_expr);
8459 CLASSTYPE_NON_AGGREGATE (type) = 0;
8460 expr = finish_compound_literal (type, expr, tf_warning_or_error);
8461 CLASSTYPE_NON_AGGREGATE (type) = 1;
8464 input_location = saved_loc;
8468 /* Return an initialized RECORD_TYPE for LAMBDA.
8469 LAMBDA must have its explicit captures already. */
8472 begin_lambda_type (tree lambda)
8477 /* Unique name. This is just like an unnamed class, but we cannot use
8478 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
8480 name = make_lambda_name ();
8482 /* Create the new RECORD_TYPE for this lambda. */
8483 type = xref_tag (/*tag_code=*/record_type,
8485 /*scope=*/ts_within_enclosing_non_class,
8486 /*template_header_p=*/false);
8489 /* Designate it as a struct so that we can use aggregate initialization. */
8490 CLASSTYPE_DECLARED_CLASS (type) = false;
8492 /* Clear base types. */
8493 xref_basetypes (type, /*bases=*/NULL_TREE);
8495 /* Start the class. */
8496 type = begin_class_definition (type, /*attributes=*/NULL_TREE);
8498 /* Cross-reference the expression and the type. */
8499 LAMBDA_EXPR_CLOSURE (lambda) = type;
8500 CLASSTYPE_LAMBDA_EXPR (type) = lambda;
8505 /* Returns the type to use for the return type of the operator() of a
8509 lambda_return_type (tree expr)
8512 if (type_unknown_p (expr)
8513 || BRACE_ENCLOSED_INITIALIZER_P (expr))
8515 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
8516 return void_type_node;
8518 if (type_dependent_expression_p (expr))
8519 type = dependent_lambda_return_type_node;
8521 type = cv_unqualified (type_decays_to (unlowered_expr_type (expr)));
8525 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
8529 lambda_function (tree lambda)
8532 if (TREE_CODE (lambda) == LAMBDA_EXPR)
8533 type = LAMBDA_EXPR_CLOSURE (lambda);
8536 gcc_assert (LAMBDA_TYPE_P (type));
8537 /* Don't let debug_tree cause instantiation. */
8538 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type)
8539 && !COMPLETE_OR_OPEN_TYPE_P (type))
8541 lambda = lookup_member (type, ansi_opname (CALL_EXPR),
8542 /*protect=*/0, /*want_type=*/false);
8544 lambda = BASELINK_FUNCTIONS (lambda);
8548 /* Returns the type to use for the FIELD_DECL corresponding to the
8550 The caller should add REFERENCE_TYPE for capture by reference. */
8553 lambda_capture_field_type (tree expr)
8556 if (type_dependent_expression_p (expr))
8558 type = cxx_make_type (DECLTYPE_TYPE);
8559 DECLTYPE_TYPE_EXPR (type) = expr;
8560 DECLTYPE_FOR_LAMBDA_CAPTURE (type) = true;
8561 SET_TYPE_STRUCTURAL_EQUALITY (type);
8564 type = non_reference (unlowered_expr_type (expr));
8568 /* Recompute the return type for LAMBDA with body of the form:
8569 { return EXPR ; } */
8572 apply_lambda_return_type (tree lambda, tree return_type)
8574 tree fco = lambda_function (lambda);
8577 LAMBDA_EXPR_RETURN_TYPE (lambda) = return_type;
8579 if (return_type == error_mark_node)
8581 if (TREE_TYPE (TREE_TYPE (fco)) == return_type)
8584 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
8585 TREE_TYPE (METHOD_TYPE) == return-type */
8586 TREE_TYPE (fco) = change_return_type (return_type, TREE_TYPE (fco));
8588 result = DECL_RESULT (fco);
8589 if (result == NULL_TREE)
8592 /* We already have a DECL_RESULT from start_preparsed_function.
8593 Now we need to redo the work it and allocate_struct_function
8594 did to reflect the new type. */
8595 gcc_assert (current_function_decl == fco);
8596 result = build_decl (input_location, RESULT_DECL, NULL_TREE,
8597 TYPE_MAIN_VARIANT (return_type));
8598 DECL_ARTIFICIAL (result) = 1;
8599 DECL_IGNORED_P (result) = 1;
8600 cp_apply_type_quals_to_decl (cp_type_quals (return_type),
8603 DECL_RESULT (fco) = result;
8605 if (!processing_template_decl && aggregate_value_p (result, fco))
8607 #ifdef PCC_STATIC_STRUCT_RETURN
8608 cfun->returns_pcc_struct = 1;
8610 cfun->returns_struct = 1;
8615 /* DECL is a local variable or parameter from the surrounding scope of a
8616 lambda-expression. Returns the decltype for a use of the capture field
8617 for DECL even if it hasn't been captured yet. */
8620 capture_decltype (tree decl)
8622 tree lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
8623 /* FIXME do lookup instead of list walk? */
8624 tree cap = value_member (decl, LAMBDA_EXPR_CAPTURE_LIST (lam));
8628 type = TREE_TYPE (TREE_PURPOSE (cap));
8630 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam))
8633 error ("%qD is not captured", decl);
8634 return error_mark_node;
8637 type = TREE_TYPE (decl);
8638 if (TREE_CODE (type) == REFERENCE_TYPE
8639 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
8640 type = TREE_TYPE (type);
8643 case CPLD_REFERENCE:
8644 type = TREE_TYPE (decl);
8645 if (TREE_CODE (type) != REFERENCE_TYPE)
8646 type = build_reference_type (TREE_TYPE (decl));
8653 if (TREE_CODE (type) != REFERENCE_TYPE)
8655 if (!LAMBDA_EXPR_MUTABLE_P (lam))
8656 type = cp_build_qualified_type (type, (cp_type_quals (type)
8658 type = build_reference_type (type);
8663 /* Returns true iff DECL is a lambda capture proxy variable created by
8664 build_capture_proxy. */
8667 is_capture_proxy (tree decl)
8669 return (TREE_CODE (decl) == VAR_DECL
8670 && DECL_HAS_VALUE_EXPR_P (decl)
8671 && !DECL_ANON_UNION_VAR_P (decl)
8672 && LAMBDA_FUNCTION_P (DECL_CONTEXT (decl)));
8675 /* Returns true iff DECL is a capture proxy for a normal capture
8676 (i.e. without explicit initializer). */
8679 is_normal_capture_proxy (tree decl)
8683 if (!is_capture_proxy (decl))
8684 /* It's not a capture proxy. */
8687 /* It is a capture proxy, is it a normal capture? */
8688 val = DECL_VALUE_EXPR (decl);
8689 gcc_assert (TREE_CODE (val) == COMPONENT_REF);
8690 val = TREE_OPERAND (val, 1);
8691 return DECL_NORMAL_CAPTURE_P (val);
8694 /* VAR is a capture proxy created by build_capture_proxy; add it to the
8695 current function, which is the operator() for the appropriate lambda. */
8698 insert_capture_proxy (tree var)
8700 cp_binding_level *b;
8704 /* Put the capture proxy in the extra body block so that it won't clash
8705 with a later local variable. */
8706 b = current_binding_level;
8707 for (skip = 0; ; ++skip)
8709 cp_binding_level *n = b->level_chain;
8710 if (n->kind == sk_function_parms)
8714 pushdecl_with_scope (var, b, false);
8716 /* And put a DECL_EXPR in the STATEMENT_LIST for the same block. */
8717 var = build_stmt (DECL_SOURCE_LOCATION (var), DECL_EXPR, var);
8718 stmt_list = VEC_index (tree, stmt_list_stack,
8719 VEC_length (tree, stmt_list_stack) - 1 - skip);
8720 gcc_assert (stmt_list);
8721 append_to_statement_list_force (var, &stmt_list);
8724 /* We've just finished processing a lambda; if the containing scope is also
8725 a lambda, insert any capture proxies that were created while processing
8726 the nested lambda. */
8729 insert_pending_capture_proxies (void)
8732 VEC(tree,gc) *proxies;
8735 if (!current_function_decl || !LAMBDA_FUNCTION_P (current_function_decl))
8738 lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
8739 proxies = LAMBDA_EXPR_PENDING_PROXIES (lam);
8740 for (i = 0; i < VEC_length (tree, proxies); ++i)
8742 tree var = VEC_index (tree, proxies, i);
8743 insert_capture_proxy (var);
8745 release_tree_vector (LAMBDA_EXPR_PENDING_PROXIES (lam));
8746 LAMBDA_EXPR_PENDING_PROXIES (lam) = NULL;
8749 /* Given REF, a COMPONENT_REF designating a field in the lambda closure,
8750 return the type we want the proxy to have: the type of the field itself,
8751 with added const-qualification if the lambda isn't mutable and the
8752 capture is by value. */
8755 lambda_proxy_type (tree ref)
8758 if (REFERENCE_REF_P (ref))
8759 ref = TREE_OPERAND (ref, 0);
8760 type = TREE_TYPE (ref);
8761 if (!dependent_type_p (type))
8763 type = cxx_make_type (DECLTYPE_TYPE);
8764 DECLTYPE_TYPE_EXPR (type) = ref;
8765 DECLTYPE_FOR_LAMBDA_PROXY (type) = true;
8766 SET_TYPE_STRUCTURAL_EQUALITY (type);
8770 /* MEMBER is a capture field in a lambda closure class. Now that we're
8771 inside the operator(), build a placeholder var for future lookups and
8775 build_capture_proxy (tree member)
8777 tree var, object, fn, closure, name, lam, type;
8779 closure = DECL_CONTEXT (member);
8780 fn = lambda_function (closure);
8781 lam = CLASSTYPE_LAMBDA_EXPR (closure);
8783 /* The proxy variable forwards to the capture field. */
8784 object = build_fold_indirect_ref (DECL_ARGUMENTS (fn));
8785 object = finish_non_static_data_member (member, object, NULL_TREE);
8786 if (REFERENCE_REF_P (object))
8787 object = TREE_OPERAND (object, 0);
8789 /* Remove the __ inserted by add_capture. */
8790 name = get_identifier (IDENTIFIER_POINTER (DECL_NAME (member)) + 2);
8792 type = lambda_proxy_type (object);
8793 var = build_decl (input_location, VAR_DECL, name, type);
8794 SET_DECL_VALUE_EXPR (var, object);
8795 DECL_HAS_VALUE_EXPR_P (var) = 1;
8796 DECL_ARTIFICIAL (var) = 1;
8797 TREE_USED (var) = 1;
8798 DECL_CONTEXT (var) = fn;
8800 if (name == this_identifier)
8802 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (lam) == member);
8803 LAMBDA_EXPR_THIS_CAPTURE (lam) = var;
8806 if (fn == current_function_decl)
8807 insert_capture_proxy (var);
8809 VEC_safe_push (tree, gc, LAMBDA_EXPR_PENDING_PROXIES (lam), var);
8814 /* From an ID and INITIALIZER, create a capture (by reference if
8815 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
8819 add_capture (tree lambda, tree id, tree initializer, bool by_reference_p,
8820 bool explicit_init_p)
8823 tree type, member, name;
8825 type = lambda_capture_field_type (initializer);
8828 type = build_reference_type (type);
8829 if (!real_lvalue_p (initializer))
8830 error ("cannot capture %qE by reference", initializer);
8833 /* Capture by copy requires a complete type. */
8834 type = complete_type (type);
8836 /* Add __ to the beginning of the field name so that user code
8837 won't find the field with name lookup. We can't just leave the name
8838 unset because template instantiation uses the name to find
8839 instantiated fields. */
8840 buf = (char *) alloca (IDENTIFIER_LENGTH (id) + 3);
8841 buf[1] = buf[0] = '_';
8842 memcpy (buf + 2, IDENTIFIER_POINTER (id),
8843 IDENTIFIER_LENGTH (id) + 1);
8844 name = get_identifier (buf);
8846 /* If TREE_TYPE isn't set, we're still in the introducer, so check
8848 if (!LAMBDA_EXPR_CLOSURE (lambda))
8850 if (IDENTIFIER_MARKED (name))
8852 pedwarn (input_location, 0,
8853 "already captured %qD in lambda expression", id);
8856 IDENTIFIER_MARKED (name) = true;
8859 /* Make member variable. */
8860 member = build_lang_decl (FIELD_DECL, name, type);
8862 if (!explicit_init_p)
8863 /* Normal captures are invisible to name lookup but uses are replaced
8864 with references to the capture field; we implement this by only
8865 really making them invisible in unevaluated context; see
8866 qualify_lookup. For now, let's make explicitly initialized captures
8868 DECL_NORMAL_CAPTURE_P (member) = true;
8870 if (id == this_identifier)
8871 LAMBDA_EXPR_THIS_CAPTURE (lambda) = member;
8873 /* Add it to the appropriate closure class if we've started it. */
8874 if (current_class_type
8875 && current_class_type == LAMBDA_EXPR_CLOSURE (lambda))
8876 finish_member_declaration (member);
8878 LAMBDA_EXPR_CAPTURE_LIST (lambda)
8879 = tree_cons (member, initializer, LAMBDA_EXPR_CAPTURE_LIST (lambda));
8881 if (LAMBDA_EXPR_CLOSURE (lambda))
8882 return build_capture_proxy (member);
8883 /* For explicit captures we haven't started the function yet, so we wait
8884 and build the proxy from cp_parser_lambda_body. */
8888 /* Register all the capture members on the list CAPTURES, which is the
8889 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
8892 register_capture_members (tree captures)
8894 if (captures == NULL_TREE)
8897 register_capture_members (TREE_CHAIN (captures));
8898 /* We set this in add_capture to avoid duplicates. */
8899 IDENTIFIER_MARKED (DECL_NAME (TREE_PURPOSE (captures))) = false;
8900 finish_member_declaration (TREE_PURPOSE (captures));
8903 /* Similar to add_capture, except this works on a stack of nested lambdas.
8904 BY_REFERENCE_P in this case is derived from the default capture mode.
8905 Returns the capture for the lambda at the bottom of the stack. */
8908 add_default_capture (tree lambda_stack, tree id, tree initializer)
8910 bool this_capture_p = (id == this_identifier);
8912 tree var = NULL_TREE;
8914 tree saved_class_type = current_class_type;
8918 for (node = lambda_stack;
8920 node = TREE_CHAIN (node))
8922 tree lambda = TREE_VALUE (node);
8924 current_class_type = LAMBDA_EXPR_CLOSURE (lambda);
8925 var = add_capture (lambda,
8930 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda)
8931 == CPLD_REFERENCE)),
8932 /*explicit_init_p=*/false);
8933 initializer = convert_from_reference (var);
8936 current_class_type = saved_class_type;
8941 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
8942 INDIRECT_REF, possibly adding it through default capturing. */
8945 lambda_expr_this_capture (tree lambda)
8949 tree this_capture = LAMBDA_EXPR_THIS_CAPTURE (lambda);
8951 /* Try to default capture 'this' if we can. */
8953 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) != CPLD_NONE)
8955 tree containing_function = TYPE_CONTEXT (LAMBDA_EXPR_CLOSURE (lambda));
8956 tree lambda_stack = tree_cons (NULL_TREE, lambda, NULL_TREE);
8957 tree init = NULL_TREE;
8959 /* If we are in a lambda function, we can move out until we hit:
8960 1. a non-lambda function,
8961 2. a lambda function capturing 'this', or
8962 3. a non-default capturing lambda function. */
8963 while (LAMBDA_FUNCTION_P (containing_function))
8966 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function));
8968 if (LAMBDA_EXPR_THIS_CAPTURE (lambda))
8970 /* An outer lambda has already captured 'this'. */
8971 init = LAMBDA_EXPR_THIS_CAPTURE (lambda);
8975 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) == CPLD_NONE)
8976 /* An outer lambda won't let us capture 'this'. */
8979 lambda_stack = tree_cons (NULL_TREE,
8983 containing_function = decl_function_context (containing_function);
8986 if (!init && DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function)
8987 && !LAMBDA_FUNCTION_P (containing_function))
8988 /* First parameter is 'this'. */
8989 init = DECL_ARGUMENTS (containing_function);
8992 this_capture = add_default_capture (lambda_stack,
8993 /*id=*/this_identifier,
8999 error ("%<this%> was not captured for this lambda function");
9000 result = error_mark_node;
9004 /* To make sure that current_class_ref is for the lambda. */
9005 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref))
9006 == LAMBDA_EXPR_CLOSURE (lambda));
9008 result = this_capture;
9010 /* If 'this' is captured, each use of 'this' is transformed into an
9011 access to the corresponding unnamed data member of the closure
9012 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
9013 ensures that the transformed expression is an rvalue. ] */
9014 result = rvalue (result);
9020 /* Returns the method basetype of the innermost non-lambda function, or
9021 NULL_TREE if none. */
9024 nonlambda_method_basetype (void)
9027 if (!current_class_ref)
9030 type = current_class_type;
9031 if (!LAMBDA_TYPE_P (type))
9034 /* Find the nearest enclosing non-lambda function. */
9035 fn = TYPE_NAME (type);
9037 fn = decl_function_context (fn);
9038 while (fn && LAMBDA_FUNCTION_P (fn));
9040 if (!fn || !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
9043 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn));
9046 /* If the closure TYPE has a static op(), also add a conversion to function
9050 maybe_add_lambda_conv_op (tree type)
9052 bool nested = (current_function_decl != NULL_TREE);
9053 tree callop = lambda_function (type);
9054 tree rettype, name, fntype, fn, body, compound_stmt;
9055 tree thistype, stattype, statfn, convfn, call, arg;
9056 VEC (tree, gc) *argvec;
9058 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type)) != NULL_TREE)
9061 if (processing_template_decl)
9064 stattype = build_function_type (TREE_TYPE (TREE_TYPE (callop)),
9065 FUNCTION_ARG_CHAIN (callop));
9067 /* First build up the conversion op. */
9069 rettype = build_pointer_type (stattype);
9070 name = mangle_conv_op_name_for_type (rettype);
9071 thistype = cp_build_qualified_type (type, TYPE_QUAL_CONST);
9072 fntype = build_method_type_directly (thistype, rettype, void_list_node);
9073 fn = convfn = build_lang_decl (FUNCTION_DECL, name, fntype);
9074 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
9076 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
9077 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
9078 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
9080 SET_OVERLOADED_OPERATOR_CODE (fn, TYPE_EXPR);
9081 grokclassfn (type, fn, NO_SPECIAL);
9082 set_linkage_according_to_type (type, fn);
9083 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
9084 DECL_IN_AGGR_P (fn) = 1;
9085 DECL_ARTIFICIAL (fn) = 1;
9086 DECL_NOT_REALLY_EXTERN (fn) = 1;
9087 DECL_DECLARED_INLINE_P (fn) = 1;
9088 DECL_ARGUMENTS (fn) = build_this_parm (fntype, TYPE_QUAL_CONST);
9090 DECL_INTERFACE_KNOWN (fn) = 1;
9092 add_method (type, fn, NULL_TREE);
9094 /* Generic thunk code fails for varargs; we'll complain in mark_used if
9095 the conversion op is used. */
9096 if (varargs_function_p (callop))
9098 DECL_DELETED_FN (fn) = 1;
9102 /* Now build up the thunk to be returned. */
9104 name = get_identifier ("_FUN");
9105 fn = statfn = build_lang_decl (FUNCTION_DECL, name, stattype);
9106 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
9107 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
9108 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
9109 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
9110 grokclassfn (type, fn, NO_SPECIAL);
9111 set_linkage_according_to_type (type, fn);
9112 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
9113 DECL_IN_AGGR_P (fn) = 1;
9114 DECL_ARTIFICIAL (fn) = 1;
9115 DECL_NOT_REALLY_EXTERN (fn) = 1;
9116 DECL_DECLARED_INLINE_P (fn) = 1;
9117 DECL_STATIC_FUNCTION_P (fn) = 1;
9118 DECL_ARGUMENTS (fn) = copy_list (DECL_CHAIN (DECL_ARGUMENTS (callop)));
9119 for (arg = DECL_ARGUMENTS (fn); arg; arg = DECL_CHAIN (arg))
9120 DECL_CONTEXT (arg) = fn;
9122 DECL_INTERFACE_KNOWN (fn) = 1;
9124 add_method (type, fn, NULL_TREE);
9127 push_function_context ();
9129 /* Still increment function_depth so that we don't GC in the
9130 middle of an expression. */
9133 /* Generate the body of the thunk. */
9135 start_preparsed_function (statfn, NULL_TREE,
9136 SF_PRE_PARSED | SF_INCLASS_INLINE);
9137 if (DECL_ONE_ONLY (statfn))
9139 /* Put the thunk in the same comdat group as the call op. */
9140 cgraph_add_to_same_comdat_group (cgraph_get_create_node (statfn),
9141 cgraph_get_create_node (callop));
9143 body = begin_function_body ();
9144 compound_stmt = begin_compound_stmt (0);
9146 arg = build1 (NOP_EXPR, TREE_TYPE (DECL_ARGUMENTS (callop)),
9148 argvec = make_tree_vector ();
9149 VEC_quick_push (tree, argvec, arg);
9150 for (arg = DECL_ARGUMENTS (statfn); arg; arg = DECL_CHAIN (arg))
9152 mark_exp_read (arg);
9153 VEC_safe_push (tree, gc, argvec, arg);
9155 call = build_call_a (callop, VEC_length (tree, argvec),
9156 VEC_address (tree, argvec));
9157 CALL_FROM_THUNK_P (call) = 1;
9158 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call)))
9159 call = build_cplus_new (TREE_TYPE (call), call, tf_warning_or_error);
9160 call = convert_from_reference (call);
9161 finish_return_stmt (call);
9163 finish_compound_stmt (compound_stmt);
9164 finish_function_body (body);
9166 expand_or_defer_fn (finish_function (2));
9168 /* Generate the body of the conversion op. */
9170 start_preparsed_function (convfn, NULL_TREE,
9171 SF_PRE_PARSED | SF_INCLASS_INLINE);
9172 body = begin_function_body ();
9173 compound_stmt = begin_compound_stmt (0);
9175 finish_return_stmt (decay_conversion (statfn));
9177 finish_compound_stmt (compound_stmt);
9178 finish_function_body (body);
9180 expand_or_defer_fn (finish_function (2));
9183 pop_function_context ();
9188 /* Returns true iff VAL is a lambda-related declaration which should
9189 be ignored by unqualified lookup. */
9192 is_lambda_ignored_entity (tree val)
9194 /* In unevaluated context, look past normal capture proxies. */
9195 if (cp_unevaluated_operand && is_normal_capture_proxy (val))
9198 /* Always ignore lambda fields, their names are only for debugging. */
9199 if (TREE_CODE (val) == FIELD_DECL
9200 && CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (val)))
9203 /* None of the lookups that use qualify_lookup want the op() from the
9204 lambda; they want the one from the enclosing class. */
9205 if (TREE_CODE (val) == FUNCTION_DECL && LAMBDA_FUNCTION_P (val))
9211 #include "gt-cp-semantics.h"