1 /* Perform the semantic phase of parsing, i.e., the process of
2 building tree structure, checking semantic consistency, and
3 building RTL. These routines are used both during actual parsing
4 and during the instantiation of template functions.
6 Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007,
7 2008, 2009, 2010, 2011 Free Software Foundation, Inc.
8 Written by Mark Mitchell (mmitchell@usa.net) based on code found
9 formerly in parse.y and pt.c.
11 This file is part of GCC.
13 GCC is free software; you can redistribute it and/or modify it
14 under the terms of the GNU General Public License as published by
15 the Free Software Foundation; either version 3, or (at your option)
18 GCC is distributed in the hope that it will be useful, but
19 WITHOUT ANY WARRANTY; without even the implied warranty of
20 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
21 General Public License for more details.
23 You should have received a copy of the GNU General Public License
24 along with GCC; see the file COPYING3. If not see
25 <http://www.gnu.org/licenses/>. */
29 #include "coretypes.h"
33 #include "c-family/c-common.h"
34 #include "c-family/c-objc.h"
35 #include "tree-inline.h"
36 #include "tree-mudflap.h"
41 #include "diagnostic.h"
43 #include "tree-iterator.h"
49 /* There routines provide a modular interface to perform many parsing
50 operations. They may therefore be used during actual parsing, or
51 during template instantiation, which may be regarded as a
52 degenerate form of parsing. */
54 static tree maybe_convert_cond (tree);
55 static tree finalize_nrv_r (tree *, int *, void *);
56 static tree capture_decltype (tree);
57 static tree thisify_lambda_field (tree);
60 /* Deferred Access Checking Overview
61 ---------------------------------
63 Most C++ expressions and declarations require access checking
64 to be performed during parsing. However, in several cases,
65 this has to be treated differently.
67 For member declarations, access checking has to be deferred
68 until more information about the declaration is known. For
80 When we are parsing the function return type `A::X', we don't
81 really know if this is allowed until we parse the function name.
83 Furthermore, some contexts require that access checking is
84 never performed at all. These include class heads, and template
87 Typical use of access checking functions is described here:
89 1. When we enter a context that requires certain access checking
90 mode, the function `push_deferring_access_checks' is called with
91 DEFERRING argument specifying the desired mode. Access checking
92 may be performed immediately (dk_no_deferred), deferred
93 (dk_deferred), or not performed (dk_no_check).
95 2. When a declaration such as a type, or a variable, is encountered,
96 the function `perform_or_defer_access_check' is called. It
97 maintains a VEC of all deferred checks.
99 3. The global `current_class_type' or `current_function_decl' is then
100 setup by the parser. `enforce_access' relies on these information
103 4. Upon exiting the context mentioned in step 1,
104 `perform_deferred_access_checks' is called to check all declaration
105 stored in the VEC. `pop_deferring_access_checks' is then
106 called to restore the previous access checking mode.
108 In case of parsing error, we simply call `pop_deferring_access_checks'
109 without `perform_deferred_access_checks'. */
111 typedef struct GTY(()) deferred_access {
112 /* A VEC representing name-lookups for which we have deferred
113 checking access controls. We cannot check the accessibility of
114 names used in a decl-specifier-seq until we know what is being
115 declared because code like:
122 A::B* A::f() { return 0; }
124 is valid, even though `A::B' is not generally accessible. */
125 VEC (deferred_access_check,gc)* GTY(()) deferred_access_checks;
127 /* The current mode of access checks. */
128 enum deferring_kind deferring_access_checks_kind;
131 DEF_VEC_O (deferred_access);
132 DEF_VEC_ALLOC_O (deferred_access,gc);
134 /* Data for deferred access checking. */
135 static GTY(()) VEC(deferred_access,gc) *deferred_access_stack;
136 static GTY(()) unsigned deferred_access_no_check;
138 /* Save the current deferred access states and start deferred
139 access checking iff DEFER_P is true. */
142 push_deferring_access_checks (deferring_kind deferring)
144 /* For context like template instantiation, access checking
145 disabling applies to all nested context. */
146 if (deferred_access_no_check || deferring == dk_no_check)
147 deferred_access_no_check++;
150 deferred_access *ptr;
152 ptr = VEC_safe_push (deferred_access, gc, deferred_access_stack, NULL);
153 ptr->deferred_access_checks = NULL;
154 ptr->deferring_access_checks_kind = deferring;
158 /* Resume deferring access checks again after we stopped doing
162 resume_deferring_access_checks (void)
164 if (!deferred_access_no_check)
165 VEC_last (deferred_access, deferred_access_stack)
166 ->deferring_access_checks_kind = dk_deferred;
169 /* Stop deferring access checks. */
172 stop_deferring_access_checks (void)
174 if (!deferred_access_no_check)
175 VEC_last (deferred_access, deferred_access_stack)
176 ->deferring_access_checks_kind = dk_no_deferred;
179 /* Discard the current deferred access checks and restore the
183 pop_deferring_access_checks (void)
185 if (deferred_access_no_check)
186 deferred_access_no_check--;
188 VEC_pop (deferred_access, deferred_access_stack);
191 /* Returns a TREE_LIST representing the deferred checks.
192 The TREE_PURPOSE of each node is the type through which the
193 access occurred; the TREE_VALUE is the declaration named.
196 VEC (deferred_access_check,gc)*
197 get_deferred_access_checks (void)
199 if (deferred_access_no_check)
202 return (VEC_last (deferred_access, deferred_access_stack)
203 ->deferred_access_checks);
206 /* Take current deferred checks and combine with the
207 previous states if we also defer checks previously.
208 Otherwise perform checks now. */
211 pop_to_parent_deferring_access_checks (void)
213 if (deferred_access_no_check)
214 deferred_access_no_check--;
217 VEC (deferred_access_check,gc) *checks;
218 deferred_access *ptr;
220 checks = (VEC_last (deferred_access, deferred_access_stack)
221 ->deferred_access_checks);
223 VEC_pop (deferred_access, deferred_access_stack);
224 ptr = VEC_last (deferred_access, deferred_access_stack);
225 if (ptr->deferring_access_checks_kind == dk_no_deferred)
228 perform_access_checks (checks);
232 /* Merge with parent. */
234 deferred_access_check *chk, *probe;
236 FOR_EACH_VEC_ELT (deferred_access_check, checks, i, chk)
238 FOR_EACH_VEC_ELT (deferred_access_check,
239 ptr->deferred_access_checks, j, probe)
241 if (probe->binfo == chk->binfo &&
242 probe->decl == chk->decl &&
243 probe->diag_decl == chk->diag_decl)
246 /* Insert into parent's checks. */
247 VEC_safe_push (deferred_access_check, gc,
248 ptr->deferred_access_checks, chk);
255 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
256 is the BINFO indicating the qualifying scope used to access the
257 DECL node stored in the TREE_VALUE of the node. */
260 perform_access_checks (VEC (deferred_access_check,gc)* checks)
263 deferred_access_check *chk;
268 FOR_EACH_VEC_ELT (deferred_access_check, checks, i, chk)
269 enforce_access (chk->binfo, chk->decl, chk->diag_decl);
272 /* Perform the deferred access checks.
274 After performing the checks, we still have to keep the list
275 `deferred_access_stack->deferred_access_checks' since we may want
276 to check access for them again later in a different context.
283 A::X A::a, x; // No error for `A::a', error for `x'
285 We have to perform deferred access of `A::X', first with `A::a',
289 perform_deferred_access_checks (void)
291 perform_access_checks (get_deferred_access_checks ());
294 /* Defer checking the accessibility of DECL, when looked up in
295 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */
298 perform_or_defer_access_check (tree binfo, tree decl, tree diag_decl)
301 deferred_access *ptr;
302 deferred_access_check *chk;
303 deferred_access_check *new_access;
306 /* Exit if we are in a context that no access checking is performed.
308 if (deferred_access_no_check)
311 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
313 ptr = VEC_last (deferred_access, deferred_access_stack);
315 /* If we are not supposed to defer access checks, just check now. */
316 if (ptr->deferring_access_checks_kind == dk_no_deferred)
318 enforce_access (binfo, decl, diag_decl);
322 /* See if we are already going to perform this check. */
323 FOR_EACH_VEC_ELT (deferred_access_check,
324 ptr->deferred_access_checks, i, chk)
326 if (chk->decl == decl && chk->binfo == binfo &&
327 chk->diag_decl == diag_decl)
332 /* If not, record the check. */
334 VEC_safe_push (deferred_access_check, gc,
335 ptr->deferred_access_checks, 0);
336 new_access->binfo = binfo;
337 new_access->decl = decl;
338 new_access->diag_decl = diag_decl;
341 /* Used by build_over_call in LOOKUP_SPECULATIVE mode: return whether DECL
342 is accessible in BINFO, and possibly complain if not. If we're not
343 checking access, everything is accessible. */
346 speculative_access_check (tree binfo, tree decl, tree diag_decl,
349 if (deferred_access_no_check)
352 /* If we're checking for implicit delete, we don't want access
354 if (!accessible_p (binfo, decl, true))
356 /* Unless we're under maybe_explain_implicit_delete. */
358 enforce_access (binfo, decl, diag_decl);
365 /* Returns nonzero if the current statement is a full expression,
366 i.e. temporaries created during that statement should be destroyed
367 at the end of the statement. */
370 stmts_are_full_exprs_p (void)
372 return current_stmt_tree ()->stmts_are_full_exprs_p;
375 /* T is a statement. Add it to the statement-tree. This is the C++
376 version. The C/ObjC frontends have a slightly different version of
382 enum tree_code code = TREE_CODE (t);
384 if (EXPR_P (t) && code != LABEL_EXPR)
386 if (!EXPR_HAS_LOCATION (t))
387 SET_EXPR_LOCATION (t, input_location);
389 /* When we expand a statement-tree, we must know whether or not the
390 statements are full-expressions. We record that fact here. */
391 STMT_IS_FULL_EXPR_P (t) = stmts_are_full_exprs_p ();
394 /* Add T to the statement-tree. Non-side-effect statements need to be
395 recorded during statement expressions. */
396 append_to_statement_list_force (t, &cur_stmt_list);
401 /* Returns the stmt_tree to which statements are currently being added. */
404 current_stmt_tree (void)
407 ? &cfun->language->base.x_stmt_tree
408 : &scope_chain->x_stmt_tree);
411 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
414 maybe_cleanup_point_expr (tree expr)
416 if (!processing_template_decl && stmts_are_full_exprs_p ())
417 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
421 /* Like maybe_cleanup_point_expr except have the type of the new expression be
422 void so we don't need to create a temporary variable to hold the inner
423 expression. The reason why we do this is because the original type might be
424 an aggregate and we cannot create a temporary variable for that type. */
427 maybe_cleanup_point_expr_void (tree expr)
429 if (!processing_template_decl && stmts_are_full_exprs_p ())
430 expr = fold_build_cleanup_point_expr (void_type_node, expr);
436 /* Create a declaration statement for the declaration given by the DECL. */
439 add_decl_expr (tree decl)
441 tree r = build_stmt (input_location, DECL_EXPR, decl);
442 if (DECL_INITIAL (decl)
443 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
444 r = maybe_cleanup_point_expr_void (r);
448 /* Finish a scope. */
451 do_poplevel (tree stmt_list)
455 if (stmts_are_full_exprs_p ())
456 block = poplevel (kept_level_p (), 1, 0);
458 stmt_list = pop_stmt_list (stmt_list);
460 if (!processing_template_decl)
462 stmt_list = c_build_bind_expr (input_location, block, stmt_list);
463 /* ??? See c_end_compound_stmt re statement expressions. */
469 /* Begin a new scope. */
472 do_pushlevel (scope_kind sk)
474 tree ret = push_stmt_list ();
475 if (stmts_are_full_exprs_p ())
476 begin_scope (sk, NULL);
480 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
481 when the current scope is exited. EH_ONLY is true when this is not
482 meant to apply to normal control flow transfer. */
485 push_cleanup (tree decl, tree cleanup, bool eh_only)
487 tree stmt = build_stmt (input_location, CLEANUP_STMT, NULL, cleanup, decl);
488 CLEANUP_EH_ONLY (stmt) = eh_only;
490 CLEANUP_BODY (stmt) = push_stmt_list ();
493 /* Begin a conditional that might contain a declaration. When generating
494 normal code, we want the declaration to appear before the statement
495 containing the conditional. When generating template code, we want the
496 conditional to be rendered as the raw DECL_EXPR. */
499 begin_cond (tree *cond_p)
501 if (processing_template_decl)
502 *cond_p = push_stmt_list ();
505 /* Finish such a conditional. */
508 finish_cond (tree *cond_p, tree expr)
510 if (processing_template_decl)
512 tree cond = pop_stmt_list (*cond_p);
513 if (TREE_CODE (cond) == DECL_EXPR)
516 if (check_for_bare_parameter_packs (expr))
517 *cond_p = error_mark_node;
522 /* If *COND_P specifies a conditional with a declaration, transform the
525 for (; A x = 42;) { }
527 while (true) { A x = 42; if (!x) break; }
528 for (;;) { A x = 42; if (!x) break; }
529 The statement list for BODY will be empty if the conditional did
530 not declare anything. */
533 simplify_loop_decl_cond (tree *cond_p, tree body)
537 if (!TREE_SIDE_EFFECTS (body))
541 *cond_p = boolean_true_node;
543 if_stmt = begin_if_stmt ();
544 cond = cp_build_unary_op (TRUTH_NOT_EXPR, cond, 0, tf_warning_or_error);
545 finish_if_stmt_cond (cond, if_stmt);
546 finish_break_stmt ();
547 finish_then_clause (if_stmt);
548 finish_if_stmt (if_stmt);
551 /* Finish a goto-statement. */
554 finish_goto_stmt (tree destination)
556 if (TREE_CODE (destination) == IDENTIFIER_NODE)
557 destination = lookup_label (destination);
559 /* We warn about unused labels with -Wunused. That means we have to
560 mark the used labels as used. */
561 if (TREE_CODE (destination) == LABEL_DECL)
562 TREE_USED (destination) = 1;
565 destination = mark_rvalue_use (destination);
566 if (!processing_template_decl)
568 destination = cp_convert (ptr_type_node, destination);
569 if (error_operand_p (destination))
572 /* We don't inline calls to functions with computed gotos.
573 Those functions are typically up to some funny business,
574 and may be depending on the labels being at particular
575 addresses, or some such. */
576 DECL_UNINLINABLE (current_function_decl) = 1;
579 check_goto (destination);
581 return add_stmt (build_stmt (input_location, GOTO_EXPR, destination));
584 /* COND is the condition-expression for an if, while, etc.,
585 statement. Convert it to a boolean value, if appropriate.
586 In addition, verify sequence points if -Wsequence-point is enabled. */
589 maybe_convert_cond (tree cond)
591 /* Empty conditions remain empty. */
595 /* Wait until we instantiate templates before doing conversion. */
596 if (processing_template_decl)
599 if (warn_sequence_point)
600 verify_sequence_points (cond);
602 /* Do the conversion. */
603 cond = convert_from_reference (cond);
605 if (TREE_CODE (cond) == MODIFY_EXPR
606 && !TREE_NO_WARNING (cond)
609 warning (OPT_Wparentheses,
610 "suggest parentheses around assignment used as truth value");
611 TREE_NO_WARNING (cond) = 1;
614 return condition_conversion (cond);
617 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
620 finish_expr_stmt (tree expr)
624 if (expr != NULL_TREE)
626 if (!processing_template_decl)
628 if (warn_sequence_point)
629 verify_sequence_points (expr);
630 expr = convert_to_void (expr, ICV_STATEMENT, tf_warning_or_error);
632 else if (!type_dependent_expression_p (expr))
633 convert_to_void (build_non_dependent_expr (expr), ICV_STATEMENT,
634 tf_warning_or_error);
636 if (check_for_bare_parameter_packs (expr))
637 expr = error_mark_node;
639 /* Simplification of inner statement expressions, compound exprs,
640 etc can result in us already having an EXPR_STMT. */
641 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
643 if (TREE_CODE (expr) != EXPR_STMT)
644 expr = build_stmt (input_location, EXPR_STMT, expr);
645 expr = maybe_cleanup_point_expr_void (expr);
657 /* Begin an if-statement. Returns a newly created IF_STMT if
664 scope = do_pushlevel (sk_block);
665 r = build_stmt (input_location, IF_STMT, NULL_TREE,
666 NULL_TREE, NULL_TREE, scope);
667 begin_cond (&IF_COND (r));
671 /* Process the COND of an if-statement, which may be given by
675 finish_if_stmt_cond (tree cond, tree if_stmt)
677 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
679 THEN_CLAUSE (if_stmt) = push_stmt_list ();
682 /* Finish the then-clause of an if-statement, which may be given by
686 finish_then_clause (tree if_stmt)
688 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
692 /* Begin the else-clause of an if-statement. */
695 begin_else_clause (tree if_stmt)
697 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
700 /* Finish the else-clause of an if-statement, which may be given by
704 finish_else_clause (tree if_stmt)
706 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
709 /* Finish an if-statement. */
712 finish_if_stmt (tree if_stmt)
714 tree scope = IF_SCOPE (if_stmt);
715 IF_SCOPE (if_stmt) = NULL;
716 add_stmt (do_poplevel (scope));
720 /* Begin a while-statement. Returns a newly created WHILE_STMT if
724 begin_while_stmt (void)
727 r = build_stmt (input_location, WHILE_STMT, NULL_TREE, NULL_TREE);
729 WHILE_BODY (r) = do_pushlevel (sk_block);
730 begin_cond (&WHILE_COND (r));
734 /* Process the COND of a while-statement, which may be given by
738 finish_while_stmt_cond (tree cond, tree while_stmt)
740 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
741 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
744 /* Finish a while-statement, which may be given by WHILE_STMT. */
747 finish_while_stmt (tree while_stmt)
749 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
753 /* Begin a do-statement. Returns a newly created DO_STMT if
759 tree r = build_stmt (input_location, DO_STMT, NULL_TREE, NULL_TREE);
761 DO_BODY (r) = push_stmt_list ();
765 /* Finish the body of a do-statement, which may be given by DO_STMT. */
768 finish_do_body (tree do_stmt)
770 tree body = DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
772 if (TREE_CODE (body) == STATEMENT_LIST && STATEMENT_LIST_TAIL (body))
773 body = STATEMENT_LIST_TAIL (body)->stmt;
775 if (IS_EMPTY_STMT (body))
776 warning (OPT_Wempty_body,
777 "suggest explicit braces around empty body in %<do%> statement");
780 /* Finish a do-statement, which may be given by DO_STMT, and whose
781 COND is as indicated. */
784 finish_do_stmt (tree cond, tree do_stmt)
786 cond = maybe_convert_cond (cond);
787 DO_COND (do_stmt) = cond;
791 /* Finish a return-statement. The EXPRESSION returned, if any, is as
795 finish_return_stmt (tree expr)
800 expr = check_return_expr (expr, &no_warning);
802 if (flag_openmp && !check_omp_return ())
803 return error_mark_node;
804 if (!processing_template_decl)
806 if (warn_sequence_point)
807 verify_sequence_points (expr);
809 if (DECL_DESTRUCTOR_P (current_function_decl)
810 || (DECL_CONSTRUCTOR_P (current_function_decl)
811 && targetm.cxx.cdtor_returns_this ()))
813 /* Similarly, all destructors must run destructors for
814 base-classes before returning. So, all returns in a
815 destructor get sent to the DTOR_LABEL; finish_function emits
816 code to return a value there. */
817 return finish_goto_stmt (cdtor_label);
821 r = build_stmt (input_location, RETURN_EXPR, expr);
822 TREE_NO_WARNING (r) |= no_warning;
823 r = maybe_cleanup_point_expr_void (r);
830 /* Begin the scope of a for-statement or a range-for-statement.
831 Both the returned trees are to be used in a call to
832 begin_for_stmt or begin_range_for_stmt. */
835 begin_for_scope (tree *init)
837 tree scope = NULL_TREE;
838 if (flag_new_for_scope > 0)
839 scope = do_pushlevel (sk_for);
841 if (processing_template_decl)
842 *init = push_stmt_list ();
849 /* Begin a for-statement. Returns a new FOR_STMT.
850 SCOPE and INIT should be the return of begin_for_scope,
854 begin_for_stmt (tree scope, tree init)
858 r = build_stmt (input_location, FOR_STMT, NULL_TREE, NULL_TREE,
859 NULL_TREE, NULL_TREE, NULL_TREE);
861 if (scope == NULL_TREE)
863 gcc_assert (!init || !(flag_new_for_scope > 0));
865 scope = begin_for_scope (&init);
867 FOR_INIT_STMT (r) = init;
868 FOR_SCOPE (r) = scope;
873 /* Finish the for-init-statement of a for-statement, which may be
874 given by FOR_STMT. */
877 finish_for_init_stmt (tree for_stmt)
879 if (processing_template_decl)
880 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
882 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
883 begin_cond (&FOR_COND (for_stmt));
886 /* Finish the COND of a for-statement, which may be given by
890 finish_for_cond (tree cond, tree for_stmt)
892 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
893 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
896 /* Finish the increment-EXPRESSION in a for-statement, which may be
897 given by FOR_STMT. */
900 finish_for_expr (tree expr, tree for_stmt)
904 /* If EXPR is an overloaded function, issue an error; there is no
905 context available to use to perform overload resolution. */
906 if (type_unknown_p (expr))
908 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
909 expr = error_mark_node;
911 if (!processing_template_decl)
913 if (warn_sequence_point)
914 verify_sequence_points (expr);
915 expr = convert_to_void (expr, ICV_THIRD_IN_FOR,
916 tf_warning_or_error);
918 else if (!type_dependent_expression_p (expr))
919 convert_to_void (build_non_dependent_expr (expr), ICV_THIRD_IN_FOR,
920 tf_warning_or_error);
921 expr = maybe_cleanup_point_expr_void (expr);
922 if (check_for_bare_parameter_packs (expr))
923 expr = error_mark_node;
924 FOR_EXPR (for_stmt) = expr;
927 /* Finish the body of a for-statement, which may be given by
928 FOR_STMT. The increment-EXPR for the loop must be
930 It can also finish RANGE_FOR_STMT. */
933 finish_for_stmt (tree for_stmt)
935 if (TREE_CODE (for_stmt) == RANGE_FOR_STMT)
936 RANGE_FOR_BODY (for_stmt) = do_poplevel (RANGE_FOR_BODY (for_stmt));
938 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
940 /* Pop the scope for the body of the loop. */
941 if (flag_new_for_scope > 0)
944 tree *scope_ptr = (TREE_CODE (for_stmt) == RANGE_FOR_STMT
945 ? &RANGE_FOR_SCOPE (for_stmt)
946 : &FOR_SCOPE (for_stmt));
949 add_stmt (do_poplevel (scope));
955 /* Begin a range-for-statement. Returns a new RANGE_FOR_STMT.
956 SCOPE and INIT should be the return of begin_for_scope,
958 To finish it call finish_for_stmt(). */
961 begin_range_for_stmt (tree scope, tree init)
965 r = build_stmt (input_location, RANGE_FOR_STMT,
966 NULL_TREE, NULL_TREE, NULL_TREE, NULL_TREE);
968 if (scope == NULL_TREE)
970 gcc_assert (!init || !(flag_new_for_scope > 0));
972 scope = begin_for_scope (&init);
975 /* RANGE_FOR_STMTs do not use nor save the init tree, so we
978 pop_stmt_list (init);
979 RANGE_FOR_SCOPE (r) = scope;
984 /* Finish the head of a range-based for statement, which may
985 be given by RANGE_FOR_STMT. DECL must be the declaration
986 and EXPR must be the loop expression. */
989 finish_range_for_decl (tree range_for_stmt, tree decl, tree expr)
991 RANGE_FOR_DECL (range_for_stmt) = decl;
992 RANGE_FOR_EXPR (range_for_stmt) = expr;
993 add_stmt (range_for_stmt);
994 RANGE_FOR_BODY (range_for_stmt) = do_pushlevel (sk_block);
997 /* Finish a break-statement. */
1000 finish_break_stmt (void)
1002 return add_stmt (build_stmt (input_location, BREAK_STMT));
1005 /* Finish a continue-statement. */
1008 finish_continue_stmt (void)
1010 return add_stmt (build_stmt (input_location, CONTINUE_STMT));
1013 /* Begin a switch-statement. Returns a new SWITCH_STMT if
1017 begin_switch_stmt (void)
1021 scope = do_pushlevel (sk_block);
1022 r = build_stmt (input_location, SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE, scope);
1024 begin_cond (&SWITCH_STMT_COND (r));
1029 /* Finish the cond of a switch-statement. */
1032 finish_switch_cond (tree cond, tree switch_stmt)
1034 tree orig_type = NULL;
1035 if (!processing_template_decl)
1037 /* Convert the condition to an integer or enumeration type. */
1038 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
1039 if (cond == NULL_TREE)
1041 error ("switch quantity not an integer");
1042 cond = error_mark_node;
1044 orig_type = TREE_TYPE (cond);
1045 if (cond != error_mark_node)
1049 Integral promotions are performed. */
1050 cond = perform_integral_promotions (cond);
1051 cond = maybe_cleanup_point_expr (cond);
1054 if (check_for_bare_parameter_packs (cond))
1055 cond = error_mark_node;
1056 else if (!processing_template_decl && warn_sequence_point)
1057 verify_sequence_points (cond);
1059 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
1060 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
1061 add_stmt (switch_stmt);
1062 push_switch (switch_stmt);
1063 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
1066 /* Finish the body of a switch-statement, which may be given by
1067 SWITCH_STMT. The COND to switch on is indicated. */
1070 finish_switch_stmt (tree switch_stmt)
1074 SWITCH_STMT_BODY (switch_stmt) =
1075 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
1079 scope = SWITCH_STMT_SCOPE (switch_stmt);
1080 SWITCH_STMT_SCOPE (switch_stmt) = NULL;
1081 add_stmt (do_poplevel (scope));
1084 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1088 begin_try_block (void)
1090 tree r = build_stmt (input_location, TRY_BLOCK, NULL_TREE, NULL_TREE);
1092 TRY_STMTS (r) = push_stmt_list ();
1096 /* Likewise, for a function-try-block. The block returned in
1097 *COMPOUND_STMT is an artificial outer scope, containing the
1098 function-try-block. */
1101 begin_function_try_block (tree *compound_stmt)
1104 /* This outer scope does not exist in the C++ standard, but we need
1105 a place to put __FUNCTION__ and similar variables. */
1106 *compound_stmt = begin_compound_stmt (0);
1107 r = begin_try_block ();
1108 FN_TRY_BLOCK_P (r) = 1;
1112 /* Finish a try-block, which may be given by TRY_BLOCK. */
1115 finish_try_block (tree try_block)
1117 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1118 TRY_HANDLERS (try_block) = push_stmt_list ();
1121 /* Finish the body of a cleanup try-block, which may be given by
1125 finish_cleanup_try_block (tree try_block)
1127 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1130 /* Finish an implicitly generated try-block, with a cleanup is given
1134 finish_cleanup (tree cleanup, tree try_block)
1136 TRY_HANDLERS (try_block) = cleanup;
1137 CLEANUP_P (try_block) = 1;
1140 /* Likewise, for a function-try-block. */
1143 finish_function_try_block (tree try_block)
1145 finish_try_block (try_block);
1146 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1147 the try block, but moving it inside. */
1148 in_function_try_handler = 1;
1151 /* Finish a handler-sequence for a try-block, which may be given by
1155 finish_handler_sequence (tree try_block)
1157 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1158 check_handlers (TRY_HANDLERS (try_block));
1161 /* Finish the handler-seq for a function-try-block, given by
1162 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1163 begin_function_try_block. */
1166 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1168 in_function_try_handler = 0;
1169 finish_handler_sequence (try_block);
1170 finish_compound_stmt (compound_stmt);
1173 /* Begin a handler. Returns a HANDLER if appropriate. */
1176 begin_handler (void)
1180 r = build_stmt (input_location, HANDLER, NULL_TREE, NULL_TREE);
1183 /* Create a binding level for the eh_info and the exception object
1185 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1190 /* Finish the handler-parameters for a handler, which may be given by
1191 HANDLER. DECL is the declaration for the catch parameter, or NULL
1192 if this is a `catch (...)' clause. */
1195 finish_handler_parms (tree decl, tree handler)
1197 tree type = NULL_TREE;
1198 if (processing_template_decl)
1202 decl = pushdecl (decl);
1203 decl = push_template_decl (decl);
1204 HANDLER_PARMS (handler) = decl;
1205 type = TREE_TYPE (decl);
1209 type = expand_start_catch_block (decl);
1210 HANDLER_TYPE (handler) = type;
1211 if (!processing_template_decl && type)
1212 mark_used (eh_type_info (type));
1215 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1216 the return value from the matching call to finish_handler_parms. */
1219 finish_handler (tree handler)
1221 if (!processing_template_decl)
1222 expand_end_catch_block ();
1223 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1226 /* Begin a compound statement. FLAGS contains some bits that control the
1227 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1228 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1229 block of a function. If BCS_TRY_BLOCK is set, this is the block
1230 created on behalf of a TRY statement. Returns a token to be passed to
1231 finish_compound_stmt. */
1234 begin_compound_stmt (unsigned int flags)
1238 if (flags & BCS_NO_SCOPE)
1240 r = push_stmt_list ();
1241 STATEMENT_LIST_NO_SCOPE (r) = 1;
1243 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1244 But, if it's a statement-expression with a scopeless block, there's
1245 nothing to keep, and we don't want to accidentally keep a block
1246 *inside* the scopeless block. */
1247 keep_next_level (false);
1250 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1252 /* When processing a template, we need to remember where the braces were,
1253 so that we can set up identical scopes when instantiating the template
1254 later. BIND_EXPR is a handy candidate for this.
1255 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1256 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1257 processing templates. */
1258 if (processing_template_decl)
1260 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1261 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1262 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1263 TREE_SIDE_EFFECTS (r) = 1;
1269 /* Finish a compound-statement, which is given by STMT. */
1272 finish_compound_stmt (tree stmt)
1274 if (TREE_CODE (stmt) == BIND_EXPR)
1276 tree body = do_poplevel (BIND_EXPR_BODY (stmt));
1277 /* If the STATEMENT_LIST is empty and this BIND_EXPR isn't special,
1278 discard the BIND_EXPR so it can be merged with the containing
1280 if (TREE_CODE (body) == STATEMENT_LIST
1281 && STATEMENT_LIST_HEAD (body) == NULL
1282 && !BIND_EXPR_BODY_BLOCK (stmt)
1283 && !BIND_EXPR_TRY_BLOCK (stmt))
1286 BIND_EXPR_BODY (stmt) = body;
1288 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1289 stmt = pop_stmt_list (stmt);
1292 /* Destroy any ObjC "super" receivers that may have been
1294 objc_clear_super_receiver ();
1296 stmt = do_poplevel (stmt);
1299 /* ??? See c_end_compound_stmt wrt statement expressions. */
1304 /* Finish an asm-statement, whose components are a STRING, some
1305 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1306 LABELS. Also note whether the asm-statement should be
1307 considered volatile. */
1310 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1311 tree input_operands, tree clobbers, tree labels)
1315 int ninputs = list_length (input_operands);
1316 int noutputs = list_length (output_operands);
1318 if (!processing_template_decl)
1320 const char *constraint;
1321 const char **oconstraints;
1322 bool allows_mem, allows_reg, is_inout;
1326 oconstraints = XALLOCAVEC (const char *, noutputs);
1328 string = resolve_asm_operand_names (string, output_operands,
1329 input_operands, labels);
1331 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1333 operand = TREE_VALUE (t);
1335 /* ??? Really, this should not be here. Users should be using a
1336 proper lvalue, dammit. But there's a long history of using
1337 casts in the output operands. In cases like longlong.h, this
1338 becomes a primitive form of typechecking -- if the cast can be
1339 removed, then the output operand had a type of the proper width;
1340 otherwise we'll get an error. Gross, but ... */
1341 STRIP_NOPS (operand);
1343 operand = mark_lvalue_use (operand);
1345 if (!lvalue_or_else (operand, lv_asm, tf_warning_or_error))
1346 operand = error_mark_node;
1348 if (operand != error_mark_node
1349 && (TREE_READONLY (operand)
1350 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1351 /* Functions are not modifiable, even though they are
1353 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1354 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1355 /* If it's an aggregate and any field is const, then it is
1356 effectively const. */
1357 || (CLASS_TYPE_P (TREE_TYPE (operand))
1358 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1359 cxx_readonly_error (operand, lv_asm);
1361 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1362 oconstraints[i] = constraint;
1364 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1365 &allows_mem, &allows_reg, &is_inout))
1367 /* If the operand is going to end up in memory,
1368 mark it addressable. */
1369 if (!allows_reg && !cxx_mark_addressable (operand))
1370 operand = error_mark_node;
1373 operand = error_mark_node;
1375 TREE_VALUE (t) = operand;
1378 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1380 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1381 operand = decay_conversion (TREE_VALUE (t));
1383 /* If the type of the operand hasn't been determined (e.g.,
1384 because it involves an overloaded function), then issue
1385 an error message. There's no context available to
1386 resolve the overloading. */
1387 if (TREE_TYPE (operand) == unknown_type_node)
1389 error ("type of asm operand %qE could not be determined",
1391 operand = error_mark_node;
1394 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1395 oconstraints, &allows_mem, &allows_reg))
1397 /* If the operand is going to end up in memory,
1398 mark it addressable. */
1399 if (!allows_reg && allows_mem)
1401 /* Strip the nops as we allow this case. FIXME, this really
1402 should be rejected or made deprecated. */
1403 STRIP_NOPS (operand);
1404 if (!cxx_mark_addressable (operand))
1405 operand = error_mark_node;
1409 operand = error_mark_node;
1411 TREE_VALUE (t) = operand;
1415 r = build_stmt (input_location, ASM_EXPR, string,
1416 output_operands, input_operands,
1418 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1419 r = maybe_cleanup_point_expr_void (r);
1420 return add_stmt (r);
1423 /* Finish a label with the indicated NAME. Returns the new label. */
1426 finish_label_stmt (tree name)
1428 tree decl = define_label (input_location, name);
1430 if (decl == error_mark_node)
1431 return error_mark_node;
1433 add_stmt (build_stmt (input_location, LABEL_EXPR, decl));
1438 /* Finish a series of declarations for local labels. G++ allows users
1439 to declare "local" labels, i.e., labels with scope. This extension
1440 is useful when writing code involving statement-expressions. */
1443 finish_label_decl (tree name)
1445 if (!at_function_scope_p ())
1447 error ("__label__ declarations are only allowed in function scopes");
1451 add_decl_expr (declare_local_label (name));
1454 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1457 finish_decl_cleanup (tree decl, tree cleanup)
1459 push_cleanup (decl, cleanup, false);
1462 /* If the current scope exits with an exception, run CLEANUP. */
1465 finish_eh_cleanup (tree cleanup)
1467 push_cleanup (NULL, cleanup, true);
1470 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1471 order they were written by the user. Each node is as for
1472 emit_mem_initializers. */
1475 finish_mem_initializers (tree mem_inits)
1477 /* Reorder the MEM_INITS so that they are in the order they appeared
1478 in the source program. */
1479 mem_inits = nreverse (mem_inits);
1481 if (processing_template_decl)
1485 for (mem = mem_inits; mem; mem = TREE_CHAIN (mem))
1487 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1488 check for bare parameter packs in the TREE_VALUE, because
1489 any parameter packs in the TREE_VALUE have already been
1490 bound as part of the TREE_PURPOSE. See
1491 make_pack_expansion for more information. */
1492 if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION
1493 && check_for_bare_parameter_packs (TREE_VALUE (mem)))
1494 TREE_VALUE (mem) = error_mark_node;
1497 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1500 emit_mem_initializers (mem_inits);
1503 /* Finish a parenthesized expression EXPR. */
1506 finish_parenthesized_expr (tree expr)
1509 /* This inhibits warnings in c_common_truthvalue_conversion. */
1510 TREE_NO_WARNING (expr) = 1;
1512 if (TREE_CODE (expr) == OFFSET_REF)
1513 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1514 enclosed in parentheses. */
1515 PTRMEM_OK_P (expr) = 0;
1517 if (TREE_CODE (expr) == STRING_CST)
1518 PAREN_STRING_LITERAL_P (expr) = 1;
1523 /* Finish a reference to a non-static data member (DECL) that is not
1524 preceded by `.' or `->'. */
1527 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1529 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1533 tree scope = qualifying_scope;
1534 if (scope == NULL_TREE)
1535 scope = context_for_name_lookup (decl);
1536 object = maybe_dummy_object (scope, NULL);
1539 if (object == error_mark_node)
1540 return error_mark_node;
1542 /* DR 613: Can use non-static data members without an associated
1543 object in sizeof/decltype/alignof. */
1544 if (is_dummy_object (object) && cp_unevaluated_operand == 0
1545 && (!processing_template_decl || !current_class_ref))
1547 if (current_function_decl
1548 && DECL_STATIC_FUNCTION_P (current_function_decl))
1549 error ("invalid use of member %q+D in static member function", decl);
1551 error ("invalid use of non-static data member %q+D", decl);
1552 error ("from this location");
1554 return error_mark_node;
1557 if (current_class_ptr)
1558 TREE_USED (current_class_ptr) = 1;
1559 if (processing_template_decl && !qualifying_scope)
1561 tree type = TREE_TYPE (decl);
1563 if (TREE_CODE (type) == REFERENCE_TYPE)
1564 type = TREE_TYPE (type);
1567 /* Set the cv qualifiers. */
1568 int quals = (current_class_ref
1569 ? cp_type_quals (TREE_TYPE (current_class_ref))
1570 : TYPE_UNQUALIFIED);
1572 if (DECL_MUTABLE_P (decl))
1573 quals &= ~TYPE_QUAL_CONST;
1575 quals |= cp_type_quals (TREE_TYPE (decl));
1576 type = cp_build_qualified_type (type, quals);
1579 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1581 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1582 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1584 else if (processing_template_decl)
1585 return build_qualified_name (TREE_TYPE (decl),
1588 /*template_p=*/false);
1591 tree access_type = TREE_TYPE (object);
1593 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1596 /* If the data member was named `C::M', convert `*this' to `C'
1598 if (qualifying_scope)
1600 tree binfo = NULL_TREE;
1601 object = build_scoped_ref (object, qualifying_scope,
1605 return build_class_member_access_expr (object, decl,
1606 /*access_path=*/NULL_TREE,
1607 /*preserve_reference=*/false,
1608 tf_warning_or_error);
1612 /* If we are currently parsing a template and we encountered a typedef
1613 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1614 adds the typedef to a list tied to the current template.
1615 At tempate instantiatin time, that list is walked and access check
1616 performed for each typedef.
1617 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1620 add_typedef_to_current_template_for_access_check (tree typedef_decl,
1622 location_t location)
1624 tree template_info = NULL;
1625 tree cs = current_scope ();
1627 if (!is_typedef_decl (typedef_decl)
1629 || !CLASS_TYPE_P (context)
1633 if (CLASS_TYPE_P (cs) || TREE_CODE (cs) == FUNCTION_DECL)
1634 template_info = get_template_info (cs);
1637 && TI_TEMPLATE (template_info)
1638 && !currently_open_class (context))
1639 append_type_to_template_for_access_check (cs, typedef_decl,
1643 /* DECL was the declaration to which a qualified-id resolved. Issue
1644 an error message if it is not accessible. If OBJECT_TYPE is
1645 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1646 type of `*x', or `x', respectively. If the DECL was named as
1647 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1650 check_accessibility_of_qualified_id (tree decl,
1652 tree nested_name_specifier)
1655 tree qualifying_type = NULL_TREE;
1657 /* If we are parsing a template declaration and if decl is a typedef,
1658 add it to a list tied to the template.
1659 At template instantiation time, that list will be walked and
1660 access check performed. */
1661 add_typedef_to_current_template_for_access_check (decl,
1662 nested_name_specifier
1663 ? nested_name_specifier
1664 : DECL_CONTEXT (decl),
1667 /* If we're not checking, return immediately. */
1668 if (deferred_access_no_check)
1671 /* Determine the SCOPE of DECL. */
1672 scope = context_for_name_lookup (decl);
1673 /* If the SCOPE is not a type, then DECL is not a member. */
1674 if (!TYPE_P (scope))
1676 /* Compute the scope through which DECL is being accessed. */
1678 /* OBJECT_TYPE might not be a class type; consider:
1680 class A { typedef int I; };
1684 In this case, we will have "A::I" as the DECL, but "I" as the
1686 && CLASS_TYPE_P (object_type)
1687 && DERIVED_FROM_P (scope, object_type))
1688 /* If we are processing a `->' or `.' expression, use the type of the
1690 qualifying_type = object_type;
1691 else if (nested_name_specifier)
1693 /* If the reference is to a non-static member of the
1694 current class, treat it as if it were referenced through
1696 if (DECL_NONSTATIC_MEMBER_P (decl)
1697 && current_class_ptr
1698 && DERIVED_FROM_P (scope, current_class_type))
1699 qualifying_type = current_class_type;
1700 /* Otherwise, use the type indicated by the
1701 nested-name-specifier. */
1703 qualifying_type = nested_name_specifier;
1706 /* Otherwise, the name must be from the current class or one of
1708 qualifying_type = currently_open_derived_class (scope);
1711 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1712 or similar in a default argument value. */
1713 && CLASS_TYPE_P (qualifying_type)
1714 && !dependent_type_p (qualifying_type))
1715 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1719 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1720 class named to the left of the "::" operator. DONE is true if this
1721 expression is a complete postfix-expression; it is false if this
1722 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1723 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1724 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1725 is true iff this qualified name appears as a template argument. */
1728 finish_qualified_id_expr (tree qualifying_class,
1733 bool template_arg_p)
1735 gcc_assert (TYPE_P (qualifying_class));
1737 if (error_operand_p (expr))
1738 return error_mark_node;
1740 if (DECL_P (expr) || BASELINK_P (expr))
1744 check_template_keyword (expr);
1746 /* If EXPR occurs as the operand of '&', use special handling that
1747 permits a pointer-to-member. */
1748 if (address_p && done)
1750 if (TREE_CODE (expr) == SCOPE_REF)
1751 expr = TREE_OPERAND (expr, 1);
1752 expr = build_offset_ref (qualifying_class, expr,
1753 /*address_p=*/true);
1757 /* Within the scope of a class, turn references to non-static
1758 members into expression of the form "this->...". */
1760 /* But, within a template argument, we do not want make the
1761 transformation, as there is no "this" pointer. */
1763 else if (TREE_CODE (expr) == FIELD_DECL)
1765 push_deferring_access_checks (dk_no_check);
1766 expr = finish_non_static_data_member (expr, NULL_TREE,
1768 pop_deferring_access_checks ();
1770 else if (BASELINK_P (expr) && !processing_template_decl)
1774 /* See if any of the functions are non-static members. */
1775 /* If so, the expression may be relative to 'this'. */
1776 if (!shared_member_p (expr)
1777 && (ob = maybe_dummy_object (qualifying_class, NULL),
1778 !is_dummy_object (ob)))
1779 expr = (build_class_member_access_expr
1782 BASELINK_ACCESS_BINFO (expr),
1783 /*preserve_reference=*/false,
1784 tf_warning_or_error));
1786 /* The expression is a qualified name whose address is not
1788 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1794 /* Begin a statement-expression. The value returned must be passed to
1795 finish_stmt_expr. */
1798 begin_stmt_expr (void)
1800 return push_stmt_list ();
1803 /* Process the final expression of a statement expression. EXPR can be
1804 NULL, if the final expression is empty. Return a STATEMENT_LIST
1805 containing all the statements in the statement-expression, or
1806 ERROR_MARK_NODE if there was an error. */
1809 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1811 if (error_operand_p (expr))
1813 /* The type of the statement-expression is the type of the last
1815 TREE_TYPE (stmt_expr) = error_mark_node;
1816 return error_mark_node;
1819 /* If the last statement does not have "void" type, then the value
1820 of the last statement is the value of the entire expression. */
1823 tree type = TREE_TYPE (expr);
1825 if (processing_template_decl)
1827 expr = build_stmt (input_location, EXPR_STMT, expr);
1828 expr = add_stmt (expr);
1829 /* Mark the last statement so that we can recognize it as such at
1830 template-instantiation time. */
1831 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1833 else if (VOID_TYPE_P (type))
1835 /* Just treat this like an ordinary statement. */
1836 expr = finish_expr_stmt (expr);
1840 /* It actually has a value we need to deal with. First, force it
1841 to be an rvalue so that we won't need to build up a copy
1842 constructor call later when we try to assign it to something. */
1843 expr = force_rvalue (expr);
1844 if (error_operand_p (expr))
1845 return error_mark_node;
1847 /* Update for array-to-pointer decay. */
1848 type = TREE_TYPE (expr);
1850 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1851 normal statement, but don't convert to void or actually add
1853 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1854 expr = maybe_cleanup_point_expr (expr);
1858 /* The type of the statement-expression is the type of the last
1860 TREE_TYPE (stmt_expr) = type;
1866 /* Finish a statement-expression. EXPR should be the value returned
1867 by the previous begin_stmt_expr. Returns an expression
1868 representing the statement-expression. */
1871 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1876 if (error_operand_p (stmt_expr))
1878 pop_stmt_list (stmt_expr);
1879 return error_mark_node;
1882 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1884 type = TREE_TYPE (stmt_expr);
1885 result = pop_stmt_list (stmt_expr);
1886 TREE_TYPE (result) = type;
1888 if (processing_template_decl)
1890 result = build_min (STMT_EXPR, type, result);
1891 TREE_SIDE_EFFECTS (result) = 1;
1892 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1894 else if (CLASS_TYPE_P (type))
1896 /* Wrap the statement-expression in a TARGET_EXPR so that the
1897 temporary object created by the final expression is destroyed at
1898 the end of the full-expression containing the
1899 statement-expression. */
1900 result = force_target_expr (type, result);
1906 /* Returns the expression which provides the value of STMT_EXPR. */
1909 stmt_expr_value_expr (tree stmt_expr)
1911 tree t = STMT_EXPR_STMT (stmt_expr);
1913 if (TREE_CODE (t) == BIND_EXPR)
1914 t = BIND_EXPR_BODY (t);
1916 if (TREE_CODE (t) == STATEMENT_LIST && STATEMENT_LIST_TAIL (t))
1917 t = STATEMENT_LIST_TAIL (t)->stmt;
1919 if (TREE_CODE (t) == EXPR_STMT)
1920 t = EXPR_STMT_EXPR (t);
1925 /* Return TRUE iff EXPR_STMT is an empty list of
1926 expression statements. */
1929 empty_expr_stmt_p (tree expr_stmt)
1931 tree body = NULL_TREE;
1933 if (expr_stmt == void_zero_node)
1938 if (TREE_CODE (expr_stmt) == EXPR_STMT)
1939 body = EXPR_STMT_EXPR (expr_stmt);
1940 else if (TREE_CODE (expr_stmt) == STATEMENT_LIST)
1946 if (TREE_CODE (body) == STATEMENT_LIST)
1947 return tsi_end_p (tsi_start (body));
1949 return empty_expr_stmt_p (body);
1954 /* Perform Koenig lookup. FN is the postfix-expression representing
1955 the function (or functions) to call; ARGS are the arguments to the
1956 call; if INCLUDE_STD then the `std' namespace is automatically
1957 considered an associated namespace (used in range-based for loops).
1958 Returns the functions to be considered by overload resolution. */
1961 perform_koenig_lookup (tree fn, VEC(tree,gc) *args, bool include_std)
1963 tree identifier = NULL_TREE;
1964 tree functions = NULL_TREE;
1965 tree tmpl_args = NULL_TREE;
1966 bool template_id = false;
1968 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
1970 /* Use a separate flag to handle null args. */
1972 tmpl_args = TREE_OPERAND (fn, 1);
1973 fn = TREE_OPERAND (fn, 0);
1976 /* Find the name of the overloaded function. */
1977 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1979 else if (is_overloaded_fn (fn))
1982 identifier = DECL_NAME (get_first_fn (functions));
1984 else if (DECL_P (fn))
1987 identifier = DECL_NAME (fn);
1990 /* A call to a namespace-scope function using an unqualified name.
1992 Do Koenig lookup -- unless any of the arguments are
1994 if (!any_type_dependent_arguments_p (args)
1995 && !any_dependent_template_arguments_p (tmpl_args))
1997 fn = lookup_arg_dependent (identifier, functions, args, include_std);
1999 /* The unqualified name could not be resolved. */
2000 fn = unqualified_fn_lookup_error (identifier);
2003 if (fn && template_id)
2004 fn = build2 (TEMPLATE_ID_EXPR, unknown_type_node, fn, tmpl_args);
2009 /* Generate an expression for `FN (ARGS)'. This may change the
2012 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
2013 as a virtual call, even if FN is virtual. (This flag is set when
2014 encountering an expression where the function name is explicitly
2015 qualified. For example a call to `X::f' never generates a virtual
2018 Returns code for the call. */
2021 finish_call_expr (tree fn, VEC(tree,gc) **args, bool disallow_virtual,
2022 bool koenig_p, tsubst_flags_t complain)
2026 VEC(tree,gc) *orig_args = NULL;
2028 if (fn == error_mark_node)
2029 return error_mark_node;
2031 gcc_assert (!TYPE_P (fn));
2035 if (processing_template_decl)
2037 /* If the call expression is dependent, build a CALL_EXPR node
2038 with no type; type_dependent_expression_p recognizes
2039 expressions with no type as being dependent. */
2040 if (type_dependent_expression_p (fn)
2041 || any_type_dependent_arguments_p (*args)
2042 /* For a non-static member function, we need to specifically
2043 test the type dependency of the "this" pointer because it
2044 is not included in *ARGS even though it is considered to
2045 be part of the list of arguments. Note that this is
2046 related to CWG issues 515 and 1005. */
2047 || ((TREE_CODE (TREE_TYPE (fn)) == METHOD_TYPE)
2048 && current_class_ref
2049 && type_dependent_expression_p (current_class_ref)))
2051 result = build_nt_call_vec (fn, *args);
2052 KOENIG_LOOKUP_P (result) = koenig_p;
2057 tree fndecl = OVL_CURRENT (fn);
2058 if (TREE_CODE (fndecl) != FUNCTION_DECL
2059 || !TREE_THIS_VOLATILE (fndecl))
2065 current_function_returns_abnormally = 1;
2069 orig_args = make_tree_vector_copy (*args);
2070 if (!BASELINK_P (fn)
2071 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
2072 && TREE_TYPE (fn) != unknown_type_node)
2073 fn = build_non_dependent_expr (fn);
2074 make_args_non_dependent (*args);
2077 if (is_overloaded_fn (fn))
2078 fn = baselink_for_fns (fn);
2081 if (BASELINK_P (fn))
2085 /* A call to a member function. From [over.call.func]:
2087 If the keyword this is in scope and refers to the class of
2088 that member function, or a derived class thereof, then the
2089 function call is transformed into a qualified function call
2090 using (*this) as the postfix-expression to the left of the
2091 . operator.... [Otherwise] a contrived object of type T
2092 becomes the implied object argument.
2096 struct A { void f(); };
2097 struct B : public A {};
2098 struct C : public A { void g() { B::f(); }};
2100 "the class of that member function" refers to `A'. But 11.2
2101 [class.access.base] says that we need to convert 'this' to B* as
2102 part of the access, so we pass 'B' to maybe_dummy_object. */
2104 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
2107 if (processing_template_decl)
2109 if (type_dependent_expression_p (object))
2111 tree ret = build_nt_call_vec (orig_fn, orig_args);
2112 release_tree_vector (orig_args);
2115 object = build_non_dependent_expr (object);
2118 result = build_new_method_call (object, fn, args, NULL_TREE,
2120 ? LOOKUP_NORMAL|LOOKUP_NONVIRTUAL
2125 else if (is_overloaded_fn (fn))
2127 /* If the function is an overloaded builtin, resolve it. */
2128 if (TREE_CODE (fn) == FUNCTION_DECL
2129 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
2130 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
2131 result = resolve_overloaded_builtin (input_location, fn, *args);
2134 /* A call to a namespace-scope function. */
2135 result = build_new_function_call (fn, args, koenig_p, complain);
2137 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
2139 if (!VEC_empty (tree, *args))
2140 error ("arguments to destructor are not allowed");
2141 /* Mark the pseudo-destructor call as having side-effects so
2142 that we do not issue warnings about its use. */
2143 result = build1 (NOP_EXPR,
2145 TREE_OPERAND (fn, 0));
2146 TREE_SIDE_EFFECTS (result) = 1;
2148 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
2149 /* If the "function" is really an object of class type, it might
2150 have an overloaded `operator ()'. */
2151 result = build_op_call (fn, args, complain);
2154 /* A call where the function is unknown. */
2155 result = cp_build_function_call_vec (fn, args, complain);
2157 if (processing_template_decl && result != error_mark_node)
2159 if (TREE_CODE (result) == INDIRECT_REF)
2160 result = TREE_OPERAND (result, 0);
2161 result = build_call_vec (TREE_TYPE (result), orig_fn, orig_args);
2162 KOENIG_LOOKUP_P (result) = koenig_p;
2163 release_tree_vector (orig_args);
2164 result = convert_from_reference (result);
2169 /* Free garbage OVERLOADs from arg-dependent lookup. */
2170 tree next = NULL_TREE;
2172 fn && TREE_CODE (fn) == OVERLOAD && OVL_ARG_DEPENDENT (fn);
2175 if (processing_template_decl)
2176 /* In a template, we'll re-use them at instantiation time. */
2177 OVL_ARG_DEPENDENT (fn) = false;
2180 next = OVL_CHAIN (fn);
2189 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2190 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2191 POSTDECREMENT_EXPR.) */
2194 finish_increment_expr (tree expr, enum tree_code code)
2196 return build_x_unary_op (code, expr, tf_warning_or_error);
2199 /* Finish a use of `this'. Returns an expression for `this'. */
2202 finish_this_expr (void)
2206 if (current_class_ptr)
2208 tree type = TREE_TYPE (current_class_ref);
2210 /* In a lambda expression, 'this' refers to the captured 'this'. */
2211 if (LAMBDA_TYPE_P (type))
2212 result = lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type));
2214 result = current_class_ptr;
2217 else if (current_function_decl
2218 && DECL_STATIC_FUNCTION_P (current_function_decl))
2220 error ("%<this%> is unavailable for static member functions");
2221 result = error_mark_node;
2225 if (current_function_decl)
2226 error ("invalid use of %<this%> in non-member function");
2228 error ("invalid use of %<this%> at top level");
2229 result = error_mark_node;
2235 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2236 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2237 the TYPE for the type given. If SCOPE is non-NULL, the expression
2238 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2241 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2243 if (object == error_mark_node || destructor == error_mark_node)
2244 return error_mark_node;
2246 gcc_assert (TYPE_P (destructor));
2248 if (!processing_template_decl)
2250 if (scope == error_mark_node)
2252 error ("invalid qualifying scope in pseudo-destructor name");
2253 return error_mark_node;
2255 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2257 error ("qualified type %qT does not match destructor name ~%qT",
2259 return error_mark_node;
2263 /* [expr.pseudo] says both:
2265 The type designated by the pseudo-destructor-name shall be
2266 the same as the object type.
2270 The cv-unqualified versions of the object type and of the
2271 type designated by the pseudo-destructor-name shall be the
2274 We implement the more generous second sentence, since that is
2275 what most other compilers do. */
2276 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2279 error ("%qE is not of type %qT", object, destructor);
2280 return error_mark_node;
2284 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2287 /* Finish an expression of the form CODE EXPR. */
2290 finish_unary_op_expr (enum tree_code code, tree expr)
2292 tree result = build_x_unary_op (code, expr, tf_warning_or_error);
2293 /* Inside a template, build_x_unary_op does not fold the
2294 expression. So check whether the result is folded before
2295 setting TREE_NEGATED_INT. */
2296 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2297 && TREE_CODE (result) == INTEGER_CST
2298 && !TYPE_UNSIGNED (TREE_TYPE (result))
2299 && INT_CST_LT (result, integer_zero_node))
2301 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2302 setting TREE_NEGATED_INT. */
2303 result = copy_node (result);
2304 TREE_NEGATED_INT (result) = 1;
2306 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2307 overflow_warning (input_location, result);
2312 /* Finish a compound-literal expression. TYPE is the type to which
2313 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2316 finish_compound_literal (tree type, tree compound_literal,
2317 tsubst_flags_t complain)
2319 if (type == error_mark_node)
2320 return error_mark_node;
2322 if (TREE_CODE (type) == REFERENCE_TYPE)
2325 = finish_compound_literal (TREE_TYPE (type), compound_literal,
2327 return cp_build_c_cast (type, compound_literal, complain);
2330 if (!TYPE_OBJ_P (type))
2332 if (complain & tf_error)
2333 error ("compound literal of non-object type %qT", type);
2334 return error_mark_node;
2337 if (processing_template_decl)
2339 TREE_TYPE (compound_literal) = type;
2340 /* Mark the expression as a compound literal. */
2341 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2342 return compound_literal;
2345 type = complete_type (type);
2347 if (TYPE_NON_AGGREGATE_CLASS (type))
2349 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2350 everywhere that deals with function arguments would be a pain, so
2351 just wrap it in a TREE_LIST. The parser set a flag so we know
2352 that it came from T{} rather than T({}). */
2353 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal) = 1;
2354 compound_literal = build_tree_list (NULL_TREE, compound_literal);
2355 return build_functional_cast (type, compound_literal, complain);
2358 if (TREE_CODE (type) == ARRAY_TYPE
2359 && check_array_initializer (NULL_TREE, type, compound_literal))
2360 return error_mark_node;
2361 compound_literal = reshape_init (type, compound_literal);
2362 if (TREE_CODE (type) == ARRAY_TYPE
2363 && TYPE_DOMAIN (type) == NULL_TREE)
2365 cp_complete_array_type_or_error (&type, compound_literal,
2367 if (type == error_mark_node)
2368 return error_mark_node;
2370 compound_literal = digest_init (type, compound_literal);
2371 /* Put static/constant array temporaries in static variables, but always
2372 represent class temporaries with TARGET_EXPR so we elide copies. */
2373 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type))
2374 && TREE_CODE (type) == ARRAY_TYPE
2375 && initializer_constant_valid_p (compound_literal, type))
2377 tree decl = create_temporary_var (type);
2378 DECL_INITIAL (decl) = compound_literal;
2379 TREE_STATIC (decl) = 1;
2380 if (literal_type_p (type) && CP_TYPE_CONST_NON_VOLATILE_P (type))
2382 /* 5.19 says that a constant expression can include an
2383 lvalue-rvalue conversion applied to "a glvalue of literal type
2384 that refers to a non-volatile temporary object initialized
2385 with a constant expression". Rather than try to communicate
2386 that this VAR_DECL is a temporary, just mark it constexpr. */
2387 DECL_DECLARED_CONSTEXPR_P (decl) = true;
2388 DECL_INITIALIZED_BY_CONSTANT_EXPRESSION_P (decl) = true;
2389 TREE_CONSTANT (decl) = true;
2391 cp_apply_type_quals_to_decl (cp_type_quals (type), decl);
2392 decl = pushdecl_top_level (decl);
2393 DECL_NAME (decl) = make_anon_name ();
2394 SET_DECL_ASSEMBLER_NAME (decl, DECL_NAME (decl));
2398 return get_target_expr (compound_literal);
2401 /* Return the declaration for the function-name variable indicated by
2405 finish_fname (tree id)
2409 decl = fname_decl (input_location, C_RID_CODE (id), id);
2410 if (processing_template_decl && current_function_decl)
2411 decl = DECL_NAME (decl);
2415 /* Finish a translation unit. */
2418 finish_translation_unit (void)
2420 /* In case there were missing closebraces,
2421 get us back to the global binding level. */
2423 while (current_namespace != global_namespace)
2426 /* Do file scope __FUNCTION__ et al. */
2427 finish_fname_decls ();
2430 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2431 Returns the parameter. */
2434 finish_template_type_parm (tree aggr, tree identifier)
2436 if (aggr != class_type_node)
2438 permerror (input_location, "template type parameters must use the keyword %<class%> or %<typename%>");
2439 aggr = class_type_node;
2442 return build_tree_list (aggr, identifier);
2445 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2446 Returns the parameter. */
2449 finish_template_template_parm (tree aggr, tree identifier)
2451 tree decl = build_decl (input_location,
2452 TYPE_DECL, identifier, NULL_TREE);
2453 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2454 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2455 DECL_TEMPLATE_RESULT (tmpl) = decl;
2456 DECL_ARTIFICIAL (decl) = 1;
2457 end_template_decl ();
2459 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2461 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2462 /*is_primary=*/true, /*is_partial=*/false,
2465 return finish_template_type_parm (aggr, tmpl);
2468 /* ARGUMENT is the default-argument value for a template template
2469 parameter. If ARGUMENT is invalid, issue error messages and return
2470 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2473 check_template_template_default_arg (tree argument)
2475 if (TREE_CODE (argument) != TEMPLATE_DECL
2476 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2477 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2479 if (TREE_CODE (argument) == TYPE_DECL)
2480 error ("invalid use of type %qT as a default value for a template "
2481 "template-parameter", TREE_TYPE (argument));
2483 error ("invalid default argument for a template template parameter");
2484 return error_mark_node;
2490 /* Begin a class definition, as indicated by T. */
2493 begin_class_definition (tree t, tree attributes)
2495 if (error_operand_p (t) || error_operand_p (TYPE_MAIN_DECL (t)))
2496 return error_mark_node;
2498 if (processing_template_parmlist)
2500 error ("definition of %q#T inside template parameter list", t);
2501 return error_mark_node;
2504 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2505 are passed the same as decimal scalar types. */
2506 if (TREE_CODE (t) == RECORD_TYPE
2507 && !processing_template_decl)
2509 tree ns = TYPE_CONTEXT (t);
2510 if (ns && TREE_CODE (ns) == NAMESPACE_DECL
2511 && DECL_CONTEXT (ns) == std_node
2513 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns)), "decimal"))
2515 const char *n = TYPE_NAME_STRING (t);
2516 if ((strcmp (n, "decimal32") == 0)
2517 || (strcmp (n, "decimal64") == 0)
2518 || (strcmp (n, "decimal128") == 0))
2519 TYPE_TRANSPARENT_AGGR (t) = 1;
2523 /* A non-implicit typename comes from code like:
2525 template <typename T> struct A {
2526 template <typename U> struct A<T>::B ...
2528 This is erroneous. */
2529 else if (TREE_CODE (t) == TYPENAME_TYPE)
2531 error ("invalid definition of qualified type %qT", t);
2532 t = error_mark_node;
2535 if (t == error_mark_node || ! MAYBE_CLASS_TYPE_P (t))
2537 t = make_class_type (RECORD_TYPE);
2538 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2541 if (TYPE_BEING_DEFINED (t))
2543 t = make_class_type (TREE_CODE (t));
2544 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2546 maybe_process_partial_specialization (t);
2548 TYPE_BEING_DEFINED (t) = 1;
2550 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2551 fixup_attribute_variants (t);
2553 if (flag_pack_struct)
2556 TYPE_PACKED (t) = 1;
2557 /* Even though the type is being defined for the first time
2558 here, there might have been a forward declaration, so there
2559 might be cv-qualified variants of T. */
2560 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2561 TYPE_PACKED (v) = 1;
2563 /* Reset the interface data, at the earliest possible
2564 moment, as it might have been set via a class foo;
2566 if (! TYPE_ANONYMOUS_P (t))
2568 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2569 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2570 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2571 (t, finfo->interface_unknown);
2573 reset_specialization();
2575 /* Make a declaration for this class in its own scope. */
2576 build_self_reference ();
2581 /* Finish the member declaration given by DECL. */
2584 finish_member_declaration (tree decl)
2586 if (decl == error_mark_node || decl == NULL_TREE)
2589 if (decl == void_type_node)
2590 /* The COMPONENT was a friend, not a member, and so there's
2591 nothing for us to do. */
2594 /* We should see only one DECL at a time. */
2595 gcc_assert (DECL_CHAIN (decl) == NULL_TREE);
2597 /* Set up access control for DECL. */
2599 = (current_access_specifier == access_private_node);
2600 TREE_PROTECTED (decl)
2601 = (current_access_specifier == access_protected_node);
2602 if (TREE_CODE (decl) == TEMPLATE_DECL)
2604 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2605 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2608 /* Mark the DECL as a member of the current class. */
2609 DECL_CONTEXT (decl) = current_class_type;
2611 /* Check for bare parameter packs in the member variable declaration. */
2612 if (TREE_CODE (decl) == FIELD_DECL)
2614 if (check_for_bare_parameter_packs (TREE_TYPE (decl)))
2615 TREE_TYPE (decl) = error_mark_node;
2616 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl)))
2617 DECL_ATTRIBUTES (decl) = NULL_TREE;
2622 A C language linkage is ignored for the names of class members
2623 and the member function type of class member functions. */
2624 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2625 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2627 /* Put functions on the TYPE_METHODS list and everything else on the
2628 TYPE_FIELDS list. Note that these are built up in reverse order.
2629 We reverse them (to obtain declaration order) in finish_struct. */
2630 if (TREE_CODE (decl) == FUNCTION_DECL
2631 || DECL_FUNCTION_TEMPLATE_P (decl))
2633 /* We also need to add this function to the
2634 CLASSTYPE_METHOD_VEC. */
2635 if (add_method (current_class_type, decl, NULL_TREE))
2637 DECL_CHAIN (decl) = TYPE_METHODS (current_class_type);
2638 TYPE_METHODS (current_class_type) = decl;
2640 maybe_add_class_template_decl_list (current_class_type, decl,
2644 /* Enter the DECL into the scope of the class. */
2645 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2646 || pushdecl_class_level (decl))
2648 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2649 go at the beginning. The reason is that lookup_field_1
2650 searches the list in order, and we want a field name to
2651 override a type name so that the "struct stat hack" will
2652 work. In particular:
2654 struct S { enum E { }; int E } s;
2657 is valid. In addition, the FIELD_DECLs must be maintained in
2658 declaration order so that class layout works as expected.
2659 However, we don't need that order until class layout, so we
2660 save a little time by putting FIELD_DECLs on in reverse order
2661 here, and then reversing them in finish_struct_1. (We could
2662 also keep a pointer to the correct insertion points in the
2665 if (TREE_CODE (decl) == TYPE_DECL)
2666 TYPE_FIELDS (current_class_type)
2667 = chainon (TYPE_FIELDS (current_class_type), decl);
2670 DECL_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2671 TYPE_FIELDS (current_class_type) = decl;
2674 maybe_add_class_template_decl_list (current_class_type, decl,
2679 note_decl_for_pch (decl);
2682 /* DECL has been declared while we are building a PCH file. Perform
2683 actions that we might normally undertake lazily, but which can be
2684 performed now so that they do not have to be performed in
2685 translation units which include the PCH file. */
2688 note_decl_for_pch (tree decl)
2690 gcc_assert (pch_file);
2692 /* There's a good chance that we'll have to mangle names at some
2693 point, even if only for emission in debugging information. */
2694 if ((TREE_CODE (decl) == VAR_DECL
2695 || TREE_CODE (decl) == FUNCTION_DECL)
2696 && !processing_template_decl)
2700 /* Finish processing a complete template declaration. The PARMS are
2701 the template parameters. */
2704 finish_template_decl (tree parms)
2707 end_template_decl ();
2709 end_specialization ();
2712 /* Finish processing a template-id (which names a type) of the form
2713 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2714 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2715 the scope of template-id indicated. */
2718 finish_template_type (tree name, tree args, int entering_scope)
2722 decl = lookup_template_class (name, args,
2723 NULL_TREE, NULL_TREE, entering_scope,
2724 tf_warning_or_error | tf_user);
2725 if (decl != error_mark_node)
2726 decl = TYPE_STUB_DECL (decl);
2731 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2732 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2733 BASE_CLASS, or NULL_TREE if an error occurred. The
2734 ACCESS_SPECIFIER is one of
2735 access_{default,public,protected_private}_node. For a virtual base
2736 we set TREE_TYPE. */
2739 finish_base_specifier (tree base, tree access, bool virtual_p)
2743 if (base == error_mark_node)
2745 error ("invalid base-class specification");
2748 else if (! MAYBE_CLASS_TYPE_P (base))
2750 error ("%qT is not a class type", base);
2755 if (cp_type_quals (base) != 0)
2757 error ("base class %qT has cv qualifiers", base);
2758 base = TYPE_MAIN_VARIANT (base);
2760 result = build_tree_list (access, base);
2762 TREE_TYPE (result) = integer_type_node;
2768 /* If FNS is a member function, a set of member functions, or a
2769 template-id referring to one or more member functions, return a
2770 BASELINK for FNS, incorporating the current access context.
2771 Otherwise, return FNS unchanged. */
2774 baselink_for_fns (tree fns)
2779 if (BASELINK_P (fns)
2780 || error_operand_p (fns))
2784 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2785 fn = TREE_OPERAND (fn, 0);
2786 fn = get_first_fn (fn);
2787 if (!DECL_FUNCTION_MEMBER_P (fn))
2790 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2792 cl = DECL_CONTEXT (fn);
2793 cl = TYPE_BINFO (cl);
2794 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2797 /* Returns true iff DECL is an automatic variable from a function outside
2801 outer_automatic_var_p (tree decl)
2803 return ((TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2804 && DECL_FUNCTION_SCOPE_P (decl)
2805 && !TREE_STATIC (decl)
2806 && DECL_CONTEXT (decl) != current_function_decl);
2809 /* Returns true iff DECL is a capture field from a lambda that is not our
2810 immediate context. */
2813 outer_lambda_capture_p (tree decl)
2815 return (TREE_CODE (decl) == FIELD_DECL
2816 && LAMBDA_TYPE_P (DECL_CONTEXT (decl))
2817 && (!current_class_type
2818 || !DERIVED_FROM_P (DECL_CONTEXT (decl), current_class_type)));
2821 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2822 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2823 if non-NULL, is the type or namespace used to explicitly qualify
2824 ID_EXPRESSION. DECL is the entity to which that name has been
2827 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2828 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2829 be set to true if this expression isn't permitted in a
2830 constant-expression, but it is otherwise not set by this function.
2831 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2832 constant-expression, but a non-constant expression is also
2835 DONE is true if this expression is a complete postfix-expression;
2836 it is false if this expression is followed by '->', '[', '(', etc.
2837 ADDRESS_P is true iff this expression is the operand of '&'.
2838 TEMPLATE_P is true iff the qualified-id was of the form
2839 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2840 appears as a template argument.
2842 If an error occurs, and it is the kind of error that might cause
2843 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2844 is the caller's responsibility to issue the message. *ERROR_MSG
2845 will be a string with static storage duration, so the caller need
2848 Return an expression for the entity, after issuing appropriate
2849 diagnostics. This function is also responsible for transforming a
2850 reference to a non-static member into a COMPONENT_REF that makes
2851 the use of "this" explicit.
2853 Upon return, *IDK will be filled in appropriately. */
2855 finish_id_expression (tree id_expression,
2859 bool integral_constant_expression_p,
2860 bool allow_non_integral_constant_expression_p,
2861 bool *non_integral_constant_expression_p,
2865 bool template_arg_p,
2866 const char **error_msg,
2867 location_t location)
2869 /* Initialize the output parameters. */
2870 *idk = CP_ID_KIND_NONE;
2873 if (id_expression == error_mark_node)
2874 return error_mark_node;
2875 /* If we have a template-id, then no further lookup is
2876 required. If the template-id was for a template-class, we
2877 will sometimes have a TYPE_DECL at this point. */
2878 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2879 || TREE_CODE (decl) == TYPE_DECL)
2881 /* Look up the name. */
2884 if (decl == error_mark_node)
2886 /* Name lookup failed. */
2889 || (!dependent_type_p (scope)
2890 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2891 && IDENTIFIER_TYPENAME_P (id_expression)
2892 && dependent_type_p (TREE_TYPE (id_expression))))))
2894 /* If the qualifying type is non-dependent (and the name
2895 does not name a conversion operator to a dependent
2896 type), issue an error. */
2897 qualified_name_lookup_error (scope, id_expression, decl, location);
2898 return error_mark_node;
2902 /* It may be resolved via Koenig lookup. */
2903 *idk = CP_ID_KIND_UNQUALIFIED;
2904 return id_expression;
2907 decl = id_expression;
2909 /* If DECL is a variable that would be out of scope under
2910 ANSI/ISO rules, but in scope in the ARM, name lookup
2911 will succeed. Issue a diagnostic here. */
2913 decl = check_for_out_of_scope_variable (decl);
2915 /* Remember that the name was used in the definition of
2916 the current class so that we can check later to see if
2917 the meaning would have been different after the class
2918 was entirely defined. */
2919 if (!scope && decl != error_mark_node
2920 && TREE_CODE (id_expression) == IDENTIFIER_NODE)
2921 maybe_note_name_used_in_class (id_expression, decl);
2923 /* Disallow uses of local variables from containing functions, except
2924 within lambda-expressions. */
2925 if ((outer_automatic_var_p (decl)
2926 || outer_lambda_capture_p (decl))
2927 /* It's not a use (3.2) if we're in an unevaluated context. */
2928 && !cp_unevaluated_operand)
2930 tree context = DECL_CONTEXT (decl);
2931 tree containing_function = current_function_decl;
2932 tree lambda_stack = NULL_TREE;
2933 tree lambda_expr = NULL_TREE;
2934 tree initializer = decl;
2936 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2937 support for an approach in which a reference to a local
2938 [constant] automatic variable in a nested class or lambda body
2939 would enter the expression as an rvalue, which would reduce
2940 the complexity of the problem"
2942 FIXME update for final resolution of core issue 696. */
2943 if (decl_constant_var_p (decl))
2944 return integral_constant_value (decl);
2946 if (TYPE_P (context))
2948 /* Implicit capture of an explicit capture. */
2949 context = lambda_function (context);
2950 initializer = thisify_lambda_field (decl);
2953 /* If we are in a lambda function, we can move out until we hit
2955 2. a non-lambda function, or
2956 3. a non-default capturing lambda function. */
2957 while (context != containing_function
2958 && LAMBDA_FUNCTION_P (containing_function))
2960 lambda_expr = CLASSTYPE_LAMBDA_EXPR
2961 (DECL_CONTEXT (containing_function));
2963 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr)
2967 lambda_stack = tree_cons (NULL_TREE,
2972 = decl_function_context (containing_function);
2975 if (context == containing_function)
2977 decl = add_default_capture (lambda_stack,
2978 /*id=*/DECL_NAME (decl),
2981 else if (lambda_expr)
2983 error ("%qD is not captured", decl);
2984 return error_mark_node;
2988 error (TREE_CODE (decl) == VAR_DECL
2989 ? "use of %<auto%> variable from containing function"
2990 : "use of parameter from containing function");
2991 error (" %q+#D declared here", decl);
2992 return error_mark_node;
2996 /* Also disallow uses of function parameters outside the function
2997 body, except inside an unevaluated context (i.e. decltype). */
2998 if (TREE_CODE (decl) == PARM_DECL
2999 && DECL_CONTEXT (decl) == NULL_TREE
3000 && !cp_unevaluated_operand)
3002 error ("use of parameter %qD outside function body", decl);
3003 return error_mark_node;
3007 /* If we didn't find anything, or what we found was a type,
3008 then this wasn't really an id-expression. */
3009 if (TREE_CODE (decl) == TEMPLATE_DECL
3010 && !DECL_FUNCTION_TEMPLATE_P (decl))
3012 *error_msg = "missing template arguments";
3013 return error_mark_node;
3015 else if (TREE_CODE (decl) == TYPE_DECL
3016 || TREE_CODE (decl) == NAMESPACE_DECL)
3018 *error_msg = "expected primary-expression";
3019 return error_mark_node;
3022 /* If the name resolved to a template parameter, there is no
3023 need to look it up again later. */
3024 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
3025 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
3029 *idk = CP_ID_KIND_NONE;
3030 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
3031 decl = TEMPLATE_PARM_DECL (decl);
3032 r = convert_from_reference (DECL_INITIAL (decl));
3034 if (integral_constant_expression_p
3035 && !dependent_type_p (TREE_TYPE (decl))
3036 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
3038 if (!allow_non_integral_constant_expression_p)
3039 error ("template parameter %qD of type %qT is not allowed in "
3040 "an integral constant expression because it is not of "
3041 "integral or enumeration type", decl, TREE_TYPE (decl));
3042 *non_integral_constant_expression_p = true;
3046 /* Similarly, we resolve enumeration constants to their
3047 underlying values. */
3048 else if (TREE_CODE (decl) == CONST_DECL)
3050 *idk = CP_ID_KIND_NONE;
3051 if (!processing_template_decl)
3053 used_types_insert (TREE_TYPE (decl));
3054 return DECL_INITIAL (decl);
3062 /* If the declaration was explicitly qualified indicate
3063 that. The semantics of `A::f(3)' are different than
3064 `f(3)' if `f' is virtual. */
3066 ? CP_ID_KIND_QUALIFIED
3067 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
3068 ? CP_ID_KIND_TEMPLATE_ID
3069 : CP_ID_KIND_UNQUALIFIED));
3074 An id-expression is type-dependent if it contains an
3075 identifier that was declared with a dependent type.
3077 The standard is not very specific about an id-expression that
3078 names a set of overloaded functions. What if some of them
3079 have dependent types and some of them do not? Presumably,
3080 such a name should be treated as a dependent name. */
3081 /* Assume the name is not dependent. */
3082 dependent_p = false;
3083 if (!processing_template_decl)
3084 /* No names are dependent outside a template. */
3086 /* A template-id where the name of the template was not resolved
3087 is definitely dependent. */
3088 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
3089 && (TREE_CODE (TREE_OPERAND (decl, 0))
3090 == IDENTIFIER_NODE))
3092 /* For anything except an overloaded function, just check its
3094 else if (!is_overloaded_fn (decl))
3096 = dependent_type_p (TREE_TYPE (decl));
3097 /* For a set of overloaded functions, check each of the
3103 if (BASELINK_P (fns))
3104 fns = BASELINK_FUNCTIONS (fns);
3106 /* For a template-id, check to see if the template
3107 arguments are dependent. */
3108 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
3110 tree args = TREE_OPERAND (fns, 1);
3111 dependent_p = any_dependent_template_arguments_p (args);
3112 /* The functions are those referred to by the
3114 fns = TREE_OPERAND (fns, 0);
3117 /* If there are no dependent template arguments, go through
3118 the overloaded functions. */
3119 while (fns && !dependent_p)
3121 tree fn = OVL_CURRENT (fns);
3123 /* Member functions of dependent classes are
3125 if (TREE_CODE (fn) == FUNCTION_DECL
3126 && type_dependent_expression_p (fn))
3128 else if (TREE_CODE (fn) == TEMPLATE_DECL
3129 && dependent_template_p (fn))
3132 fns = OVL_NEXT (fns);
3136 /* If the name was dependent on a template parameter, we will
3137 resolve the name at instantiation time. */
3140 /* Create a SCOPE_REF for qualified names, if the scope is
3146 if (address_p && done)
3147 decl = finish_qualified_id_expr (scope, decl,
3153 tree type = NULL_TREE;
3154 if (DECL_P (decl) && !dependent_scope_p (scope))
3155 type = TREE_TYPE (decl);
3156 decl = build_qualified_name (type,
3162 if (TREE_TYPE (decl))
3163 decl = convert_from_reference (decl);
3166 /* A TEMPLATE_ID already contains all the information we
3168 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
3169 return id_expression;
3170 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
3171 /* If we found a variable, then name lookup during the
3172 instantiation will always resolve to the same VAR_DECL
3173 (or an instantiation thereof). */
3174 if (TREE_CODE (decl) == VAR_DECL
3175 || TREE_CODE (decl) == PARM_DECL)
3176 return convert_from_reference (decl);
3177 /* The same is true for FIELD_DECL, but we also need to
3178 make sure that the syntax is correct. */
3179 else if (TREE_CODE (decl) == FIELD_DECL)
3181 /* Since SCOPE is NULL here, this is an unqualified name.
3182 Access checking has been performed during name lookup
3183 already. Turn off checking to avoid duplicate errors. */
3184 push_deferring_access_checks (dk_no_check);
3185 decl = finish_non_static_data_member
3187 /*qualifying_scope=*/NULL_TREE);
3188 pop_deferring_access_checks ();
3191 return id_expression;
3194 if (TREE_CODE (decl) == NAMESPACE_DECL)
3196 error ("use of namespace %qD as expression", decl);
3197 return error_mark_node;
3199 else if (DECL_CLASS_TEMPLATE_P (decl))
3201 error ("use of class template %qT as expression", decl);
3202 return error_mark_node;
3204 else if (TREE_CODE (decl) == TREE_LIST)
3206 /* Ambiguous reference to base members. */
3207 error ("request for member %qD is ambiguous in "
3208 "multiple inheritance lattice", id_expression);
3209 print_candidates (decl);
3210 return error_mark_node;
3213 /* Mark variable-like entities as used. Functions are similarly
3214 marked either below or after overload resolution. */
3215 if (TREE_CODE (decl) == VAR_DECL
3216 || TREE_CODE (decl) == PARM_DECL
3217 || TREE_CODE (decl) == RESULT_DECL)
3220 /* Only certain kinds of names are allowed in constant
3221 expression. Enumerators and template parameters have already
3222 been handled above. */
3223 if (! error_operand_p (decl)
3224 && integral_constant_expression_p
3225 && ! decl_constant_var_p (decl)
3226 && ! builtin_valid_in_constant_expr_p (decl))
3228 if (!allow_non_integral_constant_expression_p)
3230 error ("%qD cannot appear in a constant-expression", decl);
3231 return error_mark_node;
3233 *non_integral_constant_expression_p = true;
3238 decl = (adjust_result_of_qualified_name_lookup
3239 (decl, scope, current_class_type));
3241 if (TREE_CODE (decl) == FUNCTION_DECL)
3244 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
3245 decl = finish_qualified_id_expr (scope,
3253 tree r = convert_from_reference (decl);
3255 /* In a template, return a SCOPE_REF for most qualified-ids
3256 so that we can check access at instantiation time. But if
3257 we're looking at a member of the current instantiation, we
3258 know we have access and building up the SCOPE_REF confuses
3259 non-type template argument handling. */
3260 if (processing_template_decl && TYPE_P (scope)
3261 && !currently_open_class (scope))
3262 r = build_qualified_name (TREE_TYPE (r),
3268 else if (TREE_CODE (decl) == FIELD_DECL)
3270 /* Since SCOPE is NULL here, this is an unqualified name.
3271 Access checking has been performed during name lookup
3272 already. Turn off checking to avoid duplicate errors. */
3273 push_deferring_access_checks (dk_no_check);
3274 decl = finish_non_static_data_member (decl, NULL_TREE,
3275 /*qualifying_scope=*/NULL_TREE);
3276 pop_deferring_access_checks ();
3278 else if (is_overloaded_fn (decl))
3282 first_fn = get_first_fn (decl);
3283 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
3284 first_fn = DECL_TEMPLATE_RESULT (first_fn);
3286 if (!really_overloaded_fn (decl))
3287 mark_used (first_fn);
3290 && TREE_CODE (first_fn) == FUNCTION_DECL
3291 && DECL_FUNCTION_MEMBER_P (first_fn)
3292 && !shared_member_p (decl))
3294 /* A set of member functions. */
3295 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
3296 return finish_class_member_access_expr (decl, id_expression,
3297 /*template_p=*/false,
3298 tf_warning_or_error);
3301 decl = baselink_for_fns (decl);
3305 if (DECL_P (decl) && DECL_NONLOCAL (decl)
3306 && DECL_CLASS_SCOPE_P (decl))
3308 tree context = context_for_name_lookup (decl);
3309 if (context != current_class_type)
3311 tree path = currently_open_derived_class (context);
3312 perform_or_defer_access_check (TYPE_BINFO (path),
3317 decl = convert_from_reference (decl);
3321 if (TREE_DEPRECATED (decl))
3322 warn_deprecated_use (decl, NULL_TREE);
3327 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3328 use as a type-specifier. */
3331 finish_typeof (tree expr)
3335 if (type_dependent_expression_p (expr))
3337 type = cxx_make_type (TYPEOF_TYPE);
3338 TYPEOF_TYPE_EXPR (type) = expr;
3339 SET_TYPE_STRUCTURAL_EQUALITY (type);
3344 expr = mark_type_use (expr);
3346 type = unlowered_expr_type (expr);
3348 if (!type || type == unknown_type_node)
3350 error ("type of %qE is unknown", expr);
3351 return error_mark_node;
3357 /* Perform C++-specific checks for __builtin_offsetof before calling
3361 finish_offsetof (tree expr)
3363 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3365 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3366 TREE_OPERAND (expr, 2));
3367 return error_mark_node;
3369 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3370 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3371 || TREE_TYPE (expr) == unknown_type_node)
3373 if (TREE_CODE (expr) == COMPONENT_REF
3374 || TREE_CODE (expr) == COMPOUND_EXPR)
3375 expr = TREE_OPERAND (expr, 1);
3376 error ("cannot apply %<offsetof%> to member function %qD", expr);
3377 return error_mark_node;
3379 if (TREE_CODE (expr) == INDIRECT_REF && REFERENCE_REF_P (expr))
3380 expr = TREE_OPERAND (expr, 0);
3381 return fold_offsetof (expr, NULL_TREE);
3384 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3385 function is broken out from the above for the benefit of the tree-ssa
3389 simplify_aggr_init_expr (tree *tp)
3391 tree aggr_init_expr = *tp;
3393 /* Form an appropriate CALL_EXPR. */
3394 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3395 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3396 tree type = TREE_TYPE (slot);
3399 enum style_t { ctor, arg, pcc } style;
3401 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3403 #ifdef PCC_STATIC_STRUCT_RETURN
3409 gcc_assert (TREE_ADDRESSABLE (type));
3413 call_expr = build_call_array_loc (input_location,
3414 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3416 aggr_init_expr_nargs (aggr_init_expr),
3417 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3418 TREE_NOTHROW (call_expr) = TREE_NOTHROW (aggr_init_expr);
3422 /* Replace the first argument to the ctor with the address of the
3424 cxx_mark_addressable (slot);
3425 CALL_EXPR_ARG (call_expr, 0) =
3426 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3428 else if (style == arg)
3430 /* Just mark it addressable here, and leave the rest to
3431 expand_call{,_inline}. */
3432 cxx_mark_addressable (slot);
3433 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3434 call_expr = build2 (INIT_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3436 else if (style == pcc)
3438 /* If we're using the non-reentrant PCC calling convention, then we
3439 need to copy the returned value out of the static buffer into the
3441 push_deferring_access_checks (dk_no_check);
3442 call_expr = build_aggr_init (slot, call_expr,
3443 DIRECT_BIND | LOOKUP_ONLYCONVERTING,
3444 tf_warning_or_error);
3445 pop_deferring_access_checks ();
3446 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3449 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr))
3451 tree init = build_zero_init (type, NULL_TREE,
3452 /*static_storage_p=*/false);
3453 init = build2 (INIT_EXPR, void_type_node, slot, init);
3454 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (call_expr),
3461 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3464 emit_associated_thunks (tree fn)
3466 /* When we use vcall offsets, we emit thunks with the virtual
3467 functions to which they thunk. The whole point of vcall offsets
3468 is so that you can know statically the entire set of thunks that
3469 will ever be needed for a given virtual function, thereby
3470 enabling you to output all the thunks with the function itself. */
3471 if (DECL_VIRTUAL_P (fn)
3472 /* Do not emit thunks for extern template instantiations. */
3473 && ! DECL_REALLY_EXTERN (fn))
3477 for (thunk = DECL_THUNKS (fn); thunk; thunk = DECL_CHAIN (thunk))
3479 if (!THUNK_ALIAS (thunk))
3481 use_thunk (thunk, /*emit_p=*/1);
3482 if (DECL_RESULT_THUNK_P (thunk))
3486 for (probe = DECL_THUNKS (thunk);
3487 probe; probe = DECL_CHAIN (probe))
3488 use_thunk (probe, /*emit_p=*/1);
3492 gcc_assert (!DECL_THUNKS (thunk));
3497 /* Generate RTL for FN. */
3500 expand_or_defer_fn_1 (tree fn)
3502 /* When the parser calls us after finishing the body of a template
3503 function, we don't really want to expand the body. */
3504 if (processing_template_decl)
3506 /* Normally, collection only occurs in rest_of_compilation. So,
3507 if we don't collect here, we never collect junk generated
3508 during the processing of templates until we hit a
3509 non-template function. It's not safe to do this inside a
3510 nested class, though, as the parser may have local state that
3511 is not a GC root. */
3512 if (!function_depth)
3517 gcc_assert (DECL_SAVED_TREE (fn));
3519 /* If this is a constructor or destructor body, we have to clone
3521 if (maybe_clone_body (fn))
3523 /* We don't want to process FN again, so pretend we've written
3524 it out, even though we haven't. */
3525 TREE_ASM_WRITTEN (fn) = 1;
3526 DECL_SAVED_TREE (fn) = NULL_TREE;
3530 /* We make a decision about linkage for these functions at the end
3531 of the compilation. Until that point, we do not want the back
3532 end to output them -- but we do want it to see the bodies of
3533 these functions so that it can inline them as appropriate. */
3534 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3536 if (DECL_INTERFACE_KNOWN (fn))
3537 /* We've already made a decision as to how this function will
3541 DECL_EXTERNAL (fn) = 1;
3542 DECL_NOT_REALLY_EXTERN (fn) = 1;
3543 note_vague_linkage_fn (fn);
3544 /* A non-template inline function with external linkage will
3545 always be COMDAT. As we must eventually determine the
3546 linkage of all functions, and as that causes writes to
3547 the data mapped in from the PCH file, it's advantageous
3548 to mark the functions at this point. */
3549 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3551 /* This function must have external linkage, as
3552 otherwise DECL_INTERFACE_KNOWN would have been
3554 gcc_assert (TREE_PUBLIC (fn));
3555 comdat_linkage (fn);
3556 DECL_INTERFACE_KNOWN (fn) = 1;
3560 import_export_decl (fn);
3562 /* If the user wants us to keep all inline functions, then mark
3563 this function as needed so that finish_file will make sure to
3564 output it later. Similarly, all dllexport'd functions must
3565 be emitted; there may be callers in other DLLs. */
3566 if ((flag_keep_inline_functions
3567 && DECL_DECLARED_INLINE_P (fn)
3568 && !DECL_REALLY_EXTERN (fn))
3569 || (flag_keep_inline_dllexport
3570 && lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn))))
3574 /* There's no reason to do any of the work here if we're only doing
3575 semantic analysis; this code just generates RTL. */
3576 if (flag_syntax_only)
3583 expand_or_defer_fn (tree fn)
3585 if (expand_or_defer_fn_1 (fn))
3589 /* Expand or defer, at the whim of the compilation unit manager. */
3590 cgraph_finalize_function (fn, function_depth > 1);
3591 emit_associated_thunks (fn);
3604 /* Helper function for walk_tree, used by finalize_nrv below. */
3607 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3609 struct nrv_data *dp = (struct nrv_data *)data;
3612 /* No need to walk into types. There wouldn't be any need to walk into
3613 non-statements, except that we have to consider STMT_EXPRs. */
3616 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3617 but differs from using NULL_TREE in that it indicates that we care
3618 about the value of the RESULT_DECL. */
3619 else if (TREE_CODE (*tp) == RETURN_EXPR)
3620 TREE_OPERAND (*tp, 0) = dp->result;
3621 /* Change all cleanups for the NRV to only run when an exception is
3623 else if (TREE_CODE (*tp) == CLEANUP_STMT
3624 && CLEANUP_DECL (*tp) == dp->var)
3625 CLEANUP_EH_ONLY (*tp) = 1;
3626 /* Replace the DECL_EXPR for the NRV with an initialization of the
3627 RESULT_DECL, if needed. */
3628 else if (TREE_CODE (*tp) == DECL_EXPR
3629 && DECL_EXPR_DECL (*tp) == dp->var)
3632 if (DECL_INITIAL (dp->var)
3633 && DECL_INITIAL (dp->var) != error_mark_node)
3634 init = build2 (INIT_EXPR, void_type_node, dp->result,
3635 DECL_INITIAL (dp->var));
3637 init = build_empty_stmt (EXPR_LOCATION (*tp));
3638 DECL_INITIAL (dp->var) = NULL_TREE;
3639 SET_EXPR_LOCATION (init, EXPR_LOCATION (*tp));
3642 /* And replace all uses of the NRV with the RESULT_DECL. */
3643 else if (*tp == dp->var)
3646 /* Avoid walking into the same tree more than once. Unfortunately, we
3647 can't just use walk_tree_without duplicates because it would only call
3648 us for the first occurrence of dp->var in the function body. */
3649 slot = htab_find_slot (dp->visited, *tp, INSERT);
3655 /* Keep iterating. */
3659 /* Called from finish_function to implement the named return value
3660 optimization by overriding all the RETURN_EXPRs and pertinent
3661 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3662 RESULT_DECL for the function. */
3665 finalize_nrv (tree *tp, tree var, tree result)
3667 struct nrv_data data;
3669 /* Copy name from VAR to RESULT. */
3670 DECL_NAME (result) = DECL_NAME (var);
3671 /* Don't forget that we take its address. */
3672 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3673 /* Finally set DECL_VALUE_EXPR to avoid assigning
3674 a stack slot at -O0 for the original var and debug info
3675 uses RESULT location for VAR. */
3676 SET_DECL_VALUE_EXPR (var, result);
3677 DECL_HAS_VALUE_EXPR_P (var) = 1;
3680 data.result = result;
3681 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3682 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3683 htab_delete (data.visited);
3686 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3689 cxx_omp_create_clause_info (tree c, tree type, bool need_default_ctor,
3690 bool need_copy_ctor, bool need_copy_assignment)
3692 int save_errorcount = errorcount;
3695 /* Always allocate 3 elements for simplicity. These are the
3696 function decls for the ctor, dtor, and assignment op.
3697 This layout is known to the three lang hooks,
3698 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3699 and cxx_omp_clause_assign_op. */
3700 info = make_tree_vec (3);
3701 CP_OMP_CLAUSE_INFO (c) = info;
3703 if (need_default_ctor || need_copy_ctor)
3705 if (need_default_ctor)
3706 t = get_default_ctor (type);
3708 t = get_copy_ctor (type);
3710 if (t && !trivial_fn_p (t))
3711 TREE_VEC_ELT (info, 0) = t;
3714 if ((need_default_ctor || need_copy_ctor)
3715 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type))
3716 TREE_VEC_ELT (info, 1) = get_dtor (type);
3718 if (need_copy_assignment)
3720 t = get_copy_assign (type);
3722 if (t && !trivial_fn_p (t))
3723 TREE_VEC_ELT (info, 2) = t;
3726 return errorcount != save_errorcount;
3729 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3730 Remove any elements from the list that are invalid. */
3733 finish_omp_clauses (tree clauses)
3735 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3736 tree c, t, *pc = &clauses;
3739 bitmap_obstack_initialize (NULL);
3740 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3741 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3742 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3744 for (pc = &clauses, c = clauses; c ; c = *pc)
3746 bool remove = false;
3748 switch (OMP_CLAUSE_CODE (c))
3750 case OMP_CLAUSE_SHARED:
3752 goto check_dup_generic;
3753 case OMP_CLAUSE_PRIVATE:
3755 goto check_dup_generic;
3756 case OMP_CLAUSE_REDUCTION:
3758 goto check_dup_generic;
3759 case OMP_CLAUSE_COPYPRIVATE:
3760 name = "copyprivate";
3761 goto check_dup_generic;
3762 case OMP_CLAUSE_COPYIN:
3764 goto check_dup_generic;
3766 t = OMP_CLAUSE_DECL (c);
3767 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3769 if (processing_template_decl)
3772 error ("%qD is not a variable in clause %qs", t, name);
3774 error ("%qE is not a variable in clause %qs", t, name);
3777 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3778 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3779 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3781 error ("%qD appears more than once in data clauses", t);
3785 bitmap_set_bit (&generic_head, DECL_UID (t));
3788 case OMP_CLAUSE_FIRSTPRIVATE:
3789 t = OMP_CLAUSE_DECL (c);
3790 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3792 if (processing_template_decl)
3795 error ("%qD is not a variable in clause %<firstprivate%>", t);
3797 error ("%qE is not a variable in clause %<firstprivate%>", t);
3800 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3801 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3803 error ("%qD appears more than once in data clauses", t);
3807 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3810 case OMP_CLAUSE_LASTPRIVATE:
3811 t = OMP_CLAUSE_DECL (c);
3812 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3814 if (processing_template_decl)
3817 error ("%qD is not a variable in clause %<lastprivate%>", t);
3819 error ("%qE is not a variable in clause %<lastprivate%>", t);
3822 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3823 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3825 error ("%qD appears more than once in data clauses", t);
3829 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3833 t = OMP_CLAUSE_IF_EXPR (c);
3834 t = maybe_convert_cond (t);
3835 if (t == error_mark_node)
3837 OMP_CLAUSE_IF_EXPR (c) = t;
3840 case OMP_CLAUSE_NUM_THREADS:
3841 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3842 if (t == error_mark_node)
3844 else if (!type_dependent_expression_p (t)
3845 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3847 error ("num_threads expression must be integral");
3852 case OMP_CLAUSE_SCHEDULE:
3853 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3856 else if (t == error_mark_node)
3858 else if (!type_dependent_expression_p (t)
3859 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3861 error ("schedule chunk size expression must be integral");
3866 case OMP_CLAUSE_NOWAIT:
3867 case OMP_CLAUSE_ORDERED:
3868 case OMP_CLAUSE_DEFAULT:
3869 case OMP_CLAUSE_UNTIED:
3870 case OMP_CLAUSE_COLLAPSE:
3878 *pc = OMP_CLAUSE_CHAIN (c);
3880 pc = &OMP_CLAUSE_CHAIN (c);
3883 for (pc = &clauses, c = clauses; c ; c = *pc)
3885 enum omp_clause_code c_kind = OMP_CLAUSE_CODE (c);
3886 bool remove = false;
3887 bool need_complete_non_reference = false;
3888 bool need_default_ctor = false;
3889 bool need_copy_ctor = false;
3890 bool need_copy_assignment = false;
3891 bool need_implicitly_determined = false;
3892 tree type, inner_type;
3896 case OMP_CLAUSE_SHARED:
3898 need_implicitly_determined = true;
3900 case OMP_CLAUSE_PRIVATE:
3902 need_complete_non_reference = true;
3903 need_default_ctor = true;
3904 need_implicitly_determined = true;
3906 case OMP_CLAUSE_FIRSTPRIVATE:
3907 name = "firstprivate";
3908 need_complete_non_reference = true;
3909 need_copy_ctor = true;
3910 need_implicitly_determined = true;
3912 case OMP_CLAUSE_LASTPRIVATE:
3913 name = "lastprivate";
3914 need_complete_non_reference = true;
3915 need_copy_assignment = true;
3916 need_implicitly_determined = true;
3918 case OMP_CLAUSE_REDUCTION:
3920 need_implicitly_determined = true;
3922 case OMP_CLAUSE_COPYPRIVATE:
3923 name = "copyprivate";
3924 need_copy_assignment = true;
3926 case OMP_CLAUSE_COPYIN:
3928 need_copy_assignment = true;
3931 pc = &OMP_CLAUSE_CHAIN (c);
3935 t = OMP_CLAUSE_DECL (c);
3936 if (processing_template_decl
3937 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3939 pc = &OMP_CLAUSE_CHAIN (c);
3945 case OMP_CLAUSE_LASTPRIVATE:
3946 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3947 need_default_ctor = true;
3950 case OMP_CLAUSE_REDUCTION:
3951 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3952 || POINTER_TYPE_P (TREE_TYPE (t)))
3954 error ("%qE has invalid type for %<reduction%>", t);
3957 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3959 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3967 error ("%qE has invalid type for %<reduction(%s)%>",
3968 t, operator_name_info[r_code].name);
3974 case OMP_CLAUSE_COPYIN:
3975 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3977 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3986 if (need_complete_non_reference)
3988 t = require_complete_type (t);
3989 if (t == error_mark_node)
3991 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3993 error ("%qE has reference type for %qs", t, name);
3997 if (need_implicitly_determined)
3999 const char *share_name = NULL;
4001 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
4002 share_name = "threadprivate";
4003 else switch (cxx_omp_predetermined_sharing (t))
4005 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
4007 case OMP_CLAUSE_DEFAULT_SHARED:
4008 share_name = "shared";
4010 case OMP_CLAUSE_DEFAULT_PRIVATE:
4011 share_name = "private";
4018 error ("%qE is predetermined %qs for %qs",
4019 t, share_name, name);
4024 /* We're interested in the base element, not arrays. */
4025 inner_type = type = TREE_TYPE (t);
4026 while (TREE_CODE (inner_type) == ARRAY_TYPE)
4027 inner_type = TREE_TYPE (inner_type);
4029 /* Check for special function availability by building a call to one.
4030 Save the results, because later we won't be in the right context
4031 for making these queries. */
4032 if (CLASS_TYPE_P (inner_type)
4033 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
4034 && !type_dependent_expression_p (t)
4035 && cxx_omp_create_clause_info (c, inner_type, need_default_ctor,
4036 need_copy_ctor, need_copy_assignment))
4040 *pc = OMP_CLAUSE_CHAIN (c);
4042 pc = &OMP_CLAUSE_CHAIN (c);
4045 bitmap_obstack_release (NULL);
4049 /* For all variables in the tree_list VARS, mark them as thread local. */
4052 finish_omp_threadprivate (tree vars)
4056 /* Mark every variable in VARS to be assigned thread local storage. */
4057 for (t = vars; t; t = TREE_CHAIN (t))
4059 tree v = TREE_PURPOSE (t);
4061 if (error_operand_p (v))
4063 else if (TREE_CODE (v) != VAR_DECL)
4064 error ("%<threadprivate%> %qD is not file, namespace "
4065 "or block scope variable", v);
4066 /* If V had already been marked threadprivate, it doesn't matter
4067 whether it had been used prior to this point. */
4068 else if (TREE_USED (v)
4069 && (DECL_LANG_SPECIFIC (v) == NULL
4070 || !CP_DECL_THREADPRIVATE_P (v)))
4071 error ("%qE declared %<threadprivate%> after first use", v);
4072 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
4073 error ("automatic variable %qE cannot be %<threadprivate%>", v);
4074 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
4075 error ("%<threadprivate%> %qE has incomplete type", v);
4076 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v))
4077 && CP_DECL_CONTEXT (v) != current_class_type)
4078 error ("%<threadprivate%> %qE directive not "
4079 "in %qT definition", v, CP_DECL_CONTEXT (v));
4082 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4083 if (DECL_LANG_SPECIFIC (v) == NULL)
4085 retrofit_lang_decl (v);
4087 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4088 after the allocation of the lang_decl structure. */
4089 if (DECL_DISCRIMINATOR_P (v))
4090 DECL_LANG_SPECIFIC (v)->u.base.u2sel = 1;
4093 if (! DECL_THREAD_LOCAL_P (v))
4095 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
4096 /* If rtl has been already set for this var, call
4097 make_decl_rtl once again, so that encode_section_info
4098 has a chance to look at the new decl flags. */
4099 if (DECL_RTL_SET_P (v))
4102 CP_DECL_THREADPRIVATE_P (v) = 1;
4107 /* Build an OpenMP structured block. */
4110 begin_omp_structured_block (void)
4112 return do_pushlevel (sk_omp);
4116 finish_omp_structured_block (tree block)
4118 return do_poplevel (block);
4121 /* Similarly, except force the retention of the BLOCK. */
4124 begin_omp_parallel (void)
4126 keep_next_level (true);
4127 return begin_omp_structured_block ();
4131 finish_omp_parallel (tree clauses, tree body)
4135 body = finish_omp_structured_block (body);
4137 stmt = make_node (OMP_PARALLEL);
4138 TREE_TYPE (stmt) = void_type_node;
4139 OMP_PARALLEL_CLAUSES (stmt) = clauses;
4140 OMP_PARALLEL_BODY (stmt) = body;
4142 return add_stmt (stmt);
4146 begin_omp_task (void)
4148 keep_next_level (true);
4149 return begin_omp_structured_block ();
4153 finish_omp_task (tree clauses, tree body)
4157 body = finish_omp_structured_block (body);
4159 stmt = make_node (OMP_TASK);
4160 TREE_TYPE (stmt) = void_type_node;
4161 OMP_TASK_CLAUSES (stmt) = clauses;
4162 OMP_TASK_BODY (stmt) = body;
4164 return add_stmt (stmt);
4167 /* Helper function for finish_omp_for. Convert Ith random access iterator
4168 into integral iterator. Return FALSE if successful. */
4171 handle_omp_for_class_iterator (int i, location_t locus, tree declv, tree initv,
4172 tree condv, tree incrv, tree *body,
4173 tree *pre_body, tree clauses)
4175 tree diff, iter_init, iter_incr = NULL, last;
4176 tree incr_var = NULL, orig_pre_body, orig_body, c;
4177 tree decl = TREE_VEC_ELT (declv, i);
4178 tree init = TREE_VEC_ELT (initv, i);
4179 tree cond = TREE_VEC_ELT (condv, i);
4180 tree incr = TREE_VEC_ELT (incrv, i);
4182 location_t elocus = locus;
4184 if (init && EXPR_HAS_LOCATION (init))
4185 elocus = EXPR_LOCATION (init);
4187 switch (TREE_CODE (cond))
4193 if (TREE_OPERAND (cond, 1) == iter)
4194 cond = build2 (swap_tree_comparison (TREE_CODE (cond)),
4195 TREE_TYPE (cond), iter, TREE_OPERAND (cond, 0));
4196 if (TREE_OPERAND (cond, 0) != iter)
4197 cond = error_mark_node;
4200 tree tem = build_x_binary_op (TREE_CODE (cond), iter, ERROR_MARK,
4201 TREE_OPERAND (cond, 1), ERROR_MARK,
4202 NULL, tf_warning_or_error);
4203 if (error_operand_p (tem))
4208 cond = error_mark_node;
4211 if (cond == error_mark_node)
4213 error_at (elocus, "invalid controlling predicate");
4216 diff = build_x_binary_op (MINUS_EXPR, TREE_OPERAND (cond, 1),
4217 ERROR_MARK, iter, ERROR_MARK, NULL,
4218 tf_warning_or_error);
4219 if (error_operand_p (diff))
4221 if (TREE_CODE (TREE_TYPE (diff)) != INTEGER_TYPE)
4223 error_at (elocus, "difference between %qE and %qD does not have integer type",
4224 TREE_OPERAND (cond, 1), iter);
4228 switch (TREE_CODE (incr))
4230 case PREINCREMENT_EXPR:
4231 case PREDECREMENT_EXPR:
4232 case POSTINCREMENT_EXPR:
4233 case POSTDECREMENT_EXPR:
4234 if (TREE_OPERAND (incr, 0) != iter)
4236 incr = error_mark_node;
4239 iter_incr = build_x_unary_op (TREE_CODE (incr), iter,
4240 tf_warning_or_error);
4241 if (error_operand_p (iter_incr))
4243 else if (TREE_CODE (incr) == PREINCREMENT_EXPR
4244 || TREE_CODE (incr) == POSTINCREMENT_EXPR)
4245 incr = integer_one_node;
4247 incr = integer_minus_one_node;
4250 if (TREE_OPERAND (incr, 0) != iter)
4251 incr = error_mark_node;
4252 else if (TREE_CODE (TREE_OPERAND (incr, 1)) == PLUS_EXPR
4253 || TREE_CODE (TREE_OPERAND (incr, 1)) == MINUS_EXPR)
4255 tree rhs = TREE_OPERAND (incr, 1);
4256 if (TREE_OPERAND (rhs, 0) == iter)
4258 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 1)))
4260 incr = error_mark_node;
4263 iter_incr = build_x_modify_expr (iter, TREE_CODE (rhs),
4264 TREE_OPERAND (rhs, 1),
4265 tf_warning_or_error);
4266 if (error_operand_p (iter_incr))
4268 incr = TREE_OPERAND (rhs, 1);
4269 incr = cp_convert (TREE_TYPE (diff), incr);
4270 if (TREE_CODE (rhs) == MINUS_EXPR)
4272 incr = build1 (NEGATE_EXPR, TREE_TYPE (diff), incr);
4273 incr = fold_if_not_in_template (incr);
4275 if (TREE_CODE (incr) != INTEGER_CST
4276 && (TREE_CODE (incr) != NOP_EXPR
4277 || (TREE_CODE (TREE_OPERAND (incr, 0))
4282 else if (TREE_OPERAND (rhs, 1) == iter)
4284 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs, 0))) != INTEGER_TYPE
4285 || TREE_CODE (rhs) != PLUS_EXPR)
4286 incr = error_mark_node;
4289 iter_incr = build_x_binary_op (PLUS_EXPR,
4290 TREE_OPERAND (rhs, 0),
4293 tf_warning_or_error);
4294 if (error_operand_p (iter_incr))
4296 iter_incr = build_x_modify_expr (iter, NOP_EXPR,
4298 tf_warning_or_error);
4299 if (error_operand_p (iter_incr))
4301 incr = TREE_OPERAND (rhs, 0);
4306 incr = error_mark_node;
4309 incr = error_mark_node;
4312 incr = error_mark_node;
4316 if (incr == error_mark_node)
4318 error_at (elocus, "invalid increment expression");
4322 incr = cp_convert (TREE_TYPE (diff), incr);
4323 for (c = clauses; c ; c = OMP_CLAUSE_CHAIN (c))
4324 if (OMP_CLAUSE_CODE (c) == OMP_CLAUSE_LASTPRIVATE
4325 && OMP_CLAUSE_DECL (c) == iter)
4328 decl = create_temporary_var (TREE_TYPE (diff));
4330 add_decl_expr (decl);
4331 last = create_temporary_var (TREE_TYPE (diff));
4333 add_decl_expr (last);
4334 if (c && iter_incr == NULL)
4336 incr_var = create_temporary_var (TREE_TYPE (diff));
4337 pushdecl (incr_var);
4338 add_decl_expr (incr_var);
4340 gcc_assert (stmts_are_full_exprs_p ());
4342 orig_pre_body = *pre_body;
4343 *pre_body = push_stmt_list ();
4345 add_stmt (orig_pre_body);
4347 finish_expr_stmt (build_x_modify_expr (iter, NOP_EXPR, init,
4348 tf_warning_or_error));
4349 init = build_int_cst (TREE_TYPE (diff), 0);
4350 if (c && iter_incr == NULL)
4352 finish_expr_stmt (build_x_modify_expr (incr_var, NOP_EXPR,
4353 incr, tf_warning_or_error));
4355 iter_incr = build_x_modify_expr (iter, PLUS_EXPR, incr,
4356 tf_warning_or_error);
4358 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, init,
4359 tf_warning_or_error));
4360 *pre_body = pop_stmt_list (*pre_body);
4362 cond = cp_build_binary_op (elocus,
4363 TREE_CODE (cond), decl, diff,
4364 tf_warning_or_error);
4365 incr = build_modify_expr (elocus, decl, NULL_TREE, PLUS_EXPR,
4366 elocus, incr, NULL_TREE);
4369 *body = push_stmt_list ();
4370 iter_init = build2 (MINUS_EXPR, TREE_TYPE (diff), decl, last);
4371 iter_init = build_x_modify_expr (iter, PLUS_EXPR, iter_init,
4372 tf_warning_or_error);
4373 iter_init = build1 (NOP_EXPR, void_type_node, iter_init);
4374 finish_expr_stmt (iter_init);
4375 finish_expr_stmt (build_x_modify_expr (last, NOP_EXPR, decl,
4376 tf_warning_or_error));
4377 add_stmt (orig_body);
4378 *body = pop_stmt_list (*body);
4382 OMP_CLAUSE_LASTPRIVATE_STMT (c) = push_stmt_list ();
4383 finish_expr_stmt (iter_incr);
4384 OMP_CLAUSE_LASTPRIVATE_STMT (c)
4385 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c));
4388 TREE_VEC_ELT (declv, i) = decl;
4389 TREE_VEC_ELT (initv, i) = init;
4390 TREE_VEC_ELT (condv, i) = cond;
4391 TREE_VEC_ELT (incrv, i) = incr;
4396 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4397 are directly for their associated operands in the statement. DECL
4398 and INIT are a combo; if DECL is NULL then INIT ought to be a
4399 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4400 optional statements that need to go before the loop into its
4404 finish_omp_for (location_t locus, tree declv, tree initv, tree condv,
4405 tree incrv, tree body, tree pre_body, tree clauses)
4407 tree omp_for = NULL, orig_incr = NULL;
4408 tree decl, init, cond, incr;
4412 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (initv));
4413 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (condv));
4414 gcc_assert (TREE_VEC_LENGTH (declv) == TREE_VEC_LENGTH (incrv));
4415 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4417 decl = TREE_VEC_ELT (declv, i);
4418 init = TREE_VEC_ELT (initv, i);
4419 cond = TREE_VEC_ELT (condv, i);
4420 incr = TREE_VEC_ELT (incrv, i);
4426 switch (TREE_CODE (init))
4429 decl = TREE_OPERAND (init, 0);
4430 init = TREE_OPERAND (init, 1);
4433 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
4435 decl = TREE_OPERAND (init, 0);
4436 init = TREE_OPERAND (init, 2);
4446 "expected iteration declaration or initialization");
4451 if (init && EXPR_HAS_LOCATION (init))
4452 elocus = EXPR_LOCATION (init);
4456 error_at (elocus, "missing controlling predicate");
4462 error_at (elocus, "missing increment expression");
4466 TREE_VEC_ELT (declv, i) = decl;
4467 TREE_VEC_ELT (initv, i) = init;
4470 if (dependent_omp_for_p (declv, initv, condv, incrv))
4474 stmt = make_node (OMP_FOR);
4476 for (i = 0; i < TREE_VEC_LENGTH (declv); i++)
4478 /* This is really just a place-holder. We'll be decomposing this
4479 again and going through the cp_build_modify_expr path below when
4480 we instantiate the thing. */
4481 TREE_VEC_ELT (initv, i)
4482 = build2 (MODIFY_EXPR, void_type_node, TREE_VEC_ELT (declv, i),
4483 TREE_VEC_ELT (initv, i));
4486 TREE_TYPE (stmt) = void_type_node;
4487 OMP_FOR_INIT (stmt) = initv;
4488 OMP_FOR_COND (stmt) = condv;
4489 OMP_FOR_INCR (stmt) = incrv;
4490 OMP_FOR_BODY (stmt) = body;
4491 OMP_FOR_PRE_BODY (stmt) = pre_body;
4492 OMP_FOR_CLAUSES (stmt) = clauses;
4494 SET_EXPR_LOCATION (stmt, locus);
4495 return add_stmt (stmt);
4498 if (processing_template_decl)
4499 orig_incr = make_tree_vec (TREE_VEC_LENGTH (incrv));
4501 for (i = 0; i < TREE_VEC_LENGTH (declv); )
4503 decl = TREE_VEC_ELT (declv, i);
4504 init = TREE_VEC_ELT (initv, i);
4505 cond = TREE_VEC_ELT (condv, i);
4506 incr = TREE_VEC_ELT (incrv, i);
4508 TREE_VEC_ELT (orig_incr, i) = incr;
4511 if (init && EXPR_HAS_LOCATION (init))
4512 elocus = EXPR_LOCATION (init);
4516 error_at (elocus, "expected iteration declaration or initialization");
4520 if (incr && TREE_CODE (incr) == MODOP_EXPR)
4523 TREE_VEC_ELT (orig_incr, i) = incr;
4524 incr = cp_build_modify_expr (TREE_OPERAND (incr, 0),
4525 TREE_CODE (TREE_OPERAND (incr, 1)),
4526 TREE_OPERAND (incr, 2),
4527 tf_warning_or_error);
4530 if (CLASS_TYPE_P (TREE_TYPE (decl)))
4532 if (handle_omp_for_class_iterator (i, locus, declv, initv, condv,
4533 incrv, &body, &pre_body, clauses))
4538 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl))
4539 && TREE_CODE (TREE_TYPE (decl)) != POINTER_TYPE)
4541 error_at (elocus, "invalid type for iteration variable %qE", decl);
4545 if (!processing_template_decl)
4547 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
4548 init = cp_build_modify_expr (decl, NOP_EXPR, init, tf_warning_or_error);
4551 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
4553 && TREE_SIDE_EFFECTS (cond)
4554 && COMPARISON_CLASS_P (cond)
4555 && !processing_template_decl)
4557 tree t = TREE_OPERAND (cond, 0);
4558 if (TREE_SIDE_EFFECTS (t)
4560 && (TREE_CODE (t) != NOP_EXPR
4561 || TREE_OPERAND (t, 0) != decl))
4562 TREE_OPERAND (cond, 0)
4563 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4565 t = TREE_OPERAND (cond, 1);
4566 if (TREE_SIDE_EFFECTS (t)
4568 && (TREE_CODE (t) != NOP_EXPR
4569 || TREE_OPERAND (t, 0) != decl))
4570 TREE_OPERAND (cond, 1)
4571 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4573 if (decl == error_mark_node || init == error_mark_node)
4576 TREE_VEC_ELT (declv, i) = decl;
4577 TREE_VEC_ELT (initv, i) = init;
4578 TREE_VEC_ELT (condv, i) = cond;
4579 TREE_VEC_ELT (incrv, i) = incr;
4583 if (IS_EMPTY_STMT (pre_body))
4586 omp_for = c_finish_omp_for (locus, declv, initv, condv, incrv,
4589 if (omp_for == NULL)
4592 for (i = 0; i < TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for)); i++)
4594 decl = TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for), i), 0);
4595 incr = TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i);
4597 if (TREE_CODE (incr) != MODIFY_EXPR)
4600 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr, 1))
4601 && BINARY_CLASS_P (TREE_OPERAND (incr, 1))
4602 && !processing_template_decl)
4604 tree t = TREE_OPERAND (TREE_OPERAND (incr, 1), 0);
4605 if (TREE_SIDE_EFFECTS (t)
4607 && (TREE_CODE (t) != NOP_EXPR
4608 || TREE_OPERAND (t, 0) != decl))
4609 TREE_OPERAND (TREE_OPERAND (incr, 1), 0)
4610 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4612 t = TREE_OPERAND (TREE_OPERAND (incr, 1), 1);
4613 if (TREE_SIDE_EFFECTS (t)
4615 && (TREE_CODE (t) != NOP_EXPR
4616 || TREE_OPERAND (t, 0) != decl))
4617 TREE_OPERAND (TREE_OPERAND (incr, 1), 1)
4618 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
4622 TREE_VEC_ELT (OMP_FOR_INCR (omp_for), i) = TREE_VEC_ELT (orig_incr, i);
4624 if (omp_for != NULL)
4625 OMP_FOR_CLAUSES (omp_for) = clauses;
4630 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
4639 dependent_p = false;
4642 /* Even in a template, we can detect invalid uses of the atomic
4643 pragma if neither LHS nor RHS is type-dependent. */
4644 if (processing_template_decl)
4646 dependent_p = (type_dependent_expression_p (lhs)
4647 || type_dependent_expression_p (rhs));
4650 lhs = build_non_dependent_expr (lhs);
4651 rhs = build_non_dependent_expr (rhs);
4656 stmt = c_finish_omp_atomic (input_location, code, lhs, rhs);
4657 if (stmt == error_mark_node)
4660 if (processing_template_decl)
4661 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
4662 build2 (code, void_type_node, orig_lhs, orig_rhs));
4667 finish_omp_barrier (void)
4669 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
4670 VEC(tree,gc) *vec = make_tree_vector ();
4671 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4672 release_tree_vector (vec);
4673 finish_expr_stmt (stmt);
4677 finish_omp_flush (void)
4679 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
4680 VEC(tree,gc) *vec = make_tree_vector ();
4681 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4682 release_tree_vector (vec);
4683 finish_expr_stmt (stmt);
4687 finish_omp_taskwait (void)
4689 tree fn = built_in_decls[BUILT_IN_GOMP_TASKWAIT];
4690 VEC(tree,gc) *vec = make_tree_vector ();
4691 tree stmt = finish_call_expr (fn, &vec, false, false, tf_warning_or_error);
4692 release_tree_vector (vec);
4693 finish_expr_stmt (stmt);
4697 init_cp_semantics (void)
4701 /* Build a STATIC_ASSERT for a static assertion with the condition
4702 CONDITION and the message text MESSAGE. LOCATION is the location
4703 of the static assertion in the source code. When MEMBER_P, this
4704 static assertion is a member of a class. */
4706 finish_static_assert (tree condition, tree message, location_t location,
4709 if (check_for_bare_parameter_packs (condition))
4710 condition = error_mark_node;
4712 if (type_dependent_expression_p (condition)
4713 || value_dependent_expression_p (condition))
4715 /* We're in a template; build a STATIC_ASSERT and put it in
4719 assertion = make_node (STATIC_ASSERT);
4720 STATIC_ASSERT_CONDITION (assertion) = condition;
4721 STATIC_ASSERT_MESSAGE (assertion) = message;
4722 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4725 maybe_add_class_template_decl_list (current_class_type,
4729 add_stmt (assertion);
4734 /* Fold the expression and convert it to a boolean value. */
4735 condition = fold_non_dependent_expr (condition);
4736 condition = cp_convert (boolean_type_node, condition);
4737 condition = maybe_constant_value (condition);
4739 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4740 /* Do nothing; the condition is satisfied. */
4744 location_t saved_loc = input_location;
4746 input_location = location;
4747 if (TREE_CODE (condition) == INTEGER_CST
4748 && integer_zerop (condition))
4749 /* Report the error. */
4750 error ("static assertion failed: %E", message);
4751 else if (condition && condition != error_mark_node)
4753 error ("non-constant condition for static assertion");
4754 cxx_constant_value (condition);
4756 input_location = saved_loc;
4760 /* Returns the type of EXPR for cases where we can determine it even though
4761 EXPR is a type-dependent expression. */
4764 describable_type (tree expr)
4766 tree type = NULL_TREE;
4768 if (! type_dependent_expression_p (expr)
4769 && ! type_unknown_p (expr))
4771 type = unlowered_expr_type (expr);
4772 if (real_lvalue_p (expr))
4773 type = build_reference_type (type);
4779 switch (TREE_CODE (expr))
4785 return TREE_TYPE (expr);
4790 case TEMPLATE_PARM_INDEX:
4792 case STATIC_CAST_EXPR:
4793 case REINTERPRET_CAST_EXPR:
4794 case CONST_CAST_EXPR:
4795 case DYNAMIC_CAST_EXPR:
4796 type = TREE_TYPE (expr);
4801 tree ptrtype = describable_type (TREE_OPERAND (expr, 0));
4802 if (ptrtype && POINTER_TYPE_P (ptrtype))
4803 type = build_reference_type (TREE_TYPE (ptrtype));
4808 if (TREE_CODE_CLASS (TREE_CODE (expr)) == tcc_constant)
4809 type = TREE_TYPE (expr);
4813 if (type && type_uses_auto (type))
4819 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4820 suitable for use as a type-specifier.
4822 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4823 id-expression or a class member access, FALSE when it was parsed as
4824 a full expression. */
4827 finish_decltype_type (tree expr, bool id_expression_or_member_access_p,
4828 tsubst_flags_t complain)
4830 tree type = NULL_TREE;
4832 if (!expr || error_operand_p (expr))
4833 return error_mark_node;
4836 || TREE_CODE (expr) == TYPE_DECL
4837 || (TREE_CODE (expr) == BIT_NOT_EXPR
4838 && TYPE_P (TREE_OPERAND (expr, 0))))
4840 if (complain & tf_error)
4841 error ("argument to decltype must be an expression");
4842 return error_mark_node;
4845 /* FIXME instantiation-dependent */
4846 if (type_dependent_expression_p (expr)
4847 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
4848 if it isn't dependent, so that we can check access control at
4849 instantiation time, so defer the decltype as well (PR 42277). */
4850 || (id_expression_or_member_access_p
4851 && processing_template_decl
4852 && TREE_CODE (expr) == COMPONENT_REF))
4854 type = cxx_make_type (DECLTYPE_TYPE);
4855 DECLTYPE_TYPE_EXPR (type) = expr;
4856 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4857 = id_expression_or_member_access_p;
4858 SET_TYPE_STRUCTURAL_EQUALITY (type);
4863 /* The type denoted by decltype(e) is defined as follows: */
4865 expr = resolve_nondeduced_context (expr);
4867 if (type_unknown_p (expr))
4869 if (complain & tf_error)
4870 error ("decltype cannot resolve address of overloaded function");
4871 return error_mark_node;
4874 /* To get the size of a static data member declared as an array of
4875 unknown bound, we need to instantiate it. */
4876 if (TREE_CODE (expr) == VAR_DECL
4877 && VAR_HAD_UNKNOWN_BOUND (expr)
4878 && DECL_TEMPLATE_INSTANTIATION (expr))
4879 instantiate_decl (expr, /*defer_ok*/true, /*expl_inst_mem*/false);
4881 if (id_expression_or_member_access_p)
4883 /* If e is an id-expression or a class member access (5.2.5
4884 [expr.ref]), decltype(e) is defined as the type of the entity
4885 named by e. If there is no such entity, or e names a set of
4886 overloaded functions, the program is ill-formed. */
4887 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4888 expr = lookup_name (expr);
4890 if (TREE_CODE (expr) == INDIRECT_REF)
4891 /* This can happen when the expression is, e.g., "a.b". Just
4892 look at the underlying operand. */
4893 expr = TREE_OPERAND (expr, 0);
4895 if (TREE_CODE (expr) == OFFSET_REF
4896 || TREE_CODE (expr) == MEMBER_REF)
4897 /* We're only interested in the field itself. If it is a
4898 BASELINK, we will need to see through it in the next
4900 expr = TREE_OPERAND (expr, 1);
4902 if (TREE_CODE (expr) == BASELINK)
4903 /* See through BASELINK nodes to the underlying function. */
4904 expr = BASELINK_FUNCTIONS (expr);
4906 switch (TREE_CODE (expr))
4909 if (DECL_BIT_FIELD_TYPE (expr))
4911 type = DECL_BIT_FIELD_TYPE (expr);
4914 /* Fall through for fields that aren't bitfields. */
4921 case TEMPLATE_PARM_INDEX:
4922 expr = mark_type_use (expr);
4923 type = TREE_TYPE (expr);
4927 type = error_mark_node;
4931 mark_type_use (expr);
4932 type = is_bitfield_expr_with_lowered_type (expr);
4934 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4941 /* We can get here when the id-expression refers to an
4943 type = TREE_TYPE (expr);
4948 return error_mark_node;
4953 /* Within a lambda-expression:
4955 Every occurrence of decltype((x)) where x is a possibly
4956 parenthesized id-expression that names an entity of
4957 automatic storage duration is treated as if x were
4958 transformed into an access to a corresponding data member
4959 of the closure type that would have been declared if x
4960 were a use of the denoted entity. */
4961 if (outer_automatic_var_p (expr)
4962 && current_function_decl
4963 && LAMBDA_FUNCTION_P (current_function_decl))
4964 type = capture_decltype (expr);
4965 else if (error_operand_p (expr))
4966 type = error_mark_node;
4967 else if (expr == current_class_ptr)
4968 /* If the expression is just "this", we want the
4969 cv-unqualified pointer for the "this" type. */
4970 type = TYPE_MAIN_VARIANT (TREE_TYPE (expr));
4973 /* Otherwise, where T is the type of e, if e is an lvalue,
4974 decltype(e) is defined as T&; if an xvalue, T&&; otherwise, T. */
4975 cp_lvalue_kind clk = lvalue_kind (expr);
4976 type = unlowered_expr_type (expr);
4977 gcc_assert (TREE_CODE (type) != REFERENCE_TYPE);
4978 if (clk != clk_none && !(clk & clk_class))
4979 type = cp_build_reference_type (type, (clk & clk_rvalueref));
4986 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4987 __has_nothrow_copy, depending on assign_p. */
4990 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
4997 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
5000 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
5002 else if (TYPE_HAS_COPY_CTOR (type))
5004 /* If construction of the copy constructor was postponed, create
5006 if (CLASSTYPE_LAZY_COPY_CTOR (type))
5007 lazily_declare_fn (sfk_copy_constructor, type);
5008 if (CLASSTYPE_LAZY_MOVE_CTOR (type))
5009 lazily_declare_fn (sfk_move_constructor, type);
5010 fns = CLASSTYPE_CONSTRUCTORS (type);
5015 for (; fns; fns = OVL_NEXT (fns))
5017 tree fn = OVL_CURRENT (fns);
5021 if (copy_fn_p (fn) == 0)
5024 else if (copy_fn_p (fn) <= 0)
5027 if (!TYPE_NOTHROW_P (TREE_TYPE (fn)))
5034 /* Actually evaluates the trait. */
5037 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
5039 enum tree_code type_code1;
5042 type_code1 = TREE_CODE (type1);
5046 case CPTK_HAS_NOTHROW_ASSIGN:
5047 type1 = strip_array_types (type1);
5048 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5049 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
5050 || (CLASS_TYPE_P (type1)
5051 && classtype_has_nothrow_assign_or_copy_p (type1,
5054 case CPTK_HAS_TRIVIAL_ASSIGN:
5055 /* ??? The standard seems to be missing the "or array of such a class
5056 type" wording for this trait. */
5057 type1 = strip_array_types (type1);
5058 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
5059 && (trivial_type_p (type1)
5060 || (CLASS_TYPE_P (type1)
5061 && TYPE_HAS_TRIVIAL_COPY_ASSIGN (type1))));
5063 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5064 type1 = strip_array_types (type1);
5065 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
5066 || (CLASS_TYPE_P (type1)
5067 && (t = locate_ctor (type1))
5068 && TYPE_NOTHROW_P (TREE_TYPE (t))));
5070 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5071 type1 = strip_array_types (type1);
5072 return (trivial_type_p (type1)
5073 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
5075 case CPTK_HAS_NOTHROW_COPY:
5076 type1 = strip_array_types (type1);
5077 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
5078 || (CLASS_TYPE_P (type1)
5079 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
5081 case CPTK_HAS_TRIVIAL_COPY:
5082 /* ??? The standard seems to be missing the "or array of such a class
5083 type" wording for this trait. */
5084 type1 = strip_array_types (type1);
5085 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5086 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_COPY_CTOR (type1)));
5088 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5089 type1 = strip_array_types (type1);
5090 return (trivial_type_p (type1) || type_code1 == REFERENCE_TYPE
5091 || (CLASS_TYPE_P (type1)
5092 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
5094 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5095 return type_has_virtual_destructor (type1);
5097 case CPTK_IS_ABSTRACT:
5098 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
5100 case CPTK_IS_BASE_OF:
5101 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5102 && DERIVED_FROM_P (type1, type2));
5105 return (NON_UNION_CLASS_TYPE_P (type1));
5107 case CPTK_IS_CONVERTIBLE_TO:
5112 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
5115 return (type_code1 == ENUMERAL_TYPE);
5118 return (pod_type_p (type1));
5120 case CPTK_IS_POLYMORPHIC:
5121 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
5123 case CPTK_IS_STD_LAYOUT:
5124 return (std_layout_type_p (type1));
5126 case CPTK_IS_TRIVIAL:
5127 return (trivial_type_p (type1));
5130 return (type_code1 == UNION_TYPE);
5132 case CPTK_IS_LITERAL_TYPE:
5133 return (literal_type_p (type1));
5141 /* Returns true if TYPE is a complete type, an array of unknown bound,
5142 or (possibly cv-qualified) void, returns false otherwise. */
5145 check_trait_type (tree type)
5147 if (COMPLETE_TYPE_P (type))
5150 if (TREE_CODE (type) == ARRAY_TYPE && !TYPE_DOMAIN (type)
5151 && COMPLETE_TYPE_P (TREE_TYPE (type)))
5154 if (VOID_TYPE_P (type))
5160 /* Process a trait expression. */
5163 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
5165 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
5166 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
5167 || kind == CPTK_HAS_NOTHROW_COPY
5168 || kind == CPTK_HAS_TRIVIAL_ASSIGN
5169 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
5170 || kind == CPTK_HAS_TRIVIAL_COPY
5171 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
5172 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
5173 || kind == CPTK_IS_ABSTRACT
5174 || kind == CPTK_IS_BASE_OF
5175 || kind == CPTK_IS_CLASS
5176 || kind == CPTK_IS_CONVERTIBLE_TO
5177 || kind == CPTK_IS_EMPTY
5178 || kind == CPTK_IS_ENUM
5179 || kind == CPTK_IS_POD
5180 || kind == CPTK_IS_POLYMORPHIC
5181 || kind == CPTK_IS_STD_LAYOUT
5182 || kind == CPTK_IS_TRIVIAL
5183 || kind == CPTK_IS_LITERAL_TYPE
5184 || kind == CPTK_IS_UNION);
5186 if (kind == CPTK_IS_CONVERTIBLE_TO)
5188 sorry ("__is_convertible_to");
5189 return error_mark_node;
5192 if (type1 == error_mark_node
5193 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
5194 && type2 == error_mark_node))
5195 return error_mark_node;
5197 if (processing_template_decl)
5199 tree trait_expr = make_node (TRAIT_EXPR);
5200 TREE_TYPE (trait_expr) = boolean_type_node;
5201 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
5202 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
5203 TRAIT_EXPR_KIND (trait_expr) = kind;
5207 complete_type (type1);
5209 complete_type (type2);
5213 case CPTK_HAS_NOTHROW_ASSIGN:
5214 case CPTK_HAS_TRIVIAL_ASSIGN:
5215 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
5216 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
5217 case CPTK_HAS_NOTHROW_COPY:
5218 case CPTK_HAS_TRIVIAL_COPY:
5219 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
5220 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
5221 case CPTK_IS_ABSTRACT:
5224 case CPTK_IS_POLYMORPHIC:
5225 case CPTK_IS_STD_LAYOUT:
5226 case CPTK_IS_TRIVIAL:
5227 case CPTK_IS_LITERAL_TYPE:
5228 if (!check_trait_type (type1))
5230 error ("incomplete type %qT not allowed", type1);
5231 return error_mark_node;
5235 case CPTK_IS_BASE_OF:
5236 if (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
5237 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
5238 && !COMPLETE_TYPE_P (type2))
5240 error ("incomplete type %qT not allowed", type2);
5241 return error_mark_node;
5250 case CPTK_IS_CONVERTIBLE_TO:
5255 return (trait_expr_value (kind, type1, type2)
5256 ? boolean_true_node : boolean_false_node);
5259 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5260 which is ignored for C++. */
5263 set_float_const_decimal64 (void)
5268 clear_float_const_decimal64 (void)
5273 float_const_decimal64_p (void)
5279 /* Return true if T is a literal type. */
5282 literal_type_p (tree t)
5284 if (SCALAR_TYPE_P (t))
5286 if (CLASS_TYPE_P (t))
5287 return CLASSTYPE_LITERAL_P (t);
5288 if (TREE_CODE (t) == ARRAY_TYPE)
5289 return literal_type_p (strip_array_types (t));
5293 /* If DECL is a variable declared `constexpr', require its type
5294 be literal. Return the DECL if OK, otherwise NULL. */
5297 ensure_literal_type_for_constexpr_object (tree decl)
5299 tree type = TREE_TYPE (decl);
5300 if (TREE_CODE (decl) == VAR_DECL && DECL_DECLARED_CONSTEXPR_P (decl)
5301 && !processing_template_decl
5302 /* The call to complete_type is just for initializer_list. */
5303 && !literal_type_p (complete_type (type)))
5305 error ("the type %qT of constexpr variable %qD is not literal",
5312 /* Representation of entries in the constexpr function definition table. */
5314 typedef struct GTY(()) constexpr_fundef {
5319 /* This table holds all constexpr function definitions seen in
5320 the current translation unit. */
5322 static GTY ((param_is (constexpr_fundef))) htab_t constexpr_fundef_table;
5324 /* Utility function used for managing the constexpr function table.
5325 Return true if the entries pointed to by P and Q are for the
5326 same constexpr function. */
5329 constexpr_fundef_equal (const void *p, const void *q)
5331 const constexpr_fundef *lhs = (const constexpr_fundef *) p;
5332 const constexpr_fundef *rhs = (const constexpr_fundef *) q;
5333 return lhs->decl == rhs->decl;
5336 /* Utility function used for managing the constexpr function table.
5337 Return a hash value for the entry pointed to by Q. */
5339 static inline hashval_t
5340 constexpr_fundef_hash (const void *p)
5342 const constexpr_fundef *fundef = (const constexpr_fundef *) p;
5343 return DECL_UID (fundef->decl);
5346 /* Return a previously saved definition of function FUN. */
5348 static constexpr_fundef *
5349 retrieve_constexpr_fundef (tree fun)
5351 constexpr_fundef fundef = { NULL, NULL };
5352 if (constexpr_fundef_table == NULL)
5356 return (constexpr_fundef *) htab_find (constexpr_fundef_table, &fundef);
5359 /* Return true if type expression T is a valid parameter type, or
5360 a valid return type, of a constexpr function. */
5363 valid_type_in_constexpr_fundecl_p (tree t)
5365 return (literal_type_p (t)
5366 /* FIXME we allow ref to non-literal; should change standard to
5367 match, or change back if not. */
5368 || TREE_CODE (t) == REFERENCE_TYPE);
5371 /* Check whether the parameter and return types of FUN are valid for a
5372 constexpr function, and complain if COMPLAIN. */
5375 is_valid_constexpr_fn (tree fun, bool complain)
5377 tree parm = FUNCTION_FIRST_USER_PARM (fun);
5379 for (; parm != NULL; parm = TREE_CHAIN (parm))
5380 if (!valid_type_in_constexpr_fundecl_p (TREE_TYPE (parm)))
5384 error ("invalid type for parameter %d of constexpr "
5385 "function %q+#D", DECL_PARM_INDEX (parm), fun);
5388 if (!DECL_CONSTRUCTOR_P (fun))
5390 tree rettype = TREE_TYPE (TREE_TYPE (fun));
5391 if (!valid_type_in_constexpr_fundecl_p (rettype))
5395 error ("invalid return type %qT of constexpr function %q+D",
5399 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun)
5400 && !CLASSTYPE_LITERAL_P (DECL_CONTEXT (fun)))
5404 error ("enclosing class of %q+#D is not a literal type", fun);
5411 /* Return non-null if FUN certainly designates a valid constexpr function
5412 declaration. Otherwise return NULL. Issue appropriate diagnostics
5413 if necessary. Note that we only check the declaration, not the body
5417 validate_constexpr_fundecl (tree fun)
5419 constexpr_fundef entry;
5420 constexpr_fundef **slot;
5422 if (processing_template_decl || !DECL_DECLARED_CONSTEXPR_P (fun))
5424 else if (DECL_CLONED_FUNCTION_P (fun))
5425 /* We already checked the original function. */
5428 if (!is_valid_constexpr_fn (fun, !DECL_TEMPLATE_INSTANTIATION (fun)))
5430 DECL_DECLARED_CONSTEXPR_P (fun) = false;
5434 /* Create the constexpr function table if necessary. */
5435 if (constexpr_fundef_table == NULL)
5436 constexpr_fundef_table = htab_create_ggc (101,
5437 constexpr_fundef_hash,
5438 constexpr_fundef_equal,
5442 slot = (constexpr_fundef **)
5443 htab_find_slot (constexpr_fundef_table, &entry, INSERT);
5446 *slot = ggc_alloc_constexpr_fundef ();
5452 /* Subroutine of build_constexpr_constructor_member_initializers.
5453 The expression tree T represents a data member initialization
5454 in a (constexpr) constructor definition. Build a pairing of
5455 the data member with its initializer, and prepend that pair
5456 to the existing initialization pair INITS. */
5459 build_data_member_initialization (tree t, VEC(constructor_elt,gc) **vec)
5462 if (TREE_CODE (t) == CLEANUP_POINT_EXPR)
5463 t = TREE_OPERAND (t, 0);
5464 if (TREE_CODE (t) == EXPR_STMT)
5465 t = TREE_OPERAND (t, 0);
5466 if (t == error_mark_node)
5468 if (TREE_CODE (t) == STATEMENT_LIST)
5470 tree_stmt_iterator i;
5471 for (i = tsi_start (t); !tsi_end_p (i); tsi_next (&i))
5473 if (! build_data_member_initialization (tsi_stmt (i), vec))
5478 if (TREE_CODE (t) == CLEANUP_STMT)
5480 /* We can't see a CLEANUP_STMT in a constructor for a literal class,
5481 but we can in a constexpr constructor for a non-literal class. Just
5482 ignore it; either all the initialization will be constant, in which
5483 case the cleanup can't run, or it can't be constexpr.
5484 Still recurse into CLEANUP_BODY. */
5485 return build_data_member_initialization (CLEANUP_BODY (t), vec);
5487 if (TREE_CODE (t) == CONVERT_EXPR)
5488 t = TREE_OPERAND (t, 0);
5489 if (TREE_CODE (t) == INIT_EXPR
5490 || TREE_CODE (t) == MODIFY_EXPR)
5492 member = TREE_OPERAND (t, 0);
5493 init = unshare_expr (TREE_OPERAND (t, 1));
5497 gcc_assert (TREE_CODE (t) == CALL_EXPR);
5498 member = CALL_EXPR_ARG (t, 0);
5499 /* We don't use build_cplus_new here because it complains about
5500 abstract bases. Leaving the call unwrapped means that it has the
5501 wrong type, but cxx_eval_constant_expression doesn't care. */
5502 init = unshare_expr (t);
5504 if (TREE_CODE (member) == INDIRECT_REF)
5505 member = TREE_OPERAND (member, 0);
5506 if (TREE_CODE (member) == NOP_EXPR)
5510 if (TREE_CODE (op) == ADDR_EXPR)
5512 gcc_assert (same_type_ignoring_top_level_qualifiers_p
5513 (TREE_TYPE (TREE_TYPE (op)),
5514 TREE_TYPE (TREE_TYPE (member))));
5515 /* Initializing a cv-qualified member; we need to look through
5521 /* We don't put out anything for an empty base. */
5522 gcc_assert (is_empty_class (TREE_TYPE (TREE_TYPE (member))));
5523 /* But if the initializer isn't constexpr, leave it in so we
5525 if (potential_constant_expression (init))
5529 if (TREE_CODE (member) == ADDR_EXPR)
5530 member = TREE_OPERAND (member, 0);
5531 if (TREE_CODE (member) == COMPONENT_REF
5532 /* If we're initializing a member of a subaggregate, it's a vtable
5533 pointer. Leave it as COMPONENT_REF so we remember the path to get
5535 && TREE_CODE (TREE_OPERAND (member, 0)) != COMPONENT_REF)
5536 member = TREE_OPERAND (member, 1);
5537 CONSTRUCTOR_APPEND_ELT (*vec, member, init);
5541 /* Make sure that there are no statements after LAST in the constructor
5542 body represented by LIST. */
5545 check_constexpr_ctor_body (tree last, tree list)
5548 if (TREE_CODE (list) == STATEMENT_LIST)
5550 tree_stmt_iterator i = tsi_last (list);
5551 for (; !tsi_end_p (i); tsi_prev (&i))
5553 tree t = tsi_stmt (i);
5556 if (TREE_CODE (t) == BIND_EXPR)
5558 if (!check_constexpr_ctor_body (last, BIND_EXPR_BODY (t)))
5563 /* We currently allow typedefs and static_assert.
5564 FIXME allow them in the standard, too. */
5565 if (TREE_CODE (t) != STATIC_ASSERT)
5572 else if (list != last
5573 && TREE_CODE (list) != STATIC_ASSERT)
5577 error ("constexpr constructor does not have empty body");
5578 DECL_DECLARED_CONSTEXPR_P (current_function_decl) = false;
5583 /* Build compile-time evalable representations of member-initializer list
5584 for a constexpr constructor. */
5587 build_constexpr_constructor_member_initializers (tree type, tree body)
5589 VEC(constructor_elt,gc) *vec = NULL;
5591 if (TREE_CODE (body) == MUST_NOT_THROW_EXPR
5592 || TREE_CODE (body) == EH_SPEC_BLOCK)
5593 body = TREE_OPERAND (body, 0);
5594 if (TREE_CODE (body) == STATEMENT_LIST)
5595 body = STATEMENT_LIST_HEAD (body)->stmt;
5596 body = BIND_EXPR_BODY (body);
5597 if (TREE_CODE (body) == CLEANUP_POINT_EXPR)
5599 body = TREE_OPERAND (body, 0);
5600 if (TREE_CODE (body) == EXPR_STMT)
5601 body = TREE_OPERAND (body, 0);
5602 if (TREE_CODE (body) == INIT_EXPR
5603 && (same_type_ignoring_top_level_qualifiers_p
5604 (TREE_TYPE (TREE_OPERAND (body, 0)),
5605 current_class_type)))
5608 return TREE_OPERAND (body, 1);
5610 ok = build_data_member_initialization (body, &vec);
5612 else if (TREE_CODE (body) == STATEMENT_LIST)
5614 tree_stmt_iterator i;
5615 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
5617 ok = build_data_member_initialization (tsi_stmt (i), &vec);
5623 gcc_assert (errorcount > 0);
5625 return build_constructor (type, vec);
5627 return error_mark_node;
5630 /* Subroutine of register_constexpr_fundef. BODY is the body of a function
5631 declared to be constexpr, or a sub-statement thereof. Returns the
5632 return value if suitable, error_mark_node for a statement not allowed in
5633 a constexpr function, or NULL_TREE if no return value was found. */
5636 constexpr_fn_retval (tree body)
5638 switch (TREE_CODE (body))
5640 case STATEMENT_LIST:
5642 tree_stmt_iterator i;
5643 tree expr = NULL_TREE;
5644 for (i = tsi_start (body); !tsi_end_p (i); tsi_next (&i))
5646 tree s = constexpr_fn_retval (tsi_stmt (i));
5647 if (s == error_mark_node)
5648 return error_mark_node;
5649 else if (s == NULL_TREE)
5650 /* Keep iterating. */;
5652 /* Multiple return statements. */
5653 return error_mark_node;
5661 return unshare_expr (TREE_OPERAND (body, 0));
5664 if (TREE_CODE (DECL_EXPR_DECL (body)) == USING_DECL)
5666 return error_mark_node;
5672 return error_mark_node;
5676 /* We are processing the definition of the constexpr function FUN.
5677 Check that its BODY fulfills the propriate requirements and
5678 enter it in the constexpr function definition table.
5679 For constructor BODY is actually the TREE_LIST of the
5680 member-initializer list. */
5683 register_constexpr_fundef (tree fun, tree body)
5685 constexpr_fundef *fundef = retrieve_constexpr_fundef (fun);
5686 gcc_assert (fundef != NULL && fundef->body == NULL);
5688 if (DECL_CONSTRUCTOR_P (fun))
5689 body = build_constexpr_constructor_member_initializers
5690 (DECL_CONTEXT (fun), body);
5693 if (TREE_CODE (body) == BIND_EXPR)
5694 body = BIND_EXPR_BODY (body);
5695 if (TREE_CODE (body) == EH_SPEC_BLOCK)
5696 body = EH_SPEC_STMTS (body);
5697 if (TREE_CODE (body) == MUST_NOT_THROW_EXPR)
5698 body = TREE_OPERAND (body, 0);
5699 if (TREE_CODE (body) == CLEANUP_POINT_EXPR)
5700 body = TREE_OPERAND (body, 0);
5701 body = constexpr_fn_retval (body);
5702 if (body == NULL_TREE || body == error_mark_node)
5704 error ("body of constexpr function %qD not a return-statement", fun);
5705 DECL_DECLARED_CONSTEXPR_P (fun) = false;
5710 if (!potential_rvalue_constant_expression (body))
5712 DECL_DECLARED_CONSTEXPR_P (fun) = false;
5713 if (!DECL_TEMPLATE_INSTANTIATION (fun))
5714 require_potential_rvalue_constant_expression (body);
5717 fundef->body = body;
5721 /* Objects of this type represent calls to constexpr functions
5722 along with the bindings of parameters to their arguments, for
5723 the purpose of compile time evaluation. */
5725 typedef struct GTY(()) constexpr_call {
5726 /* Description of the constexpr function definition. */
5727 constexpr_fundef *fundef;
5728 /* Parameter bindings enironment. A TREE_LIST where each TREE_PURPOSE
5729 is a parameter _DECL and the TREE_VALUE is the value of the parameter.
5730 Note: This arrangement is made to accomodate the use of
5731 iterative_hash_template_arg (see pt.c). If you change this
5732 representation, also change the hash calculation in
5733 cxx_eval_call_expression. */
5735 /* Result of the call.
5736 NULL means the call is being evaluated.
5737 error_mark_node means that the evaluation was erroneous;
5738 otherwise, the actuall value of the call. */
5740 /* The hash of this call; we remember it here to avoid having to
5741 recalculate it when expanding the hash table. */
5745 /* A table of all constexpr calls that have been evaluated by the
5746 compiler in this translation unit. */
5748 static GTY ((param_is (constexpr_call))) htab_t constexpr_call_table;
5750 static tree cxx_eval_constant_expression (const constexpr_call *, tree,
5751 bool, bool, bool *);
5753 /* Compute a hash value for a constexpr call representation. */
5756 constexpr_call_hash (const void *p)
5758 const constexpr_call *info = (const constexpr_call *) p;
5762 /* Return 1 if the objects pointed to by P and Q represent calls
5763 to the same constexpr function with the same arguments.
5764 Otherwise, return 0. */
5767 constexpr_call_equal (const void *p, const void *q)
5769 const constexpr_call *lhs = (const constexpr_call *) p;
5770 const constexpr_call *rhs = (const constexpr_call *) q;
5775 if (!constexpr_fundef_equal (lhs->fundef, rhs->fundef))
5777 lhs_bindings = lhs->bindings;
5778 rhs_bindings = rhs->bindings;
5779 while (lhs_bindings != NULL && rhs_bindings != NULL)
5781 tree lhs_arg = TREE_VALUE (lhs_bindings);
5782 tree rhs_arg = TREE_VALUE (rhs_bindings);
5783 gcc_assert (TREE_TYPE (lhs_arg) == TREE_TYPE (rhs_arg));
5784 if (!cp_tree_equal (lhs_arg, rhs_arg))
5786 lhs_bindings = TREE_CHAIN (lhs_bindings);
5787 rhs_bindings = TREE_CHAIN (rhs_bindings);
5789 return lhs_bindings == rhs_bindings;
5792 /* Initialize the constexpr call table, if needed. */
5795 maybe_initialize_constexpr_call_table (void)
5797 if (constexpr_call_table == NULL)
5798 constexpr_call_table = htab_create_ggc (101,
5799 constexpr_call_hash,
5800 constexpr_call_equal,
5804 /* Return true if T designates the implied `this' parameter. */
5807 is_this_parameter (tree t)
5809 return t == current_class_ptr;
5812 /* We have an expression tree T that represents a call, either CALL_EXPR
5813 or AGGR_INIT_EXPR. If the call is lexically to a named function,
5814 retrun the _DECL for that function. */
5817 get_function_named_in_call (tree t)
5820 switch (TREE_CODE (t))
5823 fun = CALL_EXPR_FN (t);
5826 case AGGR_INIT_EXPR:
5827 fun = AGGR_INIT_EXPR_FN (t);
5834 if (TREE_CODE (fun) == ADDR_EXPR
5835 && TREE_CODE (TREE_OPERAND (fun, 0)) == FUNCTION_DECL)
5836 fun = TREE_OPERAND (fun, 0);
5840 /* We have an expression tree T that represents a call, either CALL_EXPR
5841 or AGGR_INIT_EXPR. Return the Nth argument. */
5844 get_nth_callarg (tree t, int n)
5846 switch (TREE_CODE (t))
5849 return CALL_EXPR_ARG (t, n);
5851 case AGGR_INIT_EXPR:
5852 return AGGR_INIT_EXPR_ARG (t, n);
5860 /* Look up the binding of the function parameter T in a constexpr
5861 function call context CALL. */
5864 lookup_parameter_binding (const constexpr_call *call, tree t)
5866 tree b = purpose_member (t, call->bindings);
5867 return TREE_VALUE (b);
5870 /* Attempt to evaluate T which represents a call to a builtin function.
5871 We assume here that all builtin functions evaluate to scalar types
5872 represented by _CST nodes. */
5875 cxx_eval_builtin_function_call (const constexpr_call *call, tree t,
5876 bool allow_non_constant, bool addr,
5877 bool *non_constant_p)
5879 const int nargs = call_expr_nargs (t);
5880 tree *args = (tree *) alloca (nargs * sizeof (tree));
5883 for (i = 0; i < nargs; ++i)
5885 args[i] = cxx_eval_constant_expression (call, CALL_EXPR_ARG (t, i),
5886 allow_non_constant, addr,
5888 if (allow_non_constant && *non_constant_p)
5891 if (*non_constant_p)
5893 new_call = build_call_array_loc (EXPR_LOCATION (t), TREE_TYPE (t),
5894 CALL_EXPR_FN (t), nargs, args);
5895 return fold (new_call);
5898 /* TEMP is the constant value of a temporary object of type TYPE. Adjust
5899 the type of the value to match. */
5902 adjust_temp_type (tree type, tree temp)
5904 if (TREE_TYPE (temp) == type)
5906 /* Avoid wrapping an aggregate value in a NOP_EXPR. */
5907 if (TREE_CODE (temp) == CONSTRUCTOR)
5908 return build_constructor (type, CONSTRUCTOR_ELTS (temp));
5909 gcc_assert (SCALAR_TYPE_P (type));
5910 return cp_fold_convert (type, temp);
5913 /* Subroutine of cxx_eval_call_expression.
5914 We are processing a call expression (either CALL_EXPR or
5915 AGGR_INIT_EXPR) in the call context of OLD_CALL. Evaluate
5916 all arguments and bind their values to correspondings
5917 parameters, making up the NEW_CALL context. */
5920 cxx_bind_parameters_in_call (const constexpr_call *old_call, tree t,
5921 constexpr_call *new_call,
5922 bool allow_non_constant,
5923 bool *non_constant_p)
5925 const int nargs = call_expr_nargs (t);
5926 tree fun = new_call->fundef->decl;
5927 tree parms = DECL_ARGUMENTS (fun);
5929 for (i = 0; i < nargs; ++i)
5932 tree type = parms ? TREE_TYPE (parms) : void_type_node;
5933 /* For member function, the first argument is a pointer to the implied
5934 object. And for an object contruction, don't bind `this' before
5935 it is fully constructed. */
5936 if (i == 0 && DECL_CONSTRUCTOR_P (fun))
5938 x = get_nth_callarg (t, i);
5939 arg = cxx_eval_constant_expression (old_call, x, allow_non_constant,
5940 TREE_CODE (type) == REFERENCE_TYPE,
5942 /* Don't VERIFY_CONSTANT here. */
5943 if (*non_constant_p && allow_non_constant)
5945 /* Just discard ellipsis args after checking their constantitude. */
5948 if (*non_constant_p)
5949 /* Don't try to adjust the type of non-constant args. */
5952 /* Make sure the binding has the same type as the parm. */
5953 if (TREE_CODE (type) != REFERENCE_TYPE)
5954 arg = adjust_temp_type (type, arg);
5955 new_call->bindings = tree_cons (parms, arg, new_call->bindings);
5957 parms = TREE_CHAIN (parms);
5961 /* Variables and functions to manage constexpr call expansion context.
5962 These do not need to be marked for PCH or GC. */
5964 /* FIXME remember and print actual constant arguments. */
5965 static VEC(tree,heap) *call_stack = NULL;
5966 static int call_stack_tick;
5967 static int last_cx_error_tick;
5970 push_cx_call_context (tree call)
5973 if (!EXPR_HAS_LOCATION (call))
5974 SET_EXPR_LOCATION (call, input_location);
5975 VEC_safe_push (tree, heap, call_stack, call);
5976 if (VEC_length (tree, call_stack) > (unsigned) max_constexpr_depth)
5982 pop_cx_call_context (void)
5985 VEC_pop (tree, call_stack);
5989 cx_error_context (void)
5991 VEC(tree,heap) *r = NULL;
5992 if (call_stack_tick != last_cx_error_tick
5993 && !VEC_empty (tree, call_stack))
5995 last_cx_error_tick = call_stack_tick;
5999 /* Subroutine of cxx_eval_constant_expression.
6000 Evaluate the call expression tree T in the context of OLD_CALL expression
6004 cxx_eval_call_expression (const constexpr_call *old_call, tree t,
6005 bool allow_non_constant, bool addr,
6006 bool *non_constant_p)
6008 location_t loc = EXPR_LOC_OR_HERE (t);
6009 tree fun = get_function_named_in_call (t);
6011 constexpr_call new_call = { NULL, NULL, NULL, 0 };
6012 constexpr_call **slot;
6013 constexpr_call *entry;
6016 if (TREE_CODE (fun) != FUNCTION_DECL)
6018 /* Might be a constexpr function pointer. */
6019 fun = cxx_eval_constant_expression (old_call, fun, allow_non_constant,
6020 /*addr*/false, non_constant_p);
6021 if (TREE_CODE (fun) == ADDR_EXPR)
6022 fun = TREE_OPERAND (fun, 0);
6024 if (TREE_CODE (fun) != FUNCTION_DECL)
6026 if (!allow_non_constant)
6027 error_at (loc, "expression %qE does not designate a constexpr "
6029 *non_constant_p = true;
6032 if (DECL_CLONED_FUNCTION_P (fun))
6033 fun = DECL_CLONED_FUNCTION (fun);
6034 if (is_builtin_fn (fun))
6035 return cxx_eval_builtin_function_call (old_call, t, allow_non_constant,
6036 addr, non_constant_p);
6037 if (!DECL_DECLARED_CONSTEXPR_P (fun))
6039 if (!allow_non_constant)
6041 error_at (loc, "%qD is not a constexpr function", fun);
6042 if (DECL_TEMPLATE_INSTANTIATION (fun)
6043 && DECL_DECLARED_CONSTEXPR_P (DECL_TEMPLATE_RESULT
6044 (DECL_TI_TEMPLATE (fun))))
6045 is_valid_constexpr_fn (fun, true);
6047 *non_constant_p = true;
6051 /* Shortcut trivial copy constructor/op=. */
6052 if (call_expr_nargs (t) == 2 && trivial_fn_p (fun))
6054 tree arg = convert_from_reference (get_nth_callarg (t, 1));
6055 return cxx_eval_constant_expression (old_call, arg, allow_non_constant,
6056 addr, non_constant_p);
6059 /* If in direct recursive call, optimize definition search. */
6060 if (old_call != NULL && old_call->fundef->decl == fun)
6061 new_call.fundef = old_call->fundef;
6064 new_call.fundef = retrieve_constexpr_fundef (fun);
6065 if (new_call.fundef == NULL || new_call.fundef->body == NULL)
6067 if (!allow_non_constant)
6068 error_at (loc, "%qD used before its definition", fun);
6069 *non_constant_p = true;
6073 cxx_bind_parameters_in_call (old_call, t, &new_call,
6074 allow_non_constant, non_constant_p);
6075 if (*non_constant_p)
6078 depth_ok = push_cx_call_context (t);
6081 = iterative_hash_template_arg (new_call.bindings,
6082 constexpr_fundef_hash (new_call.fundef));
6084 /* If we have seen this call before, we are done. */
6085 maybe_initialize_constexpr_call_table ();
6086 slot = (constexpr_call **)
6087 htab_find_slot (constexpr_call_table, &new_call, INSERT);
6091 /* We need to keep a pointer to the entry, not just the slot, as the
6092 slot can move in the call to cxx_eval_builtin_function_call. */
6093 *slot = entry = ggc_alloc_constexpr_call ();
6096 /* Calls which are in progress have their result set to NULL
6097 so that we can detect circular dependencies. */
6098 else if (entry->result == NULL)
6100 if (!allow_non_constant)
6101 error ("call has circular dependency");
6102 *non_constant_p = true;
6103 entry->result = result = error_mark_node;
6108 if (!allow_non_constant)
6109 error ("constexpr evaluation depth exceeds maximum of %d (use "
6110 "-fconstexpr-depth= to increase the maximum)",
6111 max_constexpr_depth);
6112 *non_constant_p = true;
6113 entry->result = result = error_mark_node;
6117 result = entry->result;
6118 if (!result || (result == error_mark_node && !allow_non_constant))
6119 result = (cxx_eval_constant_expression
6120 (&new_call, new_call.fundef->body,
6121 allow_non_constant, addr,
6123 if (result == error_mark_node)
6124 *non_constant_p = true;
6125 if (*non_constant_p)
6126 entry->result = result = error_mark_node;
6129 /* If this was a call to initialize an object, set the type of
6130 the CONSTRUCTOR to the type of that object. */
6131 if (DECL_CONSTRUCTOR_P (fun))
6133 tree ob_arg = get_nth_callarg (t, 0);
6134 STRIP_NOPS (ob_arg);
6135 gcc_assert (TREE_CODE (TREE_TYPE (ob_arg)) == POINTER_TYPE
6136 && CLASS_TYPE_P (TREE_TYPE (TREE_TYPE (ob_arg))));
6137 result = adjust_temp_type (TREE_TYPE (TREE_TYPE (ob_arg)),
6140 entry->result = result;
6144 pop_cx_call_context ();
6145 return unshare_expr (result);
6148 /* FIXME speed this up, it's taking 16% of compile time on sieve testcase. */
6151 reduced_constant_expression_p (tree t)
6153 if (TREE_OVERFLOW_P (t))
6154 /* Integer overflow makes this not a constant expression. */
6156 /* FIXME are we calling this too much? */
6157 return initializer_constant_valid_p (t, TREE_TYPE (t)) != NULL_TREE;
6160 /* Some expressions may have constant operands but are not constant
6161 themselves, such as 1/0. Call this function (or rather, the macro
6162 following it) to check for that condition.
6164 We only call this in places that require an arithmetic constant, not in
6165 places where we might have a non-constant expression that can be a
6166 component of a constant expression, such as the address of a constexpr
6167 variable that might be dereferenced later. */
6170 verify_constant (tree t, bool allow_non_constant, bool *non_constant_p)
6172 if (!*non_constant_p && !reduced_constant_expression_p (t))
6174 if (!allow_non_constant)
6176 /* If T was already folded to a _CST with TREE_OVERFLOW set,
6177 printing the folded constant isn't helpful. */
6178 if (TREE_OVERFLOW_P (t))
6180 permerror (input_location, "overflow in constant expression");
6181 /* If we're being permissive (and are in an enforcing
6182 context), consider this constant. */
6183 if (flag_permissive)
6187 error ("%q+E is not a constant expression", t);
6189 *non_constant_p = true;
6191 return *non_constant_p;
6193 #define VERIFY_CONSTANT(X) \
6195 if (verify_constant ((X), allow_non_constant, non_constant_p)) \
6199 /* Subroutine of cxx_eval_constant_expression.
6200 Attempt to reduce the unary expression tree T to a compile time value.
6201 If successful, return the value. Otherwise issue a diagnostic
6202 and return error_mark_node. */
6205 cxx_eval_unary_expression (const constexpr_call *call, tree t,
6206 bool allow_non_constant, bool addr,
6207 bool *non_constant_p)
6210 tree orig_arg = TREE_OPERAND (t, 0);
6211 tree arg = cxx_eval_constant_expression (call, orig_arg, allow_non_constant,
6212 addr, non_constant_p);
6213 VERIFY_CONSTANT (arg);
6214 if (arg == orig_arg)
6216 r = fold_build1 (TREE_CODE (t), TREE_TYPE (t), arg);
6217 VERIFY_CONSTANT (r);
6221 /* Subroutine of cxx_eval_constant_expression.
6222 Like cxx_eval_unary_expression, except for binary expressions. */
6225 cxx_eval_binary_expression (const constexpr_call *call, tree t,
6226 bool allow_non_constant, bool addr,
6227 bool *non_constant_p)
6230 tree orig_lhs = TREE_OPERAND (t, 0);
6231 tree orig_rhs = TREE_OPERAND (t, 1);
6233 lhs = cxx_eval_constant_expression (call, orig_lhs,
6234 allow_non_constant, addr,
6236 VERIFY_CONSTANT (lhs);
6237 rhs = cxx_eval_constant_expression (call, orig_rhs,
6238 allow_non_constant, addr,
6240 VERIFY_CONSTANT (rhs);
6241 if (lhs == orig_lhs && rhs == orig_rhs)
6243 r = fold_build2 (TREE_CODE (t), TREE_TYPE (t), lhs, rhs);
6244 VERIFY_CONSTANT (r);
6248 /* Subroutine of cxx_eval_constant_expression.
6249 Attempt to evaluate condition expressions. Dead branches are not
6253 cxx_eval_conditional_expression (const constexpr_call *call, tree t,
6254 bool allow_non_constant, bool addr,
6255 bool *non_constant_p)
6257 tree val = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
6258 allow_non_constant, addr,
6260 VERIFY_CONSTANT (val);
6261 if (val == boolean_true_node)
6262 return cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
6263 allow_non_constant, addr,
6265 gcc_assert (val == boolean_false_node);
6266 /* Don't VERIFY_CONSTANT here. */
6267 return cxx_eval_constant_expression (call, TREE_OPERAND (t, 2),
6268 allow_non_constant, addr,
6272 /* Subroutine of cxx_eval_constant_expression.
6273 Attempt to reduce a reference to an array slot. */
6276 cxx_eval_array_reference (const constexpr_call *call, tree t,
6277 bool allow_non_constant, bool addr,
6278 bool *non_constant_p)
6280 tree oldary = TREE_OPERAND (t, 0);
6281 tree ary = cxx_eval_constant_expression (call, oldary,
6282 allow_non_constant, addr,
6286 unsigned len, elem_nchars = 1;
6287 if (*non_constant_p)
6289 oldidx = TREE_OPERAND (t, 1);
6290 index = cxx_eval_constant_expression (call, oldidx,
6291 allow_non_constant, false,
6293 VERIFY_CONSTANT (index);
6294 if (addr && ary == oldary && index == oldidx)
6297 return build4 (ARRAY_REF, TREE_TYPE (t), ary, index, NULL, NULL);
6298 if (TREE_CODE (ary) == CONSTRUCTOR)
6299 len = CONSTRUCTOR_NELTS (ary);
6302 elem_nchars = (TYPE_PRECISION (TREE_TYPE (TREE_TYPE (ary)))
6303 / TYPE_PRECISION (char_type_node));
6304 len = (unsigned) TREE_STRING_LENGTH (ary) / elem_nchars;
6306 if (compare_tree_int (index, len) >= 0)
6308 if (!allow_non_constant)
6309 error ("array subscript out of bound");
6310 *non_constant_p = true;
6313 i = tree_low_cst (index, 0);
6314 if (TREE_CODE (ary) == CONSTRUCTOR)
6315 return VEC_index (constructor_elt, CONSTRUCTOR_ELTS (ary), i)->value;
6316 else if (elem_nchars == 1)
6317 return build_int_cst (cv_unqualified (TREE_TYPE (TREE_TYPE (ary))),
6318 TREE_STRING_POINTER (ary)[i]);
6321 tree type = cv_unqualified (TREE_TYPE (TREE_TYPE (ary)));
6322 return native_interpret_expr (type, (const unsigned char *)
6323 TREE_STRING_POINTER (ary)
6324 + i * elem_nchars, elem_nchars);
6326 /* Don't VERIFY_CONSTANT here. */
6329 /* Subroutine of cxx_eval_constant_expression.
6330 Attempt to reduce a field access of a value of class type. */
6333 cxx_eval_component_reference (const constexpr_call *call, tree t,
6334 bool allow_non_constant, bool addr,
6335 bool *non_constant_p)
6337 unsigned HOST_WIDE_INT i;
6340 tree part = TREE_OPERAND (t, 1);
6341 tree orig_whole = TREE_OPERAND (t, 0);
6342 tree whole = cxx_eval_constant_expression (call, orig_whole,
6343 allow_non_constant, addr,
6345 if (whole == orig_whole)
6348 return fold_build3 (COMPONENT_REF, TREE_TYPE (t),
6349 whole, part, NULL_TREE);
6350 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6352 if (!*non_constant_p && TREE_CODE (whole) != CONSTRUCTOR)
6354 if (!allow_non_constant)
6355 error ("%qE is not a constant expression", orig_whole);
6356 *non_constant_p = true;
6358 if (*non_constant_p)
6360 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole), i, field, value)
6365 if (TREE_CODE (TREE_TYPE (whole)) == UNION_TYPE)
6367 /* FIXME Mike Miller wants this to be OK. */
6368 if (!allow_non_constant)
6369 error ("accessing %qD member instead of initialized %qD member in "
6370 "constant expression", part, CONSTRUCTOR_ELT (whole, 0)->index);
6371 *non_constant_p = true;
6375 return error_mark_node;
6378 /* Subroutine of cxx_eval_constant_expression.
6379 Attempt to reduce a field access of a value of class type that is
6380 expressed as a BIT_FIELD_REF. */
6383 cxx_eval_bit_field_ref (const constexpr_call *call, tree t,
6384 bool allow_non_constant, bool addr,
6385 bool *non_constant_p)
6387 tree orig_whole = TREE_OPERAND (t, 0);
6388 tree whole = cxx_eval_constant_expression (call, orig_whole,
6389 allow_non_constant, addr,
6391 tree start, field, value;
6392 unsigned HOST_WIDE_INT i;
6394 if (whole == orig_whole)
6396 /* Don't VERIFY_CONSTANT here; we only want to check that we got a
6398 if (!*non_constant_p && TREE_CODE (whole) != CONSTRUCTOR)
6400 if (!allow_non_constant)
6401 error ("%qE is not a constant expression", orig_whole);
6402 *non_constant_p = true;
6404 if (*non_constant_p)
6407 start = TREE_OPERAND (t, 2);
6408 FOR_EACH_CONSTRUCTOR_ELT (CONSTRUCTOR_ELTS (whole), i, field, value)
6410 if (bit_position (field) == start)
6414 return error_mark_node;
6417 /* Subroutine of cxx_eval_constant_expression.
6418 Evaluate a short-circuited logical expression T in the context
6419 of a given constexpr CALL. BAILOUT_VALUE is the value for
6420 early return. CONTINUE_VALUE is used here purely for
6421 sanity check purposes. */
6424 cxx_eval_logical_expression (const constexpr_call *call, tree t,
6425 tree bailout_value, tree continue_value,
6426 bool allow_non_constant, bool addr,
6427 bool *non_constant_p)
6430 tree lhs = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
6431 allow_non_constant, addr,
6433 VERIFY_CONSTANT (lhs);
6434 if (lhs == bailout_value)
6436 gcc_assert (lhs == continue_value);
6437 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
6438 allow_non_constant, addr, non_constant_p);
6439 VERIFY_CONSTANT (r);
6443 /* REF is a COMPONENT_REF designating a particular field. V is a vector of
6444 CONSTRUCTOR elements to initialize (part of) an object containing that
6445 field. Return a pointer to the constructor_elt corresponding to the
6446 initialization of the field. */
6448 static constructor_elt *
6449 base_field_constructor_elt (VEC(constructor_elt,gc) *v, tree ref)
6451 tree aggr = TREE_OPERAND (ref, 0);
6452 tree field = TREE_OPERAND (ref, 1);
6454 constructor_elt *ce;
6456 gcc_assert (TREE_CODE (ref) == COMPONENT_REF);
6458 if (TREE_CODE (aggr) == COMPONENT_REF)
6460 constructor_elt *base_ce
6461 = base_field_constructor_elt (v, aggr);
6462 v = CONSTRUCTOR_ELTS (base_ce->value);
6465 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
6466 if (ce->index == field)
6473 /* Subroutine of cxx_eval_constant_expression.
6474 The expression tree T denotes a C-style array or a C-style
6475 aggregate. Reduce it to a constant expression. */
6478 cxx_eval_bare_aggregate (const constexpr_call *call, tree t,
6479 bool allow_non_constant, bool addr,
6480 bool *non_constant_p)
6482 VEC(constructor_elt,gc) *v = CONSTRUCTOR_ELTS (t);
6483 VEC(constructor_elt,gc) *n = VEC_alloc (constructor_elt, gc,
6484 VEC_length (constructor_elt, v));
6485 constructor_elt *ce;
6487 bool changed = false;
6488 gcc_assert (!BRACE_ENCLOSED_INITIALIZER_P (t));
6489 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
6491 tree elt = cxx_eval_constant_expression (call, ce->value,
6492 allow_non_constant, addr,
6494 /* Don't VERIFY_CONSTANT here. */
6495 if (allow_non_constant && *non_constant_p)
6497 if (elt != ce->value)
6499 if (TREE_CODE (ce->index) == COMPONENT_REF)
6501 /* This is an initialization of a vfield inside a base
6502 subaggregate that we already initialized; push this
6503 initialization into the previous initialization. */
6504 constructor_elt *inner = base_field_constructor_elt (n, ce->index);
6508 CONSTRUCTOR_APPEND_ELT (n, ce->index, elt);
6510 if (*non_constant_p || !changed)
6513 VEC_free (constructor_elt, gc, n);
6516 t = build_constructor (TREE_TYPE (t), n);
6517 TREE_CONSTANT (t) = true;
6521 /* Subroutine of cxx_eval_constant_expression.
6522 The expression tree T is a VEC_INIT_EXPR which denotes the desired
6523 initialization of a non-static data member of array type. Reduce it to a
6526 Note that apart from value-initialization (when VALUE_INIT is true),
6527 this is only intended to support value-initialization and the
6528 initializations done by defaulted constructors for classes with
6529 non-static data members of array type. In this case, VEC_INIT_EXPR_INIT
6530 will either be NULL_TREE for the default constructor, or a COMPONENT_REF
6531 for the copy/move constructor. */
6534 cxx_eval_vec_init_1 (const constexpr_call *call, tree atype, tree init,
6535 bool value_init, bool allow_non_constant, bool addr,
6536 bool *non_constant_p)
6538 tree elttype = TREE_TYPE (atype);
6539 int max = tree_low_cst (array_type_nelts (atype), 0);
6540 VEC(constructor_elt,gc) *n = VEC_alloc (constructor_elt, gc, max + 1);
6543 /* For the default constructor, build up a call to the default
6544 constructor of the element type. We only need to handle class types
6545 here, as for a constructor to be constexpr, all members must be
6546 initialized, which for a defaulted default constructor means they must
6547 be of a class type with a constexpr default constructor. */
6552 VEC(tree,gc) *argvec = make_tree_vector ();
6553 init = build_special_member_call (NULL_TREE, complete_ctor_identifier,
6554 &argvec, elttype, LOOKUP_NORMAL,
6555 tf_warning_or_error);
6556 release_tree_vector (argvec);
6557 init = cxx_eval_constant_expression (call, init, allow_non_constant,
6558 addr, non_constant_p);
6561 if (*non_constant_p && !allow_non_constant)
6564 for (i = 0; i <= max; ++i)
6566 tree idx = build_int_cst (size_type_node, i);
6568 if (TREE_CODE (elttype) == ARRAY_TYPE)
6570 /* A multidimensional array; recurse. */
6572 eltinit = NULL_TREE;
6574 eltinit = cp_build_array_ref (input_location, init, idx,
6575 tf_warning_or_error);
6576 eltinit = cxx_eval_vec_init_1 (call, elttype, eltinit, value_init,
6577 allow_non_constant, addr,
6580 else if (value_init)
6582 eltinit = build_value_init (elttype, tf_warning_or_error);
6583 eltinit = cxx_eval_constant_expression
6584 (call, eltinit, allow_non_constant, addr, non_constant_p);
6586 else if (TREE_CODE (init) == CONSTRUCTOR)
6588 /* Initializing an element using the call to the default
6589 constructor we just built above. */
6590 eltinit = unshare_expr (init);
6594 /* Copying an element. */
6595 VEC(tree,gc) *argvec;
6596 gcc_assert (same_type_ignoring_top_level_qualifiers_p
6597 (atype, TREE_TYPE (init)));
6598 eltinit = cp_build_array_ref (input_location, init, idx,
6599 tf_warning_or_error);
6600 if (!real_lvalue_p (init))
6601 eltinit = move (eltinit);
6602 argvec = make_tree_vector ();
6603 VEC_quick_push (tree, argvec, eltinit);
6604 eltinit = (build_special_member_call
6605 (NULL_TREE, complete_ctor_identifier, &argvec,
6606 elttype, LOOKUP_NORMAL, tf_warning_or_error));
6607 release_tree_vector (argvec);
6608 eltinit = cxx_eval_constant_expression
6609 (call, eltinit, allow_non_constant, addr, non_constant_p);
6611 if (*non_constant_p && !allow_non_constant)
6613 CONSTRUCTOR_APPEND_ELT (n, idx, eltinit);
6616 if (!*non_constant_p)
6618 init = build_constructor (TREE_TYPE (atype), n);
6619 TREE_CONSTANT (init) = true;
6624 VEC_free (constructor_elt, gc, n);
6629 cxx_eval_vec_init (const constexpr_call *call, tree t,
6630 bool allow_non_constant, bool addr,
6631 bool *non_constant_p)
6633 tree atype = TREE_TYPE (t);
6634 tree init = VEC_INIT_EXPR_INIT (t);
6635 tree r = cxx_eval_vec_init_1 (call, atype, init,
6636 VEC_INIT_EXPR_VALUE_INIT (t),
6637 allow_non_constant, addr, non_constant_p);
6638 if (*non_constant_p)
6644 /* A less strict version of fold_indirect_ref_1, which requires cv-quals to
6645 match. We want to be less strict for simple *& folding; if we have a
6646 non-const temporary that we access through a const pointer, that should
6647 work. We handle this here rather than change fold_indirect_ref_1
6648 because we're dealing with things like ADDR_EXPR of INTEGER_CST which
6649 don't really make sense outside of constant expression evaluation. Also
6650 we want to allow folding to COMPONENT_REF, which could cause trouble
6651 with TBAA in fold_indirect_ref_1. */
6654 cxx_eval_indirect_ref (const constexpr_call *call, tree t,
6655 bool allow_non_constant, bool addr,
6656 bool *non_constant_p)
6658 tree orig_op0 = TREE_OPERAND (t, 0);
6659 tree op0 = cxx_eval_constant_expression (call, orig_op0, allow_non_constant,
6660 /*addr*/false, non_constant_p);
6661 tree type, sub, subtype, r;
6664 /* Don't VERIFY_CONSTANT here. */
6665 if (*non_constant_p)
6668 type = TREE_TYPE (t);
6674 subtype = TREE_TYPE (sub);
6675 gcc_assert (POINTER_TYPE_P (subtype));
6677 if (TREE_CODE (sub) == ADDR_EXPR)
6679 tree op = TREE_OPERAND (sub, 0);
6680 tree optype = TREE_TYPE (op);
6682 if (same_type_ignoring_top_level_qualifiers_p (optype, type))
6684 /* Also handle conversion to an empty base class, which
6685 is represented with a NOP_EXPR. */
6686 else if (!addr && is_empty_class (type)
6687 && CLASS_TYPE_P (optype)
6688 && DERIVED_FROM_P (type, optype))
6693 /* *(foo *)&struct_with_foo_field => COMPONENT_REF */
6694 else if (RECORD_OR_UNION_TYPE_P (optype))
6696 tree field = TYPE_FIELDS (optype);
6697 for (; field; field = DECL_CHAIN (field))
6698 if (TREE_CODE (field) == FIELD_DECL
6699 && integer_zerop (byte_position (field))
6700 && (same_type_ignoring_top_level_qualifiers_p
6701 (TREE_TYPE (field), type)))
6703 r = fold_build3 (COMPONENT_REF, type, op, field, NULL_TREE);
6708 else if (TREE_CODE (sub) == POINTER_PLUS_EXPR
6709 && TREE_CODE (TREE_OPERAND (sub, 1)) == INTEGER_CST)
6711 tree op00 = TREE_OPERAND (sub, 0);
6712 tree op01 = TREE_OPERAND (sub, 1);
6715 if (TREE_CODE (op00) == ADDR_EXPR)
6718 op00 = TREE_OPERAND (op00, 0);
6719 op00type = TREE_TYPE (op00);
6721 /* ((foo *)&struct_with_foo_field)[1] => COMPONENT_REF */
6722 if (RECORD_OR_UNION_TYPE_P (op00type))
6724 tree field = TYPE_FIELDS (op00type);
6725 for (; field; field = DECL_CHAIN (field))
6726 if (TREE_CODE (field) == FIELD_DECL
6727 && tree_int_cst_equal (byte_position (field), op01)
6728 && (same_type_ignoring_top_level_qualifiers_p
6729 (TREE_TYPE (field), type)))
6731 r = fold_build3 (COMPONENT_REF, type, op00,
6739 /* Let build_fold_indirect_ref handle the cases it does fine with. */
6741 r = build_fold_indirect_ref (op0);
6742 if (TREE_CODE (r) != INDIRECT_REF)
6743 r = cxx_eval_constant_expression (call, r, allow_non_constant,
6744 addr, non_constant_p);
6745 else if (TREE_CODE (sub) == ADDR_EXPR
6746 || TREE_CODE (sub) == POINTER_PLUS_EXPR)
6748 gcc_assert (!same_type_ignoring_top_level_qualifiers_p
6749 (TREE_TYPE (TREE_TYPE (sub)), TREE_TYPE (t)));
6750 /* FIXME Mike Miller wants this to be OK. */
6751 if (!allow_non_constant)
6752 error ("accessing value of %qE through a %qT glvalue in a "
6753 "constant expression", build_fold_indirect_ref (sub),
6755 *non_constant_p = true;
6759 /* If we're pulling out the value of an empty base, make sure
6760 that the whole object is constant and then return an empty
6764 VERIFY_CONSTANT (r);
6765 r = build_constructor (TREE_TYPE (t), NULL);
6766 TREE_CONSTANT (r) = true;
6769 if (TREE_CODE (r) == INDIRECT_REF && TREE_OPERAND (r, 0) == orig_op0)
6774 /* Complain about R, a VAR_DECL, not being usable in a constant expression.
6775 Shared between potential_constant_expression and
6776 cxx_eval_constant_expression. */
6779 non_const_var_error (tree r)
6781 tree type = TREE_TYPE (r);
6782 error ("the value of %qD is not usable in a constant "
6784 /* Avoid error cascade. */
6785 if (DECL_INITIAL (r) == error_mark_node)
6787 if (DECL_DECLARED_CONSTEXPR_P (r))
6788 inform (DECL_SOURCE_LOCATION (r),
6789 "%qD used in its own initializer", r);
6790 else if (INTEGRAL_OR_ENUMERATION_TYPE_P (type))
6792 if (!CP_TYPE_CONST_P (type))
6793 inform (DECL_SOURCE_LOCATION (r),
6794 "%q#D is not const", r);
6795 else if (CP_TYPE_VOLATILE_P (type))
6796 inform (DECL_SOURCE_LOCATION (r),
6797 "%q#D is volatile", r);
6798 else if (!DECL_INITIAL (r))
6799 inform (DECL_SOURCE_LOCATION (r),
6800 "%qD was not initialized with a constant "
6807 if (cxx_dialect >= cxx0x && !DECL_DECLARED_CONSTEXPR_P (r))
6808 inform (DECL_SOURCE_LOCATION (r),
6809 "%qD was not declared %<constexpr%>", r);
6811 inform (DECL_SOURCE_LOCATION (r),
6812 "%qD does not have integral or enumeration type",
6817 /* Attempt to reduce the expression T to a constant value.
6818 On failure, issue diagnostic and return error_mark_node. */
6819 /* FIXME unify with c_fully_fold */
6822 cxx_eval_constant_expression (const constexpr_call *call, tree t,
6823 bool allow_non_constant, bool addr,
6824 bool *non_constant_p)
6828 if (t == error_mark_node)
6830 *non_constant_p = true;
6833 if (CONSTANT_CLASS_P (t))
6835 if (TREE_CODE (t) == PTRMEM_CST)
6836 t = cplus_expand_constant (t);
6839 if (TREE_CODE (t) != NOP_EXPR
6840 && reduced_constant_expression_p (t))
6843 switch (TREE_CODE (t))
6848 /* else fall through. */
6850 r = integral_constant_value (t);
6851 if (TREE_CODE (r) == TARGET_EXPR
6852 && TREE_CODE (TARGET_EXPR_INITIAL (r)) == CONSTRUCTOR)
6853 r = TARGET_EXPR_INITIAL (r);
6856 if (!allow_non_constant)
6857 non_const_var_error (r);
6858 *non_constant_p = true;
6867 if (call && DECL_CONTEXT (t) == call->fundef->decl)
6868 r = lookup_parameter_binding (call, t);
6870 /* Defer in case this is only used for its type. */;
6873 if (!allow_non_constant)
6874 error ("%qE is not a constant expression", t);
6875 *non_constant_p = true;
6880 case AGGR_INIT_EXPR:
6881 r = cxx_eval_call_expression (call, t, allow_non_constant, addr,
6887 /* Pass false for 'addr' because these codes indicate
6888 initialization of a temporary. */
6889 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
6890 allow_non_constant, false,
6892 if (!*non_constant_p)
6893 /* Adjust the type of the result to the type of the temporary. */
6894 r = adjust_temp_type (TREE_TYPE (t), r);
6898 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 1),
6899 allow_non_constant, addr,
6904 case NON_LVALUE_EXPR:
6905 case TRY_CATCH_EXPR:
6906 case CLEANUP_POINT_EXPR:
6907 case MUST_NOT_THROW_EXPR:
6909 r = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
6910 allow_non_constant, addr,
6914 /* These differ from cxx_eval_unary_expression in that this doesn't
6915 check for a constant operand or result; an address can be
6916 constant without its operand being, and vice versa. */
6918 r = cxx_eval_indirect_ref (call, t, allow_non_constant, addr,
6924 tree oldop = TREE_OPERAND (t, 0);
6925 tree op = cxx_eval_constant_expression (call, oldop,
6929 /* Don't VERIFY_CONSTANT here. */
6930 if (*non_constant_p)
6932 /* This function does more aggressive folding than fold itself. */
6933 r = build_fold_addr_expr_with_type (op, TREE_TYPE (t));
6934 if (TREE_CODE (r) == ADDR_EXPR && TREE_OPERAND (r, 0) == oldop)
6942 case FIX_TRUNC_EXPR:
6947 case TRUTH_NOT_EXPR:
6948 case FIXED_CONVERT_EXPR:
6949 r = cxx_eval_unary_expression (call, t, allow_non_constant, addr,
6955 /* check_return_expr sometimes wraps a TARGET_EXPR in a
6956 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
6957 introduced by build_call_a. */
6958 tree op0 = TREE_OPERAND (t, 0);
6959 tree op1 = TREE_OPERAND (t, 1);
6961 if ((TREE_CODE (op0) == TARGET_EXPR && op1 == TARGET_EXPR_SLOT (op0))
6962 || TREE_CODE (op1) == EMPTY_CLASS_EXPR)
6963 r = cxx_eval_constant_expression (call, op0, allow_non_constant,
6964 addr, non_constant_p);
6967 /* Check that the LHS is constant and then discard it. */
6968 cxx_eval_constant_expression (call, op0, allow_non_constant,
6969 false, non_constant_p);
6970 r = cxx_eval_constant_expression (call, op1, allow_non_constant,
6971 addr, non_constant_p);
6976 case POINTER_PLUS_EXPR:
6980 case TRUNC_DIV_EXPR:
6982 case FLOOR_DIV_EXPR:
6983 case ROUND_DIV_EXPR:
6984 case TRUNC_MOD_EXPR:
6986 case ROUND_MOD_EXPR:
6988 case EXACT_DIV_EXPR:
6998 case TRUTH_XOR_EXPR:
7005 case UNORDERED_EXPR:
7014 r = cxx_eval_binary_expression (call, t, allow_non_constant, addr,
7018 /* fold can introduce non-IF versions of these; still treat them as
7019 short-circuiting. */
7020 case TRUTH_AND_EXPR:
7021 case TRUTH_ANDIF_EXPR:
7022 r = cxx_eval_logical_expression (call, t, boolean_false_node,
7024 allow_non_constant, addr,
7029 case TRUTH_ORIF_EXPR:
7030 r = cxx_eval_logical_expression (call, t, boolean_true_node,
7032 allow_non_constant, addr,
7037 r = cxx_eval_array_reference (call, t, allow_non_constant, addr,
7042 r = cxx_eval_component_reference (call, t, allow_non_constant, addr,
7047 r = cxx_eval_bit_field_ref (call, t, allow_non_constant, addr,
7053 r = cxx_eval_conditional_expression (call, t, allow_non_constant, addr,
7058 r = cxx_eval_bare_aggregate (call, t, allow_non_constant, addr,
7063 /* We can get this in a defaulted constructor for a class with a
7064 non-static data member of array type. Either the initializer will
7065 be NULL, meaning default-initialization, or it will be an lvalue
7066 or xvalue of the same type, meaning direct-initialization from the
7067 corresponding member. */
7068 r = cxx_eval_vec_init (call, t, allow_non_constant, addr,
7073 case VIEW_CONVERT_EXPR:
7076 tree oldop = TREE_OPERAND (t, 0);
7078 tree to = TREE_TYPE (t);
7079 tree source = TREE_TYPE (op);
7080 if (TYPE_PTR_P (source) && ARITHMETIC_TYPE_P (to)
7081 && !(TREE_CODE (op) == COMPONENT_REF
7082 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (op, 0)))))
7084 if (!allow_non_constant)
7085 error ("conversion of expression %qE of pointer type "
7086 "cannot yield a constant expression", op);
7087 *non_constant_p = true;
7090 op = cxx_eval_constant_expression (call, TREE_OPERAND (t, 0),
7091 allow_non_constant, addr,
7093 if (*non_constant_p)
7096 /* We didn't fold at the top so we could check for ptr-int
7099 r = fold_build1 (TREE_CODE (t), to, op);
7100 /* Conversion of an out-of-range value has implementation-defined
7101 behavior; the language considers it different from arithmetic
7102 overflow, which is undefined. */
7103 if (TREE_OVERFLOW_P (r) && !TREE_OVERFLOW_P (op))
7104 TREE_OVERFLOW (r) = false;
7108 case EMPTY_CLASS_EXPR:
7109 /* This is good enough for a function argument that might not get
7110 used, and they can't do anything with it, so just return it. */
7114 case DYNAMIC_CAST_EXPR:
7115 case PSEUDO_DTOR_EXPR:
7116 case PREINCREMENT_EXPR:
7117 case POSTINCREMENT_EXPR:
7118 case PREDECREMENT_EXPR:
7119 case POSTDECREMENT_EXPR:
7123 case VEC_DELETE_EXPR:
7127 /* GCC internal stuff. */
7130 case WITH_CLEANUP_EXPR:
7131 case STATEMENT_LIST:
7133 case NON_DEPENDENT_EXPR:
7137 if (!allow_non_constant)
7138 error_at (EXPR_LOC_OR_HERE (t),
7139 "expression %qE is not a constant-expression", t);
7140 *non_constant_p = true;
7144 internal_error ("unexpected expression %qE of kind %s", t,
7145 tree_code_name[TREE_CODE (t)]);
7146 *non_constant_p = true;
7150 if (r == error_mark_node)
7151 *non_constant_p = true;
7153 if (*non_constant_p)
7160 cxx_eval_outermost_constant_expr (tree t, bool allow_non_constant)
7162 bool non_constant_p = false;
7163 tree r = cxx_eval_constant_expression (NULL, t, allow_non_constant,
7164 false, &non_constant_p);
7166 verify_constant (r, allow_non_constant, &non_constant_p);
7168 if (non_constant_p && !allow_non_constant)
7169 return error_mark_node;
7170 else if (non_constant_p && TREE_CONSTANT (t))
7172 /* This isn't actually constant, so unset TREE_CONSTANT. */
7173 if (EXPR_P (t) || TREE_CODE (t) == CONSTRUCTOR)
7176 r = build_nop (TREE_TYPE (t), t);
7177 TREE_CONSTANT (r) = false;
7180 else if (non_constant_p || r == t)
7182 else if (TREE_CODE (r) == CONSTRUCTOR && CLASS_TYPE_P (TREE_TYPE (r)))
7184 if (TREE_CODE (t) == TARGET_EXPR
7185 && TARGET_EXPR_INITIAL (t) == r)
7189 r = get_target_expr (r);
7190 TREE_CONSTANT (r) = true;
7198 /* Returns true if T is a valid subexpression of a constant expression,
7199 even if it isn't itself a constant expression. */
7202 is_sub_constant_expr (tree t)
7204 bool non_constant_p = false;
7205 cxx_eval_constant_expression (NULL, t, true, false, &non_constant_p);
7206 return !non_constant_p;
7209 /* If T represents a constant expression returns its reduced value.
7210 Otherwise return error_mark_node. If T is dependent, then
7214 cxx_constant_value (tree t)
7216 return cxx_eval_outermost_constant_expr (t, false);
7219 /* If T is a constant expression, returns its reduced value.
7220 Otherwise, if T does not have TREE_CONSTANT set, returns T.
7221 Otherwise, returns a version of T without TREE_CONSTANT. */
7224 maybe_constant_value (tree t)
7228 if (type_dependent_expression_p (t)
7229 || type_unknown_p (t)
7230 || !potential_constant_expression (t)
7231 || value_dependent_expression_p (t))
7234 r = cxx_eval_outermost_constant_expr (t, true);
7235 #ifdef ENABLE_CHECKING
7236 /* cp_tree_equal looks through NOPs, so allow them. */
7238 || CONVERT_EXPR_P (t)
7239 || (TREE_CONSTANT (t) && !TREE_CONSTANT (r))
7240 || !cp_tree_equal (r, t));
7245 /* Like maybe_constant_value, but returns a CONSTRUCTOR directly, rather
7246 than wrapped in a TARGET_EXPR. */
7249 maybe_constant_init (tree t)
7251 t = maybe_constant_value (t);
7252 if (TREE_CODE (t) == TARGET_EXPR)
7254 tree init = TARGET_EXPR_INITIAL (t);
7255 if (TREE_CODE (init) == CONSTRUCTOR
7256 && TREE_CONSTANT (init))
7263 /* FIXME see ADDR_EXPR section in potential_constant_expression_1. */
7264 /* Return true if the object referred to by REF has automatic or thread
7267 enum { ck_ok, ck_bad, ck_unknown };
7269 check_automatic_or_tls (tree ref)
7271 enum machine_mode mode;
7272 HOST_WIDE_INT bitsize, bitpos;
7274 int volatilep = 0, unsignedp = 0;
7275 tree decl = get_inner_reference (ref, &bitsize, &bitpos, &offset,
7276 &mode, &unsignedp, &volatilep, false);
7279 /* If there isn't a decl in the middle, we don't know the linkage here,
7280 and this isn't a constant expression anyway. */
7283 dk = decl_storage_duration (decl);
7284 return (dk == dk_auto || dk == dk_thread) ? ck_bad : ck_ok;
7288 /* Return true if the DECL designates a builtin function that is
7289 morally constexpr, in the sense that its parameter types and
7290 return type are literal types and the compiler is allowed to
7291 fold its invocations. */
7294 morally_constexpr_builtin_function_p (tree decl)
7296 tree funtype = TREE_TYPE (decl);
7299 if (!is_builtin_fn (decl))
7301 if (!literal_type_p (TREE_TYPE (funtype)))
7303 for (t = TYPE_ARG_TYPES (funtype); t != NULL ; t = TREE_CHAIN (t))
7305 if (t == void_list_node)
7307 if (!literal_type_p (TREE_VALUE (t)))
7310 /* We assume no varargs builtins are suitable. */
7314 /* Return true if T denotes a potentially constant expression. Issue
7315 diagnostic as appropriate under control of FLAGS. If WANT_RVAL is true,
7316 an lvalue-rvalue conversion is implied.
7318 C++0x [expr.const] used to say
7320 6 An expression is a potential constant expression if it is
7321 a constant expression where all occurences of function
7322 parameters are replaced by arbitrary constant expressions
7323 of the appropriate type.
7325 2 A conditional expression is a constant expression unless it
7326 involves one of the following as a potentially evaluated
7327 subexpression (3.2), but subexpressions of logical AND (5.14),
7328 logical OR (5.15), and conditional (5.16) operations that are
7329 not evaluated are not considered. */
7332 potential_constant_expression_1 (tree t, bool want_rval, tsubst_flags_t flags)
7334 enum { any = false, rval = true };
7338 /* C++98 has different rules for the form of a constant expression that
7339 are enforced in the parser, so we can assume that anything that gets
7340 this far is suitable. */
7341 if (cxx_dialect < cxx0x)
7344 if (t == error_mark_node)
7348 if (TREE_THIS_VOLATILE (t))
7350 if (flags & tf_error)
7351 error ("expression %qE has side-effects", t);
7354 if (CONSTANT_CLASS_P (t))
7356 if (TREE_OVERFLOW (t))
7358 if (flags & tf_error)
7360 permerror (EXPR_LOC_OR_HERE (t),
7361 "overflow in constant expression");
7362 if (flag_permissive)
7370 switch (TREE_CODE (t))
7376 case TEMPLATE_ID_EXPR:
7383 case TEMPLATE_PARM_INDEX:
7385 case IDENTIFIER_NODE:
7389 /* -- this (5.1) unless it appears as the postfix-expression in a
7390 class member access expression, including the result of the
7391 implicit transformation in the body of the non-static
7392 member function (9.3.1); */
7393 /* FIXME this restriction seems pointless since the standard dropped
7394 "potential constant expression". */
7395 if (is_this_parameter (t))
7397 if (flags & tf_error)
7398 error ("%qE is not a potential constant expression", t);
7403 case AGGR_INIT_EXPR:
7405 /* -- an invocation of a function other than a constexpr function
7406 or a constexpr constructor. */
7408 tree fun = get_function_named_in_call (t);
7409 const int nargs = call_expr_nargs (t);
7412 if (is_overloaded_fn (fun))
7414 if (TREE_CODE (fun) == FUNCTION_DECL)
7416 if (builtin_valid_in_constant_expr_p (fun))
7418 if (!DECL_DECLARED_CONSTEXPR_P (fun)
7419 && !morally_constexpr_builtin_function_p (fun))
7421 if (flags & tf_error)
7422 error ("%qD is not %<constexpr%>", fun);
7425 /* A call to a non-static member function takes the address
7426 of the object as the first argument. But in a constant
7427 expression the address will be folded away, so look
7429 if (DECL_NONSTATIC_MEMBER_FUNCTION_P (fun)
7430 && !DECL_CONSTRUCTOR_P (fun))
7432 tree x = get_nth_callarg (t, 0);
7433 if (is_this_parameter (x))
7435 else if (!potential_constant_expression_1 (x, rval, flags))
7437 if (flags & tf_error)
7438 error ("object argument is not a potential "
7439 "constant expression");
7446 fun = get_first_fn (fun);
7447 /* Skip initial arguments to base constructors. */
7448 if (DECL_BASE_CONSTRUCTOR_P (fun))
7449 i = num_artificial_parms_for (fun);
7450 fun = DECL_ORIGIN (fun);
7454 if (potential_constant_expression_1 (fun, rval, flags))
7455 /* Might end up being a constant function pointer. */;
7458 if (flags & tf_error)
7459 error ("%qE is not a function name", fun);
7463 for (; i < nargs; ++i)
7465 tree x = get_nth_callarg (t, i);
7466 if (!potential_constant_expression_1 (x, rval, flags))
7468 if (flags & tf_error)
7469 error ("argument in position %qP is not a "
7470 "potential constant expression", i);
7477 case NON_LVALUE_EXPR:
7478 /* -- an lvalue-to-rvalue conversion (4.1) unless it is applied to
7479 -- an lvalue of integral type that refers to a non-volatile
7480 const variable or static data member initialized with
7481 constant expressions, or
7483 -- an lvalue of literal type that refers to non-volatile
7484 object defined with constexpr, or that refers to a
7485 sub-object of such an object; */
7486 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval, flags);
7489 if (want_rval && !decl_constant_var_p (t)
7490 && !dependent_type_p (TREE_TYPE (t)))
7492 if (flags & tf_error)
7493 non_const_var_error (t);
7500 case VIEW_CONVERT_EXPR:
7501 /* -- an array-to-pointer conversion that is applied to an lvalue
7502 that designates an object with thread or automatic storage
7503 duration; FIXME not implemented as it breaks constexpr arrays;
7504 need to fix the standard
7505 -- a type conversion from a pointer or pointer-to-member type
7506 to a literal type. */
7508 tree from = TREE_OPERAND (t, 0);
7509 tree source = TREE_TYPE (from);
7510 tree target = TREE_TYPE (t);
7511 if (TYPE_PTR_P (source) && ARITHMETIC_TYPE_P (target)
7512 && !(TREE_CODE (from) == COMPONENT_REF
7513 && TYPE_PTRMEMFUNC_P (TREE_TYPE (TREE_OPERAND (from, 0)))))
7515 if (flags & tf_error)
7516 error ("conversion of expression %qE of pointer type "
7517 "cannot yield a constant expression", from);
7520 return (potential_constant_expression_1
7521 (from, TREE_CODE (t) != VIEW_CONVERT_EXPR, flags));
7525 /* -- a unary operator & that is applied to an lvalue that
7526 designates an object with thread or automatic storage
7528 t = TREE_OPERAND (t, 0);
7530 /* FIXME adjust when issue 1197 is fully resolved. For now don't do
7531 any checking here, as we might dereference the pointer later. If
7532 we remove this code, also remove check_automatic_or_tls. */
7533 i = check_automatic_or_tls (t);
7538 if (flags & tf_error)
7539 error ("address-of an object %qE with thread local or "
7540 "automatic storage is not a constant expression", t);
7544 return potential_constant_expression_1 (t, any, flags);
7550 /* -- a class member access unless its postfix-expression is
7551 of literal type or of pointer to literal type. */
7552 /* This test would be redundant, as it follows from the
7553 postfix-expression being a potential constant expression. */
7554 return potential_constant_expression_1 (TREE_OPERAND (t, 0),
7557 case EXPR_PACK_EXPANSION:
7558 return potential_constant_expression_1 (PACK_EXPANSION_PATTERN (t),
7563 tree x = TREE_OPERAND (t, 0);
7565 if (is_this_parameter (x))
7567 if (DECL_CONSTRUCTOR_P (DECL_CONTEXT (x)) && want_rval)
7569 if (flags & tf_error)
7570 sorry ("use of the value of the object being constructed "
7571 "in a constant expression");
7576 return potential_constant_expression_1 (x, rval, flags);
7580 case DYNAMIC_CAST_EXPR:
7581 case PSEUDO_DTOR_EXPR:
7582 case PREINCREMENT_EXPR:
7583 case POSTINCREMENT_EXPR:
7584 case PREDECREMENT_EXPR:
7585 case POSTDECREMENT_EXPR:
7589 case VEC_DELETE_EXPR:
7593 /* GCC internal stuff. */
7596 case WITH_CLEANUP_EXPR:
7597 case CLEANUP_POINT_EXPR:
7598 case MUST_NOT_THROW_EXPR:
7599 case TRY_CATCH_EXPR:
7600 case STATEMENT_LIST:
7601 /* Don't bother trying to define a subset of statement-expressions to
7602 be constant-expressions, at least for now. */
7606 if (flags & tf_error)
7607 error ("expression %qE is not a constant-expression", t);
7611 /* -- a typeid expression whose operand is of polymorphic
7614 tree e = TREE_OPERAND (t, 0);
7615 if (!TYPE_P (e) && !type_dependent_expression_p (e)
7616 && TYPE_POLYMORPHIC_P (TREE_TYPE (e)))
7618 if (flags & tf_error)
7619 error ("typeid-expression is not a constant expression "
7620 "because %qE is of polymorphic type", e);
7627 /* -- a subtraction where both operands are pointers. */
7628 if (TYPE_PTR_P (TREE_OPERAND (t, 0))
7629 && TYPE_PTR_P (TREE_OPERAND (t, 1)))
7631 if (flags & tf_error)
7632 error ("difference of two pointer expressions is not "
7633 "a constant expression");
7645 /* -- a relational or equality operator where at least
7646 one of the operands is a pointer. */
7647 if (TYPE_PTR_P (TREE_OPERAND (t, 0))
7648 || TYPE_PTR_P (TREE_OPERAND (t, 1)))
7650 if (flags & tf_error)
7651 error ("pointer comparison expression is not a "
7652 "constant expression");
7662 case FIX_TRUNC_EXPR:
7667 case TRUTH_NOT_EXPR:
7668 case FIXED_CONVERT_EXPR:
7669 case UNARY_PLUS_EXPR:
7670 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval,
7674 case CONST_CAST_EXPR:
7675 case STATIC_CAST_EXPR:
7676 case REINTERPRET_CAST_EXPR:
7677 return (potential_constant_expression_1
7678 (TREE_OPERAND (t, 0),
7679 TREE_CODE (TREE_TYPE (t)) != REFERENCE_TYPE, flags));
7682 case NON_DEPENDENT_EXPR:
7683 /* For convenience. */
7685 return potential_constant_expression_1 (TREE_OPERAND (t, 0),
7689 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
7694 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
7699 VEC(constructor_elt, gc) *v = CONSTRUCTOR_ELTS (t);
7700 constructor_elt *ce;
7701 for (i = 0; VEC_iterate (constructor_elt, v, i, ce); ++i)
7702 if (!potential_constant_expression_1 (ce->value, want_rval, flags))
7709 gcc_assert (TREE_PURPOSE (t) == NULL_TREE
7710 || DECL_P (TREE_PURPOSE (t)));
7711 if (!potential_constant_expression_1 (TREE_VALUE (t), want_rval,
7714 if (TREE_CHAIN (t) == NULL_TREE)
7716 return potential_constant_expression_1 (TREE_CHAIN (t), want_rval,
7720 case TRUNC_DIV_EXPR:
7722 case FLOOR_DIV_EXPR:
7723 case ROUND_DIV_EXPR:
7724 case TRUNC_MOD_EXPR:
7726 case ROUND_MOD_EXPR:
7728 tree denom = TREE_OPERAND (t, 1);
7729 /* We can't call maybe_constant_value on an expression
7730 that hasn't been through fold_non_dependent_expr yet. */
7731 if (!processing_template_decl)
7732 denom = maybe_constant_value (denom);
7733 if (integer_zerop (denom))
7735 if (flags & tf_error)
7736 error ("division by zero is not a constant-expression");
7748 /* check_return_expr sometimes wraps a TARGET_EXPR in a
7749 COMPOUND_EXPR; don't get confused. Also handle EMPTY_CLASS_EXPR
7750 introduced by build_call_a. */
7751 tree op0 = TREE_OPERAND (t, 0);
7752 tree op1 = TREE_OPERAND (t, 1);
7754 if ((TREE_CODE (op0) == TARGET_EXPR && op1 == TARGET_EXPR_SLOT (op0))
7755 || TREE_CODE (op1) == EMPTY_CLASS_EXPR)
7756 return potential_constant_expression_1 (op0, want_rval, flags);
7761 /* If the first operand is the non-short-circuit constant, look at
7762 the second operand; otherwise we only care about the first one for
7764 case TRUTH_AND_EXPR:
7765 case TRUTH_ANDIF_EXPR:
7766 tmp = boolean_true_node;
7769 case TRUTH_ORIF_EXPR:
7770 tmp = boolean_false_node;
7772 if (TREE_OPERAND (t, 0) == tmp)
7773 return potential_constant_expression_1 (TREE_OPERAND (t, 1), rval, flags);
7775 return potential_constant_expression_1 (TREE_OPERAND (t, 0), rval, flags);
7779 case POINTER_PLUS_EXPR:
7781 case EXACT_DIV_EXPR:
7791 case TRUTH_XOR_EXPR:
7792 case UNORDERED_EXPR:
7804 case ARRAY_RANGE_REF:
7808 for (i = 0; i < 2; ++i)
7809 if (!potential_constant_expression_1 (TREE_OPERAND (t, i),
7816 /* If the condition is a known constant, we know which of the legs we
7817 care about; otherwise we only require that the condition and
7818 either of the legs be potentially constant. */
7819 tmp = TREE_OPERAND (t, 0);
7820 if (!potential_constant_expression_1 (tmp, rval, flags))
7822 else if (tmp == boolean_true_node)
7823 return potential_constant_expression_1 (TREE_OPERAND (t, 1),
7825 else if (tmp == boolean_false_node)
7826 return potential_constant_expression_1 (TREE_OPERAND (t, 2),
7828 for (i = 1; i < 3; ++i)
7829 if (potential_constant_expression_1 (TREE_OPERAND (t, i),
7830 want_rval, tf_none))
7832 if (flags & tf_error)
7833 error ("expression %qE is not a constant-expression", t);
7837 if (VEC_INIT_EXPR_IS_CONSTEXPR (t))
7839 if (flags & tf_error)
7841 error ("non-constant array initialization");
7842 diagnose_non_constexpr_vec_init (t);
7847 sorry ("unexpected ast of kind %s", tree_code_name[TREE_CODE (t)]);
7853 /* The main entry point to the above. */
7856 potential_constant_expression (tree t)
7858 return potential_constant_expression_1 (t, false, tf_none);
7861 /* As above, but require a constant rvalue. */
7864 potential_rvalue_constant_expression (tree t)
7866 return potential_constant_expression_1 (t, true, tf_none);
7869 /* Like above, but complain about non-constant expressions. */
7872 require_potential_constant_expression (tree t)
7874 return potential_constant_expression_1 (t, false, tf_warning_or_error);
7877 /* Cross product of the above. */
7880 require_potential_rvalue_constant_expression (tree t)
7882 return potential_constant_expression_1 (t, true, tf_warning_or_error);
7885 /* Constructor for a lambda expression. */
7888 build_lambda_expr (void)
7890 tree lambda = make_node (LAMBDA_EXPR);
7891 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) = CPLD_NONE;
7892 LAMBDA_EXPR_CAPTURE_LIST (lambda) = NULL_TREE;
7893 LAMBDA_EXPR_THIS_CAPTURE (lambda) = NULL_TREE;
7894 LAMBDA_EXPR_RETURN_TYPE (lambda) = NULL_TREE;
7895 LAMBDA_EXPR_MUTABLE_P (lambda) = false;
7899 /* Create the closure object for a LAMBDA_EXPR. */
7902 build_lambda_object (tree lambda_expr)
7904 /* Build aggregate constructor call.
7905 - cp_parser_braced_list
7906 - cp_parser_functional_cast */
7907 VEC(constructor_elt,gc) *elts = NULL;
7908 tree node, expr, type;
7909 location_t saved_loc;
7911 if (processing_template_decl)
7914 /* Make sure any error messages refer to the lambda-introducer. */
7915 saved_loc = input_location;
7916 input_location = LAMBDA_EXPR_LOCATION (lambda_expr);
7918 for (node = LAMBDA_EXPR_CAPTURE_LIST (lambda_expr);
7920 node = TREE_CHAIN (node))
7922 tree field = TREE_PURPOSE (node);
7923 tree val = TREE_VALUE (node);
7925 if (field == error_mark_node)
7927 expr = error_mark_node;
7934 /* Mere mortals can't copy arrays with aggregate initialization, so
7935 do some magic to make it work here. */
7936 if (TREE_CODE (TREE_TYPE (field)) == ARRAY_TYPE)
7937 val = build_array_copy (val);
7938 else if (DECL_NORMAL_CAPTURE_P (field)
7939 && TREE_CODE (TREE_TYPE (field)) != REFERENCE_TYPE)
7941 /* "the entities that are captured by copy are used to
7942 direct-initialize each corresponding non-static data
7943 member of the resulting closure object."
7945 There's normally no way to express direct-initialization
7946 from an element of a CONSTRUCTOR, so we build up a special
7947 TARGET_EXPR to bypass the usual copy-initialization. */
7948 val = force_rvalue (val);
7949 if (TREE_CODE (val) == TARGET_EXPR)
7950 TARGET_EXPR_DIRECT_INIT_P (val) = true;
7953 CONSTRUCTOR_APPEND_ELT (elts, DECL_NAME (field), val);
7956 expr = build_constructor (init_list_type_node, elts);
7957 CONSTRUCTOR_IS_DIRECT_INIT (expr) = 1;
7959 /* N2927: "[The closure] class type is not an aggregate."
7960 But we briefly treat it as an aggregate to make this simpler. */
7961 type = TREE_TYPE (lambda_expr);
7962 CLASSTYPE_NON_AGGREGATE (type) = 0;
7963 expr = finish_compound_literal (type, expr, tf_warning_or_error);
7964 CLASSTYPE_NON_AGGREGATE (type) = 1;
7967 input_location = saved_loc;
7971 /* Return an initialized RECORD_TYPE for LAMBDA.
7972 LAMBDA must have its explicit captures already. */
7975 begin_lambda_type (tree lambda)
7980 /* Unique name. This is just like an unnamed class, but we cannot use
7981 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
7983 name = make_lambda_name ();
7985 /* Create the new RECORD_TYPE for this lambda. */
7986 type = xref_tag (/*tag_code=*/record_type,
7988 /*scope=*/ts_within_enclosing_non_class,
7989 /*template_header_p=*/false);
7992 /* Designate it as a struct so that we can use aggregate initialization. */
7993 CLASSTYPE_DECLARED_CLASS (type) = false;
7995 /* Clear base types. */
7996 xref_basetypes (type, /*bases=*/NULL_TREE);
7998 /* Start the class. */
7999 type = begin_class_definition (type, /*attributes=*/NULL_TREE);
8001 /* Cross-reference the expression and the type. */
8002 TREE_TYPE (lambda) = type;
8003 CLASSTYPE_LAMBDA_EXPR (type) = lambda;
8008 /* Returns the type to use for the return type of the operator() of a
8012 lambda_return_type (tree expr)
8015 if (BRACE_ENCLOSED_INITIALIZER_P (expr))
8017 warning (0, "cannot deduce lambda return type from a braced-init-list");
8018 return void_type_node;
8020 if (type_dependent_expression_p (expr))
8022 type = cxx_make_type (DECLTYPE_TYPE);
8023 DECLTYPE_TYPE_EXPR (type) = expr;
8024 DECLTYPE_FOR_LAMBDA_RETURN (type) = true;
8025 SET_TYPE_STRUCTURAL_EQUALITY (type);
8028 type = type_decays_to (unlowered_expr_type (expr));
8032 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
8036 lambda_function (tree lambda)
8039 if (TREE_CODE (lambda) == LAMBDA_EXPR)
8040 type = TREE_TYPE (lambda);
8043 gcc_assert (LAMBDA_TYPE_P (type));
8044 /* Don't let debug_tree cause instantiation. */
8045 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type) && !COMPLETE_TYPE_P (type))
8047 lambda = lookup_member (type, ansi_opname (CALL_EXPR),
8048 /*protect=*/0, /*want_type=*/false);
8050 lambda = BASELINK_FUNCTIONS (lambda);
8054 /* Returns the type to use for the FIELD_DECL corresponding to the
8056 The caller should add REFERENCE_TYPE for capture by reference. */
8059 lambda_capture_field_type (tree expr)
8062 if (type_dependent_expression_p (expr))
8064 type = cxx_make_type (DECLTYPE_TYPE);
8065 DECLTYPE_TYPE_EXPR (type) = expr;
8066 DECLTYPE_FOR_LAMBDA_CAPTURE (type) = true;
8067 SET_TYPE_STRUCTURAL_EQUALITY (type);
8070 type = non_reference (unlowered_expr_type (expr));
8074 /* Recompute the return type for LAMBDA with body of the form:
8075 { return EXPR ; } */
8078 apply_lambda_return_type (tree lambda, tree return_type)
8080 tree fco = lambda_function (lambda);
8083 LAMBDA_EXPR_RETURN_TYPE (lambda) = return_type;
8085 /* If we got a DECLTYPE_TYPE, don't stick it in the function yet,
8086 it would interfere with instantiating the closure type. */
8087 if (dependent_type_p (return_type))
8089 if (return_type == error_mark_node)
8092 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
8093 TREE_TYPE (METHOD_TYPE) == return-type */
8094 TREE_TYPE (fco) = change_return_type (return_type, TREE_TYPE (fco));
8096 result = DECL_RESULT (fco);
8097 if (result == NULL_TREE)
8100 /* We already have a DECL_RESULT from start_preparsed_function.
8101 Now we need to redo the work it and allocate_struct_function
8102 did to reflect the new type. */
8103 result = build_decl (input_location, RESULT_DECL, NULL_TREE,
8104 TYPE_MAIN_VARIANT (return_type));
8105 DECL_ARTIFICIAL (result) = 1;
8106 DECL_IGNORED_P (result) = 1;
8107 cp_apply_type_quals_to_decl (cp_type_quals (return_type),
8110 DECL_RESULT (fco) = result;
8112 if (!processing_template_decl && aggregate_value_p (result, fco))
8114 #ifdef PCC_STATIC_STRUCT_RETURN
8115 cfun->returns_pcc_struct = 1;
8117 cfun->returns_struct = 1;
8122 /* DECL is a local variable or parameter from the surrounding scope of a
8123 lambda-expression. Returns the decltype for a use of the capture field
8124 for DECL even if it hasn't been captured yet. */
8127 capture_decltype (tree decl)
8129 tree lam = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl));
8130 /* FIXME do lookup instead of list walk? */
8131 tree cap = value_member (decl, LAMBDA_EXPR_CAPTURE_LIST (lam));
8135 type = TREE_TYPE (TREE_PURPOSE (cap));
8137 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam))
8140 error ("%qD is not captured", decl);
8141 return error_mark_node;
8144 type = TREE_TYPE (decl);
8145 if (TREE_CODE (type) == REFERENCE_TYPE
8146 && TREE_CODE (TREE_TYPE (type)) != FUNCTION_TYPE)
8147 type = TREE_TYPE (type);
8150 case CPLD_REFERENCE:
8151 type = TREE_TYPE (decl);
8152 if (TREE_CODE (type) != REFERENCE_TYPE)
8153 type = build_reference_type (TREE_TYPE (decl));
8160 if (TREE_CODE (type) != REFERENCE_TYPE)
8162 if (!LAMBDA_EXPR_MUTABLE_P (lam))
8163 type = cp_build_qualified_type (type, (cp_type_quals (type)
8165 type = build_reference_type (type);
8170 /* From an ID and INITIALIZER, create a capture (by reference if
8171 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
8175 add_capture (tree lambda, tree id, tree initializer, bool by_reference_p,
8176 bool explicit_init_p)
8181 type = lambda_capture_field_type (initializer);
8184 type = build_reference_type (type);
8185 if (!real_lvalue_p (initializer))
8186 error ("cannot capture %qE by reference", initializer);
8189 /* Make member variable. */
8190 member = build_lang_decl (FIELD_DECL, id, type);
8191 if (!explicit_init_p)
8192 /* Normal captures are invisible to name lookup but uses are replaced
8193 with references to the capture field; we implement this by only
8194 really making them invisible in unevaluated context; see
8195 qualify_lookup. For now, let's make explicitly initialized captures
8197 DECL_NORMAL_CAPTURE_P (member) = true;
8199 /* Add it to the appropriate closure class if we've started it. */
8200 if (current_class_type && current_class_type == TREE_TYPE (lambda))
8201 finish_member_declaration (member);
8203 LAMBDA_EXPR_CAPTURE_LIST (lambda)
8204 = tree_cons (member, initializer, LAMBDA_EXPR_CAPTURE_LIST (lambda));
8206 if (id == get_identifier ("__this"))
8208 if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda))
8209 error ("already captured %<this%> in lambda expression");
8210 LAMBDA_EXPR_THIS_CAPTURE (lambda) = member;
8216 /* Register all the capture members on the list CAPTURES, which is the
8217 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
8219 void register_capture_members (tree captures)
8223 register_capture_members (TREE_CHAIN (captures));
8224 finish_member_declaration (TREE_PURPOSE (captures));
8228 /* Given a FIELD_DECL decl belonging to a closure type, return a
8229 COMPONENT_REF of it relative to the 'this' parameter of the op() for
8233 thisify_lambda_field (tree decl)
8235 tree context = lambda_function (DECL_CONTEXT (decl));
8236 tree object = cp_build_indirect_ref (DECL_ARGUMENTS (context),
8238 tf_warning_or_error);
8239 return finish_non_static_data_member (decl, object,
8240 /*qualifying_scope*/NULL_TREE);
8243 /* Similar to add_capture, except this works on a stack of nested lambdas.
8244 BY_REFERENCE_P in this case is derived from the default capture mode.
8245 Returns the capture for the lambda at the bottom of the stack. */
8248 add_default_capture (tree lambda_stack, tree id, tree initializer)
8250 bool this_capture_p = (id == get_identifier ("__this"));
8252 tree member = NULL_TREE;
8254 tree saved_class_type = current_class_type;
8258 for (node = lambda_stack;
8260 node = TREE_CHAIN (node))
8262 tree lambda = TREE_VALUE (node);
8264 current_class_type = TREE_TYPE (lambda);
8265 member = add_capture (lambda,
8270 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda)
8271 == CPLD_REFERENCE)),
8272 /*explicit_init_p=*/false);
8273 initializer = thisify_lambda_field (member);
8276 current_class_type = saved_class_type;
8281 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
8282 INDIRECT_REF, possibly adding it through default capturing. */
8285 lambda_expr_this_capture (tree lambda)
8289 tree this_capture = LAMBDA_EXPR_THIS_CAPTURE (lambda);
8291 /* Try to default capture 'this' if we can. */
8293 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) != CPLD_NONE)
8295 tree containing_function = TYPE_CONTEXT (TREE_TYPE (lambda));
8296 tree lambda_stack = tree_cons (NULL_TREE, lambda, NULL_TREE);
8297 tree init = NULL_TREE;
8299 /* If we are in a lambda function, we can move out until we hit:
8300 1. a non-lambda function,
8301 2. a lambda function capturing 'this', or
8302 3. a non-default capturing lambda function. */
8303 while (LAMBDA_FUNCTION_P (containing_function))
8306 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function));
8308 if (LAMBDA_EXPR_THIS_CAPTURE (lambda))
8310 /* An outer lambda has already captured 'this'. */
8311 tree cap = LAMBDA_EXPR_THIS_CAPTURE (lambda);
8312 init = thisify_lambda_field (cap);
8316 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda) == CPLD_NONE)
8317 /* An outer lambda won't let us capture 'this'. */
8320 lambda_stack = tree_cons (NULL_TREE,
8324 containing_function = decl_function_context (containing_function);
8327 if (!init && DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function)
8328 && !LAMBDA_FUNCTION_P (containing_function))
8329 /* First parameter is 'this'. */
8330 init = DECL_ARGUMENTS (containing_function);
8333 this_capture = add_default_capture (lambda_stack,
8334 /*id=*/get_identifier ("__this"),
8340 error ("%<this%> was not captured for this lambda function");
8341 result = error_mark_node;
8345 /* To make sure that current_class_ref is for the lambda. */
8346 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref)) == TREE_TYPE (lambda));
8348 result = finish_non_static_data_member (this_capture,
8350 /*qualifying_scope=*/NULL_TREE);
8352 /* If 'this' is captured, each use of 'this' is transformed into an
8353 access to the corresponding unnamed data member of the closure
8354 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
8355 ensures that the transformed expression is an rvalue. ] */
8356 result = rvalue (result);
8362 /* Returns the method basetype of the innermost non-lambda function, or
8363 NULL_TREE if none. */
8366 nonlambda_method_basetype (void)
8369 if (!current_class_ref)
8372 type = current_class_type;
8373 if (!LAMBDA_TYPE_P (type))
8376 /* Find the nearest enclosing non-lambda function. */
8377 fn = TYPE_NAME (type);
8379 fn = decl_function_context (fn);
8380 while (fn && LAMBDA_FUNCTION_P (fn));
8382 if (!fn || !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn))
8385 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn));
8388 /* If the closure TYPE has a static op(), also add a conversion to function
8392 maybe_add_lambda_conv_op (tree type)
8394 bool nested = (current_function_decl != NULL_TREE);
8395 tree callop = lambda_function (type);
8396 tree rettype, name, fntype, fn, body, compound_stmt;
8397 tree thistype, stattype, statfn, convfn, call, arg;
8398 VEC (tree, gc) *argvec;
8400 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type)) != NULL_TREE)
8403 stattype = build_function_type (TREE_TYPE (TREE_TYPE (callop)),
8404 FUNCTION_ARG_CHAIN (callop));
8406 /* First build up the conversion op. */
8408 rettype = build_pointer_type (stattype);
8409 name = mangle_conv_op_name_for_type (rettype);
8410 thistype = cp_build_qualified_type (type, TYPE_QUAL_CONST);
8411 fntype = build_method_type_directly (thistype, rettype, void_list_node);
8412 fn = convfn = build_lang_decl (FUNCTION_DECL, name, fntype);
8413 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
8415 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
8416 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
8417 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
8419 SET_OVERLOADED_OPERATOR_CODE (fn, TYPE_EXPR);
8420 grokclassfn (type, fn, NO_SPECIAL);
8421 set_linkage_according_to_type (type, fn);
8422 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
8423 DECL_IN_AGGR_P (fn) = 1;
8424 DECL_ARTIFICIAL (fn) = 1;
8425 DECL_NOT_REALLY_EXTERN (fn) = 1;
8426 DECL_DECLARED_INLINE_P (fn) = 1;
8427 DECL_ARGUMENTS (fn) = build_this_parm (fntype, TYPE_QUAL_CONST);
8429 DECL_INTERFACE_KNOWN (fn) = 1;
8431 add_method (type, fn, NULL_TREE);
8433 /* Generic thunk code fails for varargs; we'll complain in mark_used if
8434 the conversion op is used. */
8435 if (varargs_function_p (callop))
8437 DECL_DELETED_FN (fn) = 1;
8441 /* Now build up the thunk to be returned. */
8443 name = get_identifier ("_FUN");
8444 fn = statfn = build_lang_decl (FUNCTION_DECL, name, stattype);
8445 DECL_SOURCE_LOCATION (fn) = DECL_SOURCE_LOCATION (callop);
8446 if (TARGET_PTRMEMFUNC_VBIT_LOCATION == ptrmemfunc_vbit_in_pfn
8447 && DECL_ALIGN (fn) < 2 * BITS_PER_UNIT)
8448 DECL_ALIGN (fn) = 2 * BITS_PER_UNIT;
8449 grokclassfn (type, fn, NO_SPECIAL);
8450 set_linkage_according_to_type (type, fn);
8451 rest_of_decl_compilation (fn, toplevel_bindings_p (), at_eof);
8452 DECL_IN_AGGR_P (fn) = 1;
8453 DECL_ARTIFICIAL (fn) = 1;
8454 DECL_NOT_REALLY_EXTERN (fn) = 1;
8455 DECL_DECLARED_INLINE_P (fn) = 1;
8456 DECL_STATIC_FUNCTION_P (fn) = 1;
8457 DECL_ARGUMENTS (fn) = copy_list (DECL_CHAIN (DECL_ARGUMENTS (callop)));
8458 for (arg = DECL_ARGUMENTS (fn); arg; arg = DECL_CHAIN (arg))
8459 DECL_CONTEXT (arg) = fn;
8461 DECL_INTERFACE_KNOWN (fn) = 1;
8463 add_method (type, fn, NULL_TREE);
8466 push_function_context ();
8468 /* Generate the body of the thunk. */
8470 start_preparsed_function (statfn, NULL_TREE,
8471 SF_PRE_PARSED | SF_INCLASS_INLINE);
8472 if (DECL_ONE_ONLY (statfn))
8474 /* Put the thunk in the same comdat group as the call op. */
8475 struct cgraph_node *callop_node, *thunk_node;
8476 DECL_COMDAT_GROUP (statfn) = DECL_COMDAT_GROUP (callop);
8477 callop_node = cgraph_get_create_node (callop);
8478 thunk_node = cgraph_get_create_node (statfn);
8479 gcc_assert (callop_node->same_comdat_group == NULL);
8480 gcc_assert (thunk_node->same_comdat_group == NULL);
8481 callop_node->same_comdat_group = thunk_node;
8482 thunk_node->same_comdat_group = callop_node;
8484 body = begin_function_body ();
8485 compound_stmt = begin_compound_stmt (0);
8487 arg = build1 (NOP_EXPR, TREE_TYPE (DECL_ARGUMENTS (callop)),
8489 argvec = make_tree_vector ();
8490 VEC_quick_push (tree, argvec, arg);
8491 for (arg = DECL_ARGUMENTS (statfn); arg; arg = DECL_CHAIN (arg))
8492 VEC_safe_push (tree, gc, argvec, arg);
8493 call = build_call_a (callop, VEC_length (tree, argvec),
8494 VEC_address (tree, argvec));
8495 CALL_FROM_THUNK_P (call) = 1;
8496 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call)))
8497 call = build_cplus_new (TREE_TYPE (call), call, tf_warning_or_error);
8498 call = convert_from_reference (call);
8499 finish_return_stmt (call);
8501 finish_compound_stmt (compound_stmt);
8502 finish_function_body (body);
8504 expand_or_defer_fn (finish_function (2));
8506 /* Generate the body of the conversion op. */
8508 start_preparsed_function (convfn, NULL_TREE,
8509 SF_PRE_PARSED | SF_INCLASS_INLINE);
8510 body = begin_function_body ();
8511 compound_stmt = begin_compound_stmt (0);
8513 finish_return_stmt (decay_conversion (statfn));
8515 finish_compound_stmt (compound_stmt);
8516 finish_function_body (body);
8518 expand_or_defer_fn (finish_function (2));
8521 pop_function_context ();
8523 #include "gt-cp-semantics.h"