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 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"
34 #include "tree-inline.h"
35 #include "tree-mudflap.h"
44 #include "diagnostic.h"
46 #include "tree-iterator.h"
51 /* There routines provide a modular interface to perform many parsing
52 operations. They may therefore be used during actual parsing, or
53 during template instantiation, which may be regarded as a
54 degenerate form of parsing. */
56 static tree
maybe_convert_cond (tree
);
57 static tree
finalize_nrv_r (tree
*, int *, void *);
58 static tree
capture_decltype (tree
);
59 static tree
thisify_lambda_field (tree
);
62 /* Deferred Access Checking Overview
63 ---------------------------------
65 Most C++ expressions and declarations require access checking
66 to be performed during parsing. However, in several cases,
67 this has to be treated differently.
69 For member declarations, access checking has to be deferred
70 until more information about the declaration is known. For
82 When we are parsing the function return type `A::X', we don't
83 really know if this is allowed until we parse the function name.
85 Furthermore, some contexts require that access checking is
86 never performed at all. These include class heads, and template
89 Typical use of access checking functions is described here:
91 1. When we enter a context that requires certain access checking
92 mode, the function `push_deferring_access_checks' is called with
93 DEFERRING argument specifying the desired mode. Access checking
94 may be performed immediately (dk_no_deferred), deferred
95 (dk_deferred), or not performed (dk_no_check).
97 2. When a declaration such as a type, or a variable, is encountered,
98 the function `perform_or_defer_access_check' is called. It
99 maintains a VEC of all deferred checks.
101 3. The global `current_class_type' or `current_function_decl' is then
102 setup by the parser. `enforce_access' relies on these information
105 4. Upon exiting the context mentioned in step 1,
106 `perform_deferred_access_checks' is called to check all declaration
107 stored in the VEC. `pop_deferring_access_checks' is then
108 called to restore the previous access checking mode.
110 In case of parsing error, we simply call `pop_deferring_access_checks'
111 without `perform_deferred_access_checks'. */
113 typedef struct GTY(()) deferred_access
{
114 /* A VEC representing name-lookups for which we have deferred
115 checking access controls. We cannot check the accessibility of
116 names used in a decl-specifier-seq until we know what is being
117 declared because code like:
124 A::B* A::f() { return 0; }
126 is valid, even though `A::B' is not generally accessible. */
127 VEC (deferred_access_check
,gc
)* GTY(()) deferred_access_checks
;
129 /* The current mode of access checks. */
130 enum deferring_kind deferring_access_checks_kind
;
133 DEF_VEC_O (deferred_access
);
134 DEF_VEC_ALLOC_O (deferred_access
,gc
);
136 /* Data for deferred access checking. */
137 static GTY(()) VEC(deferred_access
,gc
) *deferred_access_stack
;
138 static GTY(()) unsigned deferred_access_no_check
;
140 /* Save the current deferred access states and start deferred
141 access checking iff DEFER_P is true. */
144 push_deferring_access_checks (deferring_kind deferring
)
146 /* For context like template instantiation, access checking
147 disabling applies to all nested context. */
148 if (deferred_access_no_check
|| deferring
== dk_no_check
)
149 deferred_access_no_check
++;
152 deferred_access
*ptr
;
154 ptr
= VEC_safe_push (deferred_access
, gc
, deferred_access_stack
, NULL
);
155 ptr
->deferred_access_checks
= NULL
;
156 ptr
->deferring_access_checks_kind
= deferring
;
160 /* Resume deferring access checks again after we stopped doing
164 resume_deferring_access_checks (void)
166 if (!deferred_access_no_check
)
167 VEC_last (deferred_access
, deferred_access_stack
)
168 ->deferring_access_checks_kind
= dk_deferred
;
171 /* Stop deferring access checks. */
174 stop_deferring_access_checks (void)
176 if (!deferred_access_no_check
)
177 VEC_last (deferred_access
, deferred_access_stack
)
178 ->deferring_access_checks_kind
= dk_no_deferred
;
181 /* Discard the current deferred access checks and restore the
185 pop_deferring_access_checks (void)
187 if (deferred_access_no_check
)
188 deferred_access_no_check
--;
190 VEC_pop (deferred_access
, deferred_access_stack
);
193 /* Returns a TREE_LIST representing the deferred checks.
194 The TREE_PURPOSE of each node is the type through which the
195 access occurred; the TREE_VALUE is the declaration named.
198 VEC (deferred_access_check
,gc
)*
199 get_deferred_access_checks (void)
201 if (deferred_access_no_check
)
204 return (VEC_last (deferred_access
, deferred_access_stack
)
205 ->deferred_access_checks
);
208 /* Take current deferred checks and combine with the
209 previous states if we also defer checks previously.
210 Otherwise perform checks now. */
213 pop_to_parent_deferring_access_checks (void)
215 if (deferred_access_no_check
)
216 deferred_access_no_check
--;
219 VEC (deferred_access_check
,gc
) *checks
;
220 deferred_access
*ptr
;
222 checks
= (VEC_last (deferred_access
, deferred_access_stack
)
223 ->deferred_access_checks
);
225 VEC_pop (deferred_access
, deferred_access_stack
);
226 ptr
= VEC_last (deferred_access
, deferred_access_stack
);
227 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
230 perform_access_checks (checks
);
234 /* Merge with parent. */
236 deferred_access_check
*chk
, *probe
;
239 VEC_iterate (deferred_access_check
, checks
, i
, chk
) ;
243 VEC_iterate (deferred_access_check
,
244 ptr
->deferred_access_checks
, j
, probe
) ;
247 if (probe
->binfo
== chk
->binfo
&&
248 probe
->decl
== chk
->decl
&&
249 probe
->diag_decl
== chk
->diag_decl
)
252 /* Insert into parent's checks. */
253 VEC_safe_push (deferred_access_check
, gc
,
254 ptr
->deferred_access_checks
, chk
);
261 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
262 is the BINFO indicating the qualifying scope used to access the
263 DECL node stored in the TREE_VALUE of the node. */
266 perform_access_checks (VEC (deferred_access_check
,gc
)* checks
)
269 deferred_access_check
*chk
;
274 for (i
= 0 ; VEC_iterate (deferred_access_check
, checks
, i
, chk
) ; ++i
)
275 enforce_access (chk
->binfo
, chk
->decl
, chk
->diag_decl
);
278 /* Perform the deferred access checks.
280 After performing the checks, we still have to keep the list
281 `deferred_access_stack->deferred_access_checks' since we may want
282 to check access for them again later in a different context.
289 A::X A::a, x; // No error for `A::a', error for `x'
291 We have to perform deferred access of `A::X', first with `A::a',
295 perform_deferred_access_checks (void)
297 perform_access_checks (get_deferred_access_checks ());
300 /* Defer checking the accessibility of DECL, when looked up in
301 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */
304 perform_or_defer_access_check (tree binfo
, tree decl
, tree diag_decl
)
307 deferred_access
*ptr
;
308 deferred_access_check
*chk
;
309 deferred_access_check
*new_access
;
312 /* Exit if we are in a context that no access checking is performed.
314 if (deferred_access_no_check
)
317 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
319 ptr
= VEC_last (deferred_access
, deferred_access_stack
);
321 /* If we are not supposed to defer access checks, just check now. */
322 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
324 enforce_access (binfo
, decl
, diag_decl
);
328 /* See if we are already going to perform this check. */
330 VEC_iterate (deferred_access_check
,
331 ptr
->deferred_access_checks
, i
, chk
) ;
334 if (chk
->decl
== decl
&& chk
->binfo
== binfo
&&
335 chk
->diag_decl
== diag_decl
)
340 /* If not, record the check. */
342 VEC_safe_push (deferred_access_check
, gc
,
343 ptr
->deferred_access_checks
, 0);
344 new_access
->binfo
= binfo
;
345 new_access
->decl
= decl
;
346 new_access
->diag_decl
= diag_decl
;
349 /* Returns nonzero if the current statement is a full expression,
350 i.e. temporaries created during that statement should be destroyed
351 at the end of the statement. */
354 stmts_are_full_exprs_p (void)
356 return current_stmt_tree ()->stmts_are_full_exprs_p
;
359 /* T is a statement. Add it to the statement-tree. This is the C++
360 version. The C/ObjC frontends have a slightly different version of
366 enum tree_code code
= TREE_CODE (t
);
368 if (EXPR_P (t
) && code
!= LABEL_EXPR
)
370 if (!EXPR_HAS_LOCATION (t
))
371 SET_EXPR_LOCATION (t
, input_location
);
373 /* When we expand a statement-tree, we must know whether or not the
374 statements are full-expressions. We record that fact here. */
375 STMT_IS_FULL_EXPR_P (t
) = stmts_are_full_exprs_p ();
378 /* Add T to the statement-tree. Non-side-effect statements need to be
379 recorded during statement expressions. */
380 append_to_statement_list_force (t
, &cur_stmt_list
);
385 /* Returns the stmt_tree to which statements are currently being added. */
388 current_stmt_tree (void)
391 ? &cfun
->language
->base
.x_stmt_tree
392 : &scope_chain
->x_stmt_tree
);
395 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
398 maybe_cleanup_point_expr (tree expr
)
400 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
401 expr
= fold_build_cleanup_point_expr (TREE_TYPE (expr
), expr
);
405 /* Like maybe_cleanup_point_expr except have the type of the new expression be
406 void so we don't need to create a temporary variable to hold the inner
407 expression. The reason why we do this is because the original type might be
408 an aggregate and we cannot create a temporary variable for that type. */
411 maybe_cleanup_point_expr_void (tree expr
)
413 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
414 expr
= fold_build_cleanup_point_expr (void_type_node
, expr
);
420 /* Create a declaration statement for the declaration given by the DECL. */
423 add_decl_expr (tree decl
)
425 tree r
= build_stmt (input_location
, DECL_EXPR
, decl
);
426 if (DECL_INITIAL (decl
)
427 || (DECL_SIZE (decl
) && TREE_SIDE_EFFECTS (DECL_SIZE (decl
))))
428 r
= maybe_cleanup_point_expr_void (r
);
432 /* Finish a scope. */
435 do_poplevel (tree stmt_list
)
439 if (stmts_are_full_exprs_p ())
440 block
= poplevel (kept_level_p (), 1, 0);
442 stmt_list
= pop_stmt_list (stmt_list
);
444 if (!processing_template_decl
)
446 stmt_list
= c_build_bind_expr (input_location
, block
, stmt_list
);
447 /* ??? See c_end_compound_stmt re statement expressions. */
453 /* Begin a new scope. */
456 do_pushlevel (scope_kind sk
)
458 tree ret
= push_stmt_list ();
459 if (stmts_are_full_exprs_p ())
460 begin_scope (sk
, NULL
);
464 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
465 when the current scope is exited. EH_ONLY is true when this is not
466 meant to apply to normal control flow transfer. */
469 push_cleanup (tree decl
, tree cleanup
, bool eh_only
)
471 tree stmt
= build_stmt (input_location
, CLEANUP_STMT
, NULL
, cleanup
, decl
);
472 CLEANUP_EH_ONLY (stmt
) = eh_only
;
474 CLEANUP_BODY (stmt
) = push_stmt_list ();
477 /* Begin a conditional that might contain a declaration. When generating
478 normal code, we want the declaration to appear before the statement
479 containing the conditional. When generating template code, we want the
480 conditional to be rendered as the raw DECL_EXPR. */
483 begin_cond (tree
*cond_p
)
485 if (processing_template_decl
)
486 *cond_p
= push_stmt_list ();
489 /* Finish such a conditional. */
492 finish_cond (tree
*cond_p
, tree expr
)
494 if (processing_template_decl
)
496 tree cond
= pop_stmt_list (*cond_p
);
497 if (TREE_CODE (cond
) == DECL_EXPR
)
500 if (check_for_bare_parameter_packs (expr
))
501 *cond_p
= error_mark_node
;
506 /* If *COND_P specifies a conditional with a declaration, transform the
509 for (; A x = 42;) { }
511 while (true) { A x = 42; if (!x) break; }
512 for (;;) { A x = 42; if (!x) break; }
513 The statement list for BODY will be empty if the conditional did
514 not declare anything. */
517 simplify_loop_decl_cond (tree
*cond_p
, tree body
)
521 if (!TREE_SIDE_EFFECTS (body
))
525 *cond_p
= boolean_true_node
;
527 if_stmt
= begin_if_stmt ();
528 cond
= cp_build_unary_op (TRUTH_NOT_EXPR
, cond
, 0, tf_warning_or_error
);
529 finish_if_stmt_cond (cond
, if_stmt
);
530 finish_break_stmt ();
531 finish_then_clause (if_stmt
);
532 finish_if_stmt (if_stmt
);
535 /* Finish a goto-statement. */
538 finish_goto_stmt (tree destination
)
540 if (TREE_CODE (destination
) == IDENTIFIER_NODE
)
541 destination
= lookup_label (destination
);
543 /* We warn about unused labels with -Wunused. That means we have to
544 mark the used labels as used. */
545 if (TREE_CODE (destination
) == LABEL_DECL
)
546 TREE_USED (destination
) = 1;
549 if (!processing_template_decl
)
551 destination
= cp_convert (ptr_type_node
, destination
);
552 if (error_operand_p (destination
))
555 /* We don't inline calls to functions with computed gotos.
556 Those functions are typically up to some funny business,
557 and may be depending on the labels being at particular
558 addresses, or some such. */
559 DECL_UNINLINABLE (current_function_decl
) = 1;
562 check_goto (destination
);
564 return add_stmt (build_stmt (input_location
, GOTO_EXPR
, destination
));
567 /* COND is the condition-expression for an if, while, etc.,
568 statement. Convert it to a boolean value, if appropriate.
569 In addition, verify sequence points if -Wsequence-point is enabled. */
572 maybe_convert_cond (tree cond
)
574 /* Empty conditions remain empty. */
578 /* Wait until we instantiate templates before doing conversion. */
579 if (processing_template_decl
)
582 if (warn_sequence_point
)
583 verify_sequence_points (cond
);
585 /* Do the conversion. */
586 cond
= convert_from_reference (cond
);
588 if (TREE_CODE (cond
) == MODIFY_EXPR
589 && !TREE_NO_WARNING (cond
)
592 warning (OPT_Wparentheses
,
593 "suggest parentheses around assignment used as truth value");
594 TREE_NO_WARNING (cond
) = 1;
597 return condition_conversion (cond
);
600 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
603 finish_expr_stmt (tree expr
)
607 if (expr
!= NULL_TREE
)
609 if (!processing_template_decl
)
611 if (warn_sequence_point
)
612 verify_sequence_points (expr
);
613 expr
= convert_to_void (expr
, "statement", tf_warning_or_error
);
615 else if (!type_dependent_expression_p (expr
))
616 convert_to_void (build_non_dependent_expr (expr
), "statement",
617 tf_warning_or_error
);
619 if (check_for_bare_parameter_packs (expr
))
620 expr
= error_mark_node
;
622 /* Simplification of inner statement expressions, compound exprs,
623 etc can result in us already having an EXPR_STMT. */
624 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
626 if (TREE_CODE (expr
) != EXPR_STMT
)
627 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
628 expr
= maybe_cleanup_point_expr_void (expr
);
640 /* Begin an if-statement. Returns a newly created IF_STMT if
647 scope
= do_pushlevel (sk_block
);
648 r
= build_stmt (input_location
, IF_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
649 TREE_CHAIN (r
) = scope
;
650 begin_cond (&IF_COND (r
));
654 /* Process the COND of an if-statement, which may be given by
658 finish_if_stmt_cond (tree cond
, tree if_stmt
)
660 finish_cond (&IF_COND (if_stmt
), maybe_convert_cond (cond
));
662 THEN_CLAUSE (if_stmt
) = push_stmt_list ();
665 /* Finish the then-clause of an if-statement, which may be given by
669 finish_then_clause (tree if_stmt
)
671 THEN_CLAUSE (if_stmt
) = pop_stmt_list (THEN_CLAUSE (if_stmt
));
675 /* Begin the else-clause of an if-statement. */
678 begin_else_clause (tree if_stmt
)
680 ELSE_CLAUSE (if_stmt
) = push_stmt_list ();
683 /* Finish the else-clause of an if-statement, which may be given by
687 finish_else_clause (tree if_stmt
)
689 ELSE_CLAUSE (if_stmt
) = pop_stmt_list (ELSE_CLAUSE (if_stmt
));
692 /* Finish an if-statement. */
695 finish_if_stmt (tree if_stmt
)
697 tree scope
= TREE_CHAIN (if_stmt
);
698 TREE_CHAIN (if_stmt
) = NULL
;
699 add_stmt (do_poplevel (scope
));
703 /* Begin a while-statement. Returns a newly created WHILE_STMT if
707 begin_while_stmt (void)
710 r
= build_stmt (input_location
, WHILE_STMT
, NULL_TREE
, NULL_TREE
);
712 WHILE_BODY (r
) = do_pushlevel (sk_block
);
713 begin_cond (&WHILE_COND (r
));
717 /* Process the COND of a while-statement, which may be given by
721 finish_while_stmt_cond (tree cond
, tree while_stmt
)
723 finish_cond (&WHILE_COND (while_stmt
), maybe_convert_cond (cond
));
724 simplify_loop_decl_cond (&WHILE_COND (while_stmt
), WHILE_BODY (while_stmt
));
727 /* Finish a while-statement, which may be given by WHILE_STMT. */
730 finish_while_stmt (tree while_stmt
)
732 WHILE_BODY (while_stmt
) = do_poplevel (WHILE_BODY (while_stmt
));
736 /* Begin a do-statement. Returns a newly created DO_STMT if
742 tree r
= build_stmt (input_location
, DO_STMT
, NULL_TREE
, NULL_TREE
);
744 DO_BODY (r
) = push_stmt_list ();
748 /* Finish the body of a do-statement, which may be given by DO_STMT. */
751 finish_do_body (tree do_stmt
)
753 tree body
= DO_BODY (do_stmt
) = pop_stmt_list (DO_BODY (do_stmt
));
755 if (TREE_CODE (body
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (body
))
756 body
= STATEMENT_LIST_TAIL (body
)->stmt
;
758 if (IS_EMPTY_STMT (body
))
759 warning (OPT_Wempty_body
,
760 "suggest explicit braces around empty body in %<do%> statement");
763 /* Finish a do-statement, which may be given by DO_STMT, and whose
764 COND is as indicated. */
767 finish_do_stmt (tree cond
, tree do_stmt
)
769 cond
= maybe_convert_cond (cond
);
770 DO_COND (do_stmt
) = cond
;
774 /* Finish a return-statement. The EXPRESSION returned, if any, is as
778 finish_return_stmt (tree expr
)
783 expr
= check_return_expr (expr
, &no_warning
);
785 if (flag_openmp
&& !check_omp_return ())
786 return error_mark_node
;
787 if (!processing_template_decl
)
789 if (warn_sequence_point
)
790 verify_sequence_points (expr
);
792 if (DECL_DESTRUCTOR_P (current_function_decl
)
793 || (DECL_CONSTRUCTOR_P (current_function_decl
)
794 && targetm
.cxx
.cdtor_returns_this ()))
796 /* Similarly, all destructors must run destructors for
797 base-classes before returning. So, all returns in a
798 destructor get sent to the DTOR_LABEL; finish_function emits
799 code to return a value there. */
800 return finish_goto_stmt (cdtor_label
);
804 r
= build_stmt (input_location
, RETURN_EXPR
, expr
);
805 TREE_NO_WARNING (r
) |= no_warning
;
806 r
= maybe_cleanup_point_expr_void (r
);
813 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
816 begin_for_stmt (void)
820 r
= build_stmt (input_location
, FOR_STMT
, NULL_TREE
, NULL_TREE
,
821 NULL_TREE
, NULL_TREE
);
823 if (flag_new_for_scope
> 0)
824 TREE_CHAIN (r
) = do_pushlevel (sk_for
);
826 if (processing_template_decl
)
827 FOR_INIT_STMT (r
) = push_stmt_list ();
832 /* Finish the for-init-statement of a for-statement, which may be
833 given by FOR_STMT. */
836 finish_for_init_stmt (tree for_stmt
)
838 if (processing_template_decl
)
839 FOR_INIT_STMT (for_stmt
) = pop_stmt_list (FOR_INIT_STMT (for_stmt
));
841 FOR_BODY (for_stmt
) = do_pushlevel (sk_block
);
842 begin_cond (&FOR_COND (for_stmt
));
845 /* Finish the COND of a for-statement, which may be given by
849 finish_for_cond (tree cond
, tree for_stmt
)
851 finish_cond (&FOR_COND (for_stmt
), maybe_convert_cond (cond
));
852 simplify_loop_decl_cond (&FOR_COND (for_stmt
), FOR_BODY (for_stmt
));
855 /* Finish the increment-EXPRESSION in a for-statement, which may be
856 given by FOR_STMT. */
859 finish_for_expr (tree expr
, tree for_stmt
)
863 /* If EXPR is an overloaded function, issue an error; there is no
864 context available to use to perform overload resolution. */
865 if (type_unknown_p (expr
))
867 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
868 expr
= error_mark_node
;
870 if (!processing_template_decl
)
872 if (warn_sequence_point
)
873 verify_sequence_points (expr
);
874 expr
= convert_to_void (expr
, "3rd expression in for",
875 tf_warning_or_error
);
877 else if (!type_dependent_expression_p (expr
))
878 convert_to_void (build_non_dependent_expr (expr
), "3rd expression in for",
879 tf_warning_or_error
);
880 expr
= maybe_cleanup_point_expr_void (expr
);
881 if (check_for_bare_parameter_packs (expr
))
882 expr
= error_mark_node
;
883 FOR_EXPR (for_stmt
) = expr
;
886 /* Finish the body of a for-statement, which may be given by
887 FOR_STMT. The increment-EXPR for the loop must be
891 finish_for_stmt (tree for_stmt
)
893 FOR_BODY (for_stmt
) = do_poplevel (FOR_BODY (for_stmt
));
895 /* Pop the scope for the body of the loop. */
896 if (flag_new_for_scope
> 0)
898 tree scope
= TREE_CHAIN (for_stmt
);
899 TREE_CHAIN (for_stmt
) = NULL
;
900 add_stmt (do_poplevel (scope
));
906 /* Finish a break-statement. */
909 finish_break_stmt (void)
911 return add_stmt (build_stmt (input_location
, BREAK_STMT
));
914 /* Finish a continue-statement. */
917 finish_continue_stmt (void)
919 return add_stmt (build_stmt (input_location
, CONTINUE_STMT
));
922 /* Begin a switch-statement. Returns a new SWITCH_STMT if
926 begin_switch_stmt (void)
930 r
= build_stmt (input_location
, SWITCH_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
932 scope
= do_pushlevel (sk_block
);
933 TREE_CHAIN (r
) = scope
;
934 begin_cond (&SWITCH_STMT_COND (r
));
939 /* Finish the cond of a switch-statement. */
942 finish_switch_cond (tree cond
, tree switch_stmt
)
944 tree orig_type
= NULL
;
945 if (!processing_template_decl
)
947 /* Convert the condition to an integer or enumeration type. */
948 cond
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, cond
, true);
949 if (cond
== NULL_TREE
)
951 error ("switch quantity not an integer");
952 cond
= error_mark_node
;
954 orig_type
= TREE_TYPE (cond
);
955 if (cond
!= error_mark_node
)
959 Integral promotions are performed. */
960 cond
= perform_integral_promotions (cond
);
961 cond
= maybe_cleanup_point_expr (cond
);
964 if (check_for_bare_parameter_packs (cond
))
965 cond
= error_mark_node
;
966 else if (!processing_template_decl
&& warn_sequence_point
)
967 verify_sequence_points (cond
);
969 finish_cond (&SWITCH_STMT_COND (switch_stmt
), cond
);
970 SWITCH_STMT_TYPE (switch_stmt
) = orig_type
;
971 add_stmt (switch_stmt
);
972 push_switch (switch_stmt
);
973 SWITCH_STMT_BODY (switch_stmt
) = push_stmt_list ();
976 /* Finish the body of a switch-statement, which may be given by
977 SWITCH_STMT. The COND to switch on is indicated. */
980 finish_switch_stmt (tree switch_stmt
)
984 SWITCH_STMT_BODY (switch_stmt
) =
985 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt
));
989 scope
= TREE_CHAIN (switch_stmt
);
990 TREE_CHAIN (switch_stmt
) = NULL
;
991 add_stmt (do_poplevel (scope
));
994 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
998 begin_try_block (void)
1000 tree r
= build_stmt (input_location
, TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
1002 TRY_STMTS (r
) = push_stmt_list ();
1006 /* Likewise, for a function-try-block. The block returned in
1007 *COMPOUND_STMT is an artificial outer scope, containing the
1008 function-try-block. */
1011 begin_function_try_block (tree
*compound_stmt
)
1014 /* This outer scope does not exist in the C++ standard, but we need
1015 a place to put __FUNCTION__ and similar variables. */
1016 *compound_stmt
= begin_compound_stmt (0);
1017 r
= begin_try_block ();
1018 FN_TRY_BLOCK_P (r
) = 1;
1022 /* Finish a try-block, which may be given by TRY_BLOCK. */
1025 finish_try_block (tree try_block
)
1027 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1028 TRY_HANDLERS (try_block
) = push_stmt_list ();
1031 /* Finish the body of a cleanup try-block, which may be given by
1035 finish_cleanup_try_block (tree try_block
)
1037 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1040 /* Finish an implicitly generated try-block, with a cleanup is given
1044 finish_cleanup (tree cleanup
, tree try_block
)
1046 TRY_HANDLERS (try_block
) = cleanup
;
1047 CLEANUP_P (try_block
) = 1;
1050 /* Likewise, for a function-try-block. */
1053 finish_function_try_block (tree try_block
)
1055 finish_try_block (try_block
);
1056 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1057 the try block, but moving it inside. */
1058 in_function_try_handler
= 1;
1061 /* Finish a handler-sequence for a try-block, which may be given by
1065 finish_handler_sequence (tree try_block
)
1067 TRY_HANDLERS (try_block
) = pop_stmt_list (TRY_HANDLERS (try_block
));
1068 check_handlers (TRY_HANDLERS (try_block
));
1071 /* Finish the handler-seq for a function-try-block, given by
1072 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1073 begin_function_try_block. */
1076 finish_function_handler_sequence (tree try_block
, tree compound_stmt
)
1078 in_function_try_handler
= 0;
1079 finish_handler_sequence (try_block
);
1080 finish_compound_stmt (compound_stmt
);
1083 /* Begin a handler. Returns a HANDLER if appropriate. */
1086 begin_handler (void)
1090 r
= build_stmt (input_location
, HANDLER
, NULL_TREE
, NULL_TREE
);
1093 /* Create a binding level for the eh_info and the exception object
1095 HANDLER_BODY (r
) = do_pushlevel (sk_catch
);
1100 /* Finish the handler-parameters for a handler, which may be given by
1101 HANDLER. DECL is the declaration for the catch parameter, or NULL
1102 if this is a `catch (...)' clause. */
1105 finish_handler_parms (tree decl
, tree handler
)
1107 tree type
= NULL_TREE
;
1108 if (processing_template_decl
)
1112 decl
= pushdecl (decl
);
1113 decl
= push_template_decl (decl
);
1114 HANDLER_PARMS (handler
) = decl
;
1115 type
= TREE_TYPE (decl
);
1119 type
= expand_start_catch_block (decl
);
1120 HANDLER_TYPE (handler
) = type
;
1121 if (!processing_template_decl
&& type
)
1122 mark_used (eh_type_info (type
));
1125 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1126 the return value from the matching call to finish_handler_parms. */
1129 finish_handler (tree handler
)
1131 if (!processing_template_decl
)
1132 expand_end_catch_block ();
1133 HANDLER_BODY (handler
) = do_poplevel (HANDLER_BODY (handler
));
1136 /* Begin a compound statement. FLAGS contains some bits that control the
1137 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1138 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1139 block of a function. If BCS_TRY_BLOCK is set, this is the block
1140 created on behalf of a TRY statement. Returns a token to be passed to
1141 finish_compound_stmt. */
1144 begin_compound_stmt (unsigned int flags
)
1148 if (flags
& BCS_NO_SCOPE
)
1150 r
= push_stmt_list ();
1151 STATEMENT_LIST_NO_SCOPE (r
) = 1;
1153 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1154 But, if it's a statement-expression with a scopeless block, there's
1155 nothing to keep, and we don't want to accidentally keep a block
1156 *inside* the scopeless block. */
1157 keep_next_level (false);
1160 r
= do_pushlevel (flags
& BCS_TRY_BLOCK
? sk_try
: sk_block
);
1162 /* When processing a template, we need to remember where the braces were,
1163 so that we can set up identical scopes when instantiating the template
1164 later. BIND_EXPR is a handy candidate for this.
1165 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1166 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1167 processing templates. */
1168 if (processing_template_decl
)
1170 r
= build3 (BIND_EXPR
, NULL
, NULL
, r
, NULL
);
1171 BIND_EXPR_TRY_BLOCK (r
) = (flags
& BCS_TRY_BLOCK
) != 0;
1172 BIND_EXPR_BODY_BLOCK (r
) = (flags
& BCS_FN_BODY
) != 0;
1173 TREE_SIDE_EFFECTS (r
) = 1;
1179 /* Finish a compound-statement, which is given by STMT. */
1182 finish_compound_stmt (tree stmt
)
1184 if (TREE_CODE (stmt
) == BIND_EXPR
)
1185 BIND_EXPR_BODY (stmt
) = do_poplevel (BIND_EXPR_BODY (stmt
));
1186 else if (STATEMENT_LIST_NO_SCOPE (stmt
))
1187 stmt
= pop_stmt_list (stmt
);
1190 /* Destroy any ObjC "super" receivers that may have been
1192 objc_clear_super_receiver ();
1194 stmt
= do_poplevel (stmt
);
1197 /* ??? See c_end_compound_stmt wrt statement expressions. */
1202 /* Finish an asm-statement, whose components are a STRING, some
1203 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1204 LABELS. Also note whether the asm-statement should be
1205 considered volatile. */
1208 finish_asm_stmt (int volatile_p
, tree string
, tree output_operands
,
1209 tree input_operands
, tree clobbers
, tree labels
)
1213 int ninputs
= list_length (input_operands
);
1214 int noutputs
= list_length (output_operands
);
1216 if (!processing_template_decl
)
1218 const char *constraint
;
1219 const char **oconstraints
;
1220 bool allows_mem
, allows_reg
, is_inout
;
1224 oconstraints
= (const char **) alloca (noutputs
* sizeof (char *));
1226 string
= resolve_asm_operand_names (string
, output_operands
,
1227 input_operands
, labels
);
1229 for (i
= 0, t
= output_operands
; t
; t
= TREE_CHAIN (t
), ++i
)
1231 operand
= TREE_VALUE (t
);
1233 /* ??? Really, this should not be here. Users should be using a
1234 proper lvalue, dammit. But there's a long history of using
1235 casts in the output operands. In cases like longlong.h, this
1236 becomes a primitive form of typechecking -- if the cast can be
1237 removed, then the output operand had a type of the proper width;
1238 otherwise we'll get an error. Gross, but ... */
1239 STRIP_NOPS (operand
);
1241 if (!lvalue_or_else (operand
, lv_asm
, tf_warning_or_error
))
1242 operand
= error_mark_node
;
1244 if (operand
!= error_mark_node
1245 && (TREE_READONLY (operand
)
1246 || CP_TYPE_CONST_P (TREE_TYPE (operand
))
1247 /* Functions are not modifiable, even though they are
1249 || TREE_CODE (TREE_TYPE (operand
)) == FUNCTION_TYPE
1250 || TREE_CODE (TREE_TYPE (operand
)) == METHOD_TYPE
1251 /* If it's an aggregate and any field is const, then it is
1252 effectively const. */
1253 || (CLASS_TYPE_P (TREE_TYPE (operand
))
1254 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand
)))))
1255 readonly_error (operand
, REK_ASSIGNMENT_ASM
);
1257 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1258 oconstraints
[i
] = constraint
;
1260 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
1261 &allows_mem
, &allows_reg
, &is_inout
))
1263 /* If the operand is going to end up in memory,
1264 mark it addressable. */
1265 if (!allows_reg
&& !cxx_mark_addressable (operand
))
1266 operand
= error_mark_node
;
1269 operand
= error_mark_node
;
1271 TREE_VALUE (t
) = operand
;
1274 for (i
= 0, t
= input_operands
; t
; ++i
, t
= TREE_CHAIN (t
))
1276 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1277 operand
= decay_conversion (TREE_VALUE (t
));
1279 /* If the type of the operand hasn't been determined (e.g.,
1280 because it involves an overloaded function), then issue
1281 an error message. There's no context available to
1282 resolve the overloading. */
1283 if (TREE_TYPE (operand
) == unknown_type_node
)
1285 error ("type of asm operand %qE could not be determined",
1287 operand
= error_mark_node
;
1290 if (parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
1291 oconstraints
, &allows_mem
, &allows_reg
))
1293 /* If the operand is going to end up in memory,
1294 mark it addressable. */
1295 if (!allows_reg
&& allows_mem
)
1297 /* Strip the nops as we allow this case. FIXME, this really
1298 should be rejected or made deprecated. */
1299 STRIP_NOPS (operand
);
1300 if (!cxx_mark_addressable (operand
))
1301 operand
= error_mark_node
;
1305 operand
= error_mark_node
;
1307 TREE_VALUE (t
) = operand
;
1311 r
= build_stmt (input_location
, ASM_EXPR
, string
,
1312 output_operands
, input_operands
,
1314 ASM_VOLATILE_P (r
) = volatile_p
|| noutputs
== 0;
1315 r
= maybe_cleanup_point_expr_void (r
);
1316 return add_stmt (r
);
1319 /* Finish a label with the indicated NAME. Returns the new label. */
1322 finish_label_stmt (tree name
)
1324 tree decl
= define_label (input_location
, name
);
1326 if (decl
== error_mark_node
)
1327 return error_mark_node
;
1329 add_stmt (build_stmt (input_location
, LABEL_EXPR
, decl
));
1334 /* Finish a series of declarations for local labels. G++ allows users
1335 to declare "local" labels, i.e., labels with scope. This extension
1336 is useful when writing code involving statement-expressions. */
1339 finish_label_decl (tree name
)
1341 if (!at_function_scope_p ())
1343 error ("__label__ declarations are only allowed in function scopes");
1347 add_decl_expr (declare_local_label (name
));
1350 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1353 finish_decl_cleanup (tree decl
, tree cleanup
)
1355 push_cleanup (decl
, cleanup
, false);
1358 /* If the current scope exits with an exception, run CLEANUP. */
1361 finish_eh_cleanup (tree cleanup
)
1363 push_cleanup (NULL
, cleanup
, true);
1366 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1367 order they were written by the user. Each node is as for
1368 emit_mem_initializers. */
1371 finish_mem_initializers (tree mem_inits
)
1373 /* Reorder the MEM_INITS so that they are in the order they appeared
1374 in the source program. */
1375 mem_inits
= nreverse (mem_inits
);
1377 if (processing_template_decl
)
1381 for (mem
= mem_inits
; mem
; mem
= TREE_CHAIN (mem
))
1383 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1384 check for bare parameter packs in the TREE_VALUE, because
1385 any parameter packs in the TREE_VALUE have already been
1386 bound as part of the TREE_PURPOSE. See
1387 make_pack_expansion for more information. */
1388 if (TREE_CODE (TREE_PURPOSE (mem
)) != TYPE_PACK_EXPANSION
1389 && check_for_bare_parameter_packs (TREE_VALUE (mem
)))
1390 TREE_VALUE (mem
) = error_mark_node
;
1393 add_stmt (build_min_nt (CTOR_INITIALIZER
, mem_inits
));
1396 emit_mem_initializers (mem_inits
);
1399 /* Finish a parenthesized expression EXPR. */
1402 finish_parenthesized_expr (tree expr
)
1405 /* This inhibits warnings in c_common_truthvalue_conversion. */
1406 TREE_NO_WARNING (expr
) = 1;
1408 if (TREE_CODE (expr
) == OFFSET_REF
)
1409 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1410 enclosed in parentheses. */
1411 PTRMEM_OK_P (expr
) = 0;
1413 if (TREE_CODE (expr
) == STRING_CST
)
1414 PAREN_STRING_LITERAL_P (expr
) = 1;
1419 /* Finish a reference to a non-static data member (DECL) that is not
1420 preceded by `.' or `->'. */
1423 finish_non_static_data_member (tree decl
, tree object
, tree qualifying_scope
)
1425 gcc_assert (TREE_CODE (decl
) == FIELD_DECL
);
1427 if (!object
&& cp_unevaluated_operand
!= 0)
1429 /* DR 613: Can use non-static data members without an associated
1430 object in sizeof/decltype/alignof. */
1431 tree scope
= qualifying_scope
;
1432 if (scope
== NULL_TREE
)
1433 scope
= context_for_name_lookup (decl
);
1434 object
= maybe_dummy_object (scope
, NULL
);
1439 if (current_function_decl
1440 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1441 error ("invalid use of member %q+D in static member function", decl
);
1443 error ("invalid use of non-static data member %q+D", decl
);
1444 error ("from this location");
1446 return error_mark_node
;
1449 /* If decl is a non-capture field and object has a lambda type,
1450 then we have a reference to a member of 'this' from a
1451 lambda inside a non-static member function, and we must get to decl
1452 through the 'this' capture. If decl is not a member of that object,
1453 either, then its access will still fail later. */
1454 if (LAMBDA_TYPE_P (TREE_TYPE (object
))
1455 && !LAMBDA_TYPE_P (DECL_CONTEXT (decl
)))
1456 object
= cp_build_indirect_ref (lambda_expr_this_capture
1457 (CLASSTYPE_LAMBDA_EXPR
1458 (TREE_TYPE (object
))),
1460 /*complain=*/tf_warning_or_error
);
1462 if (current_class_ptr
)
1463 TREE_USED (current_class_ptr
) = 1;
1464 if (processing_template_decl
&& !qualifying_scope
)
1466 tree type
= TREE_TYPE (decl
);
1468 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1469 type
= TREE_TYPE (type
);
1472 /* Set the cv qualifiers. */
1473 int quals
= (current_class_ref
1474 ? cp_type_quals (TREE_TYPE (current_class_ref
))
1475 : TYPE_UNQUALIFIED
);
1477 if (DECL_MUTABLE_P (decl
))
1478 quals
&= ~TYPE_QUAL_CONST
;
1480 quals
|= cp_type_quals (TREE_TYPE (decl
));
1481 type
= cp_build_qualified_type (type
, quals
);
1484 return build_min (COMPONENT_REF
, type
, object
, decl
, NULL_TREE
);
1486 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1487 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1489 else if (processing_template_decl
)
1490 return build_qualified_name (TREE_TYPE (decl
),
1493 /*template_p=*/false);
1496 tree access_type
= TREE_TYPE (object
);
1497 tree lookup_context
= context_for_name_lookup (decl
);
1499 while (!DERIVED_FROM_P (lookup_context
, access_type
))
1501 access_type
= TYPE_CONTEXT (access_type
);
1502 while (access_type
&& DECL_P (access_type
))
1503 access_type
= DECL_CONTEXT (access_type
);
1507 error ("object missing in reference to %q+D", decl
);
1508 error ("from this location");
1509 return error_mark_node
;
1513 perform_or_defer_access_check (TYPE_BINFO (access_type
), decl
,
1516 /* If the data member was named `C::M', convert `*this' to `C'
1518 if (qualifying_scope
)
1520 tree binfo
= NULL_TREE
;
1521 object
= build_scoped_ref (object
, qualifying_scope
,
1525 return build_class_member_access_expr (object
, decl
,
1526 /*access_path=*/NULL_TREE
,
1527 /*preserve_reference=*/false,
1528 tf_warning_or_error
);
1532 /* If we are currently parsing a template and we encountered a typedef
1533 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1534 adds the typedef to a list tied to the current template.
1535 At tempate instantiatin time, that list is walked and access check
1536 performed for each typedef.
1537 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1540 add_typedef_to_current_template_for_access_check (tree typedef_decl
,
1542 location_t location
)
1544 tree template_info
= NULL
;
1545 tree cs
= current_scope ();
1547 if (!is_typedef_decl (typedef_decl
)
1549 || !CLASS_TYPE_P (context
)
1553 if (CLASS_TYPE_P (cs
) || TREE_CODE (cs
) == FUNCTION_DECL
)
1554 template_info
= get_template_info (cs
);
1557 && TI_TEMPLATE (template_info
)
1558 && !currently_open_class (context
))
1559 append_type_to_template_for_access_check (cs
, typedef_decl
,
1563 /* DECL was the declaration to which a qualified-id resolved. Issue
1564 an error message if it is not accessible. If OBJECT_TYPE is
1565 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1566 type of `*x', or `x', respectively. If the DECL was named as
1567 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1570 check_accessibility_of_qualified_id (tree decl
,
1572 tree nested_name_specifier
)
1575 tree qualifying_type
= NULL_TREE
;
1577 /* If we are parsing a template declaration and if decl is a typedef,
1578 add it to a list tied to the template.
1579 At template instantiation time, that list will be walked and
1580 access check performed. */
1581 add_typedef_to_current_template_for_access_check (decl
,
1582 nested_name_specifier
1583 ? nested_name_specifier
1584 : DECL_CONTEXT (decl
),
1587 /* If we're not checking, return immediately. */
1588 if (deferred_access_no_check
)
1591 /* Determine the SCOPE of DECL. */
1592 scope
= context_for_name_lookup (decl
);
1593 /* If the SCOPE is not a type, then DECL is not a member. */
1594 if (!TYPE_P (scope
))
1596 /* Compute the scope through which DECL is being accessed. */
1598 /* OBJECT_TYPE might not be a class type; consider:
1600 class A { typedef int I; };
1604 In this case, we will have "A::I" as the DECL, but "I" as the
1606 && CLASS_TYPE_P (object_type
)
1607 && DERIVED_FROM_P (scope
, object_type
))
1608 /* If we are processing a `->' or `.' expression, use the type of the
1610 qualifying_type
= object_type
;
1611 else if (nested_name_specifier
)
1613 /* If the reference is to a non-static member of the
1614 current class, treat it as if it were referenced through
1616 if (DECL_NONSTATIC_MEMBER_P (decl
)
1617 && current_class_ptr
1618 && DERIVED_FROM_P (scope
, current_class_type
))
1619 qualifying_type
= current_class_type
;
1620 /* Otherwise, use the type indicated by the
1621 nested-name-specifier. */
1623 qualifying_type
= nested_name_specifier
;
1626 /* Otherwise, the name must be from the current class or one of
1628 qualifying_type
= currently_open_derived_class (scope
);
1631 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1632 or similar in a default argument value. */
1633 && CLASS_TYPE_P (qualifying_type
)
1634 && !dependent_type_p (qualifying_type
))
1635 perform_or_defer_access_check (TYPE_BINFO (qualifying_type
), decl
,
1639 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1640 class named to the left of the "::" operator. DONE is true if this
1641 expression is a complete postfix-expression; it is false if this
1642 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1643 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1644 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1645 is true iff this qualified name appears as a template argument. */
1648 finish_qualified_id_expr (tree qualifying_class
,
1653 bool template_arg_p
)
1655 gcc_assert (TYPE_P (qualifying_class
));
1657 if (error_operand_p (expr
))
1658 return error_mark_node
;
1660 if (DECL_P (expr
) || BASELINK_P (expr
))
1664 check_template_keyword (expr
);
1666 /* If EXPR occurs as the operand of '&', use special handling that
1667 permits a pointer-to-member. */
1668 if (address_p
&& done
)
1670 if (TREE_CODE (expr
) == SCOPE_REF
)
1671 expr
= TREE_OPERAND (expr
, 1);
1672 expr
= build_offset_ref (qualifying_class
, expr
,
1673 /*address_p=*/true);
1677 /* Within the scope of a class, turn references to non-static
1678 members into expression of the form "this->...". */
1680 /* But, within a template argument, we do not want make the
1681 transformation, as there is no "this" pointer. */
1683 else if (TREE_CODE (expr
) == FIELD_DECL
)
1685 push_deferring_access_checks (dk_no_check
);
1686 expr
= finish_non_static_data_member (expr
, current_class_ref
,
1688 pop_deferring_access_checks ();
1690 else if (BASELINK_P (expr
) && !processing_template_decl
)
1694 /* See if any of the functions are non-static members. */
1695 fns
= BASELINK_FUNCTIONS (expr
);
1696 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
1697 fns
= TREE_OPERAND (fns
, 0);
1698 /* If so, the expression may be relative to 'this'. */
1699 if (!shared_member_p (fns
)
1700 && current_class_ref
1701 && DERIVED_FROM_P (qualifying_class
, TREE_TYPE (current_class_ref
)))
1702 expr
= (build_class_member_access_expr
1703 (maybe_dummy_object (qualifying_class
, NULL
),
1705 BASELINK_ACCESS_BINFO (expr
),
1706 /*preserve_reference=*/false,
1707 tf_warning_or_error
));
1709 /* The expression is a qualified name whose address is not
1711 expr
= build_offset_ref (qualifying_class
, expr
, /*address_p=*/false);
1717 /* Begin a statement-expression. The value returned must be passed to
1718 finish_stmt_expr. */
1721 begin_stmt_expr (void)
1723 return push_stmt_list ();
1726 /* Process the final expression of a statement expression. EXPR can be
1727 NULL, if the final expression is empty. Return a STATEMENT_LIST
1728 containing all the statements in the statement-expression, or
1729 ERROR_MARK_NODE if there was an error. */
1732 finish_stmt_expr_expr (tree expr
, tree stmt_expr
)
1734 if (error_operand_p (expr
))
1736 /* The type of the statement-expression is the type of the last
1738 TREE_TYPE (stmt_expr
) = error_mark_node
;
1739 return error_mark_node
;
1742 /* If the last statement does not have "void" type, then the value
1743 of the last statement is the value of the entire expression. */
1746 tree type
= TREE_TYPE (expr
);
1748 if (processing_template_decl
)
1750 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
1751 expr
= add_stmt (expr
);
1752 /* Mark the last statement so that we can recognize it as such at
1753 template-instantiation time. */
1754 EXPR_STMT_STMT_EXPR_RESULT (expr
) = 1;
1756 else if (VOID_TYPE_P (type
))
1758 /* Just treat this like an ordinary statement. */
1759 expr
= finish_expr_stmt (expr
);
1763 /* It actually has a value we need to deal with. First, force it
1764 to be an rvalue so that we won't need to build up a copy
1765 constructor call later when we try to assign it to something. */
1766 expr
= force_rvalue (expr
);
1767 if (error_operand_p (expr
))
1768 return error_mark_node
;
1770 /* Update for array-to-pointer decay. */
1771 type
= TREE_TYPE (expr
);
1773 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1774 normal statement, but don't convert to void or actually add
1776 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
1777 expr
= maybe_cleanup_point_expr (expr
);
1781 /* The type of the statement-expression is the type of the last
1783 TREE_TYPE (stmt_expr
) = type
;
1789 /* Finish a statement-expression. EXPR should be the value returned
1790 by the previous begin_stmt_expr. Returns an expression
1791 representing the statement-expression. */
1794 finish_stmt_expr (tree stmt_expr
, bool has_no_scope
)
1799 if (error_operand_p (stmt_expr
))
1801 pop_stmt_list (stmt_expr
);
1802 return error_mark_node
;
1805 gcc_assert (TREE_CODE (stmt_expr
) == STATEMENT_LIST
);
1807 type
= TREE_TYPE (stmt_expr
);
1808 result
= pop_stmt_list (stmt_expr
);
1809 TREE_TYPE (result
) = type
;
1811 if (processing_template_decl
)
1813 result
= build_min (STMT_EXPR
, type
, result
);
1814 TREE_SIDE_EFFECTS (result
) = 1;
1815 STMT_EXPR_NO_SCOPE (result
) = has_no_scope
;
1817 else if (CLASS_TYPE_P (type
))
1819 /* Wrap the statement-expression in a TARGET_EXPR so that the
1820 temporary object created by the final expression is destroyed at
1821 the end of the full-expression containing the
1822 statement-expression. */
1823 result
= force_target_expr (type
, result
);
1829 /* Returns the expression which provides the value of STMT_EXPR. */
1832 stmt_expr_value_expr (tree stmt_expr
)
1834 tree t
= STMT_EXPR_STMT (stmt_expr
);
1836 if (TREE_CODE (t
) == BIND_EXPR
)
1837 t
= BIND_EXPR_BODY (t
);
1839 if (TREE_CODE (t
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (t
))
1840 t
= STATEMENT_LIST_TAIL (t
)->stmt
;
1842 if (TREE_CODE (t
) == EXPR_STMT
)
1843 t
= EXPR_STMT_EXPR (t
);
1848 /* Return TRUE iff EXPR_STMT is an empty list of
1849 expression statements. */
1852 empty_expr_stmt_p (tree expr_stmt
)
1854 tree body
= NULL_TREE
;
1856 if (expr_stmt
== void_zero_node
)
1861 if (TREE_CODE (expr_stmt
) == EXPR_STMT
)
1862 body
= EXPR_STMT_EXPR (expr_stmt
);
1863 else if (TREE_CODE (expr_stmt
) == STATEMENT_LIST
)
1869 if (TREE_CODE (body
) == STATEMENT_LIST
)
1870 return tsi_end_p (tsi_start (body
));
1872 return empty_expr_stmt_p (body
);
1877 /* Perform Koenig lookup. FN is the postfix-expression representing
1878 the function (or functions) to call; ARGS are the arguments to the
1879 call. Returns the functions to be considered by overload
1883 perform_koenig_lookup (tree fn
, VEC(tree
,gc
) *args
)
1885 tree identifier
= NULL_TREE
;
1886 tree functions
= NULL_TREE
;
1887 tree tmpl_args
= NULL_TREE
;
1888 bool template_id
= false;
1890 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
1892 /* Use a separate flag to handle null args. */
1894 tmpl_args
= TREE_OPERAND (fn
, 1);
1895 fn
= TREE_OPERAND (fn
, 0);
1898 /* Find the name of the overloaded function. */
1899 if (TREE_CODE (fn
) == IDENTIFIER_NODE
)
1901 else if (is_overloaded_fn (fn
))
1904 identifier
= DECL_NAME (get_first_fn (functions
));
1906 else if (DECL_P (fn
))
1909 identifier
= DECL_NAME (fn
);
1912 /* A call to a namespace-scope function using an unqualified name.
1914 Do Koenig lookup -- unless any of the arguments are
1916 if (!any_type_dependent_arguments_p (args
)
1917 && !any_dependent_template_arguments_p (tmpl_args
))
1919 fn
= lookup_arg_dependent (identifier
, functions
, args
);
1921 /* The unqualified name could not be resolved. */
1922 fn
= unqualified_fn_lookup_error (identifier
);
1925 if (fn
&& template_id
)
1926 fn
= build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fn
, tmpl_args
);
1931 /* Generate an expression for `FN (ARGS)'. This may change the
1934 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1935 as a virtual call, even if FN is virtual. (This flag is set when
1936 encountering an expression where the function name is explicitly
1937 qualified. For example a call to `X::f' never generates a virtual
1940 Returns code for the call. */
1943 finish_call_expr (tree fn
, VEC(tree
,gc
) **args
, bool disallow_virtual
,
1944 bool koenig_p
, tsubst_flags_t complain
)
1948 VEC(tree
,gc
) *orig_args
= NULL
;
1950 if (fn
== error_mark_node
)
1951 return error_mark_node
;
1953 gcc_assert (!TYPE_P (fn
));
1957 if (processing_template_decl
)
1959 if (type_dependent_expression_p (fn
)
1960 || any_type_dependent_arguments_p (*args
))
1962 result
= build_nt_call_vec (fn
, *args
);
1963 KOENIG_LOOKUP_P (result
) = koenig_p
;
1968 tree fndecl
= OVL_CURRENT (fn
);
1969 if (TREE_CODE (fndecl
) != FUNCTION_DECL
1970 || !TREE_THIS_VOLATILE (fndecl
))
1976 current_function_returns_abnormally
= 1;
1980 orig_args
= make_tree_vector_copy (*args
);
1981 if (!BASELINK_P (fn
)
1982 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
1983 && TREE_TYPE (fn
) != unknown_type_node
)
1984 fn
= build_non_dependent_expr (fn
);
1985 make_args_non_dependent (*args
);
1988 if (is_overloaded_fn (fn
))
1989 fn
= baselink_for_fns (fn
);
1992 if (BASELINK_P (fn
))
1996 /* A call to a member function. From [over.call.func]:
1998 If the keyword this is in scope and refers to the class of
1999 that member function, or a derived class thereof, then the
2000 function call is transformed into a qualified function call
2001 using (*this) as the postfix-expression to the left of the
2002 . operator.... [Otherwise] a contrived object of type T
2003 becomes the implied object argument.
2005 This paragraph is unclear about this situation:
2007 struct A { void f(); };
2008 struct B : public A {};
2009 struct C : public A { void g() { B::f(); }};
2011 In particular, for `B::f', this paragraph does not make clear
2012 whether "the class of that member function" refers to `A' or
2013 to `B'. We believe it refers to `B'. */
2014 if (current_class_type
2015 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
2017 && current_class_ref
)
2018 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
2022 tree representative_fn
;
2024 representative_fn
= BASELINK_FUNCTIONS (fn
);
2025 if (TREE_CODE (representative_fn
) == TEMPLATE_ID_EXPR
)
2026 representative_fn
= TREE_OPERAND (representative_fn
, 0);
2027 representative_fn
= get_first_fn (representative_fn
);
2028 object
= build_dummy_object (DECL_CONTEXT (representative_fn
));
2031 if (processing_template_decl
)
2033 if (type_dependent_expression_p (object
))
2035 tree ret
= build_nt_call_vec (orig_fn
, orig_args
);
2036 release_tree_vector (orig_args
);
2039 object
= build_non_dependent_expr (object
);
2042 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
2044 ? LOOKUP_NONVIRTUAL
: 0),
2048 else if (is_overloaded_fn (fn
))
2050 /* If the function is an overloaded builtin, resolve it. */
2051 if (TREE_CODE (fn
) == FUNCTION_DECL
2052 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2053 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
2054 result
= resolve_overloaded_builtin (input_location
, fn
, *args
);
2057 /* A call to a namespace-scope function. */
2058 result
= build_new_function_call (fn
, args
, koenig_p
, complain
);
2060 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
2062 if (!VEC_empty (tree
, *args
))
2063 error ("arguments to destructor are not allowed");
2064 /* Mark the pseudo-destructor call as having side-effects so
2065 that we do not issue warnings about its use. */
2066 result
= build1 (NOP_EXPR
,
2068 TREE_OPERAND (fn
, 0));
2069 TREE_SIDE_EFFECTS (result
) = 1;
2071 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
2072 /* If the "function" is really an object of class type, it might
2073 have an overloaded `operator ()'. */
2074 result
= build_op_call (fn
, args
, complain
);
2077 /* A call where the function is unknown. */
2078 result
= cp_build_function_call_vec (fn
, args
, complain
);
2080 if (processing_template_decl
)
2082 result
= build_call_vec (TREE_TYPE (result
), orig_fn
, orig_args
);
2083 KOENIG_LOOKUP_P (result
) = koenig_p
;
2084 release_tree_vector (orig_args
);
2090 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2091 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2092 POSTDECREMENT_EXPR.) */
2095 finish_increment_expr (tree expr
, enum tree_code code
)
2097 return build_x_unary_op (code
, expr
, tf_warning_or_error
);
2100 /* Finish a use of `this'. Returns an expression for `this'. */
2103 finish_this_expr (void)
2107 if (current_class_ptr
)
2109 tree type
= TREE_TYPE (current_class_ref
);
2111 /* In a lambda expression, 'this' refers to the captured 'this'. */
2112 if (LAMBDA_TYPE_P (type
))
2113 result
= lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type
));
2115 result
= current_class_ptr
;
2118 else if (current_function_decl
2119 && DECL_STATIC_FUNCTION_P (current_function_decl
))
2121 error ("%<this%> is unavailable for static member functions");
2122 result
= error_mark_node
;
2126 if (current_function_decl
)
2127 error ("invalid use of %<this%> in non-member function");
2129 error ("invalid use of %<this%> at top level");
2130 result
= error_mark_node
;
2136 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2137 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2138 the TYPE for the type given. If SCOPE is non-NULL, the expression
2139 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2142 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
)
2144 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2145 return error_mark_node
;
2147 gcc_assert (TYPE_P (destructor
));
2149 if (!processing_template_decl
)
2151 if (scope
== error_mark_node
)
2153 error ("invalid qualifying scope in pseudo-destructor name");
2154 return error_mark_node
;
2156 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2158 error ("qualified type %qT does not match destructor name ~%qT",
2160 return error_mark_node
;
2164 /* [expr.pseudo] says both:
2166 The type designated by the pseudo-destructor-name shall be
2167 the same as the object type.
2171 The cv-unqualified versions of the object type and of the
2172 type designated by the pseudo-destructor-name shall be the
2175 We implement the more generous second sentence, since that is
2176 what most other compilers do. */
2177 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2180 error ("%qE is not of type %qT", object
, destructor
);
2181 return error_mark_node
;
2185 return build3 (PSEUDO_DTOR_EXPR
, void_type_node
, object
, scope
, destructor
);
2188 /* Finish an expression of the form CODE EXPR. */
2191 finish_unary_op_expr (enum tree_code code
, tree expr
)
2193 tree result
= build_x_unary_op (code
, expr
, tf_warning_or_error
);
2194 /* Inside a template, build_x_unary_op does not fold the
2195 expression. So check whether the result is folded before
2196 setting TREE_NEGATED_INT. */
2197 if (code
== NEGATE_EXPR
&& TREE_CODE (expr
) == INTEGER_CST
2198 && TREE_CODE (result
) == INTEGER_CST
2199 && !TYPE_UNSIGNED (TREE_TYPE (result
))
2200 && INT_CST_LT (result
, integer_zero_node
))
2202 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2203 setting TREE_NEGATED_INT. */
2204 result
= copy_node (result
);
2205 TREE_NEGATED_INT (result
) = 1;
2207 if (TREE_OVERFLOW_P (result
) && !TREE_OVERFLOW_P (expr
))
2208 overflow_warning (input_location
, result
);
2213 /* Finish a compound-literal expression. TYPE is the type to which
2214 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2217 finish_compound_literal (tree type
, tree compound_literal
)
2219 if (type
== error_mark_node
)
2220 return error_mark_node
;
2222 if (!TYPE_OBJ_P (type
))
2224 error ("compound literal of non-object type %qT", type
);
2225 return error_mark_node
;
2228 if (processing_template_decl
)
2230 TREE_TYPE (compound_literal
) = type
;
2231 /* Mark the expression as a compound literal. */
2232 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2233 return compound_literal
;
2236 type
= complete_type (type
);
2238 if (TYPE_NON_AGGREGATE_CLASS (type
))
2240 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2241 everywhere that deals with function arguments would be a pain, so
2242 just wrap it in a TREE_LIST. The parser set a flag so we know
2243 that it came from T{} rather than T({}). */
2244 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal
) = 1;
2245 compound_literal
= build_tree_list (NULL_TREE
, compound_literal
);
2246 return build_functional_cast (type
, compound_literal
, tf_error
);
2249 if (TREE_CODE (type
) == ARRAY_TYPE
2250 && check_array_initializer (NULL_TREE
, type
, compound_literal
))
2251 return error_mark_node
;
2252 compound_literal
= reshape_init (type
, compound_literal
);
2253 if (TREE_CODE (type
) == ARRAY_TYPE
)
2254 cp_complete_array_type (&type
, compound_literal
, false);
2255 compound_literal
= digest_init (type
, compound_literal
);
2256 if ((!at_function_scope_p () || cp_type_readonly (type
))
2257 && initializer_constant_valid_p (compound_literal
, type
))
2259 tree decl
= create_temporary_var (type
);
2260 DECL_INITIAL (decl
) = compound_literal
;
2261 TREE_STATIC (decl
) = 1;
2262 cp_apply_type_quals_to_decl (cp_type_quals (type
), decl
);
2263 decl
= pushdecl_top_level (decl
);
2264 DECL_NAME (decl
) = make_anon_name ();
2265 SET_DECL_ASSEMBLER_NAME (decl
, DECL_NAME (decl
));
2269 return get_target_expr (compound_literal
);
2272 /* Return the declaration for the function-name variable indicated by
2276 finish_fname (tree id
)
2280 decl
= fname_decl (input_location
, C_RID_CODE (id
), id
);
2281 if (processing_template_decl
)
2282 decl
= DECL_NAME (decl
);
2286 /* Finish a translation unit. */
2289 finish_translation_unit (void)
2291 /* In case there were missing closebraces,
2292 get us back to the global binding level. */
2294 while (current_namespace
!= global_namespace
)
2297 /* Do file scope __FUNCTION__ et al. */
2298 finish_fname_decls ();
2301 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2302 Returns the parameter. */
2305 finish_template_type_parm (tree aggr
, tree identifier
)
2307 if (aggr
!= class_type_node
)
2309 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
2310 aggr
= class_type_node
;
2313 return build_tree_list (aggr
, identifier
);
2316 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2317 Returns the parameter. */
2320 finish_template_template_parm (tree aggr
, tree identifier
)
2322 tree decl
= build_decl (input_location
,
2323 TYPE_DECL
, identifier
, NULL_TREE
);
2324 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2325 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2326 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2327 DECL_ARTIFICIAL (decl
) = 1;
2328 end_template_decl ();
2330 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2332 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
2333 /*is_primary=*/true, /*is_partial=*/false,
2336 return finish_template_type_parm (aggr
, tmpl
);
2339 /* ARGUMENT is the default-argument value for a template template
2340 parameter. If ARGUMENT is invalid, issue error messages and return
2341 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2344 check_template_template_default_arg (tree argument
)
2346 if (TREE_CODE (argument
) != TEMPLATE_DECL
2347 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2348 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2350 if (TREE_CODE (argument
) == TYPE_DECL
)
2351 error ("invalid use of type %qT as a default value for a template "
2352 "template-parameter", TREE_TYPE (argument
));
2354 error ("invalid default argument for a template template parameter");
2355 return error_mark_node
;
2361 /* Begin a class definition, as indicated by T. */
2364 begin_class_definition (tree t
, tree attributes
)
2366 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
2367 return error_mark_node
;
2369 if (processing_template_parmlist
)
2371 error ("definition of %q#T inside template parameter list", t
);
2372 return error_mark_node
;
2375 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2376 are passed the same as decimal scalar types. */
2377 if (TREE_CODE (t
) == RECORD_TYPE
2378 && !processing_template_decl
)
2380 tree ns
= TYPE_CONTEXT (t
);
2381 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
2382 && DECL_CONTEXT (ns
) == std_node
2384 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns
)), "decimal"))
2386 const char *n
= TYPE_NAME_STRING (t
);
2387 if ((strcmp (n
, "decimal32") == 0)
2388 || (strcmp (n
, "decimal64") == 0)
2389 || (strcmp (n
, "decimal128") == 0))
2390 TYPE_TRANSPARENT_AGGR (t
) = 1;
2394 /* A non-implicit typename comes from code like:
2396 template <typename T> struct A {
2397 template <typename U> struct A<T>::B ...
2399 This is erroneous. */
2400 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2402 error ("invalid definition of qualified type %qT", t
);
2403 t
= error_mark_node
;
2406 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
2408 t
= make_class_type (RECORD_TYPE
);
2409 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
2412 if (TYPE_BEING_DEFINED (t
))
2414 t
= make_class_type (TREE_CODE (t
));
2415 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
2417 maybe_process_partial_specialization (t
);
2419 TYPE_BEING_DEFINED (t
) = 1;
2421 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
2423 if (flag_pack_struct
)
2426 TYPE_PACKED (t
) = 1;
2427 /* Even though the type is being defined for the first time
2428 here, there might have been a forward declaration, so there
2429 might be cv-qualified variants of T. */
2430 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
2431 TYPE_PACKED (v
) = 1;
2433 /* Reset the interface data, at the earliest possible
2434 moment, as it might have been set via a class foo;
2436 if (! TYPE_ANONYMOUS_P (t
))
2438 struct c_fileinfo
*finfo
= get_fileinfo (input_filename
);
2439 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
2440 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2441 (t
, finfo
->interface_unknown
);
2443 reset_specialization();
2445 /* Make a declaration for this class in its own scope. */
2446 build_self_reference ();
2451 /* Finish the member declaration given by DECL. */
2454 finish_member_declaration (tree decl
)
2456 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
2459 if (decl
== void_type_node
)
2460 /* The COMPONENT was a friend, not a member, and so there's
2461 nothing for us to do. */
2464 /* We should see only one DECL at a time. */
2465 gcc_assert (TREE_CHAIN (decl
) == NULL_TREE
);
2467 /* Set up access control for DECL. */
2469 = (current_access_specifier
== access_private_node
);
2470 TREE_PROTECTED (decl
)
2471 = (current_access_specifier
== access_protected_node
);
2472 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2474 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
2475 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
2478 /* Mark the DECL as a member of the current class. */
2479 DECL_CONTEXT (decl
) = current_class_type
;
2481 /* Check for bare parameter packs in the member variable declaration. */
2482 if (TREE_CODE (decl
) == FIELD_DECL
)
2484 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
2485 TREE_TYPE (decl
) = error_mark_node
;
2486 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
2487 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
2492 A C language linkage is ignored for the names of class members
2493 and the member function type of class member functions. */
2494 if (DECL_LANG_SPECIFIC (decl
) && DECL_LANGUAGE (decl
) == lang_c
)
2495 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
2497 /* Put functions on the TYPE_METHODS list and everything else on the
2498 TYPE_FIELDS list. Note that these are built up in reverse order.
2499 We reverse them (to obtain declaration order) in finish_struct. */
2500 if (TREE_CODE (decl
) == FUNCTION_DECL
2501 || DECL_FUNCTION_TEMPLATE_P (decl
))
2503 /* We also need to add this function to the
2504 CLASSTYPE_METHOD_VEC. */
2505 if (add_method (current_class_type
, decl
, NULL_TREE
))
2507 TREE_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
2508 TYPE_METHODS (current_class_type
) = decl
;
2510 maybe_add_class_template_decl_list (current_class_type
, decl
,
2514 /* Enter the DECL into the scope of the class. */
2515 else if ((TREE_CODE (decl
) == USING_DECL
&& !DECL_DEPENDENT_P (decl
))
2516 || pushdecl_class_level (decl
))
2518 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2519 go at the beginning. The reason is that lookup_field_1
2520 searches the list in order, and we want a field name to
2521 override a type name so that the "struct stat hack" will
2522 work. In particular:
2524 struct S { enum E { }; int E } s;
2527 is valid. In addition, the FIELD_DECLs must be maintained in
2528 declaration order so that class layout works as expected.
2529 However, we don't need that order until class layout, so we
2530 save a little time by putting FIELD_DECLs on in reverse order
2531 here, and then reversing them in finish_struct_1. (We could
2532 also keep a pointer to the correct insertion points in the
2535 if (TREE_CODE (decl
) == TYPE_DECL
)
2536 TYPE_FIELDS (current_class_type
)
2537 = chainon (TYPE_FIELDS (current_class_type
), decl
);
2540 TREE_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
2541 TYPE_FIELDS (current_class_type
) = decl
;
2544 maybe_add_class_template_decl_list (current_class_type
, decl
,
2549 note_decl_for_pch (decl
);
2552 /* DECL has been declared while we are building a PCH file. Perform
2553 actions that we might normally undertake lazily, but which can be
2554 performed now so that they do not have to be performed in
2555 translation units which include the PCH file. */
2558 note_decl_for_pch (tree decl
)
2560 gcc_assert (pch_file
);
2562 /* There's a good chance that we'll have to mangle names at some
2563 point, even if only for emission in debugging information. */
2564 if ((TREE_CODE (decl
) == VAR_DECL
2565 || TREE_CODE (decl
) == FUNCTION_DECL
)
2566 && !processing_template_decl
)
2570 /* Finish processing a complete template declaration. The PARMS are
2571 the template parameters. */
2574 finish_template_decl (tree parms
)
2577 end_template_decl ();
2579 end_specialization ();
2582 /* Finish processing a template-id (which names a type) of the form
2583 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2584 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2585 the scope of template-id indicated. */
2588 finish_template_type (tree name
, tree args
, int entering_scope
)
2592 decl
= lookup_template_class (name
, args
,
2593 NULL_TREE
, NULL_TREE
, entering_scope
,
2594 tf_warning_or_error
| tf_user
);
2595 if (decl
!= error_mark_node
)
2596 decl
= TYPE_STUB_DECL (decl
);
2601 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2602 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2603 BASE_CLASS, or NULL_TREE if an error occurred. The
2604 ACCESS_SPECIFIER is one of
2605 access_{default,public,protected_private}_node. For a virtual base
2606 we set TREE_TYPE. */
2609 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
2613 if (base
== error_mark_node
)
2615 error ("invalid base-class specification");
2618 else if (! MAYBE_CLASS_TYPE_P (base
))
2620 error ("%qT is not a class type", base
);
2625 if (cp_type_quals (base
) != 0)
2627 error ("base class %qT has cv qualifiers", base
);
2628 base
= TYPE_MAIN_VARIANT (base
);
2630 result
= build_tree_list (access
, base
);
2632 TREE_TYPE (result
) = integer_type_node
;
2638 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2639 what we found when we tried to do the lookup.
2640 LOCATION is the location of the NAME identifier;
2641 The location is used in the error message*/
2644 qualified_name_lookup_error (tree scope
, tree name
,
2645 tree decl
, location_t location
)
2647 if (scope
== error_mark_node
)
2648 ; /* We already complained. */
2649 else if (TYPE_P (scope
))
2651 if (!COMPLETE_TYPE_P (scope
))
2652 error_at (location
, "incomplete type %qT used in nested name specifier",
2654 else if (TREE_CODE (decl
) == TREE_LIST
)
2656 error_at (location
, "reference to %<%T::%D%> is ambiguous",
2658 print_candidates (decl
);
2661 error_at (location
, "%qD is not a member of %qT", name
, scope
);
2663 else if (scope
!= global_namespace
)
2664 error_at (location
, "%qD is not a member of %qD", name
, scope
);
2666 error_at (location
, "%<::%D%> has not been declared", name
);
2669 /* If FNS is a member function, a set of member functions, or a
2670 template-id referring to one or more member functions, return a
2671 BASELINK for FNS, incorporating the current access context.
2672 Otherwise, return FNS unchanged. */
2675 baselink_for_fns (tree fns
)
2680 if (BASELINK_P (fns
)
2681 || error_operand_p (fns
))
2685 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2686 fn
= TREE_OPERAND (fn
, 0);
2687 fn
= get_first_fn (fn
);
2688 if (!DECL_FUNCTION_MEMBER_P (fn
))
2691 cl
= currently_open_derived_class (DECL_CONTEXT (fn
));
2693 cl
= DECL_CONTEXT (fn
);
2694 cl
= TYPE_BINFO (cl
);
2695 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
2698 /* Returns true iff DECL is an automatic variable from a function outside
2702 outer_automatic_var_p (tree decl
)
2704 return ((TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
2705 && DECL_FUNCTION_SCOPE_P (decl
)
2706 && !TREE_STATIC (decl
)
2707 && DECL_CONTEXT (decl
) != current_function_decl
);
2710 /* Returns true iff DECL is a capture field from a lambda that is not our
2711 immediate context. */
2714 outer_lambda_capture_p (tree decl
)
2716 return (TREE_CODE (decl
) == FIELD_DECL
2717 && LAMBDA_TYPE_P (DECL_CONTEXT (decl
))
2718 && (!current_class_type
2719 || !DERIVED_FROM_P (DECL_CONTEXT (decl
), current_class_type
)));
2722 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2723 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2724 if non-NULL, is the type or namespace used to explicitly qualify
2725 ID_EXPRESSION. DECL is the entity to which that name has been
2728 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2729 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2730 be set to true if this expression isn't permitted in a
2731 constant-expression, but it is otherwise not set by this function.
2732 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2733 constant-expression, but a non-constant expression is also
2736 DONE is true if this expression is a complete postfix-expression;
2737 it is false if this expression is followed by '->', '[', '(', etc.
2738 ADDRESS_P is true iff this expression is the operand of '&'.
2739 TEMPLATE_P is true iff the qualified-id was of the form
2740 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2741 appears as a template argument.
2743 If an error occurs, and it is the kind of error that might cause
2744 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2745 is the caller's responsibility to issue the message. *ERROR_MSG
2746 will be a string with static storage duration, so the caller need
2749 Return an expression for the entity, after issuing appropriate
2750 diagnostics. This function is also responsible for transforming a
2751 reference to a non-static member into a COMPONENT_REF that makes
2752 the use of "this" explicit.
2754 Upon return, *IDK will be filled in appropriately. */
2756 finish_id_expression (tree id_expression
,
2760 bool integral_constant_expression_p
,
2761 bool allow_non_integral_constant_expression_p
,
2762 bool *non_integral_constant_expression_p
,
2766 bool template_arg_p
,
2767 const char **error_msg
,
2768 location_t location
)
2770 /* Initialize the output parameters. */
2771 *idk
= CP_ID_KIND_NONE
;
2774 if (id_expression
== error_mark_node
)
2775 return error_mark_node
;
2776 /* If we have a template-id, then no further lookup is
2777 required. If the template-id was for a template-class, we
2778 will sometimes have a TYPE_DECL at this point. */
2779 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2780 || TREE_CODE (decl
) == TYPE_DECL
)
2782 /* Look up the name. */
2785 if (decl
== error_mark_node
)
2787 /* Name lookup failed. */
2790 || (!dependent_type_p (scope
)
2791 && !(TREE_CODE (id_expression
) == IDENTIFIER_NODE
2792 && IDENTIFIER_TYPENAME_P (id_expression
)
2793 && dependent_type_p (TREE_TYPE (id_expression
))))))
2795 /* If the qualifying type is non-dependent (and the name
2796 does not name a conversion operator to a dependent
2797 type), issue an error. */
2798 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
2799 return error_mark_node
;
2803 /* It may be resolved via Koenig lookup. */
2804 *idk
= CP_ID_KIND_UNQUALIFIED
;
2805 return id_expression
;
2808 decl
= id_expression
;
2810 /* If DECL is a variable that would be out of scope under
2811 ANSI/ISO rules, but in scope in the ARM, name lookup
2812 will succeed. Issue a diagnostic here. */
2814 decl
= check_for_out_of_scope_variable (decl
);
2816 /* Remember that the name was used in the definition of
2817 the current class so that we can check later to see if
2818 the meaning would have been different after the class
2819 was entirely defined. */
2820 if (!scope
&& decl
!= error_mark_node
)
2821 maybe_note_name_used_in_class (id_expression
, decl
);
2823 /* Disallow uses of local variables from containing functions, except
2824 within lambda-expressions. */
2825 if ((outer_automatic_var_p (decl
)
2826 || outer_lambda_capture_p (decl
))
2827 /* It's not a use (3.2) if we're in an unevaluated context. */
2828 && !cp_unevaluated_operand
)
2830 tree context
= DECL_CONTEXT (decl
);
2831 tree containing_function
= current_function_decl
;
2832 tree lambda_stack
= NULL_TREE
;
2833 tree lambda_expr
= NULL_TREE
;
2834 tree initializer
= decl
;
2836 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2837 support for an approach in which a reference to a local
2838 [constant] automatic variable in a nested class or lambda body
2839 would enter the expression as an rvalue, which would reduce
2840 the complexity of the problem"
2842 FIXME update for final resolution of core issue 696. */
2843 if (DECL_INTEGRAL_CONSTANT_VAR_P (decl
))
2844 return integral_constant_value (decl
);
2846 if (TYPE_P (context
))
2848 /* Implicit capture of an explicit capture. */
2849 context
= lambda_function (context
);
2850 initializer
= thisify_lambda_field (decl
);
2853 /* If we are in a lambda function, we can move out until we hit
2855 2. a non-lambda function, or
2856 3. a non-default capturing lambda function. */
2857 while (context
!= containing_function
2858 && LAMBDA_FUNCTION_P (containing_function
))
2860 lambda_expr
= CLASSTYPE_LAMBDA_EXPR
2861 (DECL_CONTEXT (containing_function
));
2863 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
2867 lambda_stack
= tree_cons (NULL_TREE
,
2872 = decl_function_context (containing_function
);
2875 if (context
== containing_function
)
2877 decl
= add_default_capture (lambda_stack
,
2878 /*id=*/DECL_NAME (decl
),
2881 else if (lambda_expr
)
2883 error ("%qD is not captured", decl
);
2884 return error_mark_node
;
2888 error (TREE_CODE (decl
) == VAR_DECL
2889 ? "use of %<auto%> variable from containing function"
2890 : "use of parameter from containing function");
2891 error (" %q+#D declared here", decl
);
2892 return error_mark_node
;
2897 /* If we didn't find anything, or what we found was a type,
2898 then this wasn't really an id-expression. */
2899 if (TREE_CODE (decl
) == TEMPLATE_DECL
2900 && !DECL_FUNCTION_TEMPLATE_P (decl
))
2902 *error_msg
= "missing template arguments";
2903 return error_mark_node
;
2905 else if (TREE_CODE (decl
) == TYPE_DECL
2906 || TREE_CODE (decl
) == NAMESPACE_DECL
)
2908 *error_msg
= "expected primary-expression";
2909 return error_mark_node
;
2912 /* If the name resolved to a template parameter, there is no
2913 need to look it up again later. */
2914 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
2915 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
2919 *idk
= CP_ID_KIND_NONE
;
2920 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
2921 decl
= TEMPLATE_PARM_DECL (decl
);
2922 r
= convert_from_reference (DECL_INITIAL (decl
));
2924 if (integral_constant_expression_p
2925 && !dependent_type_p (TREE_TYPE (decl
))
2926 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
2928 if (!allow_non_integral_constant_expression_p
)
2929 error ("template parameter %qD of type %qT is not allowed in "
2930 "an integral constant expression because it is not of "
2931 "integral or enumeration type", decl
, TREE_TYPE (decl
));
2932 *non_integral_constant_expression_p
= true;
2936 /* Similarly, we resolve enumeration constants to their
2937 underlying values. */
2938 else if (TREE_CODE (decl
) == CONST_DECL
)
2940 *idk
= CP_ID_KIND_NONE
;
2941 if (!processing_template_decl
)
2943 used_types_insert (TREE_TYPE (decl
));
2944 return DECL_INITIAL (decl
);
2952 /* If the declaration was explicitly qualified indicate
2953 that. The semantics of `A::f(3)' are different than
2954 `f(3)' if `f' is virtual. */
2956 ? CP_ID_KIND_QUALIFIED
2957 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2958 ? CP_ID_KIND_TEMPLATE_ID
2959 : CP_ID_KIND_UNQUALIFIED
));
2964 An id-expression is type-dependent if it contains an
2965 identifier that was declared with a dependent type.
2967 The standard is not very specific about an id-expression that
2968 names a set of overloaded functions. What if some of them
2969 have dependent types and some of them do not? Presumably,
2970 such a name should be treated as a dependent name. */
2971 /* Assume the name is not dependent. */
2972 dependent_p
= false;
2973 if (!processing_template_decl
)
2974 /* No names are dependent outside a template. */
2976 /* A template-id where the name of the template was not resolved
2977 is definitely dependent. */
2978 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2979 && (TREE_CODE (TREE_OPERAND (decl
, 0))
2980 == IDENTIFIER_NODE
))
2982 /* For anything except an overloaded function, just check its
2984 else if (!is_overloaded_fn (decl
))
2986 = dependent_type_p (TREE_TYPE (decl
));
2987 /* For a set of overloaded functions, check each of the
2993 if (BASELINK_P (fns
))
2994 fns
= BASELINK_FUNCTIONS (fns
);
2996 /* For a template-id, check to see if the template
2997 arguments are dependent. */
2998 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
3000 tree args
= TREE_OPERAND (fns
, 1);
3001 dependent_p
= any_dependent_template_arguments_p (args
);
3002 /* The functions are those referred to by the
3004 fns
= TREE_OPERAND (fns
, 0);
3007 /* If there are no dependent template arguments, go through
3008 the overloaded functions. */
3009 while (fns
&& !dependent_p
)
3011 tree fn
= OVL_CURRENT (fns
);
3013 /* Member functions of dependent classes are
3015 if (TREE_CODE (fn
) == FUNCTION_DECL
3016 && type_dependent_expression_p (fn
))
3018 else if (TREE_CODE (fn
) == TEMPLATE_DECL
3019 && dependent_template_p (fn
))
3022 fns
= OVL_NEXT (fns
);
3026 /* If the name was dependent on a template parameter, we will
3027 resolve the name at instantiation time. */
3030 /* Create a SCOPE_REF for qualified names, if the scope is
3036 if (address_p
&& done
)
3037 decl
= finish_qualified_id_expr (scope
, decl
,
3043 tree type
= NULL_TREE
;
3044 if (DECL_P (decl
) && !dependent_scope_p (scope
))
3045 type
= TREE_TYPE (decl
);
3046 decl
= build_qualified_name (type
,
3052 if (TREE_TYPE (decl
))
3053 decl
= convert_from_reference (decl
);
3056 /* A TEMPLATE_ID already contains all the information we
3058 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
)
3059 return id_expression
;
3060 *idk
= CP_ID_KIND_UNQUALIFIED_DEPENDENT
;
3061 /* If we found a variable, then name lookup during the
3062 instantiation will always resolve to the same VAR_DECL
3063 (or an instantiation thereof). */
3064 if (TREE_CODE (decl
) == VAR_DECL
3065 || TREE_CODE (decl
) == PARM_DECL
)
3066 return convert_from_reference (decl
);
3067 /* The same is true for FIELD_DECL, but we also need to
3068 make sure that the syntax is correct. */
3069 else if (TREE_CODE (decl
) == FIELD_DECL
)
3071 /* Since SCOPE is NULL here, this is an unqualified name.
3072 Access checking has been performed during name lookup
3073 already. Turn off checking to avoid duplicate errors. */
3074 push_deferring_access_checks (dk_no_check
);
3075 decl
= finish_non_static_data_member
3076 (decl
, current_class_ref
,
3077 /*qualifying_scope=*/NULL_TREE
);
3078 pop_deferring_access_checks ();
3081 return id_expression
;
3084 /* Only certain kinds of names are allowed in constant
3085 expression. Enumerators and template parameters have already
3086 been handled above. */
3087 if (integral_constant_expression_p
3088 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl
)
3089 && ! builtin_valid_in_constant_expr_p (decl
))
3091 if (!allow_non_integral_constant_expression_p
)
3093 error ("%qD cannot appear in a constant-expression", decl
);
3094 return error_mark_node
;
3096 *non_integral_constant_expression_p
= true;
3099 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3101 error ("use of namespace %qD as expression", decl
);
3102 return error_mark_node
;
3104 else if (DECL_CLASS_TEMPLATE_P (decl
))
3106 error ("use of class template %qT as expression", decl
);
3107 return error_mark_node
;
3109 else if (TREE_CODE (decl
) == TREE_LIST
)
3111 /* Ambiguous reference to base members. */
3112 error ("request for member %qD is ambiguous in "
3113 "multiple inheritance lattice", id_expression
);
3114 print_candidates (decl
);
3115 return error_mark_node
;
3118 /* Mark variable-like entities as used. Functions are similarly
3119 marked either below or after overload resolution. */
3120 if (TREE_CODE (decl
) == VAR_DECL
3121 || TREE_CODE (decl
) == PARM_DECL
3122 || TREE_CODE (decl
) == RESULT_DECL
)
3127 decl
= (adjust_result_of_qualified_name_lookup
3128 (decl
, scope
, current_class_type
));
3130 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3133 if (TREE_CODE (decl
) == FIELD_DECL
|| BASELINK_P (decl
))
3134 decl
= finish_qualified_id_expr (scope
,
3142 tree r
= convert_from_reference (decl
);
3144 if (processing_template_decl
&& TYPE_P (scope
))
3145 r
= build_qualified_name (TREE_TYPE (r
),
3151 else if (TREE_CODE (decl
) == FIELD_DECL
)
3153 /* Since SCOPE is NULL here, this is an unqualified name.
3154 Access checking has been performed during name lookup
3155 already. Turn off checking to avoid duplicate errors. */
3156 push_deferring_access_checks (dk_no_check
);
3157 decl
= finish_non_static_data_member (decl
, current_class_ref
,
3158 /*qualifying_scope=*/NULL_TREE
);
3159 pop_deferring_access_checks ();
3161 else if (is_overloaded_fn (decl
))
3166 if (TREE_CODE (first_fn
) == TEMPLATE_ID_EXPR
)
3167 first_fn
= TREE_OPERAND (first_fn
, 0);
3168 first_fn
= get_first_fn (first_fn
);
3169 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
3170 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
3172 if (!really_overloaded_fn (decl
))
3173 mark_used (first_fn
);
3176 && TREE_CODE (first_fn
) == FUNCTION_DECL
3177 && DECL_FUNCTION_MEMBER_P (first_fn
)
3178 && !shared_member_p (decl
))
3180 /* A set of member functions. */
3181 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3182 return finish_class_member_access_expr (decl
, id_expression
,
3183 /*template_p=*/false,
3184 tf_warning_or_error
);
3187 decl
= baselink_for_fns (decl
);
3191 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3192 && DECL_CLASS_SCOPE_P (decl
))
3194 tree context
= context_for_name_lookup (decl
);
3195 if (context
!= current_class_type
)
3197 tree path
= currently_open_derived_class (context
);
3198 perform_or_defer_access_check (TYPE_BINFO (path
),
3203 decl
= convert_from_reference (decl
);
3207 if (TREE_DEPRECATED (decl
))
3208 warn_deprecated_use (decl
, NULL_TREE
);
3213 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3214 use as a type-specifier. */
3217 finish_typeof (tree expr
)
3221 if (type_dependent_expression_p (expr
))
3223 type
= cxx_make_type (TYPEOF_TYPE
);
3224 TYPEOF_TYPE_EXPR (type
) = expr
;
3225 SET_TYPE_STRUCTURAL_EQUALITY (type
);
3230 type
= unlowered_expr_type (expr
);
3232 if (!type
|| type
== unknown_type_node
)
3234 error ("type of %qE is unknown", expr
);
3235 return error_mark_node
;
3241 /* Perform C++-specific checks for __builtin_offsetof before calling
3245 finish_offsetof (tree expr
)
3247 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
3249 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3250 TREE_OPERAND (expr
, 2));
3251 return error_mark_node
;
3253 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
3254 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
3255 || TREE_CODE (TREE_TYPE (expr
)) == UNKNOWN_TYPE
)
3257 if (TREE_CODE (expr
) == COMPONENT_REF
3258 || TREE_CODE (expr
) == COMPOUND_EXPR
)
3259 expr
= TREE_OPERAND (expr
, 1);
3260 error ("cannot apply %<offsetof%> to member function %qD", expr
);
3261 return error_mark_node
;
3263 if (TREE_CODE (expr
) == INDIRECT_REF
&& REFERENCE_REF_P (expr
))
3264 expr
= TREE_OPERAND (expr
, 0);
3265 return fold_offsetof (expr
, NULL_TREE
);
3268 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3269 function is broken out from the above for the benefit of the tree-ssa
3273 simplify_aggr_init_expr (tree
*tp
)
3275 tree aggr_init_expr
= *tp
;
3277 /* Form an appropriate CALL_EXPR. */
3278 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
3279 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
3280 tree type
= TREE_TYPE (slot
);
3283 enum style_t
{ ctor
, arg
, pcc
} style
;
3285 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
3287 #ifdef PCC_STATIC_STRUCT_RETURN
3293 gcc_assert (TREE_ADDRESSABLE (type
));
3297 call_expr
= build_call_array_loc (input_location
,
3298 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
3300 aggr_init_expr_nargs (aggr_init_expr
),
3301 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
3305 /* Replace the first argument to the ctor with the address of the
3307 cxx_mark_addressable (slot
);
3308 CALL_EXPR_ARG (call_expr
, 0) =
3309 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
3311 else if (style
== arg
)
3313 /* Just mark it addressable here, and leave the rest to
3314 expand_call{,_inline}. */
3315 cxx_mark_addressable (slot
);
3316 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
3317 call_expr
= build2 (MODIFY_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
3319 else if (style
== pcc
)
3321 /* If we're using the non-reentrant PCC calling convention, then we
3322 need to copy the returned value out of the static buffer into the
3324 push_deferring_access_checks (dk_no_check
);
3325 call_expr
= build_aggr_init (slot
, call_expr
,
3326 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
3327 tf_warning_or_error
);
3328 pop_deferring_access_checks ();
3329 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
3332 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
3334 tree init
= build_zero_init (type
, NULL_TREE
,
3335 /*static_storage_p=*/false);
3336 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
3337 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
3344 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3347 emit_associated_thunks (tree fn
)
3349 /* When we use vcall offsets, we emit thunks with the virtual
3350 functions to which they thunk. The whole point of vcall offsets
3351 is so that you can know statically the entire set of thunks that
3352 will ever be needed for a given virtual function, thereby
3353 enabling you to output all the thunks with the function itself. */
3354 if (DECL_VIRTUAL_P (fn
)
3355 /* Do not emit thunks for extern template instantiations. */
3356 && ! DECL_REALLY_EXTERN (fn
))
3360 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= TREE_CHAIN (thunk
))
3362 if (!THUNK_ALIAS (thunk
))
3364 use_thunk (thunk
, /*emit_p=*/1);
3365 if (DECL_RESULT_THUNK_P (thunk
))
3369 for (probe
= DECL_THUNKS (thunk
);
3370 probe
; probe
= TREE_CHAIN (probe
))
3371 use_thunk (probe
, /*emit_p=*/1);
3375 gcc_assert (!DECL_THUNKS (thunk
));
3380 /* Generate RTL for FN. */
3383 expand_or_defer_fn_1 (tree fn
)
3385 /* When the parser calls us after finishing the body of a template
3386 function, we don't really want to expand the body. */
3387 if (processing_template_decl
)
3389 /* Normally, collection only occurs in rest_of_compilation. So,
3390 if we don't collect here, we never collect junk generated
3391 during the processing of templates until we hit a
3392 non-template function. It's not safe to do this inside a
3393 nested class, though, as the parser may have local state that
3394 is not a GC root. */
3395 if (!function_depth
)
3400 gcc_assert (DECL_SAVED_TREE (fn
));
3402 /* If this is a constructor or destructor body, we have to clone
3404 if (maybe_clone_body (fn
))
3406 /* We don't want to process FN again, so pretend we've written
3407 it out, even though we haven't. */
3408 TREE_ASM_WRITTEN (fn
) = 1;
3409 DECL_SAVED_TREE (fn
) = NULL_TREE
;
3413 /* We make a decision about linkage for these functions at the end
3414 of the compilation. Until that point, we do not want the back
3415 end to output them -- but we do want it to see the bodies of
3416 these functions so that it can inline them as appropriate. */
3417 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
3419 if (DECL_INTERFACE_KNOWN (fn
))
3420 /* We've already made a decision as to how this function will
3424 DECL_EXTERNAL (fn
) = 1;
3425 DECL_NOT_REALLY_EXTERN (fn
) = 1;
3426 note_vague_linkage_fn (fn
);
3427 /* A non-template inline function with external linkage will
3428 always be COMDAT. As we must eventually determine the
3429 linkage of all functions, and as that causes writes to
3430 the data mapped in from the PCH file, it's advantageous
3431 to mark the functions at this point. */
3432 if (!DECL_IMPLICIT_INSTANTIATION (fn
))
3434 /* This function must have external linkage, as
3435 otherwise DECL_INTERFACE_KNOWN would have been
3437 gcc_assert (TREE_PUBLIC (fn
));
3438 comdat_linkage (fn
);
3439 DECL_INTERFACE_KNOWN (fn
) = 1;
3443 import_export_decl (fn
);
3445 /* If the user wants us to keep all inline functions, then mark
3446 this function as needed so that finish_file will make sure to
3447 output it later. Similarly, all dllexport'd functions must
3448 be emitted; there may be callers in other DLLs. */
3449 if ((flag_keep_inline_functions
&& DECL_DECLARED_INLINE_P (fn
))
3450 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
)))
3454 /* There's no reason to do any of the work here if we're only doing
3455 semantic analysis; this code just generates RTL. */
3456 if (flag_syntax_only
)
3463 expand_or_defer_fn (tree fn
)
3465 if (expand_or_defer_fn_1 (fn
))
3469 /* Expand or defer, at the whim of the compilation unit manager. */
3470 cgraph_finalize_function (fn
, function_depth
> 1);
3471 emit_associated_thunks (fn
);
3484 /* Helper function for walk_tree, used by finalize_nrv below. */
3487 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
3489 struct nrv_data
*dp
= (struct nrv_data
*)data
;
3492 /* No need to walk into types. There wouldn't be any need to walk into
3493 non-statements, except that we have to consider STMT_EXPRs. */
3496 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3497 but differs from using NULL_TREE in that it indicates that we care
3498 about the value of the RESULT_DECL. */
3499 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
3500 TREE_OPERAND (*tp
, 0) = dp
->result
;
3501 /* Change all cleanups for the NRV to only run when an exception is
3503 else if (TREE_CODE (*tp
) == CLEANUP_STMT
3504 && CLEANUP_DECL (*tp
) == dp
->var
)
3505 CLEANUP_EH_ONLY (*tp
) = 1;
3506 /* Replace the DECL_EXPR for the NRV with an initialization of the
3507 RESULT_DECL, if needed. */
3508 else if (TREE_CODE (*tp
) == DECL_EXPR
3509 && DECL_EXPR_DECL (*tp
) == dp
->var
)
3512 if (DECL_INITIAL (dp
->var
)
3513 && DECL_INITIAL (dp
->var
) != error_mark_node
)
3514 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
3515 DECL_INITIAL (dp
->var
));
3517 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
3518 DECL_INITIAL (dp
->var
) = NULL_TREE
;
3519 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
3522 /* And replace all uses of the NRV with the RESULT_DECL. */
3523 else if (*tp
== dp
->var
)
3526 /* Avoid walking into the same tree more than once. Unfortunately, we
3527 can't just use walk_tree_without duplicates because it would only call
3528 us for the first occurrence of dp->var in the function body. */
3529 slot
= htab_find_slot (dp
->visited
, *tp
, INSERT
);
3535 /* Keep iterating. */
3539 /* Called from finish_function to implement the named return value
3540 optimization by overriding all the RETURN_EXPRs and pertinent
3541 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3542 RESULT_DECL for the function. */
3545 finalize_nrv (tree
*tp
, tree var
, tree result
)
3547 struct nrv_data data
;
3549 /* Copy debugging information from VAR to RESULT. */
3550 DECL_NAME (result
) = DECL_NAME (var
);
3551 DECL_ARTIFICIAL (result
) = DECL_ARTIFICIAL (var
);
3552 DECL_IGNORED_P (result
) = DECL_IGNORED_P (var
);
3553 DECL_SOURCE_LOCATION (result
) = DECL_SOURCE_LOCATION (var
);
3554 DECL_ABSTRACT_ORIGIN (result
) = DECL_ABSTRACT_ORIGIN (var
);
3555 /* Don't forget that we take its address. */
3556 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
3559 data
.result
= result
;
3560 data
.visited
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
3561 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
3562 htab_delete (data
.visited
);
3565 /* Return the declaration for the function called by CALL_EXPR T,
3566 TYPE is the class type of the clause decl. */
3569 omp_clause_info_fndecl (tree t
, tree type
)
3571 tree ret
= get_callee_fndecl (t
);
3576 gcc_assert (TREE_CODE (t
) == CALL_EXPR
);
3577 t
= CALL_EXPR_FN (t
);
3579 if (TREE_CODE (t
) == OBJ_TYPE_REF
)
3581 t
= cp_fold_obj_type_ref (t
, type
);
3582 if (TREE_CODE (t
) == ADDR_EXPR
3583 && TREE_CODE (TREE_OPERAND (t
, 0)) == FUNCTION_DECL
)
3584 return TREE_OPERAND (t
, 0);
3590 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3593 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
3594 bool need_copy_ctor
, bool need_copy_assignment
)
3596 int save_errorcount
= errorcount
;
3599 /* Always allocate 3 elements for simplicity. These are the
3600 function decls for the ctor, dtor, and assignment op.
3601 This layout is known to the three lang hooks,
3602 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3603 and cxx_omp_clause_assign_op. */
3604 info
= make_tree_vec (3);
3605 CP_OMP_CLAUSE_INFO (c
) = info
;
3607 if (need_default_ctor
3608 || (need_copy_ctor
&& !TYPE_HAS_TRIVIAL_INIT_REF (type
)))
3612 if (need_default_ctor
)
3616 t
= build_int_cst (build_pointer_type (type
), 0);
3617 t
= build1 (INDIRECT_REF
, type
, t
);
3618 vec
= make_tree_vector_single (t
);
3620 t
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
3621 &vec
, type
, LOOKUP_NORMAL
,
3622 tf_warning_or_error
);
3625 release_tree_vector (vec
);
3627 if (targetm
.cxx
.cdtor_returns_this () || errorcount
)
3628 /* Because constructors and destructors return this,
3629 the call will have been cast to "void". Remove the
3630 cast here. We would like to use STRIP_NOPS, but it
3631 wouldn't work here because TYPE_MODE (t) and
3632 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3633 They are VOIDmode and Pmode, respectively. */
3634 if (TREE_CODE (t
) == NOP_EXPR
)
3635 t
= TREE_OPERAND (t
, 0);
3637 TREE_VEC_ELT (info
, 0) = get_callee_fndecl (t
);
3640 if ((need_default_ctor
|| need_copy_ctor
)
3641 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3643 t
= build_int_cst (build_pointer_type (type
), 0);
3644 t
= build1 (INDIRECT_REF
, type
, t
);
3645 t
= build_special_member_call (t
, complete_dtor_identifier
,
3646 NULL
, type
, LOOKUP_NORMAL
,
3647 tf_warning_or_error
);
3649 if (targetm
.cxx
.cdtor_returns_this () || errorcount
)
3650 /* Because constructors and destructors return this,
3651 the call will have been cast to "void". Remove the
3652 cast here. We would like to use STRIP_NOPS, but it
3653 wouldn't work here because TYPE_MODE (t) and
3654 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3655 They are VOIDmode and Pmode, respectively. */
3656 if (TREE_CODE (t
) == NOP_EXPR
)
3657 t
= TREE_OPERAND (t
, 0);
3659 TREE_VEC_ELT (info
, 1) = omp_clause_info_fndecl (t
, type
);
3662 if (need_copy_assignment
&& !TYPE_HAS_TRIVIAL_ASSIGN_REF (type
))
3666 t
= build_int_cst (build_pointer_type (type
), 0);
3667 t
= build1 (INDIRECT_REF
, type
, t
);
3668 vec
= make_tree_vector_single (t
);
3669 t
= build_special_member_call (t
, ansi_assopname (NOP_EXPR
),
3670 &vec
, type
, LOOKUP_NORMAL
,
3671 tf_warning_or_error
);
3672 release_tree_vector (vec
);
3674 /* We'll have called convert_from_reference on the call, which
3675 may well have added an indirect_ref. It's unneeded here,
3676 and in the way, so kill it. */
3677 if (TREE_CODE (t
) == INDIRECT_REF
)
3678 t
= TREE_OPERAND (t
, 0);
3680 TREE_VEC_ELT (info
, 2) = omp_clause_info_fndecl (t
, type
);
3683 return errorcount
!= save_errorcount
;
3686 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3687 Remove any elements from the list that are invalid. */
3690 finish_omp_clauses (tree clauses
)
3692 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
3693 tree c
, t
, *pc
= &clauses
;
3696 bitmap_obstack_initialize (NULL
);
3697 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
3698 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
3699 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
3701 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3703 bool remove
= false;
3705 switch (OMP_CLAUSE_CODE (c
))
3707 case OMP_CLAUSE_SHARED
:
3709 goto check_dup_generic
;
3710 case OMP_CLAUSE_PRIVATE
:
3712 goto check_dup_generic
;
3713 case OMP_CLAUSE_REDUCTION
:
3715 goto check_dup_generic
;
3716 case OMP_CLAUSE_COPYPRIVATE
:
3717 name
= "copyprivate";
3718 goto check_dup_generic
;
3719 case OMP_CLAUSE_COPYIN
:
3721 goto check_dup_generic
;
3723 t
= OMP_CLAUSE_DECL (c
);
3724 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3726 if (processing_template_decl
)
3729 error ("%qD is not a variable in clause %qs", t
, name
);
3731 error ("%qE is not a variable in clause %qs", t
, name
);
3734 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3735 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
3736 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
3738 error ("%qD appears more than once in data clauses", t
);
3742 bitmap_set_bit (&generic_head
, DECL_UID (t
));
3745 case OMP_CLAUSE_FIRSTPRIVATE
:
3746 t
= OMP_CLAUSE_DECL (c
);
3747 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3749 if (processing_template_decl
)
3752 error ("%qD is not a variable in clause %<firstprivate%>", t
);
3754 error ("%qE is not a variable in clause %<firstprivate%>", t
);
3757 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3758 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
3760 error ("%qD appears more than once in data clauses", t
);
3764 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
3767 case OMP_CLAUSE_LASTPRIVATE
:
3768 t
= OMP_CLAUSE_DECL (c
);
3769 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3771 if (processing_template_decl
)
3774 error ("%qD is not a variable in clause %<lastprivate%>", t
);
3776 error ("%qE is not a variable in clause %<lastprivate%>", t
);
3779 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3780 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
3782 error ("%qD appears more than once in data clauses", t
);
3786 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
3790 t
= OMP_CLAUSE_IF_EXPR (c
);
3791 t
= maybe_convert_cond (t
);
3792 if (t
== error_mark_node
)
3794 OMP_CLAUSE_IF_EXPR (c
) = t
;
3797 case OMP_CLAUSE_NUM_THREADS
:
3798 t
= OMP_CLAUSE_NUM_THREADS_EXPR (c
);
3799 if (t
== error_mark_node
)
3801 else if (!type_dependent_expression_p (t
)
3802 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
3804 error ("num_threads expression must be integral");
3809 case OMP_CLAUSE_SCHEDULE
:
3810 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
3813 else if (t
== error_mark_node
)
3815 else if (!type_dependent_expression_p (t
)
3816 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
3818 error ("schedule chunk size expression must be integral");
3823 case OMP_CLAUSE_NOWAIT
:
3824 case OMP_CLAUSE_ORDERED
:
3825 case OMP_CLAUSE_DEFAULT
:
3826 case OMP_CLAUSE_UNTIED
:
3827 case OMP_CLAUSE_COLLAPSE
:
3835 *pc
= OMP_CLAUSE_CHAIN (c
);
3837 pc
= &OMP_CLAUSE_CHAIN (c
);
3840 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3842 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
3843 bool remove
= false;
3844 bool need_complete_non_reference
= false;
3845 bool need_default_ctor
= false;
3846 bool need_copy_ctor
= false;
3847 bool need_copy_assignment
= false;
3848 bool need_implicitly_determined
= false;
3849 tree type
, inner_type
;
3853 case OMP_CLAUSE_SHARED
:
3855 need_implicitly_determined
= true;
3857 case OMP_CLAUSE_PRIVATE
:
3859 need_complete_non_reference
= true;
3860 need_default_ctor
= true;
3861 need_implicitly_determined
= true;
3863 case OMP_CLAUSE_FIRSTPRIVATE
:
3864 name
= "firstprivate";
3865 need_complete_non_reference
= true;
3866 need_copy_ctor
= true;
3867 need_implicitly_determined
= true;
3869 case OMP_CLAUSE_LASTPRIVATE
:
3870 name
= "lastprivate";
3871 need_complete_non_reference
= true;
3872 need_copy_assignment
= true;
3873 need_implicitly_determined
= true;
3875 case OMP_CLAUSE_REDUCTION
:
3877 need_implicitly_determined
= true;
3879 case OMP_CLAUSE_COPYPRIVATE
:
3880 name
= "copyprivate";
3881 need_copy_assignment
= true;
3883 case OMP_CLAUSE_COPYIN
:
3885 need_copy_assignment
= true;
3888 pc
= &OMP_CLAUSE_CHAIN (c
);
3892 t
= OMP_CLAUSE_DECL (c
);
3893 if (processing_template_decl
3894 && TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3896 pc
= &OMP_CLAUSE_CHAIN (c
);
3902 case OMP_CLAUSE_LASTPRIVATE
:
3903 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
3904 need_default_ctor
= true;
3907 case OMP_CLAUSE_REDUCTION
:
3908 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
3909 || POINTER_TYPE_P (TREE_TYPE (t
)))
3911 error ("%qE has invalid type for %<reduction%>", t
);
3914 else if (FLOAT_TYPE_P (TREE_TYPE (t
)))
3916 enum tree_code r_code
= OMP_CLAUSE_REDUCTION_CODE (c
);
3924 error ("%qE has invalid type for %<reduction(%s)%>",
3925 t
, operator_name_info
[r_code
].name
);
3931 case OMP_CLAUSE_COPYIN
:
3932 if (TREE_CODE (t
) != VAR_DECL
|| !DECL_THREAD_LOCAL_P (t
))
3934 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
3943 if (need_complete_non_reference
)
3945 t
= require_complete_type (t
);
3946 if (t
== error_mark_node
)
3948 else if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
3950 error ("%qE has reference type for %qs", t
, name
);
3954 if (need_implicitly_determined
)
3956 const char *share_name
= NULL
;
3958 if (TREE_CODE (t
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (t
))
3959 share_name
= "threadprivate";
3960 else switch (cxx_omp_predetermined_sharing (t
))
3962 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
3964 case OMP_CLAUSE_DEFAULT_SHARED
:
3965 share_name
= "shared";
3967 case OMP_CLAUSE_DEFAULT_PRIVATE
:
3968 share_name
= "private";
3975 error ("%qE is predetermined %qs for %qs",
3976 t
, share_name
, name
);
3981 /* We're interested in the base element, not arrays. */
3982 inner_type
= type
= TREE_TYPE (t
);
3983 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
3984 inner_type
= TREE_TYPE (inner_type
);
3986 /* Check for special function availability by building a call to one.
3987 Save the results, because later we won't be in the right context
3988 for making these queries. */
3989 if (CLASS_TYPE_P (inner_type
)
3990 && (need_default_ctor
|| need_copy_ctor
|| need_copy_assignment
)
3991 && !type_dependent_expression_p (t
)
3992 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
3993 need_copy_ctor
, need_copy_assignment
))
3997 *pc
= OMP_CLAUSE_CHAIN (c
);
3999 pc
= &OMP_CLAUSE_CHAIN (c
);
4002 bitmap_obstack_release (NULL
);
4006 /* For all variables in the tree_list VARS, mark them as thread local. */
4009 finish_omp_threadprivate (tree vars
)
4013 /* Mark every variable in VARS to be assigned thread local storage. */
4014 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
4016 tree v
= TREE_PURPOSE (t
);
4018 if (error_operand_p (v
))
4020 else if (TREE_CODE (v
) != VAR_DECL
)
4021 error ("%<threadprivate%> %qD is not file, namespace "
4022 "or block scope variable", v
);
4023 /* If V had already been marked threadprivate, it doesn't matter
4024 whether it had been used prior to this point. */
4025 else if (TREE_USED (v
)
4026 && (DECL_LANG_SPECIFIC (v
) == NULL
4027 || !CP_DECL_THREADPRIVATE_P (v
)))
4028 error ("%qE declared %<threadprivate%> after first use", v
);
4029 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
4030 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
4031 else if (! COMPLETE_TYPE_P (TREE_TYPE (v
)))
4032 error ("%<threadprivate%> %qE has incomplete type", v
);
4033 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
4034 && CP_DECL_CONTEXT (v
) != current_class_type
)
4035 error ("%<threadprivate%> %qE directive not "
4036 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
4039 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4040 if (DECL_LANG_SPECIFIC (v
) == NULL
)
4042 retrofit_lang_decl (v
);
4044 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4045 after the allocation of the lang_decl structure. */
4046 if (DECL_DISCRIMINATOR_P (v
))
4047 DECL_LANG_SPECIFIC (v
)->u
.base
.u2sel
= 1;
4050 if (! DECL_THREAD_LOCAL_P (v
))
4052 DECL_TLS_MODEL (v
) = decl_default_tls_model (v
);
4053 /* If rtl has been already set for this var, call
4054 make_decl_rtl once again, so that encode_section_info
4055 has a chance to look at the new decl flags. */
4056 if (DECL_RTL_SET_P (v
))
4059 CP_DECL_THREADPRIVATE_P (v
) = 1;
4064 /* Build an OpenMP structured block. */
4067 begin_omp_structured_block (void)
4069 return do_pushlevel (sk_omp
);
4073 finish_omp_structured_block (tree block
)
4075 return do_poplevel (block
);
4078 /* Similarly, except force the retention of the BLOCK. */
4081 begin_omp_parallel (void)
4083 keep_next_level (true);
4084 return begin_omp_structured_block ();
4088 finish_omp_parallel (tree clauses
, tree body
)
4092 body
= finish_omp_structured_block (body
);
4094 stmt
= make_node (OMP_PARALLEL
);
4095 TREE_TYPE (stmt
) = void_type_node
;
4096 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
4097 OMP_PARALLEL_BODY (stmt
) = body
;
4099 return add_stmt (stmt
);
4103 begin_omp_task (void)
4105 keep_next_level (true);
4106 return begin_omp_structured_block ();
4110 finish_omp_task (tree clauses
, tree body
)
4114 body
= finish_omp_structured_block (body
);
4116 stmt
= make_node (OMP_TASK
);
4117 TREE_TYPE (stmt
) = void_type_node
;
4118 OMP_TASK_CLAUSES (stmt
) = clauses
;
4119 OMP_TASK_BODY (stmt
) = body
;
4121 return add_stmt (stmt
);
4124 /* Helper function for finish_omp_for. Convert Ith random access iterator
4125 into integral iterator. Return FALSE if successful. */
4128 handle_omp_for_class_iterator (int i
, location_t locus
, tree declv
, tree initv
,
4129 tree condv
, tree incrv
, tree
*body
,
4130 tree
*pre_body
, tree clauses
)
4132 tree diff
, iter_init
, iter_incr
= NULL
, last
;
4133 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
4134 tree decl
= TREE_VEC_ELT (declv
, i
);
4135 tree init
= TREE_VEC_ELT (initv
, i
);
4136 tree cond
= TREE_VEC_ELT (condv
, i
);
4137 tree incr
= TREE_VEC_ELT (incrv
, i
);
4139 location_t elocus
= locus
;
4141 if (init
&& EXPR_HAS_LOCATION (init
))
4142 elocus
= EXPR_LOCATION (init
);
4144 switch (TREE_CODE (cond
))
4150 if (TREE_OPERAND (cond
, 1) == iter
)
4151 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
4152 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
4153 if (TREE_OPERAND (cond
, 0) != iter
)
4154 cond
= error_mark_node
;
4157 tree tem
= build_x_binary_op (TREE_CODE (cond
), iter
, ERROR_MARK
,
4158 TREE_OPERAND (cond
, 1), ERROR_MARK
,
4159 NULL
, tf_warning_or_error
);
4160 if (error_operand_p (tem
))
4165 cond
= error_mark_node
;
4168 if (cond
== error_mark_node
)
4170 error_at (elocus
, "invalid controlling predicate");
4173 diff
= build_x_binary_op (MINUS_EXPR
, TREE_OPERAND (cond
, 1),
4174 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
4175 tf_warning_or_error
);
4176 if (error_operand_p (diff
))
4178 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
4180 error_at (elocus
, "difference between %qE and %qD does not have integer type",
4181 TREE_OPERAND (cond
, 1), iter
);
4185 switch (TREE_CODE (incr
))
4187 case PREINCREMENT_EXPR
:
4188 case PREDECREMENT_EXPR
:
4189 case POSTINCREMENT_EXPR
:
4190 case POSTDECREMENT_EXPR
:
4191 if (TREE_OPERAND (incr
, 0) != iter
)
4193 incr
= error_mark_node
;
4196 iter_incr
= build_x_unary_op (TREE_CODE (incr
), iter
,
4197 tf_warning_or_error
);
4198 if (error_operand_p (iter_incr
))
4200 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
4201 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
4202 incr
= integer_one_node
;
4204 incr
= integer_minus_one_node
;
4207 if (TREE_OPERAND (incr
, 0) != iter
)
4208 incr
= error_mark_node
;
4209 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
4210 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
4212 tree rhs
= TREE_OPERAND (incr
, 1);
4213 if (TREE_OPERAND (rhs
, 0) == iter
)
4215 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
4217 incr
= error_mark_node
;
4220 iter_incr
= build_x_modify_expr (iter
, TREE_CODE (rhs
),
4221 TREE_OPERAND (rhs
, 1),
4222 tf_warning_or_error
);
4223 if (error_operand_p (iter_incr
))
4225 incr
= TREE_OPERAND (rhs
, 1);
4226 incr
= cp_convert (TREE_TYPE (diff
), incr
);
4227 if (TREE_CODE (rhs
) == MINUS_EXPR
)
4229 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
4230 incr
= fold_if_not_in_template (incr
);
4232 if (TREE_CODE (incr
) != INTEGER_CST
4233 && (TREE_CODE (incr
) != NOP_EXPR
4234 || (TREE_CODE (TREE_OPERAND (incr
, 0))
4239 else if (TREE_OPERAND (rhs
, 1) == iter
)
4241 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
4242 || TREE_CODE (rhs
) != PLUS_EXPR
)
4243 incr
= error_mark_node
;
4246 iter_incr
= build_x_binary_op (PLUS_EXPR
,
4247 TREE_OPERAND (rhs
, 0),
4250 tf_warning_or_error
);
4251 if (error_operand_p (iter_incr
))
4253 iter_incr
= build_x_modify_expr (iter
, NOP_EXPR
,
4255 tf_warning_or_error
);
4256 if (error_operand_p (iter_incr
))
4258 incr
= TREE_OPERAND (rhs
, 0);
4263 incr
= error_mark_node
;
4266 incr
= error_mark_node
;
4269 incr
= error_mark_node
;
4273 if (incr
== error_mark_node
)
4275 error_at (elocus
, "invalid increment expression");
4279 incr
= cp_convert (TREE_TYPE (diff
), incr
);
4280 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
4281 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
4282 && OMP_CLAUSE_DECL (c
) == iter
)
4285 decl
= create_temporary_var (TREE_TYPE (diff
));
4287 add_decl_expr (decl
);
4288 last
= create_temporary_var (TREE_TYPE (diff
));
4290 add_decl_expr (last
);
4291 if (c
&& iter_incr
== NULL
)
4293 incr_var
= create_temporary_var (TREE_TYPE (diff
));
4294 pushdecl (incr_var
);
4295 add_decl_expr (incr_var
);
4297 gcc_assert (stmts_are_full_exprs_p ());
4299 orig_pre_body
= *pre_body
;
4300 *pre_body
= push_stmt_list ();
4302 add_stmt (orig_pre_body
);
4304 finish_expr_stmt (build_x_modify_expr (iter
, NOP_EXPR
, init
,
4305 tf_warning_or_error
));
4306 init
= build_int_cst (TREE_TYPE (diff
), 0);
4307 if (c
&& iter_incr
== NULL
)
4309 finish_expr_stmt (build_x_modify_expr (incr_var
, NOP_EXPR
,
4310 incr
, tf_warning_or_error
));
4312 iter_incr
= build_x_modify_expr (iter
, PLUS_EXPR
, incr
,
4313 tf_warning_or_error
);
4315 finish_expr_stmt (build_x_modify_expr (last
, NOP_EXPR
, init
,
4316 tf_warning_or_error
));
4317 *pre_body
= pop_stmt_list (*pre_body
);
4319 cond
= cp_build_binary_op (elocus
,
4320 TREE_CODE (cond
), decl
, diff
,
4321 tf_warning_or_error
);
4322 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
4323 elocus
, incr
, NULL_TREE
);
4326 *body
= push_stmt_list ();
4327 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
4328 iter_init
= build_x_modify_expr (iter
, PLUS_EXPR
, iter_init
,
4329 tf_warning_or_error
);
4330 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
4331 finish_expr_stmt (iter_init
);
4332 finish_expr_stmt (build_x_modify_expr (last
, NOP_EXPR
, decl
,
4333 tf_warning_or_error
));
4334 add_stmt (orig_body
);
4335 *body
= pop_stmt_list (*body
);
4339 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
4340 finish_expr_stmt (iter_incr
);
4341 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
4342 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
4345 TREE_VEC_ELT (declv
, i
) = decl
;
4346 TREE_VEC_ELT (initv
, i
) = init
;
4347 TREE_VEC_ELT (condv
, i
) = cond
;
4348 TREE_VEC_ELT (incrv
, i
) = incr
;
4353 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4354 are directly for their associated operands in the statement. DECL
4355 and INIT are a combo; if DECL is NULL then INIT ought to be a
4356 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4357 optional statements that need to go before the loop into its
4361 finish_omp_for (location_t locus
, tree declv
, tree initv
, tree condv
,
4362 tree incrv
, tree body
, tree pre_body
, tree clauses
)
4364 tree omp_for
= NULL
, orig_incr
= NULL
;
4365 tree decl
, init
, cond
, incr
;
4369 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
4370 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
4371 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
4372 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4374 decl
= TREE_VEC_ELT (declv
, i
);
4375 init
= TREE_VEC_ELT (initv
, i
);
4376 cond
= TREE_VEC_ELT (condv
, i
);
4377 incr
= TREE_VEC_ELT (incrv
, i
);
4383 switch (TREE_CODE (init
))
4386 decl
= TREE_OPERAND (init
, 0);
4387 init
= TREE_OPERAND (init
, 1);
4390 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
4392 decl
= TREE_OPERAND (init
, 0);
4393 init
= TREE_OPERAND (init
, 2);
4403 "expected iteration declaration or initialization");
4408 if (init
&& EXPR_HAS_LOCATION (init
))
4409 elocus
= EXPR_LOCATION (init
);
4413 error_at (elocus
, "missing controlling predicate");
4419 error_at (elocus
, "missing increment expression");
4423 TREE_VEC_ELT (declv
, i
) = decl
;
4424 TREE_VEC_ELT (initv
, i
) = init
;
4427 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
4431 stmt
= make_node (OMP_FOR
);
4433 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4435 /* This is really just a place-holder. We'll be decomposing this
4436 again and going through the cp_build_modify_expr path below when
4437 we instantiate the thing. */
4438 TREE_VEC_ELT (initv
, i
)
4439 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
4440 TREE_VEC_ELT (initv
, i
));
4443 TREE_TYPE (stmt
) = void_type_node
;
4444 OMP_FOR_INIT (stmt
) = initv
;
4445 OMP_FOR_COND (stmt
) = condv
;
4446 OMP_FOR_INCR (stmt
) = incrv
;
4447 OMP_FOR_BODY (stmt
) = body
;
4448 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
4449 OMP_FOR_CLAUSES (stmt
) = clauses
;
4451 SET_EXPR_LOCATION (stmt
, locus
);
4452 return add_stmt (stmt
);
4455 if (processing_template_decl
)
4456 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
4458 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
4460 decl
= TREE_VEC_ELT (declv
, i
);
4461 init
= TREE_VEC_ELT (initv
, i
);
4462 cond
= TREE_VEC_ELT (condv
, i
);
4463 incr
= TREE_VEC_ELT (incrv
, i
);
4465 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4468 if (init
&& EXPR_HAS_LOCATION (init
))
4469 elocus
= EXPR_LOCATION (init
);
4473 error_at (elocus
, "expected iteration declaration or initialization");
4477 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
4480 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4481 incr
= cp_build_modify_expr (TREE_OPERAND (incr
, 0),
4482 TREE_CODE (TREE_OPERAND (incr
, 1)),
4483 TREE_OPERAND (incr
, 2),
4484 tf_warning_or_error
);
4487 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
4489 if (handle_omp_for_class_iterator (i
, locus
, declv
, initv
, condv
,
4490 incrv
, &body
, &pre_body
, clauses
))
4495 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
4496 && TREE_CODE (TREE_TYPE (decl
)) != POINTER_TYPE
)
4498 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
4502 if (!processing_template_decl
)
4504 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
4505 init
= cp_build_modify_expr (decl
, NOP_EXPR
, init
, tf_warning_or_error
);
4508 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
4510 && TREE_SIDE_EFFECTS (cond
)
4511 && COMPARISON_CLASS_P (cond
)
4512 && !processing_template_decl
)
4514 tree t
= TREE_OPERAND (cond
, 0);
4515 if (TREE_SIDE_EFFECTS (t
)
4517 && (TREE_CODE (t
) != NOP_EXPR
4518 || TREE_OPERAND (t
, 0) != decl
))
4519 TREE_OPERAND (cond
, 0)
4520 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4522 t
= TREE_OPERAND (cond
, 1);
4523 if (TREE_SIDE_EFFECTS (t
)
4525 && (TREE_CODE (t
) != NOP_EXPR
4526 || TREE_OPERAND (t
, 0) != decl
))
4527 TREE_OPERAND (cond
, 1)
4528 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4530 if (decl
== error_mark_node
|| init
== error_mark_node
)
4533 TREE_VEC_ELT (declv
, i
) = decl
;
4534 TREE_VEC_ELT (initv
, i
) = init
;
4535 TREE_VEC_ELT (condv
, i
) = cond
;
4536 TREE_VEC_ELT (incrv
, i
) = incr
;
4540 if (IS_EMPTY_STMT (pre_body
))
4543 omp_for
= c_finish_omp_for (locus
, declv
, initv
, condv
, incrv
,
4546 if (omp_for
== NULL
)
4549 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
4551 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
4552 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
4554 if (TREE_CODE (incr
) != MODIFY_EXPR
)
4557 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
4558 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
4559 && !processing_template_decl
)
4561 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
4562 if (TREE_SIDE_EFFECTS (t
)
4564 && (TREE_CODE (t
) != NOP_EXPR
4565 || TREE_OPERAND (t
, 0) != decl
))
4566 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
4567 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4569 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
4570 if (TREE_SIDE_EFFECTS (t
)
4572 && (TREE_CODE (t
) != NOP_EXPR
4573 || TREE_OPERAND (t
, 0) != decl
))
4574 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
4575 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4579 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
4581 if (omp_for
!= NULL
)
4582 OMP_FOR_CLAUSES (omp_for
) = clauses
;
4587 finish_omp_atomic (enum tree_code code
, tree lhs
, tree rhs
)
4596 dependent_p
= false;
4599 /* Even in a template, we can detect invalid uses of the atomic
4600 pragma if neither LHS nor RHS is type-dependent. */
4601 if (processing_template_decl
)
4603 dependent_p
= (type_dependent_expression_p (lhs
)
4604 || type_dependent_expression_p (rhs
));
4607 lhs
= build_non_dependent_expr (lhs
);
4608 rhs
= build_non_dependent_expr (rhs
);
4613 stmt
= c_finish_omp_atomic (input_location
, code
, lhs
, rhs
);
4614 if (stmt
== error_mark_node
)
4617 if (processing_template_decl
)
4618 stmt
= build2 (OMP_ATOMIC
, void_type_node
, integer_zero_node
,
4619 build2 (code
, void_type_node
, orig_lhs
, orig_rhs
));
4624 finish_omp_barrier (void)
4626 tree fn
= built_in_decls
[BUILT_IN_GOMP_BARRIER
];
4627 VEC(tree
,gc
) *vec
= make_tree_vector ();
4628 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4629 release_tree_vector (vec
);
4630 finish_expr_stmt (stmt
);
4634 finish_omp_flush (void)
4636 tree fn
= built_in_decls
[BUILT_IN_SYNCHRONIZE
];
4637 VEC(tree
,gc
) *vec
= make_tree_vector ();
4638 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4639 release_tree_vector (vec
);
4640 finish_expr_stmt (stmt
);
4644 finish_omp_taskwait (void)
4646 tree fn
= built_in_decls
[BUILT_IN_GOMP_TASKWAIT
];
4647 VEC(tree
,gc
) *vec
= make_tree_vector ();
4648 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4649 release_tree_vector (vec
);
4650 finish_expr_stmt (stmt
);
4654 init_cp_semantics (void)
4658 /* Build a STATIC_ASSERT for a static assertion with the condition
4659 CONDITION and the message text MESSAGE. LOCATION is the location
4660 of the static assertion in the source code. When MEMBER_P, this
4661 static assertion is a member of a class. */
4663 finish_static_assert (tree condition
, tree message
, location_t location
,
4666 if (check_for_bare_parameter_packs (condition
))
4667 condition
= error_mark_node
;
4669 if (type_dependent_expression_p (condition
)
4670 || value_dependent_expression_p (condition
))
4672 /* We're in a template; build a STATIC_ASSERT and put it in
4676 assertion
= make_node (STATIC_ASSERT
);
4677 STATIC_ASSERT_CONDITION (assertion
) = condition
;
4678 STATIC_ASSERT_MESSAGE (assertion
) = message
;
4679 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
4682 maybe_add_class_template_decl_list (current_class_type
,
4686 add_stmt (assertion
);
4691 /* Fold the expression and convert it to a boolean value. */
4692 condition
= fold_non_dependent_expr (condition
);
4693 condition
= cp_convert (boolean_type_node
, condition
);
4695 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
4696 /* Do nothing; the condition is satisfied. */
4700 location_t saved_loc
= input_location
;
4702 input_location
= location
;
4703 if (TREE_CODE (condition
) == INTEGER_CST
4704 && integer_zerop (condition
))
4705 /* Report the error. */
4706 error ("static assertion failed: %E", message
);
4707 else if (condition
&& condition
!= error_mark_node
)
4708 error ("non-constant condition for static assertion");
4709 input_location
= saved_loc
;
4713 /* Returns the type of EXPR for cases where we can determine it even though
4714 EXPR is a type-dependent expression. */
4717 describable_type (tree expr
)
4719 tree type
= NULL_TREE
;
4721 if (! type_dependent_expression_p (expr
)
4722 && ! type_unknown_p (expr
))
4724 type
= unlowered_expr_type (expr
);
4725 if (real_lvalue_p (expr
))
4726 type
= build_reference_type (type
);
4732 switch (TREE_CODE (expr
))
4738 return TREE_TYPE (expr
);
4743 case TEMPLATE_PARM_INDEX
:
4745 case STATIC_CAST_EXPR
:
4746 case REINTERPRET_CAST_EXPR
:
4747 case CONST_CAST_EXPR
:
4748 case DYNAMIC_CAST_EXPR
:
4749 type
= TREE_TYPE (expr
);
4754 tree ptrtype
= describable_type (TREE_OPERAND (expr
, 0));
4755 if (ptrtype
&& POINTER_TYPE_P (ptrtype
))
4756 type
= build_reference_type (TREE_TYPE (ptrtype
));
4761 if (TREE_CODE_CLASS (TREE_CODE (expr
)) == tcc_constant
)
4762 type
= TREE_TYPE (expr
);
4766 if (type
&& type_uses_auto (type
))
4772 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4773 suitable for use as a type-specifier.
4775 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4776 id-expression or a class member access, FALSE when it was parsed as
4777 a full expression. */
4780 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
)
4782 tree orig_expr
= expr
;
4783 tree type
= NULL_TREE
;
4785 if (!expr
|| error_operand_p (expr
))
4786 return error_mark_node
;
4789 || TREE_CODE (expr
) == TYPE_DECL
4790 || (TREE_CODE (expr
) == BIT_NOT_EXPR
4791 && TYPE_P (TREE_OPERAND (expr
, 0))))
4793 error ("argument to decltype must be an expression");
4794 return error_mark_node
;
4797 if (type_dependent_expression_p (expr
)
4798 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
4799 if it isn't dependent, so that we can check access control at
4800 instantiation time, so defer the decltype as well (PR 42277). */
4801 || (id_expression_or_member_access_p
4802 && processing_template_decl
4803 && TREE_CODE (expr
) == COMPONENT_REF
))
4805 if (id_expression_or_member_access_p
)
4807 switch (TREE_CODE (expr
))
4814 case TEMPLATE_PARM_INDEX
:
4815 type
= TREE_TYPE (expr
);
4823 if (type
&& !type_uses_auto (type
))
4827 type
= cxx_make_type (DECLTYPE_TYPE
);
4828 DECLTYPE_TYPE_EXPR (type
) = expr
;
4829 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
4830 = id_expression_or_member_access_p
;
4831 SET_TYPE_STRUCTURAL_EQUALITY (type
);
4836 /* The type denoted by decltype(e) is defined as follows: */
4838 expr
= resolve_nondeduced_context (expr
);
4840 /* To get the size of a static data member declared as an array of
4841 unknown bound, we need to instantiate it. */
4842 if (TREE_CODE (expr
) == VAR_DECL
4843 && VAR_HAD_UNKNOWN_BOUND (expr
)
4844 && DECL_TEMPLATE_INSTANTIATION (expr
))
4845 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
4847 if (id_expression_or_member_access_p
)
4849 /* If e is an id-expression or a class member access (5.2.5
4850 [expr.ref]), decltype(e) is defined as the type of the entity
4851 named by e. If there is no such entity, or e names a set of
4852 overloaded functions, the program is ill-formed. */
4853 if (TREE_CODE (expr
) == IDENTIFIER_NODE
)
4854 expr
= lookup_name (expr
);
4856 if (TREE_CODE (expr
) == INDIRECT_REF
)
4857 /* This can happen when the expression is, e.g., "a.b". Just
4858 look at the underlying operand. */
4859 expr
= TREE_OPERAND (expr
, 0);
4861 if (TREE_CODE (expr
) == OFFSET_REF
4862 || TREE_CODE (expr
) == MEMBER_REF
)
4863 /* We're only interested in the field itself. If it is a
4864 BASELINK, we will need to see through it in the next
4866 expr
= TREE_OPERAND (expr
, 1);
4868 if (TREE_CODE (expr
) == BASELINK
)
4869 /* See through BASELINK nodes to the underlying functions. */
4870 expr
= BASELINK_FUNCTIONS (expr
);
4872 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
4873 expr
= TREE_OPERAND (expr
, 0);
4875 if (TREE_CODE (expr
) == OVERLOAD
)
4877 if (OVL_CHAIN (expr
)
4878 || TREE_CODE (OVL_FUNCTION (expr
)) == TEMPLATE_DECL
)
4880 error ("%qE refers to a set of overloaded functions", orig_expr
);
4881 return error_mark_node
;
4884 /* An overload set containing only one function: just look
4885 at that function. */
4886 expr
= OVL_FUNCTION (expr
);
4889 switch (TREE_CODE (expr
))
4892 if (DECL_BIT_FIELD_TYPE (expr
))
4894 type
= DECL_BIT_FIELD_TYPE (expr
);
4897 /* Fall through for fields that aren't bitfields. */
4904 case TEMPLATE_PARM_INDEX
:
4905 type
= TREE_TYPE (expr
);
4909 type
= error_mark_node
;
4913 type
= is_bitfield_expr_with_lowered_type (expr
);
4915 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
4922 /* We can get here when the id-expression refers to an
4924 type
= TREE_TYPE (expr
);
4928 gcc_assert (TYPE_P (expr
) || DECL_P (expr
)
4929 || TREE_CODE (expr
) == SCOPE_REF
);
4930 error ("argument to decltype must be an expression");
4931 return error_mark_node
;
4936 /* Expressions of reference type are sometimes wrapped in
4937 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4938 representation, not part of the language, so we have to look
4940 if (TREE_CODE (expr
) == INDIRECT_REF
4941 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0)))
4943 expr
= TREE_OPERAND (expr
, 0);
4945 if (TREE_CODE (expr
) == CALL_EXPR
)
4947 /* If e is a function call (5.2.2 [expr.call]) or an
4948 invocation of an overloaded operator (parentheses around e
4949 are ignored), decltype(e) is defined as the return type of
4951 tree fndecl
= get_callee_fndecl (expr
);
4952 if (fndecl
&& fndecl
!= error_mark_node
)
4953 type
= TREE_TYPE (TREE_TYPE (fndecl
));
4956 tree target_type
= TREE_TYPE (CALL_EXPR_FN (expr
));
4957 if ((TREE_CODE (target_type
) == REFERENCE_TYPE
4958 || TREE_CODE (target_type
) == POINTER_TYPE
)
4959 && (TREE_CODE (TREE_TYPE (target_type
)) == FUNCTION_TYPE
4960 || TREE_CODE (TREE_TYPE (target_type
)) == METHOD_TYPE
))
4961 type
= TREE_TYPE (TREE_TYPE (target_type
));
4962 else if (processing_template_decl
)
4963 /* Within a template finish_call_expr doesn't resolve
4964 CALL_EXPR_FN, so even though this decltype isn't really
4965 dependent let's defer resolving it. */
4966 goto treat_as_dependent
;
4968 sorry ("unable to determine the declared type of expression %<%E%>",
4974 type
= is_bitfield_expr_with_lowered_type (expr
);
4977 /* Bitfields are special, because their type encodes the
4978 number of bits they store. If the expression referenced a
4979 bitfield, TYPE now has the declared type of that
4981 type
= cp_build_qualified_type (type
,
4982 cp_type_quals (TREE_TYPE (expr
)));
4984 if (real_lvalue_p (expr
))
4985 type
= build_reference_type (type
);
4987 /* Within a lambda-expression:
4989 Every occurrence of decltype((x)) where x is a possibly
4990 parenthesized id-expression that names an entity of
4991 automatic storage duration is treated as if x were
4992 transformed into an access to a corresponding data member
4993 of the closure type that would have been declared if x
4994 were a use of the denoted entity. */
4995 else if (outer_automatic_var_p (expr
)
4996 && current_function_decl
4997 && LAMBDA_FUNCTION_P (current_function_decl
))
4998 type
= capture_decltype (expr
);
5001 /* Otherwise, where T is the type of e, if e is an lvalue,
5002 decltype(e) is defined as T&, otherwise decltype(e) is
5004 type
= TREE_TYPE (expr
);
5005 if (type
== error_mark_node
)
5006 return error_mark_node
;
5007 else if (expr
== current_class_ptr
)
5008 /* If the expression is just "this", we want the
5009 cv-unqualified pointer for the "this" type. */
5010 type
= TYPE_MAIN_VARIANT (type
);
5011 else if (real_lvalue_p (expr
))
5013 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5014 type
= build_reference_type (type
);
5017 type
= non_reference (type
);
5022 if (!type
|| type
== unknown_type_node
)
5024 error ("type of %qE is unknown", expr
);
5025 return error_mark_node
;
5031 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
5032 __has_nothrow_copy, depending on assign_p. */
5035 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
5042 ix
= lookup_fnfields_1 (type
, ansi_assopname (NOP_EXPR
));
5045 fns
= VEC_index (tree
, CLASSTYPE_METHOD_VEC (type
), ix
);
5047 else if (TYPE_HAS_INIT_REF (type
))
5049 /* If construction of the copy constructor was postponed, create
5051 if (CLASSTYPE_LAZY_COPY_CTOR (type
))
5052 lazily_declare_fn (sfk_copy_constructor
, type
);
5053 if (CLASSTYPE_LAZY_MOVE_CTOR (type
))
5054 lazily_declare_fn (sfk_move_constructor
, type
);
5055 fns
= CLASSTYPE_CONSTRUCTORS (type
);
5060 for (; fns
; fns
= OVL_NEXT (fns
))
5062 tree fn
= OVL_CURRENT (fns
);
5066 if (copy_fn_p (fn
) == 0)
5069 else if (copy_fn_p (fn
) <= 0)
5072 if (!TYPE_NOTHROW_P (TREE_TYPE (fn
)))
5079 /* Actually evaluates the trait. */
5082 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
5084 enum tree_code type_code1
;
5087 type_code1
= TREE_CODE (type1
);
5091 case CPTK_HAS_NOTHROW_ASSIGN
:
5092 type1
= strip_array_types (type1
);
5093 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5094 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
5095 || (CLASS_TYPE_P (type1
)
5096 && classtype_has_nothrow_assign_or_copy_p (type1
,
5099 case CPTK_HAS_TRIVIAL_ASSIGN
:
5100 /* ??? The standard seems to be missing the "or array of such a class
5101 type" wording for this trait. */
5102 type1
= strip_array_types (type1
);
5103 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5104 && (trivial_type_p (type1
)
5105 || (CLASS_TYPE_P (type1
)
5106 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1
))));
5108 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5109 type1
= strip_array_types (type1
);
5110 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
5111 || (CLASS_TYPE_P (type1
)
5112 && (t
= locate_ctor (type1
, NULL
))
5113 && TYPE_NOTHROW_P (TREE_TYPE (t
))));
5115 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5116 type1
= strip_array_types (type1
);
5117 return (trivial_type_p (type1
)
5118 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
5120 case CPTK_HAS_NOTHROW_COPY
:
5121 type1
= strip_array_types (type1
);
5122 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
5123 || (CLASS_TYPE_P (type1
)
5124 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
5126 case CPTK_HAS_TRIVIAL_COPY
:
5127 /* ??? The standard seems to be missing the "or array of such a class
5128 type" wording for this trait. */
5129 type1
= strip_array_types (type1
);
5130 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5131 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_INIT_REF (type1
)));
5133 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5134 type1
= strip_array_types (type1
);
5135 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5136 || (CLASS_TYPE_P (type1
)
5137 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
5139 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5140 return (CLASS_TYPE_P (type1
)
5141 && (t
= locate_dtor (type1
, NULL
)) && DECL_VIRTUAL_P (t
));
5143 case CPTK_IS_ABSTRACT
:
5144 return (CLASS_TYPE_P (type1
) && CLASSTYPE_PURE_VIRTUALS (type1
));
5146 case CPTK_IS_BASE_OF
:
5147 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5148 && DERIVED_FROM_P (type1
, type2
));
5151 return (NON_UNION_CLASS_TYPE_P (type1
));
5153 case CPTK_IS_CONVERTIBLE_TO
:
5158 return (NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
));
5161 return (type_code1
== ENUMERAL_TYPE
);
5164 return (pod_type_p (type1
));
5166 case CPTK_IS_POLYMORPHIC
:
5167 return (CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
));
5169 case CPTK_IS_STD_LAYOUT
:
5170 return (std_layout_type_p (type1
));
5172 case CPTK_IS_TRIVIAL
:
5173 return (trivial_type_p (type1
));
5176 return (type_code1
== UNION_TYPE
);
5184 /* Returns true if TYPE is a complete type, an array of unknown bound,
5185 or (possibly cv-qualified) void, returns false otherwise. */
5188 check_trait_type (tree type
)
5190 if (COMPLETE_TYPE_P (type
))
5193 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
5196 if (VOID_TYPE_P (type
))
5202 /* Process a trait expression. */
5205 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
5207 gcc_assert (kind
== CPTK_HAS_NOTHROW_ASSIGN
5208 || kind
== CPTK_HAS_NOTHROW_CONSTRUCTOR
5209 || kind
== CPTK_HAS_NOTHROW_COPY
5210 || kind
== CPTK_HAS_TRIVIAL_ASSIGN
5211 || kind
== CPTK_HAS_TRIVIAL_CONSTRUCTOR
5212 || kind
== CPTK_HAS_TRIVIAL_COPY
5213 || kind
== CPTK_HAS_TRIVIAL_DESTRUCTOR
5214 || kind
== CPTK_HAS_VIRTUAL_DESTRUCTOR
5215 || kind
== CPTK_IS_ABSTRACT
5216 || kind
== CPTK_IS_BASE_OF
5217 || kind
== CPTK_IS_CLASS
5218 || kind
== CPTK_IS_CONVERTIBLE_TO
5219 || kind
== CPTK_IS_EMPTY
5220 || kind
== CPTK_IS_ENUM
5221 || kind
== CPTK_IS_POD
5222 || kind
== CPTK_IS_POLYMORPHIC
5223 || kind
== CPTK_IS_STD_LAYOUT
5224 || kind
== CPTK_IS_TRIVIAL
5225 || kind
== CPTK_IS_UNION
);
5227 if (kind
== CPTK_IS_CONVERTIBLE_TO
)
5229 sorry ("__is_convertible_to");
5230 return error_mark_node
;
5233 if (type1
== error_mark_node
5234 || ((kind
== CPTK_IS_BASE_OF
|| kind
== CPTK_IS_CONVERTIBLE_TO
)
5235 && type2
== error_mark_node
))
5236 return error_mark_node
;
5238 if (processing_template_decl
)
5240 tree trait_expr
= make_node (TRAIT_EXPR
);
5241 TREE_TYPE (trait_expr
) = boolean_type_node
;
5242 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
5243 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
5244 TRAIT_EXPR_KIND (trait_expr
) = kind
;
5248 complete_type (type1
);
5250 complete_type (type2
);
5254 case CPTK_HAS_NOTHROW_ASSIGN
:
5255 case CPTK_HAS_TRIVIAL_ASSIGN
:
5256 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5257 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5258 case CPTK_HAS_NOTHROW_COPY
:
5259 case CPTK_HAS_TRIVIAL_COPY
:
5260 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5261 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5262 case CPTK_IS_ABSTRACT
:
5265 case CPTK_IS_POLYMORPHIC
:
5266 case CPTK_IS_STD_LAYOUT
:
5267 case CPTK_IS_TRIVIAL
:
5268 if (!check_trait_type (type1
))
5270 error ("incomplete type %qT not allowed", type1
);
5271 return error_mark_node
;
5275 case CPTK_IS_BASE_OF
:
5276 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5277 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
5278 && !COMPLETE_TYPE_P (type2
))
5280 error ("incomplete type %qT not allowed", type2
);
5281 return error_mark_node
;
5290 case CPTK_IS_CONVERTIBLE_TO
:
5295 return (trait_expr_value (kind
, type1
, type2
)
5296 ? boolean_true_node
: boolean_false_node
);
5299 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5300 which is ignored for C++. */
5303 set_float_const_decimal64 (void)
5308 clear_float_const_decimal64 (void)
5313 float_const_decimal64_p (void)
5318 /* Return true if T is a literal type. */
5321 literal_type_p (tree t
)
5323 if (SCALAR_TYPE_P (t
))
5325 if (CLASS_TYPE_P (t
))
5326 return CLASSTYPE_LITERAL_P (t
);
5327 if (TREE_CODE (t
) == ARRAY_TYPE
)
5328 return literal_type_p (strip_array_types (t
));
5333 /* If DECL is a variable declared `constexpr', require its type
5334 be literal. Return the DECL if OK, otherwise NULL. */
5337 ensure_literal_type_for_constexpr_object (tree decl
)
5339 tree type
= TREE_TYPE (decl
);
5340 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_DECLARED_CONSTEXPR_P (decl
)
5341 && !processing_template_decl
&& !literal_type_p (type
))
5343 error ("the type %qT of constexpr variable %qD is not literal",
5350 /* Return non-null if FUN certainly designates a valid constexpr function
5351 declaration. Otherwise return NULL. Issue appropriate diagnostics
5352 if necessary. Note that we only check the declaration, not the body
5356 validate_constexpr_fundecl (tree fun
)
5358 tree rettype
= NULL
;
5361 /* Don't bother if FUN is not marked constexpr. */
5362 if (!DECL_DECLARED_CONSTEXPR_P (fun
))
5365 /* For a function template, we have absolutely no guarantee that all
5366 instantiations will be constexpr. */
5367 if (TREE_CODE (fun
) == TEMPLATE_DECL
)
5370 parm
= FUNCTION_FIRST_USER_PARM (fun
);
5371 for (; parm
!= NULL
; parm
= TREE_CHAIN (parm
))
5373 tree type
= TREE_TYPE (parm
);
5374 if (dependent_type_p (type
))
5376 if (!literal_type_p (type
))
5378 error ("parameter %q#D is not of literal type", parm
);
5383 if (DECL_CONSTRUCTOR_P (fun
))
5386 rettype
= TREE_TYPE (TREE_TYPE (fun
));
5387 if (dependent_type_p (rettype
))
5389 if (!literal_type_p (rettype
))
5391 error ("return type %qT of function %qD is not a literal type",
5392 TREE_TYPE (TREE_TYPE (fun
)), fun
);
5399 /* Constructor for a lambda expression. */
5402 build_lambda_expr (void)
5404 tree lambda
= make_node (LAMBDA_EXPR
);
5405 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) = CPLD_NONE
;
5406 LAMBDA_EXPR_CAPTURE_LIST (lambda
) = NULL_TREE
;
5407 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = NULL_TREE
;
5408 LAMBDA_EXPR_RETURN_TYPE (lambda
) = NULL_TREE
;
5409 LAMBDA_EXPR_MUTABLE_P (lambda
) = false;
5413 /* Create the closure object for a LAMBDA_EXPR. */
5416 build_lambda_object (tree lambda_expr
)
5418 /* Build aggregate constructor call.
5419 - cp_parser_braced_list
5420 - cp_parser_functional_cast */
5421 VEC(constructor_elt
,gc
) *elts
= NULL
;
5422 tree node
, expr
, type
;
5423 location_t saved_loc
;
5425 if (processing_template_decl
)
5428 /* Make sure any error messages refer to the lambda-introducer. */
5429 saved_loc
= input_location
;
5430 input_location
= LAMBDA_EXPR_LOCATION (lambda_expr
);
5432 for (node
= LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
);
5434 node
= TREE_CHAIN (node
))
5436 tree field
= TREE_PURPOSE (node
);
5437 tree val
= TREE_VALUE (node
);
5442 /* Mere mortals can't copy arrays with aggregate initialization, so
5443 do some magic to make it work here. */
5444 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
)
5445 val
= build_array_copy (val
);
5446 else if (DECL_NORMAL_CAPTURE_P (field
)
5447 && TREE_CODE (TREE_TYPE (field
)) != REFERENCE_TYPE
)
5449 /* "the entities that are captured by copy are used to
5450 direct-initialize each corresponding non-static data
5451 member of the resulting closure object."
5453 There's normally no way to express direct-initialization
5454 from an element of a CONSTRUCTOR, so we build up a special
5455 TARGET_EXPR to bypass the usual copy-initialization. */
5456 val
= force_rvalue (val
);
5457 if (TREE_CODE (val
) == TARGET_EXPR
)
5458 TARGET_EXPR_DIRECT_INIT_P (val
) = true;
5461 CONSTRUCTOR_APPEND_ELT (elts
, DECL_NAME (field
), val
);
5464 expr
= build_constructor (init_list_type_node
, elts
);
5465 CONSTRUCTOR_IS_DIRECT_INIT (expr
) = 1;
5467 /* N2927: "[The closure] class type is not an aggregate."
5468 But we briefly treat it as an aggregate to make this simpler. */
5469 type
= TREE_TYPE (lambda_expr
);
5470 CLASSTYPE_NON_AGGREGATE (type
) = 0;
5471 expr
= finish_compound_literal (type
, expr
);
5472 CLASSTYPE_NON_AGGREGATE (type
) = 1;
5474 input_location
= saved_loc
;
5478 /* Return an initialized RECORD_TYPE for LAMBDA.
5479 LAMBDA must have its explicit captures already. */
5482 begin_lambda_type (tree lambda
)
5487 /* Unique name. This is just like an unnamed class, but we cannot use
5488 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
5490 name
= make_lambda_name ();
5492 /* Create the new RECORD_TYPE for this lambda. */
5493 type
= xref_tag (/*tag_code=*/record_type
,
5495 /*scope=*/ts_within_enclosing_non_class
,
5496 /*template_header_p=*/false);
5499 /* Designate it as a struct so that we can use aggregate initialization. */
5500 CLASSTYPE_DECLARED_CLASS (type
) = false;
5502 /* Clear base types. */
5503 xref_basetypes (type
, /*bases=*/NULL_TREE
);
5505 /* Start the class. */
5506 type
= begin_class_definition (type
, /*attributes=*/NULL_TREE
);
5508 /* Cross-reference the expression and the type. */
5509 TREE_TYPE (lambda
) = type
;
5510 CLASSTYPE_LAMBDA_EXPR (type
) = lambda
;
5515 /* Returns the type to use for the return type of the operator() of a
5519 lambda_return_type (tree expr
)
5522 if (type_dependent_expression_p (expr
))
5524 type
= cxx_make_type (DECLTYPE_TYPE
);
5525 DECLTYPE_TYPE_EXPR (type
) = expr
;
5526 DECLTYPE_FOR_LAMBDA_RETURN (type
) = true;
5527 SET_TYPE_STRUCTURAL_EQUALITY (type
);
5530 type
= type_decays_to (unlowered_expr_type (expr
));
5534 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
5538 lambda_function (tree lambda
)
5541 if (TREE_CODE (lambda
) == LAMBDA_EXPR
)
5542 type
= TREE_TYPE (lambda
);
5545 gcc_assert (LAMBDA_TYPE_P (type
));
5546 /* Don't let debug_tree cause instantiation. */
5547 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
) && !COMPLETE_TYPE_P (type
))
5549 lambda
= lookup_member (type
, ansi_opname (CALL_EXPR
),
5550 /*protect=*/0, /*want_type=*/false);
5552 lambda
= BASELINK_FUNCTIONS (lambda
);
5556 /* Returns the type to use for the FIELD_DECL corresponding to the
5558 The caller should add REFERENCE_TYPE for capture by reference. */
5561 lambda_capture_field_type (tree expr
)
5564 if (type_dependent_expression_p (expr
))
5566 type
= cxx_make_type (DECLTYPE_TYPE
);
5567 DECLTYPE_TYPE_EXPR (type
) = expr
;
5568 DECLTYPE_FOR_LAMBDA_CAPTURE (type
) = true;
5569 SET_TYPE_STRUCTURAL_EQUALITY (type
);
5572 type
= non_reference (unlowered_expr_type (expr
));
5576 /* Recompute the return type for LAMBDA with body of the form:
5577 { return EXPR ; } */
5580 apply_lambda_return_type (tree lambda
, tree return_type
)
5582 tree fco
= lambda_function (lambda
);
5585 LAMBDA_EXPR_RETURN_TYPE (lambda
) = return_type
;
5587 /* If we got a DECLTYPE_TYPE, don't stick it in the function yet,
5588 it would interfere with instantiating the closure type. */
5589 if (dependent_type_p (return_type
))
5591 if (return_type
== error_mark_node
)
5594 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
5595 TREE_TYPE (METHOD_TYPE) == return-type */
5596 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
5598 result
= DECL_RESULT (fco
);
5599 if (result
== NULL_TREE
)
5602 /* We already have a DECL_RESULT from start_preparsed_function.
5603 Now we need to redo the work it and allocate_struct_function
5604 did to reflect the new type. */
5605 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
5606 TYPE_MAIN_VARIANT (return_type
));
5607 DECL_ARTIFICIAL (result
) = 1;
5608 DECL_IGNORED_P (result
) = 1;
5609 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
5612 DECL_RESULT (fco
) = result
;
5614 if (!processing_template_decl
&& aggregate_value_p (result
, fco
))
5616 #ifdef PCC_STATIC_STRUCT_RETURN
5617 cfun
->returns_pcc_struct
= 1;
5619 cfun
->returns_struct
= 1;
5624 /* DECL is a local variable or parameter from the surrounding scope of a
5625 lambda-expression. Returns the decltype for a use of the capture field
5626 for DECL even if it hasn't been captured yet. */
5629 capture_decltype (tree decl
)
5631 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
5632 /* FIXME do lookup instead of list walk? */
5633 tree cap
= value_member (decl
, LAMBDA_EXPR_CAPTURE_LIST (lam
));
5637 type
= TREE_TYPE (TREE_PURPOSE (cap
));
5639 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
5642 error ("%qD is not captured", decl
);
5643 return error_mark_node
;
5646 type
= TREE_TYPE (decl
);
5647 if (TREE_CODE (type
) == REFERENCE_TYPE
5648 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
5649 type
= TREE_TYPE (type
);
5652 case CPLD_REFERENCE
:
5653 type
= TREE_TYPE (decl
);
5654 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5655 type
= build_reference_type (TREE_TYPE (decl
));
5662 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5664 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
5665 type
= cp_build_qualified_type (type
, (TYPE_QUALS (type
)
5667 type
= build_reference_type (type
);
5672 /* From an ID and INITIALIZER, create a capture (by reference if
5673 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
5677 add_capture (tree lambda
, tree id
, tree initializer
, bool by_reference_p
,
5678 bool explicit_init_p
)
5683 type
= lambda_capture_field_type (initializer
);
5686 type
= build_reference_type (type
);
5687 if (!real_lvalue_p (initializer
))
5688 error ("cannot capture %qE by reference", initializer
);
5691 /* Make member variable. */
5692 member
= build_lang_decl (FIELD_DECL
, id
, type
);
5693 if (!explicit_init_p
)
5694 /* Normal captures are invisible to name lookup but uses are replaced
5695 with references to the capture field; we implement this by only
5696 really making them invisible in unevaluated context; see
5697 qualify_lookup. For now, let's make explicitly initialized captures
5699 DECL_NORMAL_CAPTURE_P (member
) = true;
5701 /* Add it to the appropriate closure class if we've started it. */
5702 if (current_class_type
&& current_class_type
== TREE_TYPE (lambda
))
5703 finish_member_declaration (member
);
5705 LAMBDA_EXPR_CAPTURE_LIST (lambda
)
5706 = tree_cons (member
, initializer
, LAMBDA_EXPR_CAPTURE_LIST (lambda
));
5708 if (id
== get_identifier ("__this"))
5710 if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda
))
5711 error ("already captured %<this%> in lambda expression");
5712 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = member
;
5718 /* Register all the capture members on the list CAPTURES, which is the
5719 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
5721 void register_capture_members (tree captures
)
5725 register_capture_members (TREE_CHAIN (captures
));
5726 finish_member_declaration (TREE_PURPOSE (captures
));
5730 /* Given a FIELD_DECL decl belonging to a closure type, return a
5731 COMPONENT_REF of it relative to the 'this' parameter of the op() for
5735 thisify_lambda_field (tree decl
)
5737 tree context
= lambda_function (DECL_CONTEXT (decl
));
5738 tree object
= cp_build_indirect_ref (DECL_ARGUMENTS (context
),
5740 tf_warning_or_error
);
5741 return finish_non_static_data_member (decl
, object
,
5742 /*qualifying_scope*/NULL_TREE
);
5745 /* Similar to add_capture, except this works on a stack of nested lambdas.
5746 BY_REFERENCE_P in this case is derived from the default capture mode.
5747 Returns the capture for the lambda at the bottom of the stack. */
5750 add_default_capture (tree lambda_stack
, tree id
, tree initializer
)
5752 bool this_capture_p
= (id
== get_identifier ("__this"));
5754 tree member
= NULL_TREE
;
5756 tree saved_class_type
= current_class_type
;
5760 for (node
= lambda_stack
;
5762 node
= TREE_CHAIN (node
))
5764 tree lambda
= TREE_VALUE (node
);
5766 current_class_type
= TREE_TYPE (lambda
);
5767 member
= add_capture (lambda
,
5772 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
)
5773 == CPLD_REFERENCE
)),
5774 /*explicit_init_p=*/false);
5775 initializer
= thisify_lambda_field (member
);
5778 current_class_type
= saved_class_type
;
5783 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
5784 INDIRECT_REF, possibly adding it through default capturing. */
5787 lambda_expr_this_capture (tree lambda
)
5791 tree this_capture
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
5793 /* Try to default capture 'this' if we can. */
5795 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) != CPLD_NONE
)
5797 tree containing_function
= TYPE_CONTEXT (TREE_TYPE (lambda
));
5798 tree lambda_stack
= tree_cons (NULL_TREE
, lambda
, NULL_TREE
);
5799 tree init
= NULL_TREE
;
5801 /* If we are in a lambda function, we can move out until we hit:
5802 1. a non-lambda function,
5803 2. a lambda function capturing 'this', or
5804 3. a non-default capturing lambda function. */
5805 while (LAMBDA_FUNCTION_P (containing_function
))
5808 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function
));
5810 if (LAMBDA_EXPR_THIS_CAPTURE (lambda
))
5812 /* An outer lambda has already captured 'this'. */
5813 tree cap
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
5814 init
= thisify_lambda_field (cap
);
5818 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) == CPLD_NONE
)
5819 /* An outer lambda won't let us capture 'this'. */
5822 lambda_stack
= tree_cons (NULL_TREE
,
5826 containing_function
= decl_function_context (containing_function
);
5829 if (!init
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function
)
5830 && !LAMBDA_FUNCTION_P (containing_function
))
5831 /* First parameter is 'this'. */
5832 init
= DECL_ARGUMENTS (containing_function
);
5835 this_capture
= add_default_capture (lambda_stack
,
5836 /*id=*/get_identifier ("__this"),
5842 error ("%<this%> was not captured for this lambda function");
5843 result
= error_mark_node
;
5847 /* To make sure that current_class_ref is for the lambda. */
5848 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref
)) == TREE_TYPE (lambda
));
5850 result
= finish_non_static_data_member (this_capture
,
5852 /*qualifying_scope=*/NULL_TREE
);
5854 /* If 'this' is captured, each use of 'this' is transformed into an
5855 access to the corresponding unnamed data member of the closure
5856 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
5857 ensures that the transformed expression is an rvalue. ] */
5858 result
= rvalue (result
);
5864 /* If the closure TYPE has a static op(), also add a conversion to function
5868 maybe_add_lambda_conv_op (tree type
)
5870 bool nested
= (current_function_decl
!= NULL_TREE
);
5871 tree callop
= lambda_function (type
);
5872 tree rettype
, name
, fntype
, fn
, body
, compound_stmt
;
5873 tree thistype
, stattype
, statfn
, convfn
, call
, arg
;
5874 VEC (tree
, gc
) *argvec
;
5876 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type
)) != NULL_TREE
)
5879 stattype
= build_function_type (TREE_TYPE (TREE_TYPE (callop
)),
5880 FUNCTION_ARG_CHAIN (callop
));
5882 /* First build up the conversion op. */
5884 rettype
= build_pointer_type (stattype
);
5885 name
= mangle_conv_op_name_for_type (rettype
);
5886 thistype
= cp_build_qualified_type (type
, TYPE_QUAL_CONST
);
5887 fntype
= build_method_type_directly (thistype
, rettype
, void_list_node
);
5888 fn
= convfn
= build_lang_decl (FUNCTION_DECL
, name
, fntype
);
5889 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
5891 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
5892 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
5893 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
5895 SET_OVERLOADED_OPERATOR_CODE (fn
, TYPE_EXPR
);
5896 grokclassfn (type
, fn
, NO_SPECIAL
);
5897 set_linkage_according_to_type (type
, fn
);
5898 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
5899 DECL_IN_AGGR_P (fn
) = 1;
5900 DECL_ARTIFICIAL (fn
) = 1;
5901 DECL_NOT_REALLY_EXTERN (fn
) = 1;
5902 DECL_DECLARED_INLINE_P (fn
) = 1;
5903 DECL_ARGUMENTS (fn
) = build_this_parm (fntype
, TYPE_QUAL_CONST
);
5905 DECL_INTERFACE_KNOWN (fn
) = 1;
5907 add_method (type
, fn
, NULL_TREE
);
5909 /* Generic thunk code fails for varargs; we'll complain in mark_used if
5910 the conversion op is used. */
5911 if (varargs_function_p (callop
))
5913 DECL_DELETED_FN (fn
) = 1;
5917 /* Now build up the thunk to be returned. */
5919 name
= get_identifier ("_FUN");
5920 fn
= statfn
= build_lang_decl (FUNCTION_DECL
, name
, stattype
);
5921 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
5922 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
5923 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
5924 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
5925 grokclassfn (type
, fn
, NO_SPECIAL
);
5926 set_linkage_according_to_type (type
, fn
);
5927 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
5928 DECL_IN_AGGR_P (fn
) = 1;
5929 DECL_ARTIFICIAL (fn
) = 1;
5930 DECL_NOT_REALLY_EXTERN (fn
) = 1;
5931 DECL_DECLARED_INLINE_P (fn
) = 1;
5932 DECL_STATIC_FUNCTION_P (fn
) = 1;
5933 DECL_ARGUMENTS (fn
) = copy_list (TREE_CHAIN (DECL_ARGUMENTS (callop
)));
5934 for (arg
= DECL_ARGUMENTS (fn
); arg
; arg
= TREE_CHAIN (arg
))
5935 DECL_CONTEXT (arg
) = fn
;
5937 DECL_INTERFACE_KNOWN (fn
) = 1;
5939 add_method (type
, fn
, NULL_TREE
);
5942 push_function_context ();
5944 /* Generate the body of the thunk. */
5946 start_preparsed_function (statfn
, NULL_TREE
,
5947 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
5948 if (DECL_ONE_ONLY (statfn
))
5950 /* Put the thunk in the same comdat group as the call op. */
5951 struct cgraph_node
*callop_node
, *thunk_node
;
5952 DECL_COMDAT_GROUP (statfn
) = DECL_COMDAT_GROUP (callop
);
5953 callop_node
= cgraph_node (callop
);
5954 thunk_node
= cgraph_node (statfn
);
5955 gcc_assert (callop_node
->same_comdat_group
== NULL
);
5956 gcc_assert (thunk_node
->same_comdat_group
== NULL
);
5957 callop_node
->same_comdat_group
= thunk_node
;
5958 thunk_node
->same_comdat_group
= callop_node
;
5960 body
= begin_function_body ();
5961 compound_stmt
= begin_compound_stmt (0);
5963 arg
= build1 (NOP_EXPR
, TREE_TYPE (DECL_ARGUMENTS (callop
)),
5965 argvec
= make_tree_vector ();
5966 VEC_quick_push (tree
, argvec
, arg
);
5967 for (arg
= DECL_ARGUMENTS (statfn
); arg
; arg
= TREE_CHAIN (arg
))
5968 VEC_safe_push (tree
, gc
, argvec
, arg
);
5969 call
= build_cxx_call (callop
, VEC_length (tree
, argvec
),
5970 VEC_address (tree
, argvec
));
5971 CALL_FROM_THUNK_P (call
) = 1;
5972 finish_return_stmt (call
);
5974 finish_compound_stmt (compound_stmt
);
5975 finish_function_body (body
);
5977 expand_or_defer_fn (finish_function (2));
5979 /* Generate the body of the conversion op. */
5981 start_preparsed_function (convfn
, NULL_TREE
,
5982 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
5983 body
= begin_function_body ();
5984 compound_stmt
= begin_compound_stmt (0);
5986 finish_return_stmt (decay_conversion (statfn
));
5988 finish_compound_stmt (compound_stmt
);
5989 finish_function_body (body
);
5991 expand_or_defer_fn (finish_function (2));
5994 pop_function_context ();
5996 #include "gt-cp-semantics.h"