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 /* Save the current deferred access states and start deferred access
159 checking, continuing the set of deferred checks in CHECKS. */
162 reopen_deferring_access_checks (vec<deferred_access_check, va_gc> * checks)
164 push_deferring_access_checks (dk_deferred);
165 if (!deferred_access_no_check)
166 deferred_access_stack->last().deferred_access_checks = checks;
169 /* Resume deferring access checks again after we stopped doing
173 resume_deferring_access_checks (void)
175 if (!deferred_access_no_check)
176 deferred_access_stack->last().deferring_access_checks_kind = dk_deferred;
179 /* Stop deferring access checks. */
182 stop_deferring_access_checks (void)
184 if (!deferred_access_no_check)
185 deferred_access_stack->last().deferring_access_checks_kind = dk_no_deferred;
188 /* Discard the current deferred access checks and restore the
192 pop_deferring_access_checks (void)
194 if (deferred_access_no_check)
195 deferred_access_no_check--;
197 deferred_access_stack->pop ();
200 /* Returns a TREE_LIST representing the deferred checks.
201 The TREE_PURPOSE of each node is the type through which the
202 access occurred; the TREE_VALUE is the declaration named.
205 vec<deferred_access_check, va_gc> *
206 get_deferred_access_checks (void)
208 if (deferred_access_no_check)
211 return (deferred_access_stack->last().deferred_access_checks);
214 /* Take current deferred checks and combine with the
215 previous states if we also defer checks previously.
216 Otherwise perform checks now. */
219 pop_to_parent_deferring_access_checks (void)
221 if (deferred_access_no_check)
222 deferred_access_no_check--;
225 vec<deferred_access_check, va_gc> *checks;
226 deferred_access *ptr;
228 checks = (deferred_access_stack->last ().deferred_access_checks);
230 deferred_access_stack->pop ();
231 ptr = &deferred_access_stack->last ();
232 if (ptr->deferring_access_checks_kind == dk_no_deferred)
235 perform_access_checks (checks, tf_warning_or_error);
239 /* Merge with parent. */
241 deferred_access_check *chk, *probe;
243 FOR_EACH_VEC_SAFE_ELT (checks, i, chk)
245 FOR_EACH_VEC_SAFE_ELT (ptr->deferred_access_checks, j, probe)
247 if (probe->binfo == chk->binfo &&
248 probe->decl == chk->decl &&
249 probe->diag_decl == chk->diag_decl)
252 /* Insert into parent's checks. */
253 vec_safe_push (ptr->deferred_access_checks, *chk);
260 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
261 is the BINFO indicating the qualifying scope used to access the
262 DECL node stored in the TREE_VALUE of the node. If CHECKS is empty
263 or we aren't in SFINAE context or all the checks succeed return TRUE,
267 perform_access_checks (vec<deferred_access_check, va_gc> *checks,
268 tsubst_flags_t complain)
271 deferred_access_check *chk;
272 location_t loc = input_location;
278 FOR_EACH_VEC_SAFE_ELT (checks, i, chk)
280 input_location = chk->loc;
281 ok &= enforce_access (chk->binfo, chk->decl, chk->diag_decl, complain);
284 input_location = loc;
285 return (complain & tf_error) ? true : ok;
288 /* Perform the deferred access checks.
290 After performing the checks, we still have to keep the list
291 `deferred_access_stack->deferred_access_checks' since we may want
292 to check access for them again later in a different context.
299 A::X A::a, x; // No error for `A::a', error for `x'
301 We have to perform deferred access of `A::X', first with `A::a',
302 next with `x'. Return value like perform_access_checks above. */
305 perform_deferred_access_checks (tsubst_flags_t complain)
307 return perform_access_checks (get_deferred_access_checks (), complain);
310 /* Defer checking the accessibility of DECL, when looked up in
311 BINFO. DIAG_DECL is the declaration to use to print diagnostics.
312 Return value like perform_access_checks above. */
315 perform_or_defer_access_check (tree binfo, tree decl, tree diag_decl,
316 tsubst_flags_t complain)
319 deferred_access *ptr;
320 deferred_access_check *chk;
323 /* Exit if we are in a context that no access checking is performed.
325 if (deferred_access_no_check)
328 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
330 ptr = &deferred_access_stack->last ();
332 /* If we are not supposed to defer access checks, just check now. */
333 if (ptr->deferring_access_checks_kind == dk_no_deferred)
335 bool ok = enforce_access (binfo, decl, diag_decl, complain);
336 return (complain & tf_error) ? true : ok;
339 /* See if we are already going to perform this check. */
340 FOR_EACH_VEC_SAFE_ELT (ptr->deferred_access_checks, i, chk)
342 if (chk->decl == decl && chk->binfo == binfo &&
343 chk->diag_decl == diag_decl)
348 /* If not, record the check. */
349 deferred_access_check new_access = {binfo, decl, diag_decl, input_location};
350 vec_safe_push (ptr->deferred_access_checks, new_access);
355 /* Returns nonzero if the current statement is a full expression,
356 i.e. temporaries created during that statement should be destroyed
357 at the end of the statement. */
360 stmts_are_full_exprs_p (void)
362 return current_stmt_tree ()->stmts_are_full_exprs_p;
365 /* T is a statement. Add it to the statement-tree. This is the C++
366 version. The C/ObjC frontends have a slightly different version of
372 enum tree_code code = TREE_CODE (t);
374 if (EXPR_P (t) && code != LABEL_EXPR)
376 if (!EXPR_HAS_LOCATION (t))
377 SET_EXPR_LOCATION (t, input_location);
379 /* When we expand a statement-tree, we must know whether or not the
380 statements are full-expressions. We record that fact here. */
381 STMT_IS_FULL_EXPR_P (t) = stmts_are_full_exprs_p ();
384 /* Add T to the statement-tree. Non-side-effect statements need to be
385 recorded during statement expressions. */
386 gcc_checking_assert (!stmt_list_stack->is_empty ());
387 append_to_statement_list_force (t, &cur_stmt_list);
392 /* Returns the stmt_tree to which statements are currently being added. */
395 current_stmt_tree (void)
398 ? &cfun->language->base.x_stmt_tree
399 : &scope_chain->x_stmt_tree);
402 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
405 maybe_cleanup_point_expr (tree expr)
407 if (!processing_template_decl && stmts_are_full_exprs_p ())
408 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
412 /* Like maybe_cleanup_point_expr except have the type of the new expression be
413 void so we don't need to create a temporary variable to hold the inner
414 expression. The reason why we do this is because the original type might be
415 an aggregate and we cannot create a temporary variable for that type. */
418 maybe_cleanup_point_expr_void (tree expr)
420 if (!processing_template_decl && stmts_are_full_exprs_p ())
421 expr = fold_build_cleanup_point_expr (void_type_node, expr);
427 /* Create a declaration statement for the declaration given by the DECL. */
430 add_decl_expr (tree decl)
432 tree r = build_stmt (input_location, DECL_EXPR, decl);
433 if (DECL_INITIAL (decl)
434 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
435 r = maybe_cleanup_point_expr_void (r);
439 /* Finish a scope. */
442 do_poplevel (tree stmt_list)
446 if (stmts_are_full_exprs_p ())
447 block = poplevel (kept_level_p (), 1, 0);
449 stmt_list = pop_stmt_list (stmt_list);
451 if (!processing_template_decl)
453 stmt_list = c_build_bind_expr (input_location, block, stmt_list);
454 /* ??? See c_end_compound_stmt re statement expressions. */
460 /* Begin a new scope. */
463 do_pushlevel (scope_kind sk)
465 tree ret = push_stmt_list ();
466 if (stmts_are_full_exprs_p ())
467 begin_scope (sk, NULL);
471 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
472 when the current scope is exited. EH_ONLY is true when this is not
473 meant to apply to normal control flow transfer. */
476 push_cleanup (tree decl, tree cleanup, bool eh_only)
478 tree stmt = build_stmt (input_location, CLEANUP_STMT, NULL, cleanup, decl);
479 CLEANUP_EH_ONLY (stmt) = eh_only;
481 CLEANUP_BODY (stmt) = push_stmt_list ();
484 /* Begin a conditional that might contain a declaration. When generating
485 normal code, we want the declaration to appear before the statement
486 containing the conditional. When generating template code, we want the
487 conditional to be rendered as the raw DECL_EXPR. */
490 begin_cond (tree *cond_p)
492 if (processing_template_decl)
493 *cond_p = push_stmt_list ();
496 /* Finish such a conditional. */
499 finish_cond (tree *cond_p, tree expr)
501 if (processing_template_decl)
503 tree cond = pop_stmt_list (*cond_p);
505 if (expr == NULL_TREE)
506 /* Empty condition in 'for'. */
507 gcc_assert (empty_expr_stmt_p (cond));
508 else if (check_for_bare_parameter_packs (expr))
509 expr = error_mark_node;
510 else if (!empty_expr_stmt_p (cond))
511 expr = build2 (COMPOUND_EXPR, TREE_TYPE (expr), cond, expr);
516 /* If *COND_P specifies a conditional with a declaration, transform the
519 for (; A x = 42;) { }
521 while (true) { A x = 42; if (!x) break; }
522 for (;;) { A x = 42; if (!x) break; }
523 The statement list for BODY will be empty if the conditional did
524 not declare anything. */
527 simplify_loop_decl_cond (tree *cond_p, tree body)
531 if (!TREE_SIDE_EFFECTS (body))
535 *cond_p = boolean_true_node;
537 if_stmt = begin_if_stmt ();
538 cond = cp_build_unary_op (TRUTH_NOT_EXPR, cond, 0, tf_warning_or_error);
539 finish_if_stmt_cond (cond, if_stmt);
540 finish_break_stmt ();
541 finish_then_clause (if_stmt);
542 finish_if_stmt (if_stmt);
545 /* Finish a goto-statement. */
548 finish_goto_stmt (tree destination)
550 if (identifier_p (destination))
551 destination = lookup_label (destination);
553 /* We warn about unused labels with -Wunused. That means we have to
554 mark the used labels as used. */
555 if (TREE_CODE (destination) == LABEL_DECL)
556 TREE_USED (destination) = 1;
559 destination = mark_rvalue_use (destination);
560 if (!processing_template_decl)
562 destination = cp_convert (ptr_type_node, destination,
563 tf_warning_or_error);
564 if (error_operand_p (destination))
567 = fold_build_cleanup_point_expr (TREE_TYPE (destination),
572 check_goto (destination);
574 return add_stmt (build_stmt (input_location, GOTO_EXPR, destination));
577 /* COND is the condition-expression for an if, while, etc.,
578 statement. Convert it to a boolean value, if appropriate.
579 In addition, verify sequence points if -Wsequence-point is enabled. */
582 maybe_convert_cond (tree cond)
584 /* Empty conditions remain empty. */
588 /* Wait until we instantiate templates before doing conversion. */
589 if (processing_template_decl)
592 if (warn_sequence_point)
593 verify_sequence_points (cond);
595 /* Do the conversion. */
596 cond = convert_from_reference (cond);
598 if (TREE_CODE (cond) == MODIFY_EXPR
599 && !TREE_NO_WARNING (cond)
602 warning (OPT_Wparentheses,
603 "suggest parentheses around assignment used as truth value");
604 TREE_NO_WARNING (cond) = 1;
607 return condition_conversion (cond);
610 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
613 finish_expr_stmt (tree expr)
617 if (expr != NULL_TREE)
619 if (!processing_template_decl)
621 if (warn_sequence_point)
622 verify_sequence_points (expr);
623 expr = convert_to_void (expr, ICV_STATEMENT, tf_warning_or_error);
625 else if (!type_dependent_expression_p (expr))
626 convert_to_void (build_non_dependent_expr (expr), ICV_STATEMENT,
627 tf_warning_or_error);
629 if (check_for_bare_parameter_packs (expr))
630 expr = error_mark_node;
632 /* Simplification of inner statement expressions, compound exprs,
633 etc can result in us already having an EXPR_STMT. */
634 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
636 if (TREE_CODE (expr) != EXPR_STMT)
637 expr = build_stmt (input_location, EXPR_STMT, expr);
638 expr = maybe_cleanup_point_expr_void (expr);
648 /* Begin an if-statement. Returns a newly created IF_STMT if
655 scope = do_pushlevel (sk_cond);
656 r = build_stmt (input_location, IF_STMT, NULL_TREE,
657 NULL_TREE, NULL_TREE, scope);
658 begin_cond (&IF_COND (r));
662 /* Process the COND of an if-statement, which may be given by
666 finish_if_stmt_cond (tree cond, tree if_stmt)
668 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
670 THEN_CLAUSE (if_stmt) = push_stmt_list ();
673 /* Finish the then-clause of an if-statement, which may be given by
677 finish_then_clause (tree if_stmt)
679 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
683 /* Begin the else-clause of an if-statement. */
686 begin_else_clause (tree if_stmt)
688 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
691 /* Finish the else-clause of an if-statement, which may be given by
695 finish_else_clause (tree if_stmt)
697 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
700 /* Finish an if-statement. */
703 finish_if_stmt (tree if_stmt)
705 tree scope = IF_SCOPE (if_stmt);
706 IF_SCOPE (if_stmt) = NULL;
707 add_stmt (do_poplevel (scope));
710 /* Begin a while-statement. Returns a newly created WHILE_STMT if
714 begin_while_stmt (void)
717 r = build_stmt (input_location, WHILE_STMT, NULL_TREE, NULL_TREE);
719 WHILE_BODY (r) = do_pushlevel (sk_block);
720 begin_cond (&WHILE_COND (r));
724 /* Process the COND of a while-statement, which may be given by
728 finish_while_stmt_cond (tree cond, tree while_stmt)
730 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
731 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
734 /* Finish a while-statement, which may be given by WHILE_STMT. */
737 finish_while_stmt (tree while_stmt)
739 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
742 /* Begin a do-statement. Returns a newly created DO_STMT if
748 tree r = build_stmt (input_location, DO_STMT, NULL_TREE, NULL_TREE);
750 DO_BODY (r) = push_stmt_list ();
754 /* Finish the body of a do-statement, which may be given by DO_STMT. */
757 finish_do_body (tree do_stmt)
759 tree body = DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
761 if (TREE_CODE (body) == STATEMENT_LIST && STATEMENT_LIST_TAIL (body))
762 body = STATEMENT_LIST_TAIL (body)->stmt;
764 if (IS_EMPTY_STMT (body))
765 warning (OPT_Wempty_body,
766 "suggest explicit braces around empty body in %<do%> statement");
769 /* Finish a do-statement, which may be given by DO_STMT, and whose
770 COND is as indicated. */
773 finish_do_stmt (tree cond, tree do_stmt)
775 cond = maybe_convert_cond (cond);
776 DO_COND (do_stmt) = cond;
779 /* Finish a return-statement. The EXPRESSION returned, if any, is as
783 finish_return_stmt (tree expr)
788 expr = check_return_expr (expr, &no_warning);
790 if (error_operand_p (expr)
791 || (flag_openmp && !check_omp_return ()))
792 return error_mark_node;
793 if (!processing_template_decl)
795 if (warn_sequence_point)
796 verify_sequence_points (expr);
798 if (DECL_DESTRUCTOR_P (current_function_decl)
799 || (DECL_CONSTRUCTOR_P (current_function_decl)
800 && targetm.cxx.cdtor_returns_this ()))
802 /* Similarly, all destructors must run destructors for
803 base-classes before returning. So, all returns in a
804 destructor get sent to the DTOR_LABEL; finish_function emits
805 code to return a value there. */
806 return finish_goto_stmt (cdtor_label);
810 r = build_stmt (input_location, RETURN_EXPR, expr);
811 TREE_NO_WARNING (r) |= no_warning;
812 r = maybe_cleanup_point_expr_void (r);
818 /* Begin the scope of a for-statement or a range-for-statement.
819 Both the returned trees are to be used in a call to
820 begin_for_stmt or begin_range_for_stmt. */
823 begin_for_scope (tree *init)
825 tree scope = NULL_TREE;
826 if (flag_new_for_scope > 0)
827 scope = do_pushlevel (sk_for);
829 if (processing_template_decl)
830 *init = push_stmt_list ();
837 /* Begin a for-statement. Returns a new FOR_STMT.
838 SCOPE and INIT should be the return of begin_for_scope,
842 begin_for_stmt (tree scope, tree init)
846 r = build_stmt (input_location, FOR_STMT, NULL_TREE, NULL_TREE,
847 NULL_TREE, NULL_TREE, NULL_TREE);
849 if (scope == NULL_TREE)
851 gcc_assert (!init || !(flag_new_for_scope > 0));
853 scope = begin_for_scope (&init);
855 FOR_INIT_STMT (r) = init;
856 FOR_SCOPE (r) = scope;
861 /* Finish the for-init-statement of a for-statement, which may be
862 given by FOR_STMT. */
865 finish_for_init_stmt (tree for_stmt)
867 if (processing_template_decl)
868 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
870 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
871 begin_cond (&FOR_COND (for_stmt));
874 /* Finish the COND of a for-statement, which may be given by
878 finish_for_cond (tree cond, tree for_stmt)
880 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
881 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
884 /* Finish the increment-EXPRESSION in a for-statement, which may be
885 given by FOR_STMT. */
888 finish_for_expr (tree expr, tree for_stmt)
892 /* If EXPR is an overloaded function, issue an error; there is no
893 context available to use to perform overload resolution. */
894 if (type_unknown_p (expr))
896 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
897 expr = error_mark_node;
899 if (!processing_template_decl)
901 if (warn_sequence_point)
902 verify_sequence_points (expr);
903 expr = convert_to_void (expr, ICV_THIRD_IN_FOR,
904 tf_warning_or_error);
906 else if (!type_dependent_expression_p (expr))
907 convert_to_void (build_non_dependent_expr (expr), ICV_THIRD_IN_FOR,
908 tf_warning_or_error);
909 expr = maybe_cleanup_point_expr_void (expr);
910 if (check_for_bare_parameter_packs (expr))
911 expr = error_mark_node;
912 FOR_EXPR (for_stmt) = expr;
915 /* Finish the body of a for-statement, which may be given by
916 FOR_STMT. The increment-EXPR for the loop must be
918 It can also finish RANGE_FOR_STMT. */
921 finish_for_stmt (tree for_stmt)
923 if (TREE_CODE (for_stmt) == RANGE_FOR_STMT)
924 RANGE_FOR_BODY (for_stmt) = do_poplevel (RANGE_FOR_BODY (for_stmt));
926 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
928 /* Pop the scope for the body of the loop. */
929 if (flag_new_for_scope > 0)
932 tree *scope_ptr = (TREE_CODE (for_stmt) == RANGE_FOR_STMT
933 ? &RANGE_FOR_SCOPE (for_stmt)
934 : &FOR_SCOPE (for_stmt));
937 add_stmt (do_poplevel (scope));
941 /* Begin a range-for-statement. Returns a new RANGE_FOR_STMT.
942 SCOPE and INIT should be the return of begin_for_scope,
944 To finish it call finish_for_stmt(). */
947 begin_range_for_stmt (tree scope, tree init)
951 r = build_stmt (input_location, RANGE_FOR_STMT,
952 NULL_TREE, NULL_TREE, NULL_TREE, NULL_TREE);
954 if (scope == NULL_TREE)
956 gcc_assert (!init || !(flag_new_for_scope > 0));
958 scope = begin_for_scope (&init);
961 /* RANGE_FOR_STMTs do not use nor save the init tree, so we
964 pop_stmt_list (init);
965 RANGE_FOR_SCOPE (r) = scope;
970 /* Finish the head of a range-based for statement, which may
971 be given by RANGE_FOR_STMT. DECL must be the declaration
972 and EXPR must be the loop expression. */
975 finish_range_for_decl (tree range_for_stmt, tree decl, tree expr)
977 RANGE_FOR_DECL (range_for_stmt) = decl;
978 RANGE_FOR_EXPR (range_for_stmt) = expr;
979 add_stmt (range_for_stmt);
980 RANGE_FOR_BODY (range_for_stmt) = do_pushlevel (sk_block);
983 /* Finish a break-statement. */
986 finish_break_stmt (void)
988 /* In switch statements break is sometimes stylistically used after
989 a return statement. This can lead to spurious warnings about
990 control reaching the end of a non-void function when it is
991 inlined. Note that we are calling block_may_fallthru with
992 language specific tree nodes; this works because
993 block_may_fallthru returns true when given something it does not
995 if (!block_may_fallthru (cur_stmt_list))
996 return void_zero_node;
997 return add_stmt (build_stmt (input_location, BREAK_STMT));
1000 /* Finish a continue-statement. */
1003 finish_continue_stmt (void)
1005 return add_stmt (build_stmt (input_location, CONTINUE_STMT));
1008 /* Begin a switch-statement. Returns a new SWITCH_STMT if
1012 begin_switch_stmt (void)
1016 scope = do_pushlevel (sk_cond);
1017 r = build_stmt (input_location, SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE, scope);
1019 begin_cond (&SWITCH_STMT_COND (r));
1024 /* Finish the cond of a switch-statement. */
1027 finish_switch_cond (tree cond, tree switch_stmt)
1029 tree orig_type = NULL;
1030 if (!processing_template_decl)
1032 /* Convert the condition to an integer or enumeration type. */
1033 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
1034 if (cond == NULL_TREE)
1036 error ("switch quantity not an integer");
1037 cond = error_mark_node;
1039 orig_type = TREE_TYPE (cond);
1040 if (cond != error_mark_node)
1044 Integral promotions are performed. */
1045 cond = perform_integral_promotions (cond);
1046 cond = maybe_cleanup_point_expr (cond);
1049 if (check_for_bare_parameter_packs (cond))
1050 cond = error_mark_node;
1051 else if (!processing_template_decl && warn_sequence_point)
1052 verify_sequence_points (cond);
1054 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
1055 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
1056 add_stmt (switch_stmt);
1057 push_switch (switch_stmt);
1058 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
1061 /* Finish the body of a switch-statement, which may be given by
1062 SWITCH_STMT. The COND to switch on is indicated. */
1065 finish_switch_stmt (tree switch_stmt)
1069 SWITCH_STMT_BODY (switch_stmt) =
1070 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
1073 scope = SWITCH_STMT_SCOPE (switch_stmt);
1074 SWITCH_STMT_SCOPE (switch_stmt) = NULL;
1075 add_stmt (do_poplevel (scope));
1078 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1082 begin_try_block (void)
1084 tree r = build_stmt (input_location, TRY_BLOCK, NULL_TREE, NULL_TREE);
1086 TRY_STMTS (r) = push_stmt_list ();
1090 /* Likewise, for a function-try-block. The block returned in
1091 *COMPOUND_STMT is an artificial outer scope, containing the
1092 function-try-block. */
1095 begin_function_try_block (tree *compound_stmt)
1098 /* This outer scope does not exist in the C++ standard, but we need
1099 a place to put __FUNCTION__ and similar variables. */
1100 *compound_stmt = begin_compound_stmt (0);
1101 r = begin_try_block ();
1102 FN_TRY_BLOCK_P (r) = 1;
1106 /* Finish a try-block, which may be given by TRY_BLOCK. */
1109 finish_try_block (tree try_block)
1111 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1112 TRY_HANDLERS (try_block) = push_stmt_list ();
1115 /* Finish the body of a cleanup try-block, which may be given by
1119 finish_cleanup_try_block (tree try_block)
1121 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1124 /* Finish an implicitly generated try-block, with a cleanup is given
1128 finish_cleanup (tree cleanup, tree try_block)
1130 TRY_HANDLERS (try_block) = cleanup;
1131 CLEANUP_P (try_block) = 1;
1134 /* Likewise, for a function-try-block. */
1137 finish_function_try_block (tree try_block)
1139 finish_try_block (try_block);
1140 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1141 the try block, but moving it inside. */
1142 in_function_try_handler = 1;
1145 /* Finish a handler-sequence for a try-block, which may be given by
1149 finish_handler_sequence (tree try_block)
1151 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1152 check_handlers (TRY_HANDLERS (try_block));
1155 /* Finish the handler-seq for a function-try-block, given by
1156 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1157 begin_function_try_block. */
1160 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1162 in_function_try_handler = 0;
1163 finish_handler_sequence (try_block);
1164 finish_compound_stmt (compound_stmt);
1167 /* Begin a handler. Returns a HANDLER if appropriate. */
1170 begin_handler (void)
1174 r = build_stmt (input_location, HANDLER, NULL_TREE, NULL_TREE);
1177 /* Create a binding level for the eh_info and the exception object
1179 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1184 /* Finish the handler-parameters for a handler, which may be given by
1185 HANDLER. DECL is the declaration for the catch parameter, or NULL
1186 if this is a `catch (...)' clause. */
1189 finish_handler_parms (tree decl, tree handler)
1191 tree type = NULL_TREE;
1192 if (processing_template_decl)
1196 decl = pushdecl (decl);
1197 decl = push_template_decl (decl);
1198 HANDLER_PARMS (handler) = decl;
1199 type = TREE_TYPE (decl);
1203 type = expand_start_catch_block (decl);
1204 HANDLER_TYPE (handler) = type;
1207 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1208 the return value from the matching call to finish_handler_parms. */
1211 finish_handler (tree handler)
1213 if (!processing_template_decl)
1214 expand_end_catch_block ();
1215 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1218 /* Begin a compound statement. FLAGS contains some bits that control the
1219 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1220 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1221 block of a function. If BCS_TRY_BLOCK is set, this is the block
1222 created on behalf of a TRY statement. Returns a token to be passed to
1223 finish_compound_stmt. */
1226 begin_compound_stmt (unsigned int flags)
1230 if (flags & BCS_NO_SCOPE)
1232 r = push_stmt_list ();
1233 STATEMENT_LIST_NO_SCOPE (r) = 1;
1235 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1236 But, if it's a statement-expression with a scopeless block, there's
1237 nothing to keep, and we don't want to accidentally keep a block
1238 *inside* the scopeless block. */
1239 keep_next_level (false);
1242 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1244 /* When processing a template, we need to remember where the braces were,
1245 so that we can set up identical scopes when instantiating the template
1246 later. BIND_EXPR is a handy candidate for this.
1247 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1248 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1249 processing templates. */
1250 if (processing_template_decl)
1252 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1253 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1254 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1255 TREE_SIDE_EFFECTS (r) = 1;
1261 /* Finish a compound-statement, which is given by STMT. */
1264 finish_compound_stmt (tree stmt)
1266 if (TREE_CODE (stmt) == BIND_EXPR)
1268 tree body = do_poplevel (BIND_EXPR_BODY (stmt));
1269 /* If the STATEMENT_LIST is empty and this BIND_EXPR isn't special,
1270 discard the BIND_EXPR so it can be merged with the containing
1272 if (TREE_CODE (body) == STATEMENT_LIST
1273 && STATEMENT_LIST_HEAD (body) == NULL
1274 && !BIND_EXPR_BODY_BLOCK (stmt)
1275 && !BIND_EXPR_TRY_BLOCK (stmt))
1278 BIND_EXPR_BODY (stmt) = body;
1280 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1281 stmt = pop_stmt_list (stmt);
1284 /* Destroy any ObjC "super" receivers that may have been
1286 objc_clear_super_receiver ();
1288 stmt = do_poplevel (stmt);
1291 /* ??? 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 /* Obfuscate EXPR if it looks like an id-expression or member access so
1511 that the call to finish_decltype in do_auto_deduction will give the
1515 force_paren_expr (tree expr)
1517 /* This is only needed for decltype(auto) in C++14. */
1518 if (cxx_dialect < cxx1y)
1521 if (!DECL_P (expr) && TREE_CODE (expr) != COMPONENT_REF
1522 && TREE_CODE (expr) != SCOPE_REF)
1525 if (processing_template_decl)
1526 expr = build1 (PAREN_EXPR, TREE_TYPE (expr), expr);
1529 cp_lvalue_kind kind = lvalue_kind (expr);
1530 if ((kind & ~clk_class) != clk_none)
1532 tree type = unlowered_expr_type (expr);
1533 bool rval = !!(kind & clk_rvalueref);
1534 type = cp_build_reference_type (type, rval);
1535 expr = build_static_cast (type, expr, tf_warning_or_error);
1542 /* Finish a parenthesized expression EXPR. */
1545 finish_parenthesized_expr (tree expr)
1548 /* This inhibits warnings in c_common_truthvalue_conversion. */
1549 TREE_NO_WARNING (expr) = 1;
1551 if (TREE_CODE (expr) == OFFSET_REF
1552 || TREE_CODE (expr) == SCOPE_REF)
1553 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1554 enclosed in parentheses. */
1555 PTRMEM_OK_P (expr) = 0;
1557 if (TREE_CODE (expr) == STRING_CST)
1558 PAREN_STRING_LITERAL_P (expr) = 1;
1560 expr = force_paren_expr (expr);
1565 /* Finish a reference to a non-static data member (DECL) that is not
1566 preceded by `.' or `->'. */
1569 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1571 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1575 tree scope = qualifying_scope;
1576 if (scope == NULL_TREE)
1577 scope = context_for_name_lookup (decl);
1578 object = maybe_dummy_object (scope, NULL);
1581 object = maybe_resolve_dummy (object);
1582 if (object == error_mark_node)
1583 return error_mark_node;
1585 /* DR 613: Can use non-static data members without an associated
1586 object in sizeof/decltype/alignof. */
1587 if (is_dummy_object (object) && cp_unevaluated_operand == 0
1588 && (!processing_template_decl || !current_class_ref))
1590 if (current_function_decl
1591 && DECL_STATIC_FUNCTION_P (current_function_decl))
1592 error ("invalid use of member %q+D in static member function", decl);
1594 error ("invalid use of non-static data member %q+D", decl);
1595 error ("from this location");
1597 return error_mark_node;
1600 if (current_class_ptr)
1601 TREE_USED (current_class_ptr) = 1;
1602 if (processing_template_decl && !qualifying_scope)
1604 tree type = TREE_TYPE (decl);
1606 if (TREE_CODE (type) == REFERENCE_TYPE)
1607 /* Quals on the object don't matter. */;
1608 else if (PACK_EXPANSION_P (type))
1609 /* Don't bother trying to represent this. */
1613 /* Set the cv qualifiers. */
1614 int quals = cp_type_quals (TREE_TYPE (object));
1616 if (DECL_MUTABLE_P (decl))
1617 quals &= ~TYPE_QUAL_CONST;
1619 quals |= cp_type_quals (TREE_TYPE (decl));
1620 type = cp_build_qualified_type (type, quals);
1623 return (convert_from_reference
1624 (build_min (COMPONENT_REF, type, object, decl, NULL_TREE)));
1626 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1627 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1629 else if (processing_template_decl)
1630 return build_qualified_name (TREE_TYPE (decl),
1633 /*template_p=*/false);
1636 tree access_type = TREE_TYPE (object);
1638 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1639 decl, tf_warning_or_error);
1641 /* If the data member was named `C::M', convert `*this' to `C'
1643 if (qualifying_scope)
1645 tree binfo = NULL_TREE;
1646 object = build_scoped_ref (object, qualifying_scope,
1650 return build_class_member_access_expr (object, decl,
1651 /*access_path=*/NULL_TREE,
1652 /*preserve_reference=*/false,
1653 tf_warning_or_error);
1657 /* If we are currently parsing a template and we encountered a typedef
1658 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1659 adds the typedef to a list tied to the current template.
1660 At template instantiation time, that list is walked and access check
1661 performed for each typedef.
1662 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1665 add_typedef_to_current_template_for_access_check (tree typedef_decl,
1667 location_t location)
1669 tree template_info = NULL;
1670 tree cs = current_scope ();
1672 if (!is_typedef_decl (typedef_decl)
1674 || !CLASS_TYPE_P (context)
1678 if (CLASS_TYPE_P (cs) || TREE_CODE (cs) == FUNCTION_DECL)
1679 template_info = get_template_info (cs);
1682 && TI_TEMPLATE (template_info)
1683 && !currently_open_class (context))
1684 append_type_to_template_for_access_check (cs, typedef_decl,
1688 /* DECL was the declaration to which a qualified-id resolved. Issue
1689 an error message if it is not accessible. If OBJECT_TYPE is
1690 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1691 type of `*x', or `x', respectively. If the DECL was named as
1692 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1695 check_accessibility_of_qualified_id (tree decl,
1697 tree nested_name_specifier)
1700 tree qualifying_type = NULL_TREE;
1702 /* If we are parsing a template declaration and if decl is a typedef,
1703 add it to a list tied to the template.
1704 At template instantiation time, that list will be walked and
1705 access check performed. */
1706 add_typedef_to_current_template_for_access_check (decl,
1707 nested_name_specifier
1708 ? nested_name_specifier
1709 : DECL_CONTEXT (decl),
1712 /* If we're not checking, return immediately. */
1713 if (deferred_access_no_check)
1716 /* Determine the SCOPE of DECL. */
1717 scope = context_for_name_lookup (decl);
1718 /* If the SCOPE is not a type, then DECL is not a member. */
1719 if (!TYPE_P (scope))
1721 /* Compute the scope through which DECL is being accessed. */
1723 /* OBJECT_TYPE might not be a class type; consider:
1725 class A { typedef int I; };
1729 In this case, we will have "A::I" as the DECL, but "I" as the
1731 && CLASS_TYPE_P (object_type)
1732 && DERIVED_FROM_P (scope, object_type))
1733 /* If we are processing a `->' or `.' expression, use the type of the
1735 qualifying_type = object_type;
1736 else if (nested_name_specifier)
1738 /* If the reference is to a non-static member of the
1739 current class, treat it as if it were referenced through
1741 if (DECL_NONSTATIC_MEMBER_P (decl)
1742 && current_class_ptr
1743 && DERIVED_FROM_P (scope, current_class_type))
1744 qualifying_type = current_class_type;
1745 /* Otherwise, use the type indicated by the
1746 nested-name-specifier. */
1748 qualifying_type = nested_name_specifier;
1751 /* Otherwise, the name must be from the current class or one of
1753 qualifying_type = currently_open_derived_class (scope);
1756 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1757 or similar in a default argument value. */
1758 && CLASS_TYPE_P (qualifying_type)
1759 && !dependent_type_p (qualifying_type))
1760 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1761 decl, tf_warning_or_error);
1764 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1765 class named to the left of the "::" operator. DONE is true if this
1766 expression is a complete postfix-expression; it is false if this
1767 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1768 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1769 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1770 is true iff this qualified name appears as a template argument. */
1773 finish_qualified_id_expr (tree qualifying_class,
1778 bool template_arg_p,
1779 tsubst_flags_t complain)
1781 gcc_assert (TYPE_P (qualifying_class));
1783 if (error_operand_p (expr))
1784 return error_mark_node;
1786 if ((DECL_P (expr) || BASELINK_P (expr))
1787 && !mark_used (expr, complain))
1788 return error_mark_node;
1791 check_template_keyword (expr);
1793 /* If EXPR occurs as the operand of '&', use special handling that
1794 permits a pointer-to-member. */
1795 if (address_p && done)
1797 if (TREE_CODE (expr) == SCOPE_REF)
1798 expr = TREE_OPERAND (expr, 1);
1799 expr = build_offset_ref (qualifying_class, expr,
1800 /*address_p=*/true, complain);
1804 /* No need to check access within an enum. */
1805 if (TREE_CODE (qualifying_class) == ENUMERAL_TYPE)
1808 /* Within the scope of a class, turn references to non-static
1809 members into expression of the form "this->...". */
1811 /* But, within a template argument, we do not want make the
1812 transformation, as there is no "this" pointer. */
1814 else if (TREE_CODE (expr) == FIELD_DECL)
1816 push_deferring_access_checks (dk_no_check);
1817 expr = finish_non_static_data_member (expr, NULL_TREE,
1819 pop_deferring_access_checks ();
1821 else if (BASELINK_P (expr) && !processing_template_decl)
1823 /* See if any of the functions are non-static members. */
1824 /* If so, the expression may be relative to 'this'. */
1825 if (!shared_member_p (expr)
1826 && current_class_ptr
1827 && DERIVED_FROM_P (qualifying_class,
1828 current_nonlambda_class_type ()))
1829 expr = (build_class_member_access_expr
1830 (maybe_dummy_object (qualifying_class, NULL),
1832 BASELINK_ACCESS_BINFO (expr),
1833 /*preserve_reference=*/false,
1836 /* The expression is a qualified name whose address is not
1838 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false,
1841 else if (BASELINK_P (expr))
1845 /* In a template, return a SCOPE_REF for most qualified-ids
1846 so that we can check access at instantiation time. But if
1847 we're looking at a member of the current instantiation, we
1848 know we have access and building up the SCOPE_REF confuses
1849 non-type template argument handling. */
1850 if (processing_template_decl
1851 && !currently_open_class (qualifying_class))
1852 expr = build_qualified_name (TREE_TYPE (expr),
1853 qualifying_class, expr,
1856 expr = convert_from_reference (expr);
1862 /* Begin a statement-expression. The value returned must be passed to
1863 finish_stmt_expr. */
1866 begin_stmt_expr (void)
1868 return push_stmt_list ();
1871 /* Process the final expression of a statement expression. EXPR can be
1872 NULL, if the final expression is empty. Return a STATEMENT_LIST
1873 containing all the statements in the statement-expression, or
1874 ERROR_MARK_NODE if there was an error. */
1877 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1879 if (error_operand_p (expr))
1881 /* The type of the statement-expression is the type of the last
1883 TREE_TYPE (stmt_expr) = error_mark_node;
1884 return error_mark_node;
1887 /* If the last statement does not have "void" type, then the value
1888 of the last statement is the value of the entire expression. */
1891 tree type = TREE_TYPE (expr);
1893 if (processing_template_decl)
1895 expr = build_stmt (input_location, EXPR_STMT, expr);
1896 expr = add_stmt (expr);
1897 /* Mark the last statement so that we can recognize it as such at
1898 template-instantiation time. */
1899 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1901 else if (VOID_TYPE_P (type))
1903 /* Just treat this like an ordinary statement. */
1904 expr = finish_expr_stmt (expr);
1908 /* It actually has a value we need to deal with. First, force it
1909 to be an rvalue so that we won't need to build up a copy
1910 constructor call later when we try to assign it to something. */
1911 expr = force_rvalue (expr, tf_warning_or_error);
1912 if (error_operand_p (expr))
1913 return error_mark_node;
1915 /* Update for array-to-pointer decay. */
1916 type = TREE_TYPE (expr);
1918 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1919 normal statement, but don't convert to void or actually add
1921 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1922 expr = maybe_cleanup_point_expr (expr);
1926 /* The type of the statement-expression is the type of the last
1928 TREE_TYPE (stmt_expr) = type;
1934 /* Finish a statement-expression. EXPR should be the value returned
1935 by the previous begin_stmt_expr. Returns an expression
1936 representing the statement-expression. */
1939 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1944 if (error_operand_p (stmt_expr))
1946 pop_stmt_list (stmt_expr);
1947 return error_mark_node;
1950 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1952 type = TREE_TYPE (stmt_expr);
1953 result = pop_stmt_list (stmt_expr);
1954 TREE_TYPE (result) = type;
1956 if (processing_template_decl)
1958 result = build_min (STMT_EXPR, type, result);
1959 TREE_SIDE_EFFECTS (result) = 1;
1960 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1962 else if (CLASS_TYPE_P (type))
1964 /* Wrap the statement-expression in a TARGET_EXPR so that the
1965 temporary object created by the final expression is destroyed at
1966 the end of the full-expression containing the
1967 statement-expression. */
1968 result = force_target_expr (type, result, tf_warning_or_error);
1974 /* Returns the expression which provides the value of STMT_EXPR. */
1977 stmt_expr_value_expr (tree stmt_expr)
1979 tree t = STMT_EXPR_STMT (stmt_expr);
1981 if (TREE_CODE (t) == BIND_EXPR)
1982 t = BIND_EXPR_BODY (t);
1984 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1985 t = STATEMENT_LIST_TAIL (t)->stmt;
1987 if (TREE_CODE (t) == EXPR_STMT)
1988 t = EXPR_STMT_EXPR (t);
1993 /* Return TRUE iff EXPR_STMT is an empty list of
1994 expression statements. */
1997 empty_expr_stmt_p (tree expr_stmt)
1999 tree body = NULL_TREE;
2001 if (expr_stmt == void_zero_node)
2006 if (TREE_CODE (expr_stmt) == EXPR_STMT)
2007 body = EXPR_STMT_EXPR (expr_stmt);
2008 else if (TREE_CODE (expr_stmt) == STATEMENT_LIST)
2014 if (TREE_CODE (body) == STATEMENT_LIST)
2015 return tsi_end_p (tsi_start (body));
2017 return empty_expr_stmt_p (body);
2022 /* Perform Koenig lookup. FN is the postfix-expression representing
2023 the function (or functions) to call; ARGS are the arguments to the
2024 call; if INCLUDE_STD then the `std' namespace is automatically
2025 considered an associated namespace (used in range-based for loops).
2026 Returns the functions to be considered by overload resolution. */
2029 perform_koenig_lookup (tree fn, vec<tree, va_gc> *args, bool include_std,
2030 tsubst_flags_t complain)
2032 tree identifier = NULL_TREE;
2033 tree functions = NULL_TREE;
2034 tree tmpl_args = NULL_TREE;
2035 bool template_id = false;
2037 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2039 /* Use a separate flag to handle null args. */
2041 tmpl_args = TREE_OPERAND (fn, 1);
2042 fn = TREE_OPERAND (fn, 0);
2045 /* Find the name of the overloaded function. */
2046 if (identifier_p (fn))
2048 else if (is_overloaded_fn (fn))
2051 identifier = DECL_NAME (get_first_fn (functions));
2053 else if (DECL_P (fn))
2056 identifier = DECL_NAME (fn);
2059 /* A call to a namespace-scope function using an unqualified name.
2061 Do Koenig lookup -- unless any of the arguments are
2063 if (!any_type_dependent_arguments_p (args)
2064 && !any_dependent_template_arguments_p (tmpl_args))
2066 fn = lookup_arg_dependent (identifier, functions, args, include_std);
2069 /* The unqualified name could not be resolved. */
2071 fn = unqualified_fn_lookup_error (identifier);
2077 if (fn && template_id)
2078 fn = build2 (TEMPLATE_ID_EXPR, unknown_type_node, fn, tmpl_args);
2083 /* Generate an expression for `FN (ARGS)'. This may change the
2086 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2087 as a virtual call, even if FN is virtual. (This flag is set when
2088 encountering an expression where the function name is explicitly
2089 qualified. For example a call to `X::f' never generates a virtual
2092 Returns code for the call. */
2095 finish_call_expr (tree fn, vec<tree, va_gc> **args, bool disallow_virtual,
2096 bool koenig_p, tsubst_flags_t complain)
2100 vec<tree, va_gc> *orig_args = NULL;
2102 if (fn == error_mark_node)
2103 return error_mark_node;
2105 gcc_assert (!TYPE_P (fn));
2109 if (processing_template_decl)
2111 /* If the call expression is dependent, build a CALL_EXPR node
2112 with no type; type_dependent_expression_p recognizes
2113 expressions with no type as being dependent. */
2114 if (type_dependent_expression_p (fn)
2115 || any_type_dependent_arguments_p (*args)
2116 /* For a non-static member function that doesn't have an
2117 explicit object argument, we need to specifically
2118 test the type dependency of the "this" pointer because it
2119 is not included in *ARGS even though it is considered to
2120 be part of the list of arguments. Note that this is
2121 related to CWG issues 515 and 1005. */
2122 || (TREE_CODE (fn) != COMPONENT_REF
2123 && non_static_member_function_p (fn)
2124 && current_class_ref
2125 && type_dependent_expression_p (current_class_ref)))
2127 result = build_nt_call_vec (fn, *args);
2128 SET_EXPR_LOCATION (result, EXPR_LOC_OR_HERE (fn));
2129 KOENIG_LOOKUP_P (result) = koenig_p;
2134 tree fndecl = OVL_CURRENT (fn);
2135 if (TREE_CODE (fndecl) != FUNCTION_DECL
2136 || !TREE_THIS_VOLATILE (fndecl))
2142 current_function_returns_abnormally = 1;
2146 orig_args = make_tree_vector_copy (*args);
2147 if (!BASELINK_P (fn)
2148 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
2149 && TREE_TYPE (fn) != unknown_type_node)
2150 fn = build_non_dependent_expr (fn);
2151 make_args_non_dependent (*args);
2154 if (TREE_CODE (fn) == COMPONENT_REF)
2156 tree member = TREE_OPERAND (fn, 1);
2157 if (BASELINK_P (member))
2159 tree object = TREE_OPERAND (fn, 0);
2160 return build_new_method_call (object, member,
2163 ? LOOKUP_NORMAL | LOOKUP_NONVIRTUAL
2170 if (is_overloaded_fn (fn))
2171 fn = baselink_for_fns (fn);
2174 if (BASELINK_P (fn))
2178 /* A call to a member function. From [over.call.func]:
2180 If the keyword this is in scope and refers to the class of
2181 that member function, or a derived class thereof, then the
2182 function call is transformed into a qualified function call
2183 using (*this) as the postfix-expression to the left of the
2184 . operator.... [Otherwise] a contrived object of type T
2185 becomes the implied object argument.
2189 struct A { void f(); };
2190 struct B : public A {};
2191 struct C : public A { void g() { B::f(); }};
2193 "the class of that member function" refers to `A'. But 11.2
2194 [class.access.base] says that we need to convert 'this' to B* as
2195 part of the access, so we pass 'B' to maybe_dummy_object. */
2197 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
2200 if (processing_template_decl)
2202 if (type_dependent_expression_p (object))
2204 tree ret = build_nt_call_vec (orig_fn, orig_args);
2205 release_tree_vector (orig_args);
2208 object = build_non_dependent_expr (object);
2211 result = build_new_method_call (object, fn, args, NULL_TREE,
2213 ? LOOKUP_NORMAL|LOOKUP_NONVIRTUAL
2218 else if (is_overloaded_fn (fn))
2220 /* If the function is an overloaded builtin, resolve it. */
2221 if (TREE_CODE (fn) == FUNCTION_DECL
2222 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2223 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
2224 result = resolve_overloaded_builtin (input_location, fn, *args);
2228 if (warn_sizeof_pointer_memaccess
2229 && !vec_safe_is_empty (*args)
2230 && !processing_template_decl)
2232 location_t sizeof_arg_loc[3];
2235 for (i = 0; i < 3; i++)
2239 sizeof_arg_loc[i] = UNKNOWN_LOCATION;
2240 sizeof_arg[i] = NULL_TREE;
2241 if (i >= (*args)->length ())
2244 if (TREE_CODE (t) != SIZEOF_EXPR)
2246 if (SIZEOF_EXPR_TYPE_P (t))
2247 sizeof_arg[i] = TREE_TYPE (TREE_OPERAND (t, 0));
2249 sizeof_arg[i] = TREE_OPERAND (t, 0);
2250 sizeof_arg_loc[i] = EXPR_LOCATION (t);
2252 sizeof_pointer_memaccess_warning
2253 (sizeof_arg_loc, fn, *args,
2254 sizeof_arg, same_type_ignoring_top_level_qualifiers_p);
2257 /* A call to a namespace-scope function. */
2258 result = build_new_function_call (fn, args, koenig_p, complain);
2261 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
2263 if (!vec_safe_is_empty (*args))
2264 error ("arguments to destructor are not allowed");
2265 /* Mark the pseudo-destructor call as having side-effects so
2266 that we do not issue warnings about its use. */
2267 result = build1 (NOP_EXPR,
2269 TREE_OPERAND (fn, 0));
2270 TREE_SIDE_EFFECTS (result) = 1;
2272 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
2273 /* If the "function" is really an object of class type, it might
2274 have an overloaded `operator ()'. */
2275 result = build_op_call (fn, args, complain);
2278 /* A call where the function is unknown. */
2279 result = cp_build_function_call_vec (fn, args, complain);
2281 if (processing_template_decl && result != error_mark_node)
2283 if (INDIRECT_REF_P (result))
2284 result = TREE_OPERAND (result, 0);
2285 result = build_call_vec (TREE_TYPE (result), orig_fn, orig_args);
2286 SET_EXPR_LOCATION (result, input_location);
2287 KOENIG_LOOKUP_P (result) = koenig_p;
2288 release_tree_vector (orig_args);
2289 result = convert_from_reference (result);
2294 /* Free garbage OVERLOADs from arg-dependent lookup. */
2295 tree next = NULL_TREE;
2297 fn && TREE_CODE (fn) == OVERLOAD && OVL_ARG_DEPENDENT (fn);
2300 if (processing_template_decl)
2301 /* In a template, we'll re-use them at instantiation time. */
2302 OVL_ARG_DEPENDENT (fn) = false;
2305 next = OVL_CHAIN (fn);
2314 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2315 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2316 POSTDECREMENT_EXPR.) */
2319 finish_increment_expr (tree expr, enum tree_code code)
2321 return build_x_unary_op (input_location, code, expr, tf_warning_or_error);
2324 /* Finish a use of `this'. Returns an expression for `this'. */
2327 finish_this_expr (void)
2331 if (current_class_ptr)
2333 tree type = TREE_TYPE (current_class_ref);
2335 /* In a lambda expression, 'this' refers to the captured 'this'. */
2336 if (LAMBDA_TYPE_P (type))
2337 result = lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type));
2339 result = current_class_ptr;
2341 else if (current_function_decl
2342 && DECL_STATIC_FUNCTION_P (current_function_decl))
2344 error ("%<this%> is unavailable for static member functions");
2345 result = error_mark_node;
2349 if (current_function_decl)
2350 error ("invalid use of %<this%> in non-member function");
2352 error ("invalid use of %<this%> at top level");
2353 result = error_mark_node;
2356 /* The keyword 'this' is a prvalue expression. */
2357 result = rvalue (result);
2362 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2363 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2364 the TYPE for the type given. If SCOPE is non-NULL, the expression
2365 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2368 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor,
2371 if (object == error_mark_node || destructor == error_mark_node)
2372 return error_mark_node;
2374 gcc_assert (TYPE_P (destructor));
2376 if (!processing_template_decl)
2378 if (scope == error_mark_node)
2380 error_at (loc, "invalid qualifying scope in pseudo-destructor name");
2381 return error_mark_node;
2383 if (is_auto (destructor))
2384 destructor = TREE_TYPE (object);
2385 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2388 "qualified type %qT does not match destructor name ~%qT",
2390 return error_mark_node;
2394 /* [expr.pseudo] says both:
2396 The type designated by the pseudo-destructor-name shall be
2397 the same as the object type.
2401 The cv-unqualified versions of the object type and of the
2402 type designated by the pseudo-destructor-name shall be the
2405 We implement the more generous second sentence, since that is
2406 what most other compilers do. */
2407 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2410 error_at (loc, "%qE is not of type %qT", object, destructor);
2411 return error_mark_node;
2415 return build3_loc (loc, PSEUDO_DTOR_EXPR, void_type_node, object,
2419 /* Finish an expression of the form CODE EXPR. */
2422 finish_unary_op_expr (location_t loc, enum tree_code code, tree expr,
2423 tsubst_flags_t complain)
2425 tree result = build_x_unary_op (loc, code, expr, complain);
2426 if ((complain & tf_warning)
2427 && TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2428 overflow_warning (input_location, result);
2433 /* Finish a compound-literal expression. TYPE is the type to which
2434 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2437 finish_compound_literal (tree type, tree compound_literal,
2438 tsubst_flags_t complain)
2440 if (type == error_mark_node)
2441 return error_mark_node;
2443 if (TREE_CODE (type) == REFERENCE_TYPE)
2446 = finish_compound_literal (TREE_TYPE (type), compound_literal,
2448 return cp_build_c_cast (type, compound_literal, complain);
2451 if (!TYPE_OBJ_P (type))
2453 if (complain & tf_error)
2454 error ("compound literal of non-object type %qT", type);
2455 return error_mark_node;
2458 if (processing_template_decl)
2460 TREE_TYPE (compound_literal) = type;
2461 /* Mark the expression as a compound literal. */
2462 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2463 return compound_literal;
2466 type = complete_type (type);
2468 if (TYPE_NON_AGGREGATE_CLASS (type))
2470 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2471 everywhere that deals with function arguments would be a pain, so
2472 just wrap it in a TREE_LIST. The parser set a flag so we know
2473 that it came from T{} rather than T({}). */
2474 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2475 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2476 return build_functional_cast (type, compound_literal, complain);
2479 if (TREE_CODE (type) == ARRAY_TYPE
2480 && check_array_initializer (NULL_TREE, type, compound_literal))
2481 return error_mark_node;
2482 compound_literal = reshape_init (type, compound_literal, complain);
2483 if (SCALAR_TYPE_P (type)
2484 && !BRACE_ENCLOSED_INITIALIZER_P (compound_literal)
2485 && (complain & tf_warning_or_error))
2486 check_narrowing (type, compound_literal);
2487 if (TREE_CODE (type) == ARRAY_TYPE
2488 && TYPE_DOMAIN (type) == NULL_TREE)
2490 cp_complete_array_type_or_error (&type, compound_literal,
2492 if (type == error_mark_node)
2493 return error_mark_node;
2495 compound_literal = digest_init (type, compound_literal, complain);
2496 if (TREE_CODE (compound_literal) == CONSTRUCTOR)
2497 TREE_HAS_CONSTRUCTOR (compound_literal) = true;
2498 /* Put static/constant array temporaries in static variables, but always
2499 represent class temporaries with TARGET_EXPR so we elide copies. */
2500 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type))
2501 && TREE_CODE (type) == ARRAY_TYPE
2502 && !TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type)
2503 && initializer_constant_valid_p (compound_literal, type))
2505 tree decl = create_temporary_var (type);
2506 DECL_INITIAL (decl) = compound_literal;
2507 TREE_STATIC (decl) = 1;
2508 if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type))
2510 /* 5.19 says that a constant expression can include an
2511 lvalue-rvalue conversion applied to "a glvalue of literal type
2512 that refers to a non-volatile temporary object initialized
2513 with a constant expression". Rather than try to communicate
2514 that this VAR_DECL is a temporary, just mark it constexpr. */
2515 DECL_DECLARED_CONSTEXPR_P (decl) = true;
2516 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true;
2517 TREE_CONSTANT (decl) = true;
2519 cp_apply_type_quals_to_decl (cp_type_quals (type), decl);
2520 decl = pushdecl_top_level (decl);
2521 DECL_NAME (decl) = make_anon_name ();
2522 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2526 return get_target_expr_sfinae (compound_literal, complain);
2529 /* Return the declaration for the function-name variable indicated by
2533 finish_fname (tree id)
2537 decl = fname_decl (input_location, C_RID_CODE (id), id);
2538 if (processing_template_decl && current_function_decl)
2539 decl = DECL_NAME (decl);
2543 /* Finish a translation unit. */
2546 finish_translation_unit (void)
2548 /* In case there were missing closebraces,
2549 get us back to the global binding level. */
2551 while (current_namespace != global_namespace)
2554 /* Do file scope __FUNCTION__ et al. */
2555 finish_fname_decls ();
2558 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2559 Returns the parameter. */
2562 finish_template_type_parm (tree aggr, tree identifier)
2564 if (aggr != class_type_node)
2566 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2567 aggr = class_type_node;
2570 return build_tree_list (aggr, identifier);
2573 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2574 Returns the parameter. */
2577 finish_template_template_parm (tree aggr, tree identifier)
2579 tree decl = build_decl (input_location,
2580 TYPE_DECL, identifier, NULL_TREE);
2581 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2582 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2583 DECL_TEMPLATE_RESULT (tmpl) = decl;
2584 DECL_ARTIFICIAL (decl) = 1;
2585 end_template_decl ();
2587 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2589 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2590 /*is_primary=*/true, /*is_partial=*/false,
2593 return finish_template_type_parm (aggr, tmpl);
2596 /* ARGUMENT is the default-argument value for a template template
2597 parameter. If ARGUMENT is invalid, issue error messages and return
2598 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2601 check_template_template_default_arg (tree argument)
2603 if (TREE_CODE (argument) != TEMPLATE_DECL
2604 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2605 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2607 if (TREE_CODE (argument) == TYPE_DECL)
2608 error ("invalid use of type %qT as a default value for a template "
2609 "template-parameter", TREE_TYPE (argument));
2611 error ("invalid default argument for a template template parameter");
2612 return error_mark_node;
2618 /* Begin a class definition, as indicated by T. */
2621 begin_class_definition (tree t)
2623 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2624 return error_mark_node;
2626 if (processing_template_parmlist)
2628 error ("definition of %q#T inside template parameter list", t);
2629 return error_mark_node;
2632 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2633 are passed the same as decimal scalar types. */
2634 if (TREE_CODE (t) == RECORD_TYPE
2635 && !processing_template_decl)
2637 tree ns = TYPE_CONTEXT (t);
2638 if (ns && TREE_CODE (ns) == NAMESPACE_DECL
2639 && DECL_CONTEXT (ns) == std_node
2641 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns)), "decimal"))
2643 const char *n = TYPE_NAME_STRING (t);
2644 if ((strcmp (n, "decimal32") == 0)
2645 || (strcmp (n, "decimal64") == 0)
2646 || (strcmp (n, "decimal128") == 0))
2647 TYPE_TRANSPARENT_AGGR (t) = 1;
2651 /* A non-implicit typename comes from code like:
2653 template <typename T> struct A {
2654 template <typename U> struct A<T>::B ...
2656 This is erroneous. */
2657 else if (TREE_CODE (t) == TYPENAME_TYPE)
2659 error ("invalid definition of qualified type %qT", t);
2660 t = error_mark_node;
2663 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2665 t = make_class_type (RECORD_TYPE);
2666 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2669 if (TYPE_BEING_DEFINED (t))
2671 t = make_class_type (TREE_CODE (t));
2672 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2674 maybe_process_partial_specialization (t);
2676 TYPE_BEING_DEFINED (t) = 1;
2678 if (flag_pack_struct)
2681 TYPE_PACKED (t) = 1;
2682 /* Even though the type is being defined for the first time
2683 here, there might have been a forward declaration, so there
2684 might be cv-qualified variants of T. */
2685 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2686 TYPE_PACKED (v) = 1;
2688 /* Reset the interface data, at the earliest possible
2689 moment, as it might have been set via a class foo;
2691 if (! TYPE_ANONYMOUS_P (t))
2693 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2694 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2695 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2696 (t, finfo->interface_unknown);
2698 reset_specialization();
2700 /* Make a declaration for this class in its own scope. */
2701 build_self_reference ();
2706 /* Finish the member declaration given by DECL. */
2709 finish_member_declaration (tree decl)
2711 if (decl == error_mark_node || decl == NULL_TREE)
2714 if (decl == void_type_node)
2715 /* The COMPONENT was a friend, not a member, and so there's
2716 nothing for us to do. */
2719 /* We should see only one DECL at a time. */
2720 gcc_assert (DECL_CHAIN (decl) == NULL_TREE);
2722 /* Set up access control for DECL. */
2724 = (current_access_specifier == access_private_node);
2725 TREE_PROTECTED (decl)
2726 = (current_access_specifier == access_protected_node);
2727 if (TREE_CODE (decl) == TEMPLATE_DECL)
2729 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2730 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2733 /* Mark the DECL as a member of the current class, unless it's
2734 a member of an enumeration. */
2735 if (TREE_CODE (decl) != CONST_DECL)
2736 DECL_CONTEXT (decl) = current_class_type;
2738 /* Check for bare parameter packs in the member variable declaration. */
2739 if (TREE_CODE (decl) == FIELD_DECL)
2741 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2742 TREE_TYPE (decl) = error_mark_node;
2743 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2744 DECL_ATTRIBUTES (decl) = NULL_TREE;
2749 A C language linkage is ignored for the names of class members
2750 and the member function type of class member functions. */
2751 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2752 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2754 /* Put functions on the TYPE_METHODS list and everything else on the
2755 TYPE_FIELDS list. Note that these are built up in reverse order.
2756 We reverse them (to obtain declaration order) in finish_struct. */
2757 if (DECL_DECLARES_FUNCTION_P (decl))
2759 /* We also need to add this function to the
2760 CLASSTYPE_METHOD_VEC. */
2761 if (add_method (current_class_type, decl, NULL_TREE))
2763 DECL_CHAIN (decl) = TYPE_METHODS (current_class_type);
2764 TYPE_METHODS (current_class_type) = decl;
2766 maybe_add_class_template_decl_list (current_class_type, decl,
2770 /* Enter the DECL into the scope of the class, if the class
2771 isn't a closure (whose fields are supposed to be unnamed). */
2772 else if (CLASSTYPE_LAMBDA_EXPR (current_class_type)
2773 || pushdecl_class_level (decl))
2775 if (TREE_CODE (decl) == USING_DECL)
2777 /* For now, ignore class-scope USING_DECLS, so that
2778 debugging backends do not see them. */
2779 DECL_IGNORED_P (decl) = 1;
2782 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2783 go at the beginning. The reason is that lookup_field_1
2784 searches the list in order, and we want a field name to
2785 override a type name so that the "struct stat hack" will
2786 work. In particular:
2788 struct S { enum E { }; int E } s;
2791 is valid. In addition, the FIELD_DECLs must be maintained in
2792 declaration order so that class layout works as expected.
2793 However, we don't need that order until class layout, so we
2794 save a little time by putting FIELD_DECLs on in reverse order
2795 here, and then reversing them in finish_struct_1. (We could
2796 also keep a pointer to the correct insertion points in the
2799 if (TREE_CODE (decl) == TYPE_DECL)
2800 TYPE_FIELDS (current_class_type)
2801 = chainon (TYPE_FIELDS (current_class_type), decl);
2804 DECL_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2805 TYPE_FIELDS (current_class_type) = decl;
2808 maybe_add_class_template_decl_list (current_class_type, decl,
2813 note_decl_for_pch (decl);
2816 /* DECL has been declared while we are building a PCH file. Perform
2817 actions that we might normally undertake lazily, but which can be
2818 performed now so that they do not have to be performed in
2819 translation units which include the PCH file. */
2822 note_decl_for_pch (tree decl)
2824 gcc_assert (pch_file);
2826 /* There's a good chance that we'll have to mangle names at some
2827 point, even if only for emission in debugging information. */
2828 if (VAR_OR_FUNCTION_DECL_P (decl)
2829 && !processing_template_decl)
2833 /* Finish processing a complete template declaration. The PARMS are
2834 the template parameters. */
2837 finish_template_decl (tree parms)
2840 end_template_decl ();
2842 end_specialization ();
2845 /* Finish processing a template-id (which names a type) of the form
2846 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2847 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2848 the scope of template-id indicated. */
2851 finish_template_type (tree name, tree args, int entering_scope)
2855 type = lookup_template_class (name, args,
2856 NULL_TREE, NULL_TREE, entering_scope,
2857 tf_warning_or_error | tf_user);
2858 if (type == error_mark_node)
2860 else if (CLASS_TYPE_P (type) && !alias_type_or_template_p (type))
2861 return TYPE_STUB_DECL (type);
2863 return TYPE_NAME (type);
2866 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2867 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2868 BASE_CLASS, or NULL_TREE if an error occurred. The
2869 ACCESS_SPECIFIER is one of
2870 access_{default,public,protected_private}_node. For a virtual base
2871 we set TREE_TYPE. */
2874 finish_base_specifier (tree base, tree access, bool virtual_p)
2878 if (base == error_mark_node)
2880 error ("invalid base-class specification");
2883 else if (! MAYBE_CLASS_TYPE_P (base))
2885 error ("%qT is not a class type", base);
2890 if (cp_type_quals (base) != 0)
2892 /* DR 484: Can a base-specifier name a cv-qualified
2894 base = TYPE_MAIN_VARIANT (base);
2896 result = build_tree_list (access, base);
2898 TREE_TYPE (result) = integer_type_node;
2904 /* If FNS is a member function, a set of member functions, or a
2905 template-id referring to one or more member functions, return a
2906 BASELINK for FNS, incorporating the current access context.
2907 Otherwise, return FNS unchanged. */
2910 baselink_for_fns (tree fns)
2915 if (BASELINK_P (fns)
2916 || error_operand_p (fns))
2919 scope = ovl_scope (fns);
2920 if (!CLASS_TYPE_P (scope))
2923 cl = currently_open_derived_class (scope);
2926 cl = TYPE_BINFO (cl);
2927 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2930 /* Returns true iff DECL is a variable from a function outside
2934 outer_var_p (tree decl)
2936 return ((VAR_P (decl) || TREE_CODE (decl) == PARM_DECL)
2937 && DECL_FUNCTION_SCOPE_P (decl)
2938 && (DECL_CONTEXT (decl) != current_function_decl
2939 || parsing_nsdmi ()));
2942 /* As above, but also checks that DECL is automatic. */
2945 outer_automatic_var_p (tree decl)
2947 return (outer_var_p (decl)
2948 && !TREE_STATIC (decl));
2951 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2952 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2953 if non-NULL, is the type or namespace used to explicitly qualify
2954 ID_EXPRESSION. DECL is the entity to which that name has been
2957 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2958 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2959 be set to true if this expression isn't permitted in a
2960 constant-expression, but it is otherwise not set by this function.
2961 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2962 constant-expression, but a non-constant expression is also
2965 DONE is true if this expression is a complete postfix-expression;
2966 it is false if this expression is followed by '->', '[', '(', etc.
2967 ADDRESS_P is true iff this expression is the operand of '&'.
2968 TEMPLATE_P is true iff the qualified-id was of the form
2969 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2970 appears as a template argument.
2972 If an error occurs, and it is the kind of error that might cause
2973 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2974 is the caller's responsibility to issue the message. *ERROR_MSG
2975 will be a string with static storage duration, so the caller need
2978 Return an expression for the entity, after issuing appropriate
2979 diagnostics. This function is also responsible for transforming a
2980 reference to a non-static member into a COMPONENT_REF that makes
2981 the use of "this" explicit.
2983 Upon return, *IDK will be filled in appropriately. */
2985 finish_id_expression (tree id_expression,
2989 bool integral_constant_expression_p,
2990 bool allow_non_integral_constant_expression_p,
2991 bool *non_integral_constant_expression_p,
2995 bool template_arg_p,
2996 const char **error_msg,
2997 location_t location)
2999 decl = strip_using_decl (decl);
3001 /* Initialize the output parameters. */
3002 *idk = CP_ID_KIND_NONE;
3005 if (id_expression == error_mark_node)
3006 return error_mark_node;
3007 /* If we have a template-id, then no further lookup is
3008 required. If the template-id was for a template-class, we
3009 will sometimes have a TYPE_DECL at this point. */
3010 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
3011 || TREE_CODE (decl) == TYPE_DECL)
3013 /* Look up the name. */
3016 if (decl == error_mark_node)
3018 /* Name lookup failed. */
3021 || (!dependent_type_p (scope)
3022 && !(identifier_p (id_expression)
3023 && IDENTIFIER_TYPENAME_P (id_expression)
3024 && dependent_type_p (TREE_TYPE (id_expression))))))
3026 /* If the qualifying type is non-dependent (and the name
3027 does not name a conversion operator to a dependent
3028 type), issue an error. */
3029 qualified_name_lookup_error (scope, id_expression, decl, location);
3030 return error_mark_node;
3034 /* It may be resolved via Koenig lookup. */
3035 *idk = CP_ID_KIND_UNQUALIFIED;
3036 return id_expression;
3039 decl = id_expression;
3041 /* If DECL is a variable that would be out of scope under
3042 ANSI/ISO rules, but in scope in the ARM, name lookup
3043 will succeed. Issue a diagnostic here. */
3045 decl = check_for_out_of_scope_variable (decl);
3047 /* Remember that the name was used in the definition of
3048 the current class so that we can check later to see if
3049 the meaning would have been different after the class
3050 was entirely defined. */
3051 if (!scope && decl != error_mark_node && identifier_p (id_expression))
3052 maybe_note_name_used_in_class (id_expression, decl);
3054 /* Disallow uses of local variables from containing functions, except
3055 within lambda-expressions. */
3056 if (!outer_var_p (decl))
3058 else if (TREE_STATIC (decl)
3059 /* It's not a use (3.2) if we're in an unevaluated context. */
3060 || cp_unevaluated_operand)
3062 if (processing_template_decl)
3063 /* For a use of an outer static/unevaluated var, return the id
3064 so that we'll look it up again in the instantiation. */
3065 return id_expression;
3069 tree context = DECL_CONTEXT (decl);
3070 tree containing_function = current_function_decl;
3071 tree lambda_stack = NULL_TREE;
3072 tree lambda_expr = NULL_TREE;
3073 tree initializer = convert_from_reference (decl);
3075 /* Mark it as used now even if the use is ill-formed. */
3078 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
3079 support for an approach in which a reference to a local
3080 [constant] automatic variable in a nested class or lambda body
3081 would enter the expression as an rvalue, which would reduce
3082 the complexity of the problem"
3084 FIXME update for final resolution of core issue 696. */
3085 if (decl_constant_var_p (decl))
3087 if (processing_template_decl)
3088 /* In a template, the constant value may not be in a usable
3089 form, so look it up again at instantiation time. */
3090 return id_expression;
3092 return integral_constant_value (decl);
3095 if (parsing_nsdmi ())
3096 containing_function = NULL_TREE;
3097 /* If we are in a lambda function, we can move out until we hit
3099 2. a non-lambda function, or
3100 3. a non-default capturing lambda function. */
3101 else while (context != containing_function
3102 && LAMBDA_FUNCTION_P (containing_function))
3104 lambda_expr = CLASSTYPE_LAMBDA_EXPR
3105 (DECL_CONTEXT (containing_function));
3107 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr)
3111 lambda_stack = tree_cons (NULL_TREE,
3116 = decl_function_context (containing_function);
3119 if (lambda_expr && TREE_CODE (decl) == VAR_DECL
3120 && DECL_ANON_UNION_VAR_P (decl))
3122 error ("cannot capture member %qD of anonymous union", decl);
3123 return error_mark_node;
3125 if (context == containing_function)
3127 decl = add_default_capture (lambda_stack,
3128 /*id=*/DECL_NAME (decl),
3131 else if (lambda_expr)
3133 error ("%qD is not captured", decl);
3134 return error_mark_node;
3139 ? G_("use of local variable with automatic storage from containing function")
3140 : G_("use of parameter from containing function"));
3141 inform (input_location, "%q+#D declared here", decl);
3142 return error_mark_node;
3146 /* Also disallow uses of function parameters outside the function
3147 body, except inside an unevaluated context (i.e. decltype). */
3148 if (TREE_CODE (decl) == PARM_DECL
3149 && DECL_CONTEXT (decl) == NULL_TREE
3150 && !cp_unevaluated_operand)
3152 error ("use of parameter %qD outside function body", decl);
3153 return error_mark_node;
3157 /* If we didn't find anything, or what we found was a type,
3158 then this wasn't really an id-expression. */
3159 if (TREE_CODE (decl) == TEMPLATE_DECL
3160 && !DECL_FUNCTION_TEMPLATE_P (decl))
3162 *error_msg = "missing template arguments";
3163 return error_mark_node;
3165 else if (TREE_CODE (decl) == TYPE_DECL
3166 || TREE_CODE (decl) == NAMESPACE_DECL)
3168 *error_msg = "expected primary-expression";
3169 return error_mark_node;
3172 /* If the name resolved to a template parameter, there is no
3173 need to look it up again later. */
3174 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
3175 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
3179 *idk = CP_ID_KIND_NONE;
3180 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
3181 decl = TEMPLATE_PARM_DECL (decl);
3182 r = convert_from_reference (DECL_INITIAL (decl));
3184 if (integral_constant_expression_p
3185 && !dependent_type_p (TREE_TYPE (decl))
3186 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
3188 if (!allow_non_integral_constant_expression_p)
3189 error ("template parameter %qD of type %qT is not allowed in "
3190 "an integral constant expression because it is not of "
3191 "integral or enumeration type", decl, TREE_TYPE (decl));
3192 *non_integral_constant_expression_p = true;
3200 /* If the declaration was explicitly qualified indicate
3201 that. The semantics of `A::f(3)' are different than
3202 `f(3)' if `f' is virtual. */
3204 ? CP_ID_KIND_QUALIFIED
3205 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
3206 ? CP_ID_KIND_TEMPLATE_ID
3207 : CP_ID_KIND_UNQUALIFIED));
3212 An id-expression is type-dependent if it contains an
3213 identifier that was declared with a dependent type.
3215 The standard is not very specific about an id-expression that
3216 names a set of overloaded functions. What if some of them
3217 have dependent types and some of them do not? Presumably,
3218 such a name should be treated as a dependent name. */
3219 /* Assume the name is not dependent. */
3220 dependent_p = false;
3221 if (!processing_template_decl)
3222 /* No names are dependent outside a template. */
3224 else if (TREE_CODE (decl) == CONST_DECL)
3225 /* We don't want to treat enumerators as dependent. */
3227 /* A template-id where the name of the template was not resolved
3228 is definitely dependent. */
3229 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
3230 && (identifier_p (TREE_OPERAND (decl, 0))))
3232 /* For anything except an overloaded function, just check its
3234 else if (!is_overloaded_fn (decl))
3236 = dependent_type_p (TREE_TYPE (decl));
3237 /* For a set of overloaded functions, check each of the
3243 if (BASELINK_P (fns))
3244 fns = BASELINK_FUNCTIONS (fns);
3246 /* For a template-id, check to see if the template
3247 arguments are dependent. */
3248 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
3250 tree args = TREE_OPERAND (fns, 1);
3251 dependent_p = any_dependent_template_arguments_p (args);
3252 /* The functions are those referred to by the
3254 fns = TREE_OPERAND (fns, 0);
3257 /* If there are no dependent template arguments, go through
3258 the overloaded functions. */
3259 while (fns && !dependent_p)
3261 tree fn = OVL_CURRENT (fns);
3263 /* Member functions of dependent classes are
3265 if (TREE_CODE (fn) == FUNCTION_DECL
3266 && type_dependent_expression_p (fn))
3268 else if (TREE_CODE (fn) == TEMPLATE_DECL
3269 && dependent_template_p (fn))
3272 fns = OVL_NEXT (fns);
3276 /* If the name was dependent on a template parameter, we will
3277 resolve the name at instantiation time. */
3280 /* Create a SCOPE_REF for qualified names, if the scope is
3286 if (address_p && done)
3287 decl = finish_qualified_id_expr (scope, decl,
3291 tf_warning_or_error);
3294 tree type = NULL_TREE;
3295 if (DECL_P (decl) && !dependent_scope_p (scope))
3296 type = TREE_TYPE (decl);
3297 decl = build_qualified_name (type,
3303 if (TREE_TYPE (decl))
3304 decl = convert_from_reference (decl);
3307 /* A TEMPLATE_ID already contains all the information we
3309 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
3310 return id_expression;
3311 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
3312 /* If we found a variable, then name lookup during the
3313 instantiation will always resolve to the same VAR_DECL
3314 (or an instantiation thereof). */
3316 || TREE_CODE (decl) == PARM_DECL)
3319 return convert_from_reference (decl);
3321 /* The same is true for FIELD_DECL, but we also need to
3322 make sure that the syntax is correct. */
3323 else if (TREE_CODE (decl) == FIELD_DECL)
3325 /* Since SCOPE is NULL here, this is an unqualified name.
3326 Access checking has been performed during name lookup
3327 already. Turn off checking to avoid duplicate errors. */
3328 push_deferring_access_checks (dk_no_check);
3329 decl = finish_non_static_data_member
3331 /*qualifying_scope=*/NULL_TREE);
3332 pop_deferring_access_checks ();
3335 return id_expression;
3338 if (TREE_CODE (decl) == NAMESPACE_DECL)
3340 error ("use of namespace %qD as expression", decl);
3341 return error_mark_node;
3343 else if (DECL_CLASS_TEMPLATE_P (decl))
3345 error ("use of class template %qT as expression", decl);
3346 return error_mark_node;
3348 else if (TREE_CODE (decl) == TREE_LIST)
3350 /* Ambiguous reference to base members. */
3351 error ("request for member %qD is ambiguous in "
3352 "multiple inheritance lattice", id_expression);
3353 print_candidates (decl);
3354 return error_mark_node;
3357 /* Mark variable-like entities as used. Functions are similarly
3358 marked either below or after overload resolution. */
3360 || TREE_CODE (decl) == PARM_DECL
3361 || TREE_CODE (decl) == CONST_DECL
3362 || TREE_CODE (decl) == RESULT_DECL)
3363 && !mark_used (decl))
3364 return error_mark_node;
3366 /* Only certain kinds of names are allowed in constant
3367 expression. Template parameters have already
3368 been handled above. */
3369 if (! error_operand_p (decl)
3370 && integral_constant_expression_p
3371 && ! decl_constant_var_p (decl)
3372 && TREE_CODE (decl) != CONST_DECL
3373 && ! builtin_valid_in_constant_expr_p (decl))
3375 if (!allow_non_integral_constant_expression_p)
3377 error ("%qD cannot appear in a constant-expression", decl);
3378 return error_mark_node;
3380 *non_integral_constant_expression_p = true;
3385 && !cp_unevaluated_operand
3386 && DECL_THREAD_LOCAL_P (decl)
3387 && (wrap = get_tls_wrapper_fn (decl)))
3389 /* Replace an evaluated use of the thread_local variable with
3390 a call to its wrapper. */
3391 decl = build_cxx_call (wrap, 0, NULL, tf_warning_or_error);
3395 decl = (adjust_result_of_qualified_name_lookup
3396 (decl, scope, current_nonlambda_class_type()));
3398 if (TREE_CODE (decl) == FUNCTION_DECL)
3402 decl = finish_qualified_id_expr (scope,
3408 tf_warning_or_error);
3410 decl = convert_from_reference (decl);
3412 else if (TREE_CODE (decl) == FIELD_DECL)
3414 /* Since SCOPE is NULL here, this is an unqualified name.
3415 Access checking has been performed during name lookup
3416 already. Turn off checking to avoid duplicate errors. */
3417 push_deferring_access_checks (dk_no_check);
3418 decl = finish_non_static_data_member (decl, NULL_TREE,
3419 /*qualifying_scope=*/NULL_TREE);
3420 pop_deferring_access_checks ();
3422 else if (is_overloaded_fn (decl))
3426 first_fn = get_first_fn (decl);
3427 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
3428 first_fn = DECL_TEMPLATE_RESULT (first_fn);
3430 if (!really_overloaded_fn (decl)
3431 && !mark_used (first_fn))
3432 return error_mark_node;
3435 && TREE_CODE (first_fn) == FUNCTION_DECL
3436 && DECL_FUNCTION_MEMBER_P (first_fn)
3437 && !shared_member_p (decl))
3439 /* A set of member functions. */
3440 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3441 return finish_class_member_access_expr (decl, id_expression,
3442 /*template_p=*/false,
3443 tf_warning_or_error);
3446 decl = baselink_for_fns (decl);
3450 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3451 && DECL_CLASS_SCOPE_P (decl))
3453 tree context = context_for_name_lookup (decl);
3454 if (context != current_class_type)
3456 tree path = currently_open_derived_class (context);
3457 perform_or_defer_access_check (TYPE_BINFO (path),
3459 tf_warning_or_error);
3463 decl = convert_from_reference (decl);
3467 /* Handle references (c++/56130). */
3468 tree t = REFERENCE_REF_P (decl) ? TREE_OPERAND (decl, 0) : decl;
3469 if (TREE_DEPRECATED (t))
3470 warn_deprecated_use (t, NULL_TREE);
3475 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3476 use as a type-specifier. */
3479 finish_typeof (tree expr)
3483 if (type_dependent_expression_p (expr))
3485 type = cxx_make_type (TYPEOF_TYPE);
3486 TYPEOF_TYPE_EXPR (type) = expr;
3487 SET_TYPE_STRUCTURAL_EQUALITY (type);
3492 expr = mark_type_use (expr);
3494 type = unlowered_expr_type (expr);
3496 if (!type || type == unknown_type_node)
3498 error ("type of %qE is unknown", expr);
3499 return error_mark_node;
3505 /* Implement the __underlying_type keyword: Return the underlying
3506 type of TYPE, suitable for use as a type-specifier. */
3509 finish_underlying_type (tree type)
3511 tree underlying_type;
3513 if (processing_template_decl)
3515 underlying_type = cxx_make_type (UNDERLYING_TYPE);
3516 UNDERLYING_TYPE_TYPE (underlying_type) = type;
3517 SET_TYPE_STRUCTURAL_EQUALITY (underlying_type);
3519 return underlying_type;
3522 complete_type (type);
3524 if (TREE_CODE (type) != ENUMERAL_TYPE)
3526 error ("%qT is not an enumeration type", type);
3527 return error_mark_node;
3530 underlying_type = ENUM_UNDERLYING_TYPE (type);
3532 /* Fixup necessary in this case because ENUM_UNDERLYING_TYPE
3533 includes TYPE_MIN_VALUE and TYPE_MAX_VALUE information.
3534 See finish_enum_value_list for details. */
3535 if (!ENUM_FIXED_UNDERLYING_TYPE_P (type))
3537 = c_common_type_for_mode (TYPE_MODE (underlying_type),
3538 TYPE_UNSIGNED (underlying_type));
3540 return underlying_type;
3543 /* Implement the __direct_bases keyword: Return the direct base classes
3547 calculate_direct_bases (tree type)
3549 vec<tree, va_gc> *vector = make_tree_vector();
3550 tree bases_vec = NULL_TREE;
3551 vec<tree, va_gc> *base_binfos;
3555 complete_type (type);
3557 if (!NON_UNION_CLASS_TYPE_P (type))
3558 return make_tree_vec (0);
3560 base_binfos = BINFO_BASE_BINFOS (TYPE_BINFO (type));
3562 /* Virtual bases are initialized first */
3563 for (i = 0; base_binfos->iterate (i, &binfo); i++)
3565 if (BINFO_VIRTUAL_P (binfo))
3567 vec_safe_push (vector, binfo);
3571 /* Now non-virtuals */
3572 for (i = 0; base_binfos->iterate (i, &binfo); i++)
3574 if (!BINFO_VIRTUAL_P (binfo))
3576 vec_safe_push (vector, binfo);
3581 bases_vec = make_tree_vec (vector->length ());
3583 for (i = 0; i < vector->length (); ++i)
3585 TREE_VEC_ELT (bases_vec, i) = BINFO_TYPE ((*vector)[i]);
3590 /* Implement the __bases keyword: Return the base classes
3593 /* Find morally non-virtual base classes by walking binfo hierarchy */
3594 /* Virtual base classes are handled separately in finish_bases */
3597 dfs_calculate_bases_pre (tree binfo, void * /*data_*/)
3599 /* Don't walk bases of virtual bases */
3600 return BINFO_VIRTUAL_P (binfo) ? dfs_skip_bases : NULL_TREE;
3604 dfs_calculate_bases_post (tree binfo, void *data_)
3606 vec<tree, va_gc> **data = ((vec<tree, va_gc> **) data_);
3607 if (!BINFO_VIRTUAL_P (binfo))
3609 vec_safe_push (*data, BINFO_TYPE (binfo));
3614 /* Calculates the morally non-virtual base classes of a class */
3615 static vec<tree, va_gc> *
3616 calculate_bases_helper (tree type)
3618 vec<tree, va_gc> *vector = make_tree_vector();
3620 /* Now add non-virtual base classes in order of construction */
3621 dfs_walk_all (TYPE_BINFO (type),
3622 dfs_calculate_bases_pre, dfs_calculate_bases_post, &vector);
3627 calculate_bases (tree type)
3629 vec<tree, va_gc> *vector = make_tree_vector();
3630 tree bases_vec = NULL_TREE;
3632 vec<tree, va_gc> *vbases;
3633 vec<tree, va_gc> *nonvbases;
3636 complete_type (type);
3638 if (!NON_UNION_CLASS_TYPE_P (type))
3639 return make_tree_vec (0);
3641 /* First go through virtual base classes */
3642 for (vbases = CLASSTYPE_VBASECLASSES (type), i = 0;
3643 vec_safe_iterate (vbases, i, &binfo); i++)
3645 vec<tree, va_gc> *vbase_bases;
3646 vbase_bases = calculate_bases_helper (BINFO_TYPE (binfo));
3647 vec_safe_splice (vector, vbase_bases);
3648 release_tree_vector (vbase_bases);
3651 /* Now for the non-virtual bases */
3652 nonvbases = calculate_bases_helper (type);
3653 vec_safe_splice (vector, nonvbases);
3654 release_tree_vector (nonvbases);
3656 /* Last element is entire class, so don't copy */
3657 bases_vec = make_tree_vec (vector->length () - 1);
3659 for (i = 0; i < vector->length () - 1; ++i)
3661 TREE_VEC_ELT (bases_vec, i) = (*vector)[i];
3663 release_tree_vector (vector);
3668 finish_bases (tree type, bool direct)
3670 tree bases = NULL_TREE;
3672 if (!processing_template_decl)
3674 /* Parameter packs can only be used in templates */
3675 error ("Parameter pack __bases only valid in template declaration");
3676 return error_mark_node;
3679 bases = cxx_make_type (BASES);
3680 BASES_TYPE (bases) = type;
3681 BASES_DIRECT (bases) = direct;
3682 SET_TYPE_STRUCTURAL_EQUALITY (bases);
3687 /* Perform C++-specific checks for __builtin_offsetof before calling
3691 finish_offsetof (tree expr)
3693 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3695 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3696 TREE_OPERAND (expr, 2));
3697 return error_mark_node;
3699 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3700 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3701 || TREE_TYPE (expr) == unknown_type_node)
3703 if (INDIRECT_REF_P (expr))
3704 error ("second operand of %<offsetof%> is neither a single "
3705 "identifier nor a sequence of member accesses and "
3706 "array references");
3709 if (TREE_CODE (expr) == COMPONENT_REF
3710 || TREE_CODE (expr) == COMPOUND_EXPR)
3711 expr = TREE_OPERAND (expr, 1);
3712 error ("cannot apply %<offsetof%> to member function %qD", expr);
3714 return error_mark_node;
3716 if (REFERENCE_REF_P (expr))
3717 expr = TREE_OPERAND (expr, 0);
3718 if (TREE_CODE (expr) == COMPONENT_REF)
3720 tree object = TREE_OPERAND (expr, 0);
3721 if (!complete_type_or_else (TREE_TYPE (object), object))
3722 return error_mark_node;
3724 return fold_offsetof (expr);
3727 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3728 function is broken out from the above for the benefit of the tree-ssa
3732 simplify_aggr_init_expr (tree *tp)
3734 tree aggr_init_expr = *tp;
3736 /* Form an appropriate CALL_EXPR. */
3737 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3738 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3739 tree type = TREE_TYPE (slot);
3742 enum style_t { ctor, arg, pcc } style;
3744 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3746 #ifdef PCC_STATIC_STRUCT_RETURN
3752 gcc_assert (TREE_ADDRESSABLE (type));
3756 call_expr = build_call_array_loc (input_location,
3757 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3759 aggr_init_expr_nargs (aggr_init_expr),
3760 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3761 TREE_NOTHROW (call_expr) = TREE_NOTHROW (aggr_init_expr);
3765 /* Replace the first argument to the ctor with the address of the
3767 cxx_mark_addressable (slot);
3768 CALL_EXPR_ARG (call_expr, 0) =
3769 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3771 else if (style == arg)
3773 /* Just mark it addressable here, and leave the rest to
3774 expand_call{,_inline}. */
3775 cxx_mark_addressable (slot);
3776 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3777 call_expr = build2 (INIT_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3779 else if (style == pcc)
3781 /* If we're using the non-reentrant PCC calling convention, then we
3782 need to copy the returned value out of the static buffer into the
3784 push_deferring_access_checks (dk_no_check);
3785 call_expr = build_aggr_init (slot, call_expr,
3786 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3787 tf_warning_or_error);
3788 pop_deferring_access_checks ();
3789 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3792 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3794 tree init = build_zero_init (type, NULL_TREE,
3795 /*static_storage_p=*/false);
3796 init = build2 (INIT_EXPR, void_type_node, slot, init);
3797 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3804 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3807 emit_associated_thunks (tree fn)
3809 /* When we use vcall offsets, we emit thunks with the virtual
3810 functions to which they thunk. The whole point of vcall offsets
3811 is so that you can know statically the entire set of thunks that
3812 will ever be needed for a given virtual function, thereby
3813 enabling you to output all the thunks with the function itself. */
3814 if (DECL_VIRTUAL_P (fn)
3815 /* Do not emit thunks for extern template instantiations. */
3816 && ! DECL_REALLY_EXTERN (fn))
3820 for (thunk = DECL_THUNKS (fn); thunk; thunk = DECL_CHAIN (thunk))
3822 if (!THUNK_ALIAS (thunk))
3824 use_thunk (thunk, /*emit_p=*/1);
3825 if (DECL_RESULT_THUNK_P (thunk))
3829 for (probe = DECL_THUNKS (thunk);
3830 probe; probe = DECL_CHAIN (probe))
3831 use_thunk (probe, /*emit_p=*/1);
3835 gcc_assert (!DECL_THUNKS (thunk));
3840 /* Returns true iff FUN is an instantiation of a constexpr function
3844 is_instantiation_of_constexpr (tree fun)
3846 return (DECL_TEMPLOID_INSTANTIATION (fun)
3847 && DECL_DECLARED_CONSTEXPR_P (DECL_TEMPLATE_RESULT
3848 (DECL_TI_TEMPLATE (fun))));
3851 /* Generate RTL for FN. */
3854 expand_or_defer_fn_1 (tree fn)
3856 /* When the parser calls us after finishing the body of a template
3857 function, we don't really want to expand the body. */
3858 if (processing_template_decl)
3860 /* Normally, collection only occurs in rest_of_compilation. So,
3861 if we don't collect here, we never collect junk generated
3862 during the processing of templates until we hit a
3863 non-template function. It's not safe to do this inside a
3864 nested class, though, as the parser may have local state that
3865 is not a GC root. */
3866 if (!function_depth)
3871 gcc_assert (DECL_SAVED_TREE (fn));
3873 /* If this is a constructor or destructor body, we have to clone
3875 if (maybe_clone_body (fn))
3877 /* We don't want to process FN again, so pretend we've written
3878 it out, even though we haven't. */
3879 TREE_ASM_WRITTEN (fn) = 1;
3880 /* If this is an instantiation of a constexpr function, keep
3881 DECL_SAVED_TREE for explain_invalid_constexpr_fn. */
3882 if (!is_instantiation_of_constexpr (fn))
3883 DECL_SAVED_TREE (fn) = NULL_TREE;
3887 /* We make a decision about linkage for these functions at the end
3888 of the compilation. Until that point, we do not want the back
3889 end to output them -- but we do want it to see the bodies of
3890 these functions so that it can inline them as appropriate. */
3891 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3893 if (DECL_INTERFACE_KNOWN (fn))
3894 /* We've already made a decision as to how this function will
3898 DECL_EXTERNAL (fn) = 1;
3899 DECL_NOT_REALLY_EXTERN (fn) = 1;
3900 note_vague_linkage_fn (fn);
3901 /* A non-template inline function with external linkage will
3902 always be COMDAT. As we must eventually determine the
3903 linkage of all functions, and as that causes writes to
3904 the data mapped in from the PCH file, it's advantageous
3905 to mark the functions at this point. */
3906 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3908 /* This function must have external linkage, as
3909 otherwise DECL_INTERFACE_KNOWN would have been
3911 gcc_assert (TREE_PUBLIC (fn));
3912 comdat_linkage (fn);
3913 DECL_INTERFACE_KNOWN (fn) = 1;
3917 import_export_decl (fn);
3919 /* If the user wants us to keep all inline functions, then mark
3920 this function as needed so that finish_file will make sure to
3921 output it later. Similarly, all dllexport'd functions must
3922 be emitted; there may be callers in other DLLs. */
3923 if ((flag_keep_inline_functions
3924 && DECL_DECLARED_INLINE_P (fn)
3925 && !DECL_REALLY_EXTERN (fn))
3926 || (flag_keep_inline_dllexport
3927 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn))))
3930 DECL_EXTERNAL (fn) = 0;
3934 /* There's no reason to do any of the work here if we're only doing
3935 semantic analysis; this code just generates RTL. */
3936 if (flag_syntax_only)
3943 expand_or_defer_fn (tree fn)
3945 if (expand_or_defer_fn_1 (fn))
3949 /* Expand or defer, at the whim of the compilation unit manager. */
3950 cgraph_finalize_function (fn, function_depth > 1);
3951 emit_associated_thunks (fn);
3961 hash_table <pointer_hash <tree_node> > visited;
3964 /* Helper function for walk_tree, used by finalize_nrv below. */
3967 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3969 struct nrv_data *dp = (struct nrv_data *)data;
3972 /* No need to walk into types. There wouldn't be any need to walk into
3973 non-statements, except that we have to consider STMT_EXPRs. */
3976 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3977 but differs from using NULL_TREE in that it indicates that we care
3978 about the value of the RESULT_DECL. */
3979 else if (TREE_CODE (*tp) == RETURN_EXPR)
3980 TREE_OPERAND (*tp, 0) = dp->result;
3981 /* Change all cleanups for the NRV to only run when an exception is
3983 else if (TREE_CODE (*tp) == CLEANUP_STMT
3984 && CLEANUP_DECL (*tp) == dp->var)
3985 CLEANUP_EH_ONLY (*tp) = 1;
3986 /* Replace the DECL_EXPR for the NRV with an initialization of the
3987 RESULT_DECL, if needed. */
3988 else if (TREE_CODE (*tp) == DECL_EXPR
3989 && DECL_EXPR_DECL (*tp) == dp->var)
3992 if (DECL_INITIAL (dp->var)
3993 && DECL_INITIAL (dp->var) != error_mark_node)
3994 init = build2 (INIT_EXPR, void_type_node, dp->result,
3995 DECL_INITIAL (dp->var));
3997 init = build_empty_stmt (EXPR_LOCATION (*tp));
3998 DECL_INITIAL (dp->var) = NULL_TREE;
3999 SET_EXPR_LOCATION (init, EXPR_LOCATION (*tp));
4002 /* And replace all uses of the NRV with the RESULT_DECL. */
4003 else if (*tp == dp->var)
4006 /* Avoid walking into the same tree more than once. Unfortunately, we
4007 can't just use walk_tree_without duplicates because it would only call
4008 us for the first occurrence of dp->var in the function body. */
4009 slot = dp->visited.find_slot (*tp, INSERT);
4015 /* Keep iterating. */
4019 /* Called from finish_function to implement the named return value
4020 optimization by overriding all the RETURN_EXPRs and pertinent
4021 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
4022 RESULT_DECL for the function. */
4025 finalize_nrv (tree *tp, tree var, tree result)
4027 struct nrv_data data;
4029 /* Copy name from VAR to RESULT. */
4030 DECL_NAME (result) = DECL_NAME (var);
4031 /* Don't forget that we take its address. */
4032 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
4033 /* Finally set DECL_VALUE_EXPR to avoid assigning
4034 a stack slot at -O0 for the original var and debug info
4035 uses RESULT location for VAR. */
4036 SET_DECL_VALUE_EXPR (var, result);
4037 DECL_HAS_VALUE_EXPR_P (var) = 1;
4040 data.result = result;
4041 data.visited.create (37);
4042 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
4043 data.visited.dispose ();
4046 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
4049 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
4050 bool need_copy_ctor, bool need_copy_assignment,
4053 int save_errorcount = errorcount;
4056 /* Always allocate 3 elements for simplicity. These are the
4057 function decls for the ctor, dtor, and assignment op.
4058 This layout is known to the three lang hooks,
4059 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
4060 and cxx_omp_clause_assign_op. */
4061 info = make_tree_vec (3);
4062 CP_OMP_CLAUSE_INFO (c) = info;
4064 if (need_default_ctor || need_copy_ctor)
4066 if (need_default_ctor)
4067 t = get_default_ctor (type);
4069 t = get_copy_ctor (type, tf_warning_or_error);
4071 if (t && !trivial_fn_p (t))
4072 TREE_VEC_ELT (info, 0) = t;
4075 if (need_dtor && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
4076 TREE_VEC_ELT (info, 1) = get_dtor (type, tf_warning_or_error);
4078 if (need_copy_assignment)
4080 t = get_copy_assign (type);
4082 if (t && !trivial_fn_p (t))
4083 TREE_VEC_ELT (info, 2) = t;
4086 return errorcount != save_errorcount;
4089 /* Helper function for handle_omp_array_sections. Called recursively
4090 to handle multiple array-section-subscripts. C is the clause,
4091 T current expression (initially OMP_CLAUSE_DECL), which is either
4092 a TREE_LIST for array-section-subscript (TREE_PURPOSE is low-bound
4093 expression if specified, TREE_VALUE length expression if specified,
4094 TREE_CHAIN is what it has been specified after, or some decl.
4095 TYPES vector is populated with array section types, MAYBE_ZERO_LEN
4096 set to true if any of the array-section-subscript could have length
4097 of zero (explicit or implicit), FIRST_NON_ONE is the index of the
4098 first array-section-subscript which is known not to have length
4100 map(a[:b][2:1][:c][:2][:d][e:f][2:5])
4101 FIRST_NON_ONE will be 3, array-section-subscript [:b], [2:1] and [:c]
4102 all are or may have length of 1, array-section-subscript [:2] is the
4103 first one knonwn not to have length 1. For array-section-subscript
4104 <= FIRST_NON_ONE we diagnose non-contiguous arrays if low bound isn't
4105 0 or length isn't the array domain max + 1, for > FIRST_NON_ONE we
4106 can if MAYBE_ZERO_LEN is false. MAYBE_ZERO_LEN will be true in the above
4107 case though, as some lengths could be zero. */
4110 handle_omp_array_sections_1 (tree c, tree t, vec<tree> &types,
4111 bool &maybe_zero_len, unsigned int &first_non_one)
4113 tree ret, low_bound, length, type;
4114 if (TREE_CODE (t) != TREE_LIST)
4116 if (error_operand_p (t))
4117 return error_mark_node;
4118 if (type_dependent_expression_p (t))
4120 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
4122 if (processing_template_decl)
4125 error_at (OMP_CLAUSE_LOCATION (c),
4126 "%qD is not a variable in %qs clause", t,
4127 omp_clause_code_name[OMP_CLAUSE_CODE (c)]);
4129 error_at (OMP_CLAUSE_LOCATION (c),
4130 "%qE is not a variable in %qs clause", t,
4131 omp_clause_code_name[OMP_CLAUSE_CODE (c)]);
4132 return error_mark_node;
4134 else if (OMP_CLAUSE_CODE (c) != OMP_CLAUSE_DEPEND
4135 && TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
4137 error_at (OMP_CLAUSE_LOCATION (c),
4138 "%qD is threadprivate variable in %qs clause", t,
4139 omp_clause_code_name[OMP_CLAUSE_CODE (c)]);
4140 return error_mark_node;
4142 t = convert_from_reference (t);
4146 ret = handle_omp_array_sections_1 (c, TREE_CHAIN (t), types,
4147 maybe_zero_len, first_non_one);
4148 if (ret == error_mark_node || ret == NULL_TREE)
4151 type = TREE_TYPE (ret);
4152 low_bound = TREE_PURPOSE (t);
4153 length = TREE_VALUE (t);
4154 if ((low_bound && type_dependent_expression_p (low_bound))
4155 || (length && type_dependent_expression_p (length)))
4158 if (low_bound == error_mark_node || length == error_mark_node)
4159 return error_mark_node;
4161 if (low_bound && !INTEGRAL_TYPE_P (TREE_TYPE (low_bound)))
4163 error_at (OMP_CLAUSE_LOCATION (c),
4164 "low bound %qE of array section does not have integral type",
4166 return error_mark_node;
4168 if (length && !INTEGRAL_TYPE_P (TREE_TYPE (length)))
4170 error_at (OMP_CLAUSE_LOCATION (c),
4171 "length %qE of array section does not have integral type",
4173 return error_mark_node;
4176 && TREE_CODE (low_bound) == INTEGER_CST
4177 && TYPE_PRECISION (TREE_TYPE (low_bound))
4178 > TYPE_PRECISION (sizetype))
4179 low_bound = fold_convert (sizetype, low_bound);
4181 && TREE_CODE (length) == INTEGER_CST
4182 && TYPE_PRECISION (TREE_TYPE (length))
4183 > TYPE_PRECISION (sizetype))
4184 length = fold_convert (sizetype, length);
4185 if (low_bound == NULL_TREE)
4186 low_bound = integer_zero_node;
4188 if (length != NULL_TREE)
4190 if (!integer_nonzerop (length))
4191 maybe_zero_len = true;
4192 if (first_non_one == types.length ()
4193 && (TREE_CODE (length) != INTEGER_CST || integer_onep (length)))
4196 if (TREE_CODE (type) == ARRAY_TYPE)
4198 if (length == NULL_TREE
4199 && (TYPE_DOMAIN (type) == NULL_TREE
4200 || TYPE_MAX_VALUE (TYPE_DOMAIN (type)) == NULL_TREE))
4202 error_at (OMP_CLAUSE_LOCATION (c),
4203 "for unknown bound array type length expression must "
4205 return error_mark_node;
4207 if (TREE_CODE (low_bound) == INTEGER_CST
4208 && tree_int_cst_sgn (low_bound) == -1)
4210 error_at (OMP_CLAUSE_LOCATION (c),
4211 "negative low bound in array section in %qs clause",
4212 omp_clause_code_name[OMP_CLAUSE_CODE (c)]);
4213 return error_mark_node;
4215 if (length != NULL_TREE
4216 && TREE_CODE (length) == INTEGER_CST
4217 && tree_int_cst_sgn (length) == -1)
4219 error_at (OMP_CLAUSE_LOCATION (c),
4220 "negative length in array section in %qs clause",
4221 omp_clause_code_name[OMP_CLAUSE_CODE (c)]);
4222 return error_mark_node;
4224 if (TYPE_DOMAIN (type)
4225 && TYPE_MAX_VALUE (TYPE_DOMAIN (type))
4226 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (type)))
4229 tree size = size_binop (PLUS_EXPR,
4230 TYPE_MAX_VALUE (TYPE_DOMAIN (type)),
4232 if (TREE_CODE (low_bound) == INTEGER_CST)
4234 if (tree_int_cst_lt (size, low_bound))
4236 error_at (OMP_CLAUSE_LOCATION (c),
4237 "low bound %qE above array section size "
4238 "in %qs clause", low_bound,
4239 omp_clause_code_name[OMP_CLAUSE_CODE (c)]);
4240 return error_mark_node;
4242 if (tree_int_cst_equal (size, low_bound))
4243 maybe_zero_len = true;
4244 else if (length == NULL_TREE
4245 && first_non_one == types.length ()
4246 && tree_int_cst_equal
4247 (TYPE_MAX_VALUE (TYPE_DOMAIN (type)),
4251 else if (length == NULL_TREE)
4253 maybe_zero_len = true;
4254 if (first_non_one == types.length ())
4257 if (length && TREE_CODE (length) == INTEGER_CST)
4259 if (tree_int_cst_lt (size, length))
4261 error_at (OMP_CLAUSE_LOCATION (c),
4262 "length %qE above array section size "
4263 "in %qs clause", length,
4264 omp_clause_code_name[OMP_CLAUSE_CODE (c)]);
4265 return error_mark_node;
4267 if (TREE_CODE (low_bound) == INTEGER_CST)
4270 = size_binop (PLUS_EXPR,
4271 fold_convert (sizetype, low_bound),
4272 fold_convert (sizetype, length));
4273 if (TREE_CODE (lbpluslen) == INTEGER_CST
4274 && tree_int_cst_lt (size, lbpluslen))
4276 error_at (OMP_CLAUSE_LOCATION (c),
4277 "high bound %qE above array section size "
4278 "in %qs clause", lbpluslen,
4279 omp_clause_code_name[OMP_CLAUSE_CODE (c)]);
4280 return error_mark_node;
4285 else if (length == NULL_TREE)
4287 maybe_zero_len = true;
4288 if (first_non_one == types.length ())
4292 /* For [lb:] we will need to evaluate lb more than once. */
4293 if (length == NULL_TREE && OMP_CLAUSE_CODE (c) != OMP_CLAUSE_DEPEND)
4295 tree lb = cp_save_expr (low_bound);
4296 if (lb != low_bound)
4298 TREE_PURPOSE (t) = lb;
4303 else if (TREE_CODE (type) == POINTER_TYPE)
4305 if (length == NULL_TREE)
4307 error_at (OMP_CLAUSE_LOCATION (c),
4308 "for pointer type length expression must be specified");
4309 return error_mark_node;
4311 /* If there is a pointer type anywhere but in the very first
4312 array-section-subscript, the array section can't be contiguous. */
4313 if (OMP_CLAUSE_CODE (c) != OMP_CLAUSE_DEPEND
4314 && TREE_CODE (TREE_CHAIN (t)) == TREE_LIST)
4316 error_at (OMP_CLAUSE_LOCATION (c),
4317 "array section is not contiguous in %qs clause",
4318 omp_clause_code_name[OMP_CLAUSE_CODE (c)]);
4319 return error_mark_node;
4324 error_at (OMP_CLAUSE_LOCATION (c),
4325 "%qE does not have pointer or array type", ret);
4326 return error_mark_node;
4328 if (OMP_CLAUSE_CODE (c) != OMP_CLAUSE_DEPEND)
4329 types.safe_push (TREE_TYPE (ret));
4330 /* We will need to evaluate lb more than once. */
4331 tree lb = cp_save_expr (low_bound);
4332 if (lb != low_bound)
4334 TREE_PURPOSE (t) = lb;
4337 ret = grok_array_decl (OMP_CLAUSE_LOCATION (c), ret, low_bound, false);
4341 /* Handle array sections for clause C. */
4344 handle_omp_array_sections (tree c)
4346 bool maybe_zero_len = false;
4347 unsigned int first_non_one = 0;
4348 vec<tree> types = vNULL;
4349 tree first = handle_omp_array_sections_1 (c, OMP_CLAUSE_DECL (c), types,
4350 maybe_zero_len, first_non_one);
4351 if (first == error_mark_node)
4356 if (first == NULL_TREE)
4361 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_DEPEND)
4363 tree t = OMP_CLAUSE_DECL (c);
4364 tree tem = NULL_TREE;
4366 if (processing_template_decl)
4368 /* Need to evaluate side effects in the length expressions
4370 while (TREE_CODE (t) == TREE_LIST)
4372 if (TREE_VALUE (t) && TREE_SIDE_EFFECTS (TREE_VALUE (t)))
4374 if (tem == NULL_TREE)
4375 tem = TREE_VALUE (t);
4377 tem = build2 (COMPOUND_EXPR, TREE_TYPE (tem),
4378 TREE_VALUE (t), tem);
4383 first = build2 (COMPOUND_EXPR, TREE_TYPE (first), tem, first);
4384 OMP_CLAUSE_DECL (c) = first;
4388 unsigned int num = types.length (), i;
4389 tree t, side_effects = NULL_TREE, size = NULL_TREE;
4390 tree condition = NULL_TREE;
4392 if (int_size_in_bytes (TREE_TYPE (first)) <= 0)
4393 maybe_zero_len = true;
4394 if (processing_template_decl && maybe_zero_len)
4400 for (i = num, t = OMP_CLAUSE_DECL (c); i > 0;
4403 tree low_bound = TREE_PURPOSE (t);
4404 tree length = TREE_VALUE (t);
4408 && TREE_CODE (low_bound) == INTEGER_CST
4409 && TYPE_PRECISION (TREE_TYPE (low_bound))
4410 > TYPE_PRECISION (sizetype))
4411 low_bound = fold_convert (sizetype, low_bound);
4413 && TREE_CODE (length) == INTEGER_CST
4414 && TYPE_PRECISION (TREE_TYPE (length))
4415 > TYPE_PRECISION (sizetype))
4416 length = fold_convert (sizetype, length);
4417 if (low_bound == NULL_TREE)
4418 low_bound = integer_zero_node;
4419 if (!maybe_zero_len && i > first_non_one)
4421 if (integer_nonzerop (low_bound))
4422 goto do_warn_noncontiguous;
4423 if (length != NULL_TREE
4424 && TREE_CODE (length) == INTEGER_CST
4425 && TYPE_DOMAIN (types[i])
4426 && TYPE_MAX_VALUE (TYPE_DOMAIN (types[i]))
4427 && TREE_CODE (TYPE_MAX_VALUE (TYPE_DOMAIN (types[i])))
4431 size = size_binop (PLUS_EXPR,
4432 TYPE_MAX_VALUE (TYPE_DOMAIN (types[i])),
4434 if (!tree_int_cst_equal (length, size))
4436 do_warn_noncontiguous:
4437 error_at (OMP_CLAUSE_LOCATION (c),
4438 "array section is not contiguous in %qs "
4440 omp_clause_code_name[OMP_CLAUSE_CODE (c)]);
4445 if (!processing_template_decl
4446 && length != NULL_TREE
4447 && TREE_SIDE_EFFECTS (length))
4449 if (side_effects == NULL_TREE)
4450 side_effects = length;
4452 side_effects = build2 (COMPOUND_EXPR,
4453 TREE_TYPE (side_effects),
4454 length, side_effects);
4457 else if (processing_template_decl)
4463 if (i > first_non_one && length && integer_nonzerop (length))
4466 l = fold_convert (sizetype, length);
4469 l = size_binop (PLUS_EXPR,
4470 TYPE_MAX_VALUE (TYPE_DOMAIN (types[i])),
4472 l = size_binop (MINUS_EXPR, l,
4473 fold_convert (sizetype, low_bound));
4475 if (i > first_non_one)
4477 l = fold_build2 (NE_EXPR, boolean_type_node, l,
4479 if (condition == NULL_TREE)
4482 condition = fold_build2 (BIT_AND_EXPR, boolean_type_node,
4485 else if (size == NULL_TREE)
4487 size = size_in_bytes (TREE_TYPE (types[i]));
4488 size = size_binop (MULT_EXPR, size, l);
4490 size = fold_build3 (COND_EXPR, sizetype, condition,
4491 size, size_zero_node);
4494 size = size_binop (MULT_EXPR, size, l);
4498 if (!processing_template_decl)
4501 size = build2 (COMPOUND_EXPR, sizetype, side_effects, size);
4502 OMP_CLAUSE_DECL (c) = first;
4503 OMP_CLAUSE_SIZE (c) = size;
4504 if (OMP_CLAUSE_CODE (c) != OMP_CLAUSE_MAP)
4506 tree c2 = build_omp_clause (OMP_CLAUSE_LOCATION (c),
4508 OMP_CLAUSE_MAP_KIND (c2) = OMP_CLAUSE_MAP_POINTER;
4509 if (!cxx_mark_addressable (t))
4511 OMP_CLAUSE_DECL (c2) = t;
4512 t = build_fold_addr_expr (first);
4513 t = fold_convert_loc (OMP_CLAUSE_LOCATION (c),
4514 ptrdiff_type_node, t);
4515 tree ptr = OMP_CLAUSE_DECL (c2);
4516 ptr = convert_from_reference (ptr);
4517 if (!POINTER_TYPE_P (TREE_TYPE (ptr)))
4518 ptr = build_fold_addr_expr (ptr);
4519 t = fold_build2_loc (OMP_CLAUSE_LOCATION (c), MINUS_EXPR,
4520 ptrdiff_type_node, t,
4521 fold_convert_loc (OMP_CLAUSE_LOCATION (c),
4522 ptrdiff_type_node, ptr));
4523 OMP_CLAUSE_SIZE (c2) = t;
4524 OMP_CLAUSE_CHAIN (c2) = OMP_CLAUSE_CHAIN (c);
4525 OMP_CLAUSE_CHAIN (c) = c2;
4526 ptr = OMP_CLAUSE_DECL (c2);
4527 if (TREE_CODE (TREE_TYPE (ptr)) == REFERENCE_TYPE
4528 && POINTER_TYPE_P (TREE_TYPE (TREE_TYPE (ptr))))
4530 tree c3 = build_omp_clause (OMP_CLAUSE_LOCATION (c),
4532 OMP_CLAUSE_MAP_KIND (c3) = OMP_CLAUSE_MAP_POINTER;
4533 OMP_CLAUSE_DECL (c3) = ptr;
4534 OMP_CLAUSE_DECL (c2) = convert_from_reference (ptr);
4535 OMP_CLAUSE_SIZE (c3) = size_zero_node;
4536 OMP_CLAUSE_CHAIN (c3) = OMP_CLAUSE_CHAIN (c2);
4537 OMP_CLAUSE_CHAIN (c2) = c3;
4544 /* Return identifier to look up for omp declare reduction. */
4547 omp_reduction_id (enum tree_code reduction_code, tree reduction_id, tree type)
4549 const char *p = NULL;
4550 const char *m = NULL;
4551 switch (reduction_code)
4559 case TRUTH_ANDIF_EXPR:
4560 case TRUTH_ORIF_EXPR:
4561 reduction_id = ansi_opname (reduction_code);
4575 if (TREE_CODE (reduction_id) != IDENTIFIER_NODE)
4576 return error_mark_node;
4577 p = IDENTIFIER_POINTER (reduction_id);
4580 if (type != NULL_TREE)
4581 m = mangle_type_string (TYPE_MAIN_VARIANT (type));
4583 const char prefix[] = "omp declare reduction ";
4584 size_t lenp = sizeof (prefix);
4585 if (strncmp (p, prefix, lenp - 1) == 0)
4587 size_t len = strlen (p);
4588 size_t lenm = m ? strlen (m) + 1 : 0;
4589 char *name = XALLOCAVEC (char, lenp + len + lenm);
4591 memcpy (name, prefix, lenp - 1);
4592 memcpy (name + lenp - 1, p, len + 1);
4595 name[lenp + len - 1] = '~';
4596 memcpy (name + lenp + len, m, lenm);
4598 return get_identifier (name);
4601 /* Lookup OpenMP UDR ID for TYPE, return the corresponding artificial
4602 FUNCTION_DECL or NULL_TREE if not found. */
4605 omp_reduction_lookup (location_t loc, tree id, tree type, tree *baselinkp,
4606 vec<tree> *ambiguousp)
4609 tree baselink = NULL_TREE;
4610 if (identifier_p (id))
4613 bool nonint_cst_expression_p;
4614 const char *error_msg;
4615 id = omp_reduction_id (ERROR_MARK, id, type);
4616 tree decl = lookup_name (id);
4617 if (decl == NULL_TREE)
4618 decl = error_mark_node;
4619 id = finish_id_expression (id, decl, NULL_TREE, &idk, false, true,
4620 &nonint_cst_expression_p, false, true, false,
4621 false, &error_msg, loc);
4622 if (idk == CP_ID_KIND_UNQUALIFIED
4623 && identifier_p (id))
4625 vec<tree, va_gc> *args = NULL;
4626 vec_safe_push (args, build_reference_type (type));
4627 id = perform_koenig_lookup (id, args, false, tf_none);
4630 else if (TREE_CODE (id) == SCOPE_REF)
4631 id = lookup_qualified_name (TREE_OPERAND (id, 0),
4632 omp_reduction_id (ERROR_MARK,
4633 TREE_OPERAND (id, 1),
4637 if (id && is_overloaded_fn (id))
4639 for (; id; id = OVL_NEXT (id))
4641 tree fndecl = OVL_CURRENT (id);
4642 if (TREE_CODE (fndecl) == FUNCTION_DECL)
4644 tree argtype = TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (fndecl)));
4645 if (same_type_p (TREE_TYPE (argtype), type))
4649 if (id && BASELINK_P (fns))
4656 if (id == NULL_TREE && CLASS_TYPE_P (type) && TYPE_BINFO (type))
4658 vec<tree> ambiguous = vNULL;
4659 tree binfo = TYPE_BINFO (type), base_binfo, ret = NULL_TREE;
4661 if (ambiguousp == NULL)
4662 ambiguousp = &ambiguous;
4663 for (ix = 0; BINFO_BASE_ITERATE (binfo, ix, base_binfo); ix++)
4665 id = omp_reduction_lookup (loc, orig_id, BINFO_TYPE (base_binfo),
4666 baselinkp ? baselinkp : &baselink,
4668 if (id == NULL_TREE)
4670 if (!ambiguousp->is_empty ())
4671 ambiguousp->safe_push (id);
4672 else if (ret != NULL_TREE)
4674 ambiguousp->safe_push (ret);
4675 ambiguousp->safe_push (id);
4681 if (ambiguousp != &ambiguous)
4683 if (!ambiguous.is_empty ())
4685 const char *str = _("candidates are:");
4688 error_at (loc, "user defined reduction lookup is ambiguous");
4689 FOR_EACH_VEC_ELT (ambiguous, idx, udr)
4691 inform (DECL_SOURCE_LOCATION (udr), "%s %#D", str, udr);
4693 str = get_spaces (str);
4695 ambiguous.release ();
4696 ret = error_mark_node;
4697 baselink = NULL_TREE;
4702 perform_or_defer_access_check (BASELINK_BINFO (baselink),
4703 id, id, tf_warning_or_error);
4707 /* Helper function for cp_parser_omp_declare_reduction_exprs
4709 Remove CLEANUP_STMT for data (omp_priv variable).
4710 Also append INIT_EXPR for DECL_INITIAL of omp_priv after its
4714 cp_remove_omp_priv_cleanup_stmt (tree *tp, int *walk_subtrees, void *data)
4718 else if (TREE_CODE (*tp) == CLEANUP_STMT && CLEANUP_DECL (*tp) == (tree) data)
4719 *tp = CLEANUP_BODY (*tp);
4720 else if (TREE_CODE (*tp) == DECL_EXPR)
4722 tree decl = DECL_EXPR_DECL (*tp);
4723 if (!processing_template_decl
4724 && decl == (tree) data
4725 && DECL_INITIAL (decl)
4726 && DECL_INITIAL (decl) != error_mark_node)
4728 tree list = NULL_TREE;
4729 append_to_statement_list_force (*tp, &list);
4730 tree init_expr = build2 (INIT_EXPR, void_type_node,
4731 decl, DECL_INITIAL (decl));
4732 DECL_INITIAL (decl) = NULL_TREE;
4733 append_to_statement_list_force (init_expr, &list);
4740 /* Data passed from cp_check_omp_declare_reduction to
4741 cp_check_omp_declare_reduction_r. */
4743 struct cp_check_omp_declare_reduction_data
4750 /* Helper function for cp_check_omp_declare_reduction, called via
4754 cp_check_omp_declare_reduction_r (tree *tp, int *, void *data)
4756 struct cp_check_omp_declare_reduction_data *udr_data
4757 = (struct cp_check_omp_declare_reduction_data *) data;
4759 && !DECL_ARTIFICIAL (*tp)
4760 && *tp != DECL_EXPR_DECL (udr_data->stmts[udr_data->combiner_p ? 0 : 3])
4761 && *tp != DECL_EXPR_DECL (udr_data->stmts[udr_data->combiner_p ? 1 : 4]))
4763 location_t loc = udr_data->loc;
4764 if (udr_data->combiner_p)
4765 error_at (loc, "%<#pragma omp declare reduction%> combiner refers to "
4766 "variable %qD which is not %<omp_out%> nor %<omp_in%>",
4769 error_at (loc, "%<#pragma omp declare reduction%> initializer refers "
4770 "to variable %qD which is not %<omp_priv%> nor "
4778 /* Diagnose violation of OpenMP #pragma omp declare reduction restrictions. */
4781 cp_check_omp_declare_reduction (tree udr)
4783 tree type = TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (udr)));
4784 gcc_assert (TREE_CODE (type) == REFERENCE_TYPE);
4785 type = TREE_TYPE (type);
4787 location_t loc = DECL_SOURCE_LOCATION (udr);
4789 if (type == error_mark_node)
4791 if (ARITHMETIC_TYPE_P (type))
4793 static enum tree_code predef_codes[]
4794 = { PLUS_EXPR, MULT_EXPR, MINUS_EXPR, BIT_AND_EXPR, BIT_XOR_EXPR,
4795 BIT_IOR_EXPR, TRUTH_ANDIF_EXPR, TRUTH_ORIF_EXPR };
4796 for (i = 0; i < 8; i++)
4798 tree id = omp_reduction_id (predef_codes[i], NULL_TREE, NULL_TREE);
4799 const char *n1 = IDENTIFIER_POINTER (DECL_NAME (udr));
4800 const char *n2 = IDENTIFIER_POINTER (id);
4801 if (strncmp (n1, n2, IDENTIFIER_LENGTH (id)) == 0
4802 && (n1[IDENTIFIER_LENGTH (id)] == '~'
4803 || n1[IDENTIFIER_LENGTH (id)] == '\0'))
4808 && TREE_CODE (type) != COMPLEX_EXPR)
4810 const char prefix_minmax[] = "omp declare reduction m";
4811 size_t prefix_size = sizeof (prefix_minmax) - 1;
4812 const char *n = IDENTIFIER_POINTER (DECL_NAME (udr));
4813 if (strncmp (IDENTIFIER_POINTER (DECL_NAME (udr)),
4814 prefix_minmax, prefix_size) == 0
4815 && ((n[prefix_size] == 'i' && n[prefix_size + 1] == 'n')
4816 || (n[prefix_size] == 'a' && n[prefix_size + 1] == 'x'))
4817 && (n[prefix_size + 2] == '~' || n[prefix_size + 2] == '\0'))
4822 error_at (loc, "predeclared arithmetic type %qT in "
4823 "%<#pragma omp declare reduction%>", type);
4827 else if (TREE_CODE (type) == FUNCTION_TYPE
4828 || TREE_CODE (type) == METHOD_TYPE
4829 || TREE_CODE (type) == ARRAY_TYPE)
4831 error_at (loc, "function or array type %qT in "
4832 "%<#pragma omp declare reduction%>", type);
4835 else if (TREE_CODE (type) == REFERENCE_TYPE)
4837 error_at (loc, "reference type %qT in %<#pragma omp declare reduction%>",
4841 else if (TYPE_QUALS_NO_ADDR_SPACE (type))
4843 error_at (loc, "const, volatile or __restrict qualified type %qT in "
4844 "%<#pragma omp declare reduction%>", type);
4848 tree body = DECL_SAVED_TREE (udr);
4849 if (body == NULL_TREE || TREE_CODE (body) != STATEMENT_LIST)
4852 tree_stmt_iterator tsi;
4853 struct cp_check_omp_declare_reduction_data data;
4854 memset (data.stmts, 0, sizeof data.stmts);
4855 for (i = 0, tsi = tsi_start (body);
4856 i < 7 && !tsi_end_p (tsi);
4857 i++, tsi_next (&tsi))
4858 data.stmts[i] = tsi_stmt (tsi);
4860 gcc_assert (tsi_end_p (tsi));
4863 gcc_assert (TREE_CODE (data.stmts[0]) == DECL_EXPR
4864 && TREE_CODE (data.stmts[1]) == DECL_EXPR);
4865 if (TREE_NO_WARNING (DECL_EXPR_DECL (data.stmts[0])))
4867 data.combiner_p = true;
4868 if (cp_walk_tree (&data.stmts[2], cp_check_omp_declare_reduction_r,
4870 TREE_NO_WARNING (DECL_EXPR_DECL (data.stmts[0])) = 1;
4874 gcc_assert (TREE_CODE (data.stmts[3]) == DECL_EXPR
4875 && TREE_CODE (data.stmts[4]) == DECL_EXPR);
4876 data.combiner_p = false;
4877 if (cp_walk_tree (&data.stmts[5], cp_check_omp_declare_reduction_r,
4879 || cp_walk_tree (&DECL_INITIAL (DECL_EXPR_DECL (data.stmts[3])),
4880 cp_check_omp_declare_reduction_r, &data, NULL))
4881 TREE_NO_WARNING (DECL_EXPR_DECL (data.stmts[0])) = 1;
4883 gcc_assert (TREE_CODE (data.stmts[6]) == DECL_EXPR);
4887 /* Helper function of finish_omp_clauses. Clone STMT as if we were making
4888 an inline call. But, remap
4889 the OMP_DECL1 VAR_DECL (omp_out resp. omp_orig) to PLACEHOLDER
4890 and OMP_DECL2 VAR_DECL (omp_in resp. omp_priv) to DECL. */
4893 clone_omp_udr (tree stmt, tree omp_decl1, tree omp_decl2,
4894 tree decl, tree placeholder)
4897 struct pointer_map_t *decl_map = pointer_map_create ();
4899 *pointer_map_insert (decl_map, omp_decl1) = placeholder;
4900 *pointer_map_insert (decl_map, omp_decl2) = decl;
4901 memset (&id, 0, sizeof (id));
4902 id.src_fn = DECL_CONTEXT (omp_decl1);
4903 id.dst_fn = current_function_decl;
4904 id.src_cfun = DECL_STRUCT_FUNCTION (id.src_fn);
4905 id.decl_map = decl_map;
4907 id.copy_decl = copy_decl_no_change;
4908 id.transform_call_graph_edges = CB_CGE_DUPLICATE;
4909 id.transform_new_cfg = true;
4910 id.transform_return_to_modify = false;
4911 id.transform_lang_insert_block = NULL;
4913 walk_tree (&stmt, copy_tree_body_r, &id, NULL);
4914 pointer_map_destroy (decl_map);
4918 /* Helper function of finish_omp_clauses, called via cp_walk_tree.
4919 Find OMP_CLAUSE_PLACEHOLDER (passed in DATA) in *TP. */
4922 find_omp_placeholder_r (tree *tp, int *, void *data)
4924 if (*tp == (tree) data)
4929 /* Helper function of finish_omp_clauses. Handle OMP_CLAUSE_REDUCTION C.
4930 Return true if there is some error and the clause should be removed. */
4933 finish_omp_reduction_clause (tree c, bool *need_default_ctor, bool *need_dtor)
4935 tree t = OMP_CLAUSE_DECL (c);
4936 bool predefined = false;
4937 tree type = TREE_TYPE (t);
4938 if (TREE_CODE (type) == REFERENCE_TYPE)
4939 type = TREE_TYPE (type);
4940 if (ARITHMETIC_TYPE_P (type))
4941 switch (OMP_CLAUSE_REDUCTION_CODE (c))
4950 if (TREE_CODE (type) == COMPLEX_TYPE)
4957 case TRUTH_ANDIF_EXPR:
4958 case TRUTH_ORIF_EXPR:
4959 if (FLOAT_TYPE_P (type))
4966 else if (TREE_CODE (type) == ARRAY_TYPE || TYPE_READONLY (type))
4968 error ("%qE has invalid type for %<reduction%>", t);
4971 else if (!processing_template_decl)
4973 t = require_complete_type (t);
4974 if (t == error_mark_node)
4976 OMP_CLAUSE_DECL (c) = t;
4981 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c) = NULL_TREE;
4984 else if (processing_template_decl)
4987 tree id = OMP_CLAUSE_REDUCTION_PLACEHOLDER (c);
4989 type = TYPE_MAIN_VARIANT (TREE_TYPE (t));
4990 if (TREE_CODE (type) == REFERENCE_TYPE)
4991 type = TREE_TYPE (type);
4992 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c) = NULL_TREE;
4993 if (id == NULL_TREE)
4994 id = omp_reduction_id (OMP_CLAUSE_REDUCTION_CODE (c),
4995 NULL_TREE, NULL_TREE);
4996 id = omp_reduction_lookup (OMP_CLAUSE_LOCATION (c), id, type, NULL, NULL);
4999 if (id == error_mark_node)
5001 id = OVL_CURRENT (id);
5003 tree body = DECL_SAVED_TREE (id);
5004 if (TREE_CODE (body) == STATEMENT_LIST)
5006 tree_stmt_iterator tsi;
5007 tree placeholder = NULL_TREE;
5010 tree atype = TREE_VALUE (TYPE_ARG_TYPES (TREE_TYPE (id)));
5011 atype = TREE_TYPE (atype);
5012 bool need_static_cast = !same_type_p (type, atype);
5013 memset (stmts, 0, sizeof stmts);
5014 for (i = 0, tsi = tsi_start (body);
5015 i < 7 && !tsi_end_p (tsi);
5016 i++, tsi_next (&tsi))
5017 stmts[i] = tsi_stmt (tsi);
5018 gcc_assert (tsi_end_p (tsi));
5022 gcc_assert (TREE_CODE (stmts[0]) == DECL_EXPR
5023 && TREE_CODE (stmts[1]) == DECL_EXPR);
5024 placeholder = build_lang_decl (VAR_DECL, NULL_TREE, type);
5025 DECL_ARTIFICIAL (placeholder) = 1;
5026 DECL_IGNORED_P (placeholder) = 1;
5027 OMP_CLAUSE_REDUCTION_PLACEHOLDER (c) = placeholder;
5028 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts[0])))
5029 cxx_mark_addressable (placeholder);
5030 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts[1]))
5031 && TREE_CODE (TREE_TYPE (OMP_CLAUSE_DECL (c)))
5033 cxx_mark_addressable (OMP_CLAUSE_DECL (c));
5034 tree omp_out = placeholder;
5035 tree omp_in = convert_from_reference (OMP_CLAUSE_DECL (c));
5036 if (need_static_cast)
5038 tree rtype = build_reference_type (atype);
5039 omp_out = build_static_cast (rtype, omp_out,
5040 tf_warning_or_error);
5041 omp_in = build_static_cast (rtype, omp_in,
5042 tf_warning_or_error);
5043 if (omp_out == error_mark_node || omp_in == error_mark_node)
5045 omp_out = convert_from_reference (omp_out);
5046 omp_in = convert_from_reference (omp_in);
5048 OMP_CLAUSE_REDUCTION_MERGE (c)
5049 = clone_omp_udr (stmts[2], DECL_EXPR_DECL (stmts[0]),
5050 DECL_EXPR_DECL (stmts[1]), omp_in, omp_out);
5054 gcc_assert (TREE_CODE (stmts[3]) == DECL_EXPR
5055 && TREE_CODE (stmts[4]) == DECL_EXPR);
5056 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts[3])))
5057 cxx_mark_addressable (OMP_CLAUSE_DECL (c));
5058 if (TREE_ADDRESSABLE (DECL_EXPR_DECL (stmts[4])))
5059 cxx_mark_addressable (placeholder);
5060 tree omp_priv = convert_from_reference (OMP_CLAUSE_DECL (c));
5061 tree omp_orig = placeholder;
5062 if (need_static_cast)
5066 error_at (OMP_CLAUSE_LOCATION (c),
5067 "user defined reduction with constructor "
5068 "initializer for base class %qT", atype);
5071 tree rtype = build_reference_type (atype);
5072 omp_priv = build_static_cast (rtype, omp_priv,
5073 tf_warning_or_error);
5074 omp_orig = build_static_cast (rtype, omp_orig,
5075 tf_warning_or_error);
5076 if (omp_priv == error_mark_node
5077 || omp_orig == error_mark_node)
5079 omp_priv = convert_from_reference (omp_priv);
5080 omp_orig = convert_from_reference (omp_orig);
5083 *need_default_ctor = true;
5084 OMP_CLAUSE_REDUCTION_INIT (c)
5085 = clone_omp_udr (stmts[5], DECL_EXPR_DECL (stmts[4]),
5086 DECL_EXPR_DECL (stmts[3]),
5087 omp_priv, omp_orig);
5088 if (cp_walk_tree (&OMP_CLAUSE_REDUCTION_INIT (c),
5089 find_omp_placeholder_r, placeholder, NULL))
5090 OMP_CLAUSE_REDUCTION_OMP_ORIG_REF (c) = 1;
5094 if (CLASS_TYPE_P (type) && !pod_type_p (type))
5095 *need_default_ctor = true;
5099 tree v = convert_from_reference (t);
5100 if (AGGREGATE_TYPE_P (TREE_TYPE (v)))
5101 init = build_constructor (TREE_TYPE (v), NULL);
5103 init = fold_convert (TREE_TYPE (v), integer_zero_node);
5104 OMP_CLAUSE_REDUCTION_INIT (c)
5105 = build2 (INIT_EXPR, TREE_TYPE (v), v, init);
5110 if (OMP_CLAUSE_REDUCTION_PLACEHOLDER (c))
5114 error ("user defined reduction not found for %qD", t);
5120 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
5121 Remove any elements from the list that are invalid. */
5124 finish_omp_clauses (tree clauses)
5126 bitmap_head generic_head, firstprivate_head, lastprivate_head;
5127 bitmap_head aligned_head;
5128 tree c, t, *pc = &clauses;
5129 bool branch_seen = false;
5130 bool copyprivate_seen = false;
5132 bitmap_obstack_initialize (NULL);
5133 bitmap_initialize (&generic_head, &bitmap_default_obstack);
5134 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
5135 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
5136 bitmap_initialize (&aligned_head, &bitmap_default_obstack);
5138 for (pc = &clauses, c = clauses; c ; c = *pc)
5140 bool remove = false;
5142 switch (OMP_CLAUSE_CODE (c))
5144 case OMP_CLAUSE_SHARED:
5145 goto check_dup_generic;
5146 case OMP_CLAUSE_PRIVATE:
5147 goto check_dup_generic;
5148 case OMP_CLAUSE_REDUCTION:
5149 goto check_dup_generic;
5150 case OMP_CLAUSE_COPYPRIVATE:
5151 copyprivate_seen = true;
5152 goto check_dup_generic;
5153 case OMP_CLAUSE_COPYIN:
5154 goto check_dup_generic;
5155 case OMP_CLAUSE_LINEAR:
5156 t = OMP_CLAUSE_DECL (c);
5157 if (!type_dependent_expression_p (t)
5158 && !INTEGRAL_TYPE_P (TREE_TYPE (t))
5159 && TREE_CODE (TREE_TYPE (t)) != POINTER_TYPE)
5161 error ("linear clause applied to non-integral non-pointer "
5162 "variable with %qT type", TREE_TYPE (t));
5166 t = OMP_CLAUSE_LINEAR_STEP (c);
5168 t = integer_one_node;
5169 if (t == error_mark_node)
5171 else if (!type_dependent_expression_p (t)
5172 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
5174 error ("linear step expression must be integral");
5179 t = mark_rvalue_use (t);
5180 if (!processing_template_decl)
5182 t = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
5183 if (TREE_CODE (TREE_TYPE (OMP_CLAUSE_DECL (c)))
5186 t = pointer_int_sum (OMP_CLAUSE_LOCATION (c), PLUS_EXPR,
5187 OMP_CLAUSE_DECL (c), t);
5188 t = fold_build2_loc (OMP_CLAUSE_LOCATION (c),
5189 MINUS_EXPR, sizetype, t,
5190 OMP_CLAUSE_DECL (c));
5191 if (t == error_mark_node)
5195 OMP_CLAUSE_LINEAR_STEP (c) = t;
5197 goto check_dup_generic;
5199 t = OMP_CLAUSE_DECL (c);
5200 if (!VAR_P (t) && TREE_CODE (t) != PARM_DECL)
5202 if (processing_template_decl)
5205 error ("%qD is not a variable in clause %qs", t,
5206 omp_clause_code_name[OMP_CLAUSE_CODE (c)]);
5208 error ("%qE is not a variable in clause %qs", t,
5209 omp_clause_code_name[OMP_CLAUSE_CODE (c)]);
5212 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
5213 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
5214 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
5216 error ("%qD appears more than once in data clauses", t);
5220 bitmap_set_bit (&generic_head, DECL_UID (t));
5223 case OMP_CLAUSE_FIRSTPRIVATE:
5224 t = OMP_CLAUSE_DECL (c);
5225 if (!VAR_P (t) && TREE_CODE (t) != PARM_DECL)
5227 if (processing_template_decl)
5230 error ("%qD is not a variable in clause %<firstprivate%>", t);
5232 error ("%qE is not a variable in clause %<firstprivate%>", t);
5235 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
5236 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
5238 error ("%qD appears more than once in data clauses", t);
5242 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
5245 case OMP_CLAUSE_LASTPRIVATE:
5246 t = OMP_CLAUSE_DECL (c);
5247 if (!VAR_P (t) && TREE_CODE (t) != PARM_DECL)
5249 if (processing_template_decl)
5252 error ("%qD is not a variable in clause %<lastprivate%>", t);
5254 error ("%qE is not a variable in clause %<lastprivate%>", t);
5257 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
5258 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
5260 error ("%qD appears more than once in data clauses", t);
5264 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
5268 t = OMP_CLAUSE_IF_EXPR (c);
5269 t = maybe_convert_cond (t);
5270 if (t == error_mark_node)
5272 else if (!processing_template_decl)
5273 t = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
5274 OMP_CLAUSE_IF_EXPR (c) = t;
5277 case OMP_CLAUSE_FINAL:
5278 t = OMP_CLAUSE_FINAL_EXPR (c);
5279 t = maybe_convert_cond (t);
5280 if (t == error_mark_node)
5282 else if (!processing_template_decl)
5283 t = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
5284 OMP_CLAUSE_FINAL_EXPR (c) = t;
5287 case OMP_CLAUSE_NUM_THREADS:
5288 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
5289 if (t == error_mark_node)
5291 else if (!type_dependent_expression_p (t)
5292 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
5294 error ("num_threads expression must be integral");
5299 t = mark_rvalue_use (t);
5300 if (!processing_template_decl)
5301 t = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
5302 OMP_CLAUSE_NUM_THREADS_EXPR (c) = t;
5306 case OMP_CLAUSE_SCHEDULE:
5307 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
5310 else if (t == error_mark_node)
5312 else if (!type_dependent_expression_p (t)
5313 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
5315 error ("schedule chunk size expression must be integral");
5320 t = mark_rvalue_use (t);
5321 if (!processing_template_decl)
5322 t = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
5323 OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c) = t;
5327 case OMP_CLAUSE_SIMDLEN:
5328 case OMP_CLAUSE_SAFELEN:
5329 t = OMP_CLAUSE_OPERAND (c, 0);
5330 if (t == error_mark_node)
5332 else if (!type_dependent_expression_p (t)
5333 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
5335 error ("%qs length expression must be integral",
5336 omp_clause_code_name[OMP_CLAUSE_CODE (c)]);
5341 t = mark_rvalue_use (t);
5342 t = maybe_constant_value (t);
5343 if (!processing_template_decl)
5345 if (TREE_CODE (t) != INTEGER_CST
5346 || tree_int_cst_sgn (t) != 1)
5348 error ("%qs length expression must be positive constant"
5349 " integer expression",
5350 omp_clause_code_name[OMP_CLAUSE_CODE (c)]);
5354 OMP_CLAUSE_OPERAND (c, 0) = t;
5358 case OMP_CLAUSE_NUM_TEAMS:
5359 t = OMP_CLAUSE_NUM_TEAMS_EXPR (c);
5360 if (t == error_mark_node)
5362 else if (!type_dependent_expression_p (t)
5363 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
5365 error ("%<num_teams%> expression must be integral");
5370 t = mark_rvalue_use (t);
5371 if (!processing_template_decl)
5372 t = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
5373 OMP_CLAUSE_NUM_TEAMS_EXPR (c) = t;
5377 case OMP_CLAUSE_THREAD_LIMIT:
5378 t = OMP_CLAUSE_THREAD_LIMIT_EXPR (c);
5379 if (t == error_mark_node)
5381 else if (!type_dependent_expression_p (t)
5382 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
5384 error ("%<thread_limit%> expression must be integral");
5389 t = mark_rvalue_use (t);
5390 if (!processing_template_decl)
5391 t = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
5392 OMP_CLAUSE_THREAD_LIMIT_EXPR (c) = t;
5396 case OMP_CLAUSE_DEVICE:
5397 t = OMP_CLAUSE_DEVICE_ID (c);
5398 if (t == error_mark_node)
5400 else if (!type_dependent_expression_p (t)
5401 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
5403 error ("%<device%> id must be integral");
5408 t = mark_rvalue_use (t);
5409 if (!processing_template_decl)
5410 t = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
5411 OMP_CLAUSE_DEVICE_ID (c) = t;
5415 case OMP_CLAUSE_DIST_SCHEDULE:
5416 t = OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c);
5419 else if (t == error_mark_node)
5421 else if (!type_dependent_expression_p (t)
5422 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
5424 error ("%<dist_schedule%> chunk size expression must be "
5430 t = mark_rvalue_use (t);
5431 if (!processing_template_decl)
5432 t = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
5433 OMP_CLAUSE_DIST_SCHEDULE_CHUNK_EXPR (c) = t;
5437 case OMP_CLAUSE_ALIGNED:
5438 t = OMP_CLAUSE_DECL (c);
5439 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
5441 if (processing_template_decl)
5444 error ("%qD is not a variable in %<aligned%> clause", t);
5446 error ("%qE is not a variable in %<aligned%> clause", t);
5449 else if (bitmap_bit_p (&aligned_head, DECL_UID (t)))
5451 error ("%qD appears more than once in %<aligned%> clauses", t);
5455 bitmap_set_bit (&aligned_head, DECL_UID (t));
5456 t = OMP_CLAUSE_ALIGNED_ALIGNMENT (c);
5457 if (t == error_mark_node)
5459 else if (t == NULL_TREE)
5461 else if (!type_dependent_expression_p (t)
5462 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
5464 error ("%<aligned%> clause alignment expression must "
5470 t = mark_rvalue_use (t);
5471 t = maybe_constant_value (t);
5472 if (!processing_template_decl)
5474 if (TREE_CODE (t) != INTEGER_CST
5475 || tree_int_cst_sgn (t) != 1)
5477 error ("%<aligned%> clause alignment expression must be "
5478 "positive constant integer expression");
5482 OMP_CLAUSE_ALIGNED_ALIGNMENT (c) = t;
5486 case OMP_CLAUSE_DEPEND:
5487 t = OMP_CLAUSE_DECL (c);
5488 if (TREE_CODE (t) == TREE_LIST)
5490 if (handle_omp_array_sections (c))
5494 if (t == error_mark_node)
5496 else if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
5498 if (processing_template_decl)
5501 error ("%qD is not a variable in %<depend%> clause", t);
5503 error ("%qE is not a variable in %<depend%> clause", t);
5506 else if (!processing_template_decl
5507 && !cxx_mark_addressable (t))
5511 case OMP_CLAUSE_MAP:
5513 case OMP_CLAUSE_FROM:
5514 t = OMP_CLAUSE_DECL (c);
5515 if (TREE_CODE (t) == TREE_LIST)
5517 if (handle_omp_array_sections (c))
5521 t = OMP_CLAUSE_DECL (c);
5522 if (!cp_omp_mappable_type (TREE_TYPE (t)))
5524 error_at (OMP_CLAUSE_LOCATION (c),
5525 "array section does not have mappable type "
5527 omp_clause_code_name[OMP_CLAUSE_CODE (c)]);
5533 if (t == error_mark_node)
5535 else if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
5537 if (processing_template_decl)
5539 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_MAP
5540 && OMP_CLAUSE_MAP_KIND (c) == OMP_CLAUSE_MAP_POINTER)
5543 error ("%qD is not a variable in %qs clause", t,
5544 omp_clause_code_name[OMP_CLAUSE_CODE (c)]);
5546 error ("%qE is not a variable in %qs clause", t,
5547 omp_clause_code_name[OMP_CLAUSE_CODE (c)]);
5550 else if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
5552 error ("%qD is threadprivate variable in %qs clause", t,
5553 omp_clause_code_name[OMP_CLAUSE_CODE (c)]);
5556 else if (!processing_template_decl
5557 && TREE_CODE (TREE_TYPE (t)) != REFERENCE_TYPE
5558 && !cxx_mark_addressable (t))
5560 else if (!(OMP_CLAUSE_CODE (c) == OMP_CLAUSE_MAP
5561 && OMP_CLAUSE_MAP_KIND (c) == OMP_CLAUSE_MAP_POINTER)
5562 && !cp_omp_mappable_type ((TREE_CODE (TREE_TYPE (t))
5564 ? TREE_TYPE (TREE_TYPE (t))
5567 error_at (OMP_CLAUSE_LOCATION (c),
5568 "%qD does not have a mappable type in %qs clause", t,
5569 omp_clause_code_name[OMP_CLAUSE_CODE (c)]);
5572 else if (bitmap_bit_p (&generic_head, DECL_UID (t)))
5574 if (OMP_CLAUSE_CODE (c) != OMP_CLAUSE_MAP)
5575 error ("%qD appears more than once in motion clauses", t);
5577 error ("%qD appears more than once in map clauses", t);
5581 bitmap_set_bit (&generic_head, DECL_UID (t));
5584 case OMP_CLAUSE_UNIFORM:
5585 t = OMP_CLAUSE_DECL (c);
5586 if (TREE_CODE (t) != PARM_DECL)
5588 if (processing_template_decl)
5591 error ("%qD is not an argument in %<uniform%> clause", t);
5593 error ("%qE is not an argument in %<uniform%> clause", t);
5598 case OMP_CLAUSE_NOWAIT:
5599 case OMP_CLAUSE_ORDERED:
5600 case OMP_CLAUSE_DEFAULT:
5601 case OMP_CLAUSE_UNTIED:
5602 case OMP_CLAUSE_COLLAPSE:
5603 case OMP_CLAUSE_MERGEABLE:
5604 case OMP_CLAUSE_PARALLEL:
5605 case OMP_CLAUSE_FOR:
5606 case OMP_CLAUSE_SECTIONS:
5607 case OMP_CLAUSE_TASKGROUP:
5608 case OMP_CLAUSE_PROC_BIND:
5611 case OMP_CLAUSE_INBRANCH:
5612 case OMP_CLAUSE_NOTINBRANCH:
5615 error ("%<inbranch%> clause is incompatible with "
5627 *pc = OMP_CLAUSE_CHAIN (c);
5629 pc = &OMP_CLAUSE_CHAIN (c);
5632 for (pc = &clauses, c = clauses; c ; c = *pc)
5634 enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c);
5635 bool remove = false;
5636 bool need_complete_non_reference = false;
5637 bool need_default_ctor = false;
5638 bool need_copy_ctor = false;
5639 bool need_copy_assignment = false;
5640 bool need_implicitly_determined = false;
5641 bool need_dtor = false;
5642 tree type, inner_type;
5646 case OMP_CLAUSE_SHARED:
5647 need_implicitly_determined = true;
5649 case OMP_CLAUSE_PRIVATE:
5650 need_complete_non_reference = true;
5651 need_default_ctor = true;
5653 need_implicitly_determined = true;
5655 case OMP_CLAUSE_FIRSTPRIVATE:
5656 need_complete_non_reference = true;
5657 need_copy_ctor = true;
5659 need_implicitly_determined = true;
5661 case OMP_CLAUSE_LASTPRIVATE:
5662 need_complete_non_reference = true;
5663 need_copy_assignment = true;
5664 need_implicitly_determined = true;
5666 case OMP_CLAUSE_REDUCTION:
5667 need_implicitly_determined = true;
5669 case OMP_CLAUSE_COPYPRIVATE:
5670 need_copy_assignment = true;
5672 case OMP_CLAUSE_COPYIN:
5673 need_copy_assignment = true;
5675 case OMP_CLAUSE_NOWAIT:
5676 if (copyprivate_seen)
5678 error_at (OMP_CLAUSE_LOCATION (c),
5679 "%<nowait%> clause must not be used together "
5680 "with %<copyprivate%>");
5681 *pc = OMP_CLAUSE_CHAIN (c);
5686 pc = &OMP_CLAUSE_CHAIN (c);
5690 t = OMP_CLAUSE_DECL (c);
5691 if (processing_template_decl
5692 && !VAR_P (t) && TREE_CODE (t) != PARM_DECL)
5694 pc = &OMP_CLAUSE_CHAIN (c);
5700 case OMP_CLAUSE_LASTPRIVATE:
5701 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
5703 need_default_ctor = true;
5708 case OMP_CLAUSE_REDUCTION:
5709 if (finish_omp_reduction_clause (c, &need_default_ctor,
5713 t = OMP_CLAUSE_DECL (c);
5716 case OMP_CLAUSE_COPYIN:
5717 if (!VAR_P (t) || !DECL_THREAD_LOCAL_P (t))
5719 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
5728 if (need_complete_non_reference || need_copy_assignment)
5730 t = require_complete_type (t);
5731 if (t == error_mark_node)
5733 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE
5734 && need_complete_non_reference)
5736 error ("%qE has reference type for %qs", t,
5737 omp_clause_code_name[OMP_CLAUSE_CODE (c)]);
5741 if (need_implicitly_determined)
5743 const char *share_name = NULL;
5745 if (VAR_P (t) && DECL_THREAD_LOCAL_P (t))
5746 share_name = "threadprivate";
5747 else switch (cxx_omp_predetermined_sharing (t))
5749 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
5751 case OMP_CLAUSE_DEFAULT_SHARED:
5752 /* const vars may be specified in firstprivate clause. */
5753 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_FIRSTPRIVATE
5754 && cxx_omp_const_qual_no_mutable (t))
5756 share_name = "shared";
5758 case OMP_CLAUSE_DEFAULT_PRIVATE:
5759 share_name = "private";
5766 error ("%qE is predetermined %qs for %qs",
5767 t, share_name, omp_clause_code_name[OMP_CLAUSE_CODE (c)]);
5772 /* We're interested in the base element, not arrays. */
5773 inner_type = type = TREE_TYPE (t);
5774 while (TREE_CODE (inner_type) == ARRAY_TYPE)
5775 inner_type = TREE_TYPE (inner_type);
5777 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_REDUCTION
5778 && TREE_CODE (inner_type) == REFERENCE_TYPE)
5779 inner_type = TREE_TYPE (inner_type);
5781 /* Check for special function availability by building a call to one.
5782 Save the results, because later we won't be in the right context
5783 for making these queries. */
5784 if (CLASS_TYPE_P (inner_type)
5785 && COMPLETE_TYPE_P (inner_type)
5786 && (need_default_ctor || need_copy_ctor
5787 || need_copy_assignment || need_dtor)
5788 && !type_dependent_expression_p (t)
5789 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
5790 need_copy_ctor, need_copy_assignment,
5795 *pc = OMP_CLAUSE_CHAIN (c);
5797 pc = &OMP_CLAUSE_CHAIN (c);
5800 bitmap_obstack_release (NULL);
5804 /* For all variables in the tree_list VARS, mark them as thread local. */
5807 finish_omp_threadprivate (tree vars)
5811 /* Mark every variable in VARS to be assigned thread local storage. */
5812 for (t = vars; t; t = TREE_CHAIN (t))
5814 tree v = TREE_PURPOSE (t);
5816 if (error_operand_p (v))
5818 else if (!VAR_P (v))
5819 error ("%<threadprivate%> %qD is not file, namespace "
5820 "or block scope variable", v);
5821 /* If V had already been marked threadprivate, it doesn't matter
5822 whether it had been used prior to this point. */
5823 else if (TREE_USED (v)
5824 && (DECL_LANG_SPECIFIC (v) == NULL
5825 || !CP_DECL_THREADPRIVATE_P (v)))
5826 error ("%qE declared %<threadprivate%> after first use", v);
5827 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
5828 error ("automatic variable %qE cannot be %<threadprivate%>", v);
5829 else if (! COMPLETE_TYPE_P (complete_type (TREE_TYPE (v))))
5830 error ("%<threadprivate%> %qE has incomplete type", v);
5831 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
5832 && CP_DECL_CONTEXT (v) != current_class_type)
5833 error ("%<threadprivate%> %qE directive not "
5834 "in %qT definition", v, CP_DECL_CONTEXT (v));
5837 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
5838 if (DECL_LANG_SPECIFIC (v) == NULL)
5840 retrofit_lang_decl (v);
5842 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
5843 after the allocation of the lang_decl structure. */
5844 if (DECL_DISCRIMINATOR_P (v))
5845 DECL_LANG_SPECIFIC (v)->u.base.u2sel = 1;
5848 if (! DECL_THREAD_LOCAL_P (v))
5850 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
5851 /* If rtl has been already set for this var, call
5852 make_decl_rtl once again, so that encode_section_info
5853 has a chance to look at the new decl flags. */
5854 if (DECL_RTL_SET_P (v))
5857 CP_DECL_THREADPRIVATE_P (v) = 1;
5862 /* Build an OpenMP structured block. */
5865 begin_omp_structured_block (void)
5867 return do_pushlevel (sk_omp);
5871 finish_omp_structured_block (tree block)
5873 return do_poplevel (block);
5876 /* Similarly, except force the retention of the BLOCK. */
5879 begin_omp_parallel (void)
5881 keep_next_level (true);
5882 return begin_omp_structured_block ();
5886 finish_omp_parallel (tree clauses, tree body)
5890 body = finish_omp_structured_block (body);
5892 stmt = make_node (OMP_PARALLEL);
5893 TREE_TYPE (stmt) = void_type_node;
5894 OMP_PARALLEL_CLAUSES (stmt) = clauses;
5895 OMP_PARALLEL_BODY (stmt) = body;
5897 return add_stmt (stmt);
5901 begin_omp_task (void)
5903 keep_next_level (true);
5904 return begin_omp_structured_block ();
5908 finish_omp_task (tree clauses, tree body)
5912 body = finish_omp_structured_block (body);
5914 stmt = make_node (OMP_TASK);
5915 TREE_TYPE (stmt) = void_type_node;
5916 OMP_TASK_CLAUSES (stmt) = clauses;
5917 OMP_TASK_BODY (stmt) = body;
5919 return add_stmt (stmt);
5922 /* Helper function for finish_omp_for. Convert Ith random access iterator
5923 into integral iterator. Return FALSE if successful. */
5926 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
5927 tree condv, tree incrv, tree *body,
5928 tree *pre_body, tree clauses)
5930 tree diff, iter_init, iter_incr = NULL, last;
5931 tree incr_var = NULL, orig_pre_body, orig_body, c;
5932 tree decl = TREE_VEC_ELT (declv, i);
5933 tree init = TREE_VEC_ELT (initv, i);
5934 tree cond = TREE_VEC_ELT (condv, i);
5935 tree incr = TREE_VEC_ELT (incrv, i);
5937 location_t elocus = locus;
5939 if (init && EXPR_HAS_LOCATION (init))
5940 elocus = EXPR_LOCATION (init);
5942 switch (TREE_CODE (cond))
5948 if (TREE_OPERAND (cond, 1) == iter)
5949 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
5950 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
5951 if (TREE_OPERAND (cond, 0) != iter)
5952 cond = error_mark_node;
5955 tree tem = build_x_binary_op (EXPR_LOCATION (cond),
5958 TREE_OPERAND (cond, 1), ERROR_MARK,
5959 NULL, tf_warning_or_error);
5960 if (error_operand_p (tem))
5965 cond = error_mark_node;
5968 if (cond == error_mark_node)
5970 error_at (elocus, "invalid controlling predicate");
5973 diff = build_x_binary_op (elocus, MINUS_EXPR, TREE_OPERAND (cond, 1),
5974 ERROR_MARK, iter, ERROR_MARK, NULL,
5975 tf_warning_or_error);
5976 if (error_operand_p (diff))
5978 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
5980 error_at (elocus, "difference between %qE and %qD does not have integer type",
5981 TREE_OPERAND (cond, 1), iter);
5985 switch (TREE_CODE (incr))
5987 case PREINCREMENT_EXPR:
5988 case PREDECREMENT_EXPR:
5989 case POSTINCREMENT_EXPR:
5990 case POSTDECREMENT_EXPR:
5991 if (TREE_OPERAND (incr, 0) != iter)
5993 incr = error_mark_node;
5996 iter_incr = build_x_unary_op (EXPR_LOCATION (incr),
5997 TREE_CODE (incr), iter,
5998 tf_warning_or_error);
5999 if (error_operand_p (iter_incr))
6001 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
6002 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
6003 incr = integer_one_node;
6005 incr = integer_minus_one_node;
6008 if (TREE_OPERAND (incr, 0) != iter)
6009 incr = error_mark_node;
6010 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
6011 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
6013 tree rhs = TREE_OPERAND (incr, 1);
6014 if (TREE_OPERAND (rhs, 0) == iter)
6016 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
6018 incr = error_mark_node;
6021 iter_incr = build_x_modify_expr (EXPR_LOCATION (rhs),
6022 iter, TREE_CODE (rhs),
6023 TREE_OPERAND (rhs, 1),
6024 tf_warning_or_error);
6025 if (error_operand_p (iter_incr))
6027 incr = TREE_OPERAND (rhs, 1);
6028 incr = cp_convert (TREE_TYPE (diff), incr,
6029 tf_warning_or_error);
6030 if (TREE_CODE (rhs) == MINUS_EXPR)
6032 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
6033 incr = fold_if_not_in_template (incr);
6035 if (TREE_CODE (incr) != INTEGER_CST
6036 && (TREE_CODE (incr) != NOP_EXPR
6037 || (TREE_CODE (TREE_OPERAND (incr, 0))
6042 else if (TREE_OPERAND (rhs, 1) == iter)
6044 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
6045 || TREE_CODE (rhs) != PLUS_EXPR)
6046 incr = error_mark_node;
6049 iter_incr = build_x_binary_op (EXPR_LOCATION (rhs),
6051 TREE_OPERAND (rhs, 0),
6054 tf_warning_or_error);
6055 if (error_operand_p (iter_incr))
6057 iter_incr = build_x_modify_expr (EXPR_LOCATION (rhs),
6060 tf_warning_or_error);
6061 if (error_operand_p (iter_incr))
6063 incr = TREE_OPERAND (rhs, 0);
6068 incr = error_mark_node;
6071 incr = error_mark_node;
6074 incr = error_mark_node;
6078 if (incr == error_mark_node)
6080 error_at (elocus, "invalid increment expression");
6084 incr = cp_convert (TREE_TYPE (diff), incr, tf_warning_or_error);
6085 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
6086 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
6087 && OMP_CLAUSE_DECL (c) == iter)
6090 decl = create_temporary_var (TREE_TYPE (diff));
6092 add_decl_expr (decl);
6093 last = create_temporary_var (TREE_TYPE (diff));
6095 add_decl_expr (last);
6096 if (c && iter_incr == NULL)
6098 incr_var = create_temporary_var (TREE_TYPE (diff));
6099 pushdecl (incr_var);
6100 add_decl_expr (incr_var);
6102 gcc_assert (stmts_are_full_exprs_p ());
6104 orig_pre_body = *pre_body;
6105 *pre_body = push_stmt_list ();
6107 add_stmt (orig_pre_body);
6109 finish_expr_stmt (build_x_modify_expr (elocus,
6110 iter, NOP_EXPR, init,
6111 tf_warning_or_error));
6112 init = build_int_cst (TREE_TYPE (diff), 0);
6113 if (c && iter_incr == NULL)
6115 finish_expr_stmt (build_x_modify_expr (elocus,
6117 incr, tf_warning_or_error));
6119 iter_incr = build_x_modify_expr (elocus,
6120 iter, PLUS_EXPR, incr,
6121 tf_warning_or_error);
6123 finish_expr_stmt (build_x_modify_expr (elocus,
6124 last, NOP_EXPR, init,
6125 tf_warning_or_error));
6126 *pre_body = pop_stmt_list (*pre_body);
6128 cond = cp_build_binary_op (elocus,
6129 TREE_CODE (cond), decl, diff,
6130 tf_warning_or_error);
6131 incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR,
6132 elocus, incr, NULL_TREE);
6135 *body = push_stmt_list ();
6136 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
6137 iter_init = build_x_modify_expr (elocus,
6138 iter, PLUS_EXPR, iter_init,
6139 tf_warning_or_error);
6140 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
6141 finish_expr_stmt (iter_init);
6142 finish_expr_stmt (build_x_modify_expr (elocus,
6143 last, NOP_EXPR, decl,
6144 tf_warning_or_error));
6145 add_stmt (orig_body);
6146 *body = pop_stmt_list (*body);
6150 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
6151 finish_expr_stmt (iter_incr);
6152 OMP_CLAUSE_LASTPRIVATE_STMT (c)
6153 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
6156 TREE_VEC_ELT (declv, i) = decl;
6157 TREE_VEC_ELT (initv, i) = init;
6158 TREE_VEC_ELT (condv, i) = cond;
6159 TREE_VEC_ELT (incrv, i) = incr;
6164 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
6165 are directly for their associated operands in the statement. DECL
6166 and INIT are a combo; if DECL is NULL then INIT ought to be a
6167 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
6168 optional statements that need to go before the loop into its
6172 finish_omp_for (location_t locus, enum tree_code code, tree declv, tree initv,
6173 tree condv, tree incrv, tree body, tree pre_body, tree clauses)
6175 tree omp_for = NULL, orig_incr = NULL;
6176 tree decl, init, cond, incr;
6180 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
6181 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
6182 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
6183 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
6185 decl = TREE_VEC_ELT (declv, i);
6186 init = TREE_VEC_ELT (initv, i);
6187 cond = TREE_VEC_ELT (condv, i);
6188 incr = TREE_VEC_ELT (incrv, i);
6194 switch (TREE_CODE (init))
6197 decl = TREE_OPERAND (init, 0);
6198 init = TREE_OPERAND (init, 1);
6201 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
6203 decl = TREE_OPERAND (init, 0);
6204 init = TREE_OPERAND (init, 2);
6214 "expected iteration declaration or initialization");
6219 if (init && EXPR_HAS_LOCATION (init))
6220 elocus = EXPR_LOCATION (init);
6224 error_at (elocus, "missing controlling predicate");
6230 error_at (elocus, "missing increment expression");
6234 TREE_VEC_ELT (declv, i) = decl;
6235 TREE_VEC_ELT (initv, i) = init;
6238 if (dependent_omp_for_p (declv, initv, condv, incrv))
6242 stmt = make_node (code);
6244 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
6246 /* This is really just a place-holder. We'll be decomposing this
6247 again and going through the cp_build_modify_expr path below when
6248 we instantiate the thing. */
6249 TREE_VEC_ELT (initv, i)
6250 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
6251 TREE_VEC_ELT (initv, i));
6254 TREE_TYPE (stmt) = void_type_node;
6255 OMP_FOR_INIT (stmt) = initv;
6256 OMP_FOR_COND (stmt) = condv;
6257 OMP_FOR_INCR (stmt) = incrv;
6258 OMP_FOR_BODY (stmt) = body;
6259 OMP_FOR_PRE_BODY (stmt) = pre_body;
6260 OMP_FOR_CLAUSES (stmt) = clauses;
6262 SET_EXPR_LOCATION (stmt, locus);
6263 return add_stmt (stmt);
6266 if (processing_template_decl)
6267 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
6269 for (i = 0; i < TREE_VEC_LENGTH (declv); )
6271 decl = TREE_VEC_ELT (declv, i);
6272 init = TREE_VEC_ELT (initv, i);
6273 cond = TREE_VEC_ELT (condv, i);
6274 incr = TREE_VEC_ELT (incrv, i);
6276 TREE_VEC_ELT (orig_incr, i) = incr;
6279 if (init && EXPR_HAS_LOCATION (init))
6280 elocus = EXPR_LOCATION (init);
6284 error_at (elocus, "expected iteration declaration or initialization");
6288 if (incr && TREE_CODE (incr) == MODOP_EXPR)
6291 TREE_VEC_ELT (orig_incr, i) = incr;
6292 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
6293 TREE_CODE (TREE_OPERAND (incr, 1)),
6294 TREE_OPERAND (incr, 2),
6295 tf_warning_or_error);
6298 if (CLASS_TYPE_P (TREE_TYPE (decl)))
6300 if (code == OMP_SIMD)
6302 error_at (elocus, "%<#pragma omp simd%> used with class "
6303 "iteration variable %qE", decl);
6306 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
6307 incrv, &body, &pre_body, clauses))
6312 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
6313 && !TYPE_PTR_P (TREE_TYPE (decl)))
6315 error_at (elocus, "invalid type for iteration variable %qE", decl);
6319 if (!processing_template_decl)
6321 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
6322 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
6325 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
6327 && TREE_SIDE_EFFECTS (cond)
6328 && COMPARISON_CLASS_P (cond)
6329 && !processing_template_decl)
6331 tree t = TREE_OPERAND (cond, 0);
6332 if (TREE_SIDE_EFFECTS (t)
6334 && (TREE_CODE (t) != NOP_EXPR
6335 || TREE_OPERAND (t, 0) != decl))
6336 TREE_OPERAND (cond, 0)
6337 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
6339 t = TREE_OPERAND (cond, 1);
6340 if (TREE_SIDE_EFFECTS (t)
6342 && (TREE_CODE (t) != NOP_EXPR
6343 || TREE_OPERAND (t, 0) != decl))
6344 TREE_OPERAND (cond, 1)
6345 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
6347 if (decl == error_mark_node || init == error_mark_node)
6350 TREE_VEC_ELT (declv, i) = decl;
6351 TREE_VEC_ELT (initv, i) = init;
6352 TREE_VEC_ELT (condv, i) = cond;
6353 TREE_VEC_ELT (incrv, i) = incr;
6357 if (IS_EMPTY_STMT (pre_body))
6360 omp_for = c_finish_omp_for (locus, code, declv, initv, condv, incrv,
6363 if (omp_for == NULL)
6366 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
6368 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
6369 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
6371 if (TREE_CODE (incr) != MODIFY_EXPR)
6374 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
6375 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
6376 && !processing_template_decl)
6378 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
6379 if (TREE_SIDE_EFFECTS (t)
6381 && (TREE_CODE (t) != NOP_EXPR
6382 || TREE_OPERAND (t, 0) != decl))
6383 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
6384 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
6386 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
6387 if (TREE_SIDE_EFFECTS (t)
6389 && (TREE_CODE (t) != NOP_EXPR
6390 || TREE_OPERAND (t, 0) != decl))
6391 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
6392 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
6396 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
6398 if (omp_for != NULL)
6399 OMP_FOR_CLAUSES (omp_for) = clauses;
6404 finish_omp_atomic (enum tree_code code, enum tree_code opcode, tree lhs,
6405 tree rhs, tree v, tree lhs1, tree rhs1, bool seq_cst)
6420 dependent_p = false;
6423 /* Even in a template, we can detect invalid uses of the atomic
6424 pragma if neither LHS nor RHS is type-dependent. */
6425 if (processing_template_decl)
6427 dependent_p = (type_dependent_expression_p (lhs)
6428 || (rhs && type_dependent_expression_p (rhs))
6429 || (v && type_dependent_expression_p (v))
6430 || (lhs1 && type_dependent_expression_p (lhs1))
6431 || (rhs1 && type_dependent_expression_p (rhs1)));
6434 lhs = build_non_dependent_expr (lhs);
6436 rhs = build_non_dependent_expr (rhs);
6438 v = build_non_dependent_expr (v);
6440 lhs1 = build_non_dependent_expr (lhs1);
6442 rhs1 = build_non_dependent_expr (rhs1);
6447 bool swapped = false;
6448 if (rhs1 && cp_tree_equal (lhs, rhs))
6453 swapped = !commutative_tree_code (opcode);
6455 if (rhs1 && !cp_tree_equal (lhs, rhs1))
6457 if (code == OMP_ATOMIC)
6458 error ("%<#pragma omp atomic update%> uses two different "
6459 "expressions for memory");
6461 error ("%<#pragma omp atomic capture%> uses two different "
6462 "expressions for memory");
6465 if (lhs1 && !cp_tree_equal (lhs, lhs1))
6467 if (code == OMP_ATOMIC)
6468 error ("%<#pragma omp atomic update%> uses two different "
6469 "expressions for memory");
6471 error ("%<#pragma omp atomic capture%> uses two different "
6472 "expressions for memory");
6475 stmt = c_finish_omp_atomic (input_location, code, opcode, lhs, rhs,
6476 v, lhs1, rhs1, swapped, seq_cst);
6477 if (stmt == error_mark_node)
6480 if (processing_template_decl)
6482 if (code == OMP_ATOMIC_READ)
6484 stmt = build_min_nt_loc (EXPR_LOCATION (orig_lhs),
6485 OMP_ATOMIC_READ, orig_lhs);
6486 OMP_ATOMIC_SEQ_CST (stmt) = seq_cst;
6487 stmt = build2 (MODIFY_EXPR, void_type_node, orig_v, stmt);
6491 if (opcode == NOP_EXPR)
6492 stmt = build2 (MODIFY_EXPR, void_type_node, orig_lhs, orig_rhs);
6494 stmt = build2 (opcode, void_type_node, orig_lhs, orig_rhs);
6496 stmt = build_min_nt_loc (EXPR_LOCATION (orig_rhs1),
6497 COMPOUND_EXPR, orig_rhs1, stmt);
6498 if (code != OMP_ATOMIC)
6500 stmt = build_min_nt_loc (EXPR_LOCATION (orig_lhs1),
6501 code, orig_lhs1, stmt);
6502 OMP_ATOMIC_SEQ_CST (stmt) = seq_cst;
6503 stmt = build2 (MODIFY_EXPR, void_type_node, orig_v, stmt);
6506 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node, stmt);
6507 OMP_ATOMIC_SEQ_CST (stmt) = seq_cst;
6513 finish_omp_barrier (void)
6515 tree fn = builtin_decl_explicit (BUILT_IN_GOMP_BARRIER);
6516 vec<tree, va_gc> *vec = make_tree_vector ();
6517 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
6518 release_tree_vector (vec);
6519 finish_expr_stmt (stmt);
6523 finish_omp_flush (void)
6525 tree fn = builtin_decl_explicit (BUILT_IN_SYNC_SYNCHRONIZE);
6526 vec<tree, va_gc> *vec = make_tree_vector ();
6527 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
6528 release_tree_vector (vec);
6529 finish_expr_stmt (stmt);
6533 finish_omp_taskwait (void)
6535 tree fn = builtin_decl_explicit (BUILT_IN_GOMP_TASKWAIT);
6536 vec<tree, va_gc> *vec = make_tree_vector ();
6537 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
6538 release_tree_vector (vec);
6539 finish_expr_stmt (stmt);
6543 finish_omp_taskyield (void)
6545 tree fn = builtin_decl_explicit (BUILT_IN_GOMP_TASKYIELD);
6546 vec<tree, va_gc> *vec = make_tree_vector ();
6547 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
6548 release_tree_vector (vec);
6549 finish_expr_stmt (stmt);
6553 finish_omp_cancel (tree clauses)
6555 tree fn = builtin_decl_explicit (BUILT_IN_GOMP_CANCEL);
6557 if (find_omp_clause (clauses, OMP_CLAUSE_PARALLEL))
6559 else if (find_omp_clause (clauses, OMP_CLAUSE_FOR))
6561 else if (find_omp_clause (clauses, OMP_CLAUSE_SECTIONS))
6563 else if (find_omp_clause (clauses, OMP_CLAUSE_TASKGROUP))
6567 error ("%<#pragma omp cancel must specify one of "
6568 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
6571 vec<tree, va_gc> *vec = make_tree_vector ();
6572 tree ifc = find_omp_clause (clauses, OMP_CLAUSE_IF);
6573 if (ifc != NULL_TREE)
6575 tree type = TREE_TYPE (OMP_CLAUSE_IF_EXPR (ifc));
6576 ifc = fold_build2_loc (OMP_CLAUSE_LOCATION (ifc), NE_EXPR,
6577 boolean_type_node, OMP_CLAUSE_IF_EXPR (ifc),
6578 build_zero_cst (type));
6581 ifc = boolean_true_node;
6582 vec->quick_push (build_int_cst (integer_type_node, mask));
6583 vec->quick_push (ifc);
6584 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
6585 release_tree_vector (vec);
6586 finish_expr_stmt (stmt);
6590 finish_omp_cancellation_point (tree clauses)
6592 tree fn = builtin_decl_explicit (BUILT_IN_GOMP_CANCELLATION_POINT);
6594 if (find_omp_clause (clauses, OMP_CLAUSE_PARALLEL))
6596 else if (find_omp_clause (clauses, OMP_CLAUSE_FOR))
6598 else if (find_omp_clause (clauses, OMP_CLAUSE_SECTIONS))
6600 else if (find_omp_clause (clauses, OMP_CLAUSE_TASKGROUP))
6604 error ("%<#pragma omp cancellation point must specify one of "
6605 "%<parallel%>, %<for%>, %<sections%> or %<taskgroup%> clauses");
6608 vec<tree, va_gc> *vec
6609 = make_tree_vector_single (build_int_cst (integer_type_node, mask));
6610 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
6611 release_tree_vector (vec);
6612 finish_expr_stmt (stmt);
6615 /* Begin a __transaction_atomic or __transaction_relaxed statement.
6616 If PCOMPOUND is non-null, this is for a function-transaction-block, and we
6617 should create an extra compound stmt. */
6620 begin_transaction_stmt (location_t loc, tree *pcompound, int flags)
6625 *pcompound = begin_compound_stmt (0);
6627 r = build_stmt (loc, TRANSACTION_EXPR, NULL_TREE);
6629 /* Only add the statement to the function if support enabled. */
6633 error_at (loc, ((flags & TM_STMT_ATTR_RELAXED) != 0
6634 ? G_("%<__transaction_relaxed%> without "
6635 "transactional memory support enabled")
6636 : G_("%<__transaction_atomic%> without "
6637 "transactional memory support enabled")));
6639 TRANSACTION_EXPR_BODY (r) = push_stmt_list ();
6640 TREE_SIDE_EFFECTS (r) = 1;
6644 /* End a __transaction_atomic or __transaction_relaxed statement.
6645 If COMPOUND_STMT is non-null, this is for a function-transaction-block,
6646 and we should end the compound. If NOEX is non-NULL, we wrap the body in
6647 a MUST_NOT_THROW_EXPR with NOEX as condition. */
6650 finish_transaction_stmt (tree stmt, tree compound_stmt, int flags, tree noex)
6652 TRANSACTION_EXPR_BODY (stmt) = pop_stmt_list (TRANSACTION_EXPR_BODY (stmt));
6653 TRANSACTION_EXPR_OUTER (stmt) = (flags & TM_STMT_ATTR_OUTER) != 0;
6654 TRANSACTION_EXPR_RELAXED (stmt) = (flags & TM_STMT_ATTR_RELAXED) != 0;
6655 TRANSACTION_EXPR_IS_STMT (stmt) = 1;
6657 /* noexcept specifications are not allowed for function transactions. */
6658 gcc_assert (!(noex && compound_stmt));
6661 tree body = build_must_not_throw_expr (TRANSACTION_EXPR_BODY (stmt),
6663 /* This may not be true when the STATEMENT_LIST is empty. */
6665 SET_EXPR_LOCATION (body, EXPR_LOCATION (TRANSACTION_EXPR_BODY (stmt)));
6666 TREE_SIDE_EFFECTS (body) = 1;
6667 TRANSACTION_EXPR_BODY (stmt) = body;
6671 finish_compound_stmt (compound_stmt);
6674 /* Build a __transaction_atomic or __transaction_relaxed expression. If
6675 NOEX is non-NULL, we wrap the body in a MUST_NOT_THROW_EXPR with NOEX as
6679 build_transaction_expr (location_t loc, tree expr, int flags, tree noex)
6684 expr = build_must_not_throw_expr (expr, noex);
6686 SET_EXPR_LOCATION (expr, loc);
6687 TREE_SIDE_EFFECTS (expr) = 1;
6689 ret = build1 (TRANSACTION_EXPR, TREE_TYPE (expr), expr);
6690 if (flags & TM_STMT_ATTR_RELAXED)
6691 TRANSACTION_EXPR_RELAXED (ret) = 1;
6692 TREE_SIDE_EFFECTS (ret) = 1;
6693 SET_EXPR_LOCATION (ret, loc);
6698 init_cp_semantics (void)
6702 /* Build a STATIC_ASSERT for a static assertion with the condition
6703 CONDITION and the message text MESSAGE. LOCATION is the location
6704 of the static assertion in the source code. When MEMBER_P, this
6705 static assertion is a member of a class. */
6707 finish_static_assert (tree condition, tree message, location_t location,
6710 if (message == NULL_TREE
6711 || message == error_mark_node
6712 || condition == NULL_TREE
6713 || condition == error_mark_node)
6716 if (check_for_bare_parameter_packs (condition))
6717 condition = error_mark_node;
6719 if (type_dependent_expression_p (condition)
6720 || value_dependent_expression_p (condition))
6722 /* We're in a template; build a STATIC_ASSERT and put it in
6726 assertion = make_node (STATIC_ASSERT);
6727 STATIC_ASSERT_CONDITION (assertion) = condition;
6728 STATIC_ASSERT_MESSAGE (assertion) = message;
6729 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
6732 maybe_add_class_template_decl_list (current_class_type,
6736 add_stmt (assertion);
6741 /* Fold the expression and convert it to a boolean value. */
6742 condition = fold_non_dependent_expr (condition);
6743 condition = cp_convert (boolean_type_node, condition, tf_warning_or_error);
6744 condition = maybe_constant_value (condition);
6746 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
6747 /* Do nothing; the condition is satisfied. */
6751 location_t saved_loc = input_location;
6753 input_location = location;
6754 if (TREE_CODE (condition) == INTEGER_CST
6755 && integer_zerop (condition))
6756 /* Report the error. */
6757 error ("static assertion failed: %s", TREE_STRING_POINTER (message));
6758 else if (condition && condition != error_mark_node)
6760 error ("non-constant condition for static assertion");
6761 cxx_constant_value (condition);
6763 input_location = saved_loc;
6767 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
6768 suitable for use as a type-specifier.
6770 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
6771 id-expression or a class member access, FALSE when it was parsed as
6772 a full expression. */
6775 finish_decltype_type (tree expr, bool id_expression_or_member_access_p,
6776 tsubst_flags_t complain)
6778 tree type = NULL_TREE;
6780 if (!expr || error_operand_p (expr))
6781 return error_mark_node;
6784 || TREE_CODE (expr) == TYPE_DECL
6785 || (TREE_CODE (expr) == BIT_NOT_EXPR
6786 && TYPE_P (TREE_OPERAND (expr, 0))))
6788 if (complain & tf_error)
6789 error ("argument to decltype must be an expression");
6790 return error_mark_node;
6793 /* Depending on the resolution of DR 1172, we may later need to distinguish
6794 instantiation-dependent but not type-dependent expressions so that, say,
6795 A<decltype(sizeof(T))>::U doesn't require 'typename'. */
6796 if (instantiation_dependent_expression_p (expr))
6798 type = cxx_make_type (DECLTYPE_TYPE);
6799 DECLTYPE_TYPE_EXPR (type) = expr;
6800 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
6801 = id_expression_or_member_access_p;
6802 SET_TYPE_STRUCTURAL_EQUALITY (type);
6807 /* The type denoted by decltype(e) is defined as follows: */
6809 expr = resolve_nondeduced_context (expr);
6811 if (invalid_nonstatic_memfn_p (expr, complain))
6812 return error_mark_node;
6814 if (type_unknown_p (expr))
6816 if (complain & tf_error)
6817 error ("decltype cannot resolve address of overloaded function");
6818 return error_mark_node;
6821 /* To get the size of a static data member declared as an array of
6822 unknown bound, we need to instantiate it. */
6824 && VAR_HAD_UNKNOWN_BOUND (expr)
6825 && DECL_TEMPLATE_INSTANTIATION (expr))
6826 instantiate_decl (expr, /*defer_ok*/true, /*expl_inst_mem*/false);
6828 if (id_expression_or_member_access_p)
6830 /* If e is an id-expression or a class member access (5.2.5
6831 [expr.ref]), decltype(e) is defined as the type of the entity
6832 named by e. If there is no such entity, or e names a set of
6833 overloaded functions, the program is ill-formed. */
6834 if (identifier_p (expr))
6835 expr = lookup_name (expr);
6837 if (INDIRECT_REF_P (expr))
6838 /* This can happen when the expression is, e.g., "a.b". Just
6839 look at the underlying operand. */
6840 expr = TREE_OPERAND (expr, 0);
6842 if (TREE_CODE (expr) == OFFSET_REF
6843 || TREE_CODE (expr) == MEMBER_REF
6844 || TREE_CODE (expr) == SCOPE_REF)
6845 /* We're only interested in the field itself. If it is a
6846 BASELINK, we will need to see through it in the next
6848 expr = TREE_OPERAND (expr, 1);
6850 if (BASELINK_P (expr))
6851 /* See through BASELINK nodes to the underlying function. */
6852 expr = BASELINK_FUNCTIONS (expr);
6854 switch (TREE_CODE (expr))
6857 if (DECL_BIT_FIELD_TYPE (expr))
6859 type = DECL_BIT_FIELD_TYPE (expr);
6862 /* Fall through for fields that aren't bitfields. */
6869 case TEMPLATE_PARM_INDEX:
6870 expr = mark_type_use (expr);
6871 type = TREE_TYPE (expr);
6875 type = error_mark_node;
6880 mark_type_use (expr);
6881 type = is_bitfield_expr_with_lowered_type (expr);
6883 type = TREE_TYPE (TREE_OPERAND (expr, 1));
6891 /* We can get here when the id-expression refers to an
6892 enumerator or non-type template parameter. */
6893 type = TREE_TYPE (expr);
6897 /* Handle instantiated template non-type arguments. */
6898 type = TREE_TYPE (expr);
6904 /* Within a lambda-expression:
6906 Every occurrence of decltype((x)) where x is a possibly
6907 parenthesized id-expression that names an entity of
6908 automatic storage duration is treated as if x were
6909 transformed into an access to a corresponding data member
6910 of the closure type that would have been declared if x
6911 were a use of the denoted entity. */
6912 if (outer_automatic_var_p (expr)
6913 && current_function_decl
6914 && LAMBDA_FUNCTION_P (current_function_decl))
6915 type = capture_decltype (expr);
6916 else if (error_operand_p (expr))
6917 type = error_mark_node;
6918 else if (expr == current_class_ptr)
6919 /* If the expression is just "this", we want the
6920 cv-unqualified pointer for the "this" type. */
6921 type = TYPE_MAIN_VARIANT (TREE_TYPE (expr));
6924 /* Otherwise, where T is the type of e, if e is an lvalue,
6925 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
6926 cp_lvalue_kind clk = lvalue_kind (expr);
6927 type = unlowered_expr_type (expr);
6928 gcc_assert (TREE_CODE (type) != REFERENCE_TYPE);
6930 /* For vector types, pick a non-opaque variant. */
6931 if (TREE_CODE (type) == VECTOR_TYPE)
6932 type = strip_typedefs (type);
6934 if (clk != clk_none && !(clk & clk_class))
6935 type = cp_build_reference_type (type, (clk & clk_rvalueref));
6939 if (cxx_dialect >= cxx1y && array_of_runtime_bound_p (type))
6941 if (complain & tf_warning_or_error)
6942 pedwarn (input_location, OPT_Wvla,
6943 "taking decltype of array of runtime bound");
6945 return error_mark_node;
6951 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
6952 __has_nothrow_copy, depending on assign_p. */
6955 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
6962 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
6965 fns = (*CLASSTYPE_METHOD_VEC (type))[ix];
6967 else if (TYPE_HAS_COPY_CTOR (type))
6969 /* If construction of the copy constructor was postponed, create
6971 if (CLASSTYPE_LAZY_COPY_CTOR (type))
6972 lazily_declare_fn (sfk_copy_constructor, type);
6973 if (CLASSTYPE_LAZY_MOVE_CTOR (type))
6974 lazily_declare_fn (sfk_move_constructor, type);
6975 fns = CLASSTYPE_CONSTRUCTORS (type);
6980 for (; fns; fns = OVL_NEXT (fns))
6982 tree fn = OVL_CURRENT (fns);
6986 if (copy_fn_p (fn) == 0)
6989 else if (copy_fn_p (fn) <= 0)
6992 maybe_instantiate_noexcept (fn);
6993 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
7000 /* Actually evaluates the trait. */
7003 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
7005 enum tree_code type_code1;
7008 type_code1 = TREE_CODE (type1);
7012 case CPTK_HAS_NOTHROW_ASSIGN:
7013 type1 = strip_array_types (type1);
7014 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
7015 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
7016 || (CLASS_TYPE_P (type1)
7017 && classtype_has_nothrow_assign_or_copy_p (type1,
7020 case CPTK_HAS_TRIVIAL_ASSIGN:
7021 /* ??? The standard seems to be missing the "or array of such a class
7022 type" wording for this trait. */
7023 type1 = strip_array_types (type1);
7024 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
7025 && (trivial_type_p (type1)
7026 || (CLASS_TYPE_P (type1)
7027 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1))));
7029 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
7030 type1 = strip_array_types (type1);
7031 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
7032 || (CLASS_TYPE_P (type1)
7033 && (t = locate_ctor (type1))
7034 && (maybe_instantiate_noexcept (t),
7035 TYPE_NOTHROW_P (TREE_TYPE (t)))));
7037 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
7038 type1 = strip_array_types (type1);
7039 return (trivial_type_p (type1)
7040 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
7042 case CPTK_HAS_NOTHROW_COPY:
7043 type1 = strip_array_types (type1);
7044 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
7045 || (CLASS_TYPE_P (type1)
7046 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
7048 case CPTK_HAS_TRIVIAL_COPY:
7049 /* ??? The standard seems to be missing the "or array of such a class
7050 type" wording for this trait. */
7051 type1 = strip_array_types (type1);
7052 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
7053 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1)));
7055 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
7056 type1 = strip_array_types (type1);
7057 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
7058 || (CLASS_TYPE_P (type1)
7059 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
7061 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
7062 return type_has_virtual_destructor (type1);
7064 case CPTK_IS_ABSTRACT:
7065 return (ABSTRACT_CLASS_TYPE_P (type1));
7067 case CPTK_IS_BASE_OF:
7068 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
7069 && DERIVED_FROM_P (type1, type2));
7072 return (NON_UNION_CLASS_TYPE_P (type1));
7074 case CPTK_IS_CONVERTIBLE_TO:
7079 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
7082 return (type_code1 == ENUMERAL_TYPE);
7085 return (CLASS_TYPE_P (type1) && CLASSTYPE_FINAL (type1));
7087 case CPTK_IS_LITERAL_TYPE:
7088 return (literal_type_p (type1));
7091 return (pod_type_p (type1));
7093 case CPTK_IS_POLYMORPHIC:
7094 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
7096 case CPTK_IS_STD_LAYOUT:
7097 return (std_layout_type_p (type1));
7099 case CPTK_IS_TRIVIAL:
7100 return (trivial_type_p (type1));
7103 return (type_code1 == UNION_TYPE);
7111 /* If TYPE is an array of unknown bound, or (possibly cv-qualified)
7112 void, or a complete type, returns it, otherwise NULL_TREE. */
7115 check_trait_type (tree type)
7117 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type)
7118 && COMPLETE_TYPE_P (TREE_TYPE (type)))
7121 if (VOID_TYPE_P (type))
7124 return complete_type_or_else (strip_array_types (type), NULL_TREE);
7127 /* Process a trait expression. */
7130 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
7132 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
7133 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
7134 || kind == CPTK_HAS_NOTHROW_COPY
7135 || kind == CPTK_HAS_TRIVIAL_ASSIGN
7136 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
7137 || kind == CPTK_HAS_TRIVIAL_COPY
7138 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
7139 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
7140 || kind == CPTK_IS_ABSTRACT
7141 || kind == CPTK_IS_BASE_OF
7142 || kind == CPTK_IS_CLASS
7143 || kind == CPTK_IS_CONVERTIBLE_TO
7144 || kind == CPTK_IS_EMPTY
7145 || kind == CPTK_IS_ENUM
7146 || kind == CPTK_IS_FINAL
7147 || kind == CPTK_IS_LITERAL_TYPE
7148 || kind == CPTK_IS_POD
7149 || kind == CPTK_IS_POLYMORPHIC
7150 || kind == CPTK_IS_STD_LAYOUT
7151 || kind == CPTK_IS_TRIVIAL
7152 || kind == CPTK_IS_UNION);
7154 if (kind == CPTK_IS_CONVERTIBLE_TO)
7156 sorry ("__is_convertible_to");
7157 return error_mark_node;
7160 if (type1 == error_mark_node
7161 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
7162 && type2 == error_mark_node))
7163 return error_mark_node;
7165 if (processing_template_decl)
7167 tree trait_expr = make_node (TRAIT_EXPR);
7168 TREE_TYPE (trait_expr) = boolean_type_node;
7169 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
7170 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
7171 TRAIT_EXPR_KIND (trait_expr) = kind;
7177 case CPTK_HAS_NOTHROW_ASSIGN:
7178 case CPTK_HAS_TRIVIAL_ASSIGN:
7179 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
7180 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
7181 case CPTK_HAS_NOTHROW_COPY:
7182 case CPTK_HAS_TRIVIAL_COPY:
7183 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
7184 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
7185 case CPTK_IS_ABSTRACT:
7188 case CPTK_IS_LITERAL_TYPE:
7190 case CPTK_IS_POLYMORPHIC:
7191 case CPTK_IS_STD_LAYOUT:
7192 case CPTK_IS_TRIVIAL:
7193 if (!check_trait_type (type1))
7194 return error_mark_node;
7197 case CPTK_IS_BASE_OF:
7198 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
7199 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
7200 && !complete_type_or_else (type2, NULL_TREE))
7201 /* We already issued an error. */
7202 return error_mark_node;
7210 case CPTK_IS_CONVERTIBLE_TO:
7215 return (trait_expr_value (kind, type1, type2)
7216 ? boolean_true_node : boolean_false_node);
7219 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
7220 which is ignored for C++. */
7223 set_float_const_decimal64 (void)
7228 clear_float_const_decimal64 (void)
7233 float_const_decimal64_p (void)
7239 /* Return true if T is a literal type. */
7242 literal_type_p (tree t)
7244 if (SCALAR_TYPE_P (t)
7245 || TREE_CODE (t) == VECTOR_TYPE
7246 || TREE_CODE (t) == REFERENCE_TYPE)
7248 if (CLASS_TYPE_P (t))
7250 t = complete_type (t);
7251 gcc_assert (COMPLETE_TYPE_P (t) || errorcount);
7252 return CLASSTYPE_LITERAL_P (t);
7254 if (TREE_CODE (t) == ARRAY_TYPE)
7255 return literal_type_p (strip_array_types (t));
7259 /* If DECL is a variable declared `constexpr', require its type
7260 be literal. Return the DECL if OK, otherwise NULL. */
7263 ensure_literal_type_for_constexpr_object (tree decl)
7265 tree type = TREE_TYPE (decl);
7266 if (VAR_P (decl) && DECL_DECLARED_CONSTEXPR_P (decl)
7267 && !processing_template_decl)
7269 if (CLASS_TYPE_P (type) && !COMPLETE_TYPE_P (complete_type (type)))
7270 /* Don't complain here, we'll complain about incompleteness
7271 when we try to initialize the variable. */;
7272 else if (!literal_type_p (type))
7274 error ("the type %qT of constexpr variable %qD is not literal",
7276 explain_non_literal_class (type);
7283 /* Representation of entries in the constexpr function definition table. */
7285 typedef struct GTY(()) constexpr_fundef {
7290 /* This table holds all constexpr function definitions seen in
7291 the current translation unit. */
7293 static GTY ((param_is (constexpr_fundef))) htab_t constexpr_fundef_table;
7295 /* Utility function used for managing the constexpr function table.
7296 Return true if the entries pointed to by P and Q are for the
7297 same constexpr function. */
7300 constexpr_fundef_equal (const void *p, const void *q)
7302 const constexpr_fundef *lhs = (const constexpr_fundef *) p;
7303 const constexpr_fundef *rhs = (const constexpr_fundef *) q;
7304 return lhs->decl == rhs->decl;
7307 /* Utility function used for managing the constexpr function table.
7308 Return a hash value for the entry pointed to by Q. */
7310 static inline hashval_t
7311 constexpr_fundef_hash (const void *p)
7313 const constexpr_fundef *fundef = (const constexpr_fundef *) p;
7314 return DECL_UID (fundef->decl);
7317 /* Return a previously saved definition of function FUN. */
7319 static constexpr_fundef *
7320 retrieve_constexpr_fundef (tree fun)
7322 constexpr_fundef fundef = { NULL, NULL };
7323 if (constexpr_fundef_table == NULL)
7327 return (constexpr_fundef *) htab_find (constexpr_fundef_table, &fundef);
7330 /* Check whether the parameter and return types of FUN are valid for a
7331 constexpr function, and complain if COMPLAIN. */
7334 is_valid_constexpr_fn (tree fun, bool complain)
7336 tree parm = FUNCTION_FIRST_USER_PARM (fun);
7338 for (; parm != NULL; parm = TREE_CHAIN (parm))
7339 if (!literal_type_p (TREE_TYPE (parm)))
7344 error ("invalid type for parameter %d of constexpr "
7345 "function %q+#D", DECL_PARM_INDEX (parm), fun);
7346 explain_non_literal_class (TREE_TYPE (parm));
7350 if (!DECL_CONSTRUCTOR_P (fun))
7352 tree rettype = TREE_TYPE (TREE_TYPE (fun));
7353 if (!literal_type_p (rettype))
7358 error ("invalid return type %qT of constexpr function %q+D",
7360 explain_non_literal_class (rettype);
7364 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun)
7365 && !CLASSTYPE_LITERAL_P (DECL_CONTEXT (fun)))
7370 error ("enclosing class of constexpr non-static member "
7371 "function %q+#D is not a literal type", fun);
7372 explain_non_literal_class (DECL_CONTEXT (fun));
7376 else if (CLASSTYPE_VBASECLASSES (DECL_CONTEXT (fun)))
7380 error ("%q#T has virtual base classes", DECL_CONTEXT (fun));
7386 /* Subroutine of build_data_member_initialization. MEMBER is a COMPONENT_REF
7387 for a member of an anonymous aggregate, INIT is the initializer for that
7388 member, and VEC_OUTER is the vector of constructor elements for the class
7389 whose constructor we are processing. Add the initializer to the vector
7390 and return true to indicate success. */
7393 build_anon_member_initialization (tree member, tree init,
7394 vec<constructor_elt, va_gc> **vec_outer)
7396 /* MEMBER presents the relevant fields from the inside out, but we need
7397 to build up the initializer from the outside in so that we can reuse
7398 previously built CONSTRUCTORs if this is, say, the second field in an
7399 anonymous struct. So we use a vec as a stack. */
7404 fields.safe_push (TREE_OPERAND (member, 1));
7405 member = TREE_OPERAND (member, 0);
7407 while (ANON_AGGR_TYPE_P (TREE_TYPE (member)));
7409 /* VEC has the constructor elements vector for the context of FIELD.
7410 If FIELD is an anonymous aggregate, we will push inside it. */
7411 vec<constructor_elt, va_gc> **vec = vec_outer;
7413 while (field = fields.pop(),
7414 ANON_AGGR_TYPE_P (TREE_TYPE (field)))
7417 /* If there is already an outer constructor entry for the anonymous
7418 aggregate FIELD, use it; otherwise, insert one. */
7419 if (vec_safe_is_empty (*vec)
7420 || (*vec)->last().index != field)
7422 ctor = build_constructor (TREE_TYPE (field), NULL);
7423 CONSTRUCTOR_APPEND_ELT (*vec, field, ctor);
7426 ctor = (*vec)->last().value;
7427 vec = &CONSTRUCTOR_ELTS (ctor);
7430 /* Now we're at the innermost field, the one that isn't an anonymous
7431 aggregate. Add its initializer to the CONSTRUCTOR and we're done. */
7432 gcc_assert (fields.is_empty());
7434 CONSTRUCTOR_APPEND_ELT (*vec, field, init);
7439 /* Subroutine of build_constexpr_constructor_member_initializers.
7440 The expression tree T represents a data member initialization
7441 in a (constexpr) constructor definition. Build a pairing of
7442 the data member with its initializer, and prepend that pair
7443 to the existing initialization pair INITS. */
7446 build_data_member_initialization (tree t, vec<constructor_elt, va_gc> **vec)
7449 if (TREE_CODE (t) == CLEANUP_POINT_EXPR)
7450 t = TREE_OPERAND (t, 0);
7451 if (TREE_CODE (t) == EXPR_STMT)
7452 t = TREE_OPERAND (t, 0);
7453 if (t == error_mark_node)
7455 if (TREE_CODE (t) == STATEMENT_LIST)
7457 tree_stmt_iterator i;
7458 for (i = tsi_start (t); !tsi_end_p (i); tsi_next (&i))
7460 if (! build_data_member_initialization (tsi_stmt (i), vec))
7465 if (TREE_CODE (t) == CLEANUP_STMT)
7467 /* We can't see a CLEANUP_STMT in a constructor for a literal class,
7468 but we can in a constexpr constructor for a non-literal class. Just
7469 ignore it; either all the initialization will be constant, in which
7470 case the cleanup can't run, or it can't be constexpr.
7471 Still recurse into CLEANUP_BODY. */
7472 return build_data_member_initialization (CLEANUP_BODY (t), vec);
7474 if (TREE_CODE (t) == CONVERT_EXPR)
7475 t = TREE_OPERAND (t, 0);
7476 if (TREE_CODE (t) == INIT_EXPR
7477 || TREE_CODE (t) == MODIFY_EXPR)
7479 member = TREE_OPERAND (t, 0);
7480 init = break_out_target_exprs (TREE_OPERAND (t, 1));
7482 else if (TREE_CODE (t) == CALL_EXPR)
7484 member = CALL_EXPR_ARG (t, 0);
7485 /* We don't use build_cplus_new here because it complains about
7486 abstract bases. Leaving the call unwrapped means that it has the
7487 wrong type, but cxx_eval_constant_expression doesn't care. */
7488 init = break_out_target_exprs (t);
7490 else if (TREE_CODE (t) == DECL_EXPR)
7491 /* Declaring a temporary, don't add it to the CONSTRUCTOR. */
7495 if (INDIRECT_REF_P (member))
7496 member = TREE_OPERAND (member, 0);
7497 if (TREE_CODE (member) == NOP_EXPR)
7501 if (TREE_CODE (op) == ADDR_EXPR)
7503 gcc_assert (same_type_ignoring_top_level_qualifiers_p
7504 (TREE_TYPE (TREE_TYPE (op)),
7505 TREE_TYPE (TREE_TYPE (member))));
7506 /* Initializing a cv-qualified member; we need to look through
7510 else if (op == current_class_ptr
7511 && (same_type_ignoring_top_level_qualifiers_p
7512 (TREE_TYPE (TREE_TYPE (member)),
7513 current_class_type)))
7514 /* Delegating constructor. */
7518 /* This is an initializer for an empty base; keep it for now so
7519 we can check it in cxx_eval_bare_aggregate. */
7520 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (member))));
7523 if (TREE_CODE (member) == ADDR_EXPR)
7524 member = TREE_OPERAND (member, 0);
7525 if (TREE_CODE (member) == COMPONENT_REF)
7527 tree aggr = TREE_OPERAND (member, 0);
7528 if (TREE_CODE (aggr) != COMPONENT_REF)
7529 /* Normal member initialization. */
7530 member = TREE_OPERAND (member, 1);
7531 else if (ANON_AGGR_TYPE_P (TREE_TYPE (aggr)))
7532 /* Initializing a member of an anonymous union. */
7533 return build_anon_member_initialization (member, init, vec);
7535 /* We're initializing a vtable pointer in a base. Leave it as
7536 COMPONENT_REF so we remember the path to get to the vfield. */
7537 gcc_assert (TREE_TYPE (member) == vtbl_ptr_type_node);
7540 CONSTRUCTOR_APPEND_ELT (*vec, member, init);
7544 /* Make sure that there are no statements after LAST in the constructor
7545 body represented by LIST. */
7548 check_constexpr_ctor_body (tree last, tree list)
7551 if (TREE_CODE (list) == STATEMENT_LIST)
7553 tree_stmt_iterator i = tsi_last (list);
7554 for (; !tsi_end_p (i); tsi_prev (&i))
7556 tree t = tsi_stmt (i);
7559 if (TREE_CODE (t) == BIND_EXPR)
7561 if (!check_constexpr_ctor_body (last, BIND_EXPR_BODY (t)))
7566 /* We currently allow typedefs and static_assert.
7567 FIXME allow them in the standard, too. */
7568 if (TREE_CODE (t) != STATIC_ASSERT)
7575 else if (list != last
7576 && TREE_CODE (list) != STATIC_ASSERT)
7580 error ("constexpr constructor does not have empty body");
7581 DECL_DECLARED_CONSTEXPR_P (current_function_decl) = false;
7586 /* V is a vector of constructor elements built up for the base and member
7587 initializers of a constructor for TYPE. They need to be in increasing
7588 offset order, which they might not be yet if TYPE has a primary base
7589 which is not first in the base-clause or a vptr and at least one base
7590 all of which are non-primary. */
7592 static vec<constructor_elt, va_gc> *
7593 sort_constexpr_mem_initializers (tree type, vec<constructor_elt, va_gc> *v)
7595 tree pri = CLASSTYPE_PRIMARY_BINFO (type);
7597 constructor_elt elt;
7601 field_type = BINFO_TYPE (pri);
7602 else if (TYPE_CONTAINS_VPTR_P (type))
7603 field_type = vtbl_ptr_type_node;
7607 /* Find the element for the primary base or vptr and move it to the
7608 beginning of the vec. */
7609 vec<constructor_elt, va_gc> &vref = *v;
7611 if (TREE_TYPE (vref[i].index) == field_type)
7618 vref[i] = vref[i-1];
7625 /* Build compile-time evalable representations of member-initializer list
7626 for a constexpr constructor. */
7629 build_constexpr_constructor_member_initializers (tree type, tree body)
7631 vec<constructor_elt, va_gc> *vec = NULL;
7633 if (TREE_CODE (body) == MUST_NOT_THROW_EXPR
7634 || TREE_CODE (body) == EH_SPEC_BLOCK)
7635 body = TREE_OPERAND (body, 0);
7636 if (TREE_CODE (body) == STATEMENT_LIST)
7637 body = STATEMENT_LIST_HEAD (body)->stmt;
7638 body = BIND_EXPR_BODY (body);
7639 if (TREE_CODE (body) == CLEANUP_POINT_EXPR)
7641 body = TREE_OPERAND (body, 0);
7642 if (TREE_CODE (body) == EXPR_STMT)
7643 body = TREE_OPERAND (body, 0);
7644 if (TREE_CODE (body) == INIT_EXPR
7645 && (same_type_ignoring_top_level_qualifiers_p
7646 (TREE_TYPE (TREE_OPERAND (body, 0)),
7647 current_class_type)))
7650 return TREE_OPERAND (body, 1);
7652 ok = build_data_member_initialization (body, &vec);
7654 else if (TREE_CODE (body) == STATEMENT_LIST)
7656 tree_stmt_iterator i;
7657 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
7659 ok = build_data_member_initialization (tsi_stmt (i), &vec);
7664 else if (TREE_CODE (body) == TRY_BLOCK)
7666 error ("body of %<constexpr%> constructor cannot be "
7667 "a function-try-block");
7668 return error_mark_node;
7670 else if (EXPR_P (body))
7671 ok = build_data_member_initialization (body, &vec);
7673 gcc_assert (errorcount > 0);
7676 if (vec_safe_length (vec) > 0)
7678 /* In a delegating constructor, return the target. */
7679 constructor_elt *ce = &(*vec)[0];
7680 if (ce->index == current_class_ptr)
7687 vec = sort_constexpr_mem_initializers (type, vec);
7688 return build_constructor (type, vec);
7691 return error_mark_node;
7694 /* Subroutine of register_constexpr_fundef. BODY is the body of a function
7695 declared to be constexpr, or a sub-statement thereof. Returns the
7696 return value if suitable, error_mark_node for a statement not allowed in
7697 a constexpr function, or NULL_TREE if no return value was found. */
7700 constexpr_fn_retval (tree body)
7702 switch (TREE_CODE (body))
7704 case STATEMENT_LIST:
7706 tree_stmt_iterator i;
7707 tree expr = NULL_TREE;
7708 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
7710 tree s = constexpr_fn_retval (tsi_stmt (i));
7711 if (s == error_mark_node)
7712 return error_mark_node;
7713 else if (s == NULL_TREE)
7714 /* Keep iterating. */;
7716 /* Multiple return statements. */
7717 return error_mark_node;
7725 return break_out_target_exprs (TREE_OPERAND (body, 0));
7728 if (TREE_CODE (DECL_EXPR_DECL (body)) == USING_DECL)
7730 return error_mark_node;
7732 case CLEANUP_POINT_EXPR:
7733 return constexpr_fn_retval (TREE_OPERAND (body, 0));
7739 return error_mark_node;
7743 /* Subroutine of register_constexpr_fundef. BODY is the DECL_SAVED_TREE of
7744 FUN; do the necessary transformations to turn it into a single expression
7745 that we can store in the hash table. */
7748 massage_constexpr_body (tree fun, tree body)
7750 if (DECL_CONSTRUCTOR_P (fun))
7751 body = build_constexpr_constructor_member_initializers
7752 (DECL_CONTEXT (fun), body);
7755 if (TREE_CODE (body) == EH_SPEC_BLOCK)
7756 body = EH_SPEC_STMTS (body);
7757 if (TREE_CODE (body) == MUST_NOT_THROW_EXPR)
7758 body = TREE_OPERAND (body, 0);
7759 if (TREE_CODE (body) == BIND_EXPR)
7760 body = BIND_EXPR_BODY (body);
7761 body = constexpr_fn_retval (body);
7766 /* FUN is a constexpr constructor with massaged body BODY. Return true
7767 if some bases/fields are uninitialized, and complain if COMPLAIN. */
7770 cx_check_missing_mem_inits (tree fun, tree body, bool complain)
7777 if (TREE_CODE (body) != CONSTRUCTOR)
7780 nelts = CONSTRUCTOR_NELTS (body);
7781 ctype = DECL_CONTEXT (fun);
7782 field = TYPE_FIELDS (ctype);
7784 if (TREE_CODE (ctype) == UNION_TYPE)
7786 if (nelts == 0 && next_initializable_field (field))
7789 error ("%<constexpr%> constructor for union %qT must "
7790 "initialize exactly one non-static data member", ctype);
7797 for (i = 0; i <= nelts; ++i)
7804 index = CONSTRUCTOR_ELT (body, i)->index;
7805 /* Skip base and vtable inits. */
7806 if (TREE_CODE (index) != FIELD_DECL
7807 || DECL_ARTIFICIAL (index))
7810 for (; field != index; field = DECL_CHAIN (field))
7813 if (TREE_CODE (field) != FIELD_DECL
7814 || (DECL_C_BIT_FIELD (field) && !DECL_NAME (field))
7815 || DECL_ARTIFICIAL (field))
7817 ftype = strip_array_types (TREE_TYPE (field));
7818 if (type_has_constexpr_default_constructor (ftype))
7820 /* It's OK to skip a member with a trivial constexpr ctor.
7821 A constexpr ctor that isn't trivial should have been
7823 gcc_checking_assert (!TYPE_HAS_COMPLEX_DFLT (ftype)
7824 || errorcount != 0);
7829 error ("uninitialized member %qD in %<constexpr%> constructor",
7833 if (field == NULL_TREE)
7835 field = DECL_CHAIN (field);
7841 /* We are processing the definition of the constexpr function FUN.
7842 Check that its BODY fulfills the propriate requirements and
7843 enter it in the constexpr function definition table.
7844 For constructor BODY is actually the TREE_LIST of the
7845 member-initializer list. */
7848 register_constexpr_fundef (tree fun, tree body)
7850 constexpr_fundef entry;
7851 constexpr_fundef **slot;
7853 if (!is_valid_constexpr_fn (fun, !DECL_GENERATED_P (fun)))
7856 body = massage_constexpr_body (fun, body);
7857 if (body == NULL_TREE || body == error_mark_node)
7859 if (!DECL_CONSTRUCTOR_P (fun))
7860 error ("body of constexpr function %qD not a return-statement", fun);
7864 if (!potential_rvalue_constant_expression (body))
7866 if (!DECL_GENERATED_P (fun))
7867 require_potential_rvalue_constant_expression (body);
7871 if (DECL_CONSTRUCTOR_P (fun)
7872 && cx_check_missing_mem_inits (fun, body, !DECL_GENERATED_P (fun)))
7875 /* Create the constexpr function table if necessary. */
7876 if (constexpr_fundef_table == NULL)
7877 constexpr_fundef_table = htab_create_ggc (101,
7878 constexpr_fundef_hash,
7879 constexpr_fundef_equal,
7883 slot = (constexpr_fundef **)
7884 htab_find_slot (constexpr_fundef_table, &entry, INSERT);
7886 gcc_assert (*slot == NULL);
7887 *slot = ggc_alloc_constexpr_fundef ();
7893 /* FUN is a non-constexpr function called in a context that requires a
7894 constant expression. If it comes from a constexpr template, explain why
7895 the instantiation isn't constexpr. */
7898 explain_invalid_constexpr_fn (tree fun)
7900 static struct pointer_set_t *diagnosed;
7902 location_t save_loc;
7903 /* Only diagnose defaulted functions or instantiations. */
7904 if (!DECL_DEFAULTED_FN (fun)
7905 && !is_instantiation_of_constexpr (fun))
7907 if (diagnosed == NULL)
7908 diagnosed = pointer_set_create ();
7909 if (pointer_set_insert (diagnosed, fun) != 0)
7910 /* Already explained. */
7913 save_loc = input_location;
7914 input_location = DECL_SOURCE_LOCATION (fun);
7915 inform (0, "%q+D is not usable as a constexpr function because:", fun);
7916 /* First check the declaration. */
7917 if (is_valid_constexpr_fn (fun, true))
7919 /* Then if it's OK, the body. */
7920 if (DECL_DEFAULTED_FN (fun))
7921 explain_implicit_non_constexpr (fun);
7924 body = massage_constexpr_body (fun, DECL_SAVED_TREE (fun));
7925 require_potential_rvalue_constant_expression (body);
7926 if (DECL_CONSTRUCTOR_P (fun))
7927 cx_check_missing_mem_inits (fun, body, true);
7930 input_location = save_loc;
7933 /* Objects of this type represent calls to constexpr functions
7934 along with the bindings of parameters to their arguments, for
7935 the purpose of compile time evaluation. */
7937 typedef struct GTY(()) constexpr_call {
7938 /* Description of the constexpr function definition. */
7939 constexpr_fundef *fundef;
7940 /* Parameter bindings environment. A TREE_LIST where each TREE_PURPOSE
7941 is a parameter _DECL and the TREE_VALUE is the value of the parameter.
7942 Note: This arrangement is made to accommodate the use of
7943 iterative_hash_template_arg (see pt.c). If you change this
7944 representation, also change the hash calculation in
7945 cxx_eval_call_expression. */
7947 /* Result of the call.
7948 NULL means the call is being evaluated.
7949 error_mark_node means that the evaluation was erroneous;
7950 otherwise, the actuall value of the call. */
7952 /* The hash of this call; we remember it here to avoid having to
7953 recalculate it when expanding the hash table. */
7957 /* A table of all constexpr calls that have been evaluated by the
7958 compiler in this translation unit. */
7960 static GTY ((param_is (constexpr_call))) htab_t constexpr_call_table;
7962 static tree cxx_eval_constant_expression (const constexpr_call *, tree,
7963 bool, bool, bool *, bool *);
7965 /* Compute a hash value for a constexpr call representation. */
7968 constexpr_call_hash (const void *p)
7970 const constexpr_call *info = (const constexpr_call *) p;
7974 /* Return 1 if the objects pointed to by P and Q represent calls
7975 to the same constexpr function with the same arguments.
7976 Otherwise, return 0. */
7979 constexpr_call_equal (const void *p, const void *q)
7981 const constexpr_call *lhs = (const constexpr_call *) p;
7982 const constexpr_call *rhs = (const constexpr_call *) q;
7987 if (!constexpr_fundef_equal (lhs->fundef, rhs->fundef))
7989 lhs_bindings = lhs->bindings;
7990 rhs_bindings = rhs->bindings;
7991 while (lhs_bindings != NULL && rhs_bindings != NULL)
7993 tree lhs_arg = TREE_VALUE (lhs_bindings);
7994 tree rhs_arg = TREE_VALUE (rhs_bindings);
7995 gcc_assert (TREE_TYPE (lhs_arg) == TREE_TYPE (rhs_arg));
7996 if (!cp_tree_equal (lhs_arg, rhs_arg))
7998 lhs_bindings = TREE_CHAIN (lhs_bindings);
7999 rhs_bindings = TREE_CHAIN (rhs_bindings);
8001 return lhs_bindings == rhs_bindings;
8004 /* Initialize the constexpr call table, if needed. */
8007 maybe_initialize_constexpr_call_table (void)
8009 if (constexpr_call_table == NULL)
8010 constexpr_call_table = htab_create_ggc (101,
8011 constexpr_call_hash,
8012 constexpr_call_equal,
8016 /* Return true if T designates the implied `this' parameter. */
8019 is_this_parameter (tree t)
8021 return t == current_class_ptr;
8024 /* We have an expression tree T that represents a call, either CALL_EXPR
8025 or AGGR_INIT_EXPR. If the call is lexically to a named function,
8026 retrun the _DECL for that function. */
8029 get_function_named_in_call (tree t)
8032 switch (TREE_CODE (t))
8035 fun = CALL_EXPR_FN (t);
8038 case AGGR_INIT_EXPR:
8039 fun = AGGR_INIT_EXPR_FN (t);
8046 if (TREE_CODE (fun) == ADDR_EXPR
8047 && TREE_CODE (TREE_OPERAND (fun, 0)) == FUNCTION_DECL)
8048 fun = TREE_OPERAND (fun, 0);
8052 /* We have an expression tree T that represents a call, either CALL_EXPR
8053 or AGGR_INIT_EXPR. Return the Nth argument. */
8056 get_nth_callarg (tree t, int n)
8058 switch (TREE_CODE (t))
8061 return CALL_EXPR_ARG (t, n);
8063 case AGGR_INIT_EXPR:
8064 return AGGR_INIT_EXPR_ARG (t, n);
8072 /* Look up the binding of the function parameter T in a constexpr
8073 function call context CALL. */
8076 lookup_parameter_binding (const constexpr_call *call, tree t)
8078 tree b = purpose_member (t, call->bindings);
8079 return TREE_VALUE (b);
8082 /* Attempt to evaluate T which represents a call to a builtin function.
8083 We assume here that all builtin functions evaluate to scalar types
8084 represented by _CST nodes. */
8087 cxx_eval_builtin_function_call (const constexpr_call *call, tree t,
8088 bool allow_non_constant, bool addr,
8089 bool *non_constant_p, bool *overflow_p)
8091 const int nargs = call_expr_nargs (t);
8092 tree *args = (tree *) alloca (nargs * sizeof (tree));
8095 for (i = 0; i < nargs; ++i)
8097 args[i] = cxx_eval_constant_expression (call, CALL_EXPR_ARG (t, i),
8098 allow_non_constant, addr,
8099 non_constant_p, overflow_p);
8100 if (allow_non_constant && *non_constant_p)
8103 if (*non_constant_p)
8105 new_call = build_call_array_loc (EXPR_LOCATION (t), TREE_TYPE (t),
8106 CALL_EXPR_FN (t), nargs, args);
8107 new_call = fold (new_call);
8108 VERIFY_CONSTANT (new_call);
8112 /* TEMP is the constant value of a temporary object of type TYPE. Adjust
8113 the type of the value to match. */
8116 adjust_temp_type (tree type, tree temp)
8118 if (TREE_TYPE (temp) == type)
8120 /* Avoid wrapping an aggregate value in a NOP_EXPR. */
8121 if (TREE_CODE (temp) == CONSTRUCTOR)
8122 return build_constructor (type, CONSTRUCTOR_ELTS (temp));
8123 gcc_assert (scalarish_type_p (type));
8124 return cp_fold_convert (type, temp);
8127 /* Subroutine of cxx_eval_call_expression.
8128 We are processing a call expression (either CALL_EXPR or
8129 AGGR_INIT_EXPR) in the call context of OLD_CALL. Evaluate
8130 all arguments and bind their values to correspondings
8131 parameters, making up the NEW_CALL context. */
8134 cxx_bind_parameters_in_call (const constexpr_call *old_call, tree t,
8135 constexpr_call *new_call,
8136 bool allow_non_constant,
8137 bool *non_constant_p, bool *overflow_p)
8139 const int nargs = call_expr_nargs (t);
8140 tree fun = new_call->fundef->decl;
8141 tree parms = DECL_ARGUMENTS (fun);
8143 for (i = 0; i < nargs; ++i)
8146 tree type = parms ? TREE_TYPE (parms) : void_type_node;
8147 /* For member function, the first argument is a pointer to the implied
8148 object. And for an object construction, don't bind `this' before
8149 it is fully constructed. */
8150 if (i == 0 && DECL_CONSTRUCTOR_P (fun))
8152 x = get_nth_callarg (t, i);
8153 if (parms && DECL_BY_REFERENCE (parms))
8155 /* cp_genericize made this a reference for argument passing, but
8156 we don't want to treat it like one for constexpr evaluation. */
8157 gcc_assert (TREE_CODE (type) == REFERENCE_TYPE);
8158 gcc_assert (TREE_CODE (TREE_TYPE (x)) == REFERENCE_TYPE);
8159 type = TREE_TYPE (type);
8160 x = convert_from_reference (x);
8162 arg = cxx_eval_constant_expression (old_call, x, allow_non_constant,
8163 TREE_CODE (type) == REFERENCE_TYPE,
8164 non_constant_p, overflow_p);
8165 /* Don't VERIFY_CONSTANT here. */
8166 if (*non_constant_p && allow_non_constant)
8168 /* Just discard ellipsis args after checking their constantitude. */
8171 if (*non_constant_p)
8172 /* Don't try to adjust the type of non-constant args. */
8175 /* Make sure the binding has the same type as the parm. */
8176 if (TREE_CODE (type) != REFERENCE_TYPE)
8177 arg = adjust_temp_type (type, arg);
8178 new_call->bindings = tree_cons (parms, arg, new_call->bindings);
8180 parms = TREE_CHAIN (parms);
8184 /* Variables and functions to manage constexpr call expansion context.
8185 These do not need to be marked for PCH or GC. */
8187 /* FIXME remember and print actual constant arguments. */
8188 static vec<tree> call_stack = vNULL;
8189 static int call_stack_tick;
8190 static int last_cx_error_tick;
8193 push_cx_call_context (tree call)
8196 if (!EXPR_HAS_LOCATION (call))
8197 SET_EXPR_LOCATION (call, input_location);
8198 call_stack.safe_push (call);
8199 if (call_stack.length () > (unsigned) max_constexpr_depth)
8205 pop_cx_call_context (void)
8212 cx_error_context (void)
8214 vec<tree> r = vNULL;
8215 if (call_stack_tick != last_cx_error_tick
8216 && !call_stack.is_empty ())
8218 last_cx_error_tick = call_stack_tick;
8222 /* Subroutine of cxx_eval_constant_expression.
8223 Evaluate the call expression tree T in the context of OLD_CALL expression
8227 cxx_eval_call_expression (const constexpr_call *old_call, tree t,
8228 bool allow_non_constant, bool addr,
8229 bool *non_constant_p, bool *overflow_p)
8231 location_t loc = EXPR_LOC_OR_HERE (t);
8232 tree fun = get_function_named_in_call (t);
8234 constexpr_call new_call = { NULL, NULL, NULL, 0 };
8235 constexpr_call **slot;
8236 constexpr_call *entry;
8239 if (TREE_CODE (fun) != FUNCTION_DECL)
8241 /* Might be a constexpr function pointer. */
8242 fun = cxx_eval_constant_expression (old_call, fun, allow_non_constant,
8243 /*addr*/false, non_constant_p, overflow_p);
8244 if (TREE_CODE (fun) == ADDR_EXPR)
8245 fun = TREE_OPERAND (fun, 0);
8247 if (TREE_CODE (fun) != FUNCTION_DECL)
8249 if (!allow_non_constant && !*non_constant_p)
8250 error_at (loc, "expression %qE does not designate a constexpr "
8252 *non_constant_p = true;
8255 if (DECL_CLONED_FUNCTION_P (fun))
8256 fun = DECL_CLONED_FUNCTION (fun);
8257 if (is_builtin_fn (fun))
8258 return cxx_eval_builtin_function_call (old_call, t, allow_non_constant,
8259 addr, non_constant_p, overflow_p);
8260 if (!DECL_DECLARED_CONSTEXPR_P (fun))
8262 if (!allow_non_constant)
8264 error_at (loc, "call to non-constexpr function %qD", fun);
8265 explain_invalid_constexpr_fn (fun);
8267 *non_constant_p = true;
8271 /* Shortcut trivial copy constructor/op=. */
8272 if (call_expr_nargs (t) == 2 && trivial_fn_p (fun))
8274 tree arg = convert_from_reference (get_nth_callarg (t, 1));
8275 return cxx_eval_constant_expression (old_call, arg, allow_non_constant,
8276 addr, non_constant_p, overflow_p);
8279 /* If in direct recursive call, optimize definition search. */
8280 if (old_call != NULL && old_call->fundef->decl == fun)
8281 new_call.fundef = old_call->fundef;
8284 new_call.fundef = retrieve_constexpr_fundef (fun);
8285 if (new_call.fundef == NULL || new_call.fundef->body == NULL)
8287 if (!allow_non_constant)
8289 if (DECL_INITIAL (fun))
8291 /* The definition of fun was somehow unsuitable. */
8292 error_at (loc, "%qD called in a constant expression", fun);
8293 explain_invalid_constexpr_fn (fun);
8296 error_at (loc, "%qD used before its definition", fun);
8298 *non_constant_p = true;
8302 cxx_bind_parameters_in_call (old_call, t, &new_call,
8303 allow_non_constant, non_constant_p, overflow_p);
8304 if (*non_constant_p)
8307 depth_ok = push_cx_call_context (t);
8310 = iterative_hash_template_arg (new_call.bindings,
8311 constexpr_fundef_hash (new_call.fundef));
8313 /* If we have seen this call before, we are done. */
8314 maybe_initialize_constexpr_call_table ();
8315 slot = (constexpr_call **)
8316 htab_find_slot (constexpr_call_table, &new_call, INSERT);
8320 /* We need to keep a pointer to the entry, not just the slot, as the
8321 slot can move in the call to cxx_eval_builtin_function_call. */
8322 *slot = entry = ggc_alloc_constexpr_call ();
8325 /* Calls which are in progress have their result set to NULL
8326 so that we can detect circular dependencies. */
8327 else if (entry->result == NULL)
8329 if (!allow_non_constant)
8330 error ("call has circular dependency");
8331 *non_constant_p = true;
8332 entry->result = result = error_mark_node;
8337 if (!allow_non_constant)
8338 error ("constexpr evaluation depth exceeds maximum of %d (use "
8339 "-fconstexpr-depth= to increase the maximum)",
8340 max_constexpr_depth);
8341 *non_constant_p = true;
8342 entry->result = result = error_mark_node;
8346 result = entry->result;
8347 if (!result || result == error_mark_node)
8348 result = (cxx_eval_constant_expression
8349 (&new_call, new_call.fundef->body,
8350 allow_non_constant, addr,
8351 non_constant_p, overflow_p));
8352 if (result == error_mark_node)
8353 *non_constant_p = true;
8354 if (*non_constant_p)
8355 entry->result = result = error_mark_node;
8358 /* If this was a call to initialize an object, set the type of
8359 the CONSTRUCTOR to the type of that object. */
8360 if (DECL_CONSTRUCTOR_P (fun))
8362 tree ob_arg = get_nth_callarg (t, 0);
8363 STRIP_NOPS (ob_arg);
8364 gcc_assert (TYPE_PTR_P (TREE_TYPE (ob_arg))
8365 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (ob_arg))));
8366 result = adjust_temp_type (TREE_TYPE (TREE_TYPE (ob_arg)),
8369 entry->result = result;
8373 pop_cx_call_context ();
8374 return unshare_expr (result);
8377 /* FIXME speed this up, it's taking 16% of compile time on sieve testcase. */
8380 reduced_constant_expression_p (tree t)
8382 if (TREE_CODE (t) == PTRMEM_CST)
8383 /* Even if we can't lower this yet, it's constant. */
8385 /* FIXME are we calling this too much? */
8386 return initializer_constant_valid_p (t, TREE_TYPE (t)) != NULL_TREE;
8389 /* Some expressions may have constant operands but are not constant
8390 themselves, such as 1/0. Call this function (or rather, the macro
8391 following it) to check for that condition.
8393 We only call this in places that require an arithmetic constant, not in
8394 places where we might have a non-constant expression that can be a
8395 component of a constant expression, such as the address of a constexpr
8396 variable that might be dereferenced later. */
8399 verify_constant (tree t, bool allow_non_constant, bool *non_constant_p,
8402 if (!*non_constant_p && !reduced_constant_expression_p (t))
8404 if (!allow_non_constant)
8405 error ("%q+E is not a constant expression", t);
8406 *non_constant_p = true;
8408 if (TREE_OVERFLOW_P (t))
8410 if (!allow_non_constant)
8412 permerror (input_location, "overflow in constant expression");
8413 /* If we're being permissive (and are in an enforcing
8414 context), ignore the overflow. */
8415 if (flag_permissive)
8416 return *non_constant_p;
8420 return *non_constant_p;
8423 /* Subroutine of cxx_eval_constant_expression.
8424 Attempt to reduce the unary expression tree T to a compile time value.
8425 If successful, return the value. Otherwise issue a diagnostic
8426 and return error_mark_node. */
8429 cxx_eval_unary_expression (const constexpr_call *call, tree t,
8430 bool allow_non_constant, bool addr,
8431 bool *non_constant_p, bool *overflow_p)
8434 tree orig_arg = TREE_OPERAND (t, 0);
8435 tree arg = cxx_eval_constant_expression (call, orig_arg, allow_non_constant,
8436 addr, non_constant_p, overflow_p);
8437 VERIFY_CONSTANT (arg);
8438 if (arg == orig_arg)
8440 r = fold_build1 (TREE_CODE (t), TREE_TYPE (t), arg);
8441 VERIFY_CONSTANT (r);
8445 /* Subroutine of cxx_eval_constant_expression.
8446 Like cxx_eval_unary_expression, except for binary expressions. */
8449 cxx_eval_binary_expression (const constexpr_call *call, tree t,
8450 bool allow_non_constant, bool addr,
8451 bool *non_constant_p, bool *overflow_p)
8454 tree orig_lhs = TREE_OPERAND (t, 0);
8455 tree orig_rhs = TREE_OPERAND (t, 1);
8457 lhs = cxx_eval_constant_expression (call, orig_lhs,
8458 allow_non_constant, addr,
8459 non_constant_p, overflow_p);
8460 VERIFY_CONSTANT (lhs);
8461 rhs = cxx_eval_constant_expression (call, orig_rhs,
8462 allow_non_constant, addr,
8463 non_constant_p, overflow_p);
8464 VERIFY_CONSTANT (rhs);
8465 if (lhs == orig_lhs && rhs == orig_rhs)
8467 r = fold_build2 (TREE_CODE (t), TREE_TYPE (t), lhs, rhs);
8468 VERIFY_CONSTANT (r);
8472 /* Subroutine of cxx_eval_constant_expression.
8473 Attempt to evaluate condition expressions. Dead branches are not
8477 cxx_eval_conditional_expression (const constexpr_call *call, tree t,
8478 bool allow_non_constant, bool addr,
8479 bool *non_constant_p, bool *overflow_p)
8481 tree val = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
8482 allow_non_constant, addr,
8483 non_constant_p, overflow_p);
8484 VERIFY_CONSTANT (val);
8485 /* Don't VERIFY_CONSTANT the other operands. */
8486 if (integer_zerop (val))
8487 return cxx_eval_constant_expression (call, TREE_OPERAND (t, 2),
8488 allow_non_constant, addr,
8489 non_constant_p, overflow_p);
8490 return cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
8491 allow_non_constant, addr,
8492 non_constant_p, overflow_p);
8495 /* Subroutine of cxx_eval_constant_expression.
8496 Attempt to reduce a reference to an array slot. */
8499 cxx_eval_array_reference (const constexpr_call *call, tree t,
8500 bool allow_non_constant, bool addr,
8501 bool *non_constant_p, bool *overflow_p)
8503 tree oldary = TREE_OPERAND (t, 0);
8504 tree ary = cxx_eval_constant_expression (call, oldary,
8505 allow_non_constant, addr,
8506 non_constant_p, overflow_p);
8510 unsigned len, elem_nchars = 1;
8511 if (*non_constant_p)
8513 oldidx = TREE_OPERAND (t, 1);
8514 index = cxx_eval_constant_expression (call, oldidx,
8515 allow_non_constant, false,
8516 non_constant_p, overflow_p);
8517 VERIFY_CONSTANT (index);
8518 if (addr && ary == oldary && index == oldidx)
8521 return build4 (ARRAY_REF, TREE_TYPE (t), ary, index, NULL, NULL);
8522 elem_type = TREE_TYPE (TREE_TYPE (ary));
8523 if (TREE_CODE (ary) == CONSTRUCTOR)
8524 len = CONSTRUCTOR_NELTS (ary);
8525 else if (TREE_CODE (ary) == STRING_CST)
8527 elem_nchars = (TYPE_PRECISION (elem_type)
8528 / TYPE_PRECISION (char_type_node));
8529 len = (unsigned) TREE_STRING_LENGTH (ary) / elem_nchars;
8533 /* We can't do anything with other tree codes, so use
8534 VERIFY_CONSTANT to complain and fail. */
8535 VERIFY_CONSTANT (ary);
8538 if (compare_tree_int (index, len) >= 0)
8540 if (tree_int_cst_lt (index, array_type_nelts_top (TREE_TYPE (ary))))
8542 /* If it's within the array bounds but doesn't have an explicit
8543 initializer, it's value-initialized. */
8544 tree val = build_value_init (elem_type, tf_warning_or_error);
8545 return cxx_eval_constant_expression (call, val,
8546 allow_non_constant, addr,
8547 non_constant_p, overflow_p);
8550 if (!allow_non_constant)
8551 error ("array subscript out of bound");
8552 *non_constant_p = true;
8555 else if (tree_int_cst_lt (index, integer_zero_node))
8557 if (!allow_non_constant)
8558 error ("negative array subscript");
8559 *non_constant_p = true;
8562 i = tree_low_cst (index, 0);
8563 if (TREE_CODE (ary) == CONSTRUCTOR)
8564 return (*CONSTRUCTOR_ELTS (ary))[i].value;
8565 else if (elem_nchars == 1)
8566 return build_int_cst (cv_unqualified (TREE_TYPE (TREE_TYPE (ary))),
8567 TREE_STRING_POINTER (ary)[i]);
8570 tree type = cv_unqualified (TREE_TYPE (TREE_TYPE (ary)));
8571 return native_interpret_expr (type, (const unsigned char *)
8572 TREE_STRING_POINTER (ary)
8573 + i * elem_nchars, elem_nchars);
8575 /* Don't VERIFY_CONSTANT here. */
8578 /* Subroutine of cxx_eval_constant_expression.
8579 Attempt to reduce a field access of a value of class type. */
8582 cxx_eval_component_reference (const constexpr_call *call, tree t,
8583 bool allow_non_constant, bool addr,
8584 bool *non_constant_p, bool *overflow_p)
8586 unsigned HOST_WIDE_INT i;
8589 tree part = TREE_OPERAND (t, 1);
8590 tree orig_whole = TREE_OPERAND (t, 0);
8591 tree whole = cxx_eval_constant_expression (call, orig_whole,
8592 allow_non_constant, addr,
8593 non_constant_p, overflow_p);
8594 if (whole == orig_whole)
8597 return fold_build3 (COMPONENT_REF, TREE_TYPE (t),
8598 whole, part, NULL_TREE);
8599 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
8601 if (!*non_constant_p && TREE_CODE (whole) != CONSTRUCTOR)
8603 if (!allow_non_constant)
8604 error ("%qE is not a constant expression", orig_whole);
8605 *non_constant_p = true;
8607 if (DECL_MUTABLE_P (part))
8609 if (!allow_non_constant)
8610 error ("mutable %qD is not usable in a constant expression", part);
8611 *non_constant_p = true;
8613 if (*non_constant_p)
8615 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole), i, field, value)
8620 if (TREE_CODE (TREE_TYPE (whole)) == UNION_TYPE
8621 && CONSTRUCTOR_NELTS (whole) > 0)
8623 /* DR 1188 says we don't have to deal with this. */
8624 if (!allow_non_constant)
8625 error ("accessing %qD member instead of initialized %qD member in "
8626 "constant expression", part, CONSTRUCTOR_ELT (whole, 0)->index);
8627 *non_constant_p = true;
8631 /* If there's no explicit init for this field, it's value-initialized. */
8632 value = build_value_init (TREE_TYPE (t), tf_warning_or_error);
8633 return cxx_eval_constant_expression (call, value,
8634 allow_non_constant, addr,
8635 non_constant_p, overflow_p);
8638 /* Subroutine of cxx_eval_constant_expression.
8639 Attempt to reduce a field access of a value of class type that is
8640 expressed as a BIT_FIELD_REF. */
8643 cxx_eval_bit_field_ref (const constexpr_call *call, tree t,
8644 bool allow_non_constant, bool addr,
8645 bool *non_constant_p, bool *overflow_p)
8647 tree orig_whole = TREE_OPERAND (t, 0);
8648 tree retval, fldval, utype, mask;
8649 bool fld_seen = false;
8650 HOST_WIDE_INT istart, isize;
8651 tree whole = cxx_eval_constant_expression (call, orig_whole,
8652 allow_non_constant, addr,
8653 non_constant_p, overflow_p);
8654 tree start, field, value;
8655 unsigned HOST_WIDE_INT i;
8657 if (whole == orig_whole)
8659 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
8661 if (!*non_constant_p
8662 && TREE_CODE (whole) != VECTOR_CST
8663 && TREE_CODE (whole) != CONSTRUCTOR)
8665 if (!allow_non_constant)
8666 error ("%qE is not a constant expression", orig_whole);
8667 *non_constant_p = true;
8669 if (*non_constant_p)
8672 if (TREE_CODE (whole) == VECTOR_CST)
8673 return fold_ternary (BIT_FIELD_REF, TREE_TYPE (t), whole,
8674 TREE_OPERAND (t, 1), TREE_OPERAND (t, 2));
8676 start = TREE_OPERAND (t, 2);
8677 istart = tree_low_cst (start, 0);
8678 isize = tree_low_cst (TREE_OPERAND (t, 1), 0);
8679 utype = TREE_TYPE (t);
8680 if (!TYPE_UNSIGNED (utype))
8681 utype = build_nonstandard_integer_type (TYPE_PRECISION (utype), 1);
8682 retval = build_int_cst (utype, 0);
8683 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole), i, field, value)
8685 tree bitpos = bit_position (field);
8686 if (bitpos == start && DECL_SIZE (field) == TREE_OPERAND (t, 1))
8688 if (TREE_CODE (TREE_TYPE (field)) == INTEGER_TYPE
8689 && TREE_CODE (value) == INTEGER_CST
8690 && host_integerp (bitpos, 0)
8691 && host_integerp (DECL_SIZE (field), 0))
8693 HOST_WIDE_INT bit = tree_low_cst (bitpos, 0);
8694 HOST_WIDE_INT sz = tree_low_cst (DECL_SIZE (field), 0);
8695 HOST_WIDE_INT shift;
8696 if (bit >= istart && bit + sz <= istart + isize)
8698 fldval = fold_convert (utype, value);
8699 mask = build_int_cst_type (utype, -1);
8700 mask = fold_build2 (LSHIFT_EXPR, utype, mask,
8701 size_int (TYPE_PRECISION (utype) - sz));
8702 mask = fold_build2 (RSHIFT_EXPR, utype, mask,
8703 size_int (TYPE_PRECISION (utype) - sz));
8704 fldval = fold_build2 (BIT_AND_EXPR, utype, fldval, mask);
8705 shift = bit - istart;
8706 if (BYTES_BIG_ENDIAN)
8707 shift = TYPE_PRECISION (utype) - shift - sz;
8708 fldval = fold_build2 (LSHIFT_EXPR, utype, fldval,
8710 retval = fold_build2 (BIT_IOR_EXPR, utype, retval, fldval);
8716 return fold_convert (TREE_TYPE (t), retval);
8718 return error_mark_node;
8721 /* Subroutine of cxx_eval_constant_expression.
8722 Evaluate a short-circuited logical expression T in the context
8723 of a given constexpr CALL. BAILOUT_VALUE is the value for
8724 early return. CONTINUE_VALUE is used here purely for
8725 sanity check purposes. */
8728 cxx_eval_logical_expression (const constexpr_call *call, tree t,
8729 tree bailout_value, tree continue_value,
8730 bool allow_non_constant, bool addr,
8731 bool *non_constant_p, bool *overflow_p)
8734 tree lhs = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
8735 allow_non_constant, addr,
8736 non_constant_p, overflow_p);
8737 VERIFY_CONSTANT (lhs);
8738 if (tree_int_cst_equal (lhs, bailout_value))
8740 gcc_assert (tree_int_cst_equal (lhs, continue_value));
8741 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
8742 allow_non_constant, addr, non_constant_p, overflow_p);
8743 VERIFY_CONSTANT (r);
8747 /* REF is a COMPONENT_REF designating a particular field. V is a vector of
8748 CONSTRUCTOR elements to initialize (part of) an object containing that
8749 field. Return a pointer to the constructor_elt corresponding to the
8750 initialization of the field. */
8752 static constructor_elt *
8753 base_field_constructor_elt (vec<constructor_elt, va_gc> *v, tree ref)
8755 tree aggr = TREE_OPERAND (ref, 0);
8756 tree field = TREE_OPERAND (ref, 1);
8758 constructor_elt *ce;
8760 gcc_assert (TREE_CODE (ref) == COMPONENT_REF);
8762 if (TREE_CODE (aggr) == COMPONENT_REF)
8764 constructor_elt *base_ce
8765 = base_field_constructor_elt (v, aggr);
8766 v = CONSTRUCTOR_ELTS (base_ce->value);
8769 for (i = 0; vec_safe_iterate (v, i, &ce); ++i)
8770 if (ce->index == field)
8777 /* Subroutine of cxx_eval_constant_expression.
8778 The expression tree T denotes a C-style array or a C-style
8779 aggregate. Reduce it to a constant expression. */
8782 cxx_eval_bare_aggregate (const constexpr_call *call, tree t,
8783 bool allow_non_constant, bool addr,
8784 bool *non_constant_p, bool *overflow_p)
8786 vec<constructor_elt, va_gc> *v = CONSTRUCTOR_ELTS (t);
8787 vec<constructor_elt, va_gc> *n;
8788 vec_alloc (n, vec_safe_length (v));
8789 constructor_elt *ce;
8791 bool changed = false;
8792 gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (t));
8793 for (i = 0; vec_safe_iterate (v, i, &ce); ++i)
8795 tree elt = cxx_eval_constant_expression (call, ce->value,
8796 allow_non_constant, addr,
8797 non_constant_p, overflow_p);
8798 /* Don't VERIFY_CONSTANT here. */
8799 if (allow_non_constant && *non_constant_p)
8801 if (elt != ce->value)
8803 if (ce->index && TREE_CODE (ce->index) == COMPONENT_REF)
8805 /* This is an initialization of a vfield inside a base
8806 subaggregate that we already initialized; push this
8807 initialization into the previous initialization. */
8808 constructor_elt *inner = base_field_constructor_elt (n, ce->index);
8811 else if (ce->index && TREE_CODE (ce->index) == NOP_EXPR)
8813 /* This is an initializer for an empty base; now that we've
8814 checked that it's constant, we can ignore it. */
8815 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (ce->index))));
8818 CONSTRUCTOR_APPEND_ELT (n, ce->index, elt);
8820 if (*non_constant_p || !changed)
8826 t = build_constructor (TREE_TYPE (t), n);
8827 TREE_CONSTANT (t) = true;
8828 if (TREE_CODE (TREE_TYPE (t)) == VECTOR_TYPE)
8833 /* Subroutine of cxx_eval_constant_expression.
8834 The expression tree T is a VEC_INIT_EXPR which denotes the desired
8835 initialization of a non-static data member of array type. Reduce it to a
8838 Note that apart from value-initialization (when VALUE_INIT is true),
8839 this is only intended to support value-initialization and the
8840 initializations done by defaulted constructors for classes with
8841 non-static data members of array type. In this case, VEC_INIT_EXPR_INIT
8842 will either be NULL_TREE for the default constructor, or a COMPONENT_REF
8843 for the copy/move constructor. */
8846 cxx_eval_vec_init_1 (const constexpr_call *call, tree atype, tree init,
8847 bool value_init, bool allow_non_constant, bool addr,
8848 bool *non_constant_p, bool *overflow_p)
8850 tree elttype = TREE_TYPE (atype);
8851 int max = tree_low_cst (array_type_nelts (atype), 0);
8852 vec<constructor_elt, va_gc> *n;
8853 vec_alloc (n, max + 1);
8854 bool pre_init = false;
8857 /* For the default constructor, build up a call to the default
8858 constructor of the element type. We only need to handle class types
8859 here, as for a constructor to be constexpr, all members must be
8860 initialized, which for a defaulted default constructor means they must
8861 be of a class type with a constexpr default constructor. */
8862 if (TREE_CODE (elttype) == ARRAY_TYPE)
8863 /* We only do this at the lowest level. */;
8864 else if (value_init)
8866 init = build_value_init (elttype, tf_warning_or_error);
8867 init = cxx_eval_constant_expression
8868 (call, init, allow_non_constant, addr, non_constant_p, overflow_p);
8873 vec<tree, va_gc> *argvec = make_tree_vector ();
8874 init = build_special_member_call (NULL_TREE, complete_ctor_identifier,
8875 &argvec, elttype, LOOKUP_NORMAL,
8876 tf_warning_or_error);
8877 release_tree_vector (argvec);
8878 init = cxx_eval_constant_expression (call, init, allow_non_constant,
8879 addr, non_constant_p, overflow_p);
8883 if (*non_constant_p && !allow_non_constant)
8886 for (i = 0; i <= max; ++i)
8888 tree idx = build_int_cst (size_type_node, i);
8890 if (TREE_CODE (elttype) == ARRAY_TYPE)
8892 /* A multidimensional array; recurse. */
8893 if (value_init || init == NULL_TREE)
8894 eltinit = NULL_TREE;
8896 eltinit = cp_build_array_ref (input_location, init, idx,
8897 tf_warning_or_error);
8898 eltinit = cxx_eval_vec_init_1 (call, elttype, eltinit, value_init,
8899 allow_non_constant, addr,
8900 non_constant_p, overflow_p);
8904 /* Initializing an element using value or default initialization
8905 we just pre-built above. */
8909 eltinit = unshare_expr (init);
8913 /* Copying an element. */
8914 vec<tree, va_gc> *argvec;
8915 gcc_assert (same_type_ignoring_top_level_qualifiers_p
8916 (atype, TREE_TYPE (init)));
8917 eltinit = cp_build_array_ref (input_location, init, idx,
8918 tf_warning_or_error);
8919 if (!real_lvalue_p (init))
8920 eltinit = move (eltinit);
8921 argvec = make_tree_vector ();
8922 argvec->quick_push (eltinit);
8923 eltinit = (build_special_member_call
8924 (NULL_TREE, complete_ctor_identifier, &argvec,
8925 elttype, LOOKUP_NORMAL, tf_warning_or_error));
8926 release_tree_vector (argvec);
8927 eltinit = cxx_eval_constant_expression
8928 (call, eltinit, allow_non_constant, addr, non_constant_p, overflow_p);
8930 if (*non_constant_p && !allow_non_constant)
8932 CONSTRUCTOR_APPEND_ELT (n, idx, eltinit);
8935 if (!*non_constant_p)
8937 init = build_constructor (atype, n);
8938 TREE_CONSTANT (init) = true;
8948 cxx_eval_vec_init (const constexpr_call *call, tree t,
8949 bool allow_non_constant, bool addr,
8950 bool *non_constant_p, bool *overflow_p)
8952 tree atype = TREE_TYPE (t);
8953 tree init = VEC_INIT_EXPR_INIT (t);
8954 tree r = cxx_eval_vec_init_1 (call, atype, init,
8955 VEC_INIT_EXPR_VALUE_INIT (t),
8956 allow_non_constant, addr, non_constant_p, overflow_p);
8957 if (*non_constant_p)
8963 /* A less strict version of fold_indirect_ref_1, which requires cv-quals to
8964 match. We want to be less strict for simple *& folding; if we have a
8965 non-const temporary that we access through a const pointer, that should
8966 work. We handle this here rather than change fold_indirect_ref_1
8967 because we're dealing with things like ADDR_EXPR of INTEGER_CST which
8968 don't really make sense outside of constant expression evaluation. Also
8969 we want to allow folding to COMPONENT_REF, which could cause trouble
8970 with TBAA in fold_indirect_ref_1.
8972 Try to keep this function synced with fold_indirect_ref_1. */
8975 cxx_fold_indirect_ref (location_t loc, tree type, tree op0, bool *empty_base)
8981 subtype = TREE_TYPE (sub);
8982 if (!POINTER_TYPE_P (subtype))
8985 if (TREE_CODE (sub) == ADDR_EXPR)
8987 tree op = TREE_OPERAND (sub, 0);
8988 tree optype = TREE_TYPE (op);
8990 /* *&CONST_DECL -> to the value of the const decl. */
8991 if (TREE_CODE (op) == CONST_DECL)
8992 return DECL_INITIAL (op);
8993 /* *&p => p; make sure to handle *&"str"[cst] here. */
8994 if (same_type_ignoring_top_level_qualifiers_p (optype, type))
8996 tree fop = fold_read_from_constant_string (op);
9002 /* *(foo *)&fooarray => fooarray[0] */
9003 else if (TREE_CODE (optype) == ARRAY_TYPE
9004 && (same_type_ignoring_top_level_qualifiers_p
9005 (type, TREE_TYPE (optype))))
9007 tree type_domain = TYPE_DOMAIN (optype);
9008 tree min_val = size_zero_node;
9009 if (type_domain && TYPE_MIN_VALUE (type_domain))
9010 min_val = TYPE_MIN_VALUE (type_domain);
9011 return build4_loc (loc, ARRAY_REF, type, op, min_val,
9012 NULL_TREE, NULL_TREE);
9014 /* *(foo *)&complexfoo => __real__ complexfoo */
9015 else if (TREE_CODE (optype) == COMPLEX_TYPE
9016 && (same_type_ignoring_top_level_qualifiers_p
9017 (type, TREE_TYPE (optype))))
9018 return fold_build1_loc (loc, REALPART_EXPR, type, op);
9019 /* *(foo *)&vectorfoo => BIT_FIELD_REF<vectorfoo,...> */
9020 else if (TREE_CODE (optype) == VECTOR_TYPE
9021 && (same_type_ignoring_top_level_qualifiers_p
9022 (type, TREE_TYPE (optype))))
9024 tree part_width = TYPE_SIZE (type);
9025 tree index = bitsize_int (0);
9026 return fold_build3_loc (loc, BIT_FIELD_REF, type, op, part_width, index);
9028 /* Also handle conversion to an empty base class, which
9029 is represented with a NOP_EXPR. */
9030 else if (is_empty_class (type)
9031 && CLASS_TYPE_P (optype)
9032 && DERIVED_FROM_P (type, optype))
9037 /* *(foo *)&struct_with_foo_field => COMPONENT_REF */
9038 else if (RECORD_OR_UNION_TYPE_P (optype))
9040 tree field = TYPE_FIELDS (optype);
9041 for (; field; field = DECL_CHAIN (field))
9042 if (TREE_CODE (field) == FIELD_DECL
9043 && integer_zerop (byte_position (field))
9044 && (same_type_ignoring_top_level_qualifiers_p
9045 (TREE_TYPE (field), type)))
9047 return fold_build3 (COMPONENT_REF, type, op, field, NULL_TREE);
9052 else if (TREE_CODE (sub) == POINTER_PLUS_EXPR
9053 && TREE_CODE (TREE_OPERAND (sub, 1)) == INTEGER_CST)
9055 tree op00 = TREE_OPERAND (sub, 0);
9056 tree op01 = TREE_OPERAND (sub, 1);
9059 if (TREE_CODE (op00) == ADDR_EXPR)
9062 op00 = TREE_OPERAND (op00, 0);
9063 op00type = TREE_TYPE (op00);
9065 /* ((foo*)&vectorfoo)[1] => BIT_FIELD_REF<vectorfoo,...> */
9066 if (TREE_CODE (op00type) == VECTOR_TYPE
9067 && (same_type_ignoring_top_level_qualifiers_p
9068 (type, TREE_TYPE (op00type))))
9070 HOST_WIDE_INT offset = tree_low_cst (op01, 0);
9071 tree part_width = TYPE_SIZE (type);
9072 unsigned HOST_WIDE_INT part_widthi = tree_low_cst (part_width, 0)/BITS_PER_UNIT;
9073 unsigned HOST_WIDE_INT indexi = offset * BITS_PER_UNIT;
9074 tree index = bitsize_int (indexi);
9076 if (offset/part_widthi <= TYPE_VECTOR_SUBPARTS (op00type))
9077 return fold_build3_loc (loc,
9078 BIT_FIELD_REF, type, op00,
9082 /* ((foo*)&complexfoo)[1] => __imag__ complexfoo */
9083 else if (TREE_CODE (op00type) == COMPLEX_TYPE
9084 && (same_type_ignoring_top_level_qualifiers_p
9085 (type, TREE_TYPE (op00type))))
9087 tree size = TYPE_SIZE_UNIT (type);
9088 if (tree_int_cst_equal (size, op01))
9089 return fold_build1_loc (loc, IMAGPART_EXPR, type, op00);
9091 /* ((foo *)&fooarray)[1] => fooarray[1] */
9092 else if (TREE_CODE (op00type) == ARRAY_TYPE
9093 && (same_type_ignoring_top_level_qualifiers_p
9094 (type, TREE_TYPE (op00type))))
9096 tree type_domain = TYPE_DOMAIN (op00type);
9097 tree min_val = size_zero_node;
9098 if (type_domain && TYPE_MIN_VALUE (type_domain))
9099 min_val = TYPE_MIN_VALUE (type_domain);
9100 op01 = size_binop_loc (loc, EXACT_DIV_EXPR, op01,
9101 TYPE_SIZE_UNIT (type));
9102 op01 = size_binop_loc (loc, PLUS_EXPR, op01, min_val);
9103 return build4_loc (loc, ARRAY_REF, type, op00, op01,
9104 NULL_TREE, NULL_TREE);
9106 /* Also handle conversion to an empty base class, which
9107 is represented with a NOP_EXPR. */
9108 else if (is_empty_class (type)
9109 && CLASS_TYPE_P (op00type)
9110 && DERIVED_FROM_P (type, op00type))
9115 /* ((foo *)&struct_with_foo_field)[1] => COMPONENT_REF */
9116 else if (RECORD_OR_UNION_TYPE_P (op00type))
9118 tree field = TYPE_FIELDS (op00type);
9119 for (; field; field = DECL_CHAIN (field))
9120 if (TREE_CODE (field) == FIELD_DECL
9121 && tree_int_cst_equal (byte_position (field), op01)
9122 && (same_type_ignoring_top_level_qualifiers_p
9123 (TREE_TYPE (field), type)))
9125 return fold_build3 (COMPONENT_REF, type, op00,
9132 /* *(foo *)fooarrptr => (*fooarrptr)[0] */
9133 else if (TREE_CODE (TREE_TYPE (subtype)) == ARRAY_TYPE
9134 && (same_type_ignoring_top_level_qualifiers_p
9135 (type, TREE_TYPE (TREE_TYPE (subtype)))))
9138 tree min_val = size_zero_node;
9139 tree newsub = cxx_fold_indirect_ref (loc, TREE_TYPE (subtype), sub, NULL);
9143 sub = build1_loc (loc, INDIRECT_REF, TREE_TYPE (subtype), sub);
9144 type_domain = TYPE_DOMAIN (TREE_TYPE (sub));
9145 if (type_domain && TYPE_MIN_VALUE (type_domain))
9146 min_val = TYPE_MIN_VALUE (type_domain);
9147 return build4_loc (loc, ARRAY_REF, type, sub, min_val, NULL_TREE,
9155 cxx_eval_indirect_ref (const constexpr_call *call, tree t,
9156 bool allow_non_constant, bool addr,
9157 bool *non_constant_p, bool *overflow_p)
9159 tree orig_op0 = TREE_OPERAND (t, 0);
9160 tree op0 = cxx_eval_constant_expression (call, orig_op0, allow_non_constant,
9161 /*addr*/false, non_constant_p, overflow_p);
9162 bool empty_base = false;
9165 /* Don't VERIFY_CONSTANT here. */
9166 if (*non_constant_p)
9169 r = cxx_fold_indirect_ref (EXPR_LOCATION (t), TREE_TYPE (t), op0,
9173 r = cxx_eval_constant_expression (call, r, allow_non_constant,
9174 addr, non_constant_p, overflow_p);
9179 if (TREE_CODE (sub) == ADDR_EXPR)
9181 /* We couldn't fold to a constant value. Make sure it's not
9182 something we should have been able to fold. */
9183 gcc_assert (!same_type_ignoring_top_level_qualifiers_p
9184 (TREE_TYPE (TREE_TYPE (sub)), TREE_TYPE (t)));
9185 /* DR 1188 says we don't have to deal with this. */
9186 if (!allow_non_constant)
9187 error ("accessing value of %qE through a %qT glvalue in a "
9188 "constant expression", build_fold_indirect_ref (sub),
9190 *non_constant_p = true;
9195 /* If we're pulling out the value of an empty base, make sure
9196 that the whole object is constant and then return an empty
9200 VERIFY_CONSTANT (r);
9201 r = build_constructor (TREE_TYPE (t), NULL);
9202 TREE_CONSTANT (r) = true;
9207 if (addr && op0 != orig_op0)
9208 return build1 (INDIRECT_REF, TREE_TYPE (t), op0);
9210 VERIFY_CONSTANT (t);
9216 /* Complain about R, a VAR_DECL, not being usable in a constant expression.
9217 Shared between potential_constant_expression and
9218 cxx_eval_constant_expression. */
9221 non_const_var_error (tree r)
9223 tree type = TREE_TYPE (r);
9224 error ("the value of %qD is not usable in a constant "
9226 /* Avoid error cascade. */
9227 if (DECL_INITIAL (r) == error_mark_node)
9229 if (DECL_DECLARED_CONSTEXPR_P (r))
9230 inform (DECL_SOURCE_LOCATION (r),
9231 "%qD used in its own initializer", r);
9232 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type))
9234 if (!CP_TYPE_CONST_P (type))
9235 inform (DECL_SOURCE_LOCATION (r),
9236 "%q#D is not const", r);
9237 else if (CP_TYPE_VOLATILE_P (type))
9238 inform (DECL_SOURCE_LOCATION (r),
9239 "%q#D is volatile", r);
9240 else if (!DECL_INITIAL (r)
9241 || !TREE_CONSTANT (DECL_INITIAL (r)))
9242 inform (DECL_SOURCE_LOCATION (r),
9243 "%qD was not initialized with a constant "
9250 if (cxx_dialect >= cxx11 && !DECL_DECLARED_CONSTEXPR_P (r))
9251 inform (DECL_SOURCE_LOCATION (r),
9252 "%qD was not declared %<constexpr%>", r);
9254 inform (DECL_SOURCE_LOCATION (r),
9255 "%qD does not have integral or enumeration type",
9260 /* Subroutine of cxx_eval_constant_expression.
9261 Like cxx_eval_unary_expression, except for trinary expressions. */
9264 cxx_eval_trinary_expression (const constexpr_call *call, tree t,
9265 bool allow_non_constant, bool addr,
9266 bool *non_constant_p, bool *overflow_p)
9272 for (i = 0; i < 3; i++)
9274 args[i] = cxx_eval_constant_expression (call, TREE_OPERAND (t, i),
9275 allow_non_constant, addr,
9276 non_constant_p, overflow_p);
9277 VERIFY_CONSTANT (args[i]);
9280 val = fold_ternary_loc (EXPR_LOCATION (t), TREE_CODE (t), TREE_TYPE (t),
9281 args[0], args[1], args[2]);
9282 if (val == NULL_TREE)
9284 VERIFY_CONSTANT (val);
9288 /* Attempt to reduce the expression T to a constant value.
9289 On failure, issue diagnostic and return error_mark_node. */
9290 /* FIXME unify with c_fully_fold */
9293 cxx_eval_constant_expression (const constexpr_call *call, tree t,
9294 bool allow_non_constant, bool addr,
9295 bool *non_constant_p, bool *overflow_p)
9299 if (t == error_mark_node)
9301 *non_constant_p = true;
9304 if (CONSTANT_CLASS_P (t))
9306 if (TREE_CODE (t) == PTRMEM_CST)
9307 t = cplus_expand_constant (t);
9308 else if (TREE_OVERFLOW (t) && (!flag_permissive || allow_non_constant))
9312 if (TREE_CODE (t) != NOP_EXPR
9313 && reduced_constant_expression_p (t))
9316 switch (TREE_CODE (t))
9321 /* else fall through. */
9323 r = integral_constant_value (t);
9324 if (TREE_CODE (r) == TARGET_EXPR
9325 && TREE_CODE (TARGET_EXPR_INITIAL (r)) == CONSTRUCTOR)
9326 r = TARGET_EXPR_INITIAL (r);
9329 if (!allow_non_constant)
9330 non_const_var_error (r);
9331 *non_constant_p = true;
9341 if (call && DECL_CONTEXT (t) == call->fundef->decl)
9343 if (DECL_ARTIFICIAL (t) && DECL_CONSTRUCTOR_P (DECL_CONTEXT (t)))
9345 if (!allow_non_constant)
9346 sorry ("use of the value of the object being constructed "
9347 "in a constant expression");
9348 *non_constant_p = true;
9351 r = lookup_parameter_binding (call, t);
9354 /* Defer in case this is only used for its type. */;
9357 if (!allow_non_constant)
9358 error ("%qE is not a constant expression", t);
9359 *non_constant_p = true;
9364 case AGGR_INIT_EXPR:
9365 r = cxx_eval_call_expression (call, t, allow_non_constant, addr,
9366 non_constant_p, overflow_p);
9370 if (!literal_type_p (TREE_TYPE (t)))
9372 if (!allow_non_constant)
9374 error ("temporary of non-literal type %qT in a "
9375 "constant expression", TREE_TYPE (t));
9376 explain_non_literal_class (TREE_TYPE (t));
9378 *non_constant_p = true;
9381 /* else fall through. */
9383 /* Pass false for 'addr' because these codes indicate
9384 initialization of a temporary. */
9385 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
9386 allow_non_constant, false,
9387 non_constant_p, overflow_p);
9388 if (!*non_constant_p)
9389 /* Adjust the type of the result to the type of the temporary. */
9390 r = adjust_temp_type (TREE_TYPE (t), r);
9394 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
9395 allow_non_constant, addr,
9396 non_constant_p, overflow_p);
9400 case NON_LVALUE_EXPR:
9401 case TRY_CATCH_EXPR:
9402 case CLEANUP_POINT_EXPR:
9403 case MUST_NOT_THROW_EXPR:
9405 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
9406 allow_non_constant, addr,
9407 non_constant_p, overflow_p);
9410 /* These differ from cxx_eval_unary_expression in that this doesn't
9411 check for a constant operand or result; an address can be
9412 constant without its operand being, and vice versa. */
9414 r = cxx_eval_indirect_ref (call, t, allow_non_constant, addr,
9415 non_constant_p, overflow_p);
9420 tree oldop = TREE_OPERAND (t, 0);
9421 tree op = cxx_eval_constant_expression (call, oldop,
9424 non_constant_p, overflow_p);
9425 /* Don't VERIFY_CONSTANT here. */
9426 if (*non_constant_p)
9428 /* This function does more aggressive folding than fold itself. */
9429 r = build_fold_addr_expr_with_type (op, TREE_TYPE (t));
9430 if (TREE_CODE (r) == ADDR_EXPR && TREE_OPERAND (r, 0) == oldop)
9438 case FIX_TRUNC_EXPR:
9443 case TRUTH_NOT_EXPR:
9444 case FIXED_CONVERT_EXPR:
9445 r = cxx_eval_unary_expression (call, t, allow_non_constant, addr,
9446 non_constant_p, overflow_p);
9450 if (SIZEOF_EXPR_TYPE_P (t))
9451 r = cxx_sizeof_or_alignof_type (TREE_TYPE (TREE_OPERAND (t, 0)),
9452 SIZEOF_EXPR, false);
9453 else if (TYPE_P (TREE_OPERAND (t, 0)))
9454 r = cxx_sizeof_or_alignof_type (TREE_OPERAND (t, 0), SIZEOF_EXPR,
9457 r = cxx_sizeof_or_alignof_expr (TREE_OPERAND (t, 0), SIZEOF_EXPR,
9459 if (r == error_mark_node)
9461 VERIFY_CONSTANT (r);
9466 /* check_return_expr sometimes wraps a TARGET_EXPR in a
9467 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
9468 introduced by build_call_a. */
9469 tree op0 = TREE_OPERAND (t, 0);
9470 tree op1 = TREE_OPERAND (t, 1);
9472 if ((TREE_CODE (op0) == TARGET_EXPR && op1 == TARGET_EXPR_SLOT (op0))
9473 || TREE_CODE (op1) == EMPTY_CLASS_EXPR)
9474 r = cxx_eval_constant_expression (call, op0, allow_non_constant,
9475 addr, non_constant_p, overflow_p);
9478 /* Check that the LHS is constant and then discard it. */
9479 cxx_eval_constant_expression (call, op0, allow_non_constant,
9480 false, non_constant_p, overflow_p);
9481 op1 = TREE_OPERAND (t, 1);
9482 r = cxx_eval_constant_expression (call, op1, allow_non_constant,
9483 addr, non_constant_p, overflow_p);
9488 case POINTER_PLUS_EXPR:
9492 case TRUNC_DIV_EXPR:
9494 case FLOOR_DIV_EXPR:
9495 case ROUND_DIV_EXPR:
9496 case TRUNC_MOD_EXPR:
9498 case ROUND_MOD_EXPR:
9500 case EXACT_DIV_EXPR:
9510 case TRUTH_XOR_EXPR:
9517 case UNORDERED_EXPR:
9527 r = cxx_eval_binary_expression (call, t, allow_non_constant, addr,
9528 non_constant_p, overflow_p);
9531 /* fold can introduce non-IF versions of these; still treat them as
9532 short-circuiting. */
9533 case TRUTH_AND_EXPR:
9534 case TRUTH_ANDIF_EXPR:
9535 r = cxx_eval_logical_expression (call, t, boolean_false_node,
9537 allow_non_constant, addr,
9538 non_constant_p, overflow_p);
9542 case TRUTH_ORIF_EXPR:
9543 r = cxx_eval_logical_expression (call, t, boolean_true_node,
9545 allow_non_constant, addr,
9546 non_constant_p, overflow_p);
9550 r = cxx_eval_array_reference (call, t, allow_non_constant, addr,
9551 non_constant_p, overflow_p);
9555 r = cxx_eval_component_reference (call, t, allow_non_constant, addr,
9556 non_constant_p, overflow_p);
9560 r = cxx_eval_bit_field_ref (call, t, allow_non_constant, addr,
9561 non_constant_p, overflow_p);
9566 r = cxx_eval_conditional_expression (call, t, allow_non_constant, addr,
9567 non_constant_p, overflow_p);
9571 r = cxx_eval_bare_aggregate (call, t, allow_non_constant, addr,
9572 non_constant_p, overflow_p);
9576 /* We can get this in a defaulted constructor for a class with a
9577 non-static data member of array type. Either the initializer will
9578 be NULL, meaning default-initialization, or it will be an lvalue
9579 or xvalue of the same type, meaning direct-initialization from the
9580 corresponding member. */
9581 r = cxx_eval_vec_init (call, t, allow_non_constant, addr,
9582 non_constant_p, overflow_p);
9587 r = cxx_eval_trinary_expression (call, t, allow_non_constant, addr,
9588 non_constant_p, overflow_p);
9592 case VIEW_CONVERT_EXPR:
9595 tree oldop = TREE_OPERAND (t, 0);
9596 tree op = cxx_eval_constant_expression (call, oldop,
9597 allow_non_constant, addr,
9598 non_constant_p, overflow_p);
9599 if (*non_constant_p)
9601 if (POINTER_TYPE_P (TREE_TYPE (t))
9602 && TREE_CODE (op) == INTEGER_CST
9603 && !integer_zerop (op))
9605 if (!allow_non_constant)
9606 error_at (EXPR_LOC_OR_HERE (t),
9607 "reinterpret_cast from integer to pointer");
9608 *non_constant_p = true;
9612 /* We didn't fold at the top so we could check for ptr-int
9615 r = fold_build1 (TREE_CODE (t), TREE_TYPE (t), op);
9616 /* Conversion of an out-of-range value has implementation-defined
9617 behavior; the language considers it different from arithmetic
9618 overflow, which is undefined. */
9619 if (TREE_OVERFLOW_P (r) && !TREE_OVERFLOW_P (op))
9620 TREE_OVERFLOW (r) = false;
9624 case EMPTY_CLASS_EXPR:
9625 /* This is good enough for a function argument that might not get
9626 used, and they can't do anything with it, so just return it. */
9630 case PREINCREMENT_EXPR:
9631 case POSTINCREMENT_EXPR:
9632 case PREDECREMENT_EXPR:
9633 case POSTDECREMENT_EXPR:
9637 case VEC_DELETE_EXPR:
9641 /* GCC internal stuff. */
9644 case WITH_CLEANUP_EXPR:
9645 case STATEMENT_LIST:
9647 case NON_DEPENDENT_EXPR:
9651 if (!allow_non_constant)
9652 error_at (EXPR_LOC_OR_HERE (t),
9653 "expression %qE is not a constant-expression", t);
9654 *non_constant_p = true;
9658 internal_error ("unexpected expression %qE of kind %s", t,
9659 get_tree_code_name (TREE_CODE (t)));
9660 *non_constant_p = true;
9664 if (r == error_mark_node)
9665 *non_constant_p = true;
9667 if (*non_constant_p)
9674 cxx_eval_outermost_constant_expr (tree t, bool allow_non_constant)
9676 bool non_constant_p = false;
9677 bool overflow_p = false;
9678 tree r = cxx_eval_constant_expression (NULL, t, allow_non_constant,
9679 false, &non_constant_p, &overflow_p);
9681 verify_constant (r, allow_non_constant, &non_constant_p, &overflow_p);
9683 if (TREE_CODE (t) != CONSTRUCTOR
9684 && cp_has_mutable_p (TREE_TYPE (t)))
9686 /* We allow a mutable type if the original expression was a
9687 CONSTRUCTOR so that we can do aggregate initialization of
9688 constexpr variables. */
9689 if (!allow_non_constant)
9690 error ("%qT cannot be the type of a complete constant expression "
9691 "because it has mutable sub-objects", TREE_TYPE (t));
9692 non_constant_p = true;
9695 /* Technically we should check this for all subexpressions, but that
9696 runs into problems with our internal representation of pointer
9697 subtraction and the 5.19 rules are still in flux. */
9698 if (CONVERT_EXPR_CODE_P (TREE_CODE (r))
9699 && ARITHMETIC_TYPE_P (TREE_TYPE (r))
9700 && TREE_CODE (TREE_OPERAND (r, 0)) == ADDR_EXPR)
9702 if (!allow_non_constant)
9703 error ("conversion from pointer type %qT "
9704 "to arithmetic type %qT in a constant-expression",
9705 TREE_TYPE (TREE_OPERAND (r, 0)), TREE_TYPE (r));
9706 non_constant_p = true;
9709 if (!non_constant_p && overflow_p)
9710 non_constant_p = true;
9712 if (non_constant_p && !allow_non_constant)
9713 return error_mark_node;
9714 else if (non_constant_p && TREE_CONSTANT (r))
9716 /* This isn't actually constant, so unset TREE_CONSTANT. */
9719 else if (TREE_CODE (r) == CONSTRUCTOR)
9720 r = build1 (VIEW_CONVERT_EXPR, TREE_TYPE (r), r);
9722 r = build_nop (TREE_TYPE (r), r);
9723 TREE_CONSTANT (r) = false;
9725 else if (non_constant_p || r == t)
9728 if (TREE_CODE (r) == CONSTRUCTOR && CLASS_TYPE_P (TREE_TYPE (r)))
9730 if (TREE_CODE (t) == TARGET_EXPR
9731 && TARGET_EXPR_INITIAL (t) == r)
9735 r = get_target_expr (r);
9736 TREE_CONSTANT (r) = true;
9744 /* Returns true if T is a valid subexpression of a constant expression,
9745 even if it isn't itself a constant expression. */
9748 is_sub_constant_expr (tree t)
9750 bool non_constant_p = false;
9751 bool overflow_p = false;
9752 cxx_eval_constant_expression (NULL, t, true, false, &non_constant_p,
9754 return !non_constant_p && !overflow_p;
9757 /* If T represents a constant expression returns its reduced value.
9758 Otherwise return error_mark_node. If T is dependent, then
9762 cxx_constant_value (tree t)
9764 return cxx_eval_outermost_constant_expr (t, false);
9767 /* If T is a constant expression, returns its reduced value.
9768 Otherwise, if T does not have TREE_CONSTANT set, returns T.
9769 Otherwise, returns a version of T without TREE_CONSTANT. */
9772 maybe_constant_value (tree t)
9776 if (instantiation_dependent_expression_p (t)
9777 || type_unknown_p (t)
9778 || BRACE_ENCLOSED_INITIALIZER_P (t)
9779 || !potential_constant_expression (t))
9781 if (TREE_OVERFLOW_P (t))
9783 t = build_nop (TREE_TYPE (t), t);
9784 TREE_CONSTANT (t) = false;
9789 r = cxx_eval_outermost_constant_expr (t, true);
9790 #ifdef ENABLE_CHECKING
9791 /* cp_tree_equal looks through NOPs, so allow them. */
9793 || CONVERT_EXPR_P (t)
9794 || (TREE_CONSTANT (t) && !TREE_CONSTANT (r))
9795 || !cp_tree_equal (r, t));
9800 /* Like maybe_constant_value, but returns a CONSTRUCTOR directly, rather
9801 than wrapped in a TARGET_EXPR. */
9804 maybe_constant_init (tree t)
9806 t = maybe_constant_value (t);
9807 if (TREE_CODE (t) == TARGET_EXPR)
9809 tree init = TARGET_EXPR_INITIAL (t);
9810 if (TREE_CODE (init) == CONSTRUCTOR)
9817 /* FIXME see ADDR_EXPR section in potential_constant_expression_1. */
9818 /* Return true if the object referred to by REF has automatic or thread
9821 enum { ck_ok, ck_bad, ck_unknown };
9823 check_automatic_or_tls (tree ref)
9825 enum machine_mode mode;
9826 HOST_WIDE_INT bitsize, bitpos;
9828 int volatilep = 0, unsignedp = 0;
9829 tree decl = get_inner_reference (ref, &bitsize, &bitpos, &offset,
9830 &mode, &unsignedp, &volatilep, false);
9833 /* If there isn't a decl in the middle, we don't know the linkage here,
9834 and this isn't a constant expression anyway. */
9837 dk = decl_storage_duration (decl);
9838 return (dk == dk_auto || dk == dk_thread) ? ck_bad : ck_ok;
9842 /* Return true if T denotes a potentially constant expression. Issue
9843 diagnostic as appropriate under control of FLAGS. If WANT_RVAL is true,
9844 an lvalue-rvalue conversion is implied.
9846 C++0x [expr.const] used to say
9848 6 An expression is a potential constant expression if it is
9849 a constant expression where all occurrences of function
9850 parameters are replaced by arbitrary constant expressions
9851 of the appropriate type.
9853 2 A conditional expression is a constant expression unless it
9854 involves one of the following as a potentially evaluated
9855 subexpression (3.2), but subexpressions of logical AND (5.14),
9856 logical OR (5.15), and conditional (5.16) operations that are
9857 not evaluated are not considered. */
9860 potential_constant_expression_1 (tree t, bool want_rval, tsubst_flags_t flags)
9862 enum { any = false, rval = true };
9866 if (t == error_mark_node)
9870 if (TREE_THIS_VOLATILE (t))
9872 if (flags & tf_error)
9873 error ("expression %qE has side-effects", t);
9876 if (CONSTANT_CLASS_P (t))
9879 switch (TREE_CODE (t))
9885 case TEMPLATE_ID_EXPR:
9893 case TEMPLATE_PARM_INDEX:
9895 case IDENTIFIER_NODE:
9896 case USERDEF_LITERAL:
9897 /* We can see a FIELD_DECL in a pointer-to-member expression. */
9903 case AGGR_INIT_EXPR:
9905 /* -- an invocation of a function other than a constexpr function
9906 or a constexpr constructor. */
9908 tree fun = get_function_named_in_call (t);
9909 const int nargs = call_expr_nargs (t);
9912 if (is_overloaded_fn (fun))
9914 if (TREE_CODE (fun) == FUNCTION_DECL)
9916 if (builtin_valid_in_constant_expr_p (fun))
9918 if (!DECL_DECLARED_CONSTEXPR_P (fun)
9919 /* Allow any built-in function; if the expansion
9920 isn't constant, we'll deal with that then. */
9921 && !is_builtin_fn (fun))
9923 if (flags & tf_error)
9925 error_at (EXPR_LOC_OR_HERE (t),
9926 "call to non-constexpr function %qD", fun);
9927 explain_invalid_constexpr_fn (fun);
9931 /* A call to a non-static member function takes the address
9932 of the object as the first argument. But in a constant
9933 expression the address will be folded away, so look
9935 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun)
9936 && !DECL_CONSTRUCTOR_P (fun))
9938 tree x = get_nth_callarg (t, 0);
9939 if (is_this_parameter (x))
9941 if (DECL_CONTEXT (x) == NULL_TREE
9942 || DECL_CONSTRUCTOR_P (DECL_CONTEXT (x)))
9944 if (flags & tf_error)
9945 sorry ("calling a member function of the "
9946 "object being constructed in a constant "
9950 /* Otherwise OK. */;
9952 else if (!potential_constant_expression_1 (x, rval, flags))
9959 if (!potential_constant_expression_1 (fun, true, flags))
9961 fun = get_first_fn (fun);
9963 /* Skip initial arguments to base constructors. */
9964 if (DECL_BASE_CONSTRUCTOR_P (fun))
9965 i = num_artificial_parms_for (fun);
9966 fun = DECL_ORIGIN (fun);
9970 if (potential_constant_expression_1 (fun, rval, flags))
9971 /* Might end up being a constant function pointer. */;
9975 for (; i < nargs; ++i)
9977 tree x = get_nth_callarg (t, i);
9978 if (!potential_constant_expression_1 (x, rval, flags))
9984 case NON_LVALUE_EXPR:
9985 /* -- an lvalue-to-rvalue conversion (4.1) unless it is applied to
9986 -- an lvalue of integral type that refers to a non-volatile
9987 const variable or static data member initialized with
9988 constant expressions, or
9990 -- an lvalue of literal type that refers to non-volatile
9991 object defined with constexpr, or that refers to a
9992 sub-object of such an object; */
9993 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval, flags);
9996 if (want_rval && !decl_constant_var_p (t)
9997 && !dependent_type_p (TREE_TYPE (t)))
9999 if (flags & tf_error)
10000 non_const_var_error (t);
10007 case VIEW_CONVERT_EXPR:
10008 /* -- a reinterpret_cast. FIXME not implemented, and this rule
10009 may change to something more specific to type-punning (DR 1312). */
10011 tree from = TREE_OPERAND (t, 0);
10012 if (POINTER_TYPE_P (TREE_TYPE (t))
10013 && TREE_CODE (from) == INTEGER_CST
10014 && !integer_zerop (from))
10016 if (flags & tf_error)
10017 error_at (EXPR_LOC_OR_HERE (t),
10018 "reinterpret_cast from integer to pointer");
10021 return (potential_constant_expression_1
10022 (from, TREE_CODE (t) != VIEW_CONVERT_EXPR, flags));
10026 /* -- a unary operator & that is applied to an lvalue that
10027 designates an object with thread or automatic storage
10029 t = TREE_OPERAND (t, 0);
10031 /* FIXME adjust when issue 1197 is fully resolved. For now don't do
10032 any checking here, as we might dereference the pointer later. If
10033 we remove this code, also remove check_automatic_or_tls. */
10034 i = check_automatic_or_tls (t);
10039 if (flags & tf_error)
10040 error ("address-of an object %qE with thread local or "
10041 "automatic storage is not a constant expression", t);
10045 return potential_constant_expression_1 (t, any, flags);
10047 case COMPONENT_REF:
10048 case BIT_FIELD_REF:
10051 /* -- a class member access unless its postfix-expression is
10052 of literal type or of pointer to literal type. */
10053 /* This test would be redundant, as it follows from the
10054 postfix-expression being a potential constant expression. */
10055 return potential_constant_expression_1 (TREE_OPERAND (t, 0),
10058 case EXPR_PACK_EXPANSION:
10059 return potential_constant_expression_1 (PACK_EXPANSION_PATTERN (t),
10064 tree x = TREE_OPERAND (t, 0);
10066 if (is_this_parameter (x))
10068 if (DECL_CONTEXT (x)
10069 && !DECL_DECLARED_CONSTEXPR_P (DECL_CONTEXT (x)))
10071 if (flags & tf_error)
10072 error ("use of %<this%> in a constant expression");
10075 if (want_rval && DECL_CONTEXT (x)
10076 && DECL_CONSTRUCTOR_P (DECL_CONTEXT (x)))
10078 if (flags & tf_error)
10079 sorry ("use of the value of the object being constructed "
10080 "in a constant expression");
10085 return potential_constant_expression_1 (x, rval, flags);
10089 case DYNAMIC_CAST_EXPR:
10090 case PSEUDO_DTOR_EXPR:
10091 case PREINCREMENT_EXPR:
10092 case POSTINCREMENT_EXPR:
10093 case PREDECREMENT_EXPR:
10094 case POSTDECREMENT_EXPR:
10098 case VEC_DELETE_EXPR:
10103 case OMP_ATOMIC_READ:
10104 case OMP_ATOMIC_CAPTURE_OLD:
10105 case OMP_ATOMIC_CAPTURE_NEW:
10106 /* GCC internal stuff. */
10109 case WITH_CLEANUP_EXPR:
10110 case CLEANUP_POINT_EXPR:
10111 case MUST_NOT_THROW_EXPR:
10112 case TRY_CATCH_EXPR:
10113 case STATEMENT_LIST:
10114 /* Don't bother trying to define a subset of statement-expressions to
10115 be constant-expressions, at least for now. */
10119 case TRANSACTION_EXPR:
10124 if (flags & tf_error)
10125 error ("expression %qE is not a constant-expression", t);
10129 /* -- a typeid expression whose operand is of polymorphic
10132 tree e = TREE_OPERAND (t, 0);
10133 if (!TYPE_P (e) && !type_dependent_expression_p (e)
10134 && TYPE_POLYMORPHIC_P (TREE_TYPE (e)))
10136 if (flags & tf_error)
10137 error ("typeid-expression is not a constant expression "
10138 "because %qE is of polymorphic type", e);
10145 /* -- a subtraction where both operands are pointers. */
10146 if (TYPE_PTR_P (TREE_OPERAND (t, 0))
10147 && TYPE_PTR_P (TREE_OPERAND (t, 1)))
10149 if (flags & tf_error)
10150 error ("difference of two pointer expressions is not "
10151 "a constant expression");
10163 /* -- a relational or equality operator where at least
10164 one of the operands is a pointer. */
10165 if (TYPE_PTR_P (TREE_OPERAND (t, 0))
10166 || TYPE_PTR_P (TREE_OPERAND (t, 1)))
10168 if (flags & tf_error)
10169 error ("pointer comparison expression is not a "
10170 "constant expression");
10177 /* A destructor. */
10178 if (TYPE_P (TREE_OPERAND (t, 0)))
10180 /* else fall through. */
10182 case REALPART_EXPR:
10183 case IMAGPART_EXPR:
10186 case FIX_TRUNC_EXPR:
10190 case TRUTH_NOT_EXPR:
10191 case FIXED_CONVERT_EXPR:
10192 case UNARY_PLUS_EXPR:
10193 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval,
10197 case CONST_CAST_EXPR:
10198 case STATIC_CAST_EXPR:
10199 case REINTERPRET_CAST_EXPR:
10200 case IMPLICIT_CONV_EXPR:
10201 if (cxx_dialect < cxx11
10202 && !dependent_type_p (TREE_TYPE (t))
10203 && !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (t)))
10204 /* In C++98, a conversion to non-integral type can't be part of a
10205 constant expression. */
10207 if (flags & tf_error)
10208 error ("cast to non-integral type %qT in a constant expression",
10213 return (potential_constant_expression_1
10214 (TREE_OPERAND (t, 0),
10215 TREE_CODE (TREE_TYPE (t)) != REFERENCE_TYPE, flags));
10218 case NON_DEPENDENT_EXPR:
10219 /* For convenience. */
10221 return potential_constant_expression_1 (TREE_OPERAND (t, 0),
10225 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
10229 if (!literal_type_p (TREE_TYPE (t)))
10231 if (flags & tf_error)
10233 error ("temporary of non-literal type %qT in a "
10234 "constant expression", TREE_TYPE (t));
10235 explain_non_literal_class (TREE_TYPE (t));
10240 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
10245 vec<constructor_elt, va_gc> *v = CONSTRUCTOR_ELTS (t);
10246 constructor_elt *ce;
10247 for (i = 0; vec_safe_iterate (v, i, &ce); ++i)
10248 if (!potential_constant_expression_1 (ce->value, want_rval, flags))
10255 gcc_assert (TREE_PURPOSE (t) == NULL_TREE
10256 || DECL_P (TREE_PURPOSE (t)));
10257 if (!potential_constant_expression_1 (TREE_VALUE (t), want_rval,
10260 if (TREE_CHAIN (t) == NULL_TREE)
10262 return potential_constant_expression_1 (TREE_CHAIN (t), want_rval,
10266 case TRUNC_DIV_EXPR:
10267 case CEIL_DIV_EXPR:
10268 case FLOOR_DIV_EXPR:
10269 case ROUND_DIV_EXPR:
10270 case TRUNC_MOD_EXPR:
10271 case CEIL_MOD_EXPR:
10272 case ROUND_MOD_EXPR:
10274 tree denom = TREE_OPERAND (t, 1);
10275 if (!potential_constant_expression_1 (denom, rval, flags))
10277 /* We can't call cxx_eval_outermost_constant_expr on an expression
10278 that hasn't been through fold_non_dependent_expr yet. */
10279 if (!processing_template_decl)
10280 denom = cxx_eval_outermost_constant_expr (denom, true);
10281 if (integer_zerop (denom))
10283 if (flags & tf_error)
10284 error ("division by zero is not a constant-expression");
10290 return potential_constant_expression_1 (TREE_OPERAND (t, 0),
10295 case COMPOUND_EXPR:
10297 /* check_return_expr sometimes wraps a TARGET_EXPR in a
10298 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
10299 introduced by build_call_a. */
10300 tree op0 = TREE_OPERAND (t, 0);
10301 tree op1 = TREE_OPERAND (t, 1);
10303 if ((TREE_CODE (op0) == TARGET_EXPR && op1 == TARGET_EXPR_SLOT (op0))
10304 || TREE_CODE (op1) == EMPTY_CLASS_EXPR)
10305 return potential_constant_expression_1 (op0, want_rval, flags);
10310 /* If the first operand is the non-short-circuit constant, look at
10311 the second operand; otherwise we only care about the first one for
10313 case TRUTH_AND_EXPR:
10314 case TRUTH_ANDIF_EXPR:
10315 tmp = boolean_true_node;
10317 case TRUTH_OR_EXPR:
10318 case TRUTH_ORIF_EXPR:
10319 tmp = boolean_false_node;
10322 tree op = TREE_OPERAND (t, 0);
10323 if (!potential_constant_expression_1 (op, rval, flags))
10325 if (!processing_template_decl)
10326 op = cxx_eval_outermost_constant_expr (op, true);
10327 if (tree_int_cst_equal (op, tmp))
10328 return potential_constant_expression_1 (TREE_OPERAND (t, 1), rval, flags);
10335 case POINTER_PLUS_EXPR:
10337 case EXACT_DIV_EXPR:
10347 case TRUTH_XOR_EXPR:
10348 case UNORDERED_EXPR:
10359 /* Fall through. */
10361 case ARRAY_RANGE_REF:
10365 for (i = 0; i < 2; ++i)
10366 if (!potential_constant_expression_1 (TREE_OPERAND (t, i),
10371 case ARRAY_NOTATION_REF:
10375 case VEC_PERM_EXPR:
10376 for (i = 0; i < 3; ++i)
10377 if (!potential_constant_expression_1 (TREE_OPERAND (t, i),
10383 case VEC_COND_EXPR:
10384 /* If the condition is a known constant, we know which of the legs we
10385 care about; otherwise we only require that the condition and
10386 either of the legs be potentially constant. */
10387 tmp = TREE_OPERAND (t, 0);
10388 if (!potential_constant_expression_1 (tmp, rval, flags))
10390 if (!processing_template_decl)
10391 tmp = cxx_eval_outermost_constant_expr (tmp, true);
10392 if (integer_zerop (tmp))
10393 return potential_constant_expression_1 (TREE_OPERAND (t, 2),
10395 else if (TREE_CODE (tmp) == INTEGER_CST)
10396 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
10398 for (i = 1; i < 3; ++i)
10399 if (potential_constant_expression_1 (TREE_OPERAND (t, i),
10400 want_rval, tf_none))
10402 if (flags & tf_error)
10403 error ("expression %qE is not a constant-expression", t);
10406 case VEC_INIT_EXPR:
10407 if (VEC_INIT_EXPR_IS_CONSTEXPR (t))
10409 if (flags & tf_error)
10411 error ("non-constant array initialization");
10412 diagnose_non_constexpr_vec_init (t);
10417 if (objc_is_property_ref (t))
10420 sorry ("unexpected AST of kind %s", get_tree_code_name (TREE_CODE (t)));
10426 /* The main entry point to the above. */
10429 potential_constant_expression (tree t)
10431 return potential_constant_expression_1 (t, false, tf_none);
10434 /* As above, but require a constant rvalue. */
10437 potential_rvalue_constant_expression (tree t)
10439 return potential_constant_expression_1 (t, true, tf_none);
10442 /* Like above, but complain about non-constant expressions. */
10445 require_potential_constant_expression (tree t)
10447 return potential_constant_expression_1 (t, false, tf_warning_or_error);
10450 /* Cross product of the above. */
10453 require_potential_rvalue_constant_expression (tree t)
10455 return potential_constant_expression_1 (t, true, tf_warning_or_error);
10458 /* Insert the deduced return type for an auto function. */
10461 apply_deduced_return_type (tree fco, tree return_type)
10465 if (return_type == error_mark_node)
10468 if (LAMBDA_FUNCTION_P (fco))
10470 tree lambda = CLASSTYPE_LAMBDA_EXPR (current_class_type);
10471 LAMBDA_EXPR_RETURN_TYPE (lambda) = return_type;
10474 if (DECL_CONV_FN_P (fco))
10475 DECL_NAME (fco) = mangle_conv_op_name_for_type (return_type);
10477 TREE_TYPE (fco) = change_return_type (return_type, TREE_TYPE (fco));
10479 result = DECL_RESULT (fco);
10480 if (result == NULL_TREE)
10482 if (TREE_TYPE (result) == return_type)
10485 /* We already have a DECL_RESULT from start_preparsed_function.
10486 Now we need to redo the work it and allocate_struct_function
10487 did to reflect the new type. */
10488 gcc_assert (current_function_decl == fco);
10489 result = build_decl (input_location, RESULT_DECL, NULL_TREE,
10490 TYPE_MAIN_VARIANT (return_type));
10491 DECL_ARTIFICIAL (result) = 1;
10492 DECL_IGNORED_P (result) = 1;
10493 cp_apply_type_quals_to_decl (cp_type_quals (return_type),
10496 DECL_RESULT (fco) = result;
10498 if (!processing_template_decl)
10500 bool aggr = aggregate_value_p (result, fco);
10501 #ifdef PCC_STATIC_STRUCT_RETURN
10502 cfun->returns_pcc_struct = aggr;
10504 cfun->returns_struct = aggr;
10509 /* DECL is a local variable or parameter from the surrounding scope of a
10510 lambda-expression. Returns the decltype for a use of the capture field
10511 for DECL even if it hasn't been captured yet. */
10514 capture_decltype (tree decl)
10516 tree lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
10517 /* FIXME do lookup instead of list walk? */
10518 tree cap = value_member (decl, LAMBDA_EXPR_CAPTURE_LIST (lam));
10522 type = TREE_TYPE (TREE_PURPOSE (cap));
10524 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam))
10527 error ("%qD is not captured", decl);
10528 return error_mark_node;
10531 type = TREE_TYPE (decl);
10532 if (TREE_CODE (type) == REFERENCE_TYPE
10533 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
10534 type = TREE_TYPE (type);
10537 case CPLD_REFERENCE:
10538 type = TREE_TYPE (decl);
10539 if (TREE_CODE (type) != REFERENCE_TYPE)
10540 type = build_reference_type (TREE_TYPE (decl));
10544 gcc_unreachable ();
10547 if (TREE_CODE (type) != REFERENCE_TYPE)
10549 if (!LAMBDA_EXPR_MUTABLE_P (lam))
10550 type = cp_build_qualified_type (type, (cp_type_quals (type)
10551 |TYPE_QUAL_CONST));
10552 type = build_reference_type (type);
10557 #include "gt-cp-semantics.h"