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-2013 Free Software Foundation, Inc.
7 Written by Mark Mitchell (mmitchell@usa.net) based on code found
8 formerly in parse.y and pt.c.
10 This file is part of GCC.
12 GCC is free software; you can redistribute it and/or modify it
13 under the terms of the GNU General Public License as published by
14 the Free Software Foundation; either version 3, or (at your option)
17 GCC is distributed in the hope that it will be useful, but
18 WITHOUT ANY WARRANTY; without even the implied warranty of
19 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
20 General Public License for more details.
22 You should have received a copy of the GNU General Public License
23 along with GCC; see the file COPYING3. If not see
24 <http://www.gnu.org/licenses/>. */
28 #include "coretypes.h"
32 #include "c-family/c-common.h"
33 #include "c-family/c-objc.h"
34 #include "tree-inline.h"
39 #include "diagnostic.h"
41 #include "tree-iterator.h"
46 #include "hash-table.h"
48 static bool verify_constant (tree, bool, bool *, bool *);
49 #define VERIFY_CONSTANT(X) \
51 if (verify_constant ((X), allow_non_constant, non_constant_p, overflow_p)) \
55 /* There routines provide a modular interface to perform many parsing
56 operations. They may therefore be used during actual parsing, or
57 during template instantiation, which may be regarded as a
58 degenerate form of parsing. */
60 static tree maybe_convert_cond (tree);
61 static tree finalize_nrv_r (tree *, int *, void *);
62 static tree capture_decltype (tree);
65 /* Deferred Access Checking Overview
66 ---------------------------------
68 Most C++ expressions and declarations require access checking
69 to be performed during parsing. However, in several cases,
70 this has to be treated differently.
72 For member declarations, access checking has to be deferred
73 until more information about the declaration is known. For
85 When we are parsing the function return type `A::X', we don't
86 really know if this is allowed until we parse the function name.
88 Furthermore, some contexts require that access checking is
89 never performed at all. These include class heads, and template
92 Typical use of access checking functions is described here:
94 1. When we enter a context that requires certain access checking
95 mode, the function `push_deferring_access_checks' is called with
96 DEFERRING argument specifying the desired mode. Access checking
97 may be performed immediately (dk_no_deferred), deferred
98 (dk_deferred), or not performed (dk_no_check).
100 2. When a declaration such as a type, or a variable, is encountered,
101 the function `perform_or_defer_access_check' is called. It
102 maintains a vector of all deferred checks.
104 3. The global `current_class_type' or `current_function_decl' is then
105 setup by the parser. `enforce_access' relies on these information
108 4. Upon exiting the context mentioned in step 1,
109 `perform_deferred_access_checks' is called to check all declaration
110 stored in the vector. `pop_deferring_access_checks' is then
111 called to restore the previous access checking mode.
113 In case of parsing error, we simply call `pop_deferring_access_checks'
114 without `perform_deferred_access_checks'. */
116 typedef struct GTY(()) deferred_access {
117 /* A vector representing name-lookups for which we have deferred
118 checking access controls. We cannot check the accessibility of
119 names used in a decl-specifier-seq until we know what is being
120 declared because code like:
127 A::B* A::f() { return 0; }
129 is valid, even though `A::B' is not generally accessible. */
130 vec<deferred_access_check, va_gc> * GTY(()) deferred_access_checks;
132 /* The current mode of access checks. */
133 enum deferring_kind deferring_access_checks_kind;
137 /* Data for deferred access checking. */
138 static GTY(()) vec<deferred_access, va_gc> *deferred_access_stack;
139 static GTY(()) unsigned deferred_access_no_check;
141 /* Save the current deferred access states and start deferred
142 access checking iff DEFER_P is true. */
145 push_deferring_access_checks (deferring_kind deferring)
147 /* For context like template instantiation, access checking
148 disabling applies to all nested context. */
149 if (deferred_access_no_check || deferring == dk_no_check)
150 deferred_access_no_check++;
153 deferred_access e = {NULL, deferring};
154 vec_safe_push (deferred_access_stack, e);
158 /* Resume deferring access checks again after we stopped doing
162 resume_deferring_access_checks (void)
164 if (!deferred_access_no_check)
165 deferred_access_stack->last().deferring_access_checks_kind = dk_deferred;
168 /* Stop deferring access checks. */
171 stop_deferring_access_checks (void)
173 if (!deferred_access_no_check)
174 deferred_access_stack->last().deferring_access_checks_kind = dk_no_deferred;
177 /* Discard the current deferred access checks and restore the
181 pop_deferring_access_checks (void)
183 if (deferred_access_no_check)
184 deferred_access_no_check--;
186 deferred_access_stack->pop ();
189 /* Returns a TREE_LIST representing the deferred checks.
190 The TREE_PURPOSE of each node is the type through which the
191 access occurred; the TREE_VALUE is the declaration named.
194 vec<deferred_access_check, va_gc> *
195 get_deferred_access_checks (void)
197 if (deferred_access_no_check)
200 return (deferred_access_stack->last().deferred_access_checks);
203 /* Take current deferred checks and combine with the
204 previous states if we also defer checks previously.
205 Otherwise perform checks now. */
208 pop_to_parent_deferring_access_checks (void)
210 if (deferred_access_no_check)
211 deferred_access_no_check--;
214 vec<deferred_access_check, va_gc> *checks;
215 deferred_access *ptr;
217 checks = (deferred_access_stack->last ().deferred_access_checks);
219 deferred_access_stack->pop ();
220 ptr = &deferred_access_stack->last ();
221 if (ptr->deferring_access_checks_kind == dk_no_deferred)
224 perform_access_checks (checks, tf_warning_or_error);
228 /* Merge with parent. */
230 deferred_access_check *chk, *probe;
232 FOR_EACH_VEC_SAFE_ELT (checks, i, chk)
234 FOR_EACH_VEC_SAFE_ELT (ptr->deferred_access_checks, j, probe)
236 if (probe->binfo == chk->binfo &&
237 probe->decl == chk->decl &&
238 probe->diag_decl == chk->diag_decl)
241 /* Insert into parent's checks. */
242 vec_safe_push (ptr->deferred_access_checks, *chk);
249 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
250 is the BINFO indicating the qualifying scope used to access the
251 DECL node stored in the TREE_VALUE of the node. If CHECKS is empty
252 or we aren't in SFINAE context or all the checks succeed return TRUE,
256 perform_access_checks (vec<deferred_access_check, va_gc> *checks,
257 tsubst_flags_t complain)
260 deferred_access_check *chk;
261 location_t loc = input_location;
267 FOR_EACH_VEC_SAFE_ELT (checks, i, chk)
269 input_location = chk->loc;
270 ok &= enforce_access (chk->binfo, chk->decl, chk->diag_decl, complain);
273 input_location = loc;
274 return (complain & tf_error) ? true : ok;
277 /* Perform the deferred access checks.
279 After performing the checks, we still have to keep the list
280 `deferred_access_stack->deferred_access_checks' since we may want
281 to check access for them again later in a different context.
288 A::X A::a, x; // No error for `A::a', error for `x'
290 We have to perform deferred access of `A::X', first with `A::a',
291 next with `x'. Return value like perform_access_checks above. */
294 perform_deferred_access_checks (tsubst_flags_t complain)
296 return perform_access_checks (get_deferred_access_checks (), complain);
299 /* Defer checking the accessibility of DECL, when looked up in
300 BINFO. DIAG_DECL is the declaration to use to print diagnostics.
301 Return value like perform_access_checks above. */
304 perform_or_defer_access_check (tree binfo, tree decl, tree diag_decl,
305 tsubst_flags_t complain)
308 deferred_access *ptr;
309 deferred_access_check *chk;
312 /* Exit if we are in a context that no access checking is performed.
314 if (deferred_access_no_check)
317 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
319 ptr = &deferred_access_stack->last ();
321 /* If we are not supposed to defer access checks, just check now. */
322 if (ptr->deferring_access_checks_kind == dk_no_deferred)
324 bool ok = enforce_access (binfo, decl, diag_decl, complain);
325 return (complain & tf_error) ? true : ok;
328 /* See if we are already going to perform this check. */
329 FOR_EACH_VEC_SAFE_ELT (ptr->deferred_access_checks, i, chk)
331 if (chk->decl == decl && chk->binfo == binfo &&
332 chk->diag_decl == diag_decl)
337 /* If not, record the check. */
338 deferred_access_check new_access = {binfo, decl, diag_decl, input_location};
339 vec_safe_push (ptr->deferred_access_checks, new_access);
344 /* Returns nonzero if the current statement is a full expression,
345 i.e. temporaries created during that statement should be destroyed
346 at the end of the statement. */
349 stmts_are_full_exprs_p (void)
351 return current_stmt_tree ()->stmts_are_full_exprs_p;
354 /* T is a statement. Add it to the statement-tree. This is the C++
355 version. The C/ObjC frontends have a slightly different version of
361 enum tree_code code = TREE_CODE (t);
363 if (EXPR_P (t) && code != LABEL_EXPR)
365 if (!EXPR_HAS_LOCATION (t))
366 SET_EXPR_LOCATION (t, input_location);
368 /* When we expand a statement-tree, we must know whether or not the
369 statements are full-expressions. We record that fact here. */
370 STMT_IS_FULL_EXPR_P (t) = stmts_are_full_exprs_p ();
373 /* Add T to the statement-tree. Non-side-effect statements need to be
374 recorded during statement expressions. */
375 gcc_checking_assert (!stmt_list_stack->is_empty ());
376 append_to_statement_list_force (t, &cur_stmt_list);
381 /* Returns the stmt_tree to which statements are currently being added. */
384 current_stmt_tree (void)
387 ? &cfun->language->base.x_stmt_tree
388 : &scope_chain->x_stmt_tree);
391 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
394 maybe_cleanup_point_expr (tree expr)
396 if (!processing_template_decl && stmts_are_full_exprs_p ())
397 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
401 /* Like maybe_cleanup_point_expr except have the type of the new expression be
402 void so we don't need to create a temporary variable to hold the inner
403 expression. The reason why we do this is because the original type might be
404 an aggregate and we cannot create a temporary variable for that type. */
407 maybe_cleanup_point_expr_void (tree expr)
409 if (!processing_template_decl && stmts_are_full_exprs_p ())
410 expr = fold_build_cleanup_point_expr (void_type_node, expr);
416 /* Create a declaration statement for the declaration given by the DECL. */
419 add_decl_expr (tree decl)
421 tree r = build_stmt (input_location, DECL_EXPR, decl);
422 if (DECL_INITIAL (decl)
423 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
424 r = maybe_cleanup_point_expr_void (r);
428 /* Finish a scope. */
431 do_poplevel (tree stmt_list)
435 if (stmts_are_full_exprs_p ())
436 block = poplevel (kept_level_p (), 1, 0);
438 stmt_list = pop_stmt_list (stmt_list);
440 if (!processing_template_decl)
442 stmt_list = c_build_bind_expr (input_location, block, stmt_list);
443 /* ??? See c_end_compound_stmt re statement expressions. */
449 /* Begin a new scope. */
452 do_pushlevel (scope_kind sk)
454 tree ret = push_stmt_list ();
455 if (stmts_are_full_exprs_p ())
456 begin_scope (sk, NULL);
460 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
461 when the current scope is exited. EH_ONLY is true when this is not
462 meant to apply to normal control flow transfer. */
465 push_cleanup (tree decl, tree cleanup, bool eh_only)
467 tree stmt = build_stmt (input_location, CLEANUP_STMT, NULL, cleanup, decl);
468 CLEANUP_EH_ONLY (stmt) = eh_only;
470 CLEANUP_BODY (stmt) = push_stmt_list ();
473 /* Begin a conditional that might contain a declaration. When generating
474 normal code, we want the declaration to appear before the statement
475 containing the conditional. When generating template code, we want the
476 conditional to be rendered as the raw DECL_EXPR. */
479 begin_cond (tree *cond_p)
481 if (processing_template_decl)
482 *cond_p = push_stmt_list ();
485 /* Finish such a conditional. */
488 finish_cond (tree *cond_p, tree expr)
490 if (processing_template_decl)
492 tree cond = pop_stmt_list (*cond_p);
494 if (expr == NULL_TREE)
495 /* Empty condition in 'for'. */
496 gcc_assert (empty_expr_stmt_p (cond));
497 else if (check_for_bare_parameter_packs (expr))
498 expr = error_mark_node;
499 else if (!empty_expr_stmt_p (cond))
500 expr = build2 (COMPOUND_EXPR, TREE_TYPE (expr), cond, expr);
505 /* If *COND_P specifies a conditional with a declaration, transform the
508 for (; A x = 42;) { }
510 while (true) { A x = 42; if (!x) break; }
511 for (;;) { A x = 42; if (!x) break; }
512 The statement list for BODY will be empty if the conditional did
513 not declare anything. */
516 simplify_loop_decl_cond (tree *cond_p, tree body)
520 if (!TREE_SIDE_EFFECTS (body))
524 *cond_p = boolean_true_node;
526 if_stmt = begin_if_stmt ();
527 cond = cp_build_unary_op (TRUTH_NOT_EXPR, cond, 0, tf_warning_or_error);
528 finish_if_stmt_cond (cond, if_stmt);
529 finish_break_stmt ();
530 finish_then_clause (if_stmt);
531 finish_if_stmt (if_stmt);
534 /* Finish a goto-statement. */
537 finish_goto_stmt (tree destination)
539 if (identifier_p (destination))
540 destination = lookup_label (destination);
542 /* We warn about unused labels with -Wunused. That means we have to
543 mark the used labels as used. */
544 if (TREE_CODE (destination) == LABEL_DECL)
545 TREE_USED (destination) = 1;
548 destination = mark_rvalue_use (destination);
549 if (!processing_template_decl)
551 destination = cp_convert (ptr_type_node, destination,
552 tf_warning_or_error);
553 if (error_operand_p (destination))
556 = fold_build_cleanup_point_expr (TREE_TYPE (destination),
561 check_goto (destination);
563 return add_stmt (build_stmt (input_location, GOTO_EXPR, destination));
566 /* COND is the condition-expression for an if, while, etc.,
567 statement. Convert it to a boolean value, if appropriate.
568 In addition, verify sequence points if -Wsequence-point is enabled. */
571 maybe_convert_cond (tree cond)
573 /* Empty conditions remain empty. */
577 /* Wait until we instantiate templates before doing conversion. */
578 if (processing_template_decl)
581 if (warn_sequence_point)
582 verify_sequence_points (cond);
584 /* Do the conversion. */
585 cond = convert_from_reference (cond);
587 if (TREE_CODE (cond) == MODIFY_EXPR
588 && !TREE_NO_WARNING (cond)
591 warning (OPT_Wparentheses,
592 "suggest parentheses around assignment used as truth value");
593 TREE_NO_WARNING (cond) = 1;
596 return condition_conversion (cond);
599 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
602 finish_expr_stmt (tree expr)
606 if (expr != NULL_TREE)
608 if (!processing_template_decl)
610 if (warn_sequence_point)
611 verify_sequence_points (expr);
612 expr = convert_to_void (expr, ICV_STATEMENT, tf_warning_or_error);
614 else if (!type_dependent_expression_p (expr))
615 convert_to_void (build_non_dependent_expr (expr), ICV_STATEMENT,
616 tf_warning_or_error);
618 if (check_for_bare_parameter_packs (expr))
619 expr = error_mark_node;
621 /* Simplification of inner statement expressions, compound exprs,
622 etc can result in us already having an EXPR_STMT. */
623 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
625 if (TREE_CODE (expr) != EXPR_STMT)
626 expr = build_stmt (input_location, EXPR_STMT, expr);
627 expr = maybe_cleanup_point_expr_void (expr);
639 /* Begin an if-statement. Returns a newly created IF_STMT if
646 scope = do_pushlevel (sk_cond);
647 r = build_stmt (input_location, IF_STMT, NULL_TREE,
648 NULL_TREE, NULL_TREE, scope);
649 begin_cond (&IF_COND (r));
653 /* Process the COND of an if-statement, which may be given by
657 finish_if_stmt_cond (tree cond, tree if_stmt)
659 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
661 THEN_CLAUSE (if_stmt) = push_stmt_list ();
664 /* Finish the then-clause of an if-statement, which may be given by
668 finish_then_clause (tree if_stmt)
670 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
674 /* Begin the else-clause of an if-statement. */
677 begin_else_clause (tree if_stmt)
679 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
682 /* Finish the else-clause of an if-statement, which may be given by
686 finish_else_clause (tree if_stmt)
688 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
691 /* Finish an if-statement. */
694 finish_if_stmt (tree if_stmt)
696 tree scope = IF_SCOPE (if_stmt);
697 IF_SCOPE (if_stmt) = NULL;
698 add_stmt (do_poplevel (scope));
702 /* Begin a while-statement. Returns a newly created WHILE_STMT if
706 begin_while_stmt (void)
709 r = build_stmt (input_location, WHILE_STMT, NULL_TREE, NULL_TREE);
711 WHILE_BODY (r) = do_pushlevel (sk_block);
712 begin_cond (&WHILE_COND (r));
716 /* Process the COND of a while-statement, which may be given by
720 finish_while_stmt_cond (tree cond, tree while_stmt)
722 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
723 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
726 /* Finish a while-statement, which may be given by WHILE_STMT. */
729 finish_while_stmt (tree while_stmt)
731 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
735 /* Begin a do-statement. Returns a newly created DO_STMT if
741 tree r = build_stmt (input_location, DO_STMT, NULL_TREE, NULL_TREE);
743 DO_BODY (r) = push_stmt_list ();
747 /* Finish the body of a do-statement, which may be given by DO_STMT. */
750 finish_do_body (tree do_stmt)
752 tree body = DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
754 if (TREE_CODE (body) == STATEMENT_LIST && STATEMENT_LIST_TAIL (body))
755 body = STATEMENT_LIST_TAIL (body)->stmt;
757 if (IS_EMPTY_STMT (body))
758 warning (OPT_Wempty_body,
759 "suggest explicit braces around empty body in %<do%> statement");
762 /* Finish a do-statement, which may be given by DO_STMT, and whose
763 COND is as indicated. */
766 finish_do_stmt (tree cond, tree do_stmt)
768 cond = maybe_convert_cond (cond);
769 DO_COND (do_stmt) = cond;
773 /* Finish a return-statement. The EXPRESSION returned, if any, is as
777 finish_return_stmt (tree expr)
782 expr = check_return_expr (expr, &no_warning);
784 if (flag_openmp && !check_omp_return ())
785 return error_mark_node;
786 if (!processing_template_decl)
788 if (warn_sequence_point)
789 verify_sequence_points (expr);
791 if (DECL_DESTRUCTOR_P (current_function_decl)
792 || (DECL_CONSTRUCTOR_P (current_function_decl)
793 && targetm.cxx.cdtor_returns_this ()))
795 /* Similarly, all destructors must run destructors for
796 base-classes before returning. So, all returns in a
797 destructor get sent to the DTOR_LABEL; finish_function emits
798 code to return a value there. */
799 return finish_goto_stmt (cdtor_label);
803 r = build_stmt (input_location, RETURN_EXPR, expr);
804 TREE_NO_WARNING (r) |= no_warning;
805 r = maybe_cleanup_point_expr_void (r);
812 /* Begin the scope of a for-statement or a range-for-statement.
813 Both the returned trees are to be used in a call to
814 begin_for_stmt or begin_range_for_stmt. */
817 begin_for_scope (tree *init)
819 tree scope = NULL_TREE;
820 if (flag_new_for_scope > 0)
821 scope = do_pushlevel (sk_for);
823 if (processing_template_decl)
824 *init = push_stmt_list ();
831 /* Begin a for-statement. Returns a new FOR_STMT.
832 SCOPE and INIT should be the return of begin_for_scope,
836 begin_for_stmt (tree scope, tree init)
840 r = build_stmt (input_location, FOR_STMT, NULL_TREE, NULL_TREE,
841 NULL_TREE, NULL_TREE, NULL_TREE);
843 if (scope == NULL_TREE)
845 gcc_assert (!init || !(flag_new_for_scope > 0));
847 scope = begin_for_scope (&init);
849 FOR_INIT_STMT (r) = init;
850 FOR_SCOPE (r) = scope;
855 /* Finish the for-init-statement of a for-statement, which may be
856 given by FOR_STMT. */
859 finish_for_init_stmt (tree for_stmt)
861 if (processing_template_decl)
862 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
864 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
865 begin_cond (&FOR_COND (for_stmt));
868 /* Finish the COND of a for-statement, which may be given by
872 finish_for_cond (tree cond, tree for_stmt)
874 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
875 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
878 /* Finish the increment-EXPRESSION in a for-statement, which may be
879 given by FOR_STMT. */
882 finish_for_expr (tree expr, tree for_stmt)
886 /* If EXPR is an overloaded function, issue an error; there is no
887 context available to use to perform overload resolution. */
888 if (type_unknown_p (expr))
890 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
891 expr = error_mark_node;
893 if (!processing_template_decl)
895 if (warn_sequence_point)
896 verify_sequence_points (expr);
897 expr = convert_to_void (expr, ICV_THIRD_IN_FOR,
898 tf_warning_or_error);
900 else if (!type_dependent_expression_p (expr))
901 convert_to_void (build_non_dependent_expr (expr), ICV_THIRD_IN_FOR,
902 tf_warning_or_error);
903 expr = maybe_cleanup_point_expr_void (expr);
904 if (check_for_bare_parameter_packs (expr))
905 expr = error_mark_node;
906 FOR_EXPR (for_stmt) = expr;
909 /* Finish the body of a for-statement, which may be given by
910 FOR_STMT. The increment-EXPR for the loop must be
912 It can also finish RANGE_FOR_STMT. */
915 finish_for_stmt (tree for_stmt)
917 if (TREE_CODE (for_stmt) == RANGE_FOR_STMT)
918 RANGE_FOR_BODY (for_stmt) = do_poplevel (RANGE_FOR_BODY (for_stmt));
920 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
922 /* Pop the scope for the body of the loop. */
923 if (flag_new_for_scope > 0)
926 tree *scope_ptr = (TREE_CODE (for_stmt) == RANGE_FOR_STMT
927 ? &RANGE_FOR_SCOPE (for_stmt)
928 : &FOR_SCOPE (for_stmt));
931 add_stmt (do_poplevel (scope));
937 /* Begin a range-for-statement. Returns a new RANGE_FOR_STMT.
938 SCOPE and INIT should be the return of begin_for_scope,
940 To finish it call finish_for_stmt(). */
943 begin_range_for_stmt (tree scope, tree init)
947 r = build_stmt (input_location, RANGE_FOR_STMT,
948 NULL_TREE, NULL_TREE, NULL_TREE, NULL_TREE);
950 if (scope == NULL_TREE)
952 gcc_assert (!init || !(flag_new_for_scope > 0));
954 scope = begin_for_scope (&init);
957 /* RANGE_FOR_STMTs do not use nor save the init tree, so we
960 pop_stmt_list (init);
961 RANGE_FOR_SCOPE (r) = scope;
966 /* Finish the head of a range-based for statement, which may
967 be given by RANGE_FOR_STMT. DECL must be the declaration
968 and EXPR must be the loop expression. */
971 finish_range_for_decl (tree range_for_stmt, tree decl, tree expr)
973 RANGE_FOR_DECL (range_for_stmt) = decl;
974 RANGE_FOR_EXPR (range_for_stmt) = expr;
975 add_stmt (range_for_stmt);
976 RANGE_FOR_BODY (range_for_stmt) = do_pushlevel (sk_block);
979 /* Finish a break-statement. */
982 finish_break_stmt (void)
984 /* In switch statements break is sometimes stylistically used after
985 a return statement. This can lead to spurious warnings about
986 control reaching the end of a non-void function when it is
987 inlined. Note that we are calling block_may_fallthru with
988 language specific tree nodes; this works because
989 block_may_fallthru returns true when given something it does not
991 if (!block_may_fallthru (cur_stmt_list))
992 return void_zero_node;
993 return add_stmt (build_stmt (input_location, BREAK_STMT));
996 /* Finish a continue-statement. */
999 finish_continue_stmt (void)
1001 return add_stmt (build_stmt (input_location, CONTINUE_STMT));
1004 /* Begin a switch-statement. Returns a new SWITCH_STMT if
1008 begin_switch_stmt (void)
1012 scope = do_pushlevel (sk_cond);
1013 r = build_stmt (input_location, SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE, scope);
1015 begin_cond (&SWITCH_STMT_COND (r));
1020 /* Finish the cond of a switch-statement. */
1023 finish_switch_cond (tree cond, tree switch_stmt)
1025 tree orig_type = NULL;
1026 if (!processing_template_decl)
1028 /* Convert the condition to an integer or enumeration type. */
1029 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
1030 if (cond == NULL_TREE)
1032 error ("switch quantity not an integer");
1033 cond = error_mark_node;
1035 orig_type = TREE_TYPE (cond);
1036 if (cond != error_mark_node)
1040 Integral promotions are performed. */
1041 cond = perform_integral_promotions (cond);
1042 cond = maybe_cleanup_point_expr (cond);
1045 if (check_for_bare_parameter_packs (cond))
1046 cond = error_mark_node;
1047 else if (!processing_template_decl && warn_sequence_point)
1048 verify_sequence_points (cond);
1050 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
1051 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
1052 add_stmt (switch_stmt);
1053 push_switch (switch_stmt);
1054 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
1057 /* Finish the body of a switch-statement, which may be given by
1058 SWITCH_STMT. The COND to switch on is indicated. */
1061 finish_switch_stmt (tree switch_stmt)
1065 SWITCH_STMT_BODY (switch_stmt) =
1066 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
1070 scope = SWITCH_STMT_SCOPE (switch_stmt);
1071 SWITCH_STMT_SCOPE (switch_stmt) = NULL;
1072 add_stmt (do_poplevel (scope));
1075 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1079 begin_try_block (void)
1081 tree r = build_stmt (input_location, TRY_BLOCK, NULL_TREE, NULL_TREE);
1083 TRY_STMTS (r) = push_stmt_list ();
1087 /* Likewise, for a function-try-block. The block returned in
1088 *COMPOUND_STMT is an artificial outer scope, containing the
1089 function-try-block. */
1092 begin_function_try_block (tree *compound_stmt)
1095 /* This outer scope does not exist in the C++ standard, but we need
1096 a place to put __FUNCTION__ and similar variables. */
1097 *compound_stmt = begin_compound_stmt (0);
1098 r = begin_try_block ();
1099 FN_TRY_BLOCK_P (r) = 1;
1103 /* Finish a try-block, which may be given by TRY_BLOCK. */
1106 finish_try_block (tree try_block)
1108 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1109 TRY_HANDLERS (try_block) = push_stmt_list ();
1112 /* Finish the body of a cleanup try-block, which may be given by
1116 finish_cleanup_try_block (tree try_block)
1118 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1121 /* Finish an implicitly generated try-block, with a cleanup is given
1125 finish_cleanup (tree cleanup, tree try_block)
1127 TRY_HANDLERS (try_block) = cleanup;
1128 CLEANUP_P (try_block) = 1;
1131 /* Likewise, for a function-try-block. */
1134 finish_function_try_block (tree try_block)
1136 finish_try_block (try_block);
1137 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1138 the try block, but moving it inside. */
1139 in_function_try_handler = 1;
1142 /* Finish a handler-sequence for a try-block, which may be given by
1146 finish_handler_sequence (tree try_block)
1148 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1149 check_handlers (TRY_HANDLERS (try_block));
1152 /* Finish the handler-seq for a function-try-block, given by
1153 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1154 begin_function_try_block. */
1157 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1159 in_function_try_handler = 0;
1160 finish_handler_sequence (try_block);
1161 finish_compound_stmt (compound_stmt);
1164 /* Begin a handler. Returns a HANDLER if appropriate. */
1167 begin_handler (void)
1171 r = build_stmt (input_location, HANDLER, NULL_TREE, NULL_TREE);
1174 /* Create a binding level for the eh_info and the exception object
1176 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1181 /* Finish the handler-parameters for a handler, which may be given by
1182 HANDLER. DECL is the declaration for the catch parameter, or NULL
1183 if this is a `catch (...)' clause. */
1186 finish_handler_parms (tree decl, tree handler)
1188 tree type = NULL_TREE;
1189 if (processing_template_decl)
1193 decl = pushdecl (decl);
1194 decl = push_template_decl (decl);
1195 HANDLER_PARMS (handler) = decl;
1196 type = TREE_TYPE (decl);
1200 type = expand_start_catch_block (decl);
1201 HANDLER_TYPE (handler) = type;
1202 if (!processing_template_decl && type)
1203 mark_used (eh_type_info (type));
1206 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1207 the return value from the matching call to finish_handler_parms. */
1210 finish_handler (tree handler)
1212 if (!processing_template_decl)
1213 expand_end_catch_block ();
1214 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1217 /* Begin a compound statement. FLAGS contains some bits that control the
1218 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1219 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1220 block of a function. If BCS_TRY_BLOCK is set, this is the block
1221 created on behalf of a TRY statement. Returns a token to be passed to
1222 finish_compound_stmt. */
1225 begin_compound_stmt (unsigned int flags)
1229 if (flags & BCS_NO_SCOPE)
1231 r = push_stmt_list ();
1232 STATEMENT_LIST_NO_SCOPE (r) = 1;
1234 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1235 But, if it's a statement-expression with a scopeless block, there's
1236 nothing to keep, and we don't want to accidentally keep a block
1237 *inside* the scopeless block. */
1238 keep_next_level (false);
1241 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1243 /* When processing a template, we need to remember where the braces were,
1244 so that we can set up identical scopes when instantiating the template
1245 later. BIND_EXPR is a handy candidate for this.
1246 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1247 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1248 processing templates. */
1249 if (processing_template_decl)
1251 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1252 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1253 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1254 TREE_SIDE_EFFECTS (r) = 1;
1260 /* Finish a compound-statement, which is given by STMT. */
1263 finish_compound_stmt (tree stmt)
1265 if (TREE_CODE (stmt) == BIND_EXPR)
1267 tree body = do_poplevel (BIND_EXPR_BODY (stmt));
1268 /* If the STATEMENT_LIST is empty and this BIND_EXPR isn't special,
1269 discard the BIND_EXPR so it can be merged with the containing
1271 if (TREE_CODE (body) == STATEMENT_LIST
1272 && STATEMENT_LIST_HEAD (body) == NULL
1273 && !BIND_EXPR_BODY_BLOCK (stmt)
1274 && !BIND_EXPR_TRY_BLOCK (stmt))
1277 BIND_EXPR_BODY (stmt) = body;
1279 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1280 stmt = pop_stmt_list (stmt);
1283 /* Destroy any ObjC "super" receivers that may have been
1285 objc_clear_super_receiver ();
1287 stmt = do_poplevel (stmt);
1290 /* ??? See c_end_compound_stmt wrt statement expressions. */
1295 /* Finish an asm-statement, whose components are a STRING, some
1296 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1297 LABELS. Also note whether the asm-statement should be
1298 considered volatile. */
1301 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1302 tree input_operands, tree clobbers, tree labels)
1306 int ninputs = list_length (input_operands);
1307 int noutputs = list_length (output_operands);
1309 if (!processing_template_decl)
1311 const char *constraint;
1312 const char **oconstraints;
1313 bool allows_mem, allows_reg, is_inout;
1317 oconstraints = XALLOCAVEC (const char *, noutputs);
1319 string = resolve_asm_operand_names (string, output_operands,
1320 input_operands, labels);
1322 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1324 operand = TREE_VALUE (t);
1326 /* ??? Really, this should not be here. Users should be using a
1327 proper lvalue, dammit. But there's a long history of using
1328 casts in the output operands. In cases like longlong.h, this
1329 becomes a primitive form of typechecking -- if the cast can be
1330 removed, then the output operand had a type of the proper width;
1331 otherwise we'll get an error. Gross, but ... */
1332 STRIP_NOPS (operand);
1334 operand = mark_lvalue_use (operand);
1336 if (!lvalue_or_else (operand, lv_asm, tf_warning_or_error))
1337 operand = error_mark_node;
1339 if (operand != error_mark_node
1340 && (TREE_READONLY (operand)
1341 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1342 /* Functions are not modifiable, even though they are
1344 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1345 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1346 /* If it's an aggregate and any field is const, then it is
1347 effectively const. */
1348 || (CLASS_TYPE_P (TREE_TYPE (operand))
1349 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1350 cxx_readonly_error (operand, lv_asm);
1352 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1353 oconstraints[i] = constraint;
1355 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1356 &allows_mem, &allows_reg, &is_inout))
1358 /* If the operand is going to end up in memory,
1359 mark it addressable. */
1360 if (!allows_reg && !cxx_mark_addressable (operand))
1361 operand = error_mark_node;
1364 operand = error_mark_node;
1366 TREE_VALUE (t) = operand;
1369 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1371 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1372 bool constraint_parsed
1373 = parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1374 oconstraints, &allows_mem, &allows_reg);
1375 /* If the operand is going to end up in memory, don't call
1376 decay_conversion. */
1377 if (constraint_parsed && !allows_reg && allows_mem)
1378 operand = mark_lvalue_use (TREE_VALUE (t));
1380 operand = decay_conversion (TREE_VALUE (t), tf_warning_or_error);
1382 /* If the type of the operand hasn't been determined (e.g.,
1383 because it involves an overloaded function), then issue
1384 an error message. There's no context available to
1385 resolve the overloading. */
1386 if (TREE_TYPE (operand) == unknown_type_node)
1388 error ("type of asm operand %qE could not be determined",
1390 operand = error_mark_node;
1393 if (constraint_parsed)
1395 /* If the operand is going to end up in memory,
1396 mark it addressable. */
1397 if (!allows_reg && allows_mem)
1399 /* Strip the nops as we allow this case. FIXME, this really
1400 should be rejected or made deprecated. */
1401 STRIP_NOPS (operand);
1402 if (!cxx_mark_addressable (operand))
1403 operand = error_mark_node;
1405 else if (!allows_reg && !allows_mem)
1407 /* If constraint allows neither register nor memory,
1408 try harder to get a constant. */
1409 tree constop = maybe_constant_value (operand);
1410 if (TREE_CONSTANT (constop))
1415 operand = error_mark_node;
1417 TREE_VALUE (t) = operand;
1421 r = build_stmt (input_location, ASM_EXPR, string,
1422 output_operands, input_operands,
1424 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1425 r = maybe_cleanup_point_expr_void (r);
1426 return add_stmt (r);
1429 /* Finish a label with the indicated NAME. Returns the new label. */
1432 finish_label_stmt (tree name)
1434 tree decl = define_label (input_location, name);
1436 if (decl == error_mark_node)
1437 return error_mark_node;
1439 add_stmt (build_stmt (input_location, LABEL_EXPR, decl));
1444 /* Finish a series of declarations for local labels. G++ allows users
1445 to declare "local" labels, i.e., labels with scope. This extension
1446 is useful when writing code involving statement-expressions. */
1449 finish_label_decl (tree name)
1451 if (!at_function_scope_p ())
1453 error ("__label__ declarations are only allowed in function scopes");
1457 add_decl_expr (declare_local_label (name));
1460 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1463 finish_decl_cleanup (tree decl, tree cleanup)
1465 push_cleanup (decl, cleanup, false);
1468 /* If the current scope exits with an exception, run CLEANUP. */
1471 finish_eh_cleanup (tree cleanup)
1473 push_cleanup (NULL, cleanup, true);
1476 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1477 order they were written by the user. Each node is as for
1478 emit_mem_initializers. */
1481 finish_mem_initializers (tree mem_inits)
1483 /* Reorder the MEM_INITS so that they are in the order they appeared
1484 in the source program. */
1485 mem_inits = nreverse (mem_inits);
1487 if (processing_template_decl)
1491 for (mem = mem_inits; mem; mem = TREE_CHAIN (mem))
1493 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1494 check for bare parameter packs in the TREE_VALUE, because
1495 any parameter packs in the TREE_VALUE have already been
1496 bound as part of the TREE_PURPOSE. See
1497 make_pack_expansion for more information. */
1498 if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION
1499 && check_for_bare_parameter_packs (TREE_VALUE (mem)))
1500 TREE_VALUE (mem) = error_mark_node;
1503 add_stmt (build_min_nt_loc (UNKNOWN_LOCATION,
1504 CTOR_INITIALIZER, mem_inits));
1507 emit_mem_initializers (mem_inits);
1510 /* Finish a parenthesized expression EXPR. */
1513 finish_parenthesized_expr (tree expr)
1516 /* This inhibits warnings in c_common_truthvalue_conversion. */
1517 TREE_NO_WARNING (expr) = 1;
1519 if (TREE_CODE (expr) == OFFSET_REF
1520 || TREE_CODE (expr) == SCOPE_REF)
1521 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1522 enclosed in parentheses. */
1523 PTRMEM_OK_P (expr) = 0;
1525 if (TREE_CODE (expr) == STRING_CST)
1526 PAREN_STRING_LITERAL_P (expr) = 1;
1531 /* Finish a reference to a non-static data member (DECL) that is not
1532 preceded by `.' or `->'. */
1535 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1537 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1541 tree scope = qualifying_scope;
1542 if (scope == NULL_TREE)
1543 scope = context_for_name_lookup (decl);
1544 object = maybe_dummy_object (scope, NULL);
1547 object = maybe_resolve_dummy (object);
1548 if (object == error_mark_node)
1549 return error_mark_node;
1551 /* DR 613: Can use non-static data members without an associated
1552 object in sizeof/decltype/alignof. */
1553 if (is_dummy_object (object) && cp_unevaluated_operand == 0
1554 && (!processing_template_decl || !current_class_ref))
1556 if (current_function_decl
1557 && DECL_STATIC_FUNCTION_P (current_function_decl))
1558 error ("invalid use of member %q+D in static member function", decl);
1560 error ("invalid use of non-static data member %q+D", decl);
1561 error ("from this location");
1563 return error_mark_node;
1566 if (current_class_ptr)
1567 TREE_USED (current_class_ptr) = 1;
1568 if (processing_template_decl && !qualifying_scope)
1570 tree type = TREE_TYPE (decl);
1572 if (TREE_CODE (type) == REFERENCE_TYPE)
1573 /* Quals on the object don't matter. */;
1576 /* Set the cv qualifiers. */
1577 int quals = cp_type_quals (TREE_TYPE (object));
1579 if (DECL_MUTABLE_P (decl))
1580 quals &= ~TYPE_QUAL_CONST;
1582 quals |= cp_type_quals (TREE_TYPE (decl));
1583 type = cp_build_qualified_type (type, quals);
1586 return (convert_from_reference
1587 (build_min (COMPONENT_REF, type, object, decl, NULL_TREE)));
1589 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1590 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1592 else if (processing_template_decl)
1593 return build_qualified_name (TREE_TYPE (decl),
1596 /*template_p=*/false);
1599 tree access_type = TREE_TYPE (object);
1601 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1602 decl, tf_warning_or_error);
1604 /* If the data member was named `C::M', convert `*this' to `C'
1606 if (qualifying_scope)
1608 tree binfo = NULL_TREE;
1609 object = build_scoped_ref (object, qualifying_scope,
1613 return build_class_member_access_expr (object, decl,
1614 /*access_path=*/NULL_TREE,
1615 /*preserve_reference=*/false,
1616 tf_warning_or_error);
1620 /* If we are currently parsing a template and we encountered a typedef
1621 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1622 adds the typedef to a list tied to the current template.
1623 At template instantiation time, that list is walked and access check
1624 performed for each typedef.
1625 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1628 add_typedef_to_current_template_for_access_check (tree typedef_decl,
1630 location_t location)
1632 tree template_info = NULL;
1633 tree cs = current_scope ();
1635 if (!is_typedef_decl (typedef_decl)
1637 || !CLASS_TYPE_P (context)
1641 if (CLASS_TYPE_P (cs) || TREE_CODE (cs) == FUNCTION_DECL)
1642 template_info = get_template_info (cs);
1645 && TI_TEMPLATE (template_info)
1646 && !currently_open_class (context))
1647 append_type_to_template_for_access_check (cs, typedef_decl,
1651 /* DECL was the declaration to which a qualified-id resolved. Issue
1652 an error message if it is not accessible. If OBJECT_TYPE is
1653 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1654 type of `*x', or `x', respectively. If the DECL was named as
1655 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1658 check_accessibility_of_qualified_id (tree decl,
1660 tree nested_name_specifier)
1663 tree qualifying_type = NULL_TREE;
1665 /* If we are parsing a template declaration and if decl is a typedef,
1666 add it to a list tied to the template.
1667 At template instantiation time, that list will be walked and
1668 access check performed. */
1669 add_typedef_to_current_template_for_access_check (decl,
1670 nested_name_specifier
1671 ? nested_name_specifier
1672 : DECL_CONTEXT (decl),
1675 /* If we're not checking, return immediately. */
1676 if (deferred_access_no_check)
1679 /* Determine the SCOPE of DECL. */
1680 scope = context_for_name_lookup (decl);
1681 /* If the SCOPE is not a type, then DECL is not a member. */
1682 if (!TYPE_P (scope))
1684 /* Compute the scope through which DECL is being accessed. */
1686 /* OBJECT_TYPE might not be a class type; consider:
1688 class A { typedef int I; };
1692 In this case, we will have "A::I" as the DECL, but "I" as the
1694 && CLASS_TYPE_P (object_type)
1695 && DERIVED_FROM_P (scope, object_type))
1696 /* If we are processing a `->' or `.' expression, use the type of the
1698 qualifying_type = object_type;
1699 else if (nested_name_specifier)
1701 /* If the reference is to a non-static member of the
1702 current class, treat it as if it were referenced through
1704 if (DECL_NONSTATIC_MEMBER_P (decl)
1705 && current_class_ptr
1706 && DERIVED_FROM_P (scope, current_class_type))
1707 qualifying_type = current_class_type;
1708 /* Otherwise, use the type indicated by the
1709 nested-name-specifier. */
1711 qualifying_type = nested_name_specifier;
1714 /* Otherwise, the name must be from the current class or one of
1716 qualifying_type = currently_open_derived_class (scope);
1719 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1720 or similar in a default argument value. */
1721 && CLASS_TYPE_P (qualifying_type)
1722 && !dependent_type_p (qualifying_type))
1723 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1724 decl, tf_warning_or_error);
1727 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1728 class named to the left of the "::" operator. DONE is true if this
1729 expression is a complete postfix-expression; it is false if this
1730 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1731 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1732 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1733 is true iff this qualified name appears as a template argument. */
1736 finish_qualified_id_expr (tree qualifying_class,
1741 bool template_arg_p)
1743 gcc_assert (TYPE_P (qualifying_class));
1745 if (error_operand_p (expr))
1746 return error_mark_node;
1748 if (DECL_P (expr) || BASELINK_P (expr))
1752 check_template_keyword (expr);
1754 /* If EXPR occurs as the operand of '&', use special handling that
1755 permits a pointer-to-member. */
1756 if (address_p && done)
1758 if (TREE_CODE (expr) == SCOPE_REF)
1759 expr = TREE_OPERAND (expr, 1);
1760 expr = build_offset_ref (qualifying_class, expr,
1761 /*address_p=*/true);
1765 /* No need to check access within an enum. */
1766 if (TREE_CODE (qualifying_class) == ENUMERAL_TYPE)
1769 /* Within the scope of a class, turn references to non-static
1770 members into expression of the form "this->...". */
1772 /* But, within a template argument, we do not want make the
1773 transformation, as there is no "this" pointer. */
1775 else if (TREE_CODE (expr) == FIELD_DECL)
1777 push_deferring_access_checks (dk_no_check);
1778 expr = finish_non_static_data_member (expr, NULL_TREE,
1780 pop_deferring_access_checks ();
1782 else if (BASELINK_P (expr) && !processing_template_decl)
1784 /* See if any of the functions are non-static members. */
1785 /* If so, the expression may be relative to 'this'. */
1786 if (!shared_member_p (expr)
1787 && current_class_ptr
1788 && DERIVED_FROM_P (qualifying_class,
1789 current_nonlambda_class_type ()))
1790 expr = (build_class_member_access_expr
1791 (maybe_dummy_object (qualifying_class, NULL),
1793 BASELINK_ACCESS_BINFO (expr),
1794 /*preserve_reference=*/false,
1795 tf_warning_or_error));
1797 /* The expression is a qualified name whose address is not
1799 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1801 else if (BASELINK_P (expr))
1805 /* In a template, return a SCOPE_REF for most qualified-ids
1806 so that we can check access at instantiation time. But if
1807 we're looking at a member of the current instantiation, we
1808 know we have access and building up the SCOPE_REF confuses
1809 non-type template argument handling. */
1810 if (processing_template_decl
1811 && !currently_open_class (qualifying_class))
1812 expr = build_qualified_name (TREE_TYPE (expr),
1813 qualifying_class, expr,
1816 expr = convert_from_reference (expr);
1822 /* Begin a statement-expression. The value returned must be passed to
1823 finish_stmt_expr. */
1826 begin_stmt_expr (void)
1828 return push_stmt_list ();
1831 /* Process the final expression of a statement expression. EXPR can be
1832 NULL, if the final expression is empty. Return a STATEMENT_LIST
1833 containing all the statements in the statement-expression, or
1834 ERROR_MARK_NODE if there was an error. */
1837 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1839 if (error_operand_p (expr))
1841 /* The type of the statement-expression is the type of the last
1843 TREE_TYPE (stmt_expr) = error_mark_node;
1844 return error_mark_node;
1847 /* If the last statement does not have "void" type, then the value
1848 of the last statement is the value of the entire expression. */
1851 tree type = TREE_TYPE (expr);
1853 if (processing_template_decl)
1855 expr = build_stmt (input_location, EXPR_STMT, expr);
1856 expr = add_stmt (expr);
1857 /* Mark the last statement so that we can recognize it as such at
1858 template-instantiation time. */
1859 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1861 else if (VOID_TYPE_P (type))
1863 /* Just treat this like an ordinary statement. */
1864 expr = finish_expr_stmt (expr);
1868 /* It actually has a value we need to deal with. First, force it
1869 to be an rvalue so that we won't need to build up a copy
1870 constructor call later when we try to assign it to something. */
1871 expr = force_rvalue (expr, tf_warning_or_error);
1872 if (error_operand_p (expr))
1873 return error_mark_node;
1875 /* Update for array-to-pointer decay. */
1876 type = TREE_TYPE (expr);
1878 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1879 normal statement, but don't convert to void or actually add
1881 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1882 expr = maybe_cleanup_point_expr (expr);
1886 /* The type of the statement-expression is the type of the last
1888 TREE_TYPE (stmt_expr) = type;
1894 /* Finish a statement-expression. EXPR should be the value returned
1895 by the previous begin_stmt_expr. Returns an expression
1896 representing the statement-expression. */
1899 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1904 if (error_operand_p (stmt_expr))
1906 pop_stmt_list (stmt_expr);
1907 return error_mark_node;
1910 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1912 type = TREE_TYPE (stmt_expr);
1913 result = pop_stmt_list (stmt_expr);
1914 TREE_TYPE (result) = type;
1916 if (processing_template_decl)
1918 result = build_min (STMT_EXPR, type, result);
1919 TREE_SIDE_EFFECTS (result) = 1;
1920 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1922 else if (CLASS_TYPE_P (type))
1924 /* Wrap the statement-expression in a TARGET_EXPR so that the
1925 temporary object created by the final expression is destroyed at
1926 the end of the full-expression containing the
1927 statement-expression. */
1928 result = force_target_expr (type, result, tf_warning_or_error);
1934 /* Returns the expression which provides the value of STMT_EXPR. */
1937 stmt_expr_value_expr (tree stmt_expr)
1939 tree t = STMT_EXPR_STMT (stmt_expr);
1941 if (TREE_CODE (t) == BIND_EXPR)
1942 t = BIND_EXPR_BODY (t);
1944 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1945 t = STATEMENT_LIST_TAIL (t)->stmt;
1947 if (TREE_CODE (t) == EXPR_STMT)
1948 t = EXPR_STMT_EXPR (t);
1953 /* Return TRUE iff EXPR_STMT is an empty list of
1954 expression statements. */
1957 empty_expr_stmt_p (tree expr_stmt)
1959 tree body = NULL_TREE;
1961 if (expr_stmt == void_zero_node)
1966 if (TREE_CODE (expr_stmt) == EXPR_STMT)
1967 body = EXPR_STMT_EXPR (expr_stmt);
1968 else if (TREE_CODE (expr_stmt) == STATEMENT_LIST)
1974 if (TREE_CODE (body) == STATEMENT_LIST)
1975 return tsi_end_p (tsi_start (body));
1977 return empty_expr_stmt_p (body);
1982 /* Perform Koenig lookup. FN is the postfix-expression representing
1983 the function (or functions) to call; ARGS are the arguments to the
1984 call; if INCLUDE_STD then the `std' namespace is automatically
1985 considered an associated namespace (used in range-based for loops).
1986 Returns the functions to be considered by overload resolution. */
1989 perform_koenig_lookup (tree fn, vec<tree, va_gc> *args, bool include_std,
1990 tsubst_flags_t complain)
1992 tree identifier = NULL_TREE;
1993 tree functions = NULL_TREE;
1994 tree tmpl_args = NULL_TREE;
1995 bool template_id = false;
1997 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1999 /* Use a separate flag to handle null args. */
2001 tmpl_args = TREE_OPERAND (fn, 1);
2002 fn = TREE_OPERAND (fn, 0);
2005 /* Find the name of the overloaded function. */
2006 if (identifier_p (fn))
2008 else if (is_overloaded_fn (fn))
2011 identifier = DECL_NAME (get_first_fn (functions));
2013 else if (DECL_P (fn))
2016 identifier = DECL_NAME (fn);
2019 /* A call to a namespace-scope function using an unqualified name.
2021 Do Koenig lookup -- unless any of the arguments are
2023 if (!any_type_dependent_arguments_p (args)
2024 && !any_dependent_template_arguments_p (tmpl_args))
2026 fn = lookup_arg_dependent (identifier, functions, args, include_std);
2029 /* The unqualified name could not be resolved. */
2031 fn = unqualified_fn_lookup_error (identifier);
2037 if (fn && template_id)
2038 fn = build2 (TEMPLATE_ID_EXPR, unknown_type_node, fn, tmpl_args);
2043 /* Generate an expression for `FN (ARGS)'. This may change the
2046 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2047 as a virtual call, even if FN is virtual. (This flag is set when
2048 encountering an expression where the function name is explicitly
2049 qualified. For example a call to `X::f' never generates a virtual
2052 Returns code for the call. */
2055 finish_call_expr (tree fn, vec<tree, va_gc> **args, bool disallow_virtual,
2056 bool koenig_p, tsubst_flags_t complain)
2060 vec<tree, va_gc> *orig_args = NULL;
2062 if (fn == error_mark_node)
2063 return error_mark_node;
2065 gcc_assert (!TYPE_P (fn));
2069 if (processing_template_decl)
2071 /* If the call expression is dependent, build a CALL_EXPR node
2072 with no type; type_dependent_expression_p recognizes
2073 expressions with no type as being dependent. */
2074 if (type_dependent_expression_p (fn)
2075 || any_type_dependent_arguments_p (*args)
2076 /* For a non-static member function that doesn't have an
2077 explicit object argument, we need to specifically
2078 test the type dependency of the "this" pointer because it
2079 is not included in *ARGS even though it is considered to
2080 be part of the list of arguments. Note that this is
2081 related to CWG issues 515 and 1005. */
2082 || (TREE_CODE (fn) != COMPONENT_REF
2083 && non_static_member_function_p (fn)
2084 && current_class_ref
2085 && type_dependent_expression_p (current_class_ref)))
2087 result = build_nt_call_vec (fn, *args);
2088 SET_EXPR_LOCATION (result, EXPR_LOC_OR_HERE (fn));
2089 KOENIG_LOOKUP_P (result) = koenig_p;
2094 tree fndecl = OVL_CURRENT (fn);
2095 if (TREE_CODE (fndecl) != FUNCTION_DECL
2096 || !TREE_THIS_VOLATILE (fndecl))
2102 current_function_returns_abnormally = 1;
2106 orig_args = make_tree_vector_copy (*args);
2107 if (!BASELINK_P (fn)
2108 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
2109 && TREE_TYPE (fn) != unknown_type_node)
2110 fn = build_non_dependent_expr (fn);
2111 make_args_non_dependent (*args);
2114 if (TREE_CODE (fn) == COMPONENT_REF)
2116 tree member = TREE_OPERAND (fn, 1);
2117 if (BASELINK_P (member))
2119 tree object = TREE_OPERAND (fn, 0);
2120 return build_new_method_call (object, member,
2123 ? LOOKUP_NORMAL | LOOKUP_NONVIRTUAL
2130 if (is_overloaded_fn (fn))
2131 fn = baselink_for_fns (fn);
2134 if (BASELINK_P (fn))
2138 /* A call to a member function. From [over.call.func]:
2140 If the keyword this is in scope and refers to the class of
2141 that member function, or a derived class thereof, then the
2142 function call is transformed into a qualified function call
2143 using (*this) as the postfix-expression to the left of the
2144 . operator.... [Otherwise] a contrived object of type T
2145 becomes the implied object argument.
2149 struct A { void f(); };
2150 struct B : public A {};
2151 struct C : public A { void g() { B::f(); }};
2153 "the class of that member function" refers to `A'. But 11.2
2154 [class.access.base] says that we need to convert 'this' to B* as
2155 part of the access, so we pass 'B' to maybe_dummy_object. */
2157 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
2160 if (processing_template_decl)
2162 if (type_dependent_expression_p (object))
2164 tree ret = build_nt_call_vec (orig_fn, orig_args);
2165 release_tree_vector (orig_args);
2168 object = build_non_dependent_expr (object);
2171 result = build_new_method_call (object, fn, args, NULL_TREE,
2173 ? LOOKUP_NORMAL|LOOKUP_NONVIRTUAL
2178 else if (is_overloaded_fn (fn))
2180 /* If the function is an overloaded builtin, resolve it. */
2181 if (TREE_CODE (fn) == FUNCTION_DECL
2182 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2183 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
2184 result = resolve_overloaded_builtin (input_location, fn, *args);
2188 if (warn_sizeof_pointer_memaccess
2189 && !vec_safe_is_empty (*args)
2190 && !processing_template_decl)
2192 location_t sizeof_arg_loc[3];
2195 for (i = 0; i < 3; i++)
2199 sizeof_arg_loc[i] = UNKNOWN_LOCATION;
2200 sizeof_arg[i] = NULL_TREE;
2201 if (i >= (*args)->length ())
2204 if (TREE_CODE (t) != SIZEOF_EXPR)
2206 if (SIZEOF_EXPR_TYPE_P (t))
2207 sizeof_arg[i] = TREE_TYPE (TREE_OPERAND (t, 0));
2209 sizeof_arg[i] = TREE_OPERAND (t, 0);
2210 sizeof_arg_loc[i] = EXPR_LOCATION (t);
2212 sizeof_pointer_memaccess_warning
2213 (sizeof_arg_loc, fn, *args,
2214 sizeof_arg, same_type_ignoring_top_level_qualifiers_p);
2217 /* A call to a namespace-scope function. */
2218 result = build_new_function_call (fn, args, koenig_p, complain);
2221 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
2223 if (!vec_safe_is_empty (*args))
2224 error ("arguments to destructor are not allowed");
2225 /* Mark the pseudo-destructor call as having side-effects so
2226 that we do not issue warnings about its use. */
2227 result = build1 (NOP_EXPR,
2229 TREE_OPERAND (fn, 0));
2230 TREE_SIDE_EFFECTS (result) = 1;
2232 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
2233 /* If the "function" is really an object of class type, it might
2234 have an overloaded `operator ()'. */
2235 result = build_op_call (fn, args, complain);
2238 /* A call where the function is unknown. */
2239 result = cp_build_function_call_vec (fn, args, complain);
2241 if (processing_template_decl && result != error_mark_node)
2243 if (INDIRECT_REF_P (result))
2244 result = TREE_OPERAND (result, 0);
2245 result = build_call_vec (TREE_TYPE (result), orig_fn, orig_args);
2246 SET_EXPR_LOCATION (result, input_location);
2247 KOENIG_LOOKUP_P (result) = koenig_p;
2248 release_tree_vector (orig_args);
2249 result = convert_from_reference (result);
2254 /* Free garbage OVERLOADs from arg-dependent lookup. */
2255 tree next = NULL_TREE;
2257 fn && TREE_CODE (fn) == OVERLOAD && OVL_ARG_DEPENDENT (fn);
2260 if (processing_template_decl)
2261 /* In a template, we'll re-use them at instantiation time. */
2262 OVL_ARG_DEPENDENT (fn) = false;
2265 next = OVL_CHAIN (fn);
2274 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2275 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2276 POSTDECREMENT_EXPR.) */
2279 finish_increment_expr (tree expr, enum tree_code code)
2281 return build_x_unary_op (input_location, code, expr, tf_warning_or_error);
2284 /* Finish a use of `this'. Returns an expression for `this'. */
2287 finish_this_expr (void)
2291 if (current_class_ptr)
2293 tree type = TREE_TYPE (current_class_ref);
2295 /* In a lambda expression, 'this' refers to the captured 'this'. */
2296 if (LAMBDA_TYPE_P (type))
2297 result = lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type));
2299 result = current_class_ptr;
2302 else if (current_function_decl
2303 && DECL_STATIC_FUNCTION_P (current_function_decl))
2305 error ("%<this%> is unavailable for static member functions");
2306 result = error_mark_node;
2310 if (current_function_decl)
2311 error ("invalid use of %<this%> in non-member function");
2313 error ("invalid use of %<this%> at top level");
2314 result = error_mark_node;
2320 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2321 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2322 the TYPE for the type given. If SCOPE is non-NULL, the expression
2323 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2326 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2328 if (object == error_mark_node || destructor == error_mark_node)
2329 return error_mark_node;
2331 gcc_assert (TYPE_P (destructor));
2333 if (!processing_template_decl)
2335 if (scope == error_mark_node)
2337 error ("invalid qualifying scope in pseudo-destructor name");
2338 return error_mark_node;
2340 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2342 error ("qualified type %qT does not match destructor name ~%qT",
2344 return error_mark_node;
2348 /* [expr.pseudo] says both:
2350 The type designated by the pseudo-destructor-name shall be
2351 the same as the object type.
2355 The cv-unqualified versions of the object type and of the
2356 type designated by the pseudo-destructor-name shall be the
2359 We implement the more generous second sentence, since that is
2360 what most other compilers do. */
2361 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2364 error ("%qE is not of type %qT", object, destructor);
2365 return error_mark_node;
2369 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2372 /* Finish an expression of the form CODE EXPR. */
2375 finish_unary_op_expr (location_t loc, enum tree_code code, tree expr)
2377 tree result = build_x_unary_op (loc, code, expr, tf_warning_or_error);
2378 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2379 overflow_warning (input_location, result);
2384 /* Finish a compound-literal expression. TYPE is the type to which
2385 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2388 finish_compound_literal (tree type, tree compound_literal,
2389 tsubst_flags_t complain)
2391 if (type == error_mark_node)
2392 return error_mark_node;
2394 if (TREE_CODE (type) == REFERENCE_TYPE)
2397 = finish_compound_literal (TREE_TYPE (type), compound_literal,
2399 return cp_build_c_cast (type, compound_literal, complain);
2402 if (!TYPE_OBJ_P (type))
2404 if (complain & tf_error)
2405 error ("compound literal of non-object type %qT", type);
2406 return error_mark_node;
2409 if (processing_template_decl)
2411 TREE_TYPE (compound_literal) = type;
2412 /* Mark the expression as a compound literal. */
2413 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2414 return compound_literal;
2417 type = complete_type (type);
2419 if (TYPE_NON_AGGREGATE_CLASS (type))
2421 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2422 everywhere that deals with function arguments would be a pain, so
2423 just wrap it in a TREE_LIST. The parser set a flag so we know
2424 that it came from T{} rather than T({}). */
2425 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2426 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2427 return build_functional_cast (type, compound_literal, complain);
2430 if (TREE_CODE (type) == ARRAY_TYPE
2431 && check_array_initializer (NULL_TREE, type, compound_literal))
2432 return error_mark_node;
2433 compound_literal = reshape_init (type, compound_literal, complain);
2434 if (SCALAR_TYPE_P (type)
2435 && !BRACE_ENCLOSED_INITIALIZER_P (compound_literal)
2436 && (complain & tf_warning_or_error))
2437 check_narrowing (type, compound_literal);
2438 if (TREE_CODE (type) == ARRAY_TYPE
2439 && TYPE_DOMAIN (type) == NULL_TREE)
2441 cp_complete_array_type_or_error (&type, compound_literal,
2443 if (type == error_mark_node)
2444 return error_mark_node;
2446 compound_literal = digest_init (type, compound_literal, complain);
2447 if (TREE_CODE (compound_literal) == CONSTRUCTOR)
2448 TREE_HAS_CONSTRUCTOR (compound_literal) = true;
2449 /* Put static/constant array temporaries in static variables, but always
2450 represent class temporaries with TARGET_EXPR so we elide copies. */
2451 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type))
2452 && TREE_CODE (type) == ARRAY_TYPE
2453 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2454 && initializer_constant_valid_p (compound_literal, type))
2456 tree decl = create_temporary_var (type);
2457 DECL_INITIAL (decl) = compound_literal;
2458 TREE_STATIC (decl) = 1;
2459 if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type))
2461 /* 5.19 says that a constant expression can include an
2462 lvalue-rvalue conversion applied to "a glvalue of literal type
2463 that refers to a non-volatile temporary object initialized
2464 with a constant expression". Rather than try to communicate
2465 that this VAR_DECL is a temporary, just mark it constexpr. */
2466 DECL_DECLARED_CONSTEXPR_P (decl) = true;
2467 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true;
2468 TREE_CONSTANT (decl) = true;
2470 cp_apply_type_quals_to_decl (cp_type_quals (type), decl);
2471 decl = pushdecl_top_level (decl);
2472 DECL_NAME (decl) = make_anon_name ();
2473 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2477 return get_target_expr_sfinae (compound_literal, complain);
2480 /* Return the declaration for the function-name variable indicated by
2484 finish_fname (tree id)
2488 decl = fname_decl (input_location, C_RID_CODE (id), id);
2489 if (processing_template_decl && current_function_decl)
2490 decl = DECL_NAME (decl);
2494 /* Finish a translation unit. */
2497 finish_translation_unit (void)
2499 /* In case there were missing closebraces,
2500 get us back to the global binding level. */
2502 while (current_namespace != global_namespace)
2505 /* Do file scope __FUNCTION__ et al. */
2506 finish_fname_decls ();
2509 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2510 Returns the parameter. */
2513 finish_template_type_parm (tree aggr, tree identifier)
2515 if (aggr != class_type_node)
2517 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2518 aggr = class_type_node;
2521 return build_tree_list (aggr, identifier);
2524 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2525 Returns the parameter. */
2528 finish_template_template_parm (tree aggr, tree identifier)
2530 tree decl = build_decl (input_location,
2531 TYPE_DECL, identifier, NULL_TREE);
2532 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2533 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2534 DECL_TEMPLATE_RESULT (tmpl) = decl;
2535 DECL_ARTIFICIAL (decl) = 1;
2536 end_template_decl ();
2538 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2540 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2541 /*is_primary=*/true, /*is_partial=*/false,
2544 return finish_template_type_parm (aggr, tmpl);
2547 /* ARGUMENT is the default-argument value for a template template
2548 parameter. If ARGUMENT is invalid, issue error messages and return
2549 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2552 check_template_template_default_arg (tree argument)
2554 if (TREE_CODE (argument) != TEMPLATE_DECL
2555 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2556 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2558 if (TREE_CODE (argument) == TYPE_DECL)
2559 error ("invalid use of type %qT as a default value for a template "
2560 "template-parameter", TREE_TYPE (argument));
2562 error ("invalid default argument for a template template parameter");
2563 return error_mark_node;
2569 /* Begin a class definition, as indicated by T. */
2572 begin_class_definition (tree t)
2574 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2575 return error_mark_node;
2577 if (processing_template_parmlist)
2579 error ("definition of %q#T inside template parameter list", t);
2580 return error_mark_node;
2583 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2584 are passed the same as decimal scalar types. */
2585 if (TREE_CODE (t) == RECORD_TYPE
2586 && !processing_template_decl)
2588 tree ns = TYPE_CONTEXT (t);
2589 if (ns && TREE_CODE (ns) == NAMESPACE_DECL
2590 && DECL_CONTEXT (ns) == std_node
2592 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns)), "decimal"))
2594 const char *n = TYPE_NAME_STRING (t);
2595 if ((strcmp (n, "decimal32") == 0)
2596 || (strcmp (n, "decimal64") == 0)
2597 || (strcmp (n, "decimal128") == 0))
2598 TYPE_TRANSPARENT_AGGR (t) = 1;
2602 /* A non-implicit typename comes from code like:
2604 template <typename T> struct A {
2605 template <typename U> struct A<T>::B ...
2607 This is erroneous. */
2608 else if (TREE_CODE (t) == TYPENAME_TYPE)
2610 error ("invalid definition of qualified type %qT", t);
2611 t = error_mark_node;
2614 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2616 t = make_class_type (RECORD_TYPE);
2617 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2620 if (TYPE_BEING_DEFINED (t))
2622 t = make_class_type (TREE_CODE (t));
2623 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2625 maybe_process_partial_specialization (t);
2627 TYPE_BEING_DEFINED (t) = 1;
2629 if (flag_pack_struct)
2632 TYPE_PACKED (t) = 1;
2633 /* Even though the type is being defined for the first time
2634 here, there might have been a forward declaration, so there
2635 might be cv-qualified variants of T. */
2636 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2637 TYPE_PACKED (v) = 1;
2639 /* Reset the interface data, at the earliest possible
2640 moment, as it might have been set via a class foo;
2642 if (! TYPE_ANONYMOUS_P (t))
2644 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2645 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2646 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2647 (t, finfo->interface_unknown);
2649 reset_specialization();
2651 /* Make a declaration for this class in its own scope. */
2652 build_self_reference ();
2657 /* Finish the member declaration given by DECL. */
2660 finish_member_declaration (tree decl)
2662 if (decl == error_mark_node || decl == NULL_TREE)
2665 if (decl == void_type_node)
2666 /* The COMPONENT was a friend, not a member, and so there's
2667 nothing for us to do. */
2670 /* We should see only one DECL at a time. */
2671 gcc_assert (DECL_CHAIN (decl) == NULL_TREE);
2673 /* Set up access control for DECL. */
2675 = (current_access_specifier == access_private_node);
2676 TREE_PROTECTED (decl)
2677 = (current_access_specifier == access_protected_node);
2678 if (TREE_CODE (decl) == TEMPLATE_DECL)
2680 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2681 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2684 /* Mark the DECL as a member of the current class, unless it's
2685 a member of an enumeration. */
2686 if (TREE_CODE (decl) != CONST_DECL)
2687 DECL_CONTEXT (decl) = current_class_type;
2689 /* Check for bare parameter packs in the member variable declaration. */
2690 if (TREE_CODE (decl) == FIELD_DECL)
2692 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2693 TREE_TYPE (decl) = error_mark_node;
2694 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2695 DECL_ATTRIBUTES (decl) = NULL_TREE;
2700 A C language linkage is ignored for the names of class members
2701 and the member function type of class member functions. */
2702 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2703 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2705 /* Put functions on the TYPE_METHODS list and everything else on the
2706 TYPE_FIELDS list. Note that these are built up in reverse order.
2707 We reverse them (to obtain declaration order) in finish_struct. */
2708 if (TREE_CODE (decl) == FUNCTION_DECL
2709 || DECL_FUNCTION_TEMPLATE_P (decl))
2711 /* We also need to add this function to the
2712 CLASSTYPE_METHOD_VEC. */
2713 if (add_method (current_class_type, decl, NULL_TREE))
2715 DECL_CHAIN (decl) = TYPE_METHODS (current_class_type);
2716 TYPE_METHODS (current_class_type) = decl;
2718 maybe_add_class_template_decl_list (current_class_type, decl,
2722 /* Enter the DECL into the scope of the class, if the class
2723 isn't a closure (whose fields are supposed to be unnamed). */
2724 else if (CLASSTYPE_LAMBDA_EXPR (current_class_type)
2725 || pushdecl_class_level (decl))
2727 if (TREE_CODE (decl) == USING_DECL)
2729 /* For now, ignore class-scope USING_DECLS, so that
2730 debugging backends do not see them. */
2731 DECL_IGNORED_P (decl) = 1;
2734 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2735 go at the beginning. The reason is that lookup_field_1
2736 searches the list in order, and we want a field name to
2737 override a type name so that the "struct stat hack" will
2738 work. In particular:
2740 struct S { enum E { }; int E } s;
2743 is valid. In addition, the FIELD_DECLs must be maintained in
2744 declaration order so that class layout works as expected.
2745 However, we don't need that order until class layout, so we
2746 save a little time by putting FIELD_DECLs on in reverse order
2747 here, and then reversing them in finish_struct_1. (We could
2748 also keep a pointer to the correct insertion points in the
2751 if (TREE_CODE (decl) == TYPE_DECL)
2752 TYPE_FIELDS (current_class_type)
2753 = chainon (TYPE_FIELDS (current_class_type), decl);
2756 DECL_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2757 TYPE_FIELDS (current_class_type) = decl;
2760 maybe_add_class_template_decl_list (current_class_type, decl,
2765 note_decl_for_pch (decl);
2768 /* DECL has been declared while we are building a PCH file. Perform
2769 actions that we might normally undertake lazily, but which can be
2770 performed now so that they do not have to be performed in
2771 translation units which include the PCH file. */
2774 note_decl_for_pch (tree decl)
2776 gcc_assert (pch_file);
2778 /* There's a good chance that we'll have to mangle names at some
2779 point, even if only for emission in debugging information. */
2780 if (VAR_OR_FUNCTION_DECL_P (decl)
2781 && !processing_template_decl)
2785 /* Finish processing a complete template declaration. The PARMS are
2786 the template parameters. */
2789 finish_template_decl (tree parms)
2792 end_template_decl ();
2794 end_specialization ();
2797 /* Finish processing a template-id (which names a type) of the form
2798 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2799 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2800 the scope of template-id indicated. */
2803 finish_template_type (tree name, tree args, int entering_scope)
2807 type = lookup_template_class (name, args,
2808 NULL_TREE, NULL_TREE, entering_scope,
2809 tf_warning_or_error | tf_user);
2810 if (type == error_mark_node)
2812 else if (CLASS_TYPE_P (type) && !alias_type_or_template_p (type))
2813 return TYPE_STUB_DECL (type);
2815 return TYPE_NAME (type);
2818 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2819 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2820 BASE_CLASS, or NULL_TREE if an error occurred. The
2821 ACCESS_SPECIFIER is one of
2822 access_{default,public,protected_private}_node. For a virtual base
2823 we set TREE_TYPE. */
2826 finish_base_specifier (tree base, tree access, bool virtual_p)
2830 if (base == error_mark_node)
2832 error ("invalid base-class specification");
2835 else if (! MAYBE_CLASS_TYPE_P (base))
2837 error ("%qT is not a class type", base);
2842 if (cp_type_quals (base) != 0)
2844 /* DR 484: Can a base-specifier name a cv-qualified
2846 base = TYPE_MAIN_VARIANT (base);
2848 result = build_tree_list (access, base);
2850 TREE_TYPE (result) = integer_type_node;
2856 /* If FNS is a member function, a set of member functions, or a
2857 template-id referring to one or more member functions, return a
2858 BASELINK for FNS, incorporating the current access context.
2859 Otherwise, return FNS unchanged. */
2862 baselink_for_fns (tree fns)
2867 if (BASELINK_P (fns)
2868 || error_operand_p (fns))
2871 scope = ovl_scope (fns);
2872 if (!CLASS_TYPE_P (scope))
2875 cl = currently_open_derived_class (scope);
2878 cl = TYPE_BINFO (cl);
2879 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2882 /* Returns true iff DECL is a variable from a function outside
2886 outer_var_p (tree decl)
2888 return ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2889 && DECL_FUNCTION_SCOPE_P (decl)
2890 && (DECL_CONTEXT (decl) != current_function_decl
2891 || parsing_nsdmi ()));
2894 /* As above, but also checks that DECL is automatic. */
2897 outer_automatic_var_p (tree decl)
2899 return (outer_var_p (decl)
2900 && !TREE_STATIC (decl));
2903 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2904 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2905 if non-NULL, is the type or namespace used to explicitly qualify
2906 ID_EXPRESSION. DECL is the entity to which that name has been
2909 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2910 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2911 be set to true if this expression isn't permitted in a
2912 constant-expression, but it is otherwise not set by this function.
2913 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2914 constant-expression, but a non-constant expression is also
2917 DONE is true if this expression is a complete postfix-expression;
2918 it is false if this expression is followed by '->', '[', '(', etc.
2919 ADDRESS_P is true iff this expression is the operand of '&'.
2920 TEMPLATE_P is true iff the qualified-id was of the form
2921 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2922 appears as a template argument.
2924 If an error occurs, and it is the kind of error that might cause
2925 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2926 is the caller's responsibility to issue the message. *ERROR_MSG
2927 will be a string with static storage duration, so the caller need
2930 Return an expression for the entity, after issuing appropriate
2931 diagnostics. This function is also responsible for transforming a
2932 reference to a non-static member into a COMPONENT_REF that makes
2933 the use of "this" explicit.
2935 Upon return, *IDK will be filled in appropriately. */
2937 finish_id_expression (tree id_expression,
2941 bool integral_constant_expression_p,
2942 bool allow_non_integral_constant_expression_p,
2943 bool *non_integral_constant_expression_p,
2947 bool template_arg_p,
2948 const char **error_msg,
2949 location_t location)
2951 decl = strip_using_decl (decl);
2953 /* Initialize the output parameters. */
2954 *idk = CP_ID_KIND_NONE;
2957 if (id_expression == error_mark_node)
2958 return error_mark_node;
2959 /* If we have a template-id, then no further lookup is
2960 required. If the template-id was for a template-class, we
2961 will sometimes have a TYPE_DECL at this point. */
2962 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2963 || TREE_CODE (decl) == TYPE_DECL)
2965 /* Look up the name. */
2968 if (decl == error_mark_node)
2970 /* Name lookup failed. */
2973 || (!dependent_type_p (scope)
2974 && !(identifier_p (id_expression)
2975 && IDENTIFIER_TYPENAME_P (id_expression)
2976 && dependent_type_p (TREE_TYPE (id_expression))))))
2978 /* If the qualifying type is non-dependent (and the name
2979 does not name a conversion operator to a dependent
2980 type), issue an error. */
2981 qualified_name_lookup_error (scope, id_expression, decl, location);
2982 return error_mark_node;
2986 /* It may be resolved via Koenig lookup. */
2987 *idk = CP_ID_KIND_UNQUALIFIED;
2988 return id_expression;
2991 decl = id_expression;
2993 /* If DECL is a variable that would be out of scope under
2994 ANSI/ISO rules, but in scope in the ARM, name lookup
2995 will succeed. Issue a diagnostic here. */
2997 decl = check_for_out_of_scope_variable (decl);
2999 /* Remember that the name was used in the definition of
3000 the current class so that we can check later to see if
3001 the meaning would have been different after the class
3002 was entirely defined. */
3003 if (!scope && decl != error_mark_node && identifier_p (id_expression))
3004 maybe_note_name_used_in_class (id_expression, decl);
3006 /* Disallow uses of local variables from containing functions, except
3007 within lambda-expressions. */
3008 if (!outer_var_p (decl)
3009 /* It's not a use (3.2) if we're in an unevaluated context. */
3010 || cp_unevaluated_operand)
3012 else if (TREE_STATIC (decl))
3014 if (processing_template_decl)
3015 /* For a use of an outer static var, return the identifier so
3016 that we'll look it up again in the instantiation. */
3017 return id_expression;
3021 tree context = DECL_CONTEXT (decl);
3022 tree containing_function = current_function_decl;
3023 tree lambda_stack = NULL_TREE;
3024 tree lambda_expr = NULL_TREE;
3025 tree initializer = convert_from_reference (decl);
3027 /* Mark it as used now even if the use is ill-formed. */
3030 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
3031 support for an approach in which a reference to a local
3032 [constant] automatic variable in a nested class or lambda body
3033 would enter the expression as an rvalue, which would reduce
3034 the complexity of the problem"
3036 FIXME update for final resolution of core issue 696. */
3037 if (decl_constant_var_p (decl))
3039 if (processing_template_decl)
3040 /* In a template, the constant value may not be in a usable
3041 form, so look it up again at instantiation time. */
3042 return id_expression;
3044 return integral_constant_value (decl);
3047 if (parsing_nsdmi ())
3048 containing_function = NULL_TREE;
3049 /* If we are in a lambda function, we can move out until we hit
3051 2. a non-lambda function, or
3052 3. a non-default capturing lambda function. */
3053 else while (context != containing_function
3054 && LAMBDA_FUNCTION_P (containing_function))
3056 lambda_expr = CLASSTYPE_LAMBDA_EXPR
3057 (DECL_CONTEXT (containing_function));
3059 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr)
3063 lambda_stack = tree_cons (NULL_TREE,
3068 = decl_function_context (containing_function);
3071 if (context == containing_function)
3073 decl = add_default_capture (lambda_stack,
3074 /*id=*/DECL_NAME (decl),
3077 else if (lambda_expr)
3079 error ("%qD is not captured", decl);
3080 return error_mark_node;
3084 error (TREE_CODE (decl) == VAR_DECL
3085 ? G_("use of local variable with automatic storage from containing function")
3086 : G_("use of parameter from containing function"));
3087 error (" %q+#D declared here", decl);
3088 return error_mark_node;
3092 /* Also disallow uses of function parameters outside the function
3093 body, except inside an unevaluated context (i.e. decltype). */
3094 if (TREE_CODE (decl) == PARM_DECL
3095 && DECL_CONTEXT (decl) == NULL_TREE
3096 && !cp_unevaluated_operand)
3098 error ("use of parameter %qD outside function body", decl);
3099 return error_mark_node;
3103 /* If we didn't find anything, or what we found was a type,
3104 then this wasn't really an id-expression. */
3105 if (TREE_CODE (decl) == TEMPLATE_DECL
3106 && !DECL_FUNCTION_TEMPLATE_P (decl))
3108 *error_msg = "missing template arguments";
3109 return error_mark_node;
3111 else if (TREE_CODE (decl) == TYPE_DECL
3112 || TREE_CODE (decl) == NAMESPACE_DECL)
3114 *error_msg = "expected primary-expression";
3115 return error_mark_node;
3118 /* If the name resolved to a template parameter, there is no
3119 need to look it up again later. */
3120 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
3121 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
3125 *idk = CP_ID_KIND_NONE;
3126 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
3127 decl = TEMPLATE_PARM_DECL (decl);
3128 r = convert_from_reference (DECL_INITIAL (decl));
3130 if (integral_constant_expression_p
3131 && !dependent_type_p (TREE_TYPE (decl))
3132 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
3134 if (!allow_non_integral_constant_expression_p)
3135 error ("template parameter %qD of type %qT is not allowed in "
3136 "an integral constant expression because it is not of "
3137 "integral or enumeration type", decl, TREE_TYPE (decl));
3138 *non_integral_constant_expression_p = true;
3146 /* If the declaration was explicitly qualified indicate
3147 that. The semantics of `A::f(3)' are different than
3148 `f(3)' if `f' is virtual. */
3150 ? CP_ID_KIND_QUALIFIED
3151 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
3152 ? CP_ID_KIND_TEMPLATE_ID
3153 : CP_ID_KIND_UNQUALIFIED));
3158 An id-expression is type-dependent if it contains an
3159 identifier that was declared with a dependent type.
3161 The standard is not very specific about an id-expression that
3162 names a set of overloaded functions. What if some of them
3163 have dependent types and some of them do not? Presumably,
3164 such a name should be treated as a dependent name. */
3165 /* Assume the name is not dependent. */
3166 dependent_p = false;
3167 if (!processing_template_decl)
3168 /* No names are dependent outside a template. */
3170 else if (TREE_CODE (decl) == CONST_DECL)
3171 /* We don't want to treat enumerators as dependent. */
3173 /* A template-id where the name of the template was not resolved
3174 is definitely dependent. */
3175 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
3176 && (identifier_p (TREE_OPERAND (decl, 0))))
3178 /* For anything except an overloaded function, just check its
3180 else if (!is_overloaded_fn (decl))
3182 = dependent_type_p (TREE_TYPE (decl));
3183 /* For a set of overloaded functions, check each of the
3189 if (BASELINK_P (fns))
3190 fns = BASELINK_FUNCTIONS (fns);
3192 /* For a template-id, check to see if the template
3193 arguments are dependent. */
3194 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
3196 tree args = TREE_OPERAND (fns, 1);
3197 dependent_p = any_dependent_template_arguments_p (args);
3198 /* The functions are those referred to by the
3200 fns = TREE_OPERAND (fns, 0);
3203 /* If there are no dependent template arguments, go through
3204 the overloaded functions. */
3205 while (fns && !dependent_p)
3207 tree fn = OVL_CURRENT (fns);
3209 /* Member functions of dependent classes are
3211 if (TREE_CODE (fn) == FUNCTION_DECL
3212 && type_dependent_expression_p (fn))
3214 else if (TREE_CODE (fn) == TEMPLATE_DECL
3215 && dependent_template_p (fn))
3218 fns = OVL_NEXT (fns);
3222 /* If the name was dependent on a template parameter, we will
3223 resolve the name at instantiation time. */
3226 /* Create a SCOPE_REF for qualified names, if the scope is
3232 if (address_p && done)
3233 decl = finish_qualified_id_expr (scope, decl,
3239 tree type = NULL_TREE;
3240 if (DECL_P (decl) && !dependent_scope_p (scope))
3241 type = TREE_TYPE (decl);
3242 decl = build_qualified_name (type,
3248 if (TREE_TYPE (decl))
3249 decl = convert_from_reference (decl);
3252 /* A TEMPLATE_ID already contains all the information we
3254 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
3255 return id_expression;
3256 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
3257 /* If we found a variable, then name lookup during the
3258 instantiation will always resolve to the same VAR_DECL
3259 (or an instantiation thereof). */
3260 if (TREE_CODE (decl) == VAR_DECL
3261 || TREE_CODE (decl) == PARM_DECL)
3264 return convert_from_reference (decl);
3266 /* The same is true for FIELD_DECL, but we also need to
3267 make sure that the syntax is correct. */
3268 else if (TREE_CODE (decl) == FIELD_DECL)
3270 /* Since SCOPE is NULL here, this is an unqualified name.
3271 Access checking has been performed during name lookup
3272 already. Turn off checking to avoid duplicate errors. */
3273 push_deferring_access_checks (dk_no_check);
3274 decl = finish_non_static_data_member
3276 /*qualifying_scope=*/NULL_TREE);
3277 pop_deferring_access_checks ();
3280 return id_expression;
3283 if (TREE_CODE (decl) == NAMESPACE_DECL)
3285 error ("use of namespace %qD as expression", decl);
3286 return error_mark_node;
3288 else if (DECL_CLASS_TEMPLATE_P (decl))
3290 error ("use of class template %qT as expression", decl);
3291 return error_mark_node;
3293 else if (TREE_CODE (decl) == TREE_LIST)
3295 /* Ambiguous reference to base members. */
3296 error ("request for member %qD is ambiguous in "
3297 "multiple inheritance lattice", id_expression);
3298 print_candidates (decl);
3299 return error_mark_node;
3302 /* Mark variable-like entities as used. Functions are similarly
3303 marked either below or after overload resolution. */
3304 if ((TREE_CODE (decl) == VAR_DECL
3305 || TREE_CODE (decl) == PARM_DECL
3306 || TREE_CODE (decl) == CONST_DECL
3307 || TREE_CODE (decl) == RESULT_DECL)
3308 && !mark_used (decl))
3309 return error_mark_node;
3311 /* Only certain kinds of names are allowed in constant
3312 expression. Template parameters have already
3313 been handled above. */
3314 if (! error_operand_p (decl)
3315 && integral_constant_expression_p
3316 && ! decl_constant_var_p (decl)
3317 && TREE_CODE (decl) != CONST_DECL
3318 && ! builtin_valid_in_constant_expr_p (decl))
3320 if (!allow_non_integral_constant_expression_p)
3322 error ("%qD cannot appear in a constant-expression", decl);
3323 return error_mark_node;
3325 *non_integral_constant_expression_p = true;
3329 if (TREE_CODE (decl) == VAR_DECL
3330 && !cp_unevaluated_operand
3331 && DECL_THREAD_LOCAL_P (decl)
3332 && (wrap = get_tls_wrapper_fn (decl)))
3334 /* Replace an evaluated use of the thread_local variable with
3335 a call to its wrapper. */
3336 decl = build_cxx_call (wrap, 0, NULL, tf_warning_or_error);
3340 decl = (adjust_result_of_qualified_name_lookup
3341 (decl, scope, current_nonlambda_class_type()));
3343 if (TREE_CODE (decl) == FUNCTION_DECL)
3347 decl = finish_qualified_id_expr (scope,
3354 decl = convert_from_reference (decl);
3356 else if (TREE_CODE (decl) == FIELD_DECL)
3358 /* Since SCOPE is NULL here, this is an unqualified name.
3359 Access checking has been performed during name lookup
3360 already. Turn off checking to avoid duplicate errors. */
3361 push_deferring_access_checks (dk_no_check);
3362 decl = finish_non_static_data_member (decl, NULL_TREE,
3363 /*qualifying_scope=*/NULL_TREE);
3364 pop_deferring_access_checks ();
3366 else if (is_overloaded_fn (decl))
3370 first_fn = get_first_fn (decl);
3371 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
3372 first_fn = DECL_TEMPLATE_RESULT (first_fn);
3374 if (!really_overloaded_fn (decl)
3375 && !mark_used (first_fn))
3376 return error_mark_node;
3379 && TREE_CODE (first_fn) == FUNCTION_DECL
3380 && DECL_FUNCTION_MEMBER_P (first_fn)
3381 && !shared_member_p (decl))
3383 /* A set of member functions. */
3384 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3385 return finish_class_member_access_expr (decl, id_expression,
3386 /*template_p=*/false,
3387 tf_warning_or_error);
3390 decl = baselink_for_fns (decl);
3394 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3395 && DECL_CLASS_SCOPE_P (decl))
3397 tree context = context_for_name_lookup (decl);
3398 if (context != current_class_type)
3400 tree path = currently_open_derived_class (context);
3401 perform_or_defer_access_check (TYPE_BINFO (path),
3403 tf_warning_or_error);
3407 decl = convert_from_reference (decl);
3411 if (TREE_DEPRECATED (decl))
3412 warn_deprecated_use (decl, NULL_TREE);
3417 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3418 use as a type-specifier. */
3421 finish_typeof (tree expr)
3425 if (type_dependent_expression_p (expr))
3427 type = cxx_make_type (TYPEOF_TYPE);
3428 TYPEOF_TYPE_EXPR (type) = expr;
3429 SET_TYPE_STRUCTURAL_EQUALITY (type);
3434 expr = mark_type_use (expr);
3436 type = unlowered_expr_type (expr);
3438 if (!type || type == unknown_type_node)
3440 error ("type of %qE is unknown", expr);
3441 return error_mark_node;
3447 /* Implement the __underlying_type keyword: Return the underlying
3448 type of TYPE, suitable for use as a type-specifier. */
3451 finish_underlying_type (tree type)
3453 tree underlying_type;
3455 if (processing_template_decl)
3457 underlying_type = cxx_make_type (UNDERLYING_TYPE);
3458 UNDERLYING_TYPE_TYPE (underlying_type) = type;
3459 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type);
3461 return underlying_type;
3464 complete_type (type);
3466 if (TREE_CODE (type) != ENUMERAL_TYPE)
3468 error ("%qT is not an enumeration type", type);
3469 return error_mark_node;
3472 underlying_type = ENUM_UNDERLYING_TYPE (type);
3474 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
3475 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
3476 See finish_enum_value_list for details. */
3477 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type))
3479 = c_common_type_for_mode (TYPE_MODE (underlying_type),
3480 TYPE_UNSIGNED (underlying_type));
3482 return underlying_type;
3485 /* Implement the __direct_bases keyword: Return the direct base classes
3489 calculate_direct_bases (tree type)
3491 vec<tree, va_gc> *vector = make_tree_vector();
3492 tree bases_vec = NULL_TREE;
3493 vec<tree, va_gc> *base_binfos;
3497 complete_type (type);
3499 if (!NON_UNION_CLASS_TYPE_P (type))
3500 return make_tree_vec (0);
3502 base_binfos = BINFO_BASE_BINFOS (TYPE_BINFO (type));
3504 /* Virtual bases are initialized first */
3505 for (i = 0; base_binfos->iterate (i, &binfo); i++)
3507 if (BINFO_VIRTUAL_P (binfo))
3509 vec_safe_push (vector, binfo);
3513 /* Now non-virtuals */
3514 for (i = 0; base_binfos->iterate (i, &binfo); i++)
3516 if (!BINFO_VIRTUAL_P (binfo))
3518 vec_safe_push (vector, binfo);
3523 bases_vec = make_tree_vec (vector->length ());
3525 for (i = 0; i < vector->length (); ++i)
3527 TREE_VEC_ELT (bases_vec, i) = BINFO_TYPE ((*vector)[i]);
3532 /* Implement the __bases keyword: Return the base classes
3535 /* Find morally non-virtual base classes by walking binfo hierarchy */
3536 /* Virtual base classes are handled separately in finish_bases */
3539 dfs_calculate_bases_pre (tree binfo, void * /*data_*/)
3541 /* Don't walk bases of virtual bases */
3542 return BINFO_VIRTUAL_P (binfo) ? dfs_skip_bases : NULL_TREE;
3546 dfs_calculate_bases_post (tree binfo, void *data_)
3548 vec<tree, va_gc> **data = ((vec<tree, va_gc> **) data_);
3549 if (!BINFO_VIRTUAL_P (binfo))
3551 vec_safe_push (*data, BINFO_TYPE (binfo));
3556 /* Calculates the morally non-virtual base classes of a class */
3557 static vec<tree, va_gc> *
3558 calculate_bases_helper (tree type)
3560 vec<tree, va_gc> *vector = make_tree_vector();
3562 /* Now add non-virtual base classes in order of construction */
3563 dfs_walk_all (TYPE_BINFO (type),
3564 dfs_calculate_bases_pre, dfs_calculate_bases_post, &vector);
3569 calculate_bases (tree type)
3571 vec<tree, va_gc> *vector = make_tree_vector();
3572 tree bases_vec = NULL_TREE;
3574 vec<tree, va_gc> *vbases;
3575 vec<tree, va_gc> *nonvbases;
3578 complete_type (type);
3580 if (!NON_UNION_CLASS_TYPE_P (type))
3581 return make_tree_vec (0);
3583 /* First go through virtual base classes */
3584 for (vbases = CLASSTYPE_VBASECLASSES (type), i = 0;
3585 vec_safe_iterate (vbases, i, &binfo); i++)
3587 vec<tree, va_gc> *vbase_bases;
3588 vbase_bases = calculate_bases_helper (BINFO_TYPE (binfo));
3589 vec_safe_splice (vector, vbase_bases);
3590 release_tree_vector (vbase_bases);
3593 /* Now for the non-virtual bases */
3594 nonvbases = calculate_bases_helper (type);
3595 vec_safe_splice (vector, nonvbases);
3596 release_tree_vector (nonvbases);
3598 /* Last element is entire class, so don't copy */
3599 bases_vec = make_tree_vec (vector->length () - 1);
3601 for (i = 0; i < vector->length () - 1; ++i)
3603 TREE_VEC_ELT (bases_vec, i) = (*vector)[i];
3605 release_tree_vector (vector);
3610 finish_bases (tree type, bool direct)
3612 tree bases = NULL_TREE;
3614 if (!processing_template_decl)
3616 /* Parameter packs can only be used in templates */
3617 error ("Parameter pack __bases only valid in template declaration");
3618 return error_mark_node;
3621 bases = cxx_make_type (BASES);
3622 BASES_TYPE (bases) = type;
3623 BASES_DIRECT (bases) = direct;
3624 SET_TYPE_STRUCTURAL_EQUALITY (bases);
3629 /* Perform C++-specific checks for __builtin_offsetof before calling
3633 finish_offsetof (tree expr)
3635 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3637 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3638 TREE_OPERAND (expr, 2));
3639 return error_mark_node;
3641 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3642 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3643 || TREE_TYPE (expr) == unknown_type_node)
3645 if (TREE_CODE (expr) == COMPONENT_REF
3646 || TREE_CODE (expr) == COMPOUND_EXPR)
3647 expr = TREE_OPERAND (expr, 1);
3648 error ("cannot apply %<offsetof%> to member function %qD", expr);
3649 return error_mark_node;
3651 if (REFERENCE_REF_P (expr))
3652 expr = TREE_OPERAND (expr, 0);
3653 if (TREE_CODE (expr) == COMPONENT_REF)
3655 tree object = TREE_OPERAND (expr, 0);
3656 if (!complete_type_or_else (TREE_TYPE (object), object))
3657 return error_mark_node;
3659 return fold_offsetof (expr);
3662 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3663 function is broken out from the above for the benefit of the tree-ssa
3667 simplify_aggr_init_expr (tree *tp)
3669 tree aggr_init_expr = *tp;
3671 /* Form an appropriate CALL_EXPR. */
3672 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3673 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3674 tree type = TREE_TYPE (slot);
3677 enum style_t { ctor, arg, pcc } style;
3679 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3681 #ifdef PCC_STATIC_STRUCT_RETURN
3687 gcc_assert (TREE_ADDRESSABLE (type));
3691 call_expr = build_call_array_loc (input_location,
3692 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3694 aggr_init_expr_nargs (aggr_init_expr),
3695 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3696 TREE_NOTHROW (call_expr) = TREE_NOTHROW (aggr_init_expr);
3700 /* Replace the first argument to the ctor with the address of the
3702 cxx_mark_addressable (slot);
3703 CALL_EXPR_ARG (call_expr, 0) =
3704 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3706 else if (style == arg)
3708 /* Just mark it addressable here, and leave the rest to
3709 expand_call{,_inline}. */
3710 cxx_mark_addressable (slot);
3711 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3712 call_expr = build2 (INIT_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3714 else if (style == pcc)
3716 /* If we're using the non-reentrant PCC calling convention, then we
3717 need to copy the returned value out of the static buffer into the
3719 push_deferring_access_checks (dk_no_check);
3720 call_expr = build_aggr_init (slot, call_expr,
3721 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3722 tf_warning_or_error);
3723 pop_deferring_access_checks ();
3724 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3727 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3729 tree init = build_zero_init (type, NULL_TREE,
3730 /*static_storage_p=*/false);
3731 init = build2 (INIT_EXPR, void_type_node, slot, init);
3732 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3739 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3742 emit_associated_thunks (tree fn)
3744 /* When we use vcall offsets, we emit thunks with the virtual
3745 functions to which they thunk. The whole point of vcall offsets
3746 is so that you can know statically the entire set of thunks that
3747 will ever be needed for a given virtual function, thereby
3748 enabling you to output all the thunks with the function itself. */
3749 if (DECL_VIRTUAL_P (fn)
3750 /* Do not emit thunks for extern template instantiations. */
3751 && ! DECL_REALLY_EXTERN (fn))
3755 for (thunk = DECL_THUNKS (fn); thunk; thunk = DECL_CHAIN (thunk))
3757 if (!THUNK_ALIAS (thunk))
3759 use_thunk (thunk, /*emit_p=*/1);
3760 if (DECL_RESULT_THUNK_P (thunk))
3764 for (probe = DECL_THUNKS (thunk);
3765 probe; probe = DECL_CHAIN (probe))
3766 use_thunk (probe, /*emit_p=*/1);
3770 gcc_assert (!DECL_THUNKS (thunk));
3775 /* Returns true iff FUN is an instantiation of a constexpr function
3779 is_instantiation_of_constexpr (tree fun)
3781 return (DECL_TEMPLOID_INSTANTIATION (fun)
3782 && DECL_DECLARED_CONSTEXPR_P (DECL_TEMPLATE_RESULT
3783 (DECL_TI_TEMPLATE (fun))));
3786 /* Generate RTL for FN. */
3789 expand_or_defer_fn_1 (tree fn)
3791 /* When the parser calls us after finishing the body of a template
3792 function, we don't really want to expand the body. */
3793 if (processing_template_decl)
3795 /* Normally, collection only occurs in rest_of_compilation. So,
3796 if we don't collect here, we never collect junk generated
3797 during the processing of templates until we hit a
3798 non-template function. It's not safe to do this inside a
3799 nested class, though, as the parser may have local state that
3800 is not a GC root. */
3801 if (!function_depth)
3806 gcc_assert (DECL_SAVED_TREE (fn));
3808 /* If this is a constructor or destructor body, we have to clone
3810 if (maybe_clone_body (fn))
3812 /* We don't want to process FN again, so pretend we've written
3813 it out, even though we haven't. */
3814 TREE_ASM_WRITTEN (fn) = 1;
3815 /* If this is an instantiation of a constexpr function, keep
3816 DECL_SAVED_TREE for explain_invalid_constexpr_fn. */
3817 if (!is_instantiation_of_constexpr (fn))
3818 DECL_SAVED_TREE (fn) = NULL_TREE;
3822 /* We make a decision about linkage for these functions at the end
3823 of the compilation. Until that point, we do not want the back
3824 end to output them -- but we do want it to see the bodies of
3825 these functions so that it can inline them as appropriate. */
3826 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3828 if (DECL_INTERFACE_KNOWN (fn))
3829 /* We've already made a decision as to how this function will
3833 DECL_EXTERNAL (fn) = 1;
3834 DECL_NOT_REALLY_EXTERN (fn) = 1;
3835 note_vague_linkage_fn (fn);
3836 /* A non-template inline function with external linkage will
3837 always be COMDAT. As we must eventually determine the
3838 linkage of all functions, and as that causes writes to
3839 the data mapped in from the PCH file, it's advantageous
3840 to mark the functions at this point. */
3841 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3843 /* This function must have external linkage, as
3844 otherwise DECL_INTERFACE_KNOWN would have been
3846 gcc_assert (TREE_PUBLIC (fn));
3847 comdat_linkage (fn);
3848 DECL_INTERFACE_KNOWN (fn) = 1;
3852 import_export_decl (fn);
3854 /* If the user wants us to keep all inline functions, then mark
3855 this function as needed so that finish_file will make sure to
3856 output it later. Similarly, all dllexport'd functions must
3857 be emitted; there may be callers in other DLLs. */
3858 if ((flag_keep_inline_functions
3859 && DECL_DECLARED_INLINE_P (fn)
3860 && !DECL_REALLY_EXTERN (fn))
3861 || (flag_keep_inline_dllexport
3862 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn))))
3865 DECL_EXTERNAL (fn) = 0;
3869 /* There's no reason to do any of the work here if we're only doing
3870 semantic analysis; this code just generates RTL. */
3871 if (flag_syntax_only)
3878 expand_or_defer_fn (tree fn)
3880 if (expand_or_defer_fn_1 (fn))
3884 /* Expand or defer, at the whim of the compilation unit manager. */
3885 cgraph_finalize_function (fn, function_depth > 1);
3886 emit_associated_thunks (fn);
3896 hash_table <pointer_hash <tree_node> > visited;
3899 /* Helper function for walk_tree, used by finalize_nrv below. */
3902 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3904 struct nrv_data *dp = (struct nrv_data *)data;
3907 /* No need to walk into types. There wouldn't be any need to walk into
3908 non-statements, except that we have to consider STMT_EXPRs. */
3911 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3912 but differs from using NULL_TREE in that it indicates that we care
3913 about the value of the RESULT_DECL. */
3914 else if (TREE_CODE (*tp) == RETURN_EXPR)
3915 TREE_OPERAND (*tp, 0) = dp->result;
3916 /* Change all cleanups for the NRV to only run when an exception is
3918 else if (TREE_CODE (*tp) == CLEANUP_STMT
3919 && CLEANUP_DECL (*tp) == dp->var)
3920 CLEANUP_EH_ONLY (*tp) = 1;
3921 /* Replace the DECL_EXPR for the NRV with an initialization of the
3922 RESULT_DECL, if needed. */
3923 else if (TREE_CODE (*tp) == DECL_EXPR
3924 && DECL_EXPR_DECL (*tp) == dp->var)
3927 if (DECL_INITIAL (dp->var)
3928 && DECL_INITIAL (dp->var) != error_mark_node)
3929 init = build2 (INIT_EXPR, void_type_node, dp->result,
3930 DECL_INITIAL (dp->var));
3932 init = build_empty_stmt (EXPR_LOCATION (*tp));
3933 DECL_INITIAL (dp->var) = NULL_TREE;
3934 SET_EXPR_LOCATION (init, EXPR_LOCATION (*tp));
3937 /* And replace all uses of the NRV with the RESULT_DECL. */
3938 else if (*tp == dp->var)
3941 /* Avoid walking into the same tree more than once. Unfortunately, we
3942 can't just use walk_tree_without duplicates because it would only call
3943 us for the first occurrence of dp->var in the function body. */
3944 slot = dp->visited.find_slot (*tp, INSERT);
3950 /* Keep iterating. */
3954 /* Called from finish_function to implement the named return value
3955 optimization by overriding all the RETURN_EXPRs and pertinent
3956 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3957 RESULT_DECL for the function. */
3960 finalize_nrv (tree *tp, tree var, tree result)
3962 struct nrv_data data;
3964 /* Copy name from VAR to RESULT. */
3965 DECL_NAME (result) = DECL_NAME (var);
3966 /* Don't forget that we take its address. */
3967 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3968 /* Finally set DECL_VALUE_EXPR to avoid assigning
3969 a stack slot at -O0 for the original var and debug info
3970 uses RESULT location for VAR. */
3971 SET_DECL_VALUE_EXPR (var, result);
3972 DECL_HAS_VALUE_EXPR_P (var) = 1;
3975 data.result = result;
3976 data.visited.create (37);
3977 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3978 data.visited.dispose ();
3981 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3984 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3985 bool need_copy_ctor, bool need_copy_assignment)
3987 int save_errorcount = errorcount;
3990 /* Always allocate 3 elements for simplicity. These are the
3991 function decls for the ctor, dtor, and assignment op.
3992 This layout is known to the three lang hooks,
3993 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3994 and cxx_omp_clause_assign_op. */
3995 info = make_tree_vec (3);
3996 CP_OMP_CLAUSE_INFO (c) = info;
3998 if (need_default_ctor || need_copy_ctor)
4000 if (need_default_ctor)
4001 t = get_default_ctor (type);
4003 t = get_copy_ctor (type, tf_warning_or_error);
4005 if (t && !trivial_fn_p (t))
4006 TREE_VEC_ELT (info, 0) = t;
4009 if ((need_default_ctor || need_copy_ctor)
4010 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
4011 TREE_VEC_ELT (info, 1) = get_dtor (type, tf_warning_or_error);
4013 if (need_copy_assignment)
4015 t = get_copy_assign (type);
4017 if (t && !trivial_fn_p (t))
4018 TREE_VEC_ELT (info, 2) = t;
4021 return errorcount != save_errorcount;
4024 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
4025 Remove any elements from the list that are invalid. */
4028 finish_omp_clauses (tree clauses)
4030 bitmap_head generic_head, firstprivate_head, lastprivate_head;
4031 tree c, t, *pc = &clauses;
4034 bitmap_obstack_initialize (NULL);
4035 bitmap_initialize (&generic_head, &bitmap_default_obstack);
4036 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
4037 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
4039 for (pc = &clauses, c = clauses; c ; c = *pc)
4041 bool remove = false;
4043 switch (OMP_CLAUSE_CODE (c))
4045 case OMP_CLAUSE_SHARED:
4047 goto check_dup_generic;
4048 case OMP_CLAUSE_PRIVATE:
4050 goto check_dup_generic;
4051 case OMP_CLAUSE_REDUCTION:
4053 goto check_dup_generic;
4054 case OMP_CLAUSE_COPYPRIVATE:
4055 name = "copyprivate";
4056 goto check_dup_generic;
4057 case OMP_CLAUSE_COPYIN:
4059 goto check_dup_generic;
4061 t = OMP_CLAUSE_DECL (c);
4062 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
4064 if (processing_template_decl)
4067 error ("%qD is not a variable in clause %qs", t, name);
4069 error ("%qE is not a variable in clause %qs", t, name);
4072 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
4073 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
4074 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
4076 error ("%qD appears more than once in data clauses", t);
4080 bitmap_set_bit (&generic_head, DECL_UID (t));
4083 case OMP_CLAUSE_FIRSTPRIVATE:
4084 t = OMP_CLAUSE_DECL (c);
4085 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
4087 if (processing_template_decl)
4090 error ("%qD is not a variable in clause %<firstprivate%>", t);
4092 error ("%qE is not a variable in clause %<firstprivate%>", t);
4095 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
4096 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
4098 error ("%qD appears more than once in data clauses", t);
4102 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
4105 case OMP_CLAUSE_LASTPRIVATE:
4106 t = OMP_CLAUSE_DECL (c);
4107 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
4109 if (processing_template_decl)
4112 error ("%qD is not a variable in clause %<lastprivate%>", t);
4114 error ("%qE is not a variable in clause %<lastprivate%>", t);
4117 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
4118 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
4120 error ("%qD appears more than once in data clauses", t);
4124 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
4128 t = OMP_CLAUSE_IF_EXPR (c);
4129 t = maybe_convert_cond (t);
4130 if (t == error_mark_node)
4132 else if (!processing_template_decl)
4133 t = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4134 OMP_CLAUSE_IF_EXPR (c) = t;
4137 case OMP_CLAUSE_FINAL:
4138 t = OMP_CLAUSE_FINAL_EXPR (c);
4139 t = maybe_convert_cond (t);
4140 if (t == error_mark_node)
4142 else if (!processing_template_decl)
4143 t = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4144 OMP_CLAUSE_FINAL_EXPR (c) = t;
4147 case OMP_CLAUSE_NUM_THREADS:
4148 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
4149 if (t == error_mark_node)
4151 else if (!type_dependent_expression_p (t)
4152 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
4154 error ("num_threads expression must be integral");
4159 t = mark_rvalue_use (t);
4160 if (!processing_template_decl)
4161 t = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4162 OMP_CLAUSE_NUM_THREADS_EXPR (c) = t;
4166 case OMP_CLAUSE_SCHEDULE:
4167 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
4170 else if (t == error_mark_node)
4172 else if (!type_dependent_expression_p (t)
4173 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
4175 error ("schedule chunk size expression must be integral");
4180 t = mark_rvalue_use (t);
4181 if (!processing_template_decl)
4182 t = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4183 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c) = t;
4187 case OMP_CLAUSE_NOWAIT:
4188 case OMP_CLAUSE_ORDERED:
4189 case OMP_CLAUSE_DEFAULT:
4190 case OMP_CLAUSE_UNTIED:
4191 case OMP_CLAUSE_COLLAPSE:
4192 case OMP_CLAUSE_MERGEABLE:
4200 *pc = OMP_CLAUSE_CHAIN (c);
4202 pc = &OMP_CLAUSE_CHAIN (c);
4205 for (pc = &clauses, c = clauses; c ; c = *pc)
4207 enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c);
4208 bool remove = false;
4209 bool need_complete_non_reference = false;
4210 bool need_default_ctor = false;
4211 bool need_copy_ctor = false;
4212 bool need_copy_assignment = false;
4213 bool need_implicitly_determined = false;
4214 tree type, inner_type;
4218 case OMP_CLAUSE_SHARED:
4220 need_implicitly_determined = true;
4222 case OMP_CLAUSE_PRIVATE:
4224 need_complete_non_reference = true;
4225 need_default_ctor = true;
4226 need_implicitly_determined = true;
4228 case OMP_CLAUSE_FIRSTPRIVATE:
4229 name = "firstprivate";
4230 need_complete_non_reference = true;
4231 need_copy_ctor = true;
4232 need_implicitly_determined = true;
4234 case OMP_CLAUSE_LASTPRIVATE:
4235 name = "lastprivate";
4236 need_complete_non_reference = true;
4237 need_copy_assignment = true;
4238 need_implicitly_determined = true;
4240 case OMP_CLAUSE_REDUCTION:
4242 need_implicitly_determined = true;
4244 case OMP_CLAUSE_COPYPRIVATE:
4245 name = "copyprivate";
4246 need_copy_assignment = true;
4248 case OMP_CLAUSE_COPYIN:
4250 need_copy_assignment = true;
4253 pc = &OMP_CLAUSE_CHAIN (c);
4257 t = OMP_CLAUSE_DECL (c);
4258 if (processing_template_decl
4259 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
4261 pc = &OMP_CLAUSE_CHAIN (c);
4267 case OMP_CLAUSE_LASTPRIVATE:
4268 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
4269 need_default_ctor = true;
4272 case OMP_CLAUSE_REDUCTION:
4273 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
4274 || POINTER_TYPE_P (TREE_TYPE (t)))
4276 error ("%qE has invalid type for %<reduction%>", t);
4279 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
4281 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
4291 error ("%qE has invalid type for %<reduction(%s)%>",
4292 t, operator_name_info[r_code].name);
4298 case OMP_CLAUSE_COPYIN:
4299 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
4301 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
4310 if (need_complete_non_reference || need_copy_assignment)
4312 t = require_complete_type (t);
4313 if (t == error_mark_node)
4315 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE
4316 && need_complete_non_reference)
4318 error ("%qE has reference type for %qs", t, name);
4322 if (need_implicitly_determined)
4324 const char *share_name = NULL;
4326 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
4327 share_name = "threadprivate";
4328 else switch (cxx_omp_predetermined_sharing (t))
4330 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
4332 case OMP_CLAUSE_DEFAULT_SHARED:
4333 /* const vars may be specified in firstprivate clause. */
4334 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_FIRSTPRIVATE
4335 && cxx_omp_const_qual_no_mutable (t))
4337 share_name = "shared";
4339 case OMP_CLAUSE_DEFAULT_PRIVATE:
4340 share_name = "private";
4347 error ("%qE is predetermined %qs for %qs",
4348 t, share_name, name);
4353 /* We're interested in the base element, not arrays. */
4354 inner_type = type = TREE_TYPE (t);
4355 while (TREE_CODE (inner_type) == ARRAY_TYPE)
4356 inner_type = TREE_TYPE (inner_type);
4358 /* Check for special function availability by building a call to one.
4359 Save the results, because later we won't be in the right context
4360 for making these queries. */
4361 if (CLASS_TYPE_P (inner_type)
4362 && COMPLETE_TYPE_P (inner_type)
4363 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
4364 && !type_dependent_expression_p (t)
4365 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
4366 need_copy_ctor, need_copy_assignment))
4370 *pc = OMP_CLAUSE_CHAIN (c);
4372 pc = &OMP_CLAUSE_CHAIN (c);
4375 bitmap_obstack_release (NULL);
4379 /* For all variables in the tree_list VARS, mark them as thread local. */
4382 finish_omp_threadprivate (tree vars)
4386 /* Mark every variable in VARS to be assigned thread local storage. */
4387 for (t = vars; t; t = TREE_CHAIN (t))
4389 tree v = TREE_PURPOSE (t);
4391 if (error_operand_p (v))
4393 else if (TREE_CODE (v) != VAR_DECL)
4394 error ("%<threadprivate%> %qD is not file, namespace "
4395 "or block scope variable", v);
4396 /* If V had already been marked threadprivate, it doesn't matter
4397 whether it had been used prior to this point. */
4398 else if (TREE_USED (v)
4399 && (DECL_LANG_SPECIFIC (v) == NULL
4400 || !CP_DECL_THREADPRIVATE_P (v)))
4401 error ("%qE declared %<threadprivate%> after first use", v);
4402 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
4403 error ("automatic variable %qE cannot be %<threadprivate%>", v);
4404 else if (! COMPLETE_TYPE_P (complete_type (TREE_TYPE (v))))
4405 error ("%<threadprivate%> %qE has incomplete type", v);
4406 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
4407 && CP_DECL_CONTEXT (v) != current_class_type)
4408 error ("%<threadprivate%> %qE directive not "
4409 "in %qT definition", v, CP_DECL_CONTEXT (v));
4412 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4413 if (DECL_LANG_SPECIFIC (v) == NULL)
4415 retrofit_lang_decl (v);
4417 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4418 after the allocation of the lang_decl structure. */
4419 if (DECL_DISCRIMINATOR_P (v))
4420 DECL_LANG_SPECIFIC (v)->u.base.u2sel = 1;
4423 if (! DECL_THREAD_LOCAL_P (v))
4425 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
4426 /* If rtl has been already set for this var, call
4427 make_decl_rtl once again, so that encode_section_info
4428 has a chance to look at the new decl flags. */
4429 if (DECL_RTL_SET_P (v))
4432 CP_DECL_THREADPRIVATE_P (v) = 1;
4437 /* Build an OpenMP structured block. */
4440 begin_omp_structured_block (void)
4442 return do_pushlevel (sk_omp);
4446 finish_omp_structured_block (tree block)
4448 return do_poplevel (block);
4451 /* Similarly, except force the retention of the BLOCK. */
4454 begin_omp_parallel (void)
4456 keep_next_level (true);
4457 return begin_omp_structured_block ();
4461 finish_omp_parallel (tree clauses, tree body)
4465 body = finish_omp_structured_block (body);
4467 stmt = make_node (OMP_PARALLEL);
4468 TREE_TYPE (stmt) = void_type_node;
4469 OMP_PARALLEL_CLAUSES (stmt) = clauses;
4470 OMP_PARALLEL_BODY (stmt) = body;
4472 return add_stmt (stmt);
4476 begin_omp_task (void)
4478 keep_next_level (true);
4479 return begin_omp_structured_block ();
4483 finish_omp_task (tree clauses, tree body)
4487 body = finish_omp_structured_block (body);
4489 stmt = make_node (OMP_TASK);
4490 TREE_TYPE (stmt) = void_type_node;
4491 OMP_TASK_CLAUSES (stmt) = clauses;
4492 OMP_TASK_BODY (stmt) = body;
4494 return add_stmt (stmt);
4497 /* Helper function for finish_omp_for. Convert Ith random access iterator
4498 into integral iterator. Return FALSE if successful. */
4501 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
4502 tree condv, tree incrv, tree *body,
4503 tree *pre_body, tree clauses)
4505 tree diff, iter_init, iter_incr = NULL, last;
4506 tree incr_var = NULL, orig_pre_body, orig_body, c;
4507 tree decl = TREE_VEC_ELT (declv, i);
4508 tree init = TREE_VEC_ELT (initv, i);
4509 tree cond = TREE_VEC_ELT (condv, i);
4510 tree incr = TREE_VEC_ELT (incrv, i);
4512 location_t elocus = locus;
4514 if (init && EXPR_HAS_LOCATION (init))
4515 elocus = EXPR_LOCATION (init);
4517 switch (TREE_CODE (cond))
4523 if (TREE_OPERAND (cond, 1) == iter)
4524 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
4525 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
4526 if (TREE_OPERAND (cond, 0) != iter)
4527 cond = error_mark_node;
4530 tree tem = build_x_binary_op (EXPR_LOCATION (cond),
4533 TREE_OPERAND (cond, 1), ERROR_MARK,
4534 NULL, tf_warning_or_error);
4535 if (error_operand_p (tem))
4540 cond = error_mark_node;
4543 if (cond == error_mark_node)
4545 error_at (elocus, "invalid controlling predicate");
4548 diff = build_x_binary_op (elocus, MINUS_EXPR, TREE_OPERAND (cond, 1),
4549 ERROR_MARK, iter, ERROR_MARK, NULL,
4550 tf_warning_or_error);
4551 if (error_operand_p (diff))
4553 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
4555 error_at (elocus, "difference between %qE and %qD does not have integer type",
4556 TREE_OPERAND (cond, 1), iter);
4560 switch (TREE_CODE (incr))
4562 case PREINCREMENT_EXPR:
4563 case PREDECREMENT_EXPR:
4564 case POSTINCREMENT_EXPR:
4565 case POSTDECREMENT_EXPR:
4566 if (TREE_OPERAND (incr, 0) != iter)
4568 incr = error_mark_node;
4571 iter_incr = build_x_unary_op (EXPR_LOCATION (incr),
4572 TREE_CODE (incr), iter,
4573 tf_warning_or_error);
4574 if (error_operand_p (iter_incr))
4576 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
4577 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4578 incr = integer_one_node;
4580 incr = integer_minus_one_node;
4583 if (TREE_OPERAND (incr, 0) != iter)
4584 incr = error_mark_node;
4585 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4586 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4588 tree rhs = TREE_OPERAND (incr, 1);
4589 if (TREE_OPERAND (rhs, 0) == iter)
4591 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4593 incr = error_mark_node;
4596 iter_incr = build_x_modify_expr (EXPR_LOCATION (rhs),
4597 iter, TREE_CODE (rhs),
4598 TREE_OPERAND (rhs, 1),
4599 tf_warning_or_error);
4600 if (error_operand_p (iter_incr))
4602 incr = TREE_OPERAND (rhs, 1);
4603 incr = cp_convert (TREE_TYPE (diff), incr,
4604 tf_warning_or_error);
4605 if (TREE_CODE (rhs) == MINUS_EXPR)
4607 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4608 incr = fold_if_not_in_template (incr);
4610 if (TREE_CODE (incr) != INTEGER_CST
4611 && (TREE_CODE (incr) != NOP_EXPR
4612 || (TREE_CODE (TREE_OPERAND (incr, 0))
4617 else if (TREE_OPERAND (rhs, 1) == iter)
4619 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4620 || TREE_CODE (rhs) != PLUS_EXPR)
4621 incr = error_mark_node;
4624 iter_incr = build_x_binary_op (EXPR_LOCATION (rhs),
4626 TREE_OPERAND (rhs, 0),
4629 tf_warning_or_error);
4630 if (error_operand_p (iter_incr))
4632 iter_incr = build_x_modify_expr (EXPR_LOCATION (rhs),
4635 tf_warning_or_error);
4636 if (error_operand_p (iter_incr))
4638 incr = TREE_OPERAND (rhs, 0);
4643 incr = error_mark_node;
4646 incr = error_mark_node;
4649 incr = error_mark_node;
4653 if (incr == error_mark_node)
4655 error_at (elocus, "invalid increment expression");
4659 incr = cp_convert (TREE_TYPE (diff), incr, tf_warning_or_error);
4660 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4661 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4662 && OMP_CLAUSE_DECL (c) == iter)
4665 decl = create_temporary_var (TREE_TYPE (diff));
4667 add_decl_expr (decl);
4668 last = create_temporary_var (TREE_TYPE (diff));
4670 add_decl_expr (last);
4671 if (c && iter_incr == NULL)
4673 incr_var = create_temporary_var (TREE_TYPE (diff));
4674 pushdecl (incr_var);
4675 add_decl_expr (incr_var);
4677 gcc_assert (stmts_are_full_exprs_p ());
4679 orig_pre_body = *pre_body;
4680 *pre_body = push_stmt_list ();
4682 add_stmt (orig_pre_body);
4684 finish_expr_stmt (build_x_modify_expr (elocus,
4685 iter, NOP_EXPR, init,
4686 tf_warning_or_error));
4687 init = build_int_cst (TREE_TYPE (diff), 0);
4688 if (c && iter_incr == NULL)
4690 finish_expr_stmt (build_x_modify_expr (elocus,
4692 incr, tf_warning_or_error));
4694 iter_incr = build_x_modify_expr (elocus,
4695 iter, PLUS_EXPR, incr,
4696 tf_warning_or_error);
4698 finish_expr_stmt (build_x_modify_expr (elocus,
4699 last, NOP_EXPR, init,
4700 tf_warning_or_error));
4701 *pre_body = pop_stmt_list (*pre_body);
4703 cond = cp_build_binary_op (elocus,
4704 TREE_CODE (cond), decl, diff,
4705 tf_warning_or_error);
4706 incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR,
4707 elocus, incr, NULL_TREE);
4710 *body = push_stmt_list ();
4711 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4712 iter_init = build_x_modify_expr (elocus,
4713 iter, PLUS_EXPR, iter_init,
4714 tf_warning_or_error);
4715 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4716 finish_expr_stmt (iter_init);
4717 finish_expr_stmt (build_x_modify_expr (elocus,
4718 last, NOP_EXPR, decl,
4719 tf_warning_or_error));
4720 add_stmt (orig_body);
4721 *body = pop_stmt_list (*body);
4725 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4726 finish_expr_stmt (iter_incr);
4727 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4728 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4731 TREE_VEC_ELT (declv, i) = decl;
4732 TREE_VEC_ELT (initv, i) = init;
4733 TREE_VEC_ELT (condv, i) = cond;
4734 TREE_VEC_ELT (incrv, i) = incr;
4739 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4740 are directly for their associated operands in the statement. DECL
4741 and INIT are a combo; if DECL is NULL then INIT ought to be a
4742 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4743 optional statements that need to go before the loop into its
4747 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4748 tree incrv, tree body, tree pre_body, tree clauses)
4750 tree omp_for = NULL, orig_incr = NULL;
4751 tree decl, init, cond, incr;
4755 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4756 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4757 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4758 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4760 decl = TREE_VEC_ELT (declv, i);
4761 init = TREE_VEC_ELT (initv, i);
4762 cond = TREE_VEC_ELT (condv, i);
4763 incr = TREE_VEC_ELT (incrv, i);
4769 switch (TREE_CODE (init))
4772 decl = TREE_OPERAND (init, 0);
4773 init = TREE_OPERAND (init, 1);
4776 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4778 decl = TREE_OPERAND (init, 0);
4779 init = TREE_OPERAND (init, 2);
4789 "expected iteration declaration or initialization");
4794 if (init && EXPR_HAS_LOCATION (init))
4795 elocus = EXPR_LOCATION (init);
4799 error_at (elocus, "missing controlling predicate");
4805 error_at (elocus, "missing increment expression");
4809 TREE_VEC_ELT (declv, i) = decl;
4810 TREE_VEC_ELT (initv, i) = init;
4813 if (dependent_omp_for_p (declv, initv, condv, incrv))
4817 stmt = make_node (OMP_FOR);
4819 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4821 /* This is really just a place-holder. We'll be decomposing this
4822 again and going through the cp_build_modify_expr path below when
4823 we instantiate the thing. */
4824 TREE_VEC_ELT (initv, i)
4825 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4826 TREE_VEC_ELT (initv, i));
4829 TREE_TYPE (stmt) = void_type_node;
4830 OMP_FOR_INIT (stmt) = initv;
4831 OMP_FOR_COND (stmt) = condv;
4832 OMP_FOR_INCR (stmt) = incrv;
4833 OMP_FOR_BODY (stmt) = body;
4834 OMP_FOR_PRE_BODY (stmt) = pre_body;
4835 OMP_FOR_CLAUSES (stmt) = clauses;
4837 SET_EXPR_LOCATION (stmt, locus);
4838 return add_stmt (stmt);
4841 if (processing_template_decl)
4842 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4844 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4846 decl = TREE_VEC_ELT (declv, i);
4847 init = TREE_VEC_ELT (initv, i);
4848 cond = TREE_VEC_ELT (condv, i);
4849 incr = TREE_VEC_ELT (incrv, i);
4851 TREE_VEC_ELT (orig_incr, i) = incr;
4854 if (init && EXPR_HAS_LOCATION (init))
4855 elocus = EXPR_LOCATION (init);
4859 error_at (elocus, "expected iteration declaration or initialization");
4863 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4866 TREE_VEC_ELT (orig_incr, i) = incr;
4867 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4868 TREE_CODE (TREE_OPERAND (incr, 1)),
4869 TREE_OPERAND (incr, 2),
4870 tf_warning_or_error);
4873 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4875 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4876 incrv, &body, &pre_body, clauses))
4881 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4882 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4884 error_at (elocus, "invalid type for iteration variable %qE", decl);
4888 if (!processing_template_decl)
4890 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4891 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4894 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4896 && TREE_SIDE_EFFECTS (cond)
4897 && COMPARISON_CLASS_P (cond)
4898 && !processing_template_decl)
4900 tree t = TREE_OPERAND (cond, 0);
4901 if (TREE_SIDE_EFFECTS (t)
4903 && (TREE_CODE (t) != NOP_EXPR
4904 || TREE_OPERAND (t, 0) != decl))
4905 TREE_OPERAND (cond, 0)
4906 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4908 t = TREE_OPERAND (cond, 1);
4909 if (TREE_SIDE_EFFECTS (t)
4911 && (TREE_CODE (t) != NOP_EXPR
4912 || TREE_OPERAND (t, 0) != decl))
4913 TREE_OPERAND (cond, 1)
4914 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4916 if (decl == error_mark_node || init == error_mark_node)
4919 TREE_VEC_ELT (declv, i) = decl;
4920 TREE_VEC_ELT (initv, i) = init;
4921 TREE_VEC_ELT (condv, i) = cond;
4922 TREE_VEC_ELT (incrv, i) = incr;
4926 if (IS_EMPTY_STMT (pre_body))
4929 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4932 if (omp_for == NULL)
4935 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4937 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4938 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4940 if (TREE_CODE (incr) != MODIFY_EXPR)
4943 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4944 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4945 && !processing_template_decl)
4947 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4948 if (TREE_SIDE_EFFECTS (t)
4950 && (TREE_CODE (t) != NOP_EXPR
4951 || TREE_OPERAND (t, 0) != decl))
4952 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4953 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4955 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4956 if (TREE_SIDE_EFFECTS (t)
4958 && (TREE_CODE (t) != NOP_EXPR
4959 || TREE_OPERAND (t, 0) != decl))
4960 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4961 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4965 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4967 if (omp_for != NULL)
4968 OMP_FOR_CLAUSES (omp_for) = clauses;
4973 finish_omp_atomic (enum tree_code code, enum tree_code opcode, tree lhs,
4974 tree rhs, tree v, tree lhs1, tree rhs1)
4989 dependent_p = false;
4992 /* Even in a template, we can detect invalid uses of the atomic
4993 pragma if neither LHS nor RHS is type-dependent. */
4994 if (processing_template_decl)
4996 dependent_p = (type_dependent_expression_p (lhs)
4997 || (rhs && type_dependent_expression_p (rhs))
4998 || (v && type_dependent_expression_p (v))
4999 || (lhs1 && type_dependent_expression_p (lhs1))
5000 || (rhs1 && type_dependent_expression_p (rhs1)));
5003 lhs = build_non_dependent_expr (lhs);
5005 rhs = build_non_dependent_expr (rhs);
5007 v = build_non_dependent_expr (v);
5009 lhs1 = build_non_dependent_expr (lhs1);
5011 rhs1 = build_non_dependent_expr (rhs1);
5016 stmt = c_finish_omp_atomic (input_location, code, opcode, lhs, rhs,
5018 if (stmt == error_mark_node)
5021 if (processing_template_decl)
5023 if (code == OMP_ATOMIC_READ)
5025 stmt = build_min_nt_loc (EXPR_LOCATION (orig_lhs),
5026 OMP_ATOMIC_READ, orig_lhs);
5027 stmt = build2 (MODIFY_EXPR, void_type_node, orig_v, stmt);
5031 if (opcode == NOP_EXPR)
5032 stmt = build2 (MODIFY_EXPR, void_type_node, orig_lhs, orig_rhs);
5034 stmt = build2 (opcode, void_type_node, orig_lhs, orig_rhs);
5036 stmt = build_min_nt_loc (EXPR_LOCATION (orig_rhs1),
5037 COMPOUND_EXPR, orig_rhs1, stmt);
5038 if (code != OMP_ATOMIC)
5040 stmt = build_min_nt_loc (EXPR_LOCATION (orig_lhs1),
5041 code, orig_lhs1, stmt);
5042 stmt = build2 (MODIFY_EXPR, void_type_node, orig_v, stmt);
5045 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node, stmt);
5051 finish_omp_barrier (void)
5053 tree fn = builtin_decl_explicit (BUILT_IN_GOMP_BARRIER);
5054 vec<tree, va_gc> *vec = make_tree_vector ();
5055 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
5056 release_tree_vector (vec);
5057 finish_expr_stmt (stmt);
5061 finish_omp_flush (void)
5063 tree fn = builtin_decl_explicit (BUILT_IN_SYNC_SYNCHRONIZE);
5064 vec<tree, va_gc> *vec = make_tree_vector ();
5065 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
5066 release_tree_vector (vec);
5067 finish_expr_stmt (stmt);
5071 finish_omp_taskwait (void)
5073 tree fn = builtin_decl_explicit (BUILT_IN_GOMP_TASKWAIT);
5074 vec<tree, va_gc> *vec = make_tree_vector ();
5075 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
5076 release_tree_vector (vec);
5077 finish_expr_stmt (stmt);
5081 finish_omp_taskyield (void)
5083 tree fn = builtin_decl_explicit (BUILT_IN_GOMP_TASKYIELD);
5084 vec<tree, va_gc> *vec = make_tree_vector ();
5085 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
5086 release_tree_vector (vec);
5087 finish_expr_stmt (stmt);
5090 /* Begin a __transaction_atomic or __transaction_relaxed statement.
5091 If PCOMPOUND is non-null, this is for a function-transaction-block, and we
5092 should create an extra compound stmt. */
5095 begin_transaction_stmt (location_t loc, tree *pcompound, int flags)
5100 *pcompound = begin_compound_stmt (0);
5102 r = build_stmt (loc, TRANSACTION_EXPR, NULL_TREE);
5104 /* Only add the statement to the function if support enabled. */
5108 error_at (loc, ((flags & TM_STMT_ATTR_RELAXED) != 0
5109 ? G_("%<__transaction_relaxed%> without "
5110 "transactional memory support enabled")
5111 : G_("%<__transaction_atomic%> without "
5112 "transactional memory support enabled")));
5114 TRANSACTION_EXPR_BODY (r) = push_stmt_list ();
5115 TREE_SIDE_EFFECTS (r) = 1;
5119 /* End a __transaction_atomic or __transaction_relaxed statement.
5120 If COMPOUND_STMT is non-null, this is for a function-transaction-block,
5121 and we should end the compound. If NOEX is non-NULL, we wrap the body in
5122 a MUST_NOT_THROW_EXPR with NOEX as condition. */
5125 finish_transaction_stmt (tree stmt, tree compound_stmt, int flags, tree noex)
5127 TRANSACTION_EXPR_BODY (stmt) = pop_stmt_list (TRANSACTION_EXPR_BODY (stmt));
5128 TRANSACTION_EXPR_OUTER (stmt) = (flags & TM_STMT_ATTR_OUTER) != 0;
5129 TRANSACTION_EXPR_RELAXED (stmt) = (flags & TM_STMT_ATTR_RELAXED) != 0;
5130 TRANSACTION_EXPR_IS_STMT (stmt) = 1;
5132 /* noexcept specifications are not allowed for function transactions. */
5133 gcc_assert (!(noex && compound_stmt));
5136 tree body = build_must_not_throw_expr (TRANSACTION_EXPR_BODY (stmt),
5138 SET_EXPR_LOCATION (body, EXPR_LOCATION (TRANSACTION_EXPR_BODY (stmt)));
5139 TREE_SIDE_EFFECTS (body) = 1;
5140 TRANSACTION_EXPR_BODY (stmt) = body;
5144 finish_compound_stmt (compound_stmt);
5148 /* Build a __transaction_atomic or __transaction_relaxed expression. If
5149 NOEX is non-NULL, we wrap the body in a MUST_NOT_THROW_EXPR with NOEX as
5153 build_transaction_expr (location_t loc, tree expr, int flags, tree noex)
5158 expr = build_must_not_throw_expr (expr, noex);
5159 SET_EXPR_LOCATION (expr, loc);
5160 TREE_SIDE_EFFECTS (expr) = 1;
5162 ret = build1 (TRANSACTION_EXPR, TREE_TYPE (expr), expr);
5163 if (flags & TM_STMT_ATTR_RELAXED)
5164 TRANSACTION_EXPR_RELAXED (ret) = 1;
5165 TREE_SIDE_EFFECTS (ret) = 1;
5166 SET_EXPR_LOCATION (ret, loc);
5171 init_cp_semantics (void)
5175 /* Build a STATIC_ASSERT for a static assertion with the condition
5176 CONDITION and the message text MESSAGE. LOCATION is the location
5177 of the static assertion in the source code. When MEMBER_P, this
5178 static assertion is a member of a class. */
5180 finish_static_assert (tree condition, tree message, location_t location,
5183 if (message == NULL_TREE
5184 || message == error_mark_node
5185 || condition == NULL_TREE
5186 || condition == error_mark_node)
5189 if (check_for_bare_parameter_packs (condition))
5190 condition = error_mark_node;
5192 if (type_dependent_expression_p (condition)
5193 || value_dependent_expression_p (condition))
5195 /* We're in a template; build a STATIC_ASSERT and put it in
5199 assertion = make_node (STATIC_ASSERT);
5200 STATIC_ASSERT_CONDITION (assertion) = condition;
5201 STATIC_ASSERT_MESSAGE (assertion) = message;
5202 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
5205 maybe_add_class_template_decl_list (current_class_type,
5209 add_stmt (assertion);
5214 /* Fold the expression and convert it to a boolean value. */
5215 condition = fold_non_dependent_expr (condition);
5216 condition = cp_convert (boolean_type_node, condition, tf_warning_or_error);
5217 condition = maybe_constant_value (condition);
5219 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
5220 /* Do nothing; the condition is satisfied. */
5224 location_t saved_loc = input_location;
5226 input_location = location;
5227 if (TREE_CODE (condition) == INTEGER_CST
5228 && integer_zerop (condition))
5229 /* Report the error. */
5230 error ("static assertion failed: %s", TREE_STRING_POINTER (message));
5231 else if (condition && condition != error_mark_node)
5233 error ("non-constant condition for static assertion");
5234 cxx_constant_value (condition);
5236 input_location = saved_loc;
5240 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
5241 suitable for use as a type-specifier.
5243 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
5244 id-expression or a class member access, FALSE when it was parsed as
5245 a full expression. */
5248 finish_decltype_type (tree expr, bool id_expression_or_member_access_p,
5249 tsubst_flags_t complain)
5251 tree type = NULL_TREE;
5253 if (!expr || error_operand_p (expr))
5254 return error_mark_node;
5257 || TREE_CODE (expr) == TYPE_DECL
5258 || (TREE_CODE (expr) == BIT_NOT_EXPR
5259 && TYPE_P (TREE_OPERAND (expr, 0))))
5261 if (complain & tf_error)
5262 error ("argument to decltype must be an expression");
5263 return error_mark_node;
5266 /* Depending on the resolution of DR 1172, we may later need to distinguish
5267 instantiation-dependent but not type-dependent expressions so that, say,
5268 A<decltype(sizeof(T))>::U doesn't require 'typename'. */
5269 if (instantiation_dependent_expression_p (expr))
5271 type = cxx_make_type (DECLTYPE_TYPE);
5272 DECLTYPE_TYPE_EXPR (type) = expr;
5273 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
5274 = id_expression_or_member_access_p;
5275 SET_TYPE_STRUCTURAL_EQUALITY (type);
5280 /* The type denoted by decltype(e) is defined as follows: */
5282 expr = resolve_nondeduced_context (expr);
5284 if (invalid_nonstatic_memfn_p (expr, complain))
5285 return error_mark_node;
5287 if (type_unknown_p (expr))
5289 if (complain & tf_error)
5290 error ("decltype cannot resolve address of overloaded function");
5291 return error_mark_node;
5294 /* To get the size of a static data member declared as an array of
5295 unknown bound, we need to instantiate it. */
5296 if (TREE_CODE (expr) == VAR_DECL
5297 && VAR_HAD_UNKNOWN_BOUND (expr)
5298 && DECL_TEMPLATE_INSTANTIATION (expr))
5299 instantiate_decl (expr, /*defer_ok*/true, /*expl_inst_mem*/false);
5301 if (id_expression_or_member_access_p)
5303 /* If e is an id-expression or a class member access (5.2.5
5304 [expr.ref]), decltype(e) is defined as the type of the entity
5305 named by e. If there is no such entity, or e names a set of
5306 overloaded functions, the program is ill-formed. */
5307 if (identifier_p (expr))
5308 expr = lookup_name (expr);
5310 if (INDIRECT_REF_P (expr))
5311 /* This can happen when the expression is, e.g., "a.b". Just
5312 look at the underlying operand. */
5313 expr = TREE_OPERAND (expr, 0);
5315 if (TREE_CODE (expr) == OFFSET_REF
5316 || TREE_CODE (expr) == MEMBER_REF
5317 || TREE_CODE (expr) == SCOPE_REF)
5318 /* We're only interested in the field itself. If it is a
5319 BASELINK, we will need to see through it in the next
5321 expr = TREE_OPERAND (expr, 1);
5323 if (BASELINK_P (expr))
5324 /* See through BASELINK nodes to the underlying function. */
5325 expr = BASELINK_FUNCTIONS (expr);
5327 switch (TREE_CODE (expr))
5330 if (DECL_BIT_FIELD_TYPE (expr))
5332 type = DECL_BIT_FIELD_TYPE (expr);
5335 /* Fall through for fields that aren't bitfields. */
5342 case TEMPLATE_PARM_INDEX:
5343 expr = mark_type_use (expr);
5344 type = TREE_TYPE (expr);
5348 type = error_mark_node;
5352 mark_type_use (expr);
5353 type = is_bitfield_expr_with_lowered_type (expr);
5355 type = TREE_TYPE (TREE_OPERAND (expr, 1));
5363 /* We can get here when the id-expression refers to an
5364 enumerator or non-type template parameter. */
5365 type = TREE_TYPE (expr);
5370 return error_mark_node;
5375 /* Within a lambda-expression:
5377 Every occurrence of decltype((x)) where x is a possibly
5378 parenthesized id-expression that names an entity of
5379 automatic storage duration is treated as if x were
5380 transformed into an access to a corresponding data member
5381 of the closure type that would have been declared if x
5382 were a use of the denoted entity. */
5383 if (outer_automatic_var_p (expr)
5384 && current_function_decl
5385 && LAMBDA_FUNCTION_P (current_function_decl))
5386 type = capture_decltype (expr);
5387 else if (error_operand_p (expr))
5388 type = error_mark_node;
5389 else if (expr == current_class_ptr)
5390 /* If the expression is just "this", we want the
5391 cv-unqualified pointer for the "this" type. */
5392 type = TYPE_MAIN_VARIANT (TREE_TYPE (expr));
5395 /* Otherwise, where T is the type of e, if e is an lvalue,
5396 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
5397 cp_lvalue_kind clk = lvalue_kind (expr);
5398 type = unlowered_expr_type (expr);
5399 gcc_assert (TREE_CODE (type) != REFERENCE_TYPE);
5401 /* For vector types, pick a non-opaque variant. */
5402 if (TREE_CODE (type) == VECTOR_TYPE)
5403 type = strip_typedefs (type);
5405 if (clk != clk_none && !(clk & clk_class))
5406 type = cp_build_reference_type (type, (clk & clk_rvalueref));
5413 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
5414 __has_nothrow_copy, depending on assign_p. */
5417 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
5424 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
5427 fns = (*CLASSTYPE_METHOD_VEC (type))[ix];
5429 else if (TYPE_HAS_COPY_CTOR (type))
5431 /* If construction of the copy constructor was postponed, create
5433 if (CLASSTYPE_LAZY_COPY_CTOR (type))
5434 lazily_declare_fn (sfk_copy_constructor, type);
5435 if (CLASSTYPE_LAZY_MOVE_CTOR (type))
5436 lazily_declare_fn (sfk_move_constructor, type);
5437 fns = CLASSTYPE_CONSTRUCTORS (type);
5442 for (; fns; fns = OVL_NEXT (fns))
5444 tree fn = OVL_CURRENT (fns);
5448 if (copy_fn_p (fn) == 0)
5451 else if (copy_fn_p (fn) <= 0)
5454 maybe_instantiate_noexcept (fn);
5455 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
5462 /* Actually evaluates the trait. */
5465 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
5467 enum tree_code type_code1;
5470 type_code1 = TREE_CODE (type1);
5474 case CPTK_HAS_NOTHROW_ASSIGN:
5475 type1 = strip_array_types (type1);
5476 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5477 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
5478 || (CLASS_TYPE_P (type1)
5479 && classtype_has_nothrow_assign_or_copy_p (type1,
5482 case CPTK_HAS_TRIVIAL_ASSIGN:
5483 /* ??? The standard seems to be missing the "or array of such a class
5484 type" wording for this trait. */
5485 type1 = strip_array_types (type1);
5486 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5487 && (trivial_type_p (type1)
5488 || (CLASS_TYPE_P (type1)
5489 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1))));
5491 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5492 type1 = strip_array_types (type1);
5493 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
5494 || (CLASS_TYPE_P (type1)
5495 && (t = locate_ctor (type1))
5496 && (maybe_instantiate_noexcept (t),
5497 TYPE_NOTHROW_P (TREE_TYPE (t)))));
5499 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5500 type1 = strip_array_types (type1);
5501 return (trivial_type_p (type1)
5502 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
5504 case CPTK_HAS_NOTHROW_COPY:
5505 type1 = strip_array_types (type1);
5506 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
5507 || (CLASS_TYPE_P (type1)
5508 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
5510 case CPTK_HAS_TRIVIAL_COPY:
5511 /* ??? The standard seems to be missing the "or array of such a class
5512 type" wording for this trait. */
5513 type1 = strip_array_types (type1);
5514 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5515 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1)));
5517 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5518 type1 = strip_array_types (type1);
5519 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5520 || (CLASS_TYPE_P (type1)
5521 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
5523 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5524 return type_has_virtual_destructor (type1);
5526 case CPTK_IS_ABSTRACT:
5527 return (ABSTRACT_CLASS_TYPE_P (type1));
5529 case CPTK_IS_BASE_OF:
5530 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5531 && DERIVED_FROM_P (type1, type2));
5534 return (NON_UNION_CLASS_TYPE_P (type1));
5536 case CPTK_IS_CONVERTIBLE_TO:
5541 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
5544 return (type_code1 == ENUMERAL_TYPE);
5547 return (CLASS_TYPE_P (type1) && CLASSTYPE_FINAL (type1));
5549 case CPTK_IS_LITERAL_TYPE:
5550 return (literal_type_p (type1));
5553 return (pod_type_p (type1));
5555 case CPTK_IS_POLYMORPHIC:
5556 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
5558 case CPTK_IS_STD_LAYOUT:
5559 return (std_layout_type_p (type1));
5561 case CPTK_IS_TRIVIAL:
5562 return (trivial_type_p (type1));
5565 return (type_code1 == UNION_TYPE);
5573 /* If TYPE is an array of unknown bound, or (possibly cv-qualified)
5574 void, or a complete type, returns it, otherwise NULL_TREE. */
5577 check_trait_type (tree type)
5579 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type)
5580 && COMPLETE_TYPE_P (TREE_TYPE (type)))
5583 if (VOID_TYPE_P (type))
5586 return complete_type_or_else (strip_array_types (type), NULL_TREE);
5589 /* Process a trait expression. */
5592 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
5594 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
5595 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
5596 || kind == CPTK_HAS_NOTHROW_COPY
5597 || kind == CPTK_HAS_TRIVIAL_ASSIGN
5598 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
5599 || kind == CPTK_HAS_TRIVIAL_COPY
5600 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
5601 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
5602 || kind == CPTK_IS_ABSTRACT
5603 || kind == CPTK_IS_BASE_OF
5604 || kind == CPTK_IS_CLASS
5605 || kind == CPTK_IS_CONVERTIBLE_TO
5606 || kind == CPTK_IS_EMPTY
5607 || kind == CPTK_IS_ENUM
5608 || kind == CPTK_IS_FINAL
5609 || kind == CPTK_IS_LITERAL_TYPE
5610 || kind == CPTK_IS_POD
5611 || kind == CPTK_IS_POLYMORPHIC
5612 || kind == CPTK_IS_STD_LAYOUT
5613 || kind == CPTK_IS_TRIVIAL
5614 || kind == CPTK_IS_UNION);
5616 if (kind == CPTK_IS_CONVERTIBLE_TO)
5618 sorry ("__is_convertible_to");
5619 return error_mark_node;
5622 if (type1 == error_mark_node
5623 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
5624 && type2 == error_mark_node))
5625 return error_mark_node;
5627 if (processing_template_decl)
5629 tree trait_expr = make_node (TRAIT_EXPR);
5630 TREE_TYPE (trait_expr) = boolean_type_node;
5631 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
5632 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
5633 TRAIT_EXPR_KIND (trait_expr) = kind;
5639 case CPTK_HAS_NOTHROW_ASSIGN:
5640 case CPTK_HAS_TRIVIAL_ASSIGN:
5641 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5642 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5643 case CPTK_HAS_NOTHROW_COPY:
5644 case CPTK_HAS_TRIVIAL_COPY:
5645 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5646 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5647 case CPTK_IS_ABSTRACT:
5650 case CPTK_IS_LITERAL_TYPE:
5652 case CPTK_IS_POLYMORPHIC:
5653 case CPTK_IS_STD_LAYOUT:
5654 case CPTK_IS_TRIVIAL:
5655 if (!check_trait_type (type1))
5656 return error_mark_node;
5659 case CPTK_IS_BASE_OF:
5660 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5661 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5662 && !complete_type_or_else (type2, NULL_TREE))
5663 /* We already issued an error. */
5664 return error_mark_node;
5672 case CPTK_IS_CONVERTIBLE_TO:
5677 return (trait_expr_value (kind, type1, type2)
5678 ? boolean_true_node : boolean_false_node);
5681 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5682 which is ignored for C++. */
5685 set_float_const_decimal64 (void)
5690 clear_float_const_decimal64 (void)
5695 float_const_decimal64_p (void)
5701 /* Return true if T is a literal type. */
5704 literal_type_p (tree t)
5706 if (SCALAR_TYPE_P (t)
5707 || TREE_CODE (t) == VECTOR_TYPE
5708 || TREE_CODE (t) == REFERENCE_TYPE)
5710 if (CLASS_TYPE_P (t))
5712 t = complete_type (t);
5713 gcc_assert (COMPLETE_TYPE_P (t) || errorcount);
5714 return CLASSTYPE_LITERAL_P (t);
5716 if (TREE_CODE (t) == ARRAY_TYPE)
5717 return literal_type_p (strip_array_types (t));
5721 /* If DECL is a variable declared `constexpr', require its type
5722 be literal. Return the DECL if OK, otherwise NULL. */
5725 ensure_literal_type_for_constexpr_object (tree decl)
5727 tree type = TREE_TYPE (decl);
5728 if (TREE_CODE (decl) == VAR_DECL && DECL_DECLARED_CONSTEXPR_P (decl)
5729 && !processing_template_decl)
5731 if (CLASS_TYPE_P (type) && !COMPLETE_TYPE_P (complete_type (type)))
5732 /* Don't complain here, we'll complain about incompleteness
5733 when we try to initialize the variable. */;
5734 else if (!literal_type_p (type))
5736 error ("the type %qT of constexpr variable %qD is not literal",
5738 explain_non_literal_class (type);
5745 /* Representation of entries in the constexpr function definition table. */
5747 typedef struct GTY(()) constexpr_fundef {
5752 /* This table holds all constexpr function definitions seen in
5753 the current translation unit. */
5755 static GTY ((param_is (constexpr_fundef))) htab_t constexpr_fundef_table;
5757 /* Utility function used for managing the constexpr function table.
5758 Return true if the entries pointed to by P and Q are for the
5759 same constexpr function. */
5762 constexpr_fundef_equal (const void *p, const void *q)
5764 const constexpr_fundef *lhs = (const constexpr_fundef *) p;
5765 const constexpr_fundef *rhs = (const constexpr_fundef *) q;
5766 return lhs->decl == rhs->decl;
5769 /* Utility function used for managing the constexpr function table.
5770 Return a hash value for the entry pointed to by Q. */
5772 static inline hashval_t
5773 constexpr_fundef_hash (const void *p)
5775 const constexpr_fundef *fundef = (const constexpr_fundef *) p;
5776 return DECL_UID (fundef->decl);
5779 /* Return a previously saved definition of function FUN. */
5781 static constexpr_fundef *
5782 retrieve_constexpr_fundef (tree fun)
5784 constexpr_fundef fundef = { NULL, NULL };
5785 if (constexpr_fundef_table == NULL)
5789 return (constexpr_fundef *) htab_find (constexpr_fundef_table, &fundef);
5792 /* Check whether the parameter and return types of FUN are valid for a
5793 constexpr function, and complain if COMPLAIN. */
5796 is_valid_constexpr_fn (tree fun, bool complain)
5798 tree parm = FUNCTION_FIRST_USER_PARM (fun);
5800 for (; parm != NULL; parm = TREE_CHAIN (parm))
5801 if (!literal_type_p (TREE_TYPE (parm)))
5806 error ("invalid type for parameter %d of constexpr "
5807 "function %q+#D", DECL_PARM_INDEX (parm), fun);
5808 explain_non_literal_class (TREE_TYPE (parm));
5812 if (!DECL_CONSTRUCTOR_P (fun))
5814 tree rettype = TREE_TYPE (TREE_TYPE (fun));
5815 if (!literal_type_p (rettype))
5820 error ("invalid return type %qT of constexpr function %q+D",
5822 explain_non_literal_class (rettype);
5826 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun)
5827 && !CLASSTYPE_LITERAL_P (DECL_CONTEXT (fun)))
5832 error ("enclosing class of constexpr non-static member "
5833 "function %q+#D is not a literal type", fun);
5834 explain_non_literal_class (DECL_CONTEXT (fun));
5838 else if (CLASSTYPE_VBASECLASSES (DECL_CONTEXT (fun)))
5842 error ("%q#T has virtual base classes", DECL_CONTEXT (fun));
5848 /* Subroutine of build_data_member_initialization. MEMBER is a COMPONENT_REF
5849 for a member of an anonymous aggregate, INIT is the initializer for that
5850 member, and VEC_OUTER is the vector of constructor elements for the class
5851 whose constructor we are processing. Add the initializer to the vector
5852 and return true to indicate success. */
5855 build_anon_member_initialization (tree member, tree init,
5856 vec<constructor_elt, va_gc> **vec_outer)
5858 /* MEMBER presents the relevant fields from the inside out, but we need
5859 to build up the initializer from the outside in so that we can reuse
5860 previously built CONSTRUCTORs if this is, say, the second field in an
5861 anonymous struct. So we use a vec as a stack. */
5866 fields.safe_push (TREE_OPERAND (member, 1));
5867 member = TREE_OPERAND (member, 0);
5869 while (ANON_AGGR_TYPE_P (TREE_TYPE (member)));
5871 /* VEC has the constructor elements vector for the context of FIELD.
5872 If FIELD is an anonymous aggregate, we will push inside it. */
5873 vec<constructor_elt, va_gc> **vec = vec_outer;
5875 while (field = fields.pop(),
5876 ANON_AGGR_TYPE_P (TREE_TYPE (field)))
5879 /* If there is already an outer constructor entry for the anonymous
5880 aggregate FIELD, use it; otherwise, insert one. */
5881 if (vec_safe_is_empty (*vec)
5882 || (*vec)->last().index != field)
5884 ctor = build_constructor (TREE_TYPE (field), NULL);
5885 CONSTRUCTOR_APPEND_ELT (*vec, field, ctor);
5888 ctor = (*vec)->last().value;
5889 vec = &CONSTRUCTOR_ELTS (ctor);
5892 /* Now we're at the innermost field, the one that isn't an anonymous
5893 aggregate. Add its initializer to the CONSTRUCTOR and we're done. */
5894 gcc_assert (fields.is_empty());
5896 CONSTRUCTOR_APPEND_ELT (*vec, field, init);
5901 /* Subroutine of build_constexpr_constructor_member_initializers.
5902 The expression tree T represents a data member initialization
5903 in a (constexpr) constructor definition. Build a pairing of
5904 the data member with its initializer, and prepend that pair
5905 to the existing initialization pair INITS. */
5908 build_data_member_initialization (tree t, vec<constructor_elt, va_gc> **vec)
5911 if (TREE_CODE (t) == CLEANUP_POINT_EXPR)
5912 t = TREE_OPERAND (t, 0);
5913 if (TREE_CODE (t) == EXPR_STMT)
5914 t = TREE_OPERAND (t, 0);
5915 if (t == error_mark_node)
5917 if (TREE_CODE (t) == STATEMENT_LIST)
5919 tree_stmt_iterator i;
5920 for (i = tsi_start (t); !tsi_end_p (i); tsi_next (&i))
5922 if (! build_data_member_initialization (tsi_stmt (i), vec))
5927 if (TREE_CODE (t) == CLEANUP_STMT)
5929 /* We can't see a CLEANUP_STMT in a constructor for a literal class,
5930 but we can in a constexpr constructor for a non-literal class. Just
5931 ignore it; either all the initialization will be constant, in which
5932 case the cleanup can't run, or it can't be constexpr.
5933 Still recurse into CLEANUP_BODY. */
5934 return build_data_member_initialization (CLEANUP_BODY (t), vec);
5936 if (TREE_CODE (t) == CONVERT_EXPR)
5937 t = TREE_OPERAND (t, 0);
5938 if (TREE_CODE (t) == INIT_EXPR
5939 || TREE_CODE (t) == MODIFY_EXPR)
5941 member = TREE_OPERAND (t, 0);
5942 init = unshare_expr (TREE_OPERAND (t, 1));
5944 else if (TREE_CODE (t) == CALL_EXPR)
5946 member = CALL_EXPR_ARG (t, 0);
5947 /* We don't use build_cplus_new here because it complains about
5948 abstract bases. Leaving the call unwrapped means that it has the
5949 wrong type, but cxx_eval_constant_expression doesn't care. */
5950 init = unshare_expr (t);
5952 else if (TREE_CODE (t) == DECL_EXPR)
5953 /* Declaring a temporary, don't add it to the CONSTRUCTOR. */
5957 if (INDIRECT_REF_P (member))
5958 member = TREE_OPERAND (member, 0);
5959 if (TREE_CODE (member) == NOP_EXPR)
5963 if (TREE_CODE (op) == ADDR_EXPR)
5965 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5966 (TREE_TYPE (TREE_TYPE (op)),
5967 TREE_TYPE (TREE_TYPE (member))));
5968 /* Initializing a cv-qualified member; we need to look through
5972 else if (op == current_class_ptr
5973 && (same_type_ignoring_top_level_qualifiers_p
5974 (TREE_TYPE (TREE_TYPE (member)),
5975 current_class_type)))
5976 /* Delegating constructor. */
5980 /* This is an initializer for an empty base; keep it for now so
5981 we can check it in cxx_eval_bare_aggregate. */
5982 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (member))));
5985 if (TREE_CODE (member) == ADDR_EXPR)
5986 member = TREE_OPERAND (member, 0);
5987 if (TREE_CODE (member) == COMPONENT_REF)
5989 tree aggr = TREE_OPERAND (member, 0);
5990 if (TREE_CODE (aggr) != COMPONENT_REF)
5991 /* Normal member initialization. */
5992 member = TREE_OPERAND (member, 1);
5993 else if (ANON_AGGR_TYPE_P (TREE_TYPE (aggr)))
5994 /* Initializing a member of an anonymous union. */
5995 return build_anon_member_initialization (member, init, vec);
5997 /* We're initializing a vtable pointer in a base. Leave it as
5998 COMPONENT_REF so we remember the path to get to the vfield. */
5999 gcc_assert (TREE_TYPE (member) == vtbl_ptr_type_node);
6002 CONSTRUCTOR_APPEND_ELT (*vec, member, init);
6006 /* Make sure that there are no statements after LAST in the constructor
6007 body represented by LIST. */
6010 check_constexpr_ctor_body (tree last, tree list)
6013 if (TREE_CODE (list) == STATEMENT_LIST)
6015 tree_stmt_iterator i = tsi_last (list);
6016 for (; !tsi_end_p (i); tsi_prev (&i))
6018 tree t = tsi_stmt (i);
6021 if (TREE_CODE (t) == BIND_EXPR)
6023 if (!check_constexpr_ctor_body (last, BIND_EXPR_BODY (t)))
6028 /* We currently allow typedefs and static_assert.
6029 FIXME allow them in the standard, too. */
6030 if (TREE_CODE (t) != STATIC_ASSERT)
6037 else if (list != last
6038 && TREE_CODE (list) != STATIC_ASSERT)
6042 error ("constexpr constructor does not have empty body");
6043 DECL_DECLARED_CONSTEXPR_P (current_function_decl) = false;
6048 /* V is a vector of constructor elements built up for the base and member
6049 initializers of a constructor for TYPE. They need to be in increasing
6050 offset order, which they might not be yet if TYPE has a primary base
6051 which is not first in the base-clause or a vptr and at least one base
6052 all of which are non-primary. */
6054 static vec<constructor_elt, va_gc> *
6055 sort_constexpr_mem_initializers (tree type, vec<constructor_elt, va_gc> *v)
6057 tree pri = CLASSTYPE_PRIMARY_BINFO (type);
6059 constructor_elt elt;
6063 field_type = BINFO_TYPE (pri);
6064 else if (TYPE_CONTAINS_VPTR_P (type))
6065 field_type = vtbl_ptr_type_node;
6069 /* Find the element for the primary base or vptr and move it to the
6070 beginning of the vec. */
6071 vec<constructor_elt, va_gc> &vref = *v;
6073 if (TREE_TYPE (vref[i].index) == field_type)
6080 vref[i] = vref[i-1];
6087 /* Build compile-time evalable representations of member-initializer list
6088 for a constexpr constructor. */
6091 build_constexpr_constructor_member_initializers (tree type, tree body)
6093 vec<constructor_elt, va_gc> *vec = NULL;
6095 if (TREE_CODE (body) == MUST_NOT_THROW_EXPR
6096 || TREE_CODE (body) == EH_SPEC_BLOCK)
6097 body = TREE_OPERAND (body, 0);
6098 if (TREE_CODE (body) == STATEMENT_LIST)
6099 body = STATEMENT_LIST_HEAD (body)->stmt;
6100 body = BIND_EXPR_BODY (body);
6101 if (TREE_CODE (body) == CLEANUP_POINT_EXPR)
6103 body = TREE_OPERAND (body, 0);
6104 if (TREE_CODE (body) == EXPR_STMT)
6105 body = TREE_OPERAND (body, 0);
6106 if (TREE_CODE (body) == INIT_EXPR
6107 && (same_type_ignoring_top_level_qualifiers_p
6108 (TREE_TYPE (TREE_OPERAND (body, 0)),
6109 current_class_type)))
6112 return TREE_OPERAND (body, 1);
6114 ok = build_data_member_initialization (body, &vec);
6116 else if (TREE_CODE (body) == STATEMENT_LIST)
6118 tree_stmt_iterator i;
6119 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
6121 ok = build_data_member_initialization (tsi_stmt (i), &vec);
6126 else if (TREE_CODE (body) == TRY_BLOCK)
6128 error ("body of %<constexpr%> constructor cannot be "
6129 "a function-try-block");
6130 return error_mark_node;
6132 else if (EXPR_P (body))
6133 ok = build_data_member_initialization (body, &vec);
6135 gcc_assert (errorcount > 0);
6138 if (vec_safe_length (vec) > 0)
6140 /* In a delegating constructor, return the target. */
6141 constructor_elt *ce = &(*vec)[0];
6142 if (ce->index == current_class_ptr)
6149 vec = sort_constexpr_mem_initializers (type, vec);
6150 return build_constructor (type, vec);
6153 return error_mark_node;
6156 /* Subroutine of register_constexpr_fundef. BODY is the body of a function
6157 declared to be constexpr, or a sub-statement thereof. Returns the
6158 return value if suitable, error_mark_node for a statement not allowed in
6159 a constexpr function, or NULL_TREE if no return value was found. */
6162 constexpr_fn_retval (tree body)
6164 switch (TREE_CODE (body))
6166 case STATEMENT_LIST:
6168 tree_stmt_iterator i;
6169 tree expr = NULL_TREE;
6170 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
6172 tree s = constexpr_fn_retval (tsi_stmt (i));
6173 if (s == error_mark_node)
6174 return error_mark_node;
6175 else if (s == NULL_TREE)
6176 /* Keep iterating. */;
6178 /* Multiple return statements. */
6179 return error_mark_node;
6187 return unshare_expr (TREE_OPERAND (body, 0));
6190 if (TREE_CODE (DECL_EXPR_DECL (body)) == USING_DECL)
6192 return error_mark_node;
6194 case CLEANUP_POINT_EXPR:
6195 return constexpr_fn_retval (TREE_OPERAND (body, 0));
6201 return error_mark_node;
6205 /* Subroutine of register_constexpr_fundef. BODY is the DECL_SAVED_TREE of
6206 FUN; do the necessary transformations to turn it into a single expression
6207 that we can store in the hash table. */
6210 massage_constexpr_body (tree fun, tree body)
6212 if (DECL_CONSTRUCTOR_P (fun))
6213 body = build_constexpr_constructor_member_initializers
6214 (DECL_CONTEXT (fun), body);
6217 if (TREE_CODE (body) == EH_SPEC_BLOCK)
6218 body = EH_SPEC_STMTS (body);
6219 if (TREE_CODE (body) == MUST_NOT_THROW_EXPR)
6220 body = TREE_OPERAND (body, 0);
6221 if (TREE_CODE (body) == BIND_EXPR)
6222 body = BIND_EXPR_BODY (body);
6223 body = constexpr_fn_retval (body);
6228 /* FUN is a constexpr constructor with massaged body BODY. Return true
6229 if some bases/fields are uninitialized, and complain if COMPLAIN. */
6232 cx_check_missing_mem_inits (tree fun, tree body, bool complain)
6239 if (TREE_CODE (body) != CONSTRUCTOR)
6242 nelts = CONSTRUCTOR_NELTS (body);
6243 ctype = DECL_CONTEXT (fun);
6244 field = TYPE_FIELDS (ctype);
6246 if (TREE_CODE (ctype) == UNION_TYPE)
6248 if (nelts == 0 && next_initializable_field (field))
6251 error ("%<constexpr%> constructor for union %qT must "
6252 "initialize exactly one non-static data member", ctype);
6259 for (i = 0; i <= nelts; ++i)
6266 index = CONSTRUCTOR_ELT (body, i)->index;
6267 /* Skip base and vtable inits. */
6268 if (TREE_CODE (index) != FIELD_DECL
6269 || DECL_ARTIFICIAL (index))
6272 for (; field != index; field = DECL_CHAIN (field))
6275 if (TREE_CODE (field) != FIELD_DECL
6276 || (DECL_C_BIT_FIELD (field) && !DECL_NAME (field))
6277 || DECL_ARTIFICIAL (field))
6279 ftype = strip_array_types (TREE_TYPE (field));
6280 if (type_has_constexpr_default_constructor (ftype))
6282 /* It's OK to skip a member with a trivial constexpr ctor.
6283 A constexpr ctor that isn't trivial should have been
6285 gcc_checking_assert (!TYPE_HAS_COMPLEX_DFLT (ftype)
6286 || errorcount != 0);
6291 error ("uninitialized member %qD in %<constexpr%> constructor",
6295 if (field == NULL_TREE)
6297 field = DECL_CHAIN (field);
6303 /* We are processing the definition of the constexpr function FUN.
6304 Check that its BODY fulfills the propriate requirements and
6305 enter it in the constexpr function definition table.
6306 For constructor BODY is actually the TREE_LIST of the
6307 member-initializer list. */
6310 register_constexpr_fundef (tree fun, tree body)
6312 constexpr_fundef entry;
6313 constexpr_fundef **slot;
6315 if (!is_valid_constexpr_fn (fun, !DECL_GENERATED_P (fun)))
6318 body = massage_constexpr_body (fun, body);
6319 if (body == NULL_TREE || body == error_mark_node)
6321 if (!DECL_CONSTRUCTOR_P (fun))
6322 error ("body of constexpr function %qD not a return-statement", fun);
6326 if (!potential_rvalue_constant_expression (body))
6328 if (!DECL_GENERATED_P (fun))
6329 require_potential_rvalue_constant_expression (body);
6333 if (DECL_CONSTRUCTOR_P (fun)
6334 && cx_check_missing_mem_inits (fun, body, !DECL_GENERATED_P (fun)))
6337 /* Create the constexpr function table if necessary. */
6338 if (constexpr_fundef_table == NULL)
6339 constexpr_fundef_table = htab_create_ggc (101,
6340 constexpr_fundef_hash,
6341 constexpr_fundef_equal,
6345 slot = (constexpr_fundef **)
6346 htab_find_slot (constexpr_fundef_table, &entry, INSERT);
6348 gcc_assert (*slot == NULL);
6349 *slot = ggc_alloc_constexpr_fundef ();
6355 /* FUN is a non-constexpr function called in a context that requires a
6356 constant expression. If it comes from a constexpr template, explain why
6357 the instantiation isn't constexpr. */
6360 explain_invalid_constexpr_fn (tree fun)
6362 static struct pointer_set_t *diagnosed;
6364 location_t save_loc;
6365 /* Only diagnose defaulted functions or instantiations. */
6366 if (!DECL_DEFAULTED_FN (fun)
6367 && !is_instantiation_of_constexpr (fun))
6369 if (diagnosed == NULL)
6370 diagnosed = pointer_set_create ();
6371 if (pointer_set_insert (diagnosed, fun) != 0)
6372 /* Already explained. */
6375 save_loc = input_location;
6376 input_location = DECL_SOURCE_LOCATION (fun);
6377 inform (0, "%q+D is not usable as a constexpr function because:", fun);
6378 /* First check the declaration. */
6379 if (is_valid_constexpr_fn (fun, true))
6381 /* Then if it's OK, the body. */
6382 if (DECL_DEFAULTED_FN (fun))
6383 explain_implicit_non_constexpr (fun);
6386 body = massage_constexpr_body (fun, DECL_SAVED_TREE (fun));
6387 require_potential_rvalue_constant_expression (body);
6388 if (DECL_CONSTRUCTOR_P (fun))
6389 cx_check_missing_mem_inits (fun, body, true);
6392 input_location = save_loc;
6395 /* Objects of this type represent calls to constexpr functions
6396 along with the bindings of parameters to their arguments, for
6397 the purpose of compile time evaluation. */
6399 typedef struct GTY(()) constexpr_call {
6400 /* Description of the constexpr function definition. */
6401 constexpr_fundef *fundef;
6402 /* Parameter bindings environment. A TREE_LIST where each TREE_PURPOSE
6403 is a parameter _DECL and the TREE_VALUE is the value of the parameter.
6404 Note: This arrangement is made to accomodate the use of
6405 iterative_hash_template_arg (see pt.c). If you change this
6406 representation, also change the hash calculation in
6407 cxx_eval_call_expression. */
6409 /* Result of the call.
6410 NULL means the call is being evaluated.
6411 error_mark_node means that the evaluation was erroneous;
6412 otherwise, the actuall value of the call. */
6414 /* The hash of this call; we remember it here to avoid having to
6415 recalculate it when expanding the hash table. */
6419 /* A table of all constexpr calls that have been evaluated by the
6420 compiler in this translation unit. */
6422 static GTY ((param_is (constexpr_call))) htab_t constexpr_call_table;
6424 static tree cxx_eval_constant_expression (const constexpr_call *, tree,
6425 bool, bool, bool *, bool *);
6427 /* Compute a hash value for a constexpr call representation. */
6430 constexpr_call_hash (const void *p)
6432 const constexpr_call *info = (const constexpr_call *) p;
6436 /* Return 1 if the objects pointed to by P and Q represent calls
6437 to the same constexpr function with the same arguments.
6438 Otherwise, return 0. */
6441 constexpr_call_equal (const void *p, const void *q)
6443 const constexpr_call *lhs = (const constexpr_call *) p;
6444 const constexpr_call *rhs = (const constexpr_call *) q;
6449 if (!constexpr_fundef_equal (lhs->fundef, rhs->fundef))
6451 lhs_bindings = lhs->bindings;
6452 rhs_bindings = rhs->bindings;
6453 while (lhs_bindings != NULL && rhs_bindings != NULL)
6455 tree lhs_arg = TREE_VALUE (lhs_bindings);
6456 tree rhs_arg = TREE_VALUE (rhs_bindings);
6457 gcc_assert (TREE_TYPE (lhs_arg) == TREE_TYPE (rhs_arg));
6458 if (!cp_tree_equal (lhs_arg, rhs_arg))
6460 lhs_bindings = TREE_CHAIN (lhs_bindings);
6461 rhs_bindings = TREE_CHAIN (rhs_bindings);
6463 return lhs_bindings == rhs_bindings;
6466 /* Initialize the constexpr call table, if needed. */
6469 maybe_initialize_constexpr_call_table (void)
6471 if (constexpr_call_table == NULL)
6472 constexpr_call_table = htab_create_ggc (101,
6473 constexpr_call_hash,
6474 constexpr_call_equal,
6478 /* Return true if T designates the implied `this' parameter. */
6481 is_this_parameter (tree t)
6483 return t == current_class_ptr;
6486 /* We have an expression tree T that represents a call, either CALL_EXPR
6487 or AGGR_INIT_EXPR. If the call is lexically to a named function,
6488 retrun the _DECL for that function. */
6491 get_function_named_in_call (tree t)
6494 switch (TREE_CODE (t))
6497 fun = CALL_EXPR_FN (t);
6500 case AGGR_INIT_EXPR:
6501 fun = AGGR_INIT_EXPR_FN (t);
6508 if (TREE_CODE (fun) == ADDR_EXPR
6509 && TREE_CODE (TREE_OPERAND (fun, 0)) == FUNCTION_DECL)
6510 fun = TREE_OPERAND (fun, 0);
6514 /* We have an expression tree T that represents a call, either CALL_EXPR
6515 or AGGR_INIT_EXPR. Return the Nth argument. */
6518 get_nth_callarg (tree t, int n)
6520 switch (TREE_CODE (t))
6523 return CALL_EXPR_ARG (t, n);
6525 case AGGR_INIT_EXPR:
6526 return AGGR_INIT_EXPR_ARG (t, n);
6534 /* Look up the binding of the function parameter T in a constexpr
6535 function call context CALL. */
6538 lookup_parameter_binding (const constexpr_call *call, tree t)
6540 tree b = purpose_member (t, call->bindings);
6541 return TREE_VALUE (b);
6544 /* Attempt to evaluate T which represents a call to a builtin function.
6545 We assume here that all builtin functions evaluate to scalar types
6546 represented by _CST nodes. */
6549 cxx_eval_builtin_function_call (const constexpr_call *call, tree t,
6550 bool allow_non_constant, bool addr,
6551 bool *non_constant_p, bool *overflow_p)
6553 const int nargs = call_expr_nargs (t);
6554 tree *args = (tree *) alloca (nargs * sizeof (tree));
6557 for (i = 0; i < nargs; ++i)
6559 args[i] = cxx_eval_constant_expression (call, CALL_EXPR_ARG (t, i),
6560 allow_non_constant, addr,
6561 non_constant_p, overflow_p);
6562 if (allow_non_constant && *non_constant_p)
6565 if (*non_constant_p)
6567 new_call = build_call_array_loc (EXPR_LOCATION (t), TREE_TYPE (t),
6568 CALL_EXPR_FN (t), nargs, args);
6569 new_call = fold (new_call);
6570 VERIFY_CONSTANT (new_call);
6574 /* TEMP is the constant value of a temporary object of type TYPE. Adjust
6575 the type of the value to match. */
6578 adjust_temp_type (tree type, tree temp)
6580 if (TREE_TYPE (temp) == type)
6582 /* Avoid wrapping an aggregate value in a NOP_EXPR. */
6583 if (TREE_CODE (temp) == CONSTRUCTOR)
6584 return build_constructor (type, CONSTRUCTOR_ELTS (temp));
6585 gcc_assert (scalarish_type_p (type));
6586 return cp_fold_convert (type, temp);
6589 /* Subroutine of cxx_eval_call_expression.
6590 We are processing a call expression (either CALL_EXPR or
6591 AGGR_INIT_EXPR) in the call context of OLD_CALL. Evaluate
6592 all arguments and bind their values to correspondings
6593 parameters, making up the NEW_CALL context. */
6596 cxx_bind_parameters_in_call (const constexpr_call *old_call, tree t,
6597 constexpr_call *new_call,
6598 bool allow_non_constant,
6599 bool *non_constant_p, bool *overflow_p)
6601 const int nargs = call_expr_nargs (t);
6602 tree fun = new_call->fundef->decl;
6603 tree parms = DECL_ARGUMENTS (fun);
6605 for (i = 0; i < nargs; ++i)
6608 tree type = parms ? TREE_TYPE (parms) : void_type_node;
6609 /* For member function, the first argument is a pointer to the implied
6610 object. And for an object contruction, don't bind `this' before
6611 it is fully constructed. */
6612 if (i == 0 && DECL_CONSTRUCTOR_P (fun))
6614 x = get_nth_callarg (t, i);
6615 if (parms && DECL_BY_REFERENCE (parms))
6617 /* cp_genericize made this a reference for argument passing, but
6618 we don't want to treat it like one for constexpr evaluation. */
6619 gcc_assert (TREE_CODE (type) == REFERENCE_TYPE);
6620 gcc_assert (TREE_CODE (TREE_TYPE (x)) == REFERENCE_TYPE);
6621 type = TREE_TYPE (type);
6622 x = convert_from_reference (x);
6624 arg = cxx_eval_constant_expression (old_call, x, allow_non_constant,
6625 TREE_CODE (type) == REFERENCE_TYPE,
6626 non_constant_p, overflow_p);
6627 /* Don't VERIFY_CONSTANT here. */
6628 if (*non_constant_p && allow_non_constant)
6630 /* Just discard ellipsis args after checking their constantitude. */
6633 if (*non_constant_p)
6634 /* Don't try to adjust the type of non-constant args. */
6637 /* Make sure the binding has the same type as the parm. */
6638 if (TREE_CODE (type) != REFERENCE_TYPE)
6639 arg = adjust_temp_type (type, arg);
6640 new_call->bindings = tree_cons (parms, arg, new_call->bindings);
6642 parms = TREE_CHAIN (parms);
6646 /* Variables and functions to manage constexpr call expansion context.
6647 These do not need to be marked for PCH or GC. */
6649 /* FIXME remember and print actual constant arguments. */
6650 static vec<tree> call_stack = vNULL;
6651 static int call_stack_tick;
6652 static int last_cx_error_tick;
6655 push_cx_call_context (tree call)
6658 if (!EXPR_HAS_LOCATION (call))
6659 SET_EXPR_LOCATION (call, input_location);
6660 call_stack.safe_push (call);
6661 if (call_stack.length () > (unsigned) max_constexpr_depth)
6667 pop_cx_call_context (void)
6674 cx_error_context (void)
6676 vec<tree> r = vNULL;
6677 if (call_stack_tick != last_cx_error_tick
6678 && !call_stack.is_empty ())
6680 last_cx_error_tick = call_stack_tick;
6684 /* Subroutine of cxx_eval_constant_expression.
6685 Evaluate the call expression tree T in the context of OLD_CALL expression
6689 cxx_eval_call_expression (const constexpr_call *old_call, tree t,
6690 bool allow_non_constant, bool addr,
6691 bool *non_constant_p, bool *overflow_p)
6693 location_t loc = EXPR_LOC_OR_HERE (t);
6694 tree fun = get_function_named_in_call (t);
6696 constexpr_call new_call = { NULL, NULL, NULL, 0 };
6697 constexpr_call **slot;
6698 constexpr_call *entry;
6701 if (TREE_CODE (fun) != FUNCTION_DECL)
6703 /* Might be a constexpr function pointer. */
6704 fun = cxx_eval_constant_expression (old_call, fun, allow_non_constant,
6705 /*addr*/false, non_constant_p, overflow_p);
6706 if (TREE_CODE (fun) == ADDR_EXPR)
6707 fun = TREE_OPERAND (fun, 0);
6709 if (TREE_CODE (fun) != FUNCTION_DECL)
6711 if (!allow_non_constant && !*non_constant_p)
6712 error_at (loc, "expression %qE does not designate a constexpr "
6714 *non_constant_p = true;
6717 if (DECL_CLONED_FUNCTION_P (fun))
6718 fun = DECL_CLONED_FUNCTION (fun);
6719 if (is_builtin_fn (fun))
6720 return cxx_eval_builtin_function_call (old_call, t, allow_non_constant,
6721 addr, non_constant_p, overflow_p);
6722 if (!DECL_DECLARED_CONSTEXPR_P (fun))
6724 if (!allow_non_constant)
6726 error_at (loc, "call to non-constexpr function %qD", fun);
6727 explain_invalid_constexpr_fn (fun);
6729 *non_constant_p = true;
6733 /* Shortcut trivial copy constructor/op=. */
6734 if (call_expr_nargs (t) == 2 && trivial_fn_p (fun))
6736 tree arg = convert_from_reference (get_nth_callarg (t, 1));
6737 return cxx_eval_constant_expression (old_call, arg, allow_non_constant,
6738 addr, non_constant_p, overflow_p);
6741 /* If in direct recursive call, optimize definition search. */
6742 if (old_call != NULL && old_call->fundef->decl == fun)
6743 new_call.fundef = old_call->fundef;
6746 new_call.fundef = retrieve_constexpr_fundef (fun);
6747 if (new_call.fundef == NULL || new_call.fundef->body == NULL)
6749 if (!allow_non_constant)
6751 if (DECL_INITIAL (fun))
6753 /* The definition of fun was somehow unsuitable. */
6754 error_at (loc, "%qD called in a constant expression", fun);
6755 explain_invalid_constexpr_fn (fun);
6758 error_at (loc, "%qD used before its definition", fun);
6760 *non_constant_p = true;
6764 cxx_bind_parameters_in_call (old_call, t, &new_call,
6765 allow_non_constant, non_constant_p, overflow_p);
6766 if (*non_constant_p)
6769 depth_ok = push_cx_call_context (t);
6772 = iterative_hash_template_arg (new_call.bindings,
6773 constexpr_fundef_hash (new_call.fundef));
6775 /* If we have seen this call before, we are done. */
6776 maybe_initialize_constexpr_call_table ();
6777 slot = (constexpr_call **)
6778 htab_find_slot (constexpr_call_table, &new_call, INSERT);
6782 /* We need to keep a pointer to the entry, not just the slot, as the
6783 slot can move in the call to cxx_eval_builtin_function_call. */
6784 *slot = entry = ggc_alloc_constexpr_call ();
6787 /* Calls which are in progress have their result set to NULL
6788 so that we can detect circular dependencies. */
6789 else if (entry->result == NULL)
6791 if (!allow_non_constant)
6792 error ("call has circular dependency");
6793 *non_constant_p = true;
6794 entry->result = result = error_mark_node;
6799 if (!allow_non_constant)
6800 error ("constexpr evaluation depth exceeds maximum of %d (use "
6801 "-fconstexpr-depth= to increase the maximum)",
6802 max_constexpr_depth);
6803 *non_constant_p = true;
6804 entry->result = result = error_mark_node;
6808 result = entry->result;
6809 if (!result || result == error_mark_node)
6810 result = (cxx_eval_constant_expression
6811 (&new_call, new_call.fundef->body,
6812 allow_non_constant, addr,
6813 non_constant_p, overflow_p));
6814 if (result == error_mark_node)
6815 *non_constant_p = true;
6816 if (*non_constant_p)
6817 entry->result = result = error_mark_node;
6820 /* If this was a call to initialize an object, set the type of
6821 the CONSTRUCTOR to the type of that object. */
6822 if (DECL_CONSTRUCTOR_P (fun))
6824 tree ob_arg = get_nth_callarg (t, 0);
6825 STRIP_NOPS (ob_arg);
6826 gcc_assert (TREE_CODE (TREE_TYPE (ob_arg)) == POINTER_TYPE
6827 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (ob_arg))));
6828 result = adjust_temp_type (TREE_TYPE (TREE_TYPE (ob_arg)),
6831 entry->result = result;
6835 pop_cx_call_context ();
6836 return unshare_expr (result);
6839 /* FIXME speed this up, it's taking 16% of compile time on sieve testcase. */
6842 reduced_constant_expression_p (tree t)
6844 if (TREE_CODE (t) == PTRMEM_CST)
6845 /* Even if we can't lower this yet, it's constant. */
6847 /* FIXME are we calling this too much? */
6848 return initializer_constant_valid_p (t, TREE_TYPE (t)) != NULL_TREE;
6851 /* Some expressions may have constant operands but are not constant
6852 themselves, such as 1/0. Call this function (or rather, the macro
6853 following it) to check for that condition.
6855 We only call this in places that require an arithmetic constant, not in
6856 places where we might have a non-constant expression that can be a
6857 component of a constant expression, such as the address of a constexpr
6858 variable that might be dereferenced later. */
6861 verify_constant (tree t, bool allow_non_constant, bool *non_constant_p,
6864 if (!*non_constant_p && !reduced_constant_expression_p (t))
6866 if (!allow_non_constant)
6867 error ("%q+E is not a constant expression", t);
6868 *non_constant_p = true;
6870 if (TREE_OVERFLOW_P (t))
6872 if (!allow_non_constant)
6874 permerror (input_location, "overflow in constant expression");
6875 /* If we're being permissive (and are in an enforcing
6876 context), ignore the overflow. */
6877 if (flag_permissive)
6878 return *non_constant_p;
6882 return *non_constant_p;
6885 /* Subroutine of cxx_eval_constant_expression.
6886 Attempt to reduce the unary expression tree T to a compile time value.
6887 If successful, return the value. Otherwise issue a diagnostic
6888 and return error_mark_node. */
6891 cxx_eval_unary_expression (const constexpr_call *call, tree t,
6892 bool allow_non_constant, bool addr,
6893 bool *non_constant_p, bool *overflow_p)
6896 tree orig_arg = TREE_OPERAND (t, 0);
6897 tree arg = cxx_eval_constant_expression (call, orig_arg, allow_non_constant,
6898 addr, non_constant_p, overflow_p);
6899 VERIFY_CONSTANT (arg);
6900 if (arg == orig_arg)
6902 r = fold_build1 (TREE_CODE (t), TREE_TYPE (t), arg);
6903 VERIFY_CONSTANT (r);
6907 /* Subroutine of cxx_eval_constant_expression.
6908 Like cxx_eval_unary_expression, except for binary expressions. */
6911 cxx_eval_binary_expression (const constexpr_call *call, tree t,
6912 bool allow_non_constant, bool addr,
6913 bool *non_constant_p, bool *overflow_p)
6916 tree orig_lhs = TREE_OPERAND (t, 0);
6917 tree orig_rhs = TREE_OPERAND (t, 1);
6919 lhs = cxx_eval_constant_expression (call, orig_lhs,
6920 allow_non_constant, addr,
6921 non_constant_p, overflow_p);
6922 VERIFY_CONSTANT (lhs);
6923 rhs = cxx_eval_constant_expression (call, orig_rhs,
6924 allow_non_constant, addr,
6925 non_constant_p, overflow_p);
6926 VERIFY_CONSTANT (rhs);
6927 if (lhs == orig_lhs && rhs == orig_rhs)
6929 r = fold_build2 (TREE_CODE (t), TREE_TYPE (t), lhs, rhs);
6930 VERIFY_CONSTANT (r);
6934 /* Subroutine of cxx_eval_constant_expression.
6935 Attempt to evaluate condition expressions. Dead branches are not
6939 cxx_eval_conditional_expression (const constexpr_call *call, tree t,
6940 bool allow_non_constant, bool addr,
6941 bool *non_constant_p, bool *overflow_p)
6943 tree val = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
6944 allow_non_constant, addr,
6945 non_constant_p, overflow_p);
6946 VERIFY_CONSTANT (val);
6947 /* Don't VERIFY_CONSTANT the other operands. */
6948 if (integer_zerop (val))
6949 return cxx_eval_constant_expression (call, TREE_OPERAND (t, 2),
6950 allow_non_constant, addr,
6951 non_constant_p, overflow_p);
6952 return cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
6953 allow_non_constant, addr,
6954 non_constant_p, overflow_p);
6957 /* Subroutine of cxx_eval_constant_expression.
6958 Attempt to reduce a reference to an array slot. */
6961 cxx_eval_array_reference (const constexpr_call *call, tree t,
6962 bool allow_non_constant, bool addr,
6963 bool *non_constant_p, bool *overflow_p)
6965 tree oldary = TREE_OPERAND (t, 0);
6966 tree ary = cxx_eval_constant_expression (call, oldary,
6967 allow_non_constant, addr,
6968 non_constant_p, overflow_p);
6972 unsigned len, elem_nchars = 1;
6973 if (*non_constant_p)
6975 oldidx = TREE_OPERAND (t, 1);
6976 index = cxx_eval_constant_expression (call, oldidx,
6977 allow_non_constant, false,
6978 non_constant_p, overflow_p);
6979 VERIFY_CONSTANT (index);
6980 if (addr && ary == oldary && index == oldidx)
6983 return build4 (ARRAY_REF, TREE_TYPE (t), ary, index, NULL, NULL);
6984 elem_type = TREE_TYPE (TREE_TYPE (ary));
6985 if (TREE_CODE (ary) == CONSTRUCTOR)
6986 len = CONSTRUCTOR_NELTS (ary);
6987 else if (TREE_CODE (ary) == STRING_CST)
6989 elem_nchars = (TYPE_PRECISION (elem_type)
6990 / TYPE_PRECISION (char_type_node));
6991 len = (unsigned) TREE_STRING_LENGTH (ary) / elem_nchars;
6995 /* We can't do anything with other tree codes, so use
6996 VERIFY_CONSTANT to complain and fail. */
6997 VERIFY_CONSTANT (ary);
7000 if (compare_tree_int (index, len) >= 0)
7002 if (tree_int_cst_lt (index, array_type_nelts_top (TREE_TYPE (ary))))
7004 /* If it's within the array bounds but doesn't have an explicit
7005 initializer, it's value-initialized. */
7006 tree val = build_value_init (elem_type, tf_warning_or_error);
7007 return cxx_eval_constant_expression (call, val,
7008 allow_non_constant, addr,
7009 non_constant_p, overflow_p);
7012 if (!allow_non_constant)
7013 error ("array subscript out of bound");
7014 *non_constant_p = true;
7017 else if (tree_int_cst_lt (index, integer_zero_node))
7019 if (!allow_non_constant)
7020 error ("negative array subscript");
7021 *non_constant_p = true;
7024 i = tree_low_cst (index, 0);
7025 if (TREE_CODE (ary) == CONSTRUCTOR)
7026 return (*CONSTRUCTOR_ELTS (ary))[i].value;
7027 else if (elem_nchars == 1)
7028 return build_int_cst (cv_unqualified (TREE_TYPE (TREE_TYPE (ary))),
7029 TREE_STRING_POINTER (ary)[i]);
7032 tree type = cv_unqualified (TREE_TYPE (TREE_TYPE (ary)));
7033 return native_interpret_expr (type, (const unsigned char *)
7034 TREE_STRING_POINTER (ary)
7035 + i * elem_nchars, elem_nchars);
7037 /* Don't VERIFY_CONSTANT here. */
7040 /* Subroutine of cxx_eval_constant_expression.
7041 Attempt to reduce a field access of a value of class type. */
7044 cxx_eval_component_reference (const constexpr_call *call, tree t,
7045 bool allow_non_constant, bool addr,
7046 bool *non_constant_p, bool *overflow_p)
7048 unsigned HOST_WIDE_INT i;
7051 tree part = TREE_OPERAND (t, 1);
7052 tree orig_whole = TREE_OPERAND (t, 0);
7053 tree whole = cxx_eval_constant_expression (call, orig_whole,
7054 allow_non_constant, addr,
7055 non_constant_p, overflow_p);
7056 if (whole == orig_whole)
7059 return fold_build3 (COMPONENT_REF, TREE_TYPE (t),
7060 whole, part, NULL_TREE);
7061 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
7063 if (!*non_constant_p && TREE_CODE (whole) != CONSTRUCTOR)
7065 if (!allow_non_constant)
7066 error ("%qE is not a constant expression", orig_whole);
7067 *non_constant_p = true;
7069 if (DECL_MUTABLE_P (part))
7071 if (!allow_non_constant)
7072 error ("mutable %qD is not usable in a constant expression", part);
7073 *non_constant_p = true;
7075 if (*non_constant_p)
7077 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole), i, field, value)
7082 if (TREE_CODE (TREE_TYPE (whole)) == UNION_TYPE
7083 && CONSTRUCTOR_NELTS (whole) > 0)
7085 /* DR 1188 says we don't have to deal with this. */
7086 if (!allow_non_constant)
7087 error ("accessing %qD member instead of initialized %qD member in "
7088 "constant expression", part, CONSTRUCTOR_ELT (whole, 0)->index);
7089 *non_constant_p = true;
7093 /* If there's no explicit init for this field, it's value-initialized. */
7094 value = build_value_init (TREE_TYPE (t), tf_warning_or_error);
7095 return cxx_eval_constant_expression (call, value,
7096 allow_non_constant, addr,
7097 non_constant_p, overflow_p);
7100 /* Subroutine of cxx_eval_constant_expression.
7101 Attempt to reduce a field access of a value of class type that is
7102 expressed as a BIT_FIELD_REF. */
7105 cxx_eval_bit_field_ref (const constexpr_call *call, tree t,
7106 bool allow_non_constant, bool addr,
7107 bool *non_constant_p, bool *overflow_p)
7109 tree orig_whole = TREE_OPERAND (t, 0);
7110 tree retval, fldval, utype, mask;
7111 bool fld_seen = false;
7112 HOST_WIDE_INT istart, isize;
7113 tree whole = cxx_eval_constant_expression (call, orig_whole,
7114 allow_non_constant, addr,
7115 non_constant_p, overflow_p);
7116 tree start, field, value;
7117 unsigned HOST_WIDE_INT i;
7119 if (whole == orig_whole)
7121 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
7123 if (!*non_constant_p && TREE_CODE (whole) != CONSTRUCTOR)
7125 if (!allow_non_constant)
7126 error ("%qE is not a constant expression", orig_whole);
7127 *non_constant_p = true;
7129 if (*non_constant_p)
7132 start = TREE_OPERAND (t, 2);
7133 istart = tree_low_cst (start, 0);
7134 isize = tree_low_cst (TREE_OPERAND (t, 1), 0);
7135 utype = TREE_TYPE (t);
7136 if (!TYPE_UNSIGNED (utype))
7137 utype = build_nonstandard_integer_type (TYPE_PRECISION (utype), 1);
7138 retval = build_int_cst (utype, 0);
7139 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole), i, field, value)
7141 tree bitpos = bit_position (field);
7142 if (bitpos == start && DECL_SIZE (field) == TREE_OPERAND (t, 1))
7144 if (TREE_CODE (TREE_TYPE (field)) == INTEGER_TYPE
7145 && TREE_CODE (value) == INTEGER_CST
7146 && host_integerp (bitpos, 0)
7147 && host_integerp (DECL_SIZE (field), 0))
7149 HOST_WIDE_INT bit = tree_low_cst (bitpos, 0);
7150 HOST_WIDE_INT sz = tree_low_cst (DECL_SIZE (field), 0);
7151 HOST_WIDE_INT shift;
7152 if (bit >= istart && bit + sz <= istart + isize)
7154 fldval = fold_convert (utype, value);
7155 mask = build_int_cst_type (utype, -1);
7156 mask = fold_build2 (LSHIFT_EXPR, utype, mask,
7157 size_int (TYPE_PRECISION (utype) - sz));
7158 mask = fold_build2 (RSHIFT_EXPR, utype, mask,
7159 size_int (TYPE_PRECISION (utype) - sz));
7160 fldval = fold_build2 (BIT_AND_EXPR, utype, fldval, mask);
7161 shift = bit - istart;
7162 if (BYTES_BIG_ENDIAN)
7163 shift = TYPE_PRECISION (utype) - shift - sz;
7164 fldval = fold_build2 (LSHIFT_EXPR, utype, fldval,
7166 retval = fold_build2 (BIT_IOR_EXPR, utype, retval, fldval);
7172 return fold_convert (TREE_TYPE (t), retval);
7174 return error_mark_node;
7177 /* Subroutine of cxx_eval_constant_expression.
7178 Evaluate a short-circuited logical expression T in the context
7179 of a given constexpr CALL. BAILOUT_VALUE is the value for
7180 early return. CONTINUE_VALUE is used here purely for
7181 sanity check purposes. */
7184 cxx_eval_logical_expression (const constexpr_call *call, tree t,
7185 tree bailout_value, tree continue_value,
7186 bool allow_non_constant, bool addr,
7187 bool *non_constant_p, bool *overflow_p)
7190 tree lhs = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
7191 allow_non_constant, addr,
7192 non_constant_p, overflow_p);
7193 VERIFY_CONSTANT (lhs);
7194 if (tree_int_cst_equal (lhs, bailout_value))
7196 gcc_assert (tree_int_cst_equal (lhs, continue_value));
7197 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
7198 allow_non_constant, addr, non_constant_p, overflow_p);
7199 VERIFY_CONSTANT (r);
7203 /* REF is a COMPONENT_REF designating a particular field. V is a vector of
7204 CONSTRUCTOR elements to initialize (part of) an object containing that
7205 field. Return a pointer to the constructor_elt corresponding to the
7206 initialization of the field. */
7208 static constructor_elt *
7209 base_field_constructor_elt (vec<constructor_elt, va_gc> *v, tree ref)
7211 tree aggr = TREE_OPERAND (ref, 0);
7212 tree field = TREE_OPERAND (ref, 1);
7214 constructor_elt *ce;
7216 gcc_assert (TREE_CODE (ref) == COMPONENT_REF);
7218 if (TREE_CODE (aggr) == COMPONENT_REF)
7220 constructor_elt *base_ce
7221 = base_field_constructor_elt (v, aggr);
7222 v = CONSTRUCTOR_ELTS (base_ce->value);
7225 for (i = 0; vec_safe_iterate (v, i, &ce); ++i)
7226 if (ce->index == field)
7233 /* Subroutine of cxx_eval_constant_expression.
7234 The expression tree T denotes a C-style array or a C-style
7235 aggregate. Reduce it to a constant expression. */
7238 cxx_eval_bare_aggregate (const constexpr_call *call, tree t,
7239 bool allow_non_constant, bool addr,
7240 bool *non_constant_p, bool *overflow_p)
7242 vec<constructor_elt, va_gc> *v = CONSTRUCTOR_ELTS (t);
7243 vec<constructor_elt, va_gc> *n;
7244 vec_alloc (n, vec_safe_length (v));
7245 constructor_elt *ce;
7247 bool changed = false;
7248 gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (t));
7249 for (i = 0; vec_safe_iterate (v, i, &ce); ++i)
7251 tree elt = cxx_eval_constant_expression (call, ce->value,
7252 allow_non_constant, addr,
7253 non_constant_p, overflow_p);
7254 /* Don't VERIFY_CONSTANT here. */
7255 if (allow_non_constant && *non_constant_p)
7257 if (elt != ce->value)
7259 if (ce->index && TREE_CODE (ce->index) == COMPONENT_REF)
7261 /* This is an initialization of a vfield inside a base
7262 subaggregate that we already initialized; push this
7263 initialization into the previous initialization. */
7264 constructor_elt *inner = base_field_constructor_elt (n, ce->index);
7267 else if (ce->index && TREE_CODE (ce->index) == NOP_EXPR)
7269 /* This is an initializer for an empty base; now that we've
7270 checked that it's constant, we can ignore it. */
7271 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (ce->index))));
7274 CONSTRUCTOR_APPEND_ELT (n, ce->index, elt);
7276 if (*non_constant_p || !changed)
7282 t = build_constructor (TREE_TYPE (t), n);
7283 TREE_CONSTANT (t) = true;
7284 if (TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
7289 /* Subroutine of cxx_eval_constant_expression.
7290 The expression tree T is a VEC_INIT_EXPR which denotes the desired
7291 initialization of a non-static data member of array type. Reduce it to a
7294 Note that apart from value-initialization (when VALUE_INIT is true),
7295 this is only intended to support value-initialization and the
7296 initializations done by defaulted constructors for classes with
7297 non-static data members of array type. In this case, VEC_INIT_EXPR_INIT
7298 will either be NULL_TREE for the default constructor, or a COMPONENT_REF
7299 for the copy/move constructor. */
7302 cxx_eval_vec_init_1 (const constexpr_call *call, tree atype, tree init,
7303 bool value_init, bool allow_non_constant, bool addr,
7304 bool *non_constant_p, bool *overflow_p)
7306 tree elttype = TREE_TYPE (atype);
7307 int max = tree_low_cst (array_type_nelts (atype), 0);
7308 vec<constructor_elt, va_gc> *n;
7309 vec_alloc (n, max + 1);
7310 bool pre_init = false;
7313 /* For the default constructor, build up a call to the default
7314 constructor of the element type. We only need to handle class types
7315 here, as for a constructor to be constexpr, all members must be
7316 initialized, which for a defaulted default constructor means they must
7317 be of a class type with a constexpr default constructor. */
7318 if (TREE_CODE (elttype) == ARRAY_TYPE)
7319 /* We only do this at the lowest level. */;
7320 else if (value_init)
7322 init = build_value_init (elttype, tf_warning_or_error);
7323 init = cxx_eval_constant_expression
7324 (call, init, allow_non_constant, addr, non_constant_p, overflow_p);
7329 vec<tree, va_gc> *argvec = make_tree_vector ();
7330 init = build_special_member_call (NULL_TREE, complete_ctor_identifier,
7331 &argvec, elttype, LOOKUP_NORMAL,
7332 tf_warning_or_error);
7333 release_tree_vector (argvec);
7334 init = cxx_eval_constant_expression (call, init, allow_non_constant,
7335 addr, non_constant_p, overflow_p);
7339 if (*non_constant_p && !allow_non_constant)
7342 for (i = 0; i <= max; ++i)
7344 tree idx = build_int_cst (size_type_node, i);
7346 if (TREE_CODE (elttype) == ARRAY_TYPE)
7348 /* A multidimensional array; recurse. */
7349 if (value_init || init == NULL_TREE)
7350 eltinit = NULL_TREE;
7352 eltinit = cp_build_array_ref (input_location, init, idx,
7353 tf_warning_or_error);
7354 eltinit = cxx_eval_vec_init_1 (call, elttype, eltinit, value_init,
7355 allow_non_constant, addr,
7356 non_constant_p, overflow_p);
7360 /* Initializing an element using value or default initialization
7361 we just pre-built above. */
7365 eltinit = unshare_expr (init);
7369 /* Copying an element. */
7370 vec<tree, va_gc> *argvec;
7371 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7372 (atype, TREE_TYPE (init)));
7373 eltinit = cp_build_array_ref (input_location, init, idx,
7374 tf_warning_or_error);
7375 if (!real_lvalue_p (init))
7376 eltinit = move (eltinit);
7377 argvec = make_tree_vector ();
7378 argvec->quick_push (eltinit);
7379 eltinit = (build_special_member_call
7380 (NULL_TREE, complete_ctor_identifier, &argvec,
7381 elttype, LOOKUP_NORMAL, tf_warning_or_error));
7382 release_tree_vector (argvec);
7383 eltinit = cxx_eval_constant_expression
7384 (call, eltinit, allow_non_constant, addr, non_constant_p, overflow_p);
7386 if (*non_constant_p && !allow_non_constant)
7388 CONSTRUCTOR_APPEND_ELT (n, idx, eltinit);
7391 if (!*non_constant_p)
7393 init = build_constructor (atype, n);
7394 TREE_CONSTANT (init) = true;
7404 cxx_eval_vec_init (const constexpr_call *call, tree t,
7405 bool allow_non_constant, bool addr,
7406 bool *non_constant_p, bool *overflow_p)
7408 tree atype = TREE_TYPE (t);
7409 tree init = VEC_INIT_EXPR_INIT (t);
7410 tree r = cxx_eval_vec_init_1 (call, atype, init,
7411 VEC_INIT_EXPR_VALUE_INIT (t),
7412 allow_non_constant, addr, non_constant_p, overflow_p);
7413 if (*non_constant_p)
7419 /* A less strict version of fold_indirect_ref_1, which requires cv-quals to
7420 match. We want to be less strict for simple *& folding; if we have a
7421 non-const temporary that we access through a const pointer, that should
7422 work. We handle this here rather than change fold_indirect_ref_1
7423 because we're dealing with things like ADDR_EXPR of INTEGER_CST which
7424 don't really make sense outside of constant expression evaluation. Also
7425 we want to allow folding to COMPONENT_REF, which could cause trouble
7426 with TBAA in fold_indirect_ref_1.
7428 Try to keep this function synced with fold_indirect_ref_1. */
7431 cxx_fold_indirect_ref (location_t loc, tree type, tree op0, bool *empty_base)
7437 subtype = TREE_TYPE (sub);
7438 if (!POINTER_TYPE_P (subtype))
7441 if (TREE_CODE (sub) == ADDR_EXPR)
7443 tree op = TREE_OPERAND (sub, 0);
7444 tree optype = TREE_TYPE (op);
7446 /* *&CONST_DECL -> to the value of the const decl. */
7447 if (TREE_CODE (op) == CONST_DECL)
7448 return DECL_INITIAL (op);
7449 /* *&p => p; make sure to handle *&"str"[cst] here. */
7450 if (same_type_ignoring_top_level_qualifiers_p (optype, type))
7452 tree fop = fold_read_from_constant_string (op);
7458 /* *(foo *)&fooarray => fooarray[0] */
7459 else if (TREE_CODE (optype) == ARRAY_TYPE
7460 && (same_type_ignoring_top_level_qualifiers_p
7461 (type, TREE_TYPE (optype))))
7463 tree type_domain = TYPE_DOMAIN (optype);
7464 tree min_val = size_zero_node;
7465 if (type_domain && TYPE_MIN_VALUE (type_domain))
7466 min_val = TYPE_MIN_VALUE (type_domain);
7467 return build4_loc (loc, ARRAY_REF, type, op, min_val,
7468 NULL_TREE, NULL_TREE);
7470 /* *(foo *)&complexfoo => __real__ complexfoo */
7471 else if (TREE_CODE (optype) == COMPLEX_TYPE
7472 && (same_type_ignoring_top_level_qualifiers_p
7473 (type, TREE_TYPE (optype))))
7474 return fold_build1_loc (loc, REALPART_EXPR, type, op);
7475 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
7476 else if (TREE_CODE (optype) == VECTOR_TYPE
7477 && (same_type_ignoring_top_level_qualifiers_p
7478 (type, TREE_TYPE (optype))))
7480 tree part_width = TYPE_SIZE (type);
7481 tree index = bitsize_int (0);
7482 return fold_build3_loc (loc, BIT_FIELD_REF, type, op, part_width, index);
7484 /* Also handle conversion to an empty base class, which
7485 is represented with a NOP_EXPR. */
7486 else if (is_empty_class (type)
7487 && CLASS_TYPE_P (optype)
7488 && DERIVED_FROM_P (type, optype))
7493 /* *(foo *)&struct_with_foo_field => COMPONENT_REF */
7494 else if (RECORD_OR_UNION_TYPE_P (optype))
7496 tree field = TYPE_FIELDS (optype);
7497 for (; field; field = DECL_CHAIN (field))
7498 if (TREE_CODE (field) == FIELD_DECL
7499 && integer_zerop (byte_position (field))
7500 && (same_type_ignoring_top_level_qualifiers_p
7501 (TREE_TYPE (field), type)))
7503 return fold_build3 (COMPONENT_REF, type, op, field, NULL_TREE);
7508 else if (TREE_CODE (sub) == POINTER_PLUS_EXPR
7509 && TREE_CODE (TREE_OPERAND (sub, 1)) == INTEGER_CST)
7511 tree op00 = TREE_OPERAND (sub, 0);
7512 tree op01 = TREE_OPERAND (sub, 1);
7515 if (TREE_CODE (op00) == ADDR_EXPR)
7518 op00 = TREE_OPERAND (op00, 0);
7519 op00type = TREE_TYPE (op00);
7521 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
7522 if (TREE_CODE (op00type) == VECTOR_TYPE
7523 && (same_type_ignoring_top_level_qualifiers_p
7524 (type, TREE_TYPE (op00type))))
7526 HOST_WIDE_INT offset = tree_low_cst (op01, 0);
7527 tree part_width = TYPE_SIZE (type);
7528 unsigned HOST_WIDE_INT part_widthi = tree_low_cst (part_width, 0)/BITS_PER_UNIT;
7529 unsigned HOST_WIDE_INT indexi = offset * BITS_PER_UNIT;
7530 tree index = bitsize_int (indexi);
7532 if (offset/part_widthi <= TYPE_VECTOR_SUBPARTS (op00type))
7533 return fold_build3_loc (loc,
7534 BIT_FIELD_REF, type, op00,
7538 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
7539 else if (TREE_CODE (op00type) == COMPLEX_TYPE
7540 && (same_type_ignoring_top_level_qualifiers_p
7541 (type, TREE_TYPE (op00type))))
7543 tree size = TYPE_SIZE_UNIT (type);
7544 if (tree_int_cst_equal (size, op01))
7545 return fold_build1_loc (loc, IMAGPART_EXPR, type, op00);
7547 /* ((foo *)&fooarray)[1] => fooarray[1] */
7548 else if (TREE_CODE (op00type) == ARRAY_TYPE
7549 && (same_type_ignoring_top_level_qualifiers_p
7550 (type, TREE_TYPE (op00type))))
7552 tree type_domain = TYPE_DOMAIN (op00type);
7553 tree min_val = size_zero_node;
7554 if (type_domain && TYPE_MIN_VALUE (type_domain))
7555 min_val = TYPE_MIN_VALUE (type_domain);
7556 op01 = size_binop_loc (loc, EXACT_DIV_EXPR, op01,
7557 TYPE_SIZE_UNIT (type));
7558 op01 = size_binop_loc (loc, PLUS_EXPR, op01, min_val);
7559 return build4_loc (loc, ARRAY_REF, type, op00, op01,
7560 NULL_TREE, NULL_TREE);
7562 /* Also handle conversion to an empty base class, which
7563 is represented with a NOP_EXPR. */
7564 else if (is_empty_class (type)
7565 && CLASS_TYPE_P (op00type)
7566 && DERIVED_FROM_P (type, op00type))
7571 /* ((foo *)&struct_with_foo_field)[1] => COMPONENT_REF */
7572 else if (RECORD_OR_UNION_TYPE_P (op00type))
7574 tree field = TYPE_FIELDS (op00type);
7575 for (; field; field = DECL_CHAIN (field))
7576 if (TREE_CODE (field) == FIELD_DECL
7577 && tree_int_cst_equal (byte_position (field), op01)
7578 && (same_type_ignoring_top_level_qualifiers_p
7579 (TREE_TYPE (field), type)))
7581 return fold_build3 (COMPONENT_REF, type, op00,
7588 /* *(foo *)fooarrptreturn> (*fooarrptr)[0] */
7589 else if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
7590 && (same_type_ignoring_top_level_qualifiers_p
7591 (type, TREE_TYPE (TREE_TYPE (subtype)))))
7594 tree min_val = size_zero_node;
7595 sub = cxx_fold_indirect_ref (loc, TREE_TYPE (subtype), sub, NULL);
7597 sub = build1_loc (loc, INDIRECT_REF, TREE_TYPE (subtype), sub);
7598 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
7599 if (type_domain && TYPE_MIN_VALUE (type_domain))
7600 min_val = TYPE_MIN_VALUE (type_domain);
7601 return build4_loc (loc, ARRAY_REF, type, sub, min_val, NULL_TREE,
7609 cxx_eval_indirect_ref (const constexpr_call *call, tree t,
7610 bool allow_non_constant, bool addr,
7611 bool *non_constant_p, bool *overflow_p)
7613 tree orig_op0 = TREE_OPERAND (t, 0);
7614 tree op0 = cxx_eval_constant_expression (call, orig_op0, allow_non_constant,
7615 /*addr*/false, non_constant_p, overflow_p);
7616 bool empty_base = false;
7619 /* Don't VERIFY_CONSTANT here. */
7620 if (*non_constant_p)
7623 r = cxx_fold_indirect_ref (EXPR_LOCATION (t), TREE_TYPE (t), op0,
7627 r = cxx_eval_constant_expression (call, r, allow_non_constant,
7628 addr, non_constant_p, overflow_p);
7633 if (TREE_CODE (sub) == POINTER_PLUS_EXPR)
7635 sub = TREE_OPERAND (sub, 0);
7638 if (TREE_CODE (sub) == ADDR_EXPR)
7640 /* We couldn't fold to a constant value. Make sure it's not
7641 something we should have been able to fold. */
7642 gcc_assert (!same_type_ignoring_top_level_qualifiers_p
7643 (TREE_TYPE (TREE_TYPE (sub)), TREE_TYPE (t)));
7644 /* DR 1188 says we don't have to deal with this. */
7645 if (!allow_non_constant)
7646 error ("accessing value of %qE through a %qT glvalue in a "
7647 "constant expression", build_fold_indirect_ref (sub),
7649 *non_constant_p = true;
7654 /* If we're pulling out the value of an empty base, make sure
7655 that the whole object is constant and then return an empty
7659 VERIFY_CONSTANT (r);
7660 r = build_constructor (TREE_TYPE (t), NULL);
7661 TREE_CONSTANT (r) = true;
7666 if (addr && op0 != orig_op0)
7667 return build1 (INDIRECT_REF, TREE_TYPE (t), op0);
7669 VERIFY_CONSTANT (t);
7675 /* Complain about R, a VAR_DECL, not being usable in a constant expression.
7676 Shared between potential_constant_expression and
7677 cxx_eval_constant_expression. */
7680 non_const_var_error (tree r)
7682 tree type = TREE_TYPE (r);
7683 error ("the value of %qD is not usable in a constant "
7685 /* Avoid error cascade. */
7686 if (DECL_INITIAL (r) == error_mark_node)
7688 if (DECL_DECLARED_CONSTEXPR_P (r))
7689 inform (DECL_SOURCE_LOCATION (r),
7690 "%qD used in its own initializer", r);
7691 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type))
7693 if (!CP_TYPE_CONST_P (type))
7694 inform (DECL_SOURCE_LOCATION (r),
7695 "%q#D is not const", r);
7696 else if (CP_TYPE_VOLATILE_P (type))
7697 inform (DECL_SOURCE_LOCATION (r),
7698 "%q#D is volatile", r);
7699 else if (!DECL_INITIAL (r)
7700 || !TREE_CONSTANT (DECL_INITIAL (r)))
7701 inform (DECL_SOURCE_LOCATION (r),
7702 "%qD was not initialized with a constant "
7709 if (cxx_dialect >= cxx0x && !DECL_DECLARED_CONSTEXPR_P (r))
7710 inform (DECL_SOURCE_LOCATION (r),
7711 "%qD was not declared %<constexpr%>", r);
7713 inform (DECL_SOURCE_LOCATION (r),
7714 "%qD does not have integral or enumeration type",
7719 /* Evaluate VEC_PERM_EXPR (v1, v2, mask). */
7721 cxx_eval_vec_perm_expr (const constexpr_call *call, tree t,
7722 bool allow_non_constant, bool addr,
7723 bool *non_constant_p, bool *overflow_p)
7728 tree elttype = TREE_TYPE (t);
7730 for (i = 0; i < 3; i++)
7732 args[i] = cxx_eval_constant_expression (call, TREE_OPERAND (t, i),
7733 allow_non_constant, addr,
7734 non_constant_p, overflow_p);
7735 if (*non_constant_p)
7739 gcc_assert (TREE_CODE (TREE_TYPE (args[0])) == VECTOR_TYPE);
7740 gcc_assert (TREE_CODE (TREE_TYPE (args[1])) == VECTOR_TYPE);
7741 gcc_assert (TREE_CODE (TREE_TYPE (args[2])) == VECTOR_TYPE);
7743 val = fold_ternary_loc (EXPR_LOCATION (t), VEC_PERM_EXPR, elttype,
7744 args[0], args[1], args[2]);
7745 if (val != NULL_TREE)
7752 /* Attempt to reduce the expression T to a constant value.
7753 On failure, issue diagnostic and return error_mark_node. */
7754 /* FIXME unify with c_fully_fold */
7757 cxx_eval_constant_expression (const constexpr_call *call, tree t,
7758 bool allow_non_constant, bool addr,
7759 bool *non_constant_p, bool *overflow_p)
7763 if (t == error_mark_node)
7765 *non_constant_p = true;
7768 if (CONSTANT_CLASS_P (t))
7770 if (TREE_CODE (t) == PTRMEM_CST)
7771 t = cplus_expand_constant (t);
7772 else if (TREE_OVERFLOW (t) && (!flag_permissive || allow_non_constant))
7776 if (TREE_CODE (t) != NOP_EXPR
7777 && reduced_constant_expression_p (t))
7780 switch (TREE_CODE (t))
7785 /* else fall through. */
7787 r = integral_constant_value (t);
7788 if (TREE_CODE (r) == TARGET_EXPR
7789 && TREE_CODE (TARGET_EXPR_INITIAL (r)) == CONSTRUCTOR)
7790 r = TARGET_EXPR_INITIAL (r);
7793 if (!allow_non_constant)
7794 non_const_var_error (r);
7795 *non_constant_p = true;
7805 if (call && DECL_CONTEXT (t) == call->fundef->decl)
7807 if (DECL_ARTIFICIAL (t) && DECL_CONSTRUCTOR_P (DECL_CONTEXT (t)))
7809 if (!allow_non_constant)
7810 sorry ("use of the value of the object being constructed "
7811 "in a constant expression");
7812 *non_constant_p = true;
7815 r = lookup_parameter_binding (call, t);
7818 /* Defer in case this is only used for its type. */;
7821 if (!allow_non_constant)
7822 error ("%qE is not a constant expression", t);
7823 *non_constant_p = true;
7828 case AGGR_INIT_EXPR:
7829 r = cxx_eval_call_expression (call, t, allow_non_constant, addr,
7830 non_constant_p, overflow_p);
7834 if (!literal_type_p (TREE_TYPE (t)))
7836 if (!allow_non_constant)
7838 error ("temporary of non-literal type %qT in a "
7839 "constant expression", TREE_TYPE (t));
7840 explain_non_literal_class (TREE_TYPE (t));
7842 *non_constant_p = true;
7845 /* else fall through. */
7847 /* Pass false for 'addr' because these codes indicate
7848 initialization of a temporary. */
7849 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
7850 allow_non_constant, false,
7851 non_constant_p, overflow_p);
7852 if (!*non_constant_p)
7853 /* Adjust the type of the result to the type of the temporary. */
7854 r = adjust_temp_type (TREE_TYPE (t), r);
7858 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
7859 allow_non_constant, addr,
7860 non_constant_p, overflow_p);
7864 case NON_LVALUE_EXPR:
7865 case TRY_CATCH_EXPR:
7866 case CLEANUP_POINT_EXPR:
7867 case MUST_NOT_THROW_EXPR:
7869 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
7870 allow_non_constant, addr,
7871 non_constant_p, overflow_p);
7874 /* These differ from cxx_eval_unary_expression in that this doesn't
7875 check for a constant operand or result; an address can be
7876 constant without its operand being, and vice versa. */
7878 r = cxx_eval_indirect_ref (call, t, allow_non_constant, addr,
7879 non_constant_p, overflow_p);
7884 tree oldop = TREE_OPERAND (t, 0);
7885 tree op = cxx_eval_constant_expression (call, oldop,
7888 non_constant_p, overflow_p);
7889 /* Don't VERIFY_CONSTANT here. */
7890 if (*non_constant_p)
7892 /* This function does more aggressive folding than fold itself. */
7893 r = build_fold_addr_expr_with_type (op, TREE_TYPE (t));
7894 if (TREE_CODE (r) == ADDR_EXPR && TREE_OPERAND (r, 0) == oldop)
7902 case FIX_TRUNC_EXPR:
7907 case TRUTH_NOT_EXPR:
7908 case FIXED_CONVERT_EXPR:
7909 r = cxx_eval_unary_expression (call, t, allow_non_constant, addr,
7910 non_constant_p, overflow_p);
7914 if (SIZEOF_EXPR_TYPE_P (t))
7915 r = cxx_sizeof_or_alignof_type (TREE_TYPE (TREE_OPERAND (t, 0)),
7916 SIZEOF_EXPR, false);
7917 else if (TYPE_P (TREE_OPERAND (t, 0)))
7918 r = cxx_sizeof_or_alignof_type (TREE_OPERAND (t, 0), SIZEOF_EXPR,
7921 r = cxx_sizeof_or_alignof_expr (TREE_OPERAND (t, 0), SIZEOF_EXPR,
7923 if (r == error_mark_node)
7925 VERIFY_CONSTANT (r);
7930 /* check_return_expr sometimes wraps a TARGET_EXPR in a
7931 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
7932 introduced by build_call_a. */
7933 tree op0 = TREE_OPERAND (t, 0);
7934 tree op1 = TREE_OPERAND (t, 1);
7936 if ((TREE_CODE (op0) == TARGET_EXPR && op1 == TARGET_EXPR_SLOT (op0))
7937 || TREE_CODE (op1) == EMPTY_CLASS_EXPR)
7938 r = cxx_eval_constant_expression (call, op0, allow_non_constant,
7939 addr, non_constant_p, overflow_p);
7942 /* Check that the LHS is constant and then discard it. */
7943 cxx_eval_constant_expression (call, op0, allow_non_constant,
7944 false, non_constant_p, overflow_p);
7945 op1 = TREE_OPERAND (t, 1);
7946 r = cxx_eval_constant_expression (call, op1, allow_non_constant,
7947 addr, non_constant_p, overflow_p);
7952 case POINTER_PLUS_EXPR:
7956 case TRUNC_DIV_EXPR:
7958 case FLOOR_DIV_EXPR:
7959 case ROUND_DIV_EXPR:
7960 case TRUNC_MOD_EXPR:
7962 case ROUND_MOD_EXPR:
7964 case EXACT_DIV_EXPR:
7974 case TRUTH_XOR_EXPR:
7981 case UNORDERED_EXPR:
7990 r = cxx_eval_binary_expression (call, t, allow_non_constant, addr,
7991 non_constant_p, overflow_p);
7994 /* fold can introduce non-IF versions of these; still treat them as
7995 short-circuiting. */
7996 case TRUTH_AND_EXPR:
7997 case TRUTH_ANDIF_EXPR:
7998 r = cxx_eval_logical_expression (call, t, boolean_false_node,
8000 allow_non_constant, addr,
8001 non_constant_p, overflow_p);
8005 case TRUTH_ORIF_EXPR:
8006 r = cxx_eval_logical_expression (call, t, boolean_true_node,
8008 allow_non_constant, addr,
8009 non_constant_p, overflow_p);
8013 r = cxx_eval_array_reference (call, t, allow_non_constant, addr,
8014 non_constant_p, overflow_p);
8018 r = cxx_eval_component_reference (call, t, allow_non_constant, addr,
8019 non_constant_p, overflow_p);
8023 r = cxx_eval_bit_field_ref (call, t, allow_non_constant, addr,
8024 non_constant_p, overflow_p);
8029 r = cxx_eval_conditional_expression (call, t, allow_non_constant, addr,
8030 non_constant_p, overflow_p);
8034 r = cxx_eval_bare_aggregate (call, t, allow_non_constant, addr,
8035 non_constant_p, overflow_p);
8039 /* We can get this in a defaulted constructor for a class with a
8040 non-static data member of array type. Either the initializer will
8041 be NULL, meaning default-initialization, or it will be an lvalue
8042 or xvalue of the same type, meaning direct-initialization from the
8043 corresponding member. */
8044 r = cxx_eval_vec_init (call, t, allow_non_constant, addr,
8045 non_constant_p, overflow_p);
8049 r = cxx_eval_vec_perm_expr (call, t, allow_non_constant, addr,
8050 non_constant_p, overflow_p);
8054 case VIEW_CONVERT_EXPR:
8057 tree oldop = TREE_OPERAND (t, 0);
8058 tree op = cxx_eval_constant_expression (call, oldop,
8059 allow_non_constant, addr,
8060 non_constant_p, overflow_p);
8061 if (*non_constant_p)
8063 if (POINTER_TYPE_P (TREE_TYPE (t))
8064 && TREE_CODE (op) == INTEGER_CST
8065 && !integer_zerop (op))
8067 if (!allow_non_constant)
8068 error_at (EXPR_LOC_OR_HERE (t),
8069 "reinterpret_cast from integer to pointer");
8070 *non_constant_p = true;
8074 /* We didn't fold at the top so we could check for ptr-int
8077 r = fold_build1 (TREE_CODE (t), TREE_TYPE (t), op);
8078 /* Conversion of an out-of-range value has implementation-defined
8079 behavior; the language considers it different from arithmetic
8080 overflow, which is undefined. */
8081 if (TREE_OVERFLOW_P (r) && !TREE_OVERFLOW_P (op))
8082 TREE_OVERFLOW (r) = false;
8086 case EMPTY_CLASS_EXPR:
8087 /* This is good enough for a function argument that might not get
8088 used, and they can't do anything with it, so just return it. */
8092 case PREINCREMENT_EXPR:
8093 case POSTINCREMENT_EXPR:
8094 case PREDECREMENT_EXPR:
8095 case POSTDECREMENT_EXPR:
8099 case VEC_DELETE_EXPR:
8103 /* GCC internal stuff. */
8106 case WITH_CLEANUP_EXPR:
8107 case STATEMENT_LIST:
8109 case NON_DEPENDENT_EXPR:
8113 if (!allow_non_constant)
8114 error_at (EXPR_LOC_OR_HERE (t),
8115 "expression %qE is not a constant-expression", t);
8116 *non_constant_p = true;
8120 internal_error ("unexpected expression %qE of kind %s", t,
8121 tree_code_name[TREE_CODE (t)]);
8122 *non_constant_p = true;
8126 if (r == error_mark_node)
8127 *non_constant_p = true;
8129 if (*non_constant_p)
8136 cxx_eval_outermost_constant_expr (tree t, bool allow_non_constant)
8138 bool non_constant_p = false;
8139 bool overflow_p = false;
8140 tree r = cxx_eval_constant_expression (NULL, t, allow_non_constant,
8141 false, &non_constant_p, &overflow_p);
8143 verify_constant (r, allow_non_constant, &non_constant_p, &overflow_p);
8145 if (TREE_CODE (t) != CONSTRUCTOR
8146 && cp_has_mutable_p (TREE_TYPE (t)))
8148 /* We allow a mutable type if the original expression was a
8149 CONSTRUCTOR so that we can do aggregate initialization of
8150 constexpr variables. */
8151 if (!allow_non_constant)
8152 error ("%qT cannot be the type of a complete constant expression "
8153 "because it has mutable sub-objects", TREE_TYPE (t));
8154 non_constant_p = true;
8157 /* Technically we should check this for all subexpressions, but that
8158 runs into problems with our internal representation of pointer
8159 subtraction and the 5.19 rules are still in flux. */
8160 if (CONVERT_EXPR_CODE_P (TREE_CODE (r))
8161 && ARITHMETIC_TYPE_P (TREE_TYPE (r))
8162 && TREE_CODE (TREE_OPERAND (r, 0)) == ADDR_EXPR)
8164 if (!allow_non_constant)
8165 error ("conversion from pointer type %qT "
8166 "to arithmetic type %qT in a constant-expression",
8167 TREE_TYPE (TREE_OPERAND (r, 0)), TREE_TYPE (r));
8168 non_constant_p = true;
8171 if (!non_constant_p && overflow_p)
8172 non_constant_p = true;
8174 if (non_constant_p && !allow_non_constant)
8175 return error_mark_node;
8176 else if (non_constant_p && TREE_CONSTANT (r))
8178 /* This isn't actually constant, so unset TREE_CONSTANT. */
8181 else if (TREE_CODE (r) == CONSTRUCTOR)
8182 r = build1 (VIEW_CONVERT_EXPR, TREE_TYPE (r), r);
8184 r = build_nop (TREE_TYPE (r), r);
8185 TREE_CONSTANT (r) = false;
8187 else if (non_constant_p || r == t)
8190 if (TREE_CODE (r) == CONSTRUCTOR && CLASS_TYPE_P (TREE_TYPE (r)))
8192 if (TREE_CODE (t) == TARGET_EXPR
8193 && TARGET_EXPR_INITIAL (t) == r)
8197 r = get_target_expr (r);
8198 TREE_CONSTANT (r) = true;
8206 /* Returns true if T is a valid subexpression of a constant expression,
8207 even if it isn't itself a constant expression. */
8210 is_sub_constant_expr (tree t)
8212 bool non_constant_p = false;
8213 bool overflow_p = false;
8214 cxx_eval_constant_expression (NULL, t, true, false, &non_constant_p,
8216 return !non_constant_p && !overflow_p;
8219 /* If T represents a constant expression returns its reduced value.
8220 Otherwise return error_mark_node. If T is dependent, then
8224 cxx_constant_value (tree t)
8226 return cxx_eval_outermost_constant_expr (t, false);
8229 /* If T is a constant expression, returns its reduced value.
8230 Otherwise, if T does not have TREE_CONSTANT set, returns T.
8231 Otherwise, returns a version of T without TREE_CONSTANT. */
8234 maybe_constant_value (tree t)
8238 if (type_dependent_expression_p (t)
8239 || type_unknown_p (t)
8240 || BRACE_ENCLOSED_INITIALIZER_P (t)
8241 || !potential_constant_expression (t)
8242 || value_dependent_expression_p (t))
8244 if (TREE_OVERFLOW_P (t))
8246 t = build_nop (TREE_TYPE (t), t);
8247 TREE_CONSTANT (t) = false;
8252 r = cxx_eval_outermost_constant_expr (t, true);
8253 #ifdef ENABLE_CHECKING
8254 /* cp_tree_equal looks through NOPs, so allow them. */
8256 || CONVERT_EXPR_P (t)
8257 || (TREE_CONSTANT (t) && !TREE_CONSTANT (r))
8258 || !cp_tree_equal (r, t));
8263 /* Like maybe_constant_value, but returns a CONSTRUCTOR directly, rather
8264 than wrapped in a TARGET_EXPR. */
8267 maybe_constant_init (tree t)
8269 t = maybe_constant_value (t);
8270 if (TREE_CODE (t) == TARGET_EXPR)
8272 tree init = TARGET_EXPR_INITIAL (t);
8273 if (TREE_CODE (init) == CONSTRUCTOR)
8280 /* FIXME see ADDR_EXPR section in potential_constant_expression_1. */
8281 /* Return true if the object referred to by REF has automatic or thread
8284 enum { ck_ok, ck_bad, ck_unknown };
8286 check_automatic_or_tls (tree ref)
8288 enum machine_mode mode;
8289 HOST_WIDE_INT bitsize, bitpos;
8291 int volatilep = 0, unsignedp = 0;
8292 tree decl = get_inner_reference (ref, &bitsize, &bitpos, &offset,
8293 &mode, &unsignedp, &volatilep, false);
8296 /* If there isn't a decl in the middle, we don't know the linkage here,
8297 and this isn't a constant expression anyway. */
8300 dk = decl_storage_duration (decl);
8301 return (dk == dk_auto || dk == dk_thread) ? ck_bad : ck_ok;
8305 /* Return true if T denotes a potentially constant expression. Issue
8306 diagnostic as appropriate under control of FLAGS. If WANT_RVAL is true,
8307 an lvalue-rvalue conversion is implied.
8309 C++0x [expr.const] used to say
8311 6 An expression is a potential constant expression if it is
8312 a constant expression where all occurences of function
8313 parameters are replaced by arbitrary constant expressions
8314 of the appropriate type.
8316 2 A conditional expression is a constant expression unless it
8317 involves one of the following as a potentially evaluated
8318 subexpression (3.2), but subexpressions of logical AND (5.14),
8319 logical OR (5.15), and conditional (5.16) operations that are
8320 not evaluated are not considered. */
8323 potential_constant_expression_1 (tree t, bool want_rval, tsubst_flags_t flags)
8325 enum { any = false, rval = true };
8329 if (t == error_mark_node)
8333 if (TREE_THIS_VOLATILE (t))
8335 if (flags & tf_error)
8336 error ("expression %qE has side-effects", t);
8339 if (CONSTANT_CLASS_P (t))
8342 switch (TREE_CODE (t))
8348 case TEMPLATE_ID_EXPR:
8355 case TEMPLATE_PARM_INDEX:
8357 case IDENTIFIER_NODE:
8358 case USERDEF_LITERAL:
8359 /* We can see a FIELD_DECL in a pointer-to-member expression. */
8365 case AGGR_INIT_EXPR:
8367 /* -- an invocation of a function other than a constexpr function
8368 or a constexpr constructor. */
8370 tree fun = get_function_named_in_call (t);
8371 const int nargs = call_expr_nargs (t);
8374 if (is_overloaded_fn (fun))
8376 if (TREE_CODE (fun) == FUNCTION_DECL)
8378 if (builtin_valid_in_constant_expr_p (fun))
8380 if (!DECL_DECLARED_CONSTEXPR_P (fun)
8381 /* Allow any built-in function; if the expansion
8382 isn't constant, we'll deal with that then. */
8383 && !is_builtin_fn (fun))
8385 if (flags & tf_error)
8387 error_at (EXPR_LOC_OR_HERE (t),
8388 "call to non-constexpr function %qD", fun);
8389 explain_invalid_constexpr_fn (fun);
8393 /* A call to a non-static member function takes the address
8394 of the object as the first argument. But in a constant
8395 expression the address will be folded away, so look
8397 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun)
8398 && !DECL_CONSTRUCTOR_P (fun))
8400 tree x = get_nth_callarg (t, 0);
8401 if (is_this_parameter (x))
8403 if (DECL_CONSTRUCTOR_P (DECL_CONTEXT (x)))
8405 if (flags & tf_error)
8406 sorry ("calling a member function of the "
8407 "object being constructed in a constant "
8411 /* Otherwise OK. */;
8413 else if (!potential_constant_expression_1 (x, rval, flags))
8419 fun = get_first_fn (fun);
8420 /* Skip initial arguments to base constructors. */
8421 if (DECL_BASE_CONSTRUCTOR_P (fun))
8422 i = num_artificial_parms_for (fun);
8423 fun = DECL_ORIGIN (fun);
8427 if (potential_constant_expression_1 (fun, rval, flags))
8428 /* Might end up being a constant function pointer. */;
8432 for (; i < nargs; ++i)
8434 tree x = get_nth_callarg (t, i);
8435 if (!potential_constant_expression_1 (x, rval, flags))
8441 case NON_LVALUE_EXPR:
8442 /* -- an lvalue-to-rvalue conversion (4.1) unless it is applied to
8443 -- an lvalue of integral type that refers to a non-volatile
8444 const variable or static data member initialized with
8445 constant expressions, or
8447 -- an lvalue of literal type that refers to non-volatile
8448 object defined with constexpr, or that refers to a
8449 sub-object of such an object; */
8450 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval, flags);
8453 if (want_rval && !decl_constant_var_p (t)
8454 && !dependent_type_p (TREE_TYPE (t)))
8456 if (flags & tf_error)
8457 non_const_var_error (t);
8464 case VIEW_CONVERT_EXPR:
8465 /* -- a reinterpret_cast. FIXME not implemented, and this rule
8466 may change to something more specific to type-punning (DR 1312). */
8468 tree from = TREE_OPERAND (t, 0);
8469 if (POINTER_TYPE_P (TREE_TYPE (t))
8470 && TREE_CODE (from) == INTEGER_CST
8471 && !integer_zerop (from))
8473 if (flags & tf_error)
8474 error_at (EXPR_LOC_OR_HERE (t),
8475 "reinterpret_cast from integer to pointer");
8478 return (potential_constant_expression_1
8479 (from, TREE_CODE (t) != VIEW_CONVERT_EXPR, flags));
8483 /* -- a unary operator & that is applied to an lvalue that
8484 designates an object with thread or automatic storage
8486 t = TREE_OPERAND (t, 0);
8488 /* FIXME adjust when issue 1197 is fully resolved. For now don't do
8489 any checking here, as we might dereference the pointer later. If
8490 we remove this code, also remove check_automatic_or_tls. */
8491 i = check_automatic_or_tls (t);
8496 if (flags & tf_error)
8497 error ("address-of an object %qE with thread local or "
8498 "automatic storage is not a constant expression", t);
8502 return potential_constant_expression_1 (t, any, flags);
8508 /* -- a class member access unless its postfix-expression is
8509 of literal type or of pointer to literal type. */
8510 /* This test would be redundant, as it follows from the
8511 postfix-expression being a potential constant expression. */
8512 return potential_constant_expression_1 (TREE_OPERAND (t, 0),
8515 case EXPR_PACK_EXPANSION:
8516 return potential_constant_expression_1 (PACK_EXPANSION_PATTERN (t),
8521 tree x = TREE_OPERAND (t, 0);
8523 if (is_this_parameter (x))
8525 if (DECL_CONTEXT (x)
8526 && !DECL_DECLARED_CONSTEXPR_P (DECL_CONTEXT (x)))
8528 if (flags & tf_error)
8529 error ("use of %<this%> in a constant expression");
8532 if (want_rval && DECL_CONTEXT (x)
8533 && DECL_CONSTRUCTOR_P (DECL_CONTEXT (x)))
8535 if (flags & tf_error)
8536 sorry ("use of the value of the object being constructed "
8537 "in a constant expression");
8542 return potential_constant_expression_1 (x, rval, flags);
8546 case DYNAMIC_CAST_EXPR:
8547 case PSEUDO_DTOR_EXPR:
8548 case PREINCREMENT_EXPR:
8549 case POSTINCREMENT_EXPR:
8550 case PREDECREMENT_EXPR:
8551 case POSTDECREMENT_EXPR:
8555 case VEC_DELETE_EXPR:
8559 /* GCC internal stuff. */
8562 case WITH_CLEANUP_EXPR:
8563 case CLEANUP_POINT_EXPR:
8564 case MUST_NOT_THROW_EXPR:
8565 case TRY_CATCH_EXPR:
8566 case STATEMENT_LIST:
8567 /* Don't bother trying to define a subset of statement-expressions to
8568 be constant-expressions, at least for now. */
8572 case TRANSACTION_EXPR:
8577 if (flags & tf_error)
8578 error ("expression %qE is not a constant-expression", t);
8582 /* -- a typeid expression whose operand is of polymorphic
8585 tree e = TREE_OPERAND (t, 0);
8586 if (!TYPE_P (e) && !type_dependent_expression_p (e)
8587 && TYPE_POLYMORPHIC_P (TREE_TYPE (e)))
8589 if (flags & tf_error)
8590 error ("typeid-expression is not a constant expression "
8591 "because %qE is of polymorphic type", e);
8598 /* -- a subtraction where both operands are pointers. */
8599 if (TYPE_PTR_P (TREE_OPERAND (t, 0))
8600 && TYPE_PTR_P (TREE_OPERAND (t, 1)))
8602 if (flags & tf_error)
8603 error ("difference of two pointer expressions is not "
8604 "a constant expression");
8616 /* -- a relational or equality operator where at least
8617 one of the operands is a pointer. */
8618 if (TYPE_PTR_P (TREE_OPERAND (t, 0))
8619 || TYPE_PTR_P (TREE_OPERAND (t, 1)))
8621 if (flags & tf_error)
8622 error ("pointer comparison expression is not a "
8623 "constant expression");
8631 if (TYPE_P (TREE_OPERAND (t, 0)))
8633 /* else fall through. */
8639 case FIX_TRUNC_EXPR:
8643 case TRUTH_NOT_EXPR:
8644 case FIXED_CONVERT_EXPR:
8645 case UNARY_PLUS_EXPR:
8646 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval,
8650 case CONST_CAST_EXPR:
8651 case STATIC_CAST_EXPR:
8652 case REINTERPRET_CAST_EXPR:
8653 case IMPLICIT_CONV_EXPR:
8654 if (cxx_dialect < cxx0x
8655 && !dependent_type_p (TREE_TYPE (t))
8656 && !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t)))
8657 /* In C++98, a conversion to non-integral type can't be part of a
8658 constant expression. */
8660 if (flags & tf_error)
8661 error ("cast to non-integral type %qT in a constant expression",
8666 return (potential_constant_expression_1
8667 (TREE_OPERAND (t, 0),
8668 TREE_CODE (TREE_TYPE (t)) != REFERENCE_TYPE, flags));
8671 case NON_DEPENDENT_EXPR:
8672 /* For convenience. */
8674 return potential_constant_expression_1 (TREE_OPERAND (t, 0),
8678 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
8682 if (!literal_type_p (TREE_TYPE (t)))
8684 if (flags & tf_error)
8686 error ("temporary of non-literal type %qT in a "
8687 "constant expression", TREE_TYPE (t));
8688 explain_non_literal_class (TREE_TYPE (t));
8693 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
8698 vec<constructor_elt, va_gc> *v = CONSTRUCTOR_ELTS (t);
8699 constructor_elt *ce;
8700 for (i = 0; vec_safe_iterate (v, i, &ce); ++i)
8701 if (!potential_constant_expression_1 (ce->value, want_rval, flags))
8708 gcc_assert (TREE_PURPOSE (t) == NULL_TREE
8709 || DECL_P (TREE_PURPOSE (t)));
8710 if (!potential_constant_expression_1 (TREE_VALUE (t), want_rval,
8713 if (TREE_CHAIN (t) == NULL_TREE)
8715 return potential_constant_expression_1 (TREE_CHAIN (t), want_rval,
8719 case TRUNC_DIV_EXPR:
8721 case FLOOR_DIV_EXPR:
8722 case ROUND_DIV_EXPR:
8723 case TRUNC_MOD_EXPR:
8725 case ROUND_MOD_EXPR:
8727 tree denom = TREE_OPERAND (t, 1);
8728 if (!potential_constant_expression_1 (denom, rval, flags))
8730 /* We can't call cxx_eval_outermost_constant_expr on an expression
8731 that hasn't been through fold_non_dependent_expr yet. */
8732 if (!processing_template_decl)
8733 denom = cxx_eval_outermost_constant_expr (denom, true);
8734 if (integer_zerop (denom))
8736 if (flags & tf_error)
8737 error ("division by zero is not a constant-expression");
8743 return potential_constant_expression_1 (TREE_OPERAND (t, 0),
8750 /* check_return_expr sometimes wraps a TARGET_EXPR in a
8751 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
8752 introduced by build_call_a. */
8753 tree op0 = TREE_OPERAND (t, 0);
8754 tree op1 = TREE_OPERAND (t, 1);
8756 if ((TREE_CODE (op0) == TARGET_EXPR && op1 == TARGET_EXPR_SLOT (op0))
8757 || TREE_CODE (op1) == EMPTY_CLASS_EXPR)
8758 return potential_constant_expression_1 (op0, want_rval, flags);
8763 /* If the first operand is the non-short-circuit constant, look at
8764 the second operand; otherwise we only care about the first one for
8766 case TRUTH_AND_EXPR:
8767 case TRUTH_ANDIF_EXPR:
8768 tmp = boolean_true_node;
8771 case TRUTH_ORIF_EXPR:
8772 tmp = boolean_false_node;
8775 tree op = TREE_OPERAND (t, 0);
8776 if (!potential_constant_expression_1 (op, rval, flags))
8778 if (!processing_template_decl)
8779 op = cxx_eval_outermost_constant_expr (op, true);
8780 if (tree_int_cst_equal (op, tmp))
8781 return potential_constant_expression_1 (TREE_OPERAND (t, 1), rval, flags);
8788 case POINTER_PLUS_EXPR:
8790 case EXACT_DIV_EXPR:
8800 case TRUTH_XOR_EXPR:
8801 case UNORDERED_EXPR:
8814 case ARRAY_RANGE_REF:
8818 for (i = 0; i < 2; ++i)
8819 if (!potential_constant_expression_1 (TREE_OPERAND (t, i),
8826 for (i = 0; i < 3; ++i)
8827 if (!potential_constant_expression_1 (TREE_OPERAND (t, i),
8834 /* If the condition is a known constant, we know which of the legs we
8835 care about; otherwise we only require that the condition and
8836 either of the legs be potentially constant. */
8837 tmp = TREE_OPERAND (t, 0);
8838 if (!potential_constant_expression_1 (tmp, rval, flags))
8840 if (!processing_template_decl)
8841 tmp = cxx_eval_outermost_constant_expr (tmp, true);
8842 if (integer_zerop (tmp))
8843 return potential_constant_expression_1 (TREE_OPERAND (t, 2),
8845 else if (TREE_CODE (tmp) == INTEGER_CST)
8846 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
8848 for (i = 1; i < 3; ++i)
8849 if (potential_constant_expression_1 (TREE_OPERAND (t, i),
8850 want_rval, tf_none))
8852 if (flags & tf_error)
8853 error ("expression %qE is not a constant-expression", t);
8857 if (VEC_INIT_EXPR_IS_CONSTEXPR (t))
8859 if (flags & tf_error)
8861 error ("non-constant array initialization");
8862 diagnose_non_constexpr_vec_init (t);
8867 if (objc_is_property_ref (t))
8870 sorry ("unexpected AST of kind %s", tree_code_name[TREE_CODE (t)]);
8876 /* The main entry point to the above. */
8879 potential_constant_expression (tree t)
8881 return potential_constant_expression_1 (t, false, tf_none);
8884 /* As above, but require a constant rvalue. */
8887 potential_rvalue_constant_expression (tree t)
8889 return potential_constant_expression_1 (t, true, tf_none);
8892 /* Like above, but complain about non-constant expressions. */
8895 require_potential_constant_expression (tree t)
8897 return potential_constant_expression_1 (t, false, tf_warning_or_error);
8900 /* Cross product of the above. */
8903 require_potential_rvalue_constant_expression (tree t)
8905 return potential_constant_expression_1 (t, true, tf_warning_or_error);
8908 /* Constructor for a lambda expression. */
8911 build_lambda_expr (void)
8913 tree lambda = make_node (LAMBDA_EXPR);
8914 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) = CPLD_NONE;
8915 LAMBDA_EXPR_CAPTURE_LIST (lambda) = NULL_TREE;
8916 LAMBDA_EXPR_THIS_CAPTURE (lambda) = NULL_TREE;
8917 LAMBDA_EXPR_PENDING_PROXIES (lambda) = NULL;
8918 LAMBDA_EXPR_RETURN_TYPE (lambda) = NULL_TREE;
8919 LAMBDA_EXPR_MUTABLE_P (lambda) = false;
8923 /* Create the closure object for a LAMBDA_EXPR. */
8926 build_lambda_object (tree lambda_expr)
8928 /* Build aggregate constructor call.
8929 - cp_parser_braced_list
8930 - cp_parser_functional_cast */
8931 vec<constructor_elt, va_gc> *elts = NULL;
8932 tree node, expr, type;
8933 location_t saved_loc;
8935 if (processing_template_decl)
8938 /* Make sure any error messages refer to the lambda-introducer. */
8939 saved_loc = input_location;
8940 input_location = LAMBDA_EXPR_LOCATION (lambda_expr);
8942 for (node = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr);
8944 node = TREE_CHAIN (node))
8946 tree field = TREE_PURPOSE (node);
8947 tree val = TREE_VALUE (node);
8949 if (field == error_mark_node)
8951 expr = error_mark_node;
8958 /* Mere mortals can't copy arrays with aggregate initialization, so
8959 do some magic to make it work here. */
8960 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE)
8961 val = build_array_copy (val);
8962 else if (DECL_NORMAL_CAPTURE_P (field)
8963 && TREE_CODE (TREE_TYPE (field)) != REFERENCE_TYPE)
8965 /* "the entities that are captured by copy are used to
8966 direct-initialize each corresponding non-static data
8967 member of the resulting closure object."
8969 There's normally no way to express direct-initialization
8970 from an element of a CONSTRUCTOR, so we build up a special
8971 TARGET_EXPR to bypass the usual copy-initialization. */
8972 val = force_rvalue (val, tf_warning_or_error);
8973 if (TREE_CODE (val) == TARGET_EXPR)
8974 TARGET_EXPR_DIRECT_INIT_P (val) = true;
8977 CONSTRUCTOR_APPEND_ELT (elts, DECL_NAME (field), val);
8980 expr = build_constructor (init_list_type_node, elts);
8981 CONSTRUCTOR_IS_DIRECT_INIT (expr) = 1;
8983 /* N2927: "[The closure] class type is not an aggregate."
8984 But we briefly treat it as an aggregate to make this simpler. */
8985 type = LAMBDA_EXPR_CLOSURE (lambda_expr);
8986 CLASSTYPE_NON_AGGREGATE (type) = 0;
8987 expr = finish_compound_literal (type, expr, tf_warning_or_error);
8988 CLASSTYPE_NON_AGGREGATE (type) = 1;
8991 input_location = saved_loc;
8995 /* Return an initialized RECORD_TYPE for LAMBDA.
8996 LAMBDA must have its explicit captures already. */
8999 begin_lambda_type (tree lambda)
9004 /* Unique name. This is just like an unnamed class, but we cannot use
9005 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
9007 name = make_lambda_name ();
9009 /* Create the new RECORD_TYPE for this lambda. */
9010 type = xref_tag (/*tag_code=*/record_type,
9012 /*scope=*/ts_lambda,
9013 /*template_header_p=*/false);
9016 /* Designate it as a struct so that we can use aggregate initialization. */
9017 CLASSTYPE_DECLARED_CLASS (type) = false;
9019 /* Cross-reference the expression and the type. */
9020 LAMBDA_EXPR_CLOSURE (lambda) = type;
9021 CLASSTYPE_LAMBDA_EXPR (type) = lambda;
9023 /* Clear base types. */
9024 xref_basetypes (type, /*bases=*/NULL_TREE);
9026 /* Start the class. */
9027 type = begin_class_definition (type);
9028 if (type == error_mark_node)
9029 return error_mark_node;
9034 /* Returns the type to use for the return type of the operator() of a
9038 lambda_return_type (tree expr)
9040 if (expr == NULL_TREE)
9041 return void_type_node;
9042 if (type_unknown_p (expr)
9043 || BRACE_ENCLOSED_INITIALIZER_P (expr))
9045 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
9046 return void_type_node;
9048 gcc_checking_assert (!type_dependent_expression_p (expr));
9049 return cv_unqualified (type_decays_to (unlowered_expr_type (expr)));
9052 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
9056 lambda_function (tree lambda)
9059 if (TREE_CODE (lambda) == LAMBDA_EXPR)
9060 type = LAMBDA_EXPR_CLOSURE (lambda);
9063 gcc_assert (LAMBDA_TYPE_P (type));
9064 /* Don't let debug_tree cause instantiation. */
9065 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type)
9066 && !COMPLETE_OR_OPEN_TYPE_P (type))
9068 lambda = lookup_member (type, ansi_opname (CALL_EXPR),
9069 /*protect=*/0, /*want_type=*/false,
9070 tf_warning_or_error);
9072 lambda = BASELINK_FUNCTIONS (lambda);
9076 /* Returns the type to use for the FIELD_DECL corresponding to the
9078 The caller should add REFERENCE_TYPE for capture by reference. */
9081 lambda_capture_field_type (tree expr)
9084 if (!TREE_TYPE (expr) || WILDCARD_TYPE_P (TREE_TYPE (expr)))
9086 type = cxx_make_type (DECLTYPE_TYPE);
9087 DECLTYPE_TYPE_EXPR (type) = expr;
9088 DECLTYPE_FOR_LAMBDA_CAPTURE (type) = true;
9089 SET_TYPE_STRUCTURAL_EQUALITY (type);
9092 type = non_reference (unlowered_expr_type (expr));
9096 /* Insert the deduced return type for an auto function. */
9099 apply_deduced_return_type (tree fco, tree return_type)
9103 if (return_type == error_mark_node)
9106 if (LAMBDA_FUNCTION_P (fco))
9108 tree lambda = CLASSTYPE_LAMBDA_EXPR (current_class_type);
9109 LAMBDA_EXPR_RETURN_TYPE (lambda) = return_type;
9112 if (DECL_CONV_FN_P (fco))
9113 DECL_NAME (fco) = mangle_conv_op_name_for_type (return_type);
9115 TREE_TYPE (fco) = change_return_type (return_type, TREE_TYPE (fco));
9117 result = DECL_RESULT (fco);
9118 if (result == NULL_TREE)
9120 if (TREE_TYPE (result) == return_type)
9123 /* We already have a DECL_RESULT from start_preparsed_function.
9124 Now we need to redo the work it and allocate_struct_function
9125 did to reflect the new type. */
9126 gcc_assert (current_function_decl == fco);
9127 result = build_decl (input_location, RESULT_DECL, NULL_TREE,
9128 TYPE_MAIN_VARIANT (return_type));
9129 DECL_ARTIFICIAL (result) = 1;
9130 DECL_IGNORED_P (result) = 1;
9131 cp_apply_type_quals_to_decl (cp_type_quals (return_type),
9134 DECL_RESULT (fco) = result;
9136 if (!processing_template_decl)
9138 bool aggr = aggregate_value_p (result, fco);
9139 #ifdef PCC_STATIC_STRUCT_RETURN
9140 cfun->returns_pcc_struct = aggr;
9142 cfun->returns_struct = aggr;
9147 /* DECL is a local variable or parameter from the surrounding scope of a
9148 lambda-expression. Returns the decltype for a use of the capture field
9149 for DECL even if it hasn't been captured yet. */
9152 capture_decltype (tree decl)
9154 tree lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
9155 /* FIXME do lookup instead of list walk? */
9156 tree cap = value_member (decl, LAMBDA_EXPR_CAPTURE_LIST (lam));
9160 type = TREE_TYPE (TREE_PURPOSE (cap));
9162 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam))
9165 error ("%qD is not captured", decl);
9166 return error_mark_node;
9169 type = TREE_TYPE (decl);
9170 if (TREE_CODE (type) == REFERENCE_TYPE
9171 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
9172 type = TREE_TYPE (type);
9175 case CPLD_REFERENCE:
9176 type = TREE_TYPE (decl);
9177 if (TREE_CODE (type) != REFERENCE_TYPE)
9178 type = build_reference_type (TREE_TYPE (decl));
9185 if (TREE_CODE (type) != REFERENCE_TYPE)
9187 if (!LAMBDA_EXPR_MUTABLE_P (lam))
9188 type = cp_build_qualified_type (type, (cp_type_quals (type)
9190 type = build_reference_type (type);
9195 /* Returns true iff DECL is a lambda capture proxy variable created by
9196 build_capture_proxy. */
9199 is_capture_proxy (tree decl)
9201 return (TREE_CODE (decl) == VAR_DECL
9202 && DECL_HAS_VALUE_EXPR_P (decl)
9203 && !DECL_ANON_UNION_VAR_P (decl)
9204 && LAMBDA_FUNCTION_P (DECL_CONTEXT (decl)));
9207 /* Returns true iff DECL is a capture proxy for a normal capture
9208 (i.e. without explicit initializer). */
9211 is_normal_capture_proxy (tree decl)
9213 if (!is_capture_proxy (decl))
9214 /* It's not a capture proxy. */
9217 /* It is a capture proxy, is it a normal capture? */
9218 tree val = DECL_VALUE_EXPR (decl);
9219 if (val == error_mark_node)
9222 gcc_assert (TREE_CODE (val) == COMPONENT_REF);
9223 val = TREE_OPERAND (val, 1);
9224 return DECL_NORMAL_CAPTURE_P (val);
9227 /* VAR is a capture proxy created by build_capture_proxy; add it to the
9228 current function, which is the operator() for the appropriate lambda. */
9231 insert_capture_proxy (tree var)
9233 cp_binding_level *b;
9237 /* Put the capture proxy in the extra body block so that it won't clash
9238 with a later local variable. */
9239 b = current_binding_level;
9240 for (skip = 0; ; ++skip)
9242 cp_binding_level *n = b->level_chain;
9243 if (n->kind == sk_function_parms)
9247 pushdecl_with_scope (var, b, false);
9249 /* And put a DECL_EXPR in the STATEMENT_LIST for the same block. */
9250 var = build_stmt (DECL_SOURCE_LOCATION (var), DECL_EXPR, var);
9251 stmt_list = (*stmt_list_stack)[stmt_list_stack->length () - 1 - skip];
9252 gcc_assert (stmt_list);
9253 append_to_statement_list_force (var, &stmt_list);
9256 /* We've just finished processing a lambda; if the containing scope is also
9257 a lambda, insert any capture proxies that were created while processing
9258 the nested lambda. */
9261 insert_pending_capture_proxies (void)
9264 vec<tree, va_gc> *proxies;
9267 if (!current_function_decl || !LAMBDA_FUNCTION_P (current_function_decl))
9270 lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
9271 proxies = LAMBDA_EXPR_PENDING_PROXIES (lam);
9272 for (i = 0; i < vec_safe_length (proxies); ++i)
9274 tree var = (*proxies)[i];
9275 insert_capture_proxy (var);
9277 release_tree_vector (LAMBDA_EXPR_PENDING_PROXIES (lam));
9278 LAMBDA_EXPR_PENDING_PROXIES (lam) = NULL;
9281 /* Given REF, a COMPONENT_REF designating a field in the lambda closure,
9282 return the type we want the proxy to have: the type of the field itself,
9283 with added const-qualification if the lambda isn't mutable and the
9284 capture is by value. */
9287 lambda_proxy_type (tree ref)
9290 if (REFERENCE_REF_P (ref))
9291 ref = TREE_OPERAND (ref, 0);
9292 type = TREE_TYPE (ref);
9293 if (type && !WILDCARD_TYPE_P (type))
9295 type = cxx_make_type (DECLTYPE_TYPE);
9296 DECLTYPE_TYPE_EXPR (type) = ref;
9297 DECLTYPE_FOR_LAMBDA_PROXY (type) = true;
9298 SET_TYPE_STRUCTURAL_EQUALITY (type);
9302 /* MEMBER is a capture field in a lambda closure class. Now that we're
9303 inside the operator(), build a placeholder var for future lookups and
9307 build_capture_proxy (tree member)
9309 tree var, object, fn, closure, name, lam, type;
9311 closure = DECL_CONTEXT (member);
9312 fn = lambda_function (closure);
9313 lam = CLASSTYPE_LAMBDA_EXPR (closure);
9315 /* The proxy variable forwards to the capture field. */
9316 object = build_fold_indirect_ref (DECL_ARGUMENTS (fn));
9317 object = finish_non_static_data_member (member, object, NULL_TREE);
9318 if (REFERENCE_REF_P (object))
9319 object = TREE_OPERAND (object, 0);
9321 /* Remove the __ inserted by add_capture. */
9322 name = get_identifier (IDENTIFIER_POINTER (DECL_NAME (member)) + 2);
9324 type = lambda_proxy_type (object);
9325 var = build_decl (input_location, VAR_DECL, name, type);
9326 SET_DECL_VALUE_EXPR (var, object);
9327 DECL_HAS_VALUE_EXPR_P (var) = 1;
9328 DECL_ARTIFICIAL (var) = 1;
9329 TREE_USED (var) = 1;
9330 DECL_CONTEXT (var) = fn;
9332 if (name == this_identifier)
9334 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (lam) == member);
9335 LAMBDA_EXPR_THIS_CAPTURE (lam) = var;
9338 if (fn == current_function_decl)
9339 insert_capture_proxy (var);
9341 vec_safe_push (LAMBDA_EXPR_PENDING_PROXIES (lam), var);
9346 /* From an ID and INITIALIZER, create a capture (by reference if
9347 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
9351 add_capture (tree lambda, tree id, tree initializer, bool by_reference_p,
9352 bool explicit_init_p)
9355 tree type, member, name;
9357 type = lambda_capture_field_type (initializer);
9360 type = build_reference_type (type);
9361 if (!real_lvalue_p (initializer))
9362 error ("cannot capture %qE by reference", initializer);
9365 /* Capture by copy requires a complete type. */
9366 type = complete_type (type);
9368 /* Add __ to the beginning of the field name so that user code
9369 won't find the field with name lookup. We can't just leave the name
9370 unset because template instantiation uses the name to find
9371 instantiated fields. */
9372 buf = (char *) alloca (IDENTIFIER_LENGTH (id) + 3);
9373 buf[1] = buf[0] = '_';
9374 memcpy (buf + 2, IDENTIFIER_POINTER (id),
9375 IDENTIFIER_LENGTH (id) + 1);
9376 name = get_identifier (buf);
9378 /* If TREE_TYPE isn't set, we're still in the introducer, so check
9380 if (!LAMBDA_EXPR_CLOSURE (lambda))
9382 if (IDENTIFIER_MARKED (name))
9384 pedwarn (input_location, 0,
9385 "already captured %qD in lambda expression", id);
9388 IDENTIFIER_MARKED (name) = true;
9391 /* Make member variable. */
9392 member = build_lang_decl (FIELD_DECL, name, type);
9394 if (!explicit_init_p)
9395 /* Normal captures are invisible to name lookup but uses are replaced
9396 with references to the capture field; we implement this by only
9397 really making them invisible in unevaluated context; see
9398 qualify_lookup. For now, let's make explicitly initialized captures
9400 DECL_NORMAL_CAPTURE_P (member) = true;
9402 if (id == this_identifier)
9403 LAMBDA_EXPR_THIS_CAPTURE (lambda) = member;
9405 /* Add it to the appropriate closure class if we've started it. */
9406 if (current_class_type
9407 && current_class_type == LAMBDA_EXPR_CLOSURE (lambda))
9408 finish_member_declaration (member);
9410 LAMBDA_EXPR_CAPTURE_LIST (lambda)
9411 = tree_cons (member, initializer, LAMBDA_EXPR_CAPTURE_LIST (lambda));
9413 if (LAMBDA_EXPR_CLOSURE (lambda))
9414 return build_capture_proxy (member);
9415 /* For explicit captures we haven't started the function yet, so we wait
9416 and build the proxy from cp_parser_lambda_body. */
9420 /* Register all the capture members on the list CAPTURES, which is the
9421 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
9424 register_capture_members (tree captures)
9426 if (captures == NULL_TREE)
9429 register_capture_members (TREE_CHAIN (captures));
9430 /* We set this in add_capture to avoid duplicates. */
9431 IDENTIFIER_MARKED (DECL_NAME (TREE_PURPOSE (captures))) = false;
9432 finish_member_declaration (TREE_PURPOSE (captures));
9435 /* Similar to add_capture, except this works on a stack of nested lambdas.
9436 BY_REFERENCE_P in this case is derived from the default capture mode.
9437 Returns the capture for the lambda at the bottom of the stack. */
9440 add_default_capture (tree lambda_stack, tree id, tree initializer)
9442 bool this_capture_p = (id == this_identifier);
9444 tree var = NULL_TREE;
9446 tree saved_class_type = current_class_type;
9450 for (node = lambda_stack;
9452 node = TREE_CHAIN (node))
9454 tree lambda = TREE_VALUE (node);
9456 current_class_type = LAMBDA_EXPR_CLOSURE (lambda);
9457 var = add_capture (lambda,
9462 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda)
9463 == CPLD_REFERENCE)),
9464 /*explicit_init_p=*/false);
9465 initializer = convert_from_reference (var);
9468 current_class_type = saved_class_type;
9473 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
9474 INDIRECT_REF, possibly adding it through default capturing. */
9477 lambda_expr_this_capture (tree lambda)
9481 tree this_capture = LAMBDA_EXPR_THIS_CAPTURE (lambda);
9483 /* In unevaluated context this isn't an odr-use, so just return the
9485 if (cp_unevaluated_operand)
9486 return lookup_name (this_identifier);
9488 /* Try to default capture 'this' if we can. */
9490 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) != CPLD_NONE)
9492 tree lambda_stack = NULL_TREE;
9493 tree init = NULL_TREE;
9495 /* If we are in a lambda function, we can move out until we hit:
9496 1. a non-lambda function or NSDMI,
9497 2. a lambda function capturing 'this', or
9498 3. a non-default capturing lambda function. */
9499 for (tree tlambda = lambda; ;)
9501 lambda_stack = tree_cons (NULL_TREE,
9505 if (LAMBDA_EXPR_EXTRA_SCOPE (tlambda)
9506 && TREE_CODE (LAMBDA_EXPR_EXTRA_SCOPE (tlambda)) == FIELD_DECL)
9508 /* In an NSDMI, we don't have a function to look up the decl in,
9509 but the fake 'this' pointer that we're using for parsing is
9511 init = scope_chain->x_current_class_ptr;
9513 (init && (TREE_TYPE (TREE_TYPE (init))
9514 == current_nonlambda_class_type ()));
9518 tree closure_decl = TYPE_NAME (LAMBDA_EXPR_CLOSURE (tlambda));
9519 tree containing_function = decl_function_context (closure_decl);
9521 if (containing_function == NULL_TREE)
9522 /* We ran out of scopes; there's no 'this' to capture. */
9525 if (!LAMBDA_FUNCTION_P (containing_function))
9527 /* We found a non-lambda function. */
9528 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function))
9529 /* First parameter is 'this'. */
9530 init = DECL_ARGUMENTS (containing_function);
9535 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function));
9537 if (LAMBDA_EXPR_THIS_CAPTURE (tlambda))
9539 /* An outer lambda has already captured 'this'. */
9540 init = LAMBDA_EXPR_THIS_CAPTURE (tlambda);
9544 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (tlambda) == CPLD_NONE)
9545 /* An outer lambda won't let us capture 'this'. */
9550 this_capture = add_default_capture (lambda_stack,
9551 /*id=*/this_identifier,
9557 error ("%<this%> was not captured for this lambda function");
9558 result = error_mark_node;
9562 /* To make sure that current_class_ref is for the lambda. */
9563 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref))
9564 == LAMBDA_EXPR_CLOSURE (lambda));
9566 result = this_capture;
9568 /* If 'this' is captured, each use of 'this' is transformed into an
9569 access to the corresponding unnamed data member of the closure
9570 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
9571 ensures that the transformed expression is an rvalue. ] */
9572 result = rvalue (result);
9578 /* We don't want to capture 'this' until we know we need it, i.e. after
9579 overload resolution has chosen a non-static member function. At that
9580 point we call this function to turn a dummy object into a use of the
9584 maybe_resolve_dummy (tree object)
9586 if (!is_dummy_object (object))
9589 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (object));
9590 gcc_assert (TREE_CODE (type) != POINTER_TYPE);
9592 if (type != current_class_type
9593 && current_class_type
9594 && LAMBDA_TYPE_P (current_class_type)
9595 && DERIVED_FROM_P (type, current_nonlambda_class_type ()))
9597 /* In a lambda, need to go through 'this' capture. */
9598 tree lam = CLASSTYPE_LAMBDA_EXPR (current_class_type);
9599 tree cap = lambda_expr_this_capture (lam);
9600 object = build_x_indirect_ref (EXPR_LOCATION (object), cap,
9601 RO_NULL, tf_warning_or_error);
9607 /* Returns the method basetype of the innermost non-lambda function, or
9608 NULL_TREE if none. */
9611 nonlambda_method_basetype (void)
9614 if (!current_class_ref)
9617 type = current_class_type;
9618 if (!LAMBDA_TYPE_P (type))
9621 /* Find the nearest enclosing non-lambda function. */
9622 fn = TYPE_NAME (type);
9624 fn = decl_function_context (fn);
9625 while (fn && LAMBDA_FUNCTION_P (fn));
9627 if (!fn || !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
9630 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn));
9633 /* If the closure TYPE has a static op(), also add a conversion to function
9637 maybe_add_lambda_conv_op (tree type)
9639 bool nested = (current_function_decl != NULL_TREE);
9640 tree callop = lambda_function (type);
9641 tree rettype, name, fntype, fn, body, compound_stmt;
9642 tree thistype, stattype, statfn, convfn, call, arg;
9643 vec<tree, va_gc> *argvec;
9645 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type)) != NULL_TREE)
9648 if (processing_template_decl)
9651 stattype = build_function_type (TREE_TYPE (TREE_TYPE (callop)),
9652 FUNCTION_ARG_CHAIN (callop));
9654 /* First build up the conversion op. */
9656 rettype = build_pointer_type (stattype);
9657 name = mangle_conv_op_name_for_type (rettype);
9658 thistype = cp_build_qualified_type (type, TYPE_QUAL_CONST);
9659 fntype = build_method_type_directly (thistype, rettype, void_list_node);
9660 fn = convfn = build_lang_decl (FUNCTION_DECL, name, fntype);
9661 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
9663 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
9664 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
9665 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
9667 SET_OVERLOADED_OPERATOR_CODE (fn, TYPE_EXPR);
9668 grokclassfn (type, fn, NO_SPECIAL);
9669 set_linkage_according_to_type (type, fn);
9670 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
9671 DECL_IN_AGGR_P (fn) = 1;
9672 DECL_ARTIFICIAL (fn) = 1;
9673 DECL_NOT_REALLY_EXTERN (fn) = 1;
9674 DECL_DECLARED_INLINE_P (fn) = 1;
9675 DECL_ARGUMENTS (fn) = build_this_parm (fntype, TYPE_QUAL_CONST);
9677 DECL_INTERFACE_KNOWN (fn) = 1;
9679 add_method (type, fn, NULL_TREE);
9681 /* Generic thunk code fails for varargs; we'll complain in mark_used if
9682 the conversion op is used. */
9683 if (varargs_function_p (callop))
9685 DECL_DELETED_FN (fn) = 1;
9689 /* Now build up the thunk to be returned. */
9691 name = get_identifier ("_FUN");
9692 fn = statfn = build_lang_decl (FUNCTION_DECL, name, stattype);
9693 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
9694 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
9695 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
9696 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
9697 grokclassfn (type, fn, NO_SPECIAL);
9698 set_linkage_according_to_type (type, fn);
9699 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
9700 DECL_IN_AGGR_P (fn) = 1;
9701 DECL_ARTIFICIAL (fn) = 1;
9702 DECL_NOT_REALLY_EXTERN (fn) = 1;
9703 DECL_DECLARED_INLINE_P (fn) = 1;
9704 DECL_STATIC_FUNCTION_P (fn) = 1;
9705 DECL_ARGUMENTS (fn) = copy_list (DECL_CHAIN (DECL_ARGUMENTS (callop)));
9706 for (arg = DECL_ARGUMENTS (fn); arg; arg = DECL_CHAIN (arg))
9708 /* Avoid duplicate -Wshadow warnings. */
9709 DECL_NAME (arg) = NULL_TREE;
9710 DECL_CONTEXT (arg) = fn;
9713 DECL_INTERFACE_KNOWN (fn) = 1;
9715 add_method (type, fn, NULL_TREE);
9718 push_function_context ();
9720 /* Still increment function_depth so that we don't GC in the
9721 middle of an expression. */
9724 /* Generate the body of the thunk. */
9726 start_preparsed_function (statfn, NULL_TREE,
9727 SF_PRE_PARSED | SF_INCLASS_INLINE);
9728 if (DECL_ONE_ONLY (statfn))
9730 /* Put the thunk in the same comdat group as the call op. */
9731 symtab_add_to_same_comdat_group
9732 ((symtab_node) cgraph_get_create_node (statfn),
9733 (symtab_node) cgraph_get_create_node (callop));
9735 body = begin_function_body ();
9736 compound_stmt = begin_compound_stmt (0);
9738 arg = build1 (NOP_EXPR, TREE_TYPE (DECL_ARGUMENTS (callop)),
9740 argvec = make_tree_vector ();
9741 argvec->quick_push (arg);
9742 for (arg = DECL_ARGUMENTS (statfn); arg; arg = DECL_CHAIN (arg))
9744 mark_exp_read (arg);
9745 vec_safe_push (argvec, arg);
9747 call = build_call_a (callop, argvec->length (), argvec->address ());
9748 CALL_FROM_THUNK_P (call) = 1;
9749 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call)))
9750 call = build_cplus_new (TREE_TYPE (call), call, tf_warning_or_error);
9751 call = convert_from_reference (call);
9752 finish_return_stmt (call);
9754 finish_compound_stmt (compound_stmt);
9755 finish_function_body (body);
9757 expand_or_defer_fn (finish_function (2));
9759 /* Generate the body of the conversion op. */
9761 start_preparsed_function (convfn, NULL_TREE,
9762 SF_PRE_PARSED | SF_INCLASS_INLINE);
9763 body = begin_function_body ();
9764 compound_stmt = begin_compound_stmt (0);
9766 /* decl_needed_p needs to see that it's used. */
9767 TREE_USED (statfn) = 1;
9768 finish_return_stmt (decay_conversion (statfn, tf_warning_or_error));
9770 finish_compound_stmt (compound_stmt);
9771 finish_function_body (body);
9773 expand_or_defer_fn (finish_function (2));
9776 pop_function_context ();
9781 /* Returns true iff VAL is a lambda-related declaration which should
9782 be ignored by unqualified lookup. */
9785 is_lambda_ignored_entity (tree val)
9787 /* In unevaluated context, look past normal capture proxies. */
9788 if (cp_unevaluated_operand && is_normal_capture_proxy (val))
9791 /* Always ignore lambda fields, their names are only for debugging. */
9792 if (TREE_CODE (val) == FIELD_DECL
9793 && CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (val)))
9796 /* None of the lookups that use qualify_lookup want the op() from the
9797 lambda; they want the one from the enclosing class. */
9798 if (TREE_CODE (val) == FUNCTION_DECL && LAMBDA_FUNCTION_P (val))
9804 #include "gt-cp-semantics.h"