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. */
2723 else if (pushdecl_class_level (decl))
2725 if (TREE_CODE (decl) == USING_DECL)
2727 /* For now, ignore class-scope USING_DECLS, so that
2728 debugging backends do not see them. */
2729 DECL_IGNORED_P (decl) = 1;
2732 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2733 go at the beginning. The reason is that lookup_field_1
2734 searches the list in order, and we want a field name to
2735 override a type name so that the "struct stat hack" will
2736 work. In particular:
2738 struct S { enum E { }; int E } s;
2741 is valid. In addition, the FIELD_DECLs must be maintained in
2742 declaration order so that class layout works as expected.
2743 However, we don't need that order until class layout, so we
2744 save a little time by putting FIELD_DECLs on in reverse order
2745 here, and then reversing them in finish_struct_1. (We could
2746 also keep a pointer to the correct insertion points in the
2749 if (TREE_CODE (decl) == TYPE_DECL)
2750 TYPE_FIELDS (current_class_type)
2751 = chainon (TYPE_FIELDS (current_class_type), decl);
2754 DECL_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2755 TYPE_FIELDS (current_class_type) = decl;
2758 maybe_add_class_template_decl_list (current_class_type, decl,
2763 note_decl_for_pch (decl);
2766 /* DECL has been declared while we are building a PCH file. Perform
2767 actions that we might normally undertake lazily, but which can be
2768 performed now so that they do not have to be performed in
2769 translation units which include the PCH file. */
2772 note_decl_for_pch (tree decl)
2774 gcc_assert (pch_file);
2776 /* There's a good chance that we'll have to mangle names at some
2777 point, even if only for emission in debugging information. */
2778 if (VAR_OR_FUNCTION_DECL_P (decl)
2779 && !processing_template_decl)
2783 /* Finish processing a complete template declaration. The PARMS are
2784 the template parameters. */
2787 finish_template_decl (tree parms)
2790 end_template_decl ();
2792 end_specialization ();
2795 /* Finish processing a template-id (which names a type) of the form
2796 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2797 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2798 the scope of template-id indicated. */
2801 finish_template_type (tree name, tree args, int entering_scope)
2805 type = lookup_template_class (name, args,
2806 NULL_TREE, NULL_TREE, entering_scope,
2807 tf_warning_or_error | tf_user);
2808 if (type == error_mark_node)
2810 else if (CLASS_TYPE_P (type) && !alias_type_or_template_p (type))
2811 return TYPE_STUB_DECL (type);
2813 return TYPE_NAME (type);
2816 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2817 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2818 BASE_CLASS, or NULL_TREE if an error occurred. The
2819 ACCESS_SPECIFIER is one of
2820 access_{default,public,protected_private}_node. For a virtual base
2821 we set TREE_TYPE. */
2824 finish_base_specifier (tree base, tree access, bool virtual_p)
2828 if (base == error_mark_node)
2830 error ("invalid base-class specification");
2833 else if (! MAYBE_CLASS_TYPE_P (base))
2835 error ("%qT is not a class type", base);
2840 if (cp_type_quals (base) != 0)
2842 /* DR 484: Can a base-specifier name a cv-qualified
2844 base = TYPE_MAIN_VARIANT (base);
2846 result = build_tree_list (access, base);
2848 TREE_TYPE (result) = integer_type_node;
2854 /* If FNS is a member function, a set of member functions, or a
2855 template-id referring to one or more member functions, return a
2856 BASELINK for FNS, incorporating the current access context.
2857 Otherwise, return FNS unchanged. */
2860 baselink_for_fns (tree fns)
2865 if (BASELINK_P (fns)
2866 || error_operand_p (fns))
2869 scope = ovl_scope (fns);
2870 if (!CLASS_TYPE_P (scope))
2873 cl = currently_open_derived_class (scope);
2876 cl = TYPE_BINFO (cl);
2877 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2880 /* Returns true iff DECL is a variable from a function outside
2884 outer_var_p (tree decl)
2886 return ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2887 && DECL_FUNCTION_SCOPE_P (decl)
2888 && (DECL_CONTEXT (decl) != current_function_decl
2889 || parsing_nsdmi ()));
2892 /* As above, but also checks that DECL is automatic. */
2895 outer_automatic_var_p (tree decl)
2897 return (outer_var_p (decl)
2898 && !TREE_STATIC (decl));
2901 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2902 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2903 if non-NULL, is the type or namespace used to explicitly qualify
2904 ID_EXPRESSION. DECL is the entity to which that name has been
2907 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2908 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2909 be set to true if this expression isn't permitted in a
2910 constant-expression, but it is otherwise not set by this function.
2911 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2912 constant-expression, but a non-constant expression is also
2915 DONE is true if this expression is a complete postfix-expression;
2916 it is false if this expression is followed by '->', '[', '(', etc.
2917 ADDRESS_P is true iff this expression is the operand of '&'.
2918 TEMPLATE_P is true iff the qualified-id was of the form
2919 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2920 appears as a template argument.
2922 If an error occurs, and it is the kind of error that might cause
2923 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2924 is the caller's responsibility to issue the message. *ERROR_MSG
2925 will be a string with static storage duration, so the caller need
2928 Return an expression for the entity, after issuing appropriate
2929 diagnostics. This function is also responsible for transforming a
2930 reference to a non-static member into a COMPONENT_REF that makes
2931 the use of "this" explicit.
2933 Upon return, *IDK will be filled in appropriately. */
2935 finish_id_expression (tree id_expression,
2939 bool integral_constant_expression_p,
2940 bool allow_non_integral_constant_expression_p,
2941 bool *non_integral_constant_expression_p,
2945 bool template_arg_p,
2946 const char **error_msg,
2947 location_t location)
2949 decl = strip_using_decl (decl);
2951 /* Initialize the output parameters. */
2952 *idk = CP_ID_KIND_NONE;
2955 if (id_expression == error_mark_node)
2956 return error_mark_node;
2957 /* If we have a template-id, then no further lookup is
2958 required. If the template-id was for a template-class, we
2959 will sometimes have a TYPE_DECL at this point. */
2960 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2961 || TREE_CODE (decl) == TYPE_DECL)
2963 /* Look up the name. */
2966 if (decl == error_mark_node)
2968 /* Name lookup failed. */
2971 || (!dependent_type_p (scope)
2972 && !(identifier_p (id_expression)
2973 && IDENTIFIER_TYPENAME_P (id_expression)
2974 && dependent_type_p (TREE_TYPE (id_expression))))))
2976 /* If the qualifying type is non-dependent (and the name
2977 does not name a conversion operator to a dependent
2978 type), issue an error. */
2979 qualified_name_lookup_error (scope, id_expression, decl, location);
2980 return error_mark_node;
2984 /* It may be resolved via Koenig lookup. */
2985 *idk = CP_ID_KIND_UNQUALIFIED;
2986 return id_expression;
2989 decl = id_expression;
2991 /* If DECL is a variable that would be out of scope under
2992 ANSI/ISO rules, but in scope in the ARM, name lookup
2993 will succeed. Issue a diagnostic here. */
2995 decl = check_for_out_of_scope_variable (decl);
2997 /* Remember that the name was used in the definition of
2998 the current class so that we can check later to see if
2999 the meaning would have been different after the class
3000 was entirely defined. */
3001 if (!scope && decl != error_mark_node && identifier_p (id_expression))
3002 maybe_note_name_used_in_class (id_expression, decl);
3004 /* Disallow uses of local variables from containing functions, except
3005 within lambda-expressions. */
3006 if (!outer_var_p (decl)
3007 /* It's not a use (3.2) if we're in an unevaluated context. */
3008 || cp_unevaluated_operand)
3010 else if (TREE_STATIC (decl))
3012 if (processing_template_decl)
3013 /* For a use of an outer static var, return the identifier so
3014 that we'll look it up again in the instantiation. */
3015 return id_expression;
3019 tree context = DECL_CONTEXT (decl);
3020 tree containing_function = current_function_decl;
3021 tree lambda_stack = NULL_TREE;
3022 tree lambda_expr = NULL_TREE;
3023 tree initializer = convert_from_reference (decl);
3025 /* Mark it as used now even if the use is ill-formed. */
3028 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
3029 support for an approach in which a reference to a local
3030 [constant] automatic variable in a nested class or lambda body
3031 would enter the expression as an rvalue, which would reduce
3032 the complexity of the problem"
3034 FIXME update for final resolution of core issue 696. */
3035 if (decl_constant_var_p (decl))
3037 if (processing_template_decl)
3038 /* In a template, the constant value may not be in a usable
3039 form, so look it up again at instantiation time. */
3040 return id_expression;
3042 return integral_constant_value (decl);
3045 if (parsing_nsdmi ())
3046 containing_function = NULL_TREE;
3047 /* If we are in a lambda function, we can move out until we hit
3049 2. a non-lambda function, or
3050 3. a non-default capturing lambda function. */
3051 else while (context != containing_function
3052 && LAMBDA_FUNCTION_P (containing_function))
3054 lambda_expr = CLASSTYPE_LAMBDA_EXPR
3055 (DECL_CONTEXT (containing_function));
3057 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr)
3061 lambda_stack = tree_cons (NULL_TREE,
3066 = decl_function_context (containing_function);
3069 if (context == containing_function)
3071 decl = add_default_capture (lambda_stack,
3072 /*id=*/DECL_NAME (decl),
3075 else if (lambda_expr)
3077 error ("%qD is not captured", decl);
3078 return error_mark_node;
3082 error (TREE_CODE (decl) == VAR_DECL
3083 ? G_("use of local variable with automatic storage from containing function")
3084 : G_("use of parameter from containing function"));
3085 error (" %q+#D declared here", decl);
3086 return error_mark_node;
3090 /* Also disallow uses of function parameters outside the function
3091 body, except inside an unevaluated context (i.e. decltype). */
3092 if (TREE_CODE (decl) == PARM_DECL
3093 && DECL_CONTEXT (decl) == NULL_TREE
3094 && !cp_unevaluated_operand)
3096 error ("use of parameter %qD outside function body", decl);
3097 return error_mark_node;
3101 /* If we didn't find anything, or what we found was a type,
3102 then this wasn't really an id-expression. */
3103 if (TREE_CODE (decl) == TEMPLATE_DECL
3104 && !DECL_FUNCTION_TEMPLATE_P (decl))
3106 *error_msg = "missing template arguments";
3107 return error_mark_node;
3109 else if (TREE_CODE (decl) == TYPE_DECL
3110 || TREE_CODE (decl) == NAMESPACE_DECL)
3112 *error_msg = "expected primary-expression";
3113 return error_mark_node;
3116 /* If the name resolved to a template parameter, there is no
3117 need to look it up again later. */
3118 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
3119 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
3123 *idk = CP_ID_KIND_NONE;
3124 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
3125 decl = TEMPLATE_PARM_DECL (decl);
3126 r = convert_from_reference (DECL_INITIAL (decl));
3128 if (integral_constant_expression_p
3129 && !dependent_type_p (TREE_TYPE (decl))
3130 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
3132 if (!allow_non_integral_constant_expression_p)
3133 error ("template parameter %qD of type %qT is not allowed in "
3134 "an integral constant expression because it is not of "
3135 "integral or enumeration type", decl, TREE_TYPE (decl));
3136 *non_integral_constant_expression_p = true;
3144 /* If the declaration was explicitly qualified indicate
3145 that. The semantics of `A::f(3)' are different than
3146 `f(3)' if `f' is virtual. */
3148 ? CP_ID_KIND_QUALIFIED
3149 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
3150 ? CP_ID_KIND_TEMPLATE_ID
3151 : CP_ID_KIND_UNQUALIFIED));
3156 An id-expression is type-dependent if it contains an
3157 identifier that was declared with a dependent type.
3159 The standard is not very specific about an id-expression that
3160 names a set of overloaded functions. What if some of them
3161 have dependent types and some of them do not? Presumably,
3162 such a name should be treated as a dependent name. */
3163 /* Assume the name is not dependent. */
3164 dependent_p = false;
3165 if (!processing_template_decl)
3166 /* No names are dependent outside a template. */
3168 else if (TREE_CODE (decl) == CONST_DECL)
3169 /* We don't want to treat enumerators as dependent. */
3171 /* A template-id where the name of the template was not resolved
3172 is definitely dependent. */
3173 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
3174 && (identifier_p (TREE_OPERAND (decl, 0))))
3176 /* For anything except an overloaded function, just check its
3178 else if (!is_overloaded_fn (decl))
3180 = dependent_type_p (TREE_TYPE (decl));
3181 /* For a set of overloaded functions, check each of the
3187 if (BASELINK_P (fns))
3188 fns = BASELINK_FUNCTIONS (fns);
3190 /* For a template-id, check to see if the template
3191 arguments are dependent. */
3192 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
3194 tree args = TREE_OPERAND (fns, 1);
3195 dependent_p = any_dependent_template_arguments_p (args);
3196 /* The functions are those referred to by the
3198 fns = TREE_OPERAND (fns, 0);
3201 /* If there are no dependent template arguments, go through
3202 the overloaded functions. */
3203 while (fns && !dependent_p)
3205 tree fn = OVL_CURRENT (fns);
3207 /* Member functions of dependent classes are
3209 if (TREE_CODE (fn) == FUNCTION_DECL
3210 && type_dependent_expression_p (fn))
3212 else if (TREE_CODE (fn) == TEMPLATE_DECL
3213 && dependent_template_p (fn))
3216 fns = OVL_NEXT (fns);
3220 /* If the name was dependent on a template parameter, we will
3221 resolve the name at instantiation time. */
3224 /* Create a SCOPE_REF for qualified names, if the scope is
3230 if (address_p && done)
3231 decl = finish_qualified_id_expr (scope, decl,
3237 tree type = NULL_TREE;
3238 if (DECL_P (decl) && !dependent_scope_p (scope))
3239 type = TREE_TYPE (decl);
3240 decl = build_qualified_name (type,
3246 if (TREE_TYPE (decl))
3247 decl = convert_from_reference (decl);
3250 /* A TEMPLATE_ID already contains all the information we
3252 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
3253 return id_expression;
3254 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
3255 /* If we found a variable, then name lookup during the
3256 instantiation will always resolve to the same VAR_DECL
3257 (or an instantiation thereof). */
3258 if (TREE_CODE (decl) == VAR_DECL
3259 || TREE_CODE (decl) == PARM_DECL)
3262 return convert_from_reference (decl);
3264 /* The same is true for FIELD_DECL, but we also need to
3265 make sure that the syntax is correct. */
3266 else if (TREE_CODE (decl) == FIELD_DECL)
3268 /* Since SCOPE is NULL here, this is an unqualified name.
3269 Access checking has been performed during name lookup
3270 already. Turn off checking to avoid duplicate errors. */
3271 push_deferring_access_checks (dk_no_check);
3272 decl = finish_non_static_data_member
3274 /*qualifying_scope=*/NULL_TREE);
3275 pop_deferring_access_checks ();
3278 return id_expression;
3281 if (TREE_CODE (decl) == NAMESPACE_DECL)
3283 error ("use of namespace %qD as expression", decl);
3284 return error_mark_node;
3286 else if (DECL_CLASS_TEMPLATE_P (decl))
3288 error ("use of class template %qT as expression", decl);
3289 return error_mark_node;
3291 else if (TREE_CODE (decl) == TREE_LIST)
3293 /* Ambiguous reference to base members. */
3294 error ("request for member %qD is ambiguous in "
3295 "multiple inheritance lattice", id_expression);
3296 print_candidates (decl);
3297 return error_mark_node;
3300 /* Mark variable-like entities as used. Functions are similarly
3301 marked either below or after overload resolution. */
3302 if ((TREE_CODE (decl) == VAR_DECL
3303 || TREE_CODE (decl) == PARM_DECL
3304 || TREE_CODE (decl) == CONST_DECL
3305 || TREE_CODE (decl) == RESULT_DECL)
3306 && !mark_used (decl))
3307 return error_mark_node;
3309 /* Only certain kinds of names are allowed in constant
3310 expression. Template parameters have already
3311 been handled above. */
3312 if (! error_operand_p (decl)
3313 && integral_constant_expression_p
3314 && ! decl_constant_var_p (decl)
3315 && TREE_CODE (decl) != CONST_DECL
3316 && ! builtin_valid_in_constant_expr_p (decl))
3318 if (!allow_non_integral_constant_expression_p)
3320 error ("%qD cannot appear in a constant-expression", decl);
3321 return error_mark_node;
3323 *non_integral_constant_expression_p = true;
3327 if (TREE_CODE (decl) == VAR_DECL
3328 && !cp_unevaluated_operand
3329 && DECL_THREAD_LOCAL_P (decl)
3330 && (wrap = get_tls_wrapper_fn (decl)))
3332 /* Replace an evaluated use of the thread_local variable with
3333 a call to its wrapper. */
3334 decl = build_cxx_call (wrap, 0, NULL, tf_warning_or_error);
3338 decl = (adjust_result_of_qualified_name_lookup
3339 (decl, scope, current_nonlambda_class_type()));
3341 if (TREE_CODE (decl) == FUNCTION_DECL)
3345 decl = finish_qualified_id_expr (scope,
3352 decl = convert_from_reference (decl);
3354 else if (TREE_CODE (decl) == FIELD_DECL)
3356 /* Since SCOPE is NULL here, this is an unqualified name.
3357 Access checking has been performed during name lookup
3358 already. Turn off checking to avoid duplicate errors. */
3359 push_deferring_access_checks (dk_no_check);
3360 decl = finish_non_static_data_member (decl, NULL_TREE,
3361 /*qualifying_scope=*/NULL_TREE);
3362 pop_deferring_access_checks ();
3364 else if (is_overloaded_fn (decl))
3368 first_fn = get_first_fn (decl);
3369 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
3370 first_fn = DECL_TEMPLATE_RESULT (first_fn);
3372 if (!really_overloaded_fn (decl)
3373 && !mark_used (first_fn))
3374 return error_mark_node;
3377 && TREE_CODE (first_fn) == FUNCTION_DECL
3378 && DECL_FUNCTION_MEMBER_P (first_fn)
3379 && !shared_member_p (decl))
3381 /* A set of member functions. */
3382 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3383 return finish_class_member_access_expr (decl, id_expression,
3384 /*template_p=*/false,
3385 tf_warning_or_error);
3388 decl = baselink_for_fns (decl);
3392 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3393 && DECL_CLASS_SCOPE_P (decl))
3395 tree context = context_for_name_lookup (decl);
3396 if (context != current_class_type)
3398 tree path = currently_open_derived_class (context);
3399 perform_or_defer_access_check (TYPE_BINFO (path),
3401 tf_warning_or_error);
3405 decl = convert_from_reference (decl);
3409 if (TREE_DEPRECATED (decl))
3410 warn_deprecated_use (decl, NULL_TREE);
3415 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3416 use as a type-specifier. */
3419 finish_typeof (tree expr)
3423 if (type_dependent_expression_p (expr))
3425 type = cxx_make_type (TYPEOF_TYPE);
3426 TYPEOF_TYPE_EXPR (type) = expr;
3427 SET_TYPE_STRUCTURAL_EQUALITY (type);
3432 expr = mark_type_use (expr);
3434 type = unlowered_expr_type (expr);
3436 if (!type || type == unknown_type_node)
3438 error ("type of %qE is unknown", expr);
3439 return error_mark_node;
3445 /* Implement the __underlying_type keyword: Return the underlying
3446 type of TYPE, suitable for use as a type-specifier. */
3449 finish_underlying_type (tree type)
3451 tree underlying_type;
3453 if (processing_template_decl)
3455 underlying_type = cxx_make_type (UNDERLYING_TYPE);
3456 UNDERLYING_TYPE_TYPE (underlying_type) = type;
3457 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type);
3459 return underlying_type;
3462 complete_type (type);
3464 if (TREE_CODE (type) != ENUMERAL_TYPE)
3466 error ("%qT is not an enumeration type", type);
3467 return error_mark_node;
3470 underlying_type = ENUM_UNDERLYING_TYPE (type);
3472 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
3473 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
3474 See finish_enum_value_list for details. */
3475 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type))
3477 = c_common_type_for_mode (TYPE_MODE (underlying_type),
3478 TYPE_UNSIGNED (underlying_type));
3480 return underlying_type;
3483 /* Implement the __direct_bases keyword: Return the direct base classes
3487 calculate_direct_bases (tree type)
3489 vec<tree, va_gc> *vector = make_tree_vector();
3490 tree bases_vec = NULL_TREE;
3491 vec<tree, va_gc> *base_binfos;
3495 complete_type (type);
3497 if (!NON_UNION_CLASS_TYPE_P (type))
3498 return make_tree_vec (0);
3500 base_binfos = BINFO_BASE_BINFOS (TYPE_BINFO (type));
3502 /* Virtual bases are initialized first */
3503 for (i = 0; base_binfos->iterate (i, &binfo); i++)
3505 if (BINFO_VIRTUAL_P (binfo))
3507 vec_safe_push (vector, binfo);
3511 /* Now non-virtuals */
3512 for (i = 0; base_binfos->iterate (i, &binfo); i++)
3514 if (!BINFO_VIRTUAL_P (binfo))
3516 vec_safe_push (vector, binfo);
3521 bases_vec = make_tree_vec (vector->length ());
3523 for (i = 0; i < vector->length (); ++i)
3525 TREE_VEC_ELT (bases_vec, i) = BINFO_TYPE ((*vector)[i]);
3530 /* Implement the __bases keyword: Return the base classes
3533 /* Find morally non-virtual base classes by walking binfo hierarchy */
3534 /* Virtual base classes are handled separately in finish_bases */
3537 dfs_calculate_bases_pre (tree binfo, void * /*data_*/)
3539 /* Don't walk bases of virtual bases */
3540 return BINFO_VIRTUAL_P (binfo) ? dfs_skip_bases : NULL_TREE;
3544 dfs_calculate_bases_post (tree binfo, void *data_)
3546 vec<tree, va_gc> **data = ((vec<tree, va_gc> **) data_);
3547 if (!BINFO_VIRTUAL_P (binfo))
3549 vec_safe_push (*data, BINFO_TYPE (binfo));
3554 /* Calculates the morally non-virtual base classes of a class */
3555 static vec<tree, va_gc> *
3556 calculate_bases_helper (tree type)
3558 vec<tree, va_gc> *vector = make_tree_vector();
3560 /* Now add non-virtual base classes in order of construction */
3561 dfs_walk_all (TYPE_BINFO (type),
3562 dfs_calculate_bases_pre, dfs_calculate_bases_post, &vector);
3567 calculate_bases (tree type)
3569 vec<tree, va_gc> *vector = make_tree_vector();
3570 tree bases_vec = NULL_TREE;
3572 vec<tree, va_gc> *vbases;
3573 vec<tree, va_gc> *nonvbases;
3576 complete_type (type);
3578 if (!NON_UNION_CLASS_TYPE_P (type))
3579 return make_tree_vec (0);
3581 /* First go through virtual base classes */
3582 for (vbases = CLASSTYPE_VBASECLASSES (type), i = 0;
3583 vec_safe_iterate (vbases, i, &binfo); i++)
3585 vec<tree, va_gc> *vbase_bases;
3586 vbase_bases = calculate_bases_helper (BINFO_TYPE (binfo));
3587 vec_safe_splice (vector, vbase_bases);
3588 release_tree_vector (vbase_bases);
3591 /* Now for the non-virtual bases */
3592 nonvbases = calculate_bases_helper (type);
3593 vec_safe_splice (vector, nonvbases);
3594 release_tree_vector (nonvbases);
3596 /* Last element is entire class, so don't copy */
3597 bases_vec = make_tree_vec (vector->length () - 1);
3599 for (i = 0; i < vector->length () - 1; ++i)
3601 TREE_VEC_ELT (bases_vec, i) = (*vector)[i];
3603 release_tree_vector (vector);
3608 finish_bases (tree type, bool direct)
3610 tree bases = NULL_TREE;
3612 if (!processing_template_decl)
3614 /* Parameter packs can only be used in templates */
3615 error ("Parameter pack __bases only valid in template declaration");
3616 return error_mark_node;
3619 bases = cxx_make_type (BASES);
3620 BASES_TYPE (bases) = type;
3621 BASES_DIRECT (bases) = direct;
3622 SET_TYPE_STRUCTURAL_EQUALITY (bases);
3627 /* Perform C++-specific checks for __builtin_offsetof before calling
3631 finish_offsetof (tree expr)
3633 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3635 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3636 TREE_OPERAND (expr, 2));
3637 return error_mark_node;
3639 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3640 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3641 || TREE_TYPE (expr) == unknown_type_node)
3643 if (TREE_CODE (expr) == COMPONENT_REF
3644 || TREE_CODE (expr) == COMPOUND_EXPR)
3645 expr = TREE_OPERAND (expr, 1);
3646 error ("cannot apply %<offsetof%> to member function %qD", expr);
3647 return error_mark_node;
3649 if (REFERENCE_REF_P (expr))
3650 expr = TREE_OPERAND (expr, 0);
3651 if (TREE_CODE (expr) == COMPONENT_REF)
3653 tree object = TREE_OPERAND (expr, 0);
3654 if (!complete_type_or_else (TREE_TYPE (object), object))
3655 return error_mark_node;
3657 return fold_offsetof (expr);
3660 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3661 function is broken out from the above for the benefit of the tree-ssa
3665 simplify_aggr_init_expr (tree *tp)
3667 tree aggr_init_expr = *tp;
3669 /* Form an appropriate CALL_EXPR. */
3670 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3671 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3672 tree type = TREE_TYPE (slot);
3675 enum style_t { ctor, arg, pcc } style;
3677 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3679 #ifdef PCC_STATIC_STRUCT_RETURN
3685 gcc_assert (TREE_ADDRESSABLE (type));
3689 call_expr = build_call_array_loc (input_location,
3690 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3692 aggr_init_expr_nargs (aggr_init_expr),
3693 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3694 TREE_NOTHROW (call_expr) = TREE_NOTHROW (aggr_init_expr);
3698 /* Replace the first argument to the ctor with the address of the
3700 cxx_mark_addressable (slot);
3701 CALL_EXPR_ARG (call_expr, 0) =
3702 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3704 else if (style == arg)
3706 /* Just mark it addressable here, and leave the rest to
3707 expand_call{,_inline}. */
3708 cxx_mark_addressable (slot);
3709 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3710 call_expr = build2 (INIT_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3712 else if (style == pcc)
3714 /* If we're using the non-reentrant PCC calling convention, then we
3715 need to copy the returned value out of the static buffer into the
3717 push_deferring_access_checks (dk_no_check);
3718 call_expr = build_aggr_init (slot, call_expr,
3719 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3720 tf_warning_or_error);
3721 pop_deferring_access_checks ();
3722 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3725 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3727 tree init = build_zero_init (type, NULL_TREE,
3728 /*static_storage_p=*/false);
3729 init = build2 (INIT_EXPR, void_type_node, slot, init);
3730 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3737 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3740 emit_associated_thunks (tree fn)
3742 /* When we use vcall offsets, we emit thunks with the virtual
3743 functions to which they thunk. The whole point of vcall offsets
3744 is so that you can know statically the entire set of thunks that
3745 will ever be needed for a given virtual function, thereby
3746 enabling you to output all the thunks with the function itself. */
3747 if (DECL_VIRTUAL_P (fn)
3748 /* Do not emit thunks for extern template instantiations. */
3749 && ! DECL_REALLY_EXTERN (fn))
3753 for (thunk = DECL_THUNKS (fn); thunk; thunk = DECL_CHAIN (thunk))
3755 if (!THUNK_ALIAS (thunk))
3757 use_thunk (thunk, /*emit_p=*/1);
3758 if (DECL_RESULT_THUNK_P (thunk))
3762 for (probe = DECL_THUNKS (thunk);
3763 probe; probe = DECL_CHAIN (probe))
3764 use_thunk (probe, /*emit_p=*/1);
3768 gcc_assert (!DECL_THUNKS (thunk));
3773 /* Returns true iff FUN is an instantiation of a constexpr function
3777 is_instantiation_of_constexpr (tree fun)
3779 return (DECL_TEMPLOID_INSTANTIATION (fun)
3780 && DECL_DECLARED_CONSTEXPR_P (DECL_TEMPLATE_RESULT
3781 (DECL_TI_TEMPLATE (fun))));
3784 /* Generate RTL for FN. */
3787 expand_or_defer_fn_1 (tree fn)
3789 /* When the parser calls us after finishing the body of a template
3790 function, we don't really want to expand the body. */
3791 if (processing_template_decl)
3793 /* Normally, collection only occurs in rest_of_compilation. So,
3794 if we don't collect here, we never collect junk generated
3795 during the processing of templates until we hit a
3796 non-template function. It's not safe to do this inside a
3797 nested class, though, as the parser may have local state that
3798 is not a GC root. */
3799 if (!function_depth)
3804 gcc_assert (DECL_SAVED_TREE (fn));
3806 /* If this is a constructor or destructor body, we have to clone
3808 if (maybe_clone_body (fn))
3810 /* We don't want to process FN again, so pretend we've written
3811 it out, even though we haven't. */
3812 TREE_ASM_WRITTEN (fn) = 1;
3813 /* If this is an instantiation of a constexpr function, keep
3814 DECL_SAVED_TREE for explain_invalid_constexpr_fn. */
3815 if (!is_instantiation_of_constexpr (fn))
3816 DECL_SAVED_TREE (fn) = NULL_TREE;
3820 /* We make a decision about linkage for these functions at the end
3821 of the compilation. Until that point, we do not want the back
3822 end to output them -- but we do want it to see the bodies of
3823 these functions so that it can inline them as appropriate. */
3824 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3826 if (DECL_INTERFACE_KNOWN (fn))
3827 /* We've already made a decision as to how this function will
3831 DECL_EXTERNAL (fn) = 1;
3832 DECL_NOT_REALLY_EXTERN (fn) = 1;
3833 note_vague_linkage_fn (fn);
3834 /* A non-template inline function with external linkage will
3835 always be COMDAT. As we must eventually determine the
3836 linkage of all functions, and as that causes writes to
3837 the data mapped in from the PCH file, it's advantageous
3838 to mark the functions at this point. */
3839 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3841 /* This function must have external linkage, as
3842 otherwise DECL_INTERFACE_KNOWN would have been
3844 gcc_assert (TREE_PUBLIC (fn));
3845 comdat_linkage (fn);
3846 DECL_INTERFACE_KNOWN (fn) = 1;
3850 import_export_decl (fn);
3852 /* If the user wants us to keep all inline functions, then mark
3853 this function as needed so that finish_file will make sure to
3854 output it later. Similarly, all dllexport'd functions must
3855 be emitted; there may be callers in other DLLs. */
3856 if ((flag_keep_inline_functions
3857 && DECL_DECLARED_INLINE_P (fn)
3858 && !DECL_REALLY_EXTERN (fn))
3859 || (flag_keep_inline_dllexport
3860 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn))))
3863 DECL_EXTERNAL (fn) = 0;
3867 /* There's no reason to do any of the work here if we're only doing
3868 semantic analysis; this code just generates RTL. */
3869 if (flag_syntax_only)
3876 expand_or_defer_fn (tree fn)
3878 if (expand_or_defer_fn_1 (fn))
3882 /* Expand or defer, at the whim of the compilation unit manager. */
3883 cgraph_finalize_function (fn, function_depth > 1);
3884 emit_associated_thunks (fn);
3894 hash_table <pointer_hash <tree_node> > visited;
3897 /* Helper function for walk_tree, used by finalize_nrv below. */
3900 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3902 struct nrv_data *dp = (struct nrv_data *)data;
3905 /* No need to walk into types. There wouldn't be any need to walk into
3906 non-statements, except that we have to consider STMT_EXPRs. */
3909 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3910 but differs from using NULL_TREE in that it indicates that we care
3911 about the value of the RESULT_DECL. */
3912 else if (TREE_CODE (*tp) == RETURN_EXPR)
3913 TREE_OPERAND (*tp, 0) = dp->result;
3914 /* Change all cleanups for the NRV to only run when an exception is
3916 else if (TREE_CODE (*tp) == CLEANUP_STMT
3917 && CLEANUP_DECL (*tp) == dp->var)
3918 CLEANUP_EH_ONLY (*tp) = 1;
3919 /* Replace the DECL_EXPR for the NRV with an initialization of the
3920 RESULT_DECL, if needed. */
3921 else if (TREE_CODE (*tp) == DECL_EXPR
3922 && DECL_EXPR_DECL (*tp) == dp->var)
3925 if (DECL_INITIAL (dp->var)
3926 && DECL_INITIAL (dp->var) != error_mark_node)
3927 init = build2 (INIT_EXPR, void_type_node, dp->result,
3928 DECL_INITIAL (dp->var));
3930 init = build_empty_stmt (EXPR_LOCATION (*tp));
3931 DECL_INITIAL (dp->var) = NULL_TREE;
3932 SET_EXPR_LOCATION (init, EXPR_LOCATION (*tp));
3935 /* And replace all uses of the NRV with the RESULT_DECL. */
3936 else if (*tp == dp->var)
3939 /* Avoid walking into the same tree more than once. Unfortunately, we
3940 can't just use walk_tree_without duplicates because it would only call
3941 us for the first occurrence of dp->var in the function body. */
3942 slot = dp->visited.find_slot (*tp, INSERT);
3948 /* Keep iterating. */
3952 /* Called from finish_function to implement the named return value
3953 optimization by overriding all the RETURN_EXPRs and pertinent
3954 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3955 RESULT_DECL for the function. */
3958 finalize_nrv (tree *tp, tree var, tree result)
3960 struct nrv_data data;
3962 /* Copy name from VAR to RESULT. */
3963 DECL_NAME (result) = DECL_NAME (var);
3964 /* Don't forget that we take its address. */
3965 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3966 /* Finally set DECL_VALUE_EXPR to avoid assigning
3967 a stack slot at -O0 for the original var and debug info
3968 uses RESULT location for VAR. */
3969 SET_DECL_VALUE_EXPR (var, result);
3970 DECL_HAS_VALUE_EXPR_P (var) = 1;
3973 data.result = result;
3974 data.visited.create (37);
3975 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3976 data.visited.dispose ();
3979 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3982 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3983 bool need_copy_ctor, bool need_copy_assignment)
3985 int save_errorcount = errorcount;
3988 /* Always allocate 3 elements for simplicity. These are the
3989 function decls for the ctor, dtor, and assignment op.
3990 This layout is known to the three lang hooks,
3991 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3992 and cxx_omp_clause_assign_op. */
3993 info = make_tree_vec (3);
3994 CP_OMP_CLAUSE_INFO (c) = info;
3996 if (need_default_ctor || need_copy_ctor)
3998 if (need_default_ctor)
3999 t = get_default_ctor (type);
4001 t = get_copy_ctor (type, tf_warning_or_error);
4003 if (t && !trivial_fn_p (t))
4004 TREE_VEC_ELT (info, 0) = t;
4007 if ((need_default_ctor || need_copy_ctor)
4008 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
4009 TREE_VEC_ELT (info, 1) = get_dtor (type, tf_warning_or_error);
4011 if (need_copy_assignment)
4013 t = get_copy_assign (type);
4015 if (t && !trivial_fn_p (t))
4016 TREE_VEC_ELT (info, 2) = t;
4019 return errorcount != save_errorcount;
4022 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
4023 Remove any elements from the list that are invalid. */
4026 finish_omp_clauses (tree clauses)
4028 bitmap_head generic_head, firstprivate_head, lastprivate_head;
4029 tree c, t, *pc = &clauses;
4032 bitmap_obstack_initialize (NULL);
4033 bitmap_initialize (&generic_head, &bitmap_default_obstack);
4034 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
4035 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
4037 for (pc = &clauses, c = clauses; c ; c = *pc)
4039 bool remove = false;
4041 switch (OMP_CLAUSE_CODE (c))
4043 case OMP_CLAUSE_SHARED:
4045 goto check_dup_generic;
4046 case OMP_CLAUSE_PRIVATE:
4048 goto check_dup_generic;
4049 case OMP_CLAUSE_REDUCTION:
4051 goto check_dup_generic;
4052 case OMP_CLAUSE_COPYPRIVATE:
4053 name = "copyprivate";
4054 goto check_dup_generic;
4055 case OMP_CLAUSE_COPYIN:
4057 goto check_dup_generic;
4059 t = OMP_CLAUSE_DECL (c);
4060 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
4062 if (processing_template_decl)
4065 error ("%qD is not a variable in clause %qs", t, name);
4067 error ("%qE is not a variable in clause %qs", t, name);
4070 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
4071 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
4072 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
4074 error ("%qD appears more than once in data clauses", t);
4078 bitmap_set_bit (&generic_head, DECL_UID (t));
4081 case OMP_CLAUSE_FIRSTPRIVATE:
4082 t = OMP_CLAUSE_DECL (c);
4083 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
4085 if (processing_template_decl)
4088 error ("%qD is not a variable in clause %<firstprivate%>", t);
4090 error ("%qE is not a variable in clause %<firstprivate%>", t);
4093 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
4094 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
4096 error ("%qD appears more than once in data clauses", t);
4100 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
4103 case OMP_CLAUSE_LASTPRIVATE:
4104 t = OMP_CLAUSE_DECL (c);
4105 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
4107 if (processing_template_decl)
4110 error ("%qD is not a variable in clause %<lastprivate%>", t);
4112 error ("%qE is not a variable in clause %<lastprivate%>", t);
4115 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
4116 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
4118 error ("%qD appears more than once in data clauses", t);
4122 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
4126 t = OMP_CLAUSE_IF_EXPR (c);
4127 t = maybe_convert_cond (t);
4128 if (t == error_mark_node)
4130 else if (!processing_template_decl)
4131 t = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4132 OMP_CLAUSE_IF_EXPR (c) = t;
4135 case OMP_CLAUSE_FINAL:
4136 t = OMP_CLAUSE_FINAL_EXPR (c);
4137 t = maybe_convert_cond (t);
4138 if (t == error_mark_node)
4140 else if (!processing_template_decl)
4141 t = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4142 OMP_CLAUSE_FINAL_EXPR (c) = t;
4145 case OMP_CLAUSE_NUM_THREADS:
4146 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
4147 if (t == error_mark_node)
4149 else if (!type_dependent_expression_p (t)
4150 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
4152 error ("num_threads expression must be integral");
4157 t = mark_rvalue_use (t);
4158 if (!processing_template_decl)
4159 t = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4160 OMP_CLAUSE_NUM_THREADS_EXPR (c) = t;
4164 case OMP_CLAUSE_SCHEDULE:
4165 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
4168 else if (t == error_mark_node)
4170 else if (!type_dependent_expression_p (t)
4171 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
4173 error ("schedule chunk size expression must be integral");
4178 t = mark_rvalue_use (t);
4179 if (!processing_template_decl)
4180 t = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4181 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c) = t;
4185 case OMP_CLAUSE_NOWAIT:
4186 case OMP_CLAUSE_ORDERED:
4187 case OMP_CLAUSE_DEFAULT:
4188 case OMP_CLAUSE_UNTIED:
4189 case OMP_CLAUSE_COLLAPSE:
4190 case OMP_CLAUSE_MERGEABLE:
4198 *pc = OMP_CLAUSE_CHAIN (c);
4200 pc = &OMP_CLAUSE_CHAIN (c);
4203 for (pc = &clauses, c = clauses; c ; c = *pc)
4205 enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c);
4206 bool remove = false;
4207 bool need_complete_non_reference = false;
4208 bool need_default_ctor = false;
4209 bool need_copy_ctor = false;
4210 bool need_copy_assignment = false;
4211 bool need_implicitly_determined = false;
4212 tree type, inner_type;
4216 case OMP_CLAUSE_SHARED:
4218 need_implicitly_determined = true;
4220 case OMP_CLAUSE_PRIVATE:
4222 need_complete_non_reference = true;
4223 need_default_ctor = true;
4224 need_implicitly_determined = true;
4226 case OMP_CLAUSE_FIRSTPRIVATE:
4227 name = "firstprivate";
4228 need_complete_non_reference = true;
4229 need_copy_ctor = true;
4230 need_implicitly_determined = true;
4232 case OMP_CLAUSE_LASTPRIVATE:
4233 name = "lastprivate";
4234 need_complete_non_reference = true;
4235 need_copy_assignment = true;
4236 need_implicitly_determined = true;
4238 case OMP_CLAUSE_REDUCTION:
4240 need_implicitly_determined = true;
4242 case OMP_CLAUSE_COPYPRIVATE:
4243 name = "copyprivate";
4244 need_copy_assignment = true;
4246 case OMP_CLAUSE_COPYIN:
4248 need_copy_assignment = true;
4251 pc = &OMP_CLAUSE_CHAIN (c);
4255 t = OMP_CLAUSE_DECL (c);
4256 if (processing_template_decl
4257 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
4259 pc = &OMP_CLAUSE_CHAIN (c);
4265 case OMP_CLAUSE_LASTPRIVATE:
4266 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
4267 need_default_ctor = true;
4270 case OMP_CLAUSE_REDUCTION:
4271 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
4272 || POINTER_TYPE_P (TREE_TYPE (t)))
4274 error ("%qE has invalid type for %<reduction%>", t);
4277 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
4279 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
4289 error ("%qE has invalid type for %<reduction(%s)%>",
4290 t, operator_name_info[r_code].name);
4296 case OMP_CLAUSE_COPYIN:
4297 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
4299 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
4308 if (need_complete_non_reference || need_copy_assignment)
4310 t = require_complete_type (t);
4311 if (t == error_mark_node)
4313 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE
4314 && need_complete_non_reference)
4316 error ("%qE has reference type for %qs", t, name);
4320 if (need_implicitly_determined)
4322 const char *share_name = NULL;
4324 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
4325 share_name = "threadprivate";
4326 else switch (cxx_omp_predetermined_sharing (t))
4328 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
4330 case OMP_CLAUSE_DEFAULT_SHARED:
4331 /* const vars may be specified in firstprivate clause. */
4332 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_FIRSTPRIVATE
4333 && cxx_omp_const_qual_no_mutable (t))
4335 share_name = "shared";
4337 case OMP_CLAUSE_DEFAULT_PRIVATE:
4338 share_name = "private";
4345 error ("%qE is predetermined %qs for %qs",
4346 t, share_name, name);
4351 /* We're interested in the base element, not arrays. */
4352 inner_type = type = TREE_TYPE (t);
4353 while (TREE_CODE (inner_type) == ARRAY_TYPE)
4354 inner_type = TREE_TYPE (inner_type);
4356 /* Check for special function availability by building a call to one.
4357 Save the results, because later we won't be in the right context
4358 for making these queries. */
4359 if (CLASS_TYPE_P (inner_type)
4360 && COMPLETE_TYPE_P (inner_type)
4361 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
4362 && !type_dependent_expression_p (t)
4363 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
4364 need_copy_ctor, need_copy_assignment))
4368 *pc = OMP_CLAUSE_CHAIN (c);
4370 pc = &OMP_CLAUSE_CHAIN (c);
4373 bitmap_obstack_release (NULL);
4377 /* For all variables in the tree_list VARS, mark them as thread local. */
4380 finish_omp_threadprivate (tree vars)
4384 /* Mark every variable in VARS to be assigned thread local storage. */
4385 for (t = vars; t; t = TREE_CHAIN (t))
4387 tree v = TREE_PURPOSE (t);
4389 if (error_operand_p (v))
4391 else if (TREE_CODE (v) != VAR_DECL)
4392 error ("%<threadprivate%> %qD is not file, namespace "
4393 "or block scope variable", v);
4394 /* If V had already been marked threadprivate, it doesn't matter
4395 whether it had been used prior to this point. */
4396 else if (TREE_USED (v)
4397 && (DECL_LANG_SPECIFIC (v) == NULL
4398 || !CP_DECL_THREADPRIVATE_P (v)))
4399 error ("%qE declared %<threadprivate%> after first use", v);
4400 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
4401 error ("automatic variable %qE cannot be %<threadprivate%>", v);
4402 else if (! COMPLETE_TYPE_P (complete_type (TREE_TYPE (v))))
4403 error ("%<threadprivate%> %qE has incomplete type", v);
4404 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
4405 && CP_DECL_CONTEXT (v) != current_class_type)
4406 error ("%<threadprivate%> %qE directive not "
4407 "in %qT definition", v, CP_DECL_CONTEXT (v));
4410 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4411 if (DECL_LANG_SPECIFIC (v) == NULL)
4413 retrofit_lang_decl (v);
4415 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4416 after the allocation of the lang_decl structure. */
4417 if (DECL_DISCRIMINATOR_P (v))
4418 DECL_LANG_SPECIFIC (v)->u.base.u2sel = 1;
4421 if (! DECL_THREAD_LOCAL_P (v))
4423 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
4424 /* If rtl has been already set for this var, call
4425 make_decl_rtl once again, so that encode_section_info
4426 has a chance to look at the new decl flags. */
4427 if (DECL_RTL_SET_P (v))
4430 CP_DECL_THREADPRIVATE_P (v) = 1;
4435 /* Build an OpenMP structured block. */
4438 begin_omp_structured_block (void)
4440 return do_pushlevel (sk_omp);
4444 finish_omp_structured_block (tree block)
4446 return do_poplevel (block);
4449 /* Similarly, except force the retention of the BLOCK. */
4452 begin_omp_parallel (void)
4454 keep_next_level (true);
4455 return begin_omp_structured_block ();
4459 finish_omp_parallel (tree clauses, tree body)
4463 body = finish_omp_structured_block (body);
4465 stmt = make_node (OMP_PARALLEL);
4466 TREE_TYPE (stmt) = void_type_node;
4467 OMP_PARALLEL_CLAUSES (stmt) = clauses;
4468 OMP_PARALLEL_BODY (stmt) = body;
4470 return add_stmt (stmt);
4474 begin_omp_task (void)
4476 keep_next_level (true);
4477 return begin_omp_structured_block ();
4481 finish_omp_task (tree clauses, tree body)
4485 body = finish_omp_structured_block (body);
4487 stmt = make_node (OMP_TASK);
4488 TREE_TYPE (stmt) = void_type_node;
4489 OMP_TASK_CLAUSES (stmt) = clauses;
4490 OMP_TASK_BODY (stmt) = body;
4492 return add_stmt (stmt);
4495 /* Helper function for finish_omp_for. Convert Ith random access iterator
4496 into integral iterator. Return FALSE if successful. */
4499 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
4500 tree condv, tree incrv, tree *body,
4501 tree *pre_body, tree clauses)
4503 tree diff, iter_init, iter_incr = NULL, last;
4504 tree incr_var = NULL, orig_pre_body, orig_body, c;
4505 tree decl = TREE_VEC_ELT (declv, i);
4506 tree init = TREE_VEC_ELT (initv, i);
4507 tree cond = TREE_VEC_ELT (condv, i);
4508 tree incr = TREE_VEC_ELT (incrv, i);
4510 location_t elocus = locus;
4512 if (init && EXPR_HAS_LOCATION (init))
4513 elocus = EXPR_LOCATION (init);
4515 switch (TREE_CODE (cond))
4521 if (TREE_OPERAND (cond, 1) == iter)
4522 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
4523 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
4524 if (TREE_OPERAND (cond, 0) != iter)
4525 cond = error_mark_node;
4528 tree tem = build_x_binary_op (EXPR_LOCATION (cond),
4531 TREE_OPERAND (cond, 1), ERROR_MARK,
4532 NULL, tf_warning_or_error);
4533 if (error_operand_p (tem))
4538 cond = error_mark_node;
4541 if (cond == error_mark_node)
4543 error_at (elocus, "invalid controlling predicate");
4546 diff = build_x_binary_op (elocus, MINUS_EXPR, TREE_OPERAND (cond, 1),
4547 ERROR_MARK, iter, ERROR_MARK, NULL,
4548 tf_warning_or_error);
4549 if (error_operand_p (diff))
4551 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
4553 error_at (elocus, "difference between %qE and %qD does not have integer type",
4554 TREE_OPERAND (cond, 1), iter);
4558 switch (TREE_CODE (incr))
4560 case PREINCREMENT_EXPR:
4561 case PREDECREMENT_EXPR:
4562 case POSTINCREMENT_EXPR:
4563 case POSTDECREMENT_EXPR:
4564 if (TREE_OPERAND (incr, 0) != iter)
4566 incr = error_mark_node;
4569 iter_incr = build_x_unary_op (EXPR_LOCATION (incr),
4570 TREE_CODE (incr), iter,
4571 tf_warning_or_error);
4572 if (error_operand_p (iter_incr))
4574 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
4575 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4576 incr = integer_one_node;
4578 incr = integer_minus_one_node;
4581 if (TREE_OPERAND (incr, 0) != iter)
4582 incr = error_mark_node;
4583 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4584 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4586 tree rhs = TREE_OPERAND (incr, 1);
4587 if (TREE_OPERAND (rhs, 0) == iter)
4589 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4591 incr = error_mark_node;
4594 iter_incr = build_x_modify_expr (EXPR_LOCATION (rhs),
4595 iter, TREE_CODE (rhs),
4596 TREE_OPERAND (rhs, 1),
4597 tf_warning_or_error);
4598 if (error_operand_p (iter_incr))
4600 incr = TREE_OPERAND (rhs, 1);
4601 incr = cp_convert (TREE_TYPE (diff), incr,
4602 tf_warning_or_error);
4603 if (TREE_CODE (rhs) == MINUS_EXPR)
4605 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4606 incr = fold_if_not_in_template (incr);
4608 if (TREE_CODE (incr) != INTEGER_CST
4609 && (TREE_CODE (incr) != NOP_EXPR
4610 || (TREE_CODE (TREE_OPERAND (incr, 0))
4615 else if (TREE_OPERAND (rhs, 1) == iter)
4617 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4618 || TREE_CODE (rhs) != PLUS_EXPR)
4619 incr = error_mark_node;
4622 iter_incr = build_x_binary_op (EXPR_LOCATION (rhs),
4624 TREE_OPERAND (rhs, 0),
4627 tf_warning_or_error);
4628 if (error_operand_p (iter_incr))
4630 iter_incr = build_x_modify_expr (EXPR_LOCATION (rhs),
4633 tf_warning_or_error);
4634 if (error_operand_p (iter_incr))
4636 incr = TREE_OPERAND (rhs, 0);
4641 incr = error_mark_node;
4644 incr = error_mark_node;
4647 incr = error_mark_node;
4651 if (incr == error_mark_node)
4653 error_at (elocus, "invalid increment expression");
4657 incr = cp_convert (TREE_TYPE (diff), incr, tf_warning_or_error);
4658 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4659 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4660 && OMP_CLAUSE_DECL (c) == iter)
4663 decl = create_temporary_var (TREE_TYPE (diff));
4665 add_decl_expr (decl);
4666 last = create_temporary_var (TREE_TYPE (diff));
4668 add_decl_expr (last);
4669 if (c && iter_incr == NULL)
4671 incr_var = create_temporary_var (TREE_TYPE (diff));
4672 pushdecl (incr_var);
4673 add_decl_expr (incr_var);
4675 gcc_assert (stmts_are_full_exprs_p ());
4677 orig_pre_body = *pre_body;
4678 *pre_body = push_stmt_list ();
4680 add_stmt (orig_pre_body);
4682 finish_expr_stmt (build_x_modify_expr (elocus,
4683 iter, NOP_EXPR, init,
4684 tf_warning_or_error));
4685 init = build_int_cst (TREE_TYPE (diff), 0);
4686 if (c && iter_incr == NULL)
4688 finish_expr_stmt (build_x_modify_expr (elocus,
4690 incr, tf_warning_or_error));
4692 iter_incr = build_x_modify_expr (elocus,
4693 iter, PLUS_EXPR, incr,
4694 tf_warning_or_error);
4696 finish_expr_stmt (build_x_modify_expr (elocus,
4697 last, NOP_EXPR, init,
4698 tf_warning_or_error));
4699 *pre_body = pop_stmt_list (*pre_body);
4701 cond = cp_build_binary_op (elocus,
4702 TREE_CODE (cond), decl, diff,
4703 tf_warning_or_error);
4704 incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR,
4705 elocus, incr, NULL_TREE);
4708 *body = push_stmt_list ();
4709 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4710 iter_init = build_x_modify_expr (elocus,
4711 iter, PLUS_EXPR, iter_init,
4712 tf_warning_or_error);
4713 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4714 finish_expr_stmt (iter_init);
4715 finish_expr_stmt (build_x_modify_expr (elocus,
4716 last, NOP_EXPR, decl,
4717 tf_warning_or_error));
4718 add_stmt (orig_body);
4719 *body = pop_stmt_list (*body);
4723 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4724 finish_expr_stmt (iter_incr);
4725 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4726 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4729 TREE_VEC_ELT (declv, i) = decl;
4730 TREE_VEC_ELT (initv, i) = init;
4731 TREE_VEC_ELT (condv, i) = cond;
4732 TREE_VEC_ELT (incrv, i) = incr;
4737 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4738 are directly for their associated operands in the statement. DECL
4739 and INIT are a combo; if DECL is NULL then INIT ought to be a
4740 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4741 optional statements that need to go before the loop into its
4745 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4746 tree incrv, tree body, tree pre_body, tree clauses)
4748 tree omp_for = NULL, orig_incr = NULL;
4749 tree decl, init, cond, incr;
4753 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4754 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4755 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4756 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4758 decl = TREE_VEC_ELT (declv, i);
4759 init = TREE_VEC_ELT (initv, i);
4760 cond = TREE_VEC_ELT (condv, i);
4761 incr = TREE_VEC_ELT (incrv, i);
4767 switch (TREE_CODE (init))
4770 decl = TREE_OPERAND (init, 0);
4771 init = TREE_OPERAND (init, 1);
4774 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4776 decl = TREE_OPERAND (init, 0);
4777 init = TREE_OPERAND (init, 2);
4787 "expected iteration declaration or initialization");
4792 if (init && EXPR_HAS_LOCATION (init))
4793 elocus = EXPR_LOCATION (init);
4797 error_at (elocus, "missing controlling predicate");
4803 error_at (elocus, "missing increment expression");
4807 TREE_VEC_ELT (declv, i) = decl;
4808 TREE_VEC_ELT (initv, i) = init;
4811 if (dependent_omp_for_p (declv, initv, condv, incrv))
4815 stmt = make_node (OMP_FOR);
4817 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4819 /* This is really just a place-holder. We'll be decomposing this
4820 again and going through the cp_build_modify_expr path below when
4821 we instantiate the thing. */
4822 TREE_VEC_ELT (initv, i)
4823 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4824 TREE_VEC_ELT (initv, i));
4827 TREE_TYPE (stmt) = void_type_node;
4828 OMP_FOR_INIT (stmt) = initv;
4829 OMP_FOR_COND (stmt) = condv;
4830 OMP_FOR_INCR (stmt) = incrv;
4831 OMP_FOR_BODY (stmt) = body;
4832 OMP_FOR_PRE_BODY (stmt) = pre_body;
4833 OMP_FOR_CLAUSES (stmt) = clauses;
4835 SET_EXPR_LOCATION (stmt, locus);
4836 return add_stmt (stmt);
4839 if (processing_template_decl)
4840 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4842 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4844 decl = TREE_VEC_ELT (declv, i);
4845 init = TREE_VEC_ELT (initv, i);
4846 cond = TREE_VEC_ELT (condv, i);
4847 incr = TREE_VEC_ELT (incrv, i);
4849 TREE_VEC_ELT (orig_incr, i) = incr;
4852 if (init && EXPR_HAS_LOCATION (init))
4853 elocus = EXPR_LOCATION (init);
4857 error_at (elocus, "expected iteration declaration or initialization");
4861 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4864 TREE_VEC_ELT (orig_incr, i) = incr;
4865 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4866 TREE_CODE (TREE_OPERAND (incr, 1)),
4867 TREE_OPERAND (incr, 2),
4868 tf_warning_or_error);
4871 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4873 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4874 incrv, &body, &pre_body, clauses))
4879 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4880 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4882 error_at (elocus, "invalid type for iteration variable %qE", decl);
4886 if (!processing_template_decl)
4888 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4889 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4892 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4894 && TREE_SIDE_EFFECTS (cond)
4895 && COMPARISON_CLASS_P (cond)
4896 && !processing_template_decl)
4898 tree t = TREE_OPERAND (cond, 0);
4899 if (TREE_SIDE_EFFECTS (t)
4901 && (TREE_CODE (t) != NOP_EXPR
4902 || TREE_OPERAND (t, 0) != decl))
4903 TREE_OPERAND (cond, 0)
4904 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4906 t = TREE_OPERAND (cond, 1);
4907 if (TREE_SIDE_EFFECTS (t)
4909 && (TREE_CODE (t) != NOP_EXPR
4910 || TREE_OPERAND (t, 0) != decl))
4911 TREE_OPERAND (cond, 1)
4912 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4914 if (decl == error_mark_node || init == error_mark_node)
4917 TREE_VEC_ELT (declv, i) = decl;
4918 TREE_VEC_ELT (initv, i) = init;
4919 TREE_VEC_ELT (condv, i) = cond;
4920 TREE_VEC_ELT (incrv, i) = incr;
4924 if (IS_EMPTY_STMT (pre_body))
4927 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4930 if (omp_for == NULL)
4933 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4935 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4936 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4938 if (TREE_CODE (incr) != MODIFY_EXPR)
4941 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4942 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4943 && !processing_template_decl)
4945 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4946 if (TREE_SIDE_EFFECTS (t)
4948 && (TREE_CODE (t) != NOP_EXPR
4949 || TREE_OPERAND (t, 0) != decl))
4950 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4951 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4953 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4954 if (TREE_SIDE_EFFECTS (t)
4956 && (TREE_CODE (t) != NOP_EXPR
4957 || TREE_OPERAND (t, 0) != decl))
4958 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4959 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4963 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4965 if (omp_for != NULL)
4966 OMP_FOR_CLAUSES (omp_for) = clauses;
4971 finish_omp_atomic (enum tree_code code, enum tree_code opcode, tree lhs,
4972 tree rhs, tree v, tree lhs1, tree rhs1)
4987 dependent_p = false;
4990 /* Even in a template, we can detect invalid uses of the atomic
4991 pragma if neither LHS nor RHS is type-dependent. */
4992 if (processing_template_decl)
4994 dependent_p = (type_dependent_expression_p (lhs)
4995 || (rhs && type_dependent_expression_p (rhs))
4996 || (v && type_dependent_expression_p (v))
4997 || (lhs1 && type_dependent_expression_p (lhs1))
4998 || (rhs1 && type_dependent_expression_p (rhs1)));
5001 lhs = build_non_dependent_expr (lhs);
5003 rhs = build_non_dependent_expr (rhs);
5005 v = build_non_dependent_expr (v);
5007 lhs1 = build_non_dependent_expr (lhs1);
5009 rhs1 = build_non_dependent_expr (rhs1);
5014 stmt = c_finish_omp_atomic (input_location, code, opcode, lhs, rhs,
5016 if (stmt == error_mark_node)
5019 if (processing_template_decl)
5021 if (code == OMP_ATOMIC_READ)
5023 stmt = build_min_nt_loc (EXPR_LOCATION (orig_lhs),
5024 OMP_ATOMIC_READ, orig_lhs);
5025 stmt = build2 (MODIFY_EXPR, void_type_node, orig_v, stmt);
5029 if (opcode == NOP_EXPR)
5030 stmt = build2 (MODIFY_EXPR, void_type_node, orig_lhs, orig_rhs);
5032 stmt = build2 (opcode, void_type_node, orig_lhs, orig_rhs);
5034 stmt = build_min_nt_loc (EXPR_LOCATION (orig_rhs1),
5035 COMPOUND_EXPR, orig_rhs1, stmt);
5036 if (code != OMP_ATOMIC)
5038 stmt = build_min_nt_loc (EXPR_LOCATION (orig_lhs1),
5039 code, orig_lhs1, stmt);
5040 stmt = build2 (MODIFY_EXPR, void_type_node, orig_v, stmt);
5043 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node, stmt);
5049 finish_omp_barrier (void)
5051 tree fn = builtin_decl_explicit (BUILT_IN_GOMP_BARRIER);
5052 vec<tree, va_gc> *vec = make_tree_vector ();
5053 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
5054 release_tree_vector (vec);
5055 finish_expr_stmt (stmt);
5059 finish_omp_flush (void)
5061 tree fn = builtin_decl_explicit (BUILT_IN_SYNC_SYNCHRONIZE);
5062 vec<tree, va_gc> *vec = make_tree_vector ();
5063 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
5064 release_tree_vector (vec);
5065 finish_expr_stmt (stmt);
5069 finish_omp_taskwait (void)
5071 tree fn = builtin_decl_explicit (BUILT_IN_GOMP_TASKWAIT);
5072 vec<tree, va_gc> *vec = make_tree_vector ();
5073 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
5074 release_tree_vector (vec);
5075 finish_expr_stmt (stmt);
5079 finish_omp_taskyield (void)
5081 tree fn = builtin_decl_explicit (BUILT_IN_GOMP_TASKYIELD);
5082 vec<tree, va_gc> *vec = make_tree_vector ();
5083 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
5084 release_tree_vector (vec);
5085 finish_expr_stmt (stmt);
5088 /* Begin a __transaction_atomic or __transaction_relaxed statement.
5089 If PCOMPOUND is non-null, this is for a function-transaction-block, and we
5090 should create an extra compound stmt. */
5093 begin_transaction_stmt (location_t loc, tree *pcompound, int flags)
5098 *pcompound = begin_compound_stmt (0);
5100 r = build_stmt (loc, TRANSACTION_EXPR, NULL_TREE);
5102 /* Only add the statement to the function if support enabled. */
5106 error_at (loc, ((flags & TM_STMT_ATTR_RELAXED) != 0
5107 ? G_("%<__transaction_relaxed%> without "
5108 "transactional memory support enabled")
5109 : G_("%<__transaction_atomic%> without "
5110 "transactional memory support enabled")));
5112 TRANSACTION_EXPR_BODY (r) = push_stmt_list ();
5113 TREE_SIDE_EFFECTS (r) = 1;
5117 /* End a __transaction_atomic or __transaction_relaxed statement.
5118 If COMPOUND_STMT is non-null, this is for a function-transaction-block,
5119 and we should end the compound. If NOEX is non-NULL, we wrap the body in
5120 a MUST_NOT_THROW_EXPR with NOEX as condition. */
5123 finish_transaction_stmt (tree stmt, tree compound_stmt, int flags, tree noex)
5125 TRANSACTION_EXPR_BODY (stmt) = pop_stmt_list (TRANSACTION_EXPR_BODY (stmt));
5126 TRANSACTION_EXPR_OUTER (stmt) = (flags & TM_STMT_ATTR_OUTER) != 0;
5127 TRANSACTION_EXPR_RELAXED (stmt) = (flags & TM_STMT_ATTR_RELAXED) != 0;
5128 TRANSACTION_EXPR_IS_STMT (stmt) = 1;
5130 /* noexcept specifications are not allowed for function transactions. */
5131 gcc_assert (!(noex && compound_stmt));
5134 tree body = build_must_not_throw_expr (TRANSACTION_EXPR_BODY (stmt),
5136 SET_EXPR_LOCATION (body, EXPR_LOCATION (TRANSACTION_EXPR_BODY (stmt)));
5137 TREE_SIDE_EFFECTS (body) = 1;
5138 TRANSACTION_EXPR_BODY (stmt) = body;
5142 finish_compound_stmt (compound_stmt);
5146 /* Build a __transaction_atomic or __transaction_relaxed expression. If
5147 NOEX is non-NULL, we wrap the body in a MUST_NOT_THROW_EXPR with NOEX as
5151 build_transaction_expr (location_t loc, tree expr, int flags, tree noex)
5156 expr = build_must_not_throw_expr (expr, noex);
5157 SET_EXPR_LOCATION (expr, loc);
5158 TREE_SIDE_EFFECTS (expr) = 1;
5160 ret = build1 (TRANSACTION_EXPR, TREE_TYPE (expr), expr);
5161 if (flags & TM_STMT_ATTR_RELAXED)
5162 TRANSACTION_EXPR_RELAXED (ret) = 1;
5163 TREE_SIDE_EFFECTS (ret) = 1;
5164 SET_EXPR_LOCATION (ret, loc);
5169 init_cp_semantics (void)
5173 /* Build a STATIC_ASSERT for a static assertion with the condition
5174 CONDITION and the message text MESSAGE. LOCATION is the location
5175 of the static assertion in the source code. When MEMBER_P, this
5176 static assertion is a member of a class. */
5178 finish_static_assert (tree condition, tree message, location_t location,
5181 if (message == NULL_TREE
5182 || message == error_mark_node
5183 || condition == NULL_TREE
5184 || condition == error_mark_node)
5187 if (check_for_bare_parameter_packs (condition))
5188 condition = error_mark_node;
5190 if (type_dependent_expression_p (condition)
5191 || value_dependent_expression_p (condition))
5193 /* We're in a template; build a STATIC_ASSERT and put it in
5197 assertion = make_node (STATIC_ASSERT);
5198 STATIC_ASSERT_CONDITION (assertion) = condition;
5199 STATIC_ASSERT_MESSAGE (assertion) = message;
5200 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
5203 maybe_add_class_template_decl_list (current_class_type,
5207 add_stmt (assertion);
5212 /* Fold the expression and convert it to a boolean value. */
5213 condition = fold_non_dependent_expr (condition);
5214 condition = cp_convert (boolean_type_node, condition, tf_warning_or_error);
5215 condition = maybe_constant_value (condition);
5217 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
5218 /* Do nothing; the condition is satisfied. */
5222 location_t saved_loc = input_location;
5224 input_location = location;
5225 if (TREE_CODE (condition) == INTEGER_CST
5226 && integer_zerop (condition))
5227 /* Report the error. */
5228 error ("static assertion failed: %s", TREE_STRING_POINTER (message));
5229 else if (condition && condition != error_mark_node)
5231 error ("non-constant condition for static assertion");
5232 cxx_constant_value (condition);
5234 input_location = saved_loc;
5238 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
5239 suitable for use as a type-specifier.
5241 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
5242 id-expression or a class member access, FALSE when it was parsed as
5243 a full expression. */
5246 finish_decltype_type (tree expr, bool id_expression_or_member_access_p,
5247 tsubst_flags_t complain)
5249 tree type = NULL_TREE;
5251 if (!expr || error_operand_p (expr))
5252 return error_mark_node;
5255 || TREE_CODE (expr) == TYPE_DECL
5256 || (TREE_CODE (expr) == BIT_NOT_EXPR
5257 && TYPE_P (TREE_OPERAND (expr, 0))))
5259 if (complain & tf_error)
5260 error ("argument to decltype must be an expression");
5261 return error_mark_node;
5264 /* Depending on the resolution of DR 1172, we may later need to distinguish
5265 instantiation-dependent but not type-dependent expressions so that, say,
5266 A<decltype(sizeof(T))>::U doesn't require 'typename'. */
5267 if (instantiation_dependent_expression_p (expr))
5269 type = cxx_make_type (DECLTYPE_TYPE);
5270 DECLTYPE_TYPE_EXPR (type) = expr;
5271 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
5272 = id_expression_or_member_access_p;
5273 SET_TYPE_STRUCTURAL_EQUALITY (type);
5278 /* The type denoted by decltype(e) is defined as follows: */
5280 expr = resolve_nondeduced_context (expr);
5282 if (invalid_nonstatic_memfn_p (expr, complain))
5283 return error_mark_node;
5285 if (type_unknown_p (expr))
5287 if (complain & tf_error)
5288 error ("decltype cannot resolve address of overloaded function");
5289 return error_mark_node;
5292 /* To get the size of a static data member declared as an array of
5293 unknown bound, we need to instantiate it. */
5294 if (TREE_CODE (expr) == VAR_DECL
5295 && VAR_HAD_UNKNOWN_BOUND (expr)
5296 && DECL_TEMPLATE_INSTANTIATION (expr))
5297 instantiate_decl (expr, /*defer_ok*/true, /*expl_inst_mem*/false);
5299 if (id_expression_or_member_access_p)
5301 /* If e is an id-expression or a class member access (5.2.5
5302 [expr.ref]), decltype(e) is defined as the type of the entity
5303 named by e. If there is no such entity, or e names a set of
5304 overloaded functions, the program is ill-formed. */
5305 if (identifier_p (expr))
5306 expr = lookup_name (expr);
5308 if (INDIRECT_REF_P (expr))
5309 /* This can happen when the expression is, e.g., "a.b". Just
5310 look at the underlying operand. */
5311 expr = TREE_OPERAND (expr, 0);
5313 if (TREE_CODE (expr) == OFFSET_REF
5314 || TREE_CODE (expr) == MEMBER_REF
5315 || TREE_CODE (expr) == SCOPE_REF)
5316 /* We're only interested in the field itself. If it is a
5317 BASELINK, we will need to see through it in the next
5319 expr = TREE_OPERAND (expr, 1);
5321 if (BASELINK_P (expr))
5322 /* See through BASELINK nodes to the underlying function. */
5323 expr = BASELINK_FUNCTIONS (expr);
5325 switch (TREE_CODE (expr))
5328 if (DECL_BIT_FIELD_TYPE (expr))
5330 type = DECL_BIT_FIELD_TYPE (expr);
5333 /* Fall through for fields that aren't bitfields. */
5340 case TEMPLATE_PARM_INDEX:
5341 expr = mark_type_use (expr);
5342 type = TREE_TYPE (expr);
5346 type = error_mark_node;
5350 mark_type_use (expr);
5351 type = is_bitfield_expr_with_lowered_type (expr);
5353 type = TREE_TYPE (TREE_OPERAND (expr, 1));
5361 /* We can get here when the id-expression refers to an
5362 enumerator or non-type template parameter. */
5363 type = TREE_TYPE (expr);
5368 return error_mark_node;
5373 /* Within a lambda-expression:
5375 Every occurrence of decltype((x)) where x is a possibly
5376 parenthesized id-expression that names an entity of
5377 automatic storage duration is treated as if x were
5378 transformed into an access to a corresponding data member
5379 of the closure type that would have been declared if x
5380 were a use of the denoted entity. */
5381 if (outer_automatic_var_p (expr)
5382 && current_function_decl
5383 && LAMBDA_FUNCTION_P (current_function_decl))
5384 type = capture_decltype (expr);
5385 else if (error_operand_p (expr))
5386 type = error_mark_node;
5387 else if (expr == current_class_ptr)
5388 /* If the expression is just "this", we want the
5389 cv-unqualified pointer for the "this" type. */
5390 type = TYPE_MAIN_VARIANT (TREE_TYPE (expr));
5393 /* Otherwise, where T is the type of e, if e is an lvalue,
5394 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
5395 cp_lvalue_kind clk = lvalue_kind (expr);
5396 type = unlowered_expr_type (expr);
5397 gcc_assert (TREE_CODE (type) != REFERENCE_TYPE);
5399 /* For vector types, pick a non-opaque variant. */
5400 if (TREE_CODE (type) == VECTOR_TYPE)
5401 type = strip_typedefs (type);
5403 if (clk != clk_none && !(clk & clk_class))
5404 type = cp_build_reference_type (type, (clk & clk_rvalueref));
5411 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
5412 __has_nothrow_copy, depending on assign_p. */
5415 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
5422 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
5425 fns = (*CLASSTYPE_METHOD_VEC (type))[ix];
5427 else if (TYPE_HAS_COPY_CTOR (type))
5429 /* If construction of the copy constructor was postponed, create
5431 if (CLASSTYPE_LAZY_COPY_CTOR (type))
5432 lazily_declare_fn (sfk_copy_constructor, type);
5433 if (CLASSTYPE_LAZY_MOVE_CTOR (type))
5434 lazily_declare_fn (sfk_move_constructor, type);
5435 fns = CLASSTYPE_CONSTRUCTORS (type);
5440 for (; fns; fns = OVL_NEXT (fns))
5442 tree fn = OVL_CURRENT (fns);
5446 if (copy_fn_p (fn) == 0)
5449 else if (copy_fn_p (fn) <= 0)
5452 maybe_instantiate_noexcept (fn);
5453 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
5460 /* Actually evaluates the trait. */
5463 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
5465 enum tree_code type_code1;
5468 type_code1 = TREE_CODE (type1);
5472 case CPTK_HAS_NOTHROW_ASSIGN:
5473 type1 = strip_array_types (type1);
5474 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5475 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
5476 || (CLASS_TYPE_P (type1)
5477 && classtype_has_nothrow_assign_or_copy_p (type1,
5480 case CPTK_HAS_TRIVIAL_ASSIGN:
5481 /* ??? The standard seems to be missing the "or array of such a class
5482 type" wording for this trait. */
5483 type1 = strip_array_types (type1);
5484 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5485 && (trivial_type_p (type1)
5486 || (CLASS_TYPE_P (type1)
5487 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1))));
5489 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5490 type1 = strip_array_types (type1);
5491 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
5492 || (CLASS_TYPE_P (type1)
5493 && (t = locate_ctor (type1))
5494 && (maybe_instantiate_noexcept (t),
5495 TYPE_NOTHROW_P (TREE_TYPE (t)))));
5497 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5498 type1 = strip_array_types (type1);
5499 return (trivial_type_p (type1)
5500 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
5502 case CPTK_HAS_NOTHROW_COPY:
5503 type1 = strip_array_types (type1);
5504 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
5505 || (CLASS_TYPE_P (type1)
5506 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
5508 case CPTK_HAS_TRIVIAL_COPY:
5509 /* ??? The standard seems to be missing the "or array of such a class
5510 type" wording for this trait. */
5511 type1 = strip_array_types (type1);
5512 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5513 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1)));
5515 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5516 type1 = strip_array_types (type1);
5517 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5518 || (CLASS_TYPE_P (type1)
5519 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
5521 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5522 return type_has_virtual_destructor (type1);
5524 case CPTK_IS_ABSTRACT:
5525 return (ABSTRACT_CLASS_TYPE_P (type1));
5527 case CPTK_IS_BASE_OF:
5528 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5529 && DERIVED_FROM_P (type1, type2));
5532 return (NON_UNION_CLASS_TYPE_P (type1));
5534 case CPTK_IS_CONVERTIBLE_TO:
5539 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
5542 return (type_code1 == ENUMERAL_TYPE);
5545 return (CLASS_TYPE_P (type1) && CLASSTYPE_FINAL (type1));
5547 case CPTK_IS_LITERAL_TYPE:
5548 return (literal_type_p (type1));
5551 return (pod_type_p (type1));
5553 case CPTK_IS_POLYMORPHIC:
5554 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
5556 case CPTK_IS_STD_LAYOUT:
5557 return (std_layout_type_p (type1));
5559 case CPTK_IS_TRIVIAL:
5560 return (trivial_type_p (type1));
5563 return (type_code1 == UNION_TYPE);
5571 /* If TYPE is an array of unknown bound, or (possibly cv-qualified)
5572 void, or a complete type, returns it, otherwise NULL_TREE. */
5575 check_trait_type (tree type)
5577 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type)
5578 && COMPLETE_TYPE_P (TREE_TYPE (type)))
5581 if (VOID_TYPE_P (type))
5584 return complete_type_or_else (strip_array_types (type), NULL_TREE);
5587 /* Process a trait expression. */
5590 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
5592 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
5593 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
5594 || kind == CPTK_HAS_NOTHROW_COPY
5595 || kind == CPTK_HAS_TRIVIAL_ASSIGN
5596 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
5597 || kind == CPTK_HAS_TRIVIAL_COPY
5598 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
5599 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
5600 || kind == CPTK_IS_ABSTRACT
5601 || kind == CPTK_IS_BASE_OF
5602 || kind == CPTK_IS_CLASS
5603 || kind == CPTK_IS_CONVERTIBLE_TO
5604 || kind == CPTK_IS_EMPTY
5605 || kind == CPTK_IS_ENUM
5606 || kind == CPTK_IS_FINAL
5607 || kind == CPTK_IS_LITERAL_TYPE
5608 || kind == CPTK_IS_POD
5609 || kind == CPTK_IS_POLYMORPHIC
5610 || kind == CPTK_IS_STD_LAYOUT
5611 || kind == CPTK_IS_TRIVIAL
5612 || kind == CPTK_IS_UNION);
5614 if (kind == CPTK_IS_CONVERTIBLE_TO)
5616 sorry ("__is_convertible_to");
5617 return error_mark_node;
5620 if (type1 == error_mark_node
5621 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
5622 && type2 == error_mark_node))
5623 return error_mark_node;
5625 if (processing_template_decl)
5627 tree trait_expr = make_node (TRAIT_EXPR);
5628 TREE_TYPE (trait_expr) = boolean_type_node;
5629 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
5630 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
5631 TRAIT_EXPR_KIND (trait_expr) = kind;
5637 case CPTK_HAS_NOTHROW_ASSIGN:
5638 case CPTK_HAS_TRIVIAL_ASSIGN:
5639 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5640 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5641 case CPTK_HAS_NOTHROW_COPY:
5642 case CPTK_HAS_TRIVIAL_COPY:
5643 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5644 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5645 case CPTK_IS_ABSTRACT:
5648 case CPTK_IS_LITERAL_TYPE:
5650 case CPTK_IS_POLYMORPHIC:
5651 case CPTK_IS_STD_LAYOUT:
5652 case CPTK_IS_TRIVIAL:
5653 if (!check_trait_type (type1))
5654 return error_mark_node;
5657 case CPTK_IS_BASE_OF:
5658 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5659 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5660 && !complete_type_or_else (type2, NULL_TREE))
5661 /* We already issued an error. */
5662 return error_mark_node;
5670 case CPTK_IS_CONVERTIBLE_TO:
5675 return (trait_expr_value (kind, type1, type2)
5676 ? boolean_true_node : boolean_false_node);
5679 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5680 which is ignored for C++. */
5683 set_float_const_decimal64 (void)
5688 clear_float_const_decimal64 (void)
5693 float_const_decimal64_p (void)
5699 /* Return true if T is a literal type. */
5702 literal_type_p (tree t)
5704 if (SCALAR_TYPE_P (t)
5705 || TREE_CODE (t) == VECTOR_TYPE
5706 || TREE_CODE (t) == REFERENCE_TYPE)
5708 if (CLASS_TYPE_P (t))
5710 t = complete_type (t);
5711 gcc_assert (COMPLETE_TYPE_P (t) || errorcount);
5712 return CLASSTYPE_LITERAL_P (t);
5714 if (TREE_CODE (t) == ARRAY_TYPE)
5715 return literal_type_p (strip_array_types (t));
5719 /* If DECL is a variable declared `constexpr', require its type
5720 be literal. Return the DECL if OK, otherwise NULL. */
5723 ensure_literal_type_for_constexpr_object (tree decl)
5725 tree type = TREE_TYPE (decl);
5726 if (TREE_CODE (decl) == VAR_DECL && DECL_DECLARED_CONSTEXPR_P (decl)
5727 && !processing_template_decl)
5729 if (CLASS_TYPE_P (type) && !COMPLETE_TYPE_P (complete_type (type)))
5730 /* Don't complain here, we'll complain about incompleteness
5731 when we try to initialize the variable. */;
5732 else if (!literal_type_p (type))
5734 error ("the type %qT of constexpr variable %qD is not literal",
5736 explain_non_literal_class (type);
5743 /* Representation of entries in the constexpr function definition table. */
5745 typedef struct GTY(()) constexpr_fundef {
5750 /* This table holds all constexpr function definitions seen in
5751 the current translation unit. */
5753 static GTY ((param_is (constexpr_fundef))) htab_t constexpr_fundef_table;
5755 /* Utility function used for managing the constexpr function table.
5756 Return true if the entries pointed to by P and Q are for the
5757 same constexpr function. */
5760 constexpr_fundef_equal (const void *p, const void *q)
5762 const constexpr_fundef *lhs = (const constexpr_fundef *) p;
5763 const constexpr_fundef *rhs = (const constexpr_fundef *) q;
5764 return lhs->decl == rhs->decl;
5767 /* Utility function used for managing the constexpr function table.
5768 Return a hash value for the entry pointed to by Q. */
5770 static inline hashval_t
5771 constexpr_fundef_hash (const void *p)
5773 const constexpr_fundef *fundef = (const constexpr_fundef *) p;
5774 return DECL_UID (fundef->decl);
5777 /* Return a previously saved definition of function FUN. */
5779 static constexpr_fundef *
5780 retrieve_constexpr_fundef (tree fun)
5782 constexpr_fundef fundef = { NULL, NULL };
5783 if (constexpr_fundef_table == NULL)
5787 return (constexpr_fundef *) htab_find (constexpr_fundef_table, &fundef);
5790 /* Check whether the parameter and return types of FUN are valid for a
5791 constexpr function, and complain if COMPLAIN. */
5794 is_valid_constexpr_fn (tree fun, bool complain)
5796 tree parm = FUNCTION_FIRST_USER_PARM (fun);
5798 for (; parm != NULL; parm = TREE_CHAIN (parm))
5799 if (!literal_type_p (TREE_TYPE (parm)))
5804 error ("invalid type for parameter %d of constexpr "
5805 "function %q+#D", DECL_PARM_INDEX (parm), fun);
5806 explain_non_literal_class (TREE_TYPE (parm));
5810 if (!DECL_CONSTRUCTOR_P (fun))
5812 tree rettype = TREE_TYPE (TREE_TYPE (fun));
5813 if (!literal_type_p (rettype))
5818 error ("invalid return type %qT of constexpr function %q+D",
5820 explain_non_literal_class (rettype);
5824 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun)
5825 && !CLASSTYPE_LITERAL_P (DECL_CONTEXT (fun)))
5830 error ("enclosing class of constexpr non-static member "
5831 "function %q+#D is not a literal type", fun);
5832 explain_non_literal_class (DECL_CONTEXT (fun));
5836 else if (CLASSTYPE_VBASECLASSES (DECL_CONTEXT (fun)))
5840 error ("%q#T has virtual base classes", DECL_CONTEXT (fun));
5846 /* Subroutine of build_data_member_initialization. MEMBER is a COMPONENT_REF
5847 for a member of an anonymous aggregate, INIT is the initializer for that
5848 member, and VEC_OUTER is the vector of constructor elements for the class
5849 whose constructor we are processing. Add the initializer to the vector
5850 and return true to indicate success. */
5853 build_anon_member_initialization (tree member, tree init,
5854 vec<constructor_elt, va_gc> **vec_outer)
5856 /* MEMBER presents the relevant fields from the inside out, but we need
5857 to build up the initializer from the outside in so that we can reuse
5858 previously built CONSTRUCTORs if this is, say, the second field in an
5859 anonymous struct. So we use a vec as a stack. */
5864 fields.safe_push (TREE_OPERAND (member, 1));
5865 member = TREE_OPERAND (member, 0);
5867 while (ANON_AGGR_TYPE_P (TREE_TYPE (member)));
5869 /* VEC has the constructor elements vector for the context of FIELD.
5870 If FIELD is an anonymous aggregate, we will push inside it. */
5871 vec<constructor_elt, va_gc> **vec = vec_outer;
5873 while (field = fields.pop(),
5874 ANON_AGGR_TYPE_P (TREE_TYPE (field)))
5877 /* If there is already an outer constructor entry for the anonymous
5878 aggregate FIELD, use it; otherwise, insert one. */
5879 if (vec_safe_is_empty (*vec)
5880 || (*vec)->last().index != field)
5882 ctor = build_constructor (TREE_TYPE (field), NULL);
5883 CONSTRUCTOR_APPEND_ELT (*vec, field, ctor);
5886 ctor = (*vec)->last().value;
5887 vec = &CONSTRUCTOR_ELTS (ctor);
5890 /* Now we're at the innermost field, the one that isn't an anonymous
5891 aggregate. Add its initializer to the CONSTRUCTOR and we're done. */
5892 gcc_assert (fields.is_empty());
5894 CONSTRUCTOR_APPEND_ELT (*vec, field, init);
5899 /* Subroutine of build_constexpr_constructor_member_initializers.
5900 The expression tree T represents a data member initialization
5901 in a (constexpr) constructor definition. Build a pairing of
5902 the data member with its initializer, and prepend that pair
5903 to the existing initialization pair INITS. */
5906 build_data_member_initialization (tree t, vec<constructor_elt, va_gc> **vec)
5909 if (TREE_CODE (t) == CLEANUP_POINT_EXPR)
5910 t = TREE_OPERAND (t, 0);
5911 if (TREE_CODE (t) == EXPR_STMT)
5912 t = TREE_OPERAND (t, 0);
5913 if (t == error_mark_node)
5915 if (TREE_CODE (t) == STATEMENT_LIST)
5917 tree_stmt_iterator i;
5918 for (i = tsi_start (t); !tsi_end_p (i); tsi_next (&i))
5920 if (! build_data_member_initialization (tsi_stmt (i), vec))
5925 if (TREE_CODE (t) == CLEANUP_STMT)
5927 /* We can't see a CLEANUP_STMT in a constructor for a literal class,
5928 but we can in a constexpr constructor for a non-literal class. Just
5929 ignore it; either all the initialization will be constant, in which
5930 case the cleanup can't run, or it can't be constexpr.
5931 Still recurse into CLEANUP_BODY. */
5932 return build_data_member_initialization (CLEANUP_BODY (t), vec);
5934 if (TREE_CODE (t) == CONVERT_EXPR)
5935 t = TREE_OPERAND (t, 0);
5936 if (TREE_CODE (t) == INIT_EXPR
5937 || TREE_CODE (t) == MODIFY_EXPR)
5939 member = TREE_OPERAND (t, 0);
5940 init = unshare_expr (TREE_OPERAND (t, 1));
5942 else if (TREE_CODE (t) == CALL_EXPR)
5944 member = CALL_EXPR_ARG (t, 0);
5945 /* We don't use build_cplus_new here because it complains about
5946 abstract bases. Leaving the call unwrapped means that it has the
5947 wrong type, but cxx_eval_constant_expression doesn't care. */
5948 init = unshare_expr (t);
5950 else if (TREE_CODE (t) == DECL_EXPR)
5951 /* Declaring a temporary, don't add it to the CONSTRUCTOR. */
5955 if (INDIRECT_REF_P (member))
5956 member = TREE_OPERAND (member, 0);
5957 if (TREE_CODE (member) == NOP_EXPR)
5961 if (TREE_CODE (op) == ADDR_EXPR)
5963 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5964 (TREE_TYPE (TREE_TYPE (op)),
5965 TREE_TYPE (TREE_TYPE (member))));
5966 /* Initializing a cv-qualified member; we need to look through
5970 else if (op == current_class_ptr
5971 && (same_type_ignoring_top_level_qualifiers_p
5972 (TREE_TYPE (TREE_TYPE (member)),
5973 current_class_type)))
5974 /* Delegating constructor. */
5978 /* This is an initializer for an empty base; keep it for now so
5979 we can check it in cxx_eval_bare_aggregate. */
5980 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (member))));
5983 if (TREE_CODE (member) == ADDR_EXPR)
5984 member = TREE_OPERAND (member, 0);
5985 if (TREE_CODE (member) == COMPONENT_REF)
5987 tree aggr = TREE_OPERAND (member, 0);
5988 if (TREE_CODE (aggr) != COMPONENT_REF)
5989 /* Normal member initialization. */
5990 member = TREE_OPERAND (member, 1);
5991 else if (ANON_AGGR_TYPE_P (TREE_TYPE (aggr)))
5992 /* Initializing a member of an anonymous union. */
5993 return build_anon_member_initialization (member, init, vec);
5995 /* We're initializing a vtable pointer in a base. Leave it as
5996 COMPONENT_REF so we remember the path to get to the vfield. */
5997 gcc_assert (TREE_TYPE (member) == vtbl_ptr_type_node);
6000 CONSTRUCTOR_APPEND_ELT (*vec, member, init);
6004 /* Make sure that there are no statements after LAST in the constructor
6005 body represented by LIST. */
6008 check_constexpr_ctor_body (tree last, tree list)
6011 if (TREE_CODE (list) == STATEMENT_LIST)
6013 tree_stmt_iterator i = tsi_last (list);
6014 for (; !tsi_end_p (i); tsi_prev (&i))
6016 tree t = tsi_stmt (i);
6019 if (TREE_CODE (t) == BIND_EXPR)
6021 if (!check_constexpr_ctor_body (last, BIND_EXPR_BODY (t)))
6026 /* We currently allow typedefs and static_assert.
6027 FIXME allow them in the standard, too. */
6028 if (TREE_CODE (t) != STATIC_ASSERT)
6035 else if (list != last
6036 && TREE_CODE (list) != STATIC_ASSERT)
6040 error ("constexpr constructor does not have empty body");
6041 DECL_DECLARED_CONSTEXPR_P (current_function_decl) = false;
6046 /* V is a vector of constructor elements built up for the base and member
6047 initializers of a constructor for TYPE. They need to be in increasing
6048 offset order, which they might not be yet if TYPE has a primary base
6049 which is not first in the base-clause or a vptr and at least one base
6050 all of which are non-primary. */
6052 static vec<constructor_elt, va_gc> *
6053 sort_constexpr_mem_initializers (tree type, vec<constructor_elt, va_gc> *v)
6055 tree pri = CLASSTYPE_PRIMARY_BINFO (type);
6057 constructor_elt elt;
6061 field_type = BINFO_TYPE (pri);
6062 else if (TYPE_CONTAINS_VPTR_P (type))
6063 field_type = vtbl_ptr_type_node;
6067 /* Find the element for the primary base or vptr and move it to the
6068 beginning of the vec. */
6069 vec<constructor_elt, va_gc> &vref = *v;
6071 if (TREE_TYPE (vref[i].index) == field_type)
6078 vref[i] = vref[i-1];
6085 /* Build compile-time evalable representations of member-initializer list
6086 for a constexpr constructor. */
6089 build_constexpr_constructor_member_initializers (tree type, tree body)
6091 vec<constructor_elt, va_gc> *vec = NULL;
6093 if (TREE_CODE (body) == MUST_NOT_THROW_EXPR
6094 || TREE_CODE (body) == EH_SPEC_BLOCK)
6095 body = TREE_OPERAND (body, 0);
6096 if (TREE_CODE (body) == STATEMENT_LIST)
6097 body = STATEMENT_LIST_HEAD (body)->stmt;
6098 body = BIND_EXPR_BODY (body);
6099 if (TREE_CODE (body) == CLEANUP_POINT_EXPR)
6101 body = TREE_OPERAND (body, 0);
6102 if (TREE_CODE (body) == EXPR_STMT)
6103 body = TREE_OPERAND (body, 0);
6104 if (TREE_CODE (body) == INIT_EXPR
6105 && (same_type_ignoring_top_level_qualifiers_p
6106 (TREE_TYPE (TREE_OPERAND (body, 0)),
6107 current_class_type)))
6110 return TREE_OPERAND (body, 1);
6112 ok = build_data_member_initialization (body, &vec);
6114 else if (TREE_CODE (body) == STATEMENT_LIST)
6116 tree_stmt_iterator i;
6117 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
6119 ok = build_data_member_initialization (tsi_stmt (i), &vec);
6124 else if (TREE_CODE (body) == TRY_BLOCK)
6126 error ("body of %<constexpr%> constructor cannot be "
6127 "a function-try-block");
6128 return error_mark_node;
6130 else if (EXPR_P (body))
6131 ok = build_data_member_initialization (body, &vec);
6133 gcc_assert (errorcount > 0);
6136 if (vec_safe_length (vec) > 0)
6138 /* In a delegating constructor, return the target. */
6139 constructor_elt *ce = &(*vec)[0];
6140 if (ce->index == current_class_ptr)
6147 vec = sort_constexpr_mem_initializers (type, vec);
6148 return build_constructor (type, vec);
6151 return error_mark_node;
6154 /* Subroutine of register_constexpr_fundef. BODY is the body of a function
6155 declared to be constexpr, or a sub-statement thereof. Returns the
6156 return value if suitable, error_mark_node for a statement not allowed in
6157 a constexpr function, or NULL_TREE if no return value was found. */
6160 constexpr_fn_retval (tree body)
6162 switch (TREE_CODE (body))
6164 case STATEMENT_LIST:
6166 tree_stmt_iterator i;
6167 tree expr = NULL_TREE;
6168 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
6170 tree s = constexpr_fn_retval (tsi_stmt (i));
6171 if (s == error_mark_node)
6172 return error_mark_node;
6173 else if (s == NULL_TREE)
6174 /* Keep iterating. */;
6176 /* Multiple return statements. */
6177 return error_mark_node;
6185 return unshare_expr (TREE_OPERAND (body, 0));
6188 if (TREE_CODE (DECL_EXPR_DECL (body)) == USING_DECL)
6190 return error_mark_node;
6192 case CLEANUP_POINT_EXPR:
6193 return constexpr_fn_retval (TREE_OPERAND (body, 0));
6199 return error_mark_node;
6203 /* Subroutine of register_constexpr_fundef. BODY is the DECL_SAVED_TREE of
6204 FUN; do the necessary transformations to turn it into a single expression
6205 that we can store in the hash table. */
6208 massage_constexpr_body (tree fun, tree body)
6210 if (DECL_CONSTRUCTOR_P (fun))
6211 body = build_constexpr_constructor_member_initializers
6212 (DECL_CONTEXT (fun), body);
6215 if (TREE_CODE (body) == EH_SPEC_BLOCK)
6216 body = EH_SPEC_STMTS (body);
6217 if (TREE_CODE (body) == MUST_NOT_THROW_EXPR)
6218 body = TREE_OPERAND (body, 0);
6219 if (TREE_CODE (body) == BIND_EXPR)
6220 body = BIND_EXPR_BODY (body);
6221 body = constexpr_fn_retval (body);
6226 /* FUN is a constexpr constructor with massaged body BODY. Return true
6227 if some bases/fields are uninitialized, and complain if COMPLAIN. */
6230 cx_check_missing_mem_inits (tree fun, tree body, bool complain)
6237 if (TREE_CODE (body) != CONSTRUCTOR)
6240 nelts = CONSTRUCTOR_NELTS (body);
6241 ctype = DECL_CONTEXT (fun);
6242 field = TYPE_FIELDS (ctype);
6244 if (TREE_CODE (ctype) == UNION_TYPE)
6246 if (nelts == 0 && next_initializable_field (field))
6249 error ("%<constexpr%> constructor for union %qT must "
6250 "initialize exactly one non-static data member", ctype);
6257 for (i = 0; i <= nelts; ++i)
6264 index = CONSTRUCTOR_ELT (body, i)->index;
6265 /* Skip base and vtable inits. */
6266 if (TREE_CODE (index) != FIELD_DECL
6267 || DECL_ARTIFICIAL (index))
6270 for (; field != index; field = DECL_CHAIN (field))
6273 if (TREE_CODE (field) != FIELD_DECL
6274 || (DECL_C_BIT_FIELD (field) && !DECL_NAME (field))
6275 || DECL_ARTIFICIAL (field))
6277 ftype = strip_array_types (TREE_TYPE (field));
6278 if (type_has_constexpr_default_constructor (ftype))
6280 /* It's OK to skip a member with a trivial constexpr ctor.
6281 A constexpr ctor that isn't trivial should have been
6283 gcc_checking_assert (!TYPE_HAS_COMPLEX_DFLT (ftype)
6284 || errorcount != 0);
6289 error ("uninitialized member %qD in %<constexpr%> constructor",
6293 if (field == NULL_TREE)
6295 field = DECL_CHAIN (field);
6301 /* We are processing the definition of the constexpr function FUN.
6302 Check that its BODY fulfills the propriate requirements and
6303 enter it in the constexpr function definition table.
6304 For constructor BODY is actually the TREE_LIST of the
6305 member-initializer list. */
6308 register_constexpr_fundef (tree fun, tree body)
6310 constexpr_fundef entry;
6311 constexpr_fundef **slot;
6313 if (!is_valid_constexpr_fn (fun, !DECL_GENERATED_P (fun)))
6316 body = massage_constexpr_body (fun, body);
6317 if (body == NULL_TREE || body == error_mark_node)
6319 if (!DECL_CONSTRUCTOR_P (fun))
6320 error ("body of constexpr function %qD not a return-statement", fun);
6324 if (!potential_rvalue_constant_expression (body))
6326 if (!DECL_GENERATED_P (fun))
6327 require_potential_rvalue_constant_expression (body);
6331 if (DECL_CONSTRUCTOR_P (fun)
6332 && cx_check_missing_mem_inits (fun, body, !DECL_GENERATED_P (fun)))
6335 /* Create the constexpr function table if necessary. */
6336 if (constexpr_fundef_table == NULL)
6337 constexpr_fundef_table = htab_create_ggc (101,
6338 constexpr_fundef_hash,
6339 constexpr_fundef_equal,
6343 slot = (constexpr_fundef **)
6344 htab_find_slot (constexpr_fundef_table, &entry, INSERT);
6346 gcc_assert (*slot == NULL);
6347 *slot = ggc_alloc_constexpr_fundef ();
6353 /* FUN is a non-constexpr function called in a context that requires a
6354 constant expression. If it comes from a constexpr template, explain why
6355 the instantiation isn't constexpr. */
6358 explain_invalid_constexpr_fn (tree fun)
6360 static struct pointer_set_t *diagnosed;
6362 location_t save_loc;
6363 /* Only diagnose defaulted functions or instantiations. */
6364 if (!DECL_DEFAULTED_FN (fun)
6365 && !is_instantiation_of_constexpr (fun))
6367 if (diagnosed == NULL)
6368 diagnosed = pointer_set_create ();
6369 if (pointer_set_insert (diagnosed, fun) != 0)
6370 /* Already explained. */
6373 save_loc = input_location;
6374 input_location = DECL_SOURCE_LOCATION (fun);
6375 inform (0, "%q+D is not usable as a constexpr function because:", fun);
6376 /* First check the declaration. */
6377 if (is_valid_constexpr_fn (fun, true))
6379 /* Then if it's OK, the body. */
6380 if (DECL_DEFAULTED_FN (fun))
6381 explain_implicit_non_constexpr (fun);
6384 body = massage_constexpr_body (fun, DECL_SAVED_TREE (fun));
6385 require_potential_rvalue_constant_expression (body);
6386 if (DECL_CONSTRUCTOR_P (fun))
6387 cx_check_missing_mem_inits (fun, body, true);
6390 input_location = save_loc;
6393 /* Objects of this type represent calls to constexpr functions
6394 along with the bindings of parameters to their arguments, for
6395 the purpose of compile time evaluation. */
6397 typedef struct GTY(()) constexpr_call {
6398 /* Description of the constexpr function definition. */
6399 constexpr_fundef *fundef;
6400 /* Parameter bindings environment. A TREE_LIST where each TREE_PURPOSE
6401 is a parameter _DECL and the TREE_VALUE is the value of the parameter.
6402 Note: This arrangement is made to accomodate the use of
6403 iterative_hash_template_arg (see pt.c). If you change this
6404 representation, also change the hash calculation in
6405 cxx_eval_call_expression. */
6407 /* Result of the call.
6408 NULL means the call is being evaluated.
6409 error_mark_node means that the evaluation was erroneous;
6410 otherwise, the actuall value of the call. */
6412 /* The hash of this call; we remember it here to avoid having to
6413 recalculate it when expanding the hash table. */
6417 /* A table of all constexpr calls that have been evaluated by the
6418 compiler in this translation unit. */
6420 static GTY ((param_is (constexpr_call))) htab_t constexpr_call_table;
6422 static tree cxx_eval_constant_expression (const constexpr_call *, tree,
6423 bool, bool, bool *, bool *);
6425 /* Compute a hash value for a constexpr call representation. */
6428 constexpr_call_hash (const void *p)
6430 const constexpr_call *info = (const constexpr_call *) p;
6434 /* Return 1 if the objects pointed to by P and Q represent calls
6435 to the same constexpr function with the same arguments.
6436 Otherwise, return 0. */
6439 constexpr_call_equal (const void *p, const void *q)
6441 const constexpr_call *lhs = (const constexpr_call *) p;
6442 const constexpr_call *rhs = (const constexpr_call *) q;
6447 if (!constexpr_fundef_equal (lhs->fundef, rhs->fundef))
6449 lhs_bindings = lhs->bindings;
6450 rhs_bindings = rhs->bindings;
6451 while (lhs_bindings != NULL && rhs_bindings != NULL)
6453 tree lhs_arg = TREE_VALUE (lhs_bindings);
6454 tree rhs_arg = TREE_VALUE (rhs_bindings);
6455 gcc_assert (TREE_TYPE (lhs_arg) == TREE_TYPE (rhs_arg));
6456 if (!cp_tree_equal (lhs_arg, rhs_arg))
6458 lhs_bindings = TREE_CHAIN (lhs_bindings);
6459 rhs_bindings = TREE_CHAIN (rhs_bindings);
6461 return lhs_bindings == rhs_bindings;
6464 /* Initialize the constexpr call table, if needed. */
6467 maybe_initialize_constexpr_call_table (void)
6469 if (constexpr_call_table == NULL)
6470 constexpr_call_table = htab_create_ggc (101,
6471 constexpr_call_hash,
6472 constexpr_call_equal,
6476 /* Return true if T designates the implied `this' parameter. */
6479 is_this_parameter (tree t)
6481 return t == current_class_ptr;
6484 /* We have an expression tree T that represents a call, either CALL_EXPR
6485 or AGGR_INIT_EXPR. If the call is lexically to a named function,
6486 retrun the _DECL for that function. */
6489 get_function_named_in_call (tree t)
6492 switch (TREE_CODE (t))
6495 fun = CALL_EXPR_FN (t);
6498 case AGGR_INIT_EXPR:
6499 fun = AGGR_INIT_EXPR_FN (t);
6506 if (TREE_CODE (fun) == ADDR_EXPR
6507 && TREE_CODE (TREE_OPERAND (fun, 0)) == FUNCTION_DECL)
6508 fun = TREE_OPERAND (fun, 0);
6512 /* We have an expression tree T that represents a call, either CALL_EXPR
6513 or AGGR_INIT_EXPR. Return the Nth argument. */
6516 get_nth_callarg (tree t, int n)
6518 switch (TREE_CODE (t))
6521 return CALL_EXPR_ARG (t, n);
6523 case AGGR_INIT_EXPR:
6524 return AGGR_INIT_EXPR_ARG (t, n);
6532 /* Look up the binding of the function parameter T in a constexpr
6533 function call context CALL. */
6536 lookup_parameter_binding (const constexpr_call *call, tree t)
6538 tree b = purpose_member (t, call->bindings);
6539 return TREE_VALUE (b);
6542 /* Attempt to evaluate T which represents a call to a builtin function.
6543 We assume here that all builtin functions evaluate to scalar types
6544 represented by _CST nodes. */
6547 cxx_eval_builtin_function_call (const constexpr_call *call, tree t,
6548 bool allow_non_constant, bool addr,
6549 bool *non_constant_p, bool *overflow_p)
6551 const int nargs = call_expr_nargs (t);
6552 tree *args = (tree *) alloca (nargs * sizeof (tree));
6555 for (i = 0; i < nargs; ++i)
6557 args[i] = cxx_eval_constant_expression (call, CALL_EXPR_ARG (t, i),
6558 allow_non_constant, addr,
6559 non_constant_p, overflow_p);
6560 if (allow_non_constant && *non_constant_p)
6563 if (*non_constant_p)
6565 new_call = build_call_array_loc (EXPR_LOCATION (t), TREE_TYPE (t),
6566 CALL_EXPR_FN (t), nargs, args);
6567 new_call = fold (new_call);
6568 VERIFY_CONSTANT (new_call);
6572 /* TEMP is the constant value of a temporary object of type TYPE. Adjust
6573 the type of the value to match. */
6576 adjust_temp_type (tree type, tree temp)
6578 if (TREE_TYPE (temp) == type)
6580 /* Avoid wrapping an aggregate value in a NOP_EXPR. */
6581 if (TREE_CODE (temp) == CONSTRUCTOR)
6582 return build_constructor (type, CONSTRUCTOR_ELTS (temp));
6583 gcc_assert (scalarish_type_p (type));
6584 return cp_fold_convert (type, temp);
6587 /* Subroutine of cxx_eval_call_expression.
6588 We are processing a call expression (either CALL_EXPR or
6589 AGGR_INIT_EXPR) in the call context of OLD_CALL. Evaluate
6590 all arguments and bind their values to correspondings
6591 parameters, making up the NEW_CALL context. */
6594 cxx_bind_parameters_in_call (const constexpr_call *old_call, tree t,
6595 constexpr_call *new_call,
6596 bool allow_non_constant,
6597 bool *non_constant_p, bool *overflow_p)
6599 const int nargs = call_expr_nargs (t);
6600 tree fun = new_call->fundef->decl;
6601 tree parms = DECL_ARGUMENTS (fun);
6603 for (i = 0; i < nargs; ++i)
6606 tree type = parms ? TREE_TYPE (parms) : void_type_node;
6607 /* For member function, the first argument is a pointer to the implied
6608 object. And for an object contruction, don't bind `this' before
6609 it is fully constructed. */
6610 if (i == 0 && DECL_CONSTRUCTOR_P (fun))
6612 x = get_nth_callarg (t, i);
6613 if (parms && DECL_BY_REFERENCE (parms))
6615 /* cp_genericize made this a reference for argument passing, but
6616 we don't want to treat it like one for constexpr evaluation. */
6617 gcc_assert (TREE_CODE (type) == REFERENCE_TYPE);
6618 gcc_assert (TREE_CODE (TREE_TYPE (x)) == REFERENCE_TYPE);
6619 type = TREE_TYPE (type);
6620 x = convert_from_reference (x);
6622 arg = cxx_eval_constant_expression (old_call, x, allow_non_constant,
6623 TREE_CODE (type) == REFERENCE_TYPE,
6624 non_constant_p, overflow_p);
6625 /* Don't VERIFY_CONSTANT here. */
6626 if (*non_constant_p && allow_non_constant)
6628 /* Just discard ellipsis args after checking their constantitude. */
6631 if (*non_constant_p)
6632 /* Don't try to adjust the type of non-constant args. */
6635 /* Make sure the binding has the same type as the parm. */
6636 if (TREE_CODE (type) != REFERENCE_TYPE)
6637 arg = adjust_temp_type (type, arg);
6638 new_call->bindings = tree_cons (parms, arg, new_call->bindings);
6640 parms = TREE_CHAIN (parms);
6644 /* Variables and functions to manage constexpr call expansion context.
6645 These do not need to be marked for PCH or GC. */
6647 /* FIXME remember and print actual constant arguments. */
6648 static vec<tree> call_stack = vNULL;
6649 static int call_stack_tick;
6650 static int last_cx_error_tick;
6653 push_cx_call_context (tree call)
6656 if (!EXPR_HAS_LOCATION (call))
6657 SET_EXPR_LOCATION (call, input_location);
6658 call_stack.safe_push (call);
6659 if (call_stack.length () > (unsigned) max_constexpr_depth)
6665 pop_cx_call_context (void)
6672 cx_error_context (void)
6674 vec<tree> r = vNULL;
6675 if (call_stack_tick != last_cx_error_tick
6676 && !call_stack.is_empty ())
6678 last_cx_error_tick = call_stack_tick;
6682 /* Subroutine of cxx_eval_constant_expression.
6683 Evaluate the call expression tree T in the context of OLD_CALL expression
6687 cxx_eval_call_expression (const constexpr_call *old_call, tree t,
6688 bool allow_non_constant, bool addr,
6689 bool *non_constant_p, bool *overflow_p)
6691 location_t loc = EXPR_LOC_OR_HERE (t);
6692 tree fun = get_function_named_in_call (t);
6694 constexpr_call new_call = { NULL, NULL, NULL, 0 };
6695 constexpr_call **slot;
6696 constexpr_call *entry;
6699 if (TREE_CODE (fun) != FUNCTION_DECL)
6701 /* Might be a constexpr function pointer. */
6702 fun = cxx_eval_constant_expression (old_call, fun, allow_non_constant,
6703 /*addr*/false, non_constant_p, overflow_p);
6704 if (TREE_CODE (fun) == ADDR_EXPR)
6705 fun = TREE_OPERAND (fun, 0);
6707 if (TREE_CODE (fun) != FUNCTION_DECL)
6709 if (!allow_non_constant && !*non_constant_p)
6710 error_at (loc, "expression %qE does not designate a constexpr "
6712 *non_constant_p = true;
6715 if (DECL_CLONED_FUNCTION_P (fun))
6716 fun = DECL_CLONED_FUNCTION (fun);
6717 if (is_builtin_fn (fun))
6718 return cxx_eval_builtin_function_call (old_call, t, allow_non_constant,
6719 addr, non_constant_p, overflow_p);
6720 if (!DECL_DECLARED_CONSTEXPR_P (fun))
6722 if (!allow_non_constant)
6724 error_at (loc, "call to non-constexpr function %qD", fun);
6725 explain_invalid_constexpr_fn (fun);
6727 *non_constant_p = true;
6731 /* Shortcut trivial copy constructor/op=. */
6732 if (call_expr_nargs (t) == 2 && trivial_fn_p (fun))
6734 tree arg = convert_from_reference (get_nth_callarg (t, 1));
6735 return cxx_eval_constant_expression (old_call, arg, allow_non_constant,
6736 addr, non_constant_p, overflow_p);
6739 /* If in direct recursive call, optimize definition search. */
6740 if (old_call != NULL && old_call->fundef->decl == fun)
6741 new_call.fundef = old_call->fundef;
6744 new_call.fundef = retrieve_constexpr_fundef (fun);
6745 if (new_call.fundef == NULL || new_call.fundef->body == NULL)
6747 if (!allow_non_constant)
6749 if (DECL_INITIAL (fun))
6751 /* The definition of fun was somehow unsuitable. */
6752 error_at (loc, "%qD called in a constant expression", fun);
6753 explain_invalid_constexpr_fn (fun);
6756 error_at (loc, "%qD used before its definition", fun);
6758 *non_constant_p = true;
6762 cxx_bind_parameters_in_call (old_call, t, &new_call,
6763 allow_non_constant, non_constant_p, overflow_p);
6764 if (*non_constant_p)
6767 depth_ok = push_cx_call_context (t);
6770 = iterative_hash_template_arg (new_call.bindings,
6771 constexpr_fundef_hash (new_call.fundef));
6773 /* If we have seen this call before, we are done. */
6774 maybe_initialize_constexpr_call_table ();
6775 slot = (constexpr_call **)
6776 htab_find_slot (constexpr_call_table, &new_call, INSERT);
6780 /* We need to keep a pointer to the entry, not just the slot, as the
6781 slot can move in the call to cxx_eval_builtin_function_call. */
6782 *slot = entry = ggc_alloc_constexpr_call ();
6785 /* Calls which are in progress have their result set to NULL
6786 so that we can detect circular dependencies. */
6787 else if (entry->result == NULL)
6789 if (!allow_non_constant)
6790 error ("call has circular dependency");
6791 *non_constant_p = true;
6792 entry->result = result = error_mark_node;
6797 if (!allow_non_constant)
6798 error ("constexpr evaluation depth exceeds maximum of %d (use "
6799 "-fconstexpr-depth= to increase the maximum)",
6800 max_constexpr_depth);
6801 *non_constant_p = true;
6802 entry->result = result = error_mark_node;
6806 result = entry->result;
6807 if (!result || result == error_mark_node)
6808 result = (cxx_eval_constant_expression
6809 (&new_call, new_call.fundef->body,
6810 allow_non_constant, addr,
6811 non_constant_p, overflow_p));
6812 if (result == error_mark_node)
6813 *non_constant_p = true;
6814 if (*non_constant_p)
6815 entry->result = result = error_mark_node;
6818 /* If this was a call to initialize an object, set the type of
6819 the CONSTRUCTOR to the type of that object. */
6820 if (DECL_CONSTRUCTOR_P (fun))
6822 tree ob_arg = get_nth_callarg (t, 0);
6823 STRIP_NOPS (ob_arg);
6824 gcc_assert (TREE_CODE (TREE_TYPE (ob_arg)) == POINTER_TYPE
6825 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (ob_arg))));
6826 result = adjust_temp_type (TREE_TYPE (TREE_TYPE (ob_arg)),
6829 entry->result = result;
6833 pop_cx_call_context ();
6834 return unshare_expr (result);
6837 /* FIXME speed this up, it's taking 16% of compile time on sieve testcase. */
6840 reduced_constant_expression_p (tree t)
6842 if (TREE_CODE (t) == PTRMEM_CST)
6843 /* Even if we can't lower this yet, it's constant. */
6845 /* FIXME are we calling this too much? */
6846 return initializer_constant_valid_p (t, TREE_TYPE (t)) != NULL_TREE;
6849 /* Some expressions may have constant operands but are not constant
6850 themselves, such as 1/0. Call this function (or rather, the macro
6851 following it) to check for that condition.
6853 We only call this in places that require an arithmetic constant, not in
6854 places where we might have a non-constant expression that can be a
6855 component of a constant expression, such as the address of a constexpr
6856 variable that might be dereferenced later. */
6859 verify_constant (tree t, bool allow_non_constant, bool *non_constant_p,
6862 if (!*non_constant_p && !reduced_constant_expression_p (t))
6864 if (!allow_non_constant)
6865 error ("%q+E is not a constant expression", t);
6866 *non_constant_p = true;
6868 if (TREE_OVERFLOW_P (t))
6870 if (!allow_non_constant)
6872 permerror (input_location, "overflow in constant expression");
6873 /* If we're being permissive (and are in an enforcing
6874 context), ignore the overflow. */
6875 if (flag_permissive)
6876 return *non_constant_p;
6880 return *non_constant_p;
6883 /* Subroutine of cxx_eval_constant_expression.
6884 Attempt to reduce the unary expression tree T to a compile time value.
6885 If successful, return the value. Otherwise issue a diagnostic
6886 and return error_mark_node. */
6889 cxx_eval_unary_expression (const constexpr_call *call, tree t,
6890 bool allow_non_constant, bool addr,
6891 bool *non_constant_p, bool *overflow_p)
6894 tree orig_arg = TREE_OPERAND (t, 0);
6895 tree arg = cxx_eval_constant_expression (call, orig_arg, allow_non_constant,
6896 addr, non_constant_p, overflow_p);
6897 VERIFY_CONSTANT (arg);
6898 if (arg == orig_arg)
6900 r = fold_build1 (TREE_CODE (t), TREE_TYPE (t), arg);
6901 VERIFY_CONSTANT (r);
6905 /* Subroutine of cxx_eval_constant_expression.
6906 Like cxx_eval_unary_expression, except for binary expressions. */
6909 cxx_eval_binary_expression (const constexpr_call *call, tree t,
6910 bool allow_non_constant, bool addr,
6911 bool *non_constant_p, bool *overflow_p)
6914 tree orig_lhs = TREE_OPERAND (t, 0);
6915 tree orig_rhs = TREE_OPERAND (t, 1);
6917 lhs = cxx_eval_constant_expression (call, orig_lhs,
6918 allow_non_constant, addr,
6919 non_constant_p, overflow_p);
6920 VERIFY_CONSTANT (lhs);
6921 rhs = cxx_eval_constant_expression (call, orig_rhs,
6922 allow_non_constant, addr,
6923 non_constant_p, overflow_p);
6924 VERIFY_CONSTANT (rhs);
6925 if (lhs == orig_lhs && rhs == orig_rhs)
6927 r = fold_build2 (TREE_CODE (t), TREE_TYPE (t), lhs, rhs);
6928 VERIFY_CONSTANT (r);
6932 /* Subroutine of cxx_eval_constant_expression.
6933 Attempt to evaluate condition expressions. Dead branches are not
6937 cxx_eval_conditional_expression (const constexpr_call *call, tree t,
6938 bool allow_non_constant, bool addr,
6939 bool *non_constant_p, bool *overflow_p)
6941 tree val = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
6942 allow_non_constant, addr,
6943 non_constant_p, overflow_p);
6944 VERIFY_CONSTANT (val);
6945 /* Don't VERIFY_CONSTANT the other operands. */
6946 if (integer_zerop (val))
6947 return cxx_eval_constant_expression (call, TREE_OPERAND (t, 2),
6948 allow_non_constant, addr,
6949 non_constant_p, overflow_p);
6950 return cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
6951 allow_non_constant, addr,
6952 non_constant_p, overflow_p);
6955 /* Subroutine of cxx_eval_constant_expression.
6956 Attempt to reduce a reference to an array slot. */
6959 cxx_eval_array_reference (const constexpr_call *call, tree t,
6960 bool allow_non_constant, bool addr,
6961 bool *non_constant_p, bool *overflow_p)
6963 tree oldary = TREE_OPERAND (t, 0);
6964 tree ary = cxx_eval_constant_expression (call, oldary,
6965 allow_non_constant, addr,
6966 non_constant_p, overflow_p);
6970 unsigned len, elem_nchars = 1;
6971 if (*non_constant_p)
6973 oldidx = TREE_OPERAND (t, 1);
6974 index = cxx_eval_constant_expression (call, oldidx,
6975 allow_non_constant, false,
6976 non_constant_p, overflow_p);
6977 VERIFY_CONSTANT (index);
6978 if (addr && ary == oldary && index == oldidx)
6981 return build4 (ARRAY_REF, TREE_TYPE (t), ary, index, NULL, NULL);
6982 elem_type = TREE_TYPE (TREE_TYPE (ary));
6983 if (TREE_CODE (ary) == CONSTRUCTOR)
6984 len = CONSTRUCTOR_NELTS (ary);
6985 else if (TREE_CODE (ary) == STRING_CST)
6987 elem_nchars = (TYPE_PRECISION (elem_type)
6988 / TYPE_PRECISION (char_type_node));
6989 len = (unsigned) TREE_STRING_LENGTH (ary) / elem_nchars;
6993 /* We can't do anything with other tree codes, so use
6994 VERIFY_CONSTANT to complain and fail. */
6995 VERIFY_CONSTANT (ary);
6998 if (compare_tree_int (index, len) >= 0)
7000 if (tree_int_cst_lt (index, array_type_nelts_top (TREE_TYPE (ary))))
7002 /* If it's within the array bounds but doesn't have an explicit
7003 initializer, it's value-initialized. */
7004 tree val = build_value_init (elem_type, tf_warning_or_error);
7005 return cxx_eval_constant_expression (call, val,
7006 allow_non_constant, addr,
7007 non_constant_p, overflow_p);
7010 if (!allow_non_constant)
7011 error ("array subscript out of bound");
7012 *non_constant_p = true;
7015 else if (tree_int_cst_lt (index, integer_zero_node))
7017 if (!allow_non_constant)
7018 error ("negative array subscript");
7019 *non_constant_p = true;
7022 i = tree_low_cst (index, 0);
7023 if (TREE_CODE (ary) == CONSTRUCTOR)
7024 return (*CONSTRUCTOR_ELTS (ary))[i].value;
7025 else if (elem_nchars == 1)
7026 return build_int_cst (cv_unqualified (TREE_TYPE (TREE_TYPE (ary))),
7027 TREE_STRING_POINTER (ary)[i]);
7030 tree type = cv_unqualified (TREE_TYPE (TREE_TYPE (ary)));
7031 return native_interpret_expr (type, (const unsigned char *)
7032 TREE_STRING_POINTER (ary)
7033 + i * elem_nchars, elem_nchars);
7035 /* Don't VERIFY_CONSTANT here. */
7038 /* Subroutine of cxx_eval_constant_expression.
7039 Attempt to reduce a field access of a value of class type. */
7042 cxx_eval_component_reference (const constexpr_call *call, tree t,
7043 bool allow_non_constant, bool addr,
7044 bool *non_constant_p, bool *overflow_p)
7046 unsigned HOST_WIDE_INT i;
7049 tree part = TREE_OPERAND (t, 1);
7050 tree orig_whole = TREE_OPERAND (t, 0);
7051 tree whole = cxx_eval_constant_expression (call, orig_whole,
7052 allow_non_constant, addr,
7053 non_constant_p, overflow_p);
7054 if (whole == orig_whole)
7057 return fold_build3 (COMPONENT_REF, TREE_TYPE (t),
7058 whole, part, NULL_TREE);
7059 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
7061 if (!*non_constant_p && TREE_CODE (whole) != CONSTRUCTOR)
7063 if (!allow_non_constant)
7064 error ("%qE is not a constant expression", orig_whole);
7065 *non_constant_p = true;
7067 if (DECL_MUTABLE_P (part))
7069 if (!allow_non_constant)
7070 error ("mutable %qD is not usable in a constant expression", part);
7071 *non_constant_p = true;
7073 if (*non_constant_p)
7075 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole), i, field, value)
7080 if (TREE_CODE (TREE_TYPE (whole)) == UNION_TYPE
7081 && CONSTRUCTOR_NELTS (whole) > 0)
7083 /* DR 1188 says we don't have to deal with this. */
7084 if (!allow_non_constant)
7085 error ("accessing %qD member instead of initialized %qD member in "
7086 "constant expression", part, CONSTRUCTOR_ELT (whole, 0)->index);
7087 *non_constant_p = true;
7091 /* If there's no explicit init for this field, it's value-initialized. */
7092 value = build_value_init (TREE_TYPE (t), tf_warning_or_error);
7093 return cxx_eval_constant_expression (call, value,
7094 allow_non_constant, addr,
7095 non_constant_p, overflow_p);
7098 /* Subroutine of cxx_eval_constant_expression.
7099 Attempt to reduce a field access of a value of class type that is
7100 expressed as a BIT_FIELD_REF. */
7103 cxx_eval_bit_field_ref (const constexpr_call *call, tree t,
7104 bool allow_non_constant, bool addr,
7105 bool *non_constant_p, bool *overflow_p)
7107 tree orig_whole = TREE_OPERAND (t, 0);
7108 tree retval, fldval, utype, mask;
7109 bool fld_seen = false;
7110 HOST_WIDE_INT istart, isize;
7111 tree whole = cxx_eval_constant_expression (call, orig_whole,
7112 allow_non_constant, addr,
7113 non_constant_p, overflow_p);
7114 tree start, field, value;
7115 unsigned HOST_WIDE_INT i;
7117 if (whole == orig_whole)
7119 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
7121 if (!*non_constant_p && TREE_CODE (whole) != CONSTRUCTOR)
7123 if (!allow_non_constant)
7124 error ("%qE is not a constant expression", orig_whole);
7125 *non_constant_p = true;
7127 if (*non_constant_p)
7130 start = TREE_OPERAND (t, 2);
7131 istart = tree_low_cst (start, 0);
7132 isize = tree_low_cst (TREE_OPERAND (t, 1), 0);
7133 utype = TREE_TYPE (t);
7134 if (!TYPE_UNSIGNED (utype))
7135 utype = build_nonstandard_integer_type (TYPE_PRECISION (utype), 1);
7136 retval = build_int_cst (utype, 0);
7137 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole), i, field, value)
7139 tree bitpos = bit_position (field);
7140 if (bitpos == start && DECL_SIZE (field) == TREE_OPERAND (t, 1))
7142 if (TREE_CODE (TREE_TYPE (field)) == INTEGER_TYPE
7143 && TREE_CODE (value) == INTEGER_CST
7144 && host_integerp (bitpos, 0)
7145 && host_integerp (DECL_SIZE (field), 0))
7147 HOST_WIDE_INT bit = tree_low_cst (bitpos, 0);
7148 HOST_WIDE_INT sz = tree_low_cst (DECL_SIZE (field), 0);
7149 HOST_WIDE_INT shift;
7150 if (bit >= istart && bit + sz <= istart + isize)
7152 fldval = fold_convert (utype, value);
7153 mask = build_int_cst_type (utype, -1);
7154 mask = fold_build2 (LSHIFT_EXPR, utype, mask,
7155 size_int (TYPE_PRECISION (utype) - sz));
7156 mask = fold_build2 (RSHIFT_EXPR, utype, mask,
7157 size_int (TYPE_PRECISION (utype) - sz));
7158 fldval = fold_build2 (BIT_AND_EXPR, utype, fldval, mask);
7159 shift = bit - istart;
7160 if (BYTES_BIG_ENDIAN)
7161 shift = TYPE_PRECISION (utype) - shift - sz;
7162 fldval = fold_build2 (LSHIFT_EXPR, utype, fldval,
7164 retval = fold_build2 (BIT_IOR_EXPR, utype, retval, fldval);
7170 return fold_convert (TREE_TYPE (t), retval);
7172 return error_mark_node;
7175 /* Subroutine of cxx_eval_constant_expression.
7176 Evaluate a short-circuited logical expression T in the context
7177 of a given constexpr CALL. BAILOUT_VALUE is the value for
7178 early return. CONTINUE_VALUE is used here purely for
7179 sanity check purposes. */
7182 cxx_eval_logical_expression (const constexpr_call *call, tree t,
7183 tree bailout_value, tree continue_value,
7184 bool allow_non_constant, bool addr,
7185 bool *non_constant_p, bool *overflow_p)
7188 tree lhs = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
7189 allow_non_constant, addr,
7190 non_constant_p, overflow_p);
7191 VERIFY_CONSTANT (lhs);
7192 if (tree_int_cst_equal (lhs, bailout_value))
7194 gcc_assert (tree_int_cst_equal (lhs, continue_value));
7195 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
7196 allow_non_constant, addr, non_constant_p, overflow_p);
7197 VERIFY_CONSTANT (r);
7201 /* REF is a COMPONENT_REF designating a particular field. V is a vector of
7202 CONSTRUCTOR elements to initialize (part of) an object containing that
7203 field. Return a pointer to the constructor_elt corresponding to the
7204 initialization of the field. */
7206 static constructor_elt *
7207 base_field_constructor_elt (vec<constructor_elt, va_gc> *v, tree ref)
7209 tree aggr = TREE_OPERAND (ref, 0);
7210 tree field = TREE_OPERAND (ref, 1);
7212 constructor_elt *ce;
7214 gcc_assert (TREE_CODE (ref) == COMPONENT_REF);
7216 if (TREE_CODE (aggr) == COMPONENT_REF)
7218 constructor_elt *base_ce
7219 = base_field_constructor_elt (v, aggr);
7220 v = CONSTRUCTOR_ELTS (base_ce->value);
7223 for (i = 0; vec_safe_iterate (v, i, &ce); ++i)
7224 if (ce->index == field)
7231 /* Subroutine of cxx_eval_constant_expression.
7232 The expression tree T denotes a C-style array or a C-style
7233 aggregate. Reduce it to a constant expression. */
7236 cxx_eval_bare_aggregate (const constexpr_call *call, tree t,
7237 bool allow_non_constant, bool addr,
7238 bool *non_constant_p, bool *overflow_p)
7240 vec<constructor_elt, va_gc> *v = CONSTRUCTOR_ELTS (t);
7241 vec<constructor_elt, va_gc> *n;
7242 vec_alloc (n, vec_safe_length (v));
7243 constructor_elt *ce;
7245 bool changed = false;
7246 gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (t));
7247 for (i = 0; vec_safe_iterate (v, i, &ce); ++i)
7249 tree elt = cxx_eval_constant_expression (call, ce->value,
7250 allow_non_constant, addr,
7251 non_constant_p, overflow_p);
7252 /* Don't VERIFY_CONSTANT here. */
7253 if (allow_non_constant && *non_constant_p)
7255 if (elt != ce->value)
7257 if (ce->index && TREE_CODE (ce->index) == COMPONENT_REF)
7259 /* This is an initialization of a vfield inside a base
7260 subaggregate that we already initialized; push this
7261 initialization into the previous initialization. */
7262 constructor_elt *inner = base_field_constructor_elt (n, ce->index);
7265 else if (ce->index && TREE_CODE (ce->index) == NOP_EXPR)
7267 /* This is an initializer for an empty base; now that we've
7268 checked that it's constant, we can ignore it. */
7269 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (ce->index))));
7272 CONSTRUCTOR_APPEND_ELT (n, ce->index, elt);
7274 if (*non_constant_p || !changed)
7280 t = build_constructor (TREE_TYPE (t), n);
7281 TREE_CONSTANT (t) = true;
7282 if (TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
7287 /* Subroutine of cxx_eval_constant_expression.
7288 The expression tree T is a VEC_INIT_EXPR which denotes the desired
7289 initialization of a non-static data member of array type. Reduce it to a
7292 Note that apart from value-initialization (when VALUE_INIT is true),
7293 this is only intended to support value-initialization and the
7294 initializations done by defaulted constructors for classes with
7295 non-static data members of array type. In this case, VEC_INIT_EXPR_INIT
7296 will either be NULL_TREE for the default constructor, or a COMPONENT_REF
7297 for the copy/move constructor. */
7300 cxx_eval_vec_init_1 (const constexpr_call *call, tree atype, tree init,
7301 bool value_init, bool allow_non_constant, bool addr,
7302 bool *non_constant_p, bool *overflow_p)
7304 tree elttype = TREE_TYPE (atype);
7305 int max = tree_low_cst (array_type_nelts (atype), 0);
7306 vec<constructor_elt, va_gc> *n;
7307 vec_alloc (n, max + 1);
7308 bool pre_init = false;
7311 /* For the default constructor, build up a call to the default
7312 constructor of the element type. We only need to handle class types
7313 here, as for a constructor to be constexpr, all members must be
7314 initialized, which for a defaulted default constructor means they must
7315 be of a class type with a constexpr default constructor. */
7316 if (TREE_CODE (elttype) == ARRAY_TYPE)
7317 /* We only do this at the lowest level. */;
7318 else if (value_init)
7320 init = build_value_init (elttype, tf_warning_or_error);
7321 init = cxx_eval_constant_expression
7322 (call, init, allow_non_constant, addr, non_constant_p, overflow_p);
7327 vec<tree, va_gc> *argvec = make_tree_vector ();
7328 init = build_special_member_call (NULL_TREE, complete_ctor_identifier,
7329 &argvec, elttype, LOOKUP_NORMAL,
7330 tf_warning_or_error);
7331 release_tree_vector (argvec);
7332 init = cxx_eval_constant_expression (call, init, allow_non_constant,
7333 addr, non_constant_p, overflow_p);
7337 if (*non_constant_p && !allow_non_constant)
7340 for (i = 0; i <= max; ++i)
7342 tree idx = build_int_cst (size_type_node, i);
7344 if (TREE_CODE (elttype) == ARRAY_TYPE)
7346 /* A multidimensional array; recurse. */
7347 if (value_init || init == NULL_TREE)
7348 eltinit = NULL_TREE;
7350 eltinit = cp_build_array_ref (input_location, init, idx,
7351 tf_warning_or_error);
7352 eltinit = cxx_eval_vec_init_1 (call, elttype, eltinit, value_init,
7353 allow_non_constant, addr,
7354 non_constant_p, overflow_p);
7358 /* Initializing an element using value or default initialization
7359 we just pre-built above. */
7363 eltinit = unshare_expr (init);
7367 /* Copying an element. */
7368 vec<tree, va_gc> *argvec;
7369 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7370 (atype, TREE_TYPE (init)));
7371 eltinit = cp_build_array_ref (input_location, init, idx,
7372 tf_warning_or_error);
7373 if (!real_lvalue_p (init))
7374 eltinit = move (eltinit);
7375 argvec = make_tree_vector ();
7376 argvec->quick_push (eltinit);
7377 eltinit = (build_special_member_call
7378 (NULL_TREE, complete_ctor_identifier, &argvec,
7379 elttype, LOOKUP_NORMAL, tf_warning_or_error));
7380 release_tree_vector (argvec);
7381 eltinit = cxx_eval_constant_expression
7382 (call, eltinit, allow_non_constant, addr, non_constant_p, overflow_p);
7384 if (*non_constant_p && !allow_non_constant)
7386 CONSTRUCTOR_APPEND_ELT (n, idx, eltinit);
7389 if (!*non_constant_p)
7391 init = build_constructor (atype, n);
7392 TREE_CONSTANT (init) = true;
7402 cxx_eval_vec_init (const constexpr_call *call, tree t,
7403 bool allow_non_constant, bool addr,
7404 bool *non_constant_p, bool *overflow_p)
7406 tree atype = TREE_TYPE (t);
7407 tree init = VEC_INIT_EXPR_INIT (t);
7408 tree r = cxx_eval_vec_init_1 (call, atype, init,
7409 VEC_INIT_EXPR_VALUE_INIT (t),
7410 allow_non_constant, addr, non_constant_p, overflow_p);
7411 if (*non_constant_p)
7417 /* A less strict version of fold_indirect_ref_1, which requires cv-quals to
7418 match. We want to be less strict for simple *& folding; if we have a
7419 non-const temporary that we access through a const pointer, that should
7420 work. We handle this here rather than change fold_indirect_ref_1
7421 because we're dealing with things like ADDR_EXPR of INTEGER_CST which
7422 don't really make sense outside of constant expression evaluation. Also
7423 we want to allow folding to COMPONENT_REF, which could cause trouble
7424 with TBAA in fold_indirect_ref_1.
7426 Try to keep this function synced with fold_indirect_ref_1. */
7429 cxx_fold_indirect_ref (location_t loc, tree type, tree op0, bool *empty_base)
7435 subtype = TREE_TYPE (sub);
7436 if (!POINTER_TYPE_P (subtype))
7439 if (TREE_CODE (sub) == ADDR_EXPR)
7441 tree op = TREE_OPERAND (sub, 0);
7442 tree optype = TREE_TYPE (op);
7444 /* *&CONST_DECL -> to the value of the const decl. */
7445 if (TREE_CODE (op) == CONST_DECL)
7446 return DECL_INITIAL (op);
7447 /* *&p => p; make sure to handle *&"str"[cst] here. */
7448 if (same_type_ignoring_top_level_qualifiers_p (optype, type))
7450 tree fop = fold_read_from_constant_string (op);
7456 /* *(foo *)&fooarray => fooarray[0] */
7457 else if (TREE_CODE (optype) == ARRAY_TYPE
7458 && (same_type_ignoring_top_level_qualifiers_p
7459 (type, TREE_TYPE (optype))))
7461 tree type_domain = TYPE_DOMAIN (optype);
7462 tree min_val = size_zero_node;
7463 if (type_domain && TYPE_MIN_VALUE (type_domain))
7464 min_val = TYPE_MIN_VALUE (type_domain);
7465 return build4_loc (loc, ARRAY_REF, type, op, min_val,
7466 NULL_TREE, NULL_TREE);
7468 /* *(foo *)&complexfoo => __real__ complexfoo */
7469 else if (TREE_CODE (optype) == COMPLEX_TYPE
7470 && (same_type_ignoring_top_level_qualifiers_p
7471 (type, TREE_TYPE (optype))))
7472 return fold_build1_loc (loc, REALPART_EXPR, type, op);
7473 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
7474 else if (TREE_CODE (optype) == VECTOR_TYPE
7475 && (same_type_ignoring_top_level_qualifiers_p
7476 (type, TREE_TYPE (optype))))
7478 tree part_width = TYPE_SIZE (type);
7479 tree index = bitsize_int (0);
7480 return fold_build3_loc (loc, BIT_FIELD_REF, type, op, part_width, index);
7482 /* Also handle conversion to an empty base class, which
7483 is represented with a NOP_EXPR. */
7484 else if (is_empty_class (type)
7485 && CLASS_TYPE_P (optype)
7486 && DERIVED_FROM_P (type, optype))
7491 /* *(foo *)&struct_with_foo_field => COMPONENT_REF */
7492 else if (RECORD_OR_UNION_TYPE_P (optype))
7494 tree field = TYPE_FIELDS (optype);
7495 for (; field; field = DECL_CHAIN (field))
7496 if (TREE_CODE (field) == FIELD_DECL
7497 && integer_zerop (byte_position (field))
7498 && (same_type_ignoring_top_level_qualifiers_p
7499 (TREE_TYPE (field), type)))
7501 return fold_build3 (COMPONENT_REF, type, op, field, NULL_TREE);
7506 else if (TREE_CODE (sub) == POINTER_PLUS_EXPR
7507 && TREE_CODE (TREE_OPERAND (sub, 1)) == INTEGER_CST)
7509 tree op00 = TREE_OPERAND (sub, 0);
7510 tree op01 = TREE_OPERAND (sub, 1);
7513 if (TREE_CODE (op00) == ADDR_EXPR)
7516 op00 = TREE_OPERAND (op00, 0);
7517 op00type = TREE_TYPE (op00);
7519 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
7520 if (TREE_CODE (op00type) == VECTOR_TYPE
7521 && (same_type_ignoring_top_level_qualifiers_p
7522 (type, TREE_TYPE (op00type))))
7524 HOST_WIDE_INT offset = tree_low_cst (op01, 0);
7525 tree part_width = TYPE_SIZE (type);
7526 unsigned HOST_WIDE_INT part_widthi = tree_low_cst (part_width, 0)/BITS_PER_UNIT;
7527 unsigned HOST_WIDE_INT indexi = offset * BITS_PER_UNIT;
7528 tree index = bitsize_int (indexi);
7530 if (offset/part_widthi <= TYPE_VECTOR_SUBPARTS (op00type))
7531 return fold_build3_loc (loc,
7532 BIT_FIELD_REF, type, op00,
7536 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
7537 else if (TREE_CODE (op00type) == COMPLEX_TYPE
7538 && (same_type_ignoring_top_level_qualifiers_p
7539 (type, TREE_TYPE (op00type))))
7541 tree size = TYPE_SIZE_UNIT (type);
7542 if (tree_int_cst_equal (size, op01))
7543 return fold_build1_loc (loc, IMAGPART_EXPR, type, op00);
7545 /* ((foo *)&fooarray)[1] => fooarray[1] */
7546 else if (TREE_CODE (op00type) == ARRAY_TYPE
7547 && (same_type_ignoring_top_level_qualifiers_p
7548 (type, TREE_TYPE (op00type))))
7550 tree type_domain = TYPE_DOMAIN (op00type);
7551 tree min_val = size_zero_node;
7552 if (type_domain && TYPE_MIN_VALUE (type_domain))
7553 min_val = TYPE_MIN_VALUE (type_domain);
7554 op01 = size_binop_loc (loc, EXACT_DIV_EXPR, op01,
7555 TYPE_SIZE_UNIT (type));
7556 op01 = size_binop_loc (loc, PLUS_EXPR, op01, min_val);
7557 return build4_loc (loc, ARRAY_REF, type, op00, op01,
7558 NULL_TREE, NULL_TREE);
7560 /* Also handle conversion to an empty base class, which
7561 is represented with a NOP_EXPR. */
7562 else if (is_empty_class (type)
7563 && CLASS_TYPE_P (op00type)
7564 && DERIVED_FROM_P (type, op00type))
7569 /* ((foo *)&struct_with_foo_field)[1] => COMPONENT_REF */
7570 else if (RECORD_OR_UNION_TYPE_P (op00type))
7572 tree field = TYPE_FIELDS (op00type);
7573 for (; field; field = DECL_CHAIN (field))
7574 if (TREE_CODE (field) == FIELD_DECL
7575 && tree_int_cst_equal (byte_position (field), op01)
7576 && (same_type_ignoring_top_level_qualifiers_p
7577 (TREE_TYPE (field), type)))
7579 return fold_build3 (COMPONENT_REF, type, op00,
7586 /* *(foo *)fooarrptreturn> (*fooarrptr)[0] */
7587 else if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
7588 && (same_type_ignoring_top_level_qualifiers_p
7589 (type, TREE_TYPE (TREE_TYPE (subtype)))))
7592 tree min_val = size_zero_node;
7593 sub = cxx_fold_indirect_ref (loc, TREE_TYPE (subtype), sub, NULL);
7595 sub = build1_loc (loc, INDIRECT_REF, TREE_TYPE (subtype), sub);
7596 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
7597 if (type_domain && TYPE_MIN_VALUE (type_domain))
7598 min_val = TYPE_MIN_VALUE (type_domain);
7599 return build4_loc (loc, ARRAY_REF, type, sub, min_val, NULL_TREE,
7607 cxx_eval_indirect_ref (const constexpr_call *call, tree t,
7608 bool allow_non_constant, bool addr,
7609 bool *non_constant_p, bool *overflow_p)
7611 tree orig_op0 = TREE_OPERAND (t, 0);
7612 tree op0 = cxx_eval_constant_expression (call, orig_op0, allow_non_constant,
7613 /*addr*/false, non_constant_p, overflow_p);
7614 bool empty_base = false;
7617 /* Don't VERIFY_CONSTANT here. */
7618 if (*non_constant_p)
7621 r = cxx_fold_indirect_ref (EXPR_LOCATION (t), TREE_TYPE (t), op0,
7625 r = cxx_eval_constant_expression (call, r, allow_non_constant,
7626 addr, non_constant_p, overflow_p);
7631 if (TREE_CODE (sub) == POINTER_PLUS_EXPR)
7633 sub = TREE_OPERAND (sub, 0);
7636 if (TREE_CODE (sub) == ADDR_EXPR)
7638 /* We couldn't fold to a constant value. Make sure it's not
7639 something we should have been able to fold. */
7640 gcc_assert (!same_type_ignoring_top_level_qualifiers_p
7641 (TREE_TYPE (TREE_TYPE (sub)), TREE_TYPE (t)));
7642 /* DR 1188 says we don't have to deal with this. */
7643 if (!allow_non_constant)
7644 error ("accessing value of %qE through a %qT glvalue in a "
7645 "constant expression", build_fold_indirect_ref (sub),
7647 *non_constant_p = true;
7652 /* If we're pulling out the value of an empty base, make sure
7653 that the whole object is constant and then return an empty
7657 VERIFY_CONSTANT (r);
7658 r = build_constructor (TREE_TYPE (t), NULL);
7659 TREE_CONSTANT (r) = true;
7665 VERIFY_CONSTANT (t);
7671 /* Complain about R, a VAR_DECL, not being usable in a constant expression.
7672 Shared between potential_constant_expression and
7673 cxx_eval_constant_expression. */
7676 non_const_var_error (tree r)
7678 tree type = TREE_TYPE (r);
7679 error ("the value of %qD is not usable in a constant "
7681 /* Avoid error cascade. */
7682 if (DECL_INITIAL (r) == error_mark_node)
7684 if (DECL_DECLARED_CONSTEXPR_P (r))
7685 inform (DECL_SOURCE_LOCATION (r),
7686 "%qD used in its own initializer", r);
7687 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type))
7689 if (!CP_TYPE_CONST_P (type))
7690 inform (DECL_SOURCE_LOCATION (r),
7691 "%q#D is not const", r);
7692 else if (CP_TYPE_VOLATILE_P (type))
7693 inform (DECL_SOURCE_LOCATION (r),
7694 "%q#D is volatile", r);
7695 else if (!DECL_INITIAL (r)
7696 || !TREE_CONSTANT (DECL_INITIAL (r)))
7697 inform (DECL_SOURCE_LOCATION (r),
7698 "%qD was not initialized with a constant "
7705 if (cxx_dialect >= cxx0x && !DECL_DECLARED_CONSTEXPR_P (r))
7706 inform (DECL_SOURCE_LOCATION (r),
7707 "%qD was not declared %<constexpr%>", r);
7709 inform (DECL_SOURCE_LOCATION (r),
7710 "%qD does not have integral or enumeration type",
7715 /* Evaluate VEC_PERM_EXPR (v1, v2, mask). */
7717 cxx_eval_vec_perm_expr (const constexpr_call *call, tree t,
7718 bool allow_non_constant, bool addr,
7719 bool *non_constant_p, bool *overflow_p)
7724 tree elttype = TREE_TYPE (t);
7726 for (i = 0; i < 3; i++)
7728 args[i] = cxx_eval_constant_expression (call, TREE_OPERAND (t, i),
7729 allow_non_constant, addr,
7730 non_constant_p, overflow_p);
7731 if (*non_constant_p)
7735 gcc_assert (TREE_CODE (TREE_TYPE (args[0])) == VECTOR_TYPE);
7736 gcc_assert (TREE_CODE (TREE_TYPE (args[1])) == VECTOR_TYPE);
7737 gcc_assert (TREE_CODE (TREE_TYPE (args[2])) == VECTOR_TYPE);
7739 val = fold_ternary_loc (EXPR_LOCATION (t), VEC_PERM_EXPR, elttype,
7740 args[0], args[1], args[2]);
7741 if (val != NULL_TREE)
7748 /* Attempt to reduce the expression T to a constant value.
7749 On failure, issue diagnostic and return error_mark_node. */
7750 /* FIXME unify with c_fully_fold */
7753 cxx_eval_constant_expression (const constexpr_call *call, tree t,
7754 bool allow_non_constant, bool addr,
7755 bool *non_constant_p, bool *overflow_p)
7759 if (t == error_mark_node)
7761 *non_constant_p = true;
7764 if (CONSTANT_CLASS_P (t))
7766 if (TREE_CODE (t) == PTRMEM_CST)
7767 t = cplus_expand_constant (t);
7768 else if (TREE_OVERFLOW (t) && (!flag_permissive || allow_non_constant))
7772 if (TREE_CODE (t) != NOP_EXPR
7773 && reduced_constant_expression_p (t))
7776 switch (TREE_CODE (t))
7781 /* else fall through. */
7783 r = integral_constant_value (t);
7784 if (TREE_CODE (r) == TARGET_EXPR
7785 && TREE_CODE (TARGET_EXPR_INITIAL (r)) == CONSTRUCTOR)
7786 r = TARGET_EXPR_INITIAL (r);
7789 if (!allow_non_constant)
7790 non_const_var_error (r);
7791 *non_constant_p = true;
7801 if (call && DECL_CONTEXT (t) == call->fundef->decl)
7803 if (DECL_ARTIFICIAL (t) && DECL_CONSTRUCTOR_P (DECL_CONTEXT (t)))
7805 if (!allow_non_constant)
7806 sorry ("use of the value of the object being constructed "
7807 "in a constant expression");
7808 *non_constant_p = true;
7811 r = lookup_parameter_binding (call, t);
7814 /* Defer in case this is only used for its type. */;
7817 if (!allow_non_constant)
7818 error ("%qE is not a constant expression", t);
7819 *non_constant_p = true;
7824 case AGGR_INIT_EXPR:
7825 r = cxx_eval_call_expression (call, t, allow_non_constant, addr,
7826 non_constant_p, overflow_p);
7830 if (!literal_type_p (TREE_TYPE (t)))
7832 if (!allow_non_constant)
7834 error ("temporary of non-literal type %qT in a "
7835 "constant expression", TREE_TYPE (t));
7836 explain_non_literal_class (TREE_TYPE (t));
7838 *non_constant_p = true;
7841 /* else fall through. */
7843 /* Pass false for 'addr' because these codes indicate
7844 initialization of a temporary. */
7845 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
7846 allow_non_constant, false,
7847 non_constant_p, overflow_p);
7848 if (!*non_constant_p)
7849 /* Adjust the type of the result to the type of the temporary. */
7850 r = adjust_temp_type (TREE_TYPE (t), r);
7854 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
7855 allow_non_constant, addr,
7856 non_constant_p, overflow_p);
7860 case NON_LVALUE_EXPR:
7861 case TRY_CATCH_EXPR:
7862 case CLEANUP_POINT_EXPR:
7863 case MUST_NOT_THROW_EXPR:
7865 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
7866 allow_non_constant, addr,
7867 non_constant_p, overflow_p);
7870 /* These differ from cxx_eval_unary_expression in that this doesn't
7871 check for a constant operand or result; an address can be
7872 constant without its operand being, and vice versa. */
7874 r = cxx_eval_indirect_ref (call, t, allow_non_constant, addr,
7875 non_constant_p, overflow_p);
7880 tree oldop = TREE_OPERAND (t, 0);
7881 tree op = cxx_eval_constant_expression (call, oldop,
7884 non_constant_p, overflow_p);
7885 /* Don't VERIFY_CONSTANT here. */
7886 if (*non_constant_p)
7888 /* This function does more aggressive folding than fold itself. */
7889 r = build_fold_addr_expr_with_type (op, TREE_TYPE (t));
7890 if (TREE_CODE (r) == ADDR_EXPR && TREE_OPERAND (r, 0) == oldop)
7898 case FIX_TRUNC_EXPR:
7903 case TRUTH_NOT_EXPR:
7904 case FIXED_CONVERT_EXPR:
7905 r = cxx_eval_unary_expression (call, t, allow_non_constant, addr,
7906 non_constant_p, overflow_p);
7910 if (SIZEOF_EXPR_TYPE_P (t))
7911 r = cxx_sizeof_or_alignof_type (TREE_TYPE (TREE_OPERAND (t, 0)),
7912 SIZEOF_EXPR, false);
7913 else if (TYPE_P (TREE_OPERAND (t, 0)))
7914 r = cxx_sizeof_or_alignof_type (TREE_OPERAND (t, 0), SIZEOF_EXPR,
7917 r = cxx_sizeof_or_alignof_expr (TREE_OPERAND (t, 0), SIZEOF_EXPR,
7919 if (r == error_mark_node)
7921 VERIFY_CONSTANT (r);
7926 /* check_return_expr sometimes wraps a TARGET_EXPR in a
7927 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
7928 introduced by build_call_a. */
7929 tree op0 = TREE_OPERAND (t, 0);
7930 tree op1 = TREE_OPERAND (t, 1);
7932 if ((TREE_CODE (op0) == TARGET_EXPR && op1 == TARGET_EXPR_SLOT (op0))
7933 || TREE_CODE (op1) == EMPTY_CLASS_EXPR)
7934 r = cxx_eval_constant_expression (call, op0, allow_non_constant,
7935 addr, non_constant_p, overflow_p);
7938 /* Check that the LHS is constant and then discard it. */
7939 cxx_eval_constant_expression (call, op0, allow_non_constant,
7940 false, non_constant_p, overflow_p);
7941 op1 = TREE_OPERAND (t, 1);
7942 r = cxx_eval_constant_expression (call, op1, allow_non_constant,
7943 addr, non_constant_p, overflow_p);
7948 case POINTER_PLUS_EXPR:
7952 case TRUNC_DIV_EXPR:
7954 case FLOOR_DIV_EXPR:
7955 case ROUND_DIV_EXPR:
7956 case TRUNC_MOD_EXPR:
7958 case ROUND_MOD_EXPR:
7960 case EXACT_DIV_EXPR:
7970 case TRUTH_XOR_EXPR:
7977 case UNORDERED_EXPR:
7986 r = cxx_eval_binary_expression (call, t, allow_non_constant, addr,
7987 non_constant_p, overflow_p);
7990 /* fold can introduce non-IF versions of these; still treat them as
7991 short-circuiting. */
7992 case TRUTH_AND_EXPR:
7993 case TRUTH_ANDIF_EXPR:
7994 r = cxx_eval_logical_expression (call, t, boolean_false_node,
7996 allow_non_constant, addr,
7997 non_constant_p, overflow_p);
8001 case TRUTH_ORIF_EXPR:
8002 r = cxx_eval_logical_expression (call, t, boolean_true_node,
8004 allow_non_constant, addr,
8005 non_constant_p, overflow_p);
8009 r = cxx_eval_array_reference (call, t, allow_non_constant, addr,
8010 non_constant_p, overflow_p);
8014 r = cxx_eval_component_reference (call, t, allow_non_constant, addr,
8015 non_constant_p, overflow_p);
8019 r = cxx_eval_bit_field_ref (call, t, allow_non_constant, addr,
8020 non_constant_p, overflow_p);
8025 r = cxx_eval_conditional_expression (call, t, allow_non_constant, addr,
8026 non_constant_p, overflow_p);
8030 r = cxx_eval_bare_aggregate (call, t, allow_non_constant, addr,
8031 non_constant_p, overflow_p);
8035 /* We can get this in a defaulted constructor for a class with a
8036 non-static data member of array type. Either the initializer will
8037 be NULL, meaning default-initialization, or it will be an lvalue
8038 or xvalue of the same type, meaning direct-initialization from the
8039 corresponding member. */
8040 r = cxx_eval_vec_init (call, t, allow_non_constant, addr,
8041 non_constant_p, overflow_p);
8045 r = cxx_eval_vec_perm_expr (call, t, allow_non_constant, addr,
8046 non_constant_p, overflow_p);
8050 case VIEW_CONVERT_EXPR:
8053 tree oldop = TREE_OPERAND (t, 0);
8054 tree op = cxx_eval_constant_expression (call, oldop,
8055 allow_non_constant, addr,
8056 non_constant_p, overflow_p);
8057 if (*non_constant_p)
8060 /* We didn't fold at the top so we could check for ptr-int
8063 r = fold_build1 (TREE_CODE (t), TREE_TYPE (t), op);
8064 /* Conversion of an out-of-range value has implementation-defined
8065 behavior; the language considers it different from arithmetic
8066 overflow, which is undefined. */
8067 if (TREE_OVERFLOW_P (r) && !TREE_OVERFLOW_P (op))
8068 TREE_OVERFLOW (r) = false;
8072 case EMPTY_CLASS_EXPR:
8073 /* This is good enough for a function argument that might not get
8074 used, and they can't do anything with it, so just return it. */
8078 case PREINCREMENT_EXPR:
8079 case POSTINCREMENT_EXPR:
8080 case PREDECREMENT_EXPR:
8081 case POSTDECREMENT_EXPR:
8085 case VEC_DELETE_EXPR:
8089 /* GCC internal stuff. */
8092 case WITH_CLEANUP_EXPR:
8093 case STATEMENT_LIST:
8095 case NON_DEPENDENT_EXPR:
8099 if (!allow_non_constant)
8100 error_at (EXPR_LOC_OR_HERE (t),
8101 "expression %qE is not a constant-expression", t);
8102 *non_constant_p = true;
8106 internal_error ("unexpected expression %qE of kind %s", t,
8107 tree_code_name[TREE_CODE (t)]);
8108 *non_constant_p = true;
8112 if (r == error_mark_node)
8113 *non_constant_p = true;
8115 if (*non_constant_p)
8122 cxx_eval_outermost_constant_expr (tree t, bool allow_non_constant)
8124 bool non_constant_p = false;
8125 bool overflow_p = false;
8126 tree r = cxx_eval_constant_expression (NULL, t, allow_non_constant,
8127 false, &non_constant_p, &overflow_p);
8129 verify_constant (r, allow_non_constant, &non_constant_p, &overflow_p);
8131 if (TREE_CODE (t) != CONSTRUCTOR
8132 && cp_has_mutable_p (TREE_TYPE (t)))
8134 /* We allow a mutable type if the original expression was a
8135 CONSTRUCTOR so that we can do aggregate initialization of
8136 constexpr variables. */
8137 if (!allow_non_constant)
8138 error ("%qT cannot be the type of a complete constant expression "
8139 "because it has mutable sub-objects", TREE_TYPE (t));
8140 non_constant_p = true;
8143 /* Technically we should check this for all subexpressions, but that
8144 runs into problems with our internal representation of pointer
8145 subtraction and the 5.19 rules are still in flux. */
8146 if (CONVERT_EXPR_CODE_P (TREE_CODE (r))
8147 && ARITHMETIC_TYPE_P (TREE_TYPE (r))
8148 && TREE_CODE (TREE_OPERAND (r, 0)) == ADDR_EXPR)
8150 if (!allow_non_constant)
8151 error ("conversion from pointer type %qT "
8152 "to arithmetic type %qT in a constant-expression",
8153 TREE_TYPE (TREE_OPERAND (r, 0)), TREE_TYPE (r));
8154 non_constant_p = true;
8157 if (!non_constant_p && overflow_p)
8158 non_constant_p = true;
8160 if (non_constant_p && !allow_non_constant)
8161 return error_mark_node;
8162 else if (non_constant_p && TREE_CONSTANT (r))
8164 /* This isn't actually constant, so unset TREE_CONSTANT. */
8167 else if (TREE_CODE (r) == CONSTRUCTOR)
8168 r = build1 (VIEW_CONVERT_EXPR, TREE_TYPE (r), r);
8170 r = build_nop (TREE_TYPE (r), r);
8171 TREE_CONSTANT (r) = false;
8173 else if (non_constant_p || r == t)
8176 if (TREE_CODE (r) == CONSTRUCTOR && CLASS_TYPE_P (TREE_TYPE (r)))
8178 if (TREE_CODE (t) == TARGET_EXPR
8179 && TARGET_EXPR_INITIAL (t) == r)
8183 r = get_target_expr (r);
8184 TREE_CONSTANT (r) = true;
8192 /* Returns true if T is a valid subexpression of a constant expression,
8193 even if it isn't itself a constant expression. */
8196 is_sub_constant_expr (tree t)
8198 bool non_constant_p = false;
8199 bool overflow_p = false;
8200 cxx_eval_constant_expression (NULL, t, true, false, &non_constant_p,
8202 return !non_constant_p && !overflow_p;
8205 /* If T represents a constant expression returns its reduced value.
8206 Otherwise return error_mark_node. If T is dependent, then
8210 cxx_constant_value (tree t)
8212 return cxx_eval_outermost_constant_expr (t, false);
8215 /* If T is a constant expression, returns its reduced value.
8216 Otherwise, if T does not have TREE_CONSTANT set, returns T.
8217 Otherwise, returns a version of T without TREE_CONSTANT. */
8220 maybe_constant_value (tree t)
8224 if (type_dependent_expression_p (t)
8225 || type_unknown_p (t)
8226 || BRACE_ENCLOSED_INITIALIZER_P (t)
8227 || !potential_constant_expression (t)
8228 || value_dependent_expression_p (t))
8230 if (TREE_OVERFLOW_P (t))
8232 t = build_nop (TREE_TYPE (t), t);
8233 TREE_CONSTANT (t) = false;
8238 r = cxx_eval_outermost_constant_expr (t, true);
8239 #ifdef ENABLE_CHECKING
8240 /* cp_tree_equal looks through NOPs, so allow them. */
8242 || CONVERT_EXPR_P (t)
8243 || (TREE_CONSTANT (t) && !TREE_CONSTANT (r))
8244 || !cp_tree_equal (r, t));
8249 /* Like maybe_constant_value, but returns a CONSTRUCTOR directly, rather
8250 than wrapped in a TARGET_EXPR. */
8253 maybe_constant_init (tree t)
8255 t = maybe_constant_value (t);
8256 if (TREE_CODE (t) == TARGET_EXPR)
8258 tree init = TARGET_EXPR_INITIAL (t);
8259 if (TREE_CODE (init) == CONSTRUCTOR)
8266 /* FIXME see ADDR_EXPR section in potential_constant_expression_1. */
8267 /* Return true if the object referred to by REF has automatic or thread
8270 enum { ck_ok, ck_bad, ck_unknown };
8272 check_automatic_or_tls (tree ref)
8274 enum machine_mode mode;
8275 HOST_WIDE_INT bitsize, bitpos;
8277 int volatilep = 0, unsignedp = 0;
8278 tree decl = get_inner_reference (ref, &bitsize, &bitpos, &offset,
8279 &mode, &unsignedp, &volatilep, false);
8282 /* If there isn't a decl in the middle, we don't know the linkage here,
8283 and this isn't a constant expression anyway. */
8286 dk = decl_storage_duration (decl);
8287 return (dk == dk_auto || dk == dk_thread) ? ck_bad : ck_ok;
8291 /* Return true if T denotes a potentially constant expression. Issue
8292 diagnostic as appropriate under control of FLAGS. If WANT_RVAL is true,
8293 an lvalue-rvalue conversion is implied.
8295 C++0x [expr.const] used to say
8297 6 An expression is a potential constant expression if it is
8298 a constant expression where all occurences of function
8299 parameters are replaced by arbitrary constant expressions
8300 of the appropriate type.
8302 2 A conditional expression is a constant expression unless it
8303 involves one of the following as a potentially evaluated
8304 subexpression (3.2), but subexpressions of logical AND (5.14),
8305 logical OR (5.15), and conditional (5.16) operations that are
8306 not evaluated are not considered. */
8309 potential_constant_expression_1 (tree t, bool want_rval, tsubst_flags_t flags)
8311 enum { any = false, rval = true };
8315 if (t == error_mark_node)
8319 if (TREE_THIS_VOLATILE (t))
8321 if (flags & tf_error)
8322 error ("expression %qE has side-effects", t);
8325 if (CONSTANT_CLASS_P (t))
8328 switch (TREE_CODE (t))
8334 case TEMPLATE_ID_EXPR:
8341 case TEMPLATE_PARM_INDEX:
8343 case IDENTIFIER_NODE:
8344 case USERDEF_LITERAL:
8345 /* We can see a FIELD_DECL in a pointer-to-member expression. */
8351 case AGGR_INIT_EXPR:
8353 /* -- an invocation of a function other than a constexpr function
8354 or a constexpr constructor. */
8356 tree fun = get_function_named_in_call (t);
8357 const int nargs = call_expr_nargs (t);
8360 if (is_overloaded_fn (fun))
8362 if (TREE_CODE (fun) == FUNCTION_DECL)
8364 if (builtin_valid_in_constant_expr_p (fun))
8366 if (!DECL_DECLARED_CONSTEXPR_P (fun)
8367 /* Allow any built-in function; if the expansion
8368 isn't constant, we'll deal with that then. */
8369 && !is_builtin_fn (fun))
8371 if (flags & tf_error)
8373 error_at (EXPR_LOC_OR_HERE (t),
8374 "call to non-constexpr function %qD", fun);
8375 explain_invalid_constexpr_fn (fun);
8379 /* A call to a non-static member function takes the address
8380 of the object as the first argument. But in a constant
8381 expression the address will be folded away, so look
8383 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun)
8384 && !DECL_CONSTRUCTOR_P (fun))
8386 tree x = get_nth_callarg (t, 0);
8387 if (is_this_parameter (x))
8389 if (DECL_CONSTRUCTOR_P (DECL_CONTEXT (x)))
8391 if (flags & tf_error)
8392 sorry ("calling a member function of the "
8393 "object being constructed in a constant "
8397 /* Otherwise OK. */;
8399 else if (!potential_constant_expression_1 (x, rval, flags))
8405 fun = get_first_fn (fun);
8406 /* Skip initial arguments to base constructors. */
8407 if (DECL_BASE_CONSTRUCTOR_P (fun))
8408 i = num_artificial_parms_for (fun);
8409 fun = DECL_ORIGIN (fun);
8413 if (potential_constant_expression_1 (fun, rval, flags))
8414 /* Might end up being a constant function pointer. */;
8418 for (; i < nargs; ++i)
8420 tree x = get_nth_callarg (t, i);
8421 if (!potential_constant_expression_1 (x, rval, flags))
8427 case NON_LVALUE_EXPR:
8428 /* -- an lvalue-to-rvalue conversion (4.1) unless it is applied to
8429 -- an lvalue of integral type that refers to a non-volatile
8430 const variable or static data member initialized with
8431 constant expressions, or
8433 -- an lvalue of literal type that refers to non-volatile
8434 object defined with constexpr, or that refers to a
8435 sub-object of such an object; */
8436 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval, flags);
8439 if (want_rval && !decl_constant_var_p (t)
8440 && !dependent_type_p (TREE_TYPE (t)))
8442 if (flags & tf_error)
8443 non_const_var_error (t);
8450 case VIEW_CONVERT_EXPR:
8451 /* -- a reinterpret_cast. FIXME not implemented, and this rule
8452 may change to something more specific to type-punning (DR 1312). */
8454 tree from = TREE_OPERAND (t, 0);
8455 return (potential_constant_expression_1
8456 (from, TREE_CODE (t) != VIEW_CONVERT_EXPR, flags));
8460 /* -- a unary operator & that is applied to an lvalue that
8461 designates an object with thread or automatic storage
8463 t = TREE_OPERAND (t, 0);
8465 /* FIXME adjust when issue 1197 is fully resolved. For now don't do
8466 any checking here, as we might dereference the pointer later. If
8467 we remove this code, also remove check_automatic_or_tls. */
8468 i = check_automatic_or_tls (t);
8473 if (flags & tf_error)
8474 error ("address-of an object %qE with thread local or "
8475 "automatic storage is not a constant expression", t);
8479 return potential_constant_expression_1 (t, any, flags);
8485 /* -- a class member access unless its postfix-expression is
8486 of literal type or of pointer to literal type. */
8487 /* This test would be redundant, as it follows from the
8488 postfix-expression being a potential constant expression. */
8489 return potential_constant_expression_1 (TREE_OPERAND (t, 0),
8492 case EXPR_PACK_EXPANSION:
8493 return potential_constant_expression_1 (PACK_EXPANSION_PATTERN (t),
8498 tree x = TREE_OPERAND (t, 0);
8500 if (is_this_parameter (x))
8502 if (DECL_CONTEXT (x)
8503 && !DECL_DECLARED_CONSTEXPR_P (DECL_CONTEXT (x)))
8505 if (flags & tf_error)
8506 error ("use of %<this%> in a constant expression");
8509 if (want_rval && DECL_CONTEXT (x)
8510 && DECL_CONSTRUCTOR_P (DECL_CONTEXT (x)))
8512 if (flags & tf_error)
8513 sorry ("use of the value of the object being constructed "
8514 "in a constant expression");
8519 return potential_constant_expression_1 (x, rval, flags);
8523 case DYNAMIC_CAST_EXPR:
8524 case PSEUDO_DTOR_EXPR:
8525 case PREINCREMENT_EXPR:
8526 case POSTINCREMENT_EXPR:
8527 case PREDECREMENT_EXPR:
8528 case POSTDECREMENT_EXPR:
8532 case VEC_DELETE_EXPR:
8536 /* GCC internal stuff. */
8539 case WITH_CLEANUP_EXPR:
8540 case CLEANUP_POINT_EXPR:
8541 case MUST_NOT_THROW_EXPR:
8542 case TRY_CATCH_EXPR:
8543 case STATEMENT_LIST:
8544 /* Don't bother trying to define a subset of statement-expressions to
8545 be constant-expressions, at least for now. */
8549 case TRANSACTION_EXPR:
8554 if (flags & tf_error)
8555 error ("expression %qE is not a constant-expression", t);
8559 /* -- a typeid expression whose operand is of polymorphic
8562 tree e = TREE_OPERAND (t, 0);
8563 if (!TYPE_P (e) && !type_dependent_expression_p (e)
8564 && TYPE_POLYMORPHIC_P (TREE_TYPE (e)))
8566 if (flags & tf_error)
8567 error ("typeid-expression is not a constant expression "
8568 "because %qE is of polymorphic type", e);
8575 /* -- a subtraction where both operands are pointers. */
8576 if (TYPE_PTR_P (TREE_OPERAND (t, 0))
8577 && TYPE_PTR_P (TREE_OPERAND (t, 1)))
8579 if (flags & tf_error)
8580 error ("difference of two pointer expressions is not "
8581 "a constant expression");
8593 /* -- a relational or equality operator where at least
8594 one of the operands is a pointer. */
8595 if (TYPE_PTR_P (TREE_OPERAND (t, 0))
8596 || TYPE_PTR_P (TREE_OPERAND (t, 1)))
8598 if (flags & tf_error)
8599 error ("pointer comparison expression is not a "
8600 "constant expression");
8608 if (TYPE_P (TREE_OPERAND (t, 0)))
8610 /* else fall through. */
8616 case FIX_TRUNC_EXPR:
8620 case TRUTH_NOT_EXPR:
8621 case FIXED_CONVERT_EXPR:
8622 case UNARY_PLUS_EXPR:
8623 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval,
8627 case CONST_CAST_EXPR:
8628 case STATIC_CAST_EXPR:
8629 case REINTERPRET_CAST_EXPR:
8630 case IMPLICIT_CONV_EXPR:
8631 if (cxx_dialect < cxx0x
8632 && !dependent_type_p (TREE_TYPE (t))
8633 && !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t)))
8634 /* In C++98, a conversion to non-integral type can't be part of a
8635 constant expression. */
8637 if (flags & tf_error)
8638 error ("cast to non-integral type %qT in a constant expression",
8643 return (potential_constant_expression_1
8644 (TREE_OPERAND (t, 0),
8645 TREE_CODE (TREE_TYPE (t)) != REFERENCE_TYPE, flags));
8648 case NON_DEPENDENT_EXPR:
8649 /* For convenience. */
8651 return potential_constant_expression_1 (TREE_OPERAND (t, 0),
8655 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
8659 if (!literal_type_p (TREE_TYPE (t)))
8661 if (flags & tf_error)
8663 error ("temporary of non-literal type %qT in a "
8664 "constant expression", TREE_TYPE (t));
8665 explain_non_literal_class (TREE_TYPE (t));
8670 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
8675 vec<constructor_elt, va_gc> *v = CONSTRUCTOR_ELTS (t);
8676 constructor_elt *ce;
8677 for (i = 0; vec_safe_iterate (v, i, &ce); ++i)
8678 if (!potential_constant_expression_1 (ce->value, want_rval, flags))
8685 gcc_assert (TREE_PURPOSE (t) == NULL_TREE
8686 || DECL_P (TREE_PURPOSE (t)));
8687 if (!potential_constant_expression_1 (TREE_VALUE (t), want_rval,
8690 if (TREE_CHAIN (t) == NULL_TREE)
8692 return potential_constant_expression_1 (TREE_CHAIN (t), want_rval,
8696 case TRUNC_DIV_EXPR:
8698 case FLOOR_DIV_EXPR:
8699 case ROUND_DIV_EXPR:
8700 case TRUNC_MOD_EXPR:
8702 case ROUND_MOD_EXPR:
8704 tree denom = TREE_OPERAND (t, 1);
8705 if (!potential_constant_expression_1 (denom, rval, flags))
8707 /* We can't call cxx_eval_outermost_constant_expr on an expression
8708 that hasn't been through fold_non_dependent_expr yet. */
8709 if (!processing_template_decl)
8710 denom = cxx_eval_outermost_constant_expr (denom, true);
8711 if (integer_zerop (denom))
8713 if (flags & tf_error)
8714 error ("division by zero is not a constant-expression");
8720 return potential_constant_expression_1 (TREE_OPERAND (t, 0),
8727 /* check_return_expr sometimes wraps a TARGET_EXPR in a
8728 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
8729 introduced by build_call_a. */
8730 tree op0 = TREE_OPERAND (t, 0);
8731 tree op1 = TREE_OPERAND (t, 1);
8733 if ((TREE_CODE (op0) == TARGET_EXPR && op1 == TARGET_EXPR_SLOT (op0))
8734 || TREE_CODE (op1) == EMPTY_CLASS_EXPR)
8735 return potential_constant_expression_1 (op0, want_rval, flags);
8740 /* If the first operand is the non-short-circuit constant, look at
8741 the second operand; otherwise we only care about the first one for
8743 case TRUTH_AND_EXPR:
8744 case TRUTH_ANDIF_EXPR:
8745 tmp = boolean_true_node;
8748 case TRUTH_ORIF_EXPR:
8749 tmp = boolean_false_node;
8752 tree op = TREE_OPERAND (t, 0);
8753 if (!potential_constant_expression_1 (op, rval, flags))
8755 if (!processing_template_decl)
8756 op = cxx_eval_outermost_constant_expr (op, true);
8757 if (tree_int_cst_equal (op, tmp))
8758 return potential_constant_expression_1 (TREE_OPERAND (t, 1), rval, flags);
8765 case POINTER_PLUS_EXPR:
8767 case EXACT_DIV_EXPR:
8777 case TRUTH_XOR_EXPR:
8778 case UNORDERED_EXPR:
8791 case ARRAY_RANGE_REF:
8795 for (i = 0; i < 2; ++i)
8796 if (!potential_constant_expression_1 (TREE_OPERAND (t, i),
8803 for (i = 0; i < 3; ++i)
8804 if (!potential_constant_expression_1 (TREE_OPERAND (t, i),
8811 /* If the condition is a known constant, we know which of the legs we
8812 care about; otherwise we only require that the condition and
8813 either of the legs be potentially constant. */
8814 tmp = TREE_OPERAND (t, 0);
8815 if (!potential_constant_expression_1 (tmp, rval, flags))
8817 if (!processing_template_decl)
8818 tmp = cxx_eval_outermost_constant_expr (tmp, true);
8819 if (integer_zerop (tmp))
8820 return potential_constant_expression_1 (TREE_OPERAND (t, 2),
8822 else if (TREE_CODE (tmp) == INTEGER_CST)
8823 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
8825 for (i = 1; i < 3; ++i)
8826 if (potential_constant_expression_1 (TREE_OPERAND (t, i),
8827 want_rval, tf_none))
8829 if (flags & tf_error)
8830 error ("expression %qE is not a constant-expression", t);
8834 if (VEC_INIT_EXPR_IS_CONSTEXPR (t))
8836 if (flags & tf_error)
8838 error ("non-constant array initialization");
8839 diagnose_non_constexpr_vec_init (t);
8844 if (objc_is_property_ref (t))
8847 sorry ("unexpected AST of kind %s", tree_code_name[TREE_CODE (t)]);
8853 /* The main entry point to the above. */
8856 potential_constant_expression (tree t)
8858 return potential_constant_expression_1 (t, false, tf_none);
8861 /* As above, but require a constant rvalue. */
8864 potential_rvalue_constant_expression (tree t)
8866 return potential_constant_expression_1 (t, true, tf_none);
8869 /* Like above, but complain about non-constant expressions. */
8872 require_potential_constant_expression (tree t)
8874 return potential_constant_expression_1 (t, false, tf_warning_or_error);
8877 /* Cross product of the above. */
8880 require_potential_rvalue_constant_expression (tree t)
8882 return potential_constant_expression_1 (t, true, tf_warning_or_error);
8885 /* Constructor for a lambda expression. */
8888 build_lambda_expr (void)
8890 tree lambda = make_node (LAMBDA_EXPR);
8891 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) = CPLD_NONE;
8892 LAMBDA_EXPR_CAPTURE_LIST (lambda) = NULL_TREE;
8893 LAMBDA_EXPR_THIS_CAPTURE (lambda) = NULL_TREE;
8894 LAMBDA_EXPR_PENDING_PROXIES (lambda) = NULL;
8895 LAMBDA_EXPR_RETURN_TYPE (lambda) = NULL_TREE;
8896 LAMBDA_EXPR_MUTABLE_P (lambda) = false;
8900 /* Create the closure object for a LAMBDA_EXPR. */
8903 build_lambda_object (tree lambda_expr)
8905 /* Build aggregate constructor call.
8906 - cp_parser_braced_list
8907 - cp_parser_functional_cast */
8908 vec<constructor_elt, va_gc> *elts = NULL;
8909 tree node, expr, type;
8910 location_t saved_loc;
8912 if (processing_template_decl)
8915 /* Make sure any error messages refer to the lambda-introducer. */
8916 saved_loc = input_location;
8917 input_location = LAMBDA_EXPR_LOCATION (lambda_expr);
8919 for (node = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr);
8921 node = TREE_CHAIN (node))
8923 tree field = TREE_PURPOSE (node);
8924 tree val = TREE_VALUE (node);
8926 if (field == error_mark_node)
8928 expr = error_mark_node;
8935 /* Mere mortals can't copy arrays with aggregate initialization, so
8936 do some magic to make it work here. */
8937 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE)
8938 val = build_array_copy (val);
8939 else if (DECL_NORMAL_CAPTURE_P (field)
8940 && TREE_CODE (TREE_TYPE (field)) != REFERENCE_TYPE)
8942 /* "the entities that are captured by copy are used to
8943 direct-initialize each corresponding non-static data
8944 member of the resulting closure object."
8946 There's normally no way to express direct-initialization
8947 from an element of a CONSTRUCTOR, so we build up a special
8948 TARGET_EXPR to bypass the usual copy-initialization. */
8949 val = force_rvalue (val, tf_warning_or_error);
8950 if (TREE_CODE (val) == TARGET_EXPR)
8951 TARGET_EXPR_DIRECT_INIT_P (val) = true;
8954 CONSTRUCTOR_APPEND_ELT (elts, DECL_NAME (field), val);
8957 expr = build_constructor (init_list_type_node, elts);
8958 CONSTRUCTOR_IS_DIRECT_INIT (expr) = 1;
8960 /* N2927: "[The closure] class type is not an aggregate."
8961 But we briefly treat it as an aggregate to make this simpler. */
8962 type = LAMBDA_EXPR_CLOSURE (lambda_expr);
8963 CLASSTYPE_NON_AGGREGATE (type) = 0;
8964 expr = finish_compound_literal (type, expr, tf_warning_or_error);
8965 CLASSTYPE_NON_AGGREGATE (type) = 1;
8968 input_location = saved_loc;
8972 /* Return an initialized RECORD_TYPE for LAMBDA.
8973 LAMBDA must have its explicit captures already. */
8976 begin_lambda_type (tree lambda)
8981 /* Unique name. This is just like an unnamed class, but we cannot use
8982 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
8984 name = make_lambda_name ();
8986 /* Create the new RECORD_TYPE for this lambda. */
8987 type = xref_tag (/*tag_code=*/record_type,
8989 /*scope=*/ts_lambda,
8990 /*template_header_p=*/false);
8993 /* Designate it as a struct so that we can use aggregate initialization. */
8994 CLASSTYPE_DECLARED_CLASS (type) = false;
8996 /* Cross-reference the expression and the type. */
8997 LAMBDA_EXPR_CLOSURE (lambda) = type;
8998 CLASSTYPE_LAMBDA_EXPR (type) = lambda;
9000 /* Clear base types. */
9001 xref_basetypes (type, /*bases=*/NULL_TREE);
9003 /* Start the class. */
9004 type = begin_class_definition (type);
9005 if (type == error_mark_node)
9006 return error_mark_node;
9011 /* Returns the type to use for the return type of the operator() of a
9015 lambda_return_type (tree expr)
9017 if (expr == NULL_TREE)
9018 return void_type_node;
9019 if (type_unknown_p (expr)
9020 || BRACE_ENCLOSED_INITIALIZER_P (expr))
9022 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
9023 return void_type_node;
9025 gcc_checking_assert (!type_dependent_expression_p (expr));
9026 return cv_unqualified (type_decays_to (unlowered_expr_type (expr)));
9029 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
9033 lambda_function (tree lambda)
9036 if (TREE_CODE (lambda) == LAMBDA_EXPR)
9037 type = LAMBDA_EXPR_CLOSURE (lambda);
9040 gcc_assert (LAMBDA_TYPE_P (type));
9041 /* Don't let debug_tree cause instantiation. */
9042 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type)
9043 && !COMPLETE_OR_OPEN_TYPE_P (type))
9045 lambda = lookup_member (type, ansi_opname (CALL_EXPR),
9046 /*protect=*/0, /*want_type=*/false,
9047 tf_warning_or_error);
9049 lambda = BASELINK_FUNCTIONS (lambda);
9053 /* Returns the type to use for the FIELD_DECL corresponding to the
9055 The caller should add REFERENCE_TYPE for capture by reference. */
9058 lambda_capture_field_type (tree expr)
9061 if (!TREE_TYPE (expr) || WILDCARD_TYPE_P (TREE_TYPE (expr)))
9063 type = cxx_make_type (DECLTYPE_TYPE);
9064 DECLTYPE_TYPE_EXPR (type) = expr;
9065 DECLTYPE_FOR_LAMBDA_CAPTURE (type) = true;
9066 SET_TYPE_STRUCTURAL_EQUALITY (type);
9069 type = non_reference (unlowered_expr_type (expr));
9073 /* Insert the deduced return type for an auto function. */
9076 apply_deduced_return_type (tree fco, tree return_type)
9080 if (return_type == error_mark_node)
9083 if (LAMBDA_FUNCTION_P (fco))
9085 tree lambda = CLASSTYPE_LAMBDA_EXPR (current_class_type);
9086 LAMBDA_EXPR_RETURN_TYPE (lambda) = return_type;
9089 if (DECL_CONV_FN_P (fco))
9090 DECL_NAME (fco) = mangle_conv_op_name_for_type (return_type);
9092 TREE_TYPE (fco) = change_return_type (return_type, TREE_TYPE (fco));
9094 result = DECL_RESULT (fco);
9095 if (result == NULL_TREE)
9097 if (TREE_TYPE (result) == return_type)
9100 /* We already have a DECL_RESULT from start_preparsed_function.
9101 Now we need to redo the work it and allocate_struct_function
9102 did to reflect the new type. */
9103 gcc_assert (current_function_decl == fco);
9104 result = build_decl (input_location, RESULT_DECL, NULL_TREE,
9105 TYPE_MAIN_VARIANT (return_type));
9106 DECL_ARTIFICIAL (result) = 1;
9107 DECL_IGNORED_P (result) = 1;
9108 cp_apply_type_quals_to_decl (cp_type_quals (return_type),
9111 DECL_RESULT (fco) = result;
9113 if (!processing_template_decl)
9115 bool aggr = aggregate_value_p (result, fco);
9116 #ifdef PCC_STATIC_STRUCT_RETURN
9117 cfun->returns_pcc_struct = aggr;
9119 cfun->returns_struct = aggr;
9124 /* DECL is a local variable or parameter from the surrounding scope of a
9125 lambda-expression. Returns the decltype for a use of the capture field
9126 for DECL even if it hasn't been captured yet. */
9129 capture_decltype (tree decl)
9131 tree lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
9132 /* FIXME do lookup instead of list walk? */
9133 tree cap = value_member (decl, LAMBDA_EXPR_CAPTURE_LIST (lam));
9137 type = TREE_TYPE (TREE_PURPOSE (cap));
9139 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam))
9142 error ("%qD is not captured", decl);
9143 return error_mark_node;
9146 type = TREE_TYPE (decl);
9147 if (TREE_CODE (type) == REFERENCE_TYPE
9148 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
9149 type = TREE_TYPE (type);
9152 case CPLD_REFERENCE:
9153 type = TREE_TYPE (decl);
9154 if (TREE_CODE (type) != REFERENCE_TYPE)
9155 type = build_reference_type (TREE_TYPE (decl));
9162 if (TREE_CODE (type) != REFERENCE_TYPE)
9164 if (!LAMBDA_EXPR_MUTABLE_P (lam))
9165 type = cp_build_qualified_type (type, (cp_type_quals (type)
9167 type = build_reference_type (type);
9172 /* Returns true iff DECL is a lambda capture proxy variable created by
9173 build_capture_proxy. */
9176 is_capture_proxy (tree decl)
9178 return (TREE_CODE (decl) == VAR_DECL
9179 && DECL_HAS_VALUE_EXPR_P (decl)
9180 && !DECL_ANON_UNION_VAR_P (decl)
9181 && LAMBDA_FUNCTION_P (DECL_CONTEXT (decl)));
9184 /* Returns true iff DECL is a capture proxy for a normal capture
9185 (i.e. without explicit initializer). */
9188 is_normal_capture_proxy (tree decl)
9190 if (!is_capture_proxy (decl))
9191 /* It's not a capture proxy. */
9194 /* It is a capture proxy, is it a normal capture? */
9195 tree val = DECL_VALUE_EXPR (decl);
9196 if (val == error_mark_node)
9199 gcc_assert (TREE_CODE (val) == COMPONENT_REF);
9200 val = TREE_OPERAND (val, 1);
9201 return DECL_NORMAL_CAPTURE_P (val);
9204 /* VAR is a capture proxy created by build_capture_proxy; add it to the
9205 current function, which is the operator() for the appropriate lambda. */
9208 insert_capture_proxy (tree var)
9210 cp_binding_level *b;
9214 /* Put the capture proxy in the extra body block so that it won't clash
9215 with a later local variable. */
9216 b = current_binding_level;
9217 for (skip = 0; ; ++skip)
9219 cp_binding_level *n = b->level_chain;
9220 if (n->kind == sk_function_parms)
9224 pushdecl_with_scope (var, b, false);
9226 /* And put a DECL_EXPR in the STATEMENT_LIST for the same block. */
9227 var = build_stmt (DECL_SOURCE_LOCATION (var), DECL_EXPR, var);
9228 stmt_list = (*stmt_list_stack)[stmt_list_stack->length () - 1 - skip];
9229 gcc_assert (stmt_list);
9230 append_to_statement_list_force (var, &stmt_list);
9233 /* We've just finished processing a lambda; if the containing scope is also
9234 a lambda, insert any capture proxies that were created while processing
9235 the nested lambda. */
9238 insert_pending_capture_proxies (void)
9241 vec<tree, va_gc> *proxies;
9244 if (!current_function_decl || !LAMBDA_FUNCTION_P (current_function_decl))
9247 lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
9248 proxies = LAMBDA_EXPR_PENDING_PROXIES (lam);
9249 for (i = 0; i < vec_safe_length (proxies); ++i)
9251 tree var = (*proxies)[i];
9252 insert_capture_proxy (var);
9254 release_tree_vector (LAMBDA_EXPR_PENDING_PROXIES (lam));
9255 LAMBDA_EXPR_PENDING_PROXIES (lam) = NULL;
9258 /* Given REF, a COMPONENT_REF designating a field in the lambda closure,
9259 return the type we want the proxy to have: the type of the field itself,
9260 with added const-qualification if the lambda isn't mutable and the
9261 capture is by value. */
9264 lambda_proxy_type (tree ref)
9267 if (REFERENCE_REF_P (ref))
9268 ref = TREE_OPERAND (ref, 0);
9269 type = TREE_TYPE (ref);
9270 if (type && !WILDCARD_TYPE_P (type))
9272 type = cxx_make_type (DECLTYPE_TYPE);
9273 DECLTYPE_TYPE_EXPR (type) = ref;
9274 DECLTYPE_FOR_LAMBDA_PROXY (type) = true;
9275 SET_TYPE_STRUCTURAL_EQUALITY (type);
9279 /* MEMBER is a capture field in a lambda closure class. Now that we're
9280 inside the operator(), build a placeholder var for future lookups and
9284 build_capture_proxy (tree member)
9286 tree var, object, fn, closure, name, lam, type;
9288 closure = DECL_CONTEXT (member);
9289 fn = lambda_function (closure);
9290 lam = CLASSTYPE_LAMBDA_EXPR (closure);
9292 /* The proxy variable forwards to the capture field. */
9293 object = build_fold_indirect_ref (DECL_ARGUMENTS (fn));
9294 object = finish_non_static_data_member (member, object, NULL_TREE);
9295 if (REFERENCE_REF_P (object))
9296 object = TREE_OPERAND (object, 0);
9298 /* Remove the __ inserted by add_capture. */
9299 name = get_identifier (IDENTIFIER_POINTER (DECL_NAME (member)) + 2);
9301 type = lambda_proxy_type (object);
9302 var = build_decl (input_location, VAR_DECL, name, type);
9303 SET_DECL_VALUE_EXPR (var, object);
9304 DECL_HAS_VALUE_EXPR_P (var) = 1;
9305 DECL_ARTIFICIAL (var) = 1;
9306 TREE_USED (var) = 1;
9307 DECL_CONTEXT (var) = fn;
9309 if (name == this_identifier)
9311 gcc_assert (LAMBDA_EXPR_THIS_CAPTURE (lam) == member);
9312 LAMBDA_EXPR_THIS_CAPTURE (lam) = var;
9315 if (fn == current_function_decl)
9316 insert_capture_proxy (var);
9318 vec_safe_push (LAMBDA_EXPR_PENDING_PROXIES (lam), var);
9323 /* From an ID and INITIALIZER, create a capture (by reference if
9324 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
9328 add_capture (tree lambda, tree id, tree initializer, bool by_reference_p,
9329 bool explicit_init_p)
9332 tree type, member, name;
9334 type = lambda_capture_field_type (initializer);
9337 type = build_reference_type (type);
9338 if (!real_lvalue_p (initializer))
9339 error ("cannot capture %qE by reference", initializer);
9342 /* Capture by copy requires a complete type. */
9343 type = complete_type (type);
9345 /* Add __ to the beginning of the field name so that user code
9346 won't find the field with name lookup. We can't just leave the name
9347 unset because template instantiation uses the name to find
9348 instantiated fields. */
9349 buf = (char *) alloca (IDENTIFIER_LENGTH (id) + 3);
9350 buf[1] = buf[0] = '_';
9351 memcpy (buf + 2, IDENTIFIER_POINTER (id),
9352 IDENTIFIER_LENGTH (id) + 1);
9353 name = get_identifier (buf);
9355 /* If TREE_TYPE isn't set, we're still in the introducer, so check
9357 if (!LAMBDA_EXPR_CLOSURE (lambda))
9359 if (IDENTIFIER_MARKED (name))
9361 pedwarn (input_location, 0,
9362 "already captured %qD in lambda expression", id);
9365 IDENTIFIER_MARKED (name) = true;
9368 /* Make member variable. */
9369 member = build_lang_decl (FIELD_DECL, name, type);
9371 if (!explicit_init_p)
9372 /* Normal captures are invisible to name lookup but uses are replaced
9373 with references to the capture field; we implement this by only
9374 really making them invisible in unevaluated context; see
9375 qualify_lookup. For now, let's make explicitly initialized captures
9377 DECL_NORMAL_CAPTURE_P (member) = true;
9379 if (id == this_identifier)
9380 LAMBDA_EXPR_THIS_CAPTURE (lambda) = member;
9382 /* Add it to the appropriate closure class if we've started it. */
9383 if (current_class_type
9384 && current_class_type == LAMBDA_EXPR_CLOSURE (lambda))
9385 finish_member_declaration (member);
9387 LAMBDA_EXPR_CAPTURE_LIST (lambda)
9388 = tree_cons (member, initializer, LAMBDA_EXPR_CAPTURE_LIST (lambda));
9390 if (LAMBDA_EXPR_CLOSURE (lambda))
9391 return build_capture_proxy (member);
9392 /* For explicit captures we haven't started the function yet, so we wait
9393 and build the proxy from cp_parser_lambda_body. */
9397 /* Register all the capture members on the list CAPTURES, which is the
9398 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
9401 register_capture_members (tree captures)
9403 if (captures == NULL_TREE)
9406 register_capture_members (TREE_CHAIN (captures));
9407 /* We set this in add_capture to avoid duplicates. */
9408 IDENTIFIER_MARKED (DECL_NAME (TREE_PURPOSE (captures))) = false;
9409 finish_member_declaration (TREE_PURPOSE (captures));
9412 /* Similar to add_capture, except this works on a stack of nested lambdas.
9413 BY_REFERENCE_P in this case is derived from the default capture mode.
9414 Returns the capture for the lambda at the bottom of the stack. */
9417 add_default_capture (tree lambda_stack, tree id, tree initializer)
9419 bool this_capture_p = (id == this_identifier);
9421 tree var = NULL_TREE;
9423 tree saved_class_type = current_class_type;
9427 for (node = lambda_stack;
9429 node = TREE_CHAIN (node))
9431 tree lambda = TREE_VALUE (node);
9433 current_class_type = LAMBDA_EXPR_CLOSURE (lambda);
9434 var = add_capture (lambda,
9439 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda)
9440 == CPLD_REFERENCE)),
9441 /*explicit_init_p=*/false);
9442 initializer = convert_from_reference (var);
9445 current_class_type = saved_class_type;
9450 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
9451 INDIRECT_REF, possibly adding it through default capturing. */
9454 lambda_expr_this_capture (tree lambda)
9458 tree this_capture = LAMBDA_EXPR_THIS_CAPTURE (lambda);
9460 /* In unevaluated context this isn't an odr-use, so just return the
9462 if (cp_unevaluated_operand)
9463 return lookup_name (this_identifier);
9465 /* Try to default capture 'this' if we can. */
9467 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) != CPLD_NONE)
9469 tree lambda_stack = NULL_TREE;
9470 tree init = NULL_TREE;
9472 /* If we are in a lambda function, we can move out until we hit:
9473 1. a non-lambda function or NSDMI,
9474 2. a lambda function capturing 'this', or
9475 3. a non-default capturing lambda function. */
9476 for (tree tlambda = lambda; ;)
9478 lambda_stack = tree_cons (NULL_TREE,
9482 if (LAMBDA_EXPR_EXTRA_SCOPE (tlambda)
9483 && TREE_CODE (LAMBDA_EXPR_EXTRA_SCOPE (tlambda)) == FIELD_DECL)
9485 /* In an NSDMI, we don't have a function to look up the decl in,
9486 but the fake 'this' pointer that we're using for parsing is
9488 init = scope_chain->x_current_class_ptr;
9490 (init && (TREE_TYPE (TREE_TYPE (init))
9491 == current_nonlambda_class_type ()));
9495 tree closure_decl = TYPE_NAME (LAMBDA_EXPR_CLOSURE (tlambda));
9496 tree containing_function = decl_function_context (closure_decl);
9498 if (containing_function == NULL_TREE)
9499 /* We ran out of scopes; there's no 'this' to capture. */
9502 if (!LAMBDA_FUNCTION_P (containing_function))
9504 /* We found a non-lambda function. */
9505 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function))
9506 /* First parameter is 'this'. */
9507 init = DECL_ARGUMENTS (containing_function);
9512 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function));
9514 if (LAMBDA_EXPR_THIS_CAPTURE (tlambda))
9516 /* An outer lambda has already captured 'this'. */
9517 init = LAMBDA_EXPR_THIS_CAPTURE (tlambda);
9521 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (tlambda) == CPLD_NONE)
9522 /* An outer lambda won't let us capture 'this'. */
9527 this_capture = add_default_capture (lambda_stack,
9528 /*id=*/this_identifier,
9534 error ("%<this%> was not captured for this lambda function");
9535 result = error_mark_node;
9539 /* To make sure that current_class_ref is for the lambda. */
9540 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref))
9541 == LAMBDA_EXPR_CLOSURE (lambda));
9543 result = this_capture;
9545 /* If 'this' is captured, each use of 'this' is transformed into an
9546 access to the corresponding unnamed data member of the closure
9547 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
9548 ensures that the transformed expression is an rvalue. ] */
9549 result = rvalue (result);
9555 /* We don't want to capture 'this' until we know we need it, i.e. after
9556 overload resolution has chosen a non-static member function. At that
9557 point we call this function to turn a dummy object into a use of the
9561 maybe_resolve_dummy (tree object)
9563 if (!is_dummy_object (object))
9566 tree type = TYPE_MAIN_VARIANT (TREE_TYPE (object));
9567 gcc_assert (TREE_CODE (type) != POINTER_TYPE);
9569 if (type != current_class_type
9570 && current_class_type
9571 && LAMBDA_TYPE_P (current_class_type)
9572 && DERIVED_FROM_P (type, current_nonlambda_class_type ()))
9574 /* In a lambda, need to go through 'this' capture. */
9575 tree lam = CLASSTYPE_LAMBDA_EXPR (current_class_type);
9576 tree cap = lambda_expr_this_capture (lam);
9577 object = build_x_indirect_ref (EXPR_LOCATION (object), cap,
9578 RO_NULL, tf_warning_or_error);
9584 /* Returns the method basetype of the innermost non-lambda function, or
9585 NULL_TREE if none. */
9588 nonlambda_method_basetype (void)
9591 if (!current_class_ref)
9594 type = current_class_type;
9595 if (!LAMBDA_TYPE_P (type))
9598 /* Find the nearest enclosing non-lambda function. */
9599 fn = TYPE_NAME (type);
9601 fn = decl_function_context (fn);
9602 while (fn && LAMBDA_FUNCTION_P (fn));
9604 if (!fn || !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
9607 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn));
9610 /* If the closure TYPE has a static op(), also add a conversion to function
9614 maybe_add_lambda_conv_op (tree type)
9616 bool nested = (current_function_decl != NULL_TREE);
9617 tree callop = lambda_function (type);
9618 tree rettype, name, fntype, fn, body, compound_stmt;
9619 tree thistype, stattype, statfn, convfn, call, arg;
9620 vec<tree, va_gc> *argvec;
9622 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type)) != NULL_TREE)
9625 if (processing_template_decl)
9628 stattype = build_function_type (TREE_TYPE (TREE_TYPE (callop)),
9629 FUNCTION_ARG_CHAIN (callop));
9631 /* First build up the conversion op. */
9633 rettype = build_pointer_type (stattype);
9634 name = mangle_conv_op_name_for_type (rettype);
9635 thistype = cp_build_qualified_type (type, TYPE_QUAL_CONST);
9636 fntype = build_method_type_directly (thistype, rettype, void_list_node);
9637 fn = convfn = build_lang_decl (FUNCTION_DECL, name, fntype);
9638 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
9640 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
9641 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
9642 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
9644 SET_OVERLOADED_OPERATOR_CODE (fn, TYPE_EXPR);
9645 grokclassfn (type, fn, NO_SPECIAL);
9646 set_linkage_according_to_type (type, fn);
9647 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
9648 DECL_IN_AGGR_P (fn) = 1;
9649 DECL_ARTIFICIAL (fn) = 1;
9650 DECL_NOT_REALLY_EXTERN (fn) = 1;
9651 DECL_DECLARED_INLINE_P (fn) = 1;
9652 DECL_ARGUMENTS (fn) = build_this_parm (fntype, TYPE_QUAL_CONST);
9654 DECL_INTERFACE_KNOWN (fn) = 1;
9656 add_method (type, fn, NULL_TREE);
9658 /* Generic thunk code fails for varargs; we'll complain in mark_used if
9659 the conversion op is used. */
9660 if (varargs_function_p (callop))
9662 DECL_DELETED_FN (fn) = 1;
9666 /* Now build up the thunk to be returned. */
9668 name = get_identifier ("_FUN");
9669 fn = statfn = build_lang_decl (FUNCTION_DECL, name, stattype);
9670 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
9671 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
9672 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
9673 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
9674 grokclassfn (type, fn, NO_SPECIAL);
9675 set_linkage_according_to_type (type, fn);
9676 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
9677 DECL_IN_AGGR_P (fn) = 1;
9678 DECL_ARTIFICIAL (fn) = 1;
9679 DECL_NOT_REALLY_EXTERN (fn) = 1;
9680 DECL_DECLARED_INLINE_P (fn) = 1;
9681 DECL_STATIC_FUNCTION_P (fn) = 1;
9682 DECL_ARGUMENTS (fn) = copy_list (DECL_CHAIN (DECL_ARGUMENTS (callop)));
9683 for (arg = DECL_ARGUMENTS (fn); arg; arg = DECL_CHAIN (arg))
9685 /* Avoid duplicate -Wshadow warnings. */
9686 DECL_NAME (arg) = NULL_TREE;
9687 DECL_CONTEXT (arg) = fn;
9690 DECL_INTERFACE_KNOWN (fn) = 1;
9692 add_method (type, fn, NULL_TREE);
9695 push_function_context ();
9697 /* Still increment function_depth so that we don't GC in the
9698 middle of an expression. */
9701 /* Generate the body of the thunk. */
9703 start_preparsed_function (statfn, NULL_TREE,
9704 SF_PRE_PARSED | SF_INCLASS_INLINE);
9705 if (DECL_ONE_ONLY (statfn))
9707 /* Put the thunk in the same comdat group as the call op. */
9708 symtab_add_to_same_comdat_group
9709 ((symtab_node) cgraph_get_create_node (statfn),
9710 (symtab_node) cgraph_get_create_node (callop));
9712 body = begin_function_body ();
9713 compound_stmt = begin_compound_stmt (0);
9715 arg = build1 (NOP_EXPR, TREE_TYPE (DECL_ARGUMENTS (callop)),
9717 argvec = make_tree_vector ();
9718 argvec->quick_push (arg);
9719 for (arg = DECL_ARGUMENTS (statfn); arg; arg = DECL_CHAIN (arg))
9721 mark_exp_read (arg);
9722 vec_safe_push (argvec, arg);
9724 call = build_call_a (callop, argvec->length (), argvec->address ());
9725 CALL_FROM_THUNK_P (call) = 1;
9726 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call)))
9727 call = build_cplus_new (TREE_TYPE (call), call, tf_warning_or_error);
9728 call = convert_from_reference (call);
9729 finish_return_stmt (call);
9731 finish_compound_stmt (compound_stmt);
9732 finish_function_body (body);
9734 expand_or_defer_fn (finish_function (2));
9736 /* Generate the body of the conversion op. */
9738 start_preparsed_function (convfn, NULL_TREE,
9739 SF_PRE_PARSED | SF_INCLASS_INLINE);
9740 body = begin_function_body ();
9741 compound_stmt = begin_compound_stmt (0);
9743 /* decl_needed_p needs to see that it's used. */
9744 TREE_USED (statfn) = 1;
9745 finish_return_stmt (decay_conversion (statfn, tf_warning_or_error));
9747 finish_compound_stmt (compound_stmt);
9748 finish_function_body (body);
9750 expand_or_defer_fn (finish_function (2));
9753 pop_function_context ();
9758 /* Returns true iff VAL is a lambda-related declaration which should
9759 be ignored by unqualified lookup. */
9762 is_lambda_ignored_entity (tree val)
9764 /* In unevaluated context, look past normal capture proxies. */
9765 if (cp_unevaluated_operand && is_normal_capture_proxy (val))
9768 /* Always ignore lambda fields, their names are only for debugging. */
9769 if (TREE_CODE (val) == FIELD_DECL
9770 && CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (val)))
9773 /* None of the lookups that use qualify_lookup want the op() from the
9774 lambda; they want the one from the enclosing class. */
9775 if (TREE_CODE (val) == FUNCTION_DECL && LAMBDA_FUNCTION_P (val))
9781 #include "gt-cp-semantics.h"