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
);
1429 tree scope
= qualifying_scope
;
1430 if (scope
== NULL_TREE
)
1431 scope
= context_for_name_lookup (decl
);
1432 object
= maybe_dummy_object (scope
, NULL
);
1435 /* DR 613: Can use non-static data members without an associated
1436 object in sizeof/decltype/alignof. */
1437 if (is_dummy_object (object
) && cp_unevaluated_operand
== 0
1438 && (!processing_template_decl
|| !current_class_ref
))
1440 if (current_function_decl
1441 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1442 error ("invalid use of member %q+D in static member function", decl
);
1444 error ("invalid use of non-static data member %q+D", decl
);
1445 error ("from this location");
1447 return error_mark_node
;
1450 if (current_class_ptr
)
1451 TREE_USED (current_class_ptr
) = 1;
1452 if (processing_template_decl
&& !qualifying_scope
)
1454 tree type
= TREE_TYPE (decl
);
1456 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1457 type
= TREE_TYPE (type
);
1460 /* Set the cv qualifiers. */
1461 int quals
= (current_class_ref
1462 ? cp_type_quals (TREE_TYPE (current_class_ref
))
1463 : TYPE_UNQUALIFIED
);
1465 if (DECL_MUTABLE_P (decl
))
1466 quals
&= ~TYPE_QUAL_CONST
;
1468 quals
|= cp_type_quals (TREE_TYPE (decl
));
1469 type
= cp_build_qualified_type (type
, quals
);
1472 return build_min (COMPONENT_REF
, type
, object
, decl
, NULL_TREE
);
1474 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1475 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1477 else if (processing_template_decl
)
1478 return build_qualified_name (TREE_TYPE (decl
),
1481 /*template_p=*/false);
1484 tree access_type
= TREE_TYPE (object
);
1486 perform_or_defer_access_check (TYPE_BINFO (access_type
), decl
,
1489 /* If the data member was named `C::M', convert `*this' to `C'
1491 if (qualifying_scope
)
1493 tree binfo
= NULL_TREE
;
1494 object
= build_scoped_ref (object
, qualifying_scope
,
1498 return build_class_member_access_expr (object
, decl
,
1499 /*access_path=*/NULL_TREE
,
1500 /*preserve_reference=*/false,
1501 tf_warning_or_error
);
1505 /* If we are currently parsing a template and we encountered a typedef
1506 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1507 adds the typedef to a list tied to the current template.
1508 At tempate instantiatin time, that list is walked and access check
1509 performed for each typedef.
1510 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1513 add_typedef_to_current_template_for_access_check (tree typedef_decl
,
1515 location_t location
)
1517 tree template_info
= NULL
;
1518 tree cs
= current_scope ();
1520 if (!is_typedef_decl (typedef_decl
)
1522 || !CLASS_TYPE_P (context
)
1526 if (CLASS_TYPE_P (cs
) || TREE_CODE (cs
) == FUNCTION_DECL
)
1527 template_info
= get_template_info (cs
);
1530 && TI_TEMPLATE (template_info
)
1531 && !currently_open_class (context
))
1532 append_type_to_template_for_access_check (cs
, typedef_decl
,
1536 /* DECL was the declaration to which a qualified-id resolved. Issue
1537 an error message if it is not accessible. If OBJECT_TYPE is
1538 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1539 type of `*x', or `x', respectively. If the DECL was named as
1540 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1543 check_accessibility_of_qualified_id (tree decl
,
1545 tree nested_name_specifier
)
1548 tree qualifying_type
= NULL_TREE
;
1550 /* If we are parsing a template declaration and if decl is a typedef,
1551 add it to a list tied to the template.
1552 At template instantiation time, that list will be walked and
1553 access check performed. */
1554 add_typedef_to_current_template_for_access_check (decl
,
1555 nested_name_specifier
1556 ? nested_name_specifier
1557 : DECL_CONTEXT (decl
),
1560 /* If we're not checking, return immediately. */
1561 if (deferred_access_no_check
)
1564 /* Determine the SCOPE of DECL. */
1565 scope
= context_for_name_lookup (decl
);
1566 /* If the SCOPE is not a type, then DECL is not a member. */
1567 if (!TYPE_P (scope
))
1569 /* Compute the scope through which DECL is being accessed. */
1571 /* OBJECT_TYPE might not be a class type; consider:
1573 class A { typedef int I; };
1577 In this case, we will have "A::I" as the DECL, but "I" as the
1579 && CLASS_TYPE_P (object_type
)
1580 && DERIVED_FROM_P (scope
, object_type
))
1581 /* If we are processing a `->' or `.' expression, use the type of the
1583 qualifying_type
= object_type
;
1584 else if (nested_name_specifier
)
1586 /* If the reference is to a non-static member of the
1587 current class, treat it as if it were referenced through
1589 if (DECL_NONSTATIC_MEMBER_P (decl
)
1590 && current_class_ptr
1591 && DERIVED_FROM_P (scope
, current_class_type
))
1592 qualifying_type
= current_class_type
;
1593 /* Otherwise, use the type indicated by the
1594 nested-name-specifier. */
1596 qualifying_type
= nested_name_specifier
;
1599 /* Otherwise, the name must be from the current class or one of
1601 qualifying_type
= currently_open_derived_class (scope
);
1604 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1605 or similar in a default argument value. */
1606 && CLASS_TYPE_P (qualifying_type
)
1607 && !dependent_type_p (qualifying_type
))
1608 perform_or_defer_access_check (TYPE_BINFO (qualifying_type
), decl
,
1612 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1613 class named to the left of the "::" operator. DONE is true if this
1614 expression is a complete postfix-expression; it is false if this
1615 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1616 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1617 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1618 is true iff this qualified name appears as a template argument. */
1621 finish_qualified_id_expr (tree qualifying_class
,
1626 bool template_arg_p
)
1628 gcc_assert (TYPE_P (qualifying_class
));
1630 if (error_operand_p (expr
))
1631 return error_mark_node
;
1633 if (DECL_P (expr
) || BASELINK_P (expr
))
1637 check_template_keyword (expr
);
1639 /* If EXPR occurs as the operand of '&', use special handling that
1640 permits a pointer-to-member. */
1641 if (address_p
&& done
)
1643 if (TREE_CODE (expr
) == SCOPE_REF
)
1644 expr
= TREE_OPERAND (expr
, 1);
1645 expr
= build_offset_ref (qualifying_class
, expr
,
1646 /*address_p=*/true);
1650 /* Within the scope of a class, turn references to non-static
1651 members into expression of the form "this->...". */
1653 /* But, within a template argument, we do not want make the
1654 transformation, as there is no "this" pointer. */
1656 else if (TREE_CODE (expr
) == FIELD_DECL
)
1658 push_deferring_access_checks (dk_no_check
);
1659 expr
= finish_non_static_data_member (expr
, NULL_TREE
,
1661 pop_deferring_access_checks ();
1663 else if (BASELINK_P (expr
) && !processing_template_decl
)
1668 /* See if any of the functions are non-static members. */
1669 fns
= BASELINK_FUNCTIONS (expr
);
1670 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
1671 fns
= TREE_OPERAND (fns
, 0);
1672 /* If so, the expression may be relative to 'this'. */
1673 if (!shared_member_p (fns
)
1674 && (ob
= maybe_dummy_object (qualifying_class
, NULL
),
1675 !is_dummy_object (ob
)))
1676 expr
= (build_class_member_access_expr
1679 BASELINK_ACCESS_BINFO (expr
),
1680 /*preserve_reference=*/false,
1681 tf_warning_or_error
));
1683 /* The expression is a qualified name whose address is not
1685 expr
= build_offset_ref (qualifying_class
, expr
, /*address_p=*/false);
1691 /* Begin a statement-expression. The value returned must be passed to
1692 finish_stmt_expr. */
1695 begin_stmt_expr (void)
1697 return push_stmt_list ();
1700 /* Process the final expression of a statement expression. EXPR can be
1701 NULL, if the final expression is empty. Return a STATEMENT_LIST
1702 containing all the statements in the statement-expression, or
1703 ERROR_MARK_NODE if there was an error. */
1706 finish_stmt_expr_expr (tree expr
, tree stmt_expr
)
1708 if (error_operand_p (expr
))
1710 /* The type of the statement-expression is the type of the last
1712 TREE_TYPE (stmt_expr
) = error_mark_node
;
1713 return error_mark_node
;
1716 /* If the last statement does not have "void" type, then the value
1717 of the last statement is the value of the entire expression. */
1720 tree type
= TREE_TYPE (expr
);
1722 if (processing_template_decl
)
1724 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
1725 expr
= add_stmt (expr
);
1726 /* Mark the last statement so that we can recognize it as such at
1727 template-instantiation time. */
1728 EXPR_STMT_STMT_EXPR_RESULT (expr
) = 1;
1730 else if (VOID_TYPE_P (type
))
1732 /* Just treat this like an ordinary statement. */
1733 expr
= finish_expr_stmt (expr
);
1737 /* It actually has a value we need to deal with. First, force it
1738 to be an rvalue so that we won't need to build up a copy
1739 constructor call later when we try to assign it to something. */
1740 expr
= force_rvalue (expr
);
1741 if (error_operand_p (expr
))
1742 return error_mark_node
;
1744 /* Update for array-to-pointer decay. */
1745 type
= TREE_TYPE (expr
);
1747 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1748 normal statement, but don't convert to void or actually add
1750 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
1751 expr
= maybe_cleanup_point_expr (expr
);
1755 /* The type of the statement-expression is the type of the last
1757 TREE_TYPE (stmt_expr
) = type
;
1763 /* Finish a statement-expression. EXPR should be the value returned
1764 by the previous begin_stmt_expr. Returns an expression
1765 representing the statement-expression. */
1768 finish_stmt_expr (tree stmt_expr
, bool has_no_scope
)
1773 if (error_operand_p (stmt_expr
))
1775 pop_stmt_list (stmt_expr
);
1776 return error_mark_node
;
1779 gcc_assert (TREE_CODE (stmt_expr
) == STATEMENT_LIST
);
1781 type
= TREE_TYPE (stmt_expr
);
1782 result
= pop_stmt_list (stmt_expr
);
1783 TREE_TYPE (result
) = type
;
1785 if (processing_template_decl
)
1787 result
= build_min (STMT_EXPR
, type
, result
);
1788 TREE_SIDE_EFFECTS (result
) = 1;
1789 STMT_EXPR_NO_SCOPE (result
) = has_no_scope
;
1791 else if (CLASS_TYPE_P (type
))
1793 /* Wrap the statement-expression in a TARGET_EXPR so that the
1794 temporary object created by the final expression is destroyed at
1795 the end of the full-expression containing the
1796 statement-expression. */
1797 result
= force_target_expr (type
, result
);
1803 /* Returns the expression which provides the value of STMT_EXPR. */
1806 stmt_expr_value_expr (tree stmt_expr
)
1808 tree t
= STMT_EXPR_STMT (stmt_expr
);
1810 if (TREE_CODE (t
) == BIND_EXPR
)
1811 t
= BIND_EXPR_BODY (t
);
1813 if (TREE_CODE (t
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (t
))
1814 t
= STATEMENT_LIST_TAIL (t
)->stmt
;
1816 if (TREE_CODE (t
) == EXPR_STMT
)
1817 t
= EXPR_STMT_EXPR (t
);
1822 /* Return TRUE iff EXPR_STMT is an empty list of
1823 expression statements. */
1826 empty_expr_stmt_p (tree expr_stmt
)
1828 tree body
= NULL_TREE
;
1830 if (expr_stmt
== void_zero_node
)
1835 if (TREE_CODE (expr_stmt
) == EXPR_STMT
)
1836 body
= EXPR_STMT_EXPR (expr_stmt
);
1837 else if (TREE_CODE (expr_stmt
) == STATEMENT_LIST
)
1843 if (TREE_CODE (body
) == STATEMENT_LIST
)
1844 return tsi_end_p (tsi_start (body
));
1846 return empty_expr_stmt_p (body
);
1851 /* Perform Koenig lookup. FN is the postfix-expression representing
1852 the function (or functions) to call; ARGS are the arguments to the
1853 call. Returns the functions to be considered by overload
1857 perform_koenig_lookup (tree fn
, VEC(tree
,gc
) *args
)
1859 tree identifier
= NULL_TREE
;
1860 tree functions
= NULL_TREE
;
1861 tree tmpl_args
= NULL_TREE
;
1862 bool template_id
= false;
1864 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
1866 /* Use a separate flag to handle null args. */
1868 tmpl_args
= TREE_OPERAND (fn
, 1);
1869 fn
= TREE_OPERAND (fn
, 0);
1872 /* Find the name of the overloaded function. */
1873 if (TREE_CODE (fn
) == IDENTIFIER_NODE
)
1875 else if (is_overloaded_fn (fn
))
1878 identifier
= DECL_NAME (get_first_fn (functions
));
1880 else if (DECL_P (fn
))
1883 identifier
= DECL_NAME (fn
);
1886 /* A call to a namespace-scope function using an unqualified name.
1888 Do Koenig lookup -- unless any of the arguments are
1890 if (!any_type_dependent_arguments_p (args
)
1891 && !any_dependent_template_arguments_p (tmpl_args
))
1893 fn
= lookup_arg_dependent (identifier
, functions
, args
);
1895 /* The unqualified name could not be resolved. */
1896 fn
= unqualified_fn_lookup_error (identifier
);
1899 if (fn
&& template_id
)
1900 fn
= build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fn
, tmpl_args
);
1905 /* Generate an expression for `FN (ARGS)'. This may change the
1908 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1909 as a virtual call, even if FN is virtual. (This flag is set when
1910 encountering an expression where the function name is explicitly
1911 qualified. For example a call to `X::f' never generates a virtual
1914 Returns code for the call. */
1917 finish_call_expr (tree fn
, VEC(tree
,gc
) **args
, bool disallow_virtual
,
1918 bool koenig_p
, tsubst_flags_t complain
)
1922 VEC(tree
,gc
) *orig_args
= NULL
;
1924 if (fn
== error_mark_node
)
1925 return error_mark_node
;
1927 gcc_assert (!TYPE_P (fn
));
1931 if (processing_template_decl
)
1933 if (type_dependent_expression_p (fn
)
1934 || any_type_dependent_arguments_p (*args
))
1936 result
= build_nt_call_vec (fn
, *args
);
1937 KOENIG_LOOKUP_P (result
) = koenig_p
;
1942 tree fndecl
= OVL_CURRENT (fn
);
1943 if (TREE_CODE (fndecl
) != FUNCTION_DECL
1944 || !TREE_THIS_VOLATILE (fndecl
))
1950 current_function_returns_abnormally
= 1;
1954 orig_args
= make_tree_vector_copy (*args
);
1955 if (!BASELINK_P (fn
)
1956 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
1957 && TREE_TYPE (fn
) != unknown_type_node
)
1958 fn
= build_non_dependent_expr (fn
);
1959 make_args_non_dependent (*args
);
1962 if (is_overloaded_fn (fn
))
1963 fn
= baselink_for_fns (fn
);
1966 if (BASELINK_P (fn
))
1970 /* A call to a member function. From [over.call.func]:
1972 If the keyword this is in scope and refers to the class of
1973 that member function, or a derived class thereof, then the
1974 function call is transformed into a qualified function call
1975 using (*this) as the postfix-expression to the left of the
1976 . operator.... [Otherwise] a contrived object of type T
1977 becomes the implied object argument.
1981 struct A { void f(); };
1982 struct B : public A {};
1983 struct C : public A { void g() { B::f(); }};
1985 "the class of that member function" refers to `A'. But 11.2
1986 [class.access.base] says that we need to convert 'this' to B* as
1987 part of the access, so we pass 'B' to maybe_dummy_object. */
1989 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
1992 if (processing_template_decl
)
1994 if (type_dependent_expression_p (object
))
1996 tree ret
= build_nt_call_vec (orig_fn
, orig_args
);
1997 release_tree_vector (orig_args
);
2000 object
= build_non_dependent_expr (object
);
2003 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
2005 ? LOOKUP_NONVIRTUAL
: 0),
2009 else if (is_overloaded_fn (fn
))
2011 /* If the function is an overloaded builtin, resolve it. */
2012 if (TREE_CODE (fn
) == FUNCTION_DECL
2013 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2014 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
2015 result
= resolve_overloaded_builtin (input_location
, fn
, *args
);
2018 /* A call to a namespace-scope function. */
2019 result
= build_new_function_call (fn
, args
, koenig_p
, complain
);
2021 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
2023 if (!VEC_empty (tree
, *args
))
2024 error ("arguments to destructor are not allowed");
2025 /* Mark the pseudo-destructor call as having side-effects so
2026 that we do not issue warnings about its use. */
2027 result
= build1 (NOP_EXPR
,
2029 TREE_OPERAND (fn
, 0));
2030 TREE_SIDE_EFFECTS (result
) = 1;
2032 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
2033 /* If the "function" is really an object of class type, it might
2034 have an overloaded `operator ()'. */
2035 result
= build_op_call (fn
, args
, complain
);
2038 /* A call where the function is unknown. */
2039 result
= cp_build_function_call_vec (fn
, args
, complain
);
2041 if (processing_template_decl
)
2043 result
= build_call_vec (TREE_TYPE (result
), orig_fn
, orig_args
);
2044 KOENIG_LOOKUP_P (result
) = koenig_p
;
2045 release_tree_vector (orig_args
);
2051 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2052 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2053 POSTDECREMENT_EXPR.) */
2056 finish_increment_expr (tree expr
, enum tree_code code
)
2058 return build_x_unary_op (code
, expr
, tf_warning_or_error
);
2061 /* Finish a use of `this'. Returns an expression for `this'. */
2064 finish_this_expr (void)
2068 if (current_class_ptr
)
2070 tree type
= TREE_TYPE (current_class_ref
);
2072 /* In a lambda expression, 'this' refers to the captured 'this'. */
2073 if (LAMBDA_TYPE_P (type
))
2074 result
= lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type
));
2076 result
= current_class_ptr
;
2079 else if (current_function_decl
2080 && DECL_STATIC_FUNCTION_P (current_function_decl
))
2082 error ("%<this%> is unavailable for static member functions");
2083 result
= error_mark_node
;
2087 if (current_function_decl
)
2088 error ("invalid use of %<this%> in non-member function");
2090 error ("invalid use of %<this%> at top level");
2091 result
= error_mark_node
;
2097 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2098 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2099 the TYPE for the type given. If SCOPE is non-NULL, the expression
2100 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2103 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
)
2105 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2106 return error_mark_node
;
2108 gcc_assert (TYPE_P (destructor
));
2110 if (!processing_template_decl
)
2112 if (scope
== error_mark_node
)
2114 error ("invalid qualifying scope in pseudo-destructor name");
2115 return error_mark_node
;
2117 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2119 error ("qualified type %qT does not match destructor name ~%qT",
2121 return error_mark_node
;
2125 /* [expr.pseudo] says both:
2127 The type designated by the pseudo-destructor-name shall be
2128 the same as the object type.
2132 The cv-unqualified versions of the object type and of the
2133 type designated by the pseudo-destructor-name shall be the
2136 We implement the more generous second sentence, since that is
2137 what most other compilers do. */
2138 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2141 error ("%qE is not of type %qT", object
, destructor
);
2142 return error_mark_node
;
2146 return build3 (PSEUDO_DTOR_EXPR
, void_type_node
, object
, scope
, destructor
);
2149 /* Finish an expression of the form CODE EXPR. */
2152 finish_unary_op_expr (enum tree_code code
, tree expr
)
2154 tree result
= build_x_unary_op (code
, expr
, tf_warning_or_error
);
2155 /* Inside a template, build_x_unary_op does not fold the
2156 expression. So check whether the result is folded before
2157 setting TREE_NEGATED_INT. */
2158 if (code
== NEGATE_EXPR
&& TREE_CODE (expr
) == INTEGER_CST
2159 && TREE_CODE (result
) == INTEGER_CST
2160 && !TYPE_UNSIGNED (TREE_TYPE (result
))
2161 && INT_CST_LT (result
, integer_zero_node
))
2163 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2164 setting TREE_NEGATED_INT. */
2165 result
= copy_node (result
);
2166 TREE_NEGATED_INT (result
) = 1;
2168 if (TREE_OVERFLOW_P (result
) && !TREE_OVERFLOW_P (expr
))
2169 overflow_warning (input_location
, result
);
2174 /* Finish a compound-literal expression. TYPE is the type to which
2175 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2178 finish_compound_literal (tree type
, tree compound_literal
)
2180 if (type
== error_mark_node
)
2181 return error_mark_node
;
2183 if (!TYPE_OBJ_P (type
))
2185 error ("compound literal of non-object type %qT", type
);
2186 return error_mark_node
;
2189 if (processing_template_decl
)
2191 TREE_TYPE (compound_literal
) = type
;
2192 /* Mark the expression as a compound literal. */
2193 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2194 return compound_literal
;
2197 type
= complete_type (type
);
2199 if (TYPE_NON_AGGREGATE_CLASS (type
))
2201 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2202 everywhere that deals with function arguments would be a pain, so
2203 just wrap it in a TREE_LIST. The parser set a flag so we know
2204 that it came from T{} rather than T({}). */
2205 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal
) = 1;
2206 compound_literal
= build_tree_list (NULL_TREE
, compound_literal
);
2207 return build_functional_cast (type
, compound_literal
, tf_error
);
2210 if (TREE_CODE (type
) == ARRAY_TYPE
2211 && check_array_initializer (NULL_TREE
, type
, compound_literal
))
2212 return error_mark_node
;
2213 compound_literal
= reshape_init (type
, compound_literal
);
2214 if (TREE_CODE (type
) == ARRAY_TYPE
)
2215 cp_complete_array_type (&type
, compound_literal
, false);
2216 compound_literal
= digest_init (type
, compound_literal
);
2217 if ((!at_function_scope_p () || cp_type_readonly (type
))
2218 && initializer_constant_valid_p (compound_literal
, type
))
2220 tree decl
= create_temporary_var (type
);
2221 DECL_INITIAL (decl
) = compound_literal
;
2222 TREE_STATIC (decl
) = 1;
2223 cp_apply_type_quals_to_decl (cp_type_quals (type
), decl
);
2224 decl
= pushdecl_top_level (decl
);
2225 DECL_NAME (decl
) = make_anon_name ();
2226 SET_DECL_ASSEMBLER_NAME (decl
, DECL_NAME (decl
));
2230 return get_target_expr (compound_literal
);
2233 /* Return the declaration for the function-name variable indicated by
2237 finish_fname (tree id
)
2241 decl
= fname_decl (input_location
, C_RID_CODE (id
), id
);
2242 if (processing_template_decl
)
2243 decl
= DECL_NAME (decl
);
2247 /* Finish a translation unit. */
2250 finish_translation_unit (void)
2252 /* In case there were missing closebraces,
2253 get us back to the global binding level. */
2255 while (current_namespace
!= global_namespace
)
2258 /* Do file scope __FUNCTION__ et al. */
2259 finish_fname_decls ();
2262 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2263 Returns the parameter. */
2266 finish_template_type_parm (tree aggr
, tree identifier
)
2268 if (aggr
!= class_type_node
)
2270 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
2271 aggr
= class_type_node
;
2274 return build_tree_list (aggr
, identifier
);
2277 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2278 Returns the parameter. */
2281 finish_template_template_parm (tree aggr
, tree identifier
)
2283 tree decl
= build_decl (input_location
,
2284 TYPE_DECL
, identifier
, NULL_TREE
);
2285 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2286 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2287 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2288 DECL_ARTIFICIAL (decl
) = 1;
2289 end_template_decl ();
2291 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2293 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
2294 /*is_primary=*/true, /*is_partial=*/false,
2297 return finish_template_type_parm (aggr
, tmpl
);
2300 /* ARGUMENT is the default-argument value for a template template
2301 parameter. If ARGUMENT is invalid, issue error messages and return
2302 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2305 check_template_template_default_arg (tree argument
)
2307 if (TREE_CODE (argument
) != TEMPLATE_DECL
2308 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2309 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2311 if (TREE_CODE (argument
) == TYPE_DECL
)
2312 error ("invalid use of type %qT as a default value for a template "
2313 "template-parameter", TREE_TYPE (argument
));
2315 error ("invalid default argument for a template template parameter");
2316 return error_mark_node
;
2322 /* Begin a class definition, as indicated by T. */
2325 begin_class_definition (tree t
, tree attributes
)
2327 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
2328 return error_mark_node
;
2330 if (processing_template_parmlist
)
2332 error ("definition of %q#T inside template parameter list", t
);
2333 return error_mark_node
;
2336 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2337 are passed the same as decimal scalar types. */
2338 if (TREE_CODE (t
) == RECORD_TYPE
2339 && !processing_template_decl
)
2341 tree ns
= TYPE_CONTEXT (t
);
2342 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
2343 && DECL_CONTEXT (ns
) == std_node
2345 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns
)), "decimal"))
2347 const char *n
= TYPE_NAME_STRING (t
);
2348 if ((strcmp (n
, "decimal32") == 0)
2349 || (strcmp (n
, "decimal64") == 0)
2350 || (strcmp (n
, "decimal128") == 0))
2351 TYPE_TRANSPARENT_AGGR (t
) = 1;
2355 /* A non-implicit typename comes from code like:
2357 template <typename T> struct A {
2358 template <typename U> struct A<T>::B ...
2360 This is erroneous. */
2361 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2363 error ("invalid definition of qualified type %qT", t
);
2364 t
= error_mark_node
;
2367 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
2369 t
= make_class_type (RECORD_TYPE
);
2370 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
2373 if (TYPE_BEING_DEFINED (t
))
2375 t
= make_class_type (TREE_CODE (t
));
2376 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
2378 maybe_process_partial_specialization (t
);
2380 TYPE_BEING_DEFINED (t
) = 1;
2382 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
2384 if (flag_pack_struct
)
2387 TYPE_PACKED (t
) = 1;
2388 /* Even though the type is being defined for the first time
2389 here, there might have been a forward declaration, so there
2390 might be cv-qualified variants of T. */
2391 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
2392 TYPE_PACKED (v
) = 1;
2394 /* Reset the interface data, at the earliest possible
2395 moment, as it might have been set via a class foo;
2397 if (! TYPE_ANONYMOUS_P (t
))
2399 struct c_fileinfo
*finfo
= get_fileinfo (input_filename
);
2400 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
2401 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2402 (t
, finfo
->interface_unknown
);
2404 reset_specialization();
2406 /* Make a declaration for this class in its own scope. */
2407 build_self_reference ();
2412 /* Finish the member declaration given by DECL. */
2415 finish_member_declaration (tree decl
)
2417 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
2420 if (decl
== void_type_node
)
2421 /* The COMPONENT was a friend, not a member, and so there's
2422 nothing for us to do. */
2425 /* We should see only one DECL at a time. */
2426 gcc_assert (TREE_CHAIN (decl
) == NULL_TREE
);
2428 /* Set up access control for DECL. */
2430 = (current_access_specifier
== access_private_node
);
2431 TREE_PROTECTED (decl
)
2432 = (current_access_specifier
== access_protected_node
);
2433 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2435 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
2436 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
2439 /* Mark the DECL as a member of the current class. */
2440 DECL_CONTEXT (decl
) = current_class_type
;
2442 /* Check for bare parameter packs in the member variable declaration. */
2443 if (TREE_CODE (decl
) == FIELD_DECL
)
2445 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
2446 TREE_TYPE (decl
) = error_mark_node
;
2447 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
2448 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
2453 A C language linkage is ignored for the names of class members
2454 and the member function type of class member functions. */
2455 if (DECL_LANG_SPECIFIC (decl
) && DECL_LANGUAGE (decl
) == lang_c
)
2456 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
2458 /* Put functions on the TYPE_METHODS list and everything else on the
2459 TYPE_FIELDS list. Note that these are built up in reverse order.
2460 We reverse them (to obtain declaration order) in finish_struct. */
2461 if (TREE_CODE (decl
) == FUNCTION_DECL
2462 || DECL_FUNCTION_TEMPLATE_P (decl
))
2464 /* We also need to add this function to the
2465 CLASSTYPE_METHOD_VEC. */
2466 if (add_method (current_class_type
, decl
, NULL_TREE
))
2468 TREE_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
2469 TYPE_METHODS (current_class_type
) = decl
;
2471 maybe_add_class_template_decl_list (current_class_type
, decl
,
2475 /* Enter the DECL into the scope of the class. */
2476 else if ((TREE_CODE (decl
) == USING_DECL
&& !DECL_DEPENDENT_P (decl
))
2477 || pushdecl_class_level (decl
))
2479 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2480 go at the beginning. The reason is that lookup_field_1
2481 searches the list in order, and we want a field name to
2482 override a type name so that the "struct stat hack" will
2483 work. In particular:
2485 struct S { enum E { }; int E } s;
2488 is valid. In addition, the FIELD_DECLs must be maintained in
2489 declaration order so that class layout works as expected.
2490 However, we don't need that order until class layout, so we
2491 save a little time by putting FIELD_DECLs on in reverse order
2492 here, and then reversing them in finish_struct_1. (We could
2493 also keep a pointer to the correct insertion points in the
2496 if (TREE_CODE (decl
) == TYPE_DECL
)
2497 TYPE_FIELDS (current_class_type
)
2498 = chainon (TYPE_FIELDS (current_class_type
), decl
);
2501 TREE_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
2502 TYPE_FIELDS (current_class_type
) = decl
;
2505 maybe_add_class_template_decl_list (current_class_type
, decl
,
2510 note_decl_for_pch (decl
);
2513 /* DECL has been declared while we are building a PCH file. Perform
2514 actions that we might normally undertake lazily, but which can be
2515 performed now so that they do not have to be performed in
2516 translation units which include the PCH file. */
2519 note_decl_for_pch (tree decl
)
2521 gcc_assert (pch_file
);
2523 /* There's a good chance that we'll have to mangle names at some
2524 point, even if only for emission in debugging information. */
2525 if ((TREE_CODE (decl
) == VAR_DECL
2526 || TREE_CODE (decl
) == FUNCTION_DECL
)
2527 && !processing_template_decl
)
2531 /* Finish processing a complete template declaration. The PARMS are
2532 the template parameters. */
2535 finish_template_decl (tree parms
)
2538 end_template_decl ();
2540 end_specialization ();
2543 /* Finish processing a template-id (which names a type) of the form
2544 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2545 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2546 the scope of template-id indicated. */
2549 finish_template_type (tree name
, tree args
, int entering_scope
)
2553 decl
= lookup_template_class (name
, args
,
2554 NULL_TREE
, NULL_TREE
, entering_scope
,
2555 tf_warning_or_error
| tf_user
);
2556 if (decl
!= error_mark_node
)
2557 decl
= TYPE_STUB_DECL (decl
);
2562 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2563 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2564 BASE_CLASS, or NULL_TREE if an error occurred. The
2565 ACCESS_SPECIFIER is one of
2566 access_{default,public,protected_private}_node. For a virtual base
2567 we set TREE_TYPE. */
2570 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
2574 if (base
== error_mark_node
)
2576 error ("invalid base-class specification");
2579 else if (! MAYBE_CLASS_TYPE_P (base
))
2581 error ("%qT is not a class type", base
);
2586 if (cp_type_quals (base
) != 0)
2588 error ("base class %qT has cv qualifiers", base
);
2589 base
= TYPE_MAIN_VARIANT (base
);
2591 result
= build_tree_list (access
, base
);
2593 TREE_TYPE (result
) = integer_type_node
;
2599 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2600 what we found when we tried to do the lookup.
2601 LOCATION is the location of the NAME identifier;
2602 The location is used in the error message*/
2605 qualified_name_lookup_error (tree scope
, tree name
,
2606 tree decl
, location_t location
)
2608 if (scope
== error_mark_node
)
2609 ; /* We already complained. */
2610 else if (TYPE_P (scope
))
2612 if (!COMPLETE_TYPE_P (scope
))
2613 error_at (location
, "incomplete type %qT used in nested name specifier",
2615 else if (TREE_CODE (decl
) == TREE_LIST
)
2617 error_at (location
, "reference to %<%T::%D%> is ambiguous",
2619 print_candidates (decl
);
2622 error_at (location
, "%qD is not a member of %qT", name
, scope
);
2624 else if (scope
!= global_namespace
)
2625 error_at (location
, "%qD is not a member of %qD", name
, scope
);
2627 error_at (location
, "%<::%D%> has not been declared", name
);
2630 /* If FNS is a member function, a set of member functions, or a
2631 template-id referring to one or more member functions, return a
2632 BASELINK for FNS, incorporating the current access context.
2633 Otherwise, return FNS unchanged. */
2636 baselink_for_fns (tree fns
)
2641 if (BASELINK_P (fns
)
2642 || error_operand_p (fns
))
2646 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2647 fn
= TREE_OPERAND (fn
, 0);
2648 fn
= get_first_fn (fn
);
2649 if (!DECL_FUNCTION_MEMBER_P (fn
))
2652 cl
= currently_open_derived_class (DECL_CONTEXT (fn
));
2654 cl
= DECL_CONTEXT (fn
);
2655 cl
= TYPE_BINFO (cl
);
2656 return build_baselink (TYPE_BINFO (DECL_CONTEXT (fn
)), cl
, fns
,
2657 /*optype=*/NULL_TREE
);
2660 /* Returns true iff DECL is an automatic variable from a function outside
2664 outer_automatic_var_p (tree decl
)
2666 return ((TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
2667 && DECL_FUNCTION_SCOPE_P (decl
)
2668 && !TREE_STATIC (decl
)
2669 && DECL_CONTEXT (decl
) != current_function_decl
);
2672 /* Returns true iff DECL is a capture field from a lambda that is not our
2673 immediate context. */
2676 outer_lambda_capture_p (tree decl
)
2678 return (TREE_CODE (decl
) == FIELD_DECL
2679 && LAMBDA_TYPE_P (DECL_CONTEXT (decl
))
2680 && (!current_class_type
2681 || !DERIVED_FROM_P (DECL_CONTEXT (decl
), current_class_type
)));
2684 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2685 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2686 if non-NULL, is the type or namespace used to explicitly qualify
2687 ID_EXPRESSION. DECL is the entity to which that name has been
2690 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2691 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2692 be set to true if this expression isn't permitted in a
2693 constant-expression, but it is otherwise not set by this function.
2694 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2695 constant-expression, but a non-constant expression is also
2698 DONE is true if this expression is a complete postfix-expression;
2699 it is false if this expression is followed by '->', '[', '(', etc.
2700 ADDRESS_P is true iff this expression is the operand of '&'.
2701 TEMPLATE_P is true iff the qualified-id was of the form
2702 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2703 appears as a template argument.
2705 If an error occurs, and it is the kind of error that might cause
2706 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2707 is the caller's responsibility to issue the message. *ERROR_MSG
2708 will be a string with static storage duration, so the caller need
2711 Return an expression for the entity, after issuing appropriate
2712 diagnostics. This function is also responsible for transforming a
2713 reference to a non-static member into a COMPONENT_REF that makes
2714 the use of "this" explicit.
2716 Upon return, *IDK will be filled in appropriately. */
2718 finish_id_expression (tree id_expression
,
2722 bool integral_constant_expression_p
,
2723 bool allow_non_integral_constant_expression_p
,
2724 bool *non_integral_constant_expression_p
,
2728 bool template_arg_p
,
2729 const char **error_msg
,
2730 location_t location
)
2732 /* Initialize the output parameters. */
2733 *idk
= CP_ID_KIND_NONE
;
2736 if (id_expression
== error_mark_node
)
2737 return error_mark_node
;
2738 /* If we have a template-id, then no further lookup is
2739 required. If the template-id was for a template-class, we
2740 will sometimes have a TYPE_DECL at this point. */
2741 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2742 || TREE_CODE (decl
) == TYPE_DECL
)
2744 /* Look up the name. */
2747 if (decl
== error_mark_node
)
2749 /* Name lookup failed. */
2752 || (!dependent_type_p (scope
)
2753 && !(TREE_CODE (id_expression
) == IDENTIFIER_NODE
2754 && IDENTIFIER_TYPENAME_P (id_expression
)
2755 && dependent_type_p (TREE_TYPE (id_expression
))))))
2757 /* If the qualifying type is non-dependent (and the name
2758 does not name a conversion operator to a dependent
2759 type), issue an error. */
2760 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
2761 return error_mark_node
;
2765 /* It may be resolved via Koenig lookup. */
2766 *idk
= CP_ID_KIND_UNQUALIFIED
;
2767 return id_expression
;
2770 decl
= id_expression
;
2772 /* If DECL is a variable that would be out of scope under
2773 ANSI/ISO rules, but in scope in the ARM, name lookup
2774 will succeed. Issue a diagnostic here. */
2776 decl
= check_for_out_of_scope_variable (decl
);
2778 /* Remember that the name was used in the definition of
2779 the current class so that we can check later to see if
2780 the meaning would have been different after the class
2781 was entirely defined. */
2782 if (!scope
&& decl
!= error_mark_node
)
2783 maybe_note_name_used_in_class (id_expression
, decl
);
2785 /* Disallow uses of local variables from containing functions, except
2786 within lambda-expressions. */
2787 if ((outer_automatic_var_p (decl
)
2788 || outer_lambda_capture_p (decl
))
2789 /* It's not a use (3.2) if we're in an unevaluated context. */
2790 && !cp_unevaluated_operand
)
2792 tree context
= DECL_CONTEXT (decl
);
2793 tree containing_function
= current_function_decl
;
2794 tree lambda_stack
= NULL_TREE
;
2795 tree lambda_expr
= NULL_TREE
;
2796 tree initializer
= decl
;
2798 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2799 support for an approach in which a reference to a local
2800 [constant] automatic variable in a nested class or lambda body
2801 would enter the expression as an rvalue, which would reduce
2802 the complexity of the problem"
2804 FIXME update for final resolution of core issue 696. */
2805 if (DECL_INTEGRAL_CONSTANT_VAR_P (decl
))
2806 return integral_constant_value (decl
);
2808 if (TYPE_P (context
))
2810 /* Implicit capture of an explicit capture. */
2811 context
= lambda_function (context
);
2812 initializer
= thisify_lambda_field (decl
);
2815 /* If we are in a lambda function, we can move out until we hit
2817 2. a non-lambda function, or
2818 3. a non-default capturing lambda function. */
2819 while (context
!= containing_function
2820 && LAMBDA_FUNCTION_P (containing_function
))
2822 lambda_expr
= CLASSTYPE_LAMBDA_EXPR
2823 (DECL_CONTEXT (containing_function
));
2825 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
2829 lambda_stack
= tree_cons (NULL_TREE
,
2834 = decl_function_context (containing_function
);
2837 if (context
== containing_function
)
2839 decl
= add_default_capture (lambda_stack
,
2840 /*id=*/DECL_NAME (decl
),
2843 else if (lambda_expr
)
2845 error ("%qD is not captured", decl
);
2846 return error_mark_node
;
2850 error (TREE_CODE (decl
) == VAR_DECL
2851 ? "use of %<auto%> variable from containing function"
2852 : "use of parameter from containing function");
2853 error (" %q+#D declared here", decl
);
2854 return error_mark_node
;
2859 /* If we didn't find anything, or what we found was a type,
2860 then this wasn't really an id-expression. */
2861 if (TREE_CODE (decl
) == TEMPLATE_DECL
2862 && !DECL_FUNCTION_TEMPLATE_P (decl
))
2864 *error_msg
= "missing template arguments";
2865 return error_mark_node
;
2867 else if (TREE_CODE (decl
) == TYPE_DECL
2868 || TREE_CODE (decl
) == NAMESPACE_DECL
)
2870 *error_msg
= "expected primary-expression";
2871 return error_mark_node
;
2874 /* If the name resolved to a template parameter, there is no
2875 need to look it up again later. */
2876 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
2877 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
2881 *idk
= CP_ID_KIND_NONE
;
2882 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
2883 decl
= TEMPLATE_PARM_DECL (decl
);
2884 r
= convert_from_reference (DECL_INITIAL (decl
));
2886 if (integral_constant_expression_p
2887 && !dependent_type_p (TREE_TYPE (decl
))
2888 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
2890 if (!allow_non_integral_constant_expression_p
)
2891 error ("template parameter %qD of type %qT is not allowed in "
2892 "an integral constant expression because it is not of "
2893 "integral or enumeration type", decl
, TREE_TYPE (decl
));
2894 *non_integral_constant_expression_p
= true;
2898 /* Similarly, we resolve enumeration constants to their
2899 underlying values. */
2900 else if (TREE_CODE (decl
) == CONST_DECL
)
2902 *idk
= CP_ID_KIND_NONE
;
2903 if (!processing_template_decl
)
2905 used_types_insert (TREE_TYPE (decl
));
2906 return DECL_INITIAL (decl
);
2914 /* If the declaration was explicitly qualified indicate
2915 that. The semantics of `A::f(3)' are different than
2916 `f(3)' if `f' is virtual. */
2918 ? CP_ID_KIND_QUALIFIED
2919 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2920 ? CP_ID_KIND_TEMPLATE_ID
2921 : CP_ID_KIND_UNQUALIFIED
));
2926 An id-expression is type-dependent if it contains an
2927 identifier that was declared with a dependent type.
2929 The standard is not very specific about an id-expression that
2930 names a set of overloaded functions. What if some of them
2931 have dependent types and some of them do not? Presumably,
2932 such a name should be treated as a dependent name. */
2933 /* Assume the name is not dependent. */
2934 dependent_p
= false;
2935 if (!processing_template_decl
)
2936 /* No names are dependent outside a template. */
2938 /* A template-id where the name of the template was not resolved
2939 is definitely dependent. */
2940 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2941 && (TREE_CODE (TREE_OPERAND (decl
, 0))
2942 == IDENTIFIER_NODE
))
2944 /* For anything except an overloaded function, just check its
2946 else if (!is_overloaded_fn (decl
))
2948 = dependent_type_p (TREE_TYPE (decl
));
2949 /* For a set of overloaded functions, check each of the
2955 if (BASELINK_P (fns
))
2956 fns
= BASELINK_FUNCTIONS (fns
);
2958 /* For a template-id, check to see if the template
2959 arguments are dependent. */
2960 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
2962 tree args
= TREE_OPERAND (fns
, 1);
2963 dependent_p
= any_dependent_template_arguments_p (args
);
2964 /* The functions are those referred to by the
2966 fns
= TREE_OPERAND (fns
, 0);
2969 /* If there are no dependent template arguments, go through
2970 the overloaded functions. */
2971 while (fns
&& !dependent_p
)
2973 tree fn
= OVL_CURRENT (fns
);
2975 /* Member functions of dependent classes are
2977 if (TREE_CODE (fn
) == FUNCTION_DECL
2978 && type_dependent_expression_p (fn
))
2980 else if (TREE_CODE (fn
) == TEMPLATE_DECL
2981 && dependent_template_p (fn
))
2984 fns
= OVL_NEXT (fns
);
2988 /* If the name was dependent on a template parameter, we will
2989 resolve the name at instantiation time. */
2992 /* Create a SCOPE_REF for qualified names, if the scope is
2998 if (address_p
&& done
)
2999 decl
= finish_qualified_id_expr (scope
, decl
,
3005 tree type
= NULL_TREE
;
3006 if (DECL_P (decl
) && !dependent_scope_p (scope
))
3007 type
= TREE_TYPE (decl
);
3008 decl
= build_qualified_name (type
,
3014 if (TREE_TYPE (decl
))
3015 decl
= convert_from_reference (decl
);
3018 /* A TEMPLATE_ID already contains all the information we
3020 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
)
3021 return id_expression
;
3022 *idk
= CP_ID_KIND_UNQUALIFIED_DEPENDENT
;
3023 /* If we found a variable, then name lookup during the
3024 instantiation will always resolve to the same VAR_DECL
3025 (or an instantiation thereof). */
3026 if (TREE_CODE (decl
) == VAR_DECL
3027 || TREE_CODE (decl
) == PARM_DECL
)
3028 return convert_from_reference (decl
);
3029 /* The same is true for FIELD_DECL, but we also need to
3030 make sure that the syntax is correct. */
3031 else if (TREE_CODE (decl
) == FIELD_DECL
)
3033 /* Since SCOPE is NULL here, this is an unqualified name.
3034 Access checking has been performed during name lookup
3035 already. Turn off checking to avoid duplicate errors. */
3036 push_deferring_access_checks (dk_no_check
);
3037 decl
= finish_non_static_data_member
3039 /*qualifying_scope=*/NULL_TREE
);
3040 pop_deferring_access_checks ();
3043 return id_expression
;
3046 /* Only certain kinds of names are allowed in constant
3047 expression. Enumerators and template parameters have already
3048 been handled above. */
3049 if (integral_constant_expression_p
3050 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl
)
3051 && ! builtin_valid_in_constant_expr_p (decl
))
3053 if (!allow_non_integral_constant_expression_p
)
3055 error ("%qD cannot appear in a constant-expression", decl
);
3056 return error_mark_node
;
3058 *non_integral_constant_expression_p
= true;
3061 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3063 error ("use of namespace %qD as expression", decl
);
3064 return error_mark_node
;
3066 else if (DECL_CLASS_TEMPLATE_P (decl
))
3068 error ("use of class template %qT as expression", decl
);
3069 return error_mark_node
;
3071 else if (TREE_CODE (decl
) == TREE_LIST
)
3073 /* Ambiguous reference to base members. */
3074 error ("request for member %qD is ambiguous in "
3075 "multiple inheritance lattice", id_expression
);
3076 print_candidates (decl
);
3077 return error_mark_node
;
3080 /* Mark variable-like entities as used. Functions are similarly
3081 marked either below or after overload resolution. */
3082 if (TREE_CODE (decl
) == VAR_DECL
3083 || TREE_CODE (decl
) == PARM_DECL
3084 || TREE_CODE (decl
) == RESULT_DECL
)
3089 decl
= (adjust_result_of_qualified_name_lookup
3090 (decl
, scope
, current_class_type
));
3092 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3095 if (TREE_CODE (decl
) == FIELD_DECL
|| BASELINK_P (decl
))
3096 decl
= finish_qualified_id_expr (scope
,
3104 tree r
= convert_from_reference (decl
);
3106 if (processing_template_decl
&& TYPE_P (scope
))
3107 r
= build_qualified_name (TREE_TYPE (r
),
3113 else if (TREE_CODE (decl
) == FIELD_DECL
)
3115 /* Since SCOPE is NULL here, this is an unqualified name.
3116 Access checking has been performed during name lookup
3117 already. Turn off checking to avoid duplicate errors. */
3118 push_deferring_access_checks (dk_no_check
);
3119 decl
= finish_non_static_data_member (decl
, NULL_TREE
,
3120 /*qualifying_scope=*/NULL_TREE
);
3121 pop_deferring_access_checks ();
3123 else if (is_overloaded_fn (decl
))
3128 if (TREE_CODE (first_fn
) == TEMPLATE_ID_EXPR
)
3129 first_fn
= TREE_OPERAND (first_fn
, 0);
3130 first_fn
= get_first_fn (first_fn
);
3131 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
3132 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
3134 if (!really_overloaded_fn (decl
))
3135 mark_used (first_fn
);
3138 && TREE_CODE (first_fn
) == FUNCTION_DECL
3139 && DECL_FUNCTION_MEMBER_P (first_fn
)
3140 && !shared_member_p (decl
))
3142 /* A set of member functions. */
3143 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3144 return finish_class_member_access_expr (decl
, id_expression
,
3145 /*template_p=*/false,
3146 tf_warning_or_error
);
3149 decl
= baselink_for_fns (decl
);
3153 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3154 && DECL_CLASS_SCOPE_P (decl
))
3156 tree context
= context_for_name_lookup (decl
);
3157 if (context
!= current_class_type
)
3159 tree path
= currently_open_derived_class (context
);
3160 perform_or_defer_access_check (TYPE_BINFO (path
),
3165 decl
= convert_from_reference (decl
);
3169 if (TREE_DEPRECATED (decl
))
3170 warn_deprecated_use (decl
, NULL_TREE
);
3175 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3176 use as a type-specifier. */
3179 finish_typeof (tree expr
)
3183 if (type_dependent_expression_p (expr
))
3185 type
= cxx_make_type (TYPEOF_TYPE
);
3186 TYPEOF_TYPE_EXPR (type
) = expr
;
3187 SET_TYPE_STRUCTURAL_EQUALITY (type
);
3192 type
= unlowered_expr_type (expr
);
3194 if (!type
|| type
== unknown_type_node
)
3196 error ("type of %qE is unknown", expr
);
3197 return error_mark_node
;
3203 /* Perform C++-specific checks for __builtin_offsetof before calling
3207 finish_offsetof (tree expr
)
3209 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
3211 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3212 TREE_OPERAND (expr
, 2));
3213 return error_mark_node
;
3215 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
3216 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
3217 || TREE_CODE (TREE_TYPE (expr
)) == UNKNOWN_TYPE
)
3219 if (TREE_CODE (expr
) == COMPONENT_REF
3220 || TREE_CODE (expr
) == COMPOUND_EXPR
)
3221 expr
= TREE_OPERAND (expr
, 1);
3222 error ("cannot apply %<offsetof%> to member function %qD", expr
);
3223 return error_mark_node
;
3225 if (TREE_CODE (expr
) == INDIRECT_REF
&& REFERENCE_REF_P (expr
))
3226 expr
= TREE_OPERAND (expr
, 0);
3227 return fold_offsetof (expr
, NULL_TREE
);
3230 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3231 function is broken out from the above for the benefit of the tree-ssa
3235 simplify_aggr_init_expr (tree
*tp
)
3237 tree aggr_init_expr
= *tp
;
3239 /* Form an appropriate CALL_EXPR. */
3240 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
3241 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
3242 tree type
= TREE_TYPE (slot
);
3245 enum style_t
{ ctor
, arg
, pcc
} style
;
3247 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
3249 #ifdef PCC_STATIC_STRUCT_RETURN
3255 gcc_assert (TREE_ADDRESSABLE (type
));
3259 call_expr
= build_call_array_loc (input_location
,
3260 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
3262 aggr_init_expr_nargs (aggr_init_expr
),
3263 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
3267 /* Replace the first argument to the ctor with the address of the
3269 cxx_mark_addressable (slot
);
3270 CALL_EXPR_ARG (call_expr
, 0) =
3271 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
3273 else if (style
== arg
)
3275 /* Just mark it addressable here, and leave the rest to
3276 expand_call{,_inline}. */
3277 cxx_mark_addressable (slot
);
3278 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
3279 call_expr
= build2 (MODIFY_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
3281 else if (style
== pcc
)
3283 /* If we're using the non-reentrant PCC calling convention, then we
3284 need to copy the returned value out of the static buffer into the
3286 push_deferring_access_checks (dk_no_check
);
3287 call_expr
= build_aggr_init (slot
, call_expr
,
3288 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
3289 tf_warning_or_error
);
3290 pop_deferring_access_checks ();
3291 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
3294 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
3296 tree init
= build_zero_init (type
, NULL_TREE
,
3297 /*static_storage_p=*/false);
3298 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
3299 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
3306 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3309 emit_associated_thunks (tree fn
)
3311 /* When we use vcall offsets, we emit thunks with the virtual
3312 functions to which they thunk. The whole point of vcall offsets
3313 is so that you can know statically the entire set of thunks that
3314 will ever be needed for a given virtual function, thereby
3315 enabling you to output all the thunks with the function itself. */
3316 if (DECL_VIRTUAL_P (fn
)
3317 /* Do not emit thunks for extern template instantiations. */
3318 && ! DECL_REALLY_EXTERN (fn
))
3322 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= TREE_CHAIN (thunk
))
3324 if (!THUNK_ALIAS (thunk
))
3326 use_thunk (thunk
, /*emit_p=*/1);
3327 if (DECL_RESULT_THUNK_P (thunk
))
3331 for (probe
= DECL_THUNKS (thunk
);
3332 probe
; probe
= TREE_CHAIN (probe
))
3333 use_thunk (probe
, /*emit_p=*/1);
3337 gcc_assert (!DECL_THUNKS (thunk
));
3342 /* Generate RTL for FN. */
3345 expand_or_defer_fn_1 (tree fn
)
3347 /* When the parser calls us after finishing the body of a template
3348 function, we don't really want to expand the body. */
3349 if (processing_template_decl
)
3351 /* Normally, collection only occurs in rest_of_compilation. So,
3352 if we don't collect here, we never collect junk generated
3353 during the processing of templates until we hit a
3354 non-template function. It's not safe to do this inside a
3355 nested class, though, as the parser may have local state that
3356 is not a GC root. */
3357 if (!function_depth
)
3362 gcc_assert (DECL_SAVED_TREE (fn
));
3364 /* If this is a constructor or destructor body, we have to clone
3366 if (maybe_clone_body (fn
))
3368 /* We don't want to process FN again, so pretend we've written
3369 it out, even though we haven't. */
3370 TREE_ASM_WRITTEN (fn
) = 1;
3371 DECL_SAVED_TREE (fn
) = NULL_TREE
;
3375 /* We make a decision about linkage for these functions at the end
3376 of the compilation. Until that point, we do not want the back
3377 end to output them -- but we do want it to see the bodies of
3378 these functions so that it can inline them as appropriate. */
3379 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
3381 if (DECL_INTERFACE_KNOWN (fn
))
3382 /* We've already made a decision as to how this function will
3386 DECL_EXTERNAL (fn
) = 1;
3387 DECL_NOT_REALLY_EXTERN (fn
) = 1;
3388 note_vague_linkage_fn (fn
);
3389 /* A non-template inline function with external linkage will
3390 always be COMDAT. As we must eventually determine the
3391 linkage of all functions, and as that causes writes to
3392 the data mapped in from the PCH file, it's advantageous
3393 to mark the functions at this point. */
3394 if (!DECL_IMPLICIT_INSTANTIATION (fn
))
3396 /* This function must have external linkage, as
3397 otherwise DECL_INTERFACE_KNOWN would have been
3399 gcc_assert (TREE_PUBLIC (fn
));
3400 comdat_linkage (fn
);
3401 DECL_INTERFACE_KNOWN (fn
) = 1;
3405 import_export_decl (fn
);
3407 /* If the user wants us to keep all inline functions, then mark
3408 this function as needed so that finish_file will make sure to
3409 output it later. Similarly, all dllexport'd functions must
3410 be emitted; there may be callers in other DLLs. */
3411 if ((flag_keep_inline_functions
3412 && DECL_DECLARED_INLINE_P (fn
)
3413 && !DECL_REALLY_EXTERN (fn
))
3414 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
)))
3418 /* There's no reason to do any of the work here if we're only doing
3419 semantic analysis; this code just generates RTL. */
3420 if (flag_syntax_only
)
3427 expand_or_defer_fn (tree fn
)
3429 if (expand_or_defer_fn_1 (fn
))
3433 /* Expand or defer, at the whim of the compilation unit manager. */
3434 cgraph_finalize_function (fn
, function_depth
> 1);
3435 emit_associated_thunks (fn
);
3448 /* Helper function for walk_tree, used by finalize_nrv below. */
3451 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
3453 struct nrv_data
*dp
= (struct nrv_data
*)data
;
3456 /* No need to walk into types. There wouldn't be any need to walk into
3457 non-statements, except that we have to consider STMT_EXPRs. */
3460 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3461 but differs from using NULL_TREE in that it indicates that we care
3462 about the value of the RESULT_DECL. */
3463 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
3464 TREE_OPERAND (*tp
, 0) = dp
->result
;
3465 /* Change all cleanups for the NRV to only run when an exception is
3467 else if (TREE_CODE (*tp
) == CLEANUP_STMT
3468 && CLEANUP_DECL (*tp
) == dp
->var
)
3469 CLEANUP_EH_ONLY (*tp
) = 1;
3470 /* Replace the DECL_EXPR for the NRV with an initialization of the
3471 RESULT_DECL, if needed. */
3472 else if (TREE_CODE (*tp
) == DECL_EXPR
3473 && DECL_EXPR_DECL (*tp
) == dp
->var
)
3476 if (DECL_INITIAL (dp
->var
)
3477 && DECL_INITIAL (dp
->var
) != error_mark_node
)
3478 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
3479 DECL_INITIAL (dp
->var
));
3481 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
3482 DECL_INITIAL (dp
->var
) = NULL_TREE
;
3483 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
3486 /* And replace all uses of the NRV with the RESULT_DECL. */
3487 else if (*tp
== dp
->var
)
3490 /* Avoid walking into the same tree more than once. Unfortunately, we
3491 can't just use walk_tree_without duplicates because it would only call
3492 us for the first occurrence of dp->var in the function body. */
3493 slot
= htab_find_slot (dp
->visited
, *tp
, INSERT
);
3499 /* Keep iterating. */
3503 /* Called from finish_function to implement the named return value
3504 optimization by overriding all the RETURN_EXPRs and pertinent
3505 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3506 RESULT_DECL for the function. */
3509 finalize_nrv (tree
*tp
, tree var
, tree result
)
3511 struct nrv_data data
;
3513 /* Copy debugging information from VAR to RESULT. */
3514 DECL_NAME (result
) = DECL_NAME (var
);
3515 DECL_ARTIFICIAL (result
) = DECL_ARTIFICIAL (var
);
3516 DECL_IGNORED_P (result
) = DECL_IGNORED_P (var
);
3517 DECL_SOURCE_LOCATION (result
) = DECL_SOURCE_LOCATION (var
);
3518 DECL_ABSTRACT_ORIGIN (result
) = DECL_ABSTRACT_ORIGIN (var
);
3519 /* Don't forget that we take its address. */
3520 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
3523 data
.result
= result
;
3524 data
.visited
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
3525 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
3526 htab_delete (data
.visited
);
3529 /* Return the declaration for the function called by CALL_EXPR T,
3530 TYPE is the class type of the clause decl. */
3533 omp_clause_info_fndecl (tree t
, tree type
)
3535 tree ret
= get_callee_fndecl (t
);
3540 gcc_assert (TREE_CODE (t
) == CALL_EXPR
);
3541 t
= CALL_EXPR_FN (t
);
3543 if (TREE_CODE (t
) == OBJ_TYPE_REF
)
3545 t
= cp_fold_obj_type_ref (t
, type
);
3546 if (TREE_CODE (t
) == ADDR_EXPR
3547 && TREE_CODE (TREE_OPERAND (t
, 0)) == FUNCTION_DECL
)
3548 return TREE_OPERAND (t
, 0);
3554 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3557 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
3558 bool need_copy_ctor
, bool need_copy_assignment
)
3560 int save_errorcount
= errorcount
;
3563 /* Always allocate 3 elements for simplicity. These are the
3564 function decls for the ctor, dtor, and assignment op.
3565 This layout is known to the three lang hooks,
3566 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3567 and cxx_omp_clause_assign_op. */
3568 info
= make_tree_vec (3);
3569 CP_OMP_CLAUSE_INFO (c
) = info
;
3571 if (need_default_ctor
3572 || (need_copy_ctor
&& !TYPE_HAS_TRIVIAL_INIT_REF (type
)))
3576 if (need_default_ctor
)
3580 t
= build_int_cst (build_pointer_type (type
), 0);
3581 t
= build1 (INDIRECT_REF
, type
, t
);
3582 vec
= make_tree_vector_single (t
);
3584 t
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
3585 &vec
, type
, LOOKUP_NORMAL
,
3586 tf_warning_or_error
);
3589 release_tree_vector (vec
);
3591 if (targetm
.cxx
.cdtor_returns_this () || errorcount
)
3592 /* Because constructors and destructors return this,
3593 the call will have been cast to "void". Remove the
3594 cast here. We would like to use STRIP_NOPS, but it
3595 wouldn't work here because TYPE_MODE (t) and
3596 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3597 They are VOIDmode and Pmode, respectively. */
3598 if (TREE_CODE (t
) == NOP_EXPR
)
3599 t
= TREE_OPERAND (t
, 0);
3601 TREE_VEC_ELT (info
, 0) = get_callee_fndecl (t
);
3604 if ((need_default_ctor
|| need_copy_ctor
)
3605 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3607 t
= build_int_cst (build_pointer_type (type
), 0);
3608 t
= build1 (INDIRECT_REF
, type
, t
);
3609 t
= build_special_member_call (t
, complete_dtor_identifier
,
3610 NULL
, type
, LOOKUP_NORMAL
,
3611 tf_warning_or_error
);
3613 if (targetm
.cxx
.cdtor_returns_this () || errorcount
)
3614 /* Because constructors and destructors return this,
3615 the call will have been cast to "void". Remove the
3616 cast here. We would like to use STRIP_NOPS, but it
3617 wouldn't work here because TYPE_MODE (t) and
3618 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3619 They are VOIDmode and Pmode, respectively. */
3620 if (TREE_CODE (t
) == NOP_EXPR
)
3621 t
= TREE_OPERAND (t
, 0);
3623 TREE_VEC_ELT (info
, 1) = omp_clause_info_fndecl (t
, type
);
3626 if (need_copy_assignment
&& !TYPE_HAS_TRIVIAL_ASSIGN_REF (type
))
3630 t
= build_int_cst (build_pointer_type (type
), 0);
3631 t
= build1 (INDIRECT_REF
, type
, t
);
3632 vec
= make_tree_vector_single (t
);
3633 t
= build_special_member_call (t
, ansi_assopname (NOP_EXPR
),
3634 &vec
, type
, LOOKUP_NORMAL
,
3635 tf_warning_or_error
);
3636 release_tree_vector (vec
);
3638 /* We'll have called convert_from_reference on the call, which
3639 may well have added an indirect_ref. It's unneeded here,
3640 and in the way, so kill it. */
3641 if (TREE_CODE (t
) == INDIRECT_REF
)
3642 t
= TREE_OPERAND (t
, 0);
3644 TREE_VEC_ELT (info
, 2) = omp_clause_info_fndecl (t
, type
);
3647 return errorcount
!= save_errorcount
;
3650 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3651 Remove any elements from the list that are invalid. */
3654 finish_omp_clauses (tree clauses
)
3656 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
3657 tree c
, t
, *pc
= &clauses
;
3660 bitmap_obstack_initialize (NULL
);
3661 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
3662 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
3663 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
3665 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3667 bool remove
= false;
3669 switch (OMP_CLAUSE_CODE (c
))
3671 case OMP_CLAUSE_SHARED
:
3673 goto check_dup_generic
;
3674 case OMP_CLAUSE_PRIVATE
:
3676 goto check_dup_generic
;
3677 case OMP_CLAUSE_REDUCTION
:
3679 goto check_dup_generic
;
3680 case OMP_CLAUSE_COPYPRIVATE
:
3681 name
= "copyprivate";
3682 goto check_dup_generic
;
3683 case OMP_CLAUSE_COPYIN
:
3685 goto check_dup_generic
;
3687 t
= OMP_CLAUSE_DECL (c
);
3688 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3690 if (processing_template_decl
)
3693 error ("%qD is not a variable in clause %qs", t
, name
);
3695 error ("%qE is not a variable in clause %qs", t
, name
);
3698 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3699 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
3700 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
3702 error ("%qD appears more than once in data clauses", t
);
3706 bitmap_set_bit (&generic_head
, DECL_UID (t
));
3709 case OMP_CLAUSE_FIRSTPRIVATE
:
3710 t
= OMP_CLAUSE_DECL (c
);
3711 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3713 if (processing_template_decl
)
3716 error ("%qD is not a variable in clause %<firstprivate%>", t
);
3718 error ("%qE is not a variable in clause %<firstprivate%>", t
);
3721 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3722 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
3724 error ("%qD appears more than once in data clauses", t
);
3728 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
3731 case OMP_CLAUSE_LASTPRIVATE
:
3732 t
= OMP_CLAUSE_DECL (c
);
3733 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3735 if (processing_template_decl
)
3738 error ("%qD is not a variable in clause %<lastprivate%>", t
);
3740 error ("%qE is not a variable in clause %<lastprivate%>", t
);
3743 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3744 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
3746 error ("%qD appears more than once in data clauses", t
);
3750 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
3754 t
= OMP_CLAUSE_IF_EXPR (c
);
3755 t
= maybe_convert_cond (t
);
3756 if (t
== error_mark_node
)
3758 OMP_CLAUSE_IF_EXPR (c
) = t
;
3761 case OMP_CLAUSE_NUM_THREADS
:
3762 t
= OMP_CLAUSE_NUM_THREADS_EXPR (c
);
3763 if (t
== error_mark_node
)
3765 else if (!type_dependent_expression_p (t
)
3766 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
3768 error ("num_threads expression must be integral");
3773 case OMP_CLAUSE_SCHEDULE
:
3774 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
3777 else if (t
== error_mark_node
)
3779 else if (!type_dependent_expression_p (t
)
3780 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
3782 error ("schedule chunk size expression must be integral");
3787 case OMP_CLAUSE_NOWAIT
:
3788 case OMP_CLAUSE_ORDERED
:
3789 case OMP_CLAUSE_DEFAULT
:
3790 case OMP_CLAUSE_UNTIED
:
3791 case OMP_CLAUSE_COLLAPSE
:
3799 *pc
= OMP_CLAUSE_CHAIN (c
);
3801 pc
= &OMP_CLAUSE_CHAIN (c
);
3804 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3806 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
3807 bool remove
= false;
3808 bool need_complete_non_reference
= false;
3809 bool need_default_ctor
= false;
3810 bool need_copy_ctor
= false;
3811 bool need_copy_assignment
= false;
3812 bool need_implicitly_determined
= false;
3813 tree type
, inner_type
;
3817 case OMP_CLAUSE_SHARED
:
3819 need_implicitly_determined
= true;
3821 case OMP_CLAUSE_PRIVATE
:
3823 need_complete_non_reference
= true;
3824 need_default_ctor
= true;
3825 need_implicitly_determined
= true;
3827 case OMP_CLAUSE_FIRSTPRIVATE
:
3828 name
= "firstprivate";
3829 need_complete_non_reference
= true;
3830 need_copy_ctor
= true;
3831 need_implicitly_determined
= true;
3833 case OMP_CLAUSE_LASTPRIVATE
:
3834 name
= "lastprivate";
3835 need_complete_non_reference
= true;
3836 need_copy_assignment
= true;
3837 need_implicitly_determined
= true;
3839 case OMP_CLAUSE_REDUCTION
:
3841 need_implicitly_determined
= true;
3843 case OMP_CLAUSE_COPYPRIVATE
:
3844 name
= "copyprivate";
3845 need_copy_assignment
= true;
3847 case OMP_CLAUSE_COPYIN
:
3849 need_copy_assignment
= true;
3852 pc
= &OMP_CLAUSE_CHAIN (c
);
3856 t
= OMP_CLAUSE_DECL (c
);
3857 if (processing_template_decl
3858 && TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3860 pc
= &OMP_CLAUSE_CHAIN (c
);
3866 case OMP_CLAUSE_LASTPRIVATE
:
3867 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
3868 need_default_ctor
= true;
3871 case OMP_CLAUSE_REDUCTION
:
3872 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
3873 || POINTER_TYPE_P (TREE_TYPE (t
)))
3875 error ("%qE has invalid type for %<reduction%>", t
);
3878 else if (FLOAT_TYPE_P (TREE_TYPE (t
)))
3880 enum tree_code r_code
= OMP_CLAUSE_REDUCTION_CODE (c
);
3888 error ("%qE has invalid type for %<reduction(%s)%>",
3889 t
, operator_name_info
[r_code
].name
);
3895 case OMP_CLAUSE_COPYIN
:
3896 if (TREE_CODE (t
) != VAR_DECL
|| !DECL_THREAD_LOCAL_P (t
))
3898 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
3907 if (need_complete_non_reference
)
3909 t
= require_complete_type (t
);
3910 if (t
== error_mark_node
)
3912 else if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
3914 error ("%qE has reference type for %qs", t
, name
);
3918 if (need_implicitly_determined
)
3920 const char *share_name
= NULL
;
3922 if (TREE_CODE (t
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (t
))
3923 share_name
= "threadprivate";
3924 else switch (cxx_omp_predetermined_sharing (t
))
3926 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
3928 case OMP_CLAUSE_DEFAULT_SHARED
:
3929 share_name
= "shared";
3931 case OMP_CLAUSE_DEFAULT_PRIVATE
:
3932 share_name
= "private";
3939 error ("%qE is predetermined %qs for %qs",
3940 t
, share_name
, name
);
3945 /* We're interested in the base element, not arrays. */
3946 inner_type
= type
= TREE_TYPE (t
);
3947 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
3948 inner_type
= TREE_TYPE (inner_type
);
3950 /* Check for special function availability by building a call to one.
3951 Save the results, because later we won't be in the right context
3952 for making these queries. */
3953 if (CLASS_TYPE_P (inner_type
)
3954 && (need_default_ctor
|| need_copy_ctor
|| need_copy_assignment
)
3955 && !type_dependent_expression_p (t
)
3956 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
3957 need_copy_ctor
, need_copy_assignment
))
3961 *pc
= OMP_CLAUSE_CHAIN (c
);
3963 pc
= &OMP_CLAUSE_CHAIN (c
);
3966 bitmap_obstack_release (NULL
);
3970 /* For all variables in the tree_list VARS, mark them as thread local. */
3973 finish_omp_threadprivate (tree vars
)
3977 /* Mark every variable in VARS to be assigned thread local storage. */
3978 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
3980 tree v
= TREE_PURPOSE (t
);
3982 if (error_operand_p (v
))
3984 else if (TREE_CODE (v
) != VAR_DECL
)
3985 error ("%<threadprivate%> %qD is not file, namespace "
3986 "or block scope variable", v
);
3987 /* If V had already been marked threadprivate, it doesn't matter
3988 whether it had been used prior to this point. */
3989 else if (TREE_USED (v
)
3990 && (DECL_LANG_SPECIFIC (v
) == NULL
3991 || !CP_DECL_THREADPRIVATE_P (v
)))
3992 error ("%qE declared %<threadprivate%> after first use", v
);
3993 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
3994 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
3995 else if (! COMPLETE_TYPE_P (TREE_TYPE (v
)))
3996 error ("%<threadprivate%> %qE has incomplete type", v
);
3997 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
3998 && CP_DECL_CONTEXT (v
) != current_class_type
)
3999 error ("%<threadprivate%> %qE directive not "
4000 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
4003 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4004 if (DECL_LANG_SPECIFIC (v
) == NULL
)
4006 retrofit_lang_decl (v
);
4008 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4009 after the allocation of the lang_decl structure. */
4010 if (DECL_DISCRIMINATOR_P (v
))
4011 DECL_LANG_SPECIFIC (v
)->u
.base
.u2sel
= 1;
4014 if (! DECL_THREAD_LOCAL_P (v
))
4016 DECL_TLS_MODEL (v
) = decl_default_tls_model (v
);
4017 /* If rtl has been already set for this var, call
4018 make_decl_rtl once again, so that encode_section_info
4019 has a chance to look at the new decl flags. */
4020 if (DECL_RTL_SET_P (v
))
4023 CP_DECL_THREADPRIVATE_P (v
) = 1;
4028 /* Build an OpenMP structured block. */
4031 begin_omp_structured_block (void)
4033 return do_pushlevel (sk_omp
);
4037 finish_omp_structured_block (tree block
)
4039 return do_poplevel (block
);
4042 /* Similarly, except force the retention of the BLOCK. */
4045 begin_omp_parallel (void)
4047 keep_next_level (true);
4048 return begin_omp_structured_block ();
4052 finish_omp_parallel (tree clauses
, tree body
)
4056 body
= finish_omp_structured_block (body
);
4058 stmt
= make_node (OMP_PARALLEL
);
4059 TREE_TYPE (stmt
) = void_type_node
;
4060 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
4061 OMP_PARALLEL_BODY (stmt
) = body
;
4063 return add_stmt (stmt
);
4067 begin_omp_task (void)
4069 keep_next_level (true);
4070 return begin_omp_structured_block ();
4074 finish_omp_task (tree clauses
, tree body
)
4078 body
= finish_omp_structured_block (body
);
4080 stmt
= make_node (OMP_TASK
);
4081 TREE_TYPE (stmt
) = void_type_node
;
4082 OMP_TASK_CLAUSES (stmt
) = clauses
;
4083 OMP_TASK_BODY (stmt
) = body
;
4085 return add_stmt (stmt
);
4088 /* Helper function for finish_omp_for. Convert Ith random access iterator
4089 into integral iterator. Return FALSE if successful. */
4092 handle_omp_for_class_iterator (int i
, location_t locus
, tree declv
, tree initv
,
4093 tree condv
, tree incrv
, tree
*body
,
4094 tree
*pre_body
, tree clauses
)
4096 tree diff
, iter_init
, iter_incr
= NULL
, last
;
4097 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
4098 tree decl
= TREE_VEC_ELT (declv
, i
);
4099 tree init
= TREE_VEC_ELT (initv
, i
);
4100 tree cond
= TREE_VEC_ELT (condv
, i
);
4101 tree incr
= TREE_VEC_ELT (incrv
, i
);
4103 location_t elocus
= locus
;
4105 if (init
&& EXPR_HAS_LOCATION (init
))
4106 elocus
= EXPR_LOCATION (init
);
4108 switch (TREE_CODE (cond
))
4114 if (TREE_OPERAND (cond
, 1) == iter
)
4115 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
4116 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
4117 if (TREE_OPERAND (cond
, 0) != iter
)
4118 cond
= error_mark_node
;
4121 tree tem
= build_x_binary_op (TREE_CODE (cond
), iter
, ERROR_MARK
,
4122 TREE_OPERAND (cond
, 1), ERROR_MARK
,
4123 NULL
, tf_warning_or_error
);
4124 if (error_operand_p (tem
))
4129 cond
= error_mark_node
;
4132 if (cond
== error_mark_node
)
4134 error_at (elocus
, "invalid controlling predicate");
4137 diff
= build_x_binary_op (MINUS_EXPR
, TREE_OPERAND (cond
, 1),
4138 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
4139 tf_warning_or_error
);
4140 if (error_operand_p (diff
))
4142 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
4144 error_at (elocus
, "difference between %qE and %qD does not have integer type",
4145 TREE_OPERAND (cond
, 1), iter
);
4149 switch (TREE_CODE (incr
))
4151 case PREINCREMENT_EXPR
:
4152 case PREDECREMENT_EXPR
:
4153 case POSTINCREMENT_EXPR
:
4154 case POSTDECREMENT_EXPR
:
4155 if (TREE_OPERAND (incr
, 0) != iter
)
4157 incr
= error_mark_node
;
4160 iter_incr
= build_x_unary_op (TREE_CODE (incr
), iter
,
4161 tf_warning_or_error
);
4162 if (error_operand_p (iter_incr
))
4164 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
4165 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
4166 incr
= integer_one_node
;
4168 incr
= integer_minus_one_node
;
4171 if (TREE_OPERAND (incr
, 0) != iter
)
4172 incr
= error_mark_node
;
4173 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
4174 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
4176 tree rhs
= TREE_OPERAND (incr
, 1);
4177 if (TREE_OPERAND (rhs
, 0) == iter
)
4179 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
4181 incr
= error_mark_node
;
4184 iter_incr
= build_x_modify_expr (iter
, TREE_CODE (rhs
),
4185 TREE_OPERAND (rhs
, 1),
4186 tf_warning_or_error
);
4187 if (error_operand_p (iter_incr
))
4189 incr
= TREE_OPERAND (rhs
, 1);
4190 incr
= cp_convert (TREE_TYPE (diff
), incr
);
4191 if (TREE_CODE (rhs
) == MINUS_EXPR
)
4193 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
4194 incr
= fold_if_not_in_template (incr
);
4196 if (TREE_CODE (incr
) != INTEGER_CST
4197 && (TREE_CODE (incr
) != NOP_EXPR
4198 || (TREE_CODE (TREE_OPERAND (incr
, 0))
4203 else if (TREE_OPERAND (rhs
, 1) == iter
)
4205 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
4206 || TREE_CODE (rhs
) != PLUS_EXPR
)
4207 incr
= error_mark_node
;
4210 iter_incr
= build_x_binary_op (PLUS_EXPR
,
4211 TREE_OPERAND (rhs
, 0),
4214 tf_warning_or_error
);
4215 if (error_operand_p (iter_incr
))
4217 iter_incr
= build_x_modify_expr (iter
, NOP_EXPR
,
4219 tf_warning_or_error
);
4220 if (error_operand_p (iter_incr
))
4222 incr
= TREE_OPERAND (rhs
, 0);
4227 incr
= error_mark_node
;
4230 incr
= error_mark_node
;
4233 incr
= error_mark_node
;
4237 if (incr
== error_mark_node
)
4239 error_at (elocus
, "invalid increment expression");
4243 incr
= cp_convert (TREE_TYPE (diff
), incr
);
4244 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
4245 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
4246 && OMP_CLAUSE_DECL (c
) == iter
)
4249 decl
= create_temporary_var (TREE_TYPE (diff
));
4251 add_decl_expr (decl
);
4252 last
= create_temporary_var (TREE_TYPE (diff
));
4254 add_decl_expr (last
);
4255 if (c
&& iter_incr
== NULL
)
4257 incr_var
= create_temporary_var (TREE_TYPE (diff
));
4258 pushdecl (incr_var
);
4259 add_decl_expr (incr_var
);
4261 gcc_assert (stmts_are_full_exprs_p ());
4263 orig_pre_body
= *pre_body
;
4264 *pre_body
= push_stmt_list ();
4266 add_stmt (orig_pre_body
);
4268 finish_expr_stmt (build_x_modify_expr (iter
, NOP_EXPR
, init
,
4269 tf_warning_or_error
));
4270 init
= build_int_cst (TREE_TYPE (diff
), 0);
4271 if (c
&& iter_incr
== NULL
)
4273 finish_expr_stmt (build_x_modify_expr (incr_var
, NOP_EXPR
,
4274 incr
, tf_warning_or_error
));
4276 iter_incr
= build_x_modify_expr (iter
, PLUS_EXPR
, incr
,
4277 tf_warning_or_error
);
4279 finish_expr_stmt (build_x_modify_expr (last
, NOP_EXPR
, init
,
4280 tf_warning_or_error
));
4281 *pre_body
= pop_stmt_list (*pre_body
);
4283 cond
= cp_build_binary_op (elocus
,
4284 TREE_CODE (cond
), decl
, diff
,
4285 tf_warning_or_error
);
4286 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
4287 elocus
, incr
, NULL_TREE
);
4290 *body
= push_stmt_list ();
4291 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
4292 iter_init
= build_x_modify_expr (iter
, PLUS_EXPR
, iter_init
,
4293 tf_warning_or_error
);
4294 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
4295 finish_expr_stmt (iter_init
);
4296 finish_expr_stmt (build_x_modify_expr (last
, NOP_EXPR
, decl
,
4297 tf_warning_or_error
));
4298 add_stmt (orig_body
);
4299 *body
= pop_stmt_list (*body
);
4303 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
4304 finish_expr_stmt (iter_incr
);
4305 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
4306 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
4309 TREE_VEC_ELT (declv
, i
) = decl
;
4310 TREE_VEC_ELT (initv
, i
) = init
;
4311 TREE_VEC_ELT (condv
, i
) = cond
;
4312 TREE_VEC_ELT (incrv
, i
) = incr
;
4317 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4318 are directly for their associated operands in the statement. DECL
4319 and INIT are a combo; if DECL is NULL then INIT ought to be a
4320 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4321 optional statements that need to go before the loop into its
4325 finish_omp_for (location_t locus
, tree declv
, tree initv
, tree condv
,
4326 tree incrv
, tree body
, tree pre_body
, tree clauses
)
4328 tree omp_for
= NULL
, orig_incr
= NULL
;
4329 tree decl
, init
, cond
, incr
;
4333 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
4334 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
4335 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
4336 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4338 decl
= TREE_VEC_ELT (declv
, i
);
4339 init
= TREE_VEC_ELT (initv
, i
);
4340 cond
= TREE_VEC_ELT (condv
, i
);
4341 incr
= TREE_VEC_ELT (incrv
, i
);
4347 switch (TREE_CODE (init
))
4350 decl
= TREE_OPERAND (init
, 0);
4351 init
= TREE_OPERAND (init
, 1);
4354 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
4356 decl
= TREE_OPERAND (init
, 0);
4357 init
= TREE_OPERAND (init
, 2);
4367 "expected iteration declaration or initialization");
4372 if (init
&& EXPR_HAS_LOCATION (init
))
4373 elocus
= EXPR_LOCATION (init
);
4377 error_at (elocus
, "missing controlling predicate");
4383 error_at (elocus
, "missing increment expression");
4387 TREE_VEC_ELT (declv
, i
) = decl
;
4388 TREE_VEC_ELT (initv
, i
) = init
;
4391 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
4395 stmt
= make_node (OMP_FOR
);
4397 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4399 /* This is really just a place-holder. We'll be decomposing this
4400 again and going through the cp_build_modify_expr path below when
4401 we instantiate the thing. */
4402 TREE_VEC_ELT (initv
, i
)
4403 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
4404 TREE_VEC_ELT (initv
, i
));
4407 TREE_TYPE (stmt
) = void_type_node
;
4408 OMP_FOR_INIT (stmt
) = initv
;
4409 OMP_FOR_COND (stmt
) = condv
;
4410 OMP_FOR_INCR (stmt
) = incrv
;
4411 OMP_FOR_BODY (stmt
) = body
;
4412 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
4413 OMP_FOR_CLAUSES (stmt
) = clauses
;
4415 SET_EXPR_LOCATION (stmt
, locus
);
4416 return add_stmt (stmt
);
4419 if (processing_template_decl
)
4420 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
4422 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
4424 decl
= TREE_VEC_ELT (declv
, i
);
4425 init
= TREE_VEC_ELT (initv
, i
);
4426 cond
= TREE_VEC_ELT (condv
, i
);
4427 incr
= TREE_VEC_ELT (incrv
, i
);
4429 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4432 if (init
&& EXPR_HAS_LOCATION (init
))
4433 elocus
= EXPR_LOCATION (init
);
4437 error_at (elocus
, "expected iteration declaration or initialization");
4441 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
4444 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4445 incr
= cp_build_modify_expr (TREE_OPERAND (incr
, 0),
4446 TREE_CODE (TREE_OPERAND (incr
, 1)),
4447 TREE_OPERAND (incr
, 2),
4448 tf_warning_or_error
);
4451 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
4453 if (handle_omp_for_class_iterator (i
, locus
, declv
, initv
, condv
,
4454 incrv
, &body
, &pre_body
, clauses
))
4459 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
4460 && TREE_CODE (TREE_TYPE (decl
)) != POINTER_TYPE
)
4462 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
4466 if (!processing_template_decl
)
4468 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
4469 init
= cp_build_modify_expr (decl
, NOP_EXPR
, init
, tf_warning_or_error
);
4472 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
4474 && TREE_SIDE_EFFECTS (cond
)
4475 && COMPARISON_CLASS_P (cond
)
4476 && !processing_template_decl
)
4478 tree t
= TREE_OPERAND (cond
, 0);
4479 if (TREE_SIDE_EFFECTS (t
)
4481 && (TREE_CODE (t
) != NOP_EXPR
4482 || TREE_OPERAND (t
, 0) != decl
))
4483 TREE_OPERAND (cond
, 0)
4484 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4486 t
= TREE_OPERAND (cond
, 1);
4487 if (TREE_SIDE_EFFECTS (t
)
4489 && (TREE_CODE (t
) != NOP_EXPR
4490 || TREE_OPERAND (t
, 0) != decl
))
4491 TREE_OPERAND (cond
, 1)
4492 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4494 if (decl
== error_mark_node
|| init
== error_mark_node
)
4497 TREE_VEC_ELT (declv
, i
) = decl
;
4498 TREE_VEC_ELT (initv
, i
) = init
;
4499 TREE_VEC_ELT (condv
, i
) = cond
;
4500 TREE_VEC_ELT (incrv
, i
) = incr
;
4504 if (IS_EMPTY_STMT (pre_body
))
4507 omp_for
= c_finish_omp_for (locus
, declv
, initv
, condv
, incrv
,
4510 if (omp_for
== NULL
)
4513 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
4515 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
4516 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
4518 if (TREE_CODE (incr
) != MODIFY_EXPR
)
4521 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
4522 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
4523 && !processing_template_decl
)
4525 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
4526 if (TREE_SIDE_EFFECTS (t
)
4528 && (TREE_CODE (t
) != NOP_EXPR
4529 || TREE_OPERAND (t
, 0) != decl
))
4530 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
4531 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4533 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
4534 if (TREE_SIDE_EFFECTS (t
)
4536 && (TREE_CODE (t
) != NOP_EXPR
4537 || TREE_OPERAND (t
, 0) != decl
))
4538 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
4539 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4543 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
4545 if (omp_for
!= NULL
)
4546 OMP_FOR_CLAUSES (omp_for
) = clauses
;
4551 finish_omp_atomic (enum tree_code code
, tree lhs
, tree rhs
)
4560 dependent_p
= false;
4563 /* Even in a template, we can detect invalid uses of the atomic
4564 pragma if neither LHS nor RHS is type-dependent. */
4565 if (processing_template_decl
)
4567 dependent_p
= (type_dependent_expression_p (lhs
)
4568 || type_dependent_expression_p (rhs
));
4571 lhs
= build_non_dependent_expr (lhs
);
4572 rhs
= build_non_dependent_expr (rhs
);
4577 stmt
= c_finish_omp_atomic (input_location
, code
, lhs
, rhs
);
4578 if (stmt
== error_mark_node
)
4581 if (processing_template_decl
)
4582 stmt
= build2 (OMP_ATOMIC
, void_type_node
, integer_zero_node
,
4583 build2 (code
, void_type_node
, orig_lhs
, orig_rhs
));
4588 finish_omp_barrier (void)
4590 tree fn
= built_in_decls
[BUILT_IN_GOMP_BARRIER
];
4591 VEC(tree
,gc
) *vec
= make_tree_vector ();
4592 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4593 release_tree_vector (vec
);
4594 finish_expr_stmt (stmt
);
4598 finish_omp_flush (void)
4600 tree fn
= built_in_decls
[BUILT_IN_SYNCHRONIZE
];
4601 VEC(tree
,gc
) *vec
= make_tree_vector ();
4602 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4603 release_tree_vector (vec
);
4604 finish_expr_stmt (stmt
);
4608 finish_omp_taskwait (void)
4610 tree fn
= built_in_decls
[BUILT_IN_GOMP_TASKWAIT
];
4611 VEC(tree
,gc
) *vec
= make_tree_vector ();
4612 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4613 release_tree_vector (vec
);
4614 finish_expr_stmt (stmt
);
4618 init_cp_semantics (void)
4622 /* Build a STATIC_ASSERT for a static assertion with the condition
4623 CONDITION and the message text MESSAGE. LOCATION is the location
4624 of the static assertion in the source code. When MEMBER_P, this
4625 static assertion is a member of a class. */
4627 finish_static_assert (tree condition
, tree message
, location_t location
,
4630 if (check_for_bare_parameter_packs (condition
))
4631 condition
= error_mark_node
;
4633 if (type_dependent_expression_p (condition
)
4634 || value_dependent_expression_p (condition
))
4636 /* We're in a template; build a STATIC_ASSERT and put it in
4640 assertion
= make_node (STATIC_ASSERT
);
4641 STATIC_ASSERT_CONDITION (assertion
) = condition
;
4642 STATIC_ASSERT_MESSAGE (assertion
) = message
;
4643 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
4646 maybe_add_class_template_decl_list (current_class_type
,
4650 add_stmt (assertion
);
4655 /* Fold the expression and convert it to a boolean value. */
4656 condition
= fold_non_dependent_expr (condition
);
4657 condition
= cp_convert (boolean_type_node
, condition
);
4659 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
4660 /* Do nothing; the condition is satisfied. */
4664 location_t saved_loc
= input_location
;
4666 input_location
= location
;
4667 if (TREE_CODE (condition
) == INTEGER_CST
4668 && integer_zerop (condition
))
4669 /* Report the error. */
4670 error ("static assertion failed: %E", message
);
4671 else if (condition
&& condition
!= error_mark_node
)
4672 error ("non-constant condition for static assertion");
4673 input_location
= saved_loc
;
4677 /* Returns the type of EXPR for cases where we can determine it even though
4678 EXPR is a type-dependent expression. */
4681 describable_type (tree expr
)
4683 tree type
= NULL_TREE
;
4685 if (! type_dependent_expression_p (expr
)
4686 && ! type_unknown_p (expr
))
4688 type
= unlowered_expr_type (expr
);
4689 if (real_lvalue_p (expr
))
4690 type
= build_reference_type (type
);
4696 switch (TREE_CODE (expr
))
4702 return TREE_TYPE (expr
);
4707 case TEMPLATE_PARM_INDEX
:
4709 case STATIC_CAST_EXPR
:
4710 case REINTERPRET_CAST_EXPR
:
4711 case CONST_CAST_EXPR
:
4712 case DYNAMIC_CAST_EXPR
:
4713 type
= TREE_TYPE (expr
);
4718 tree ptrtype
= describable_type (TREE_OPERAND (expr
, 0));
4719 if (ptrtype
&& POINTER_TYPE_P (ptrtype
))
4720 type
= build_reference_type (TREE_TYPE (ptrtype
));
4725 if (TREE_CODE_CLASS (TREE_CODE (expr
)) == tcc_constant
)
4726 type
= TREE_TYPE (expr
);
4730 if (type
&& type_uses_auto (type
))
4736 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4737 suitable for use as a type-specifier.
4739 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4740 id-expression or a class member access, FALSE when it was parsed as
4741 a full expression. */
4744 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
)
4746 tree orig_expr
= expr
;
4747 tree type
= NULL_TREE
;
4749 if (!expr
|| error_operand_p (expr
))
4750 return error_mark_node
;
4753 || TREE_CODE (expr
) == TYPE_DECL
4754 || (TREE_CODE (expr
) == BIT_NOT_EXPR
4755 && TYPE_P (TREE_OPERAND (expr
, 0))))
4757 error ("argument to decltype must be an expression");
4758 return error_mark_node
;
4761 if (type_dependent_expression_p (expr
)
4762 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
4763 if it isn't dependent, so that we can check access control at
4764 instantiation time, so defer the decltype as well (PR 42277). */
4765 || (id_expression_or_member_access_p
4766 && processing_template_decl
4767 && TREE_CODE (expr
) == COMPONENT_REF
))
4769 if (id_expression_or_member_access_p
)
4771 switch (TREE_CODE (expr
))
4778 case TEMPLATE_PARM_INDEX
:
4779 type
= TREE_TYPE (expr
);
4787 if (type
&& !type_uses_auto (type
))
4791 type
= cxx_make_type (DECLTYPE_TYPE
);
4792 DECLTYPE_TYPE_EXPR (type
) = expr
;
4793 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
4794 = id_expression_or_member_access_p
;
4795 SET_TYPE_STRUCTURAL_EQUALITY (type
);
4800 /* The type denoted by decltype(e) is defined as follows: */
4802 expr
= resolve_nondeduced_context (expr
);
4804 /* To get the size of a static data member declared as an array of
4805 unknown bound, we need to instantiate it. */
4806 if (TREE_CODE (expr
) == VAR_DECL
4807 && VAR_HAD_UNKNOWN_BOUND (expr
)
4808 && DECL_TEMPLATE_INSTANTIATION (expr
))
4809 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
4811 if (id_expression_or_member_access_p
)
4813 /* If e is an id-expression or a class member access (5.2.5
4814 [expr.ref]), decltype(e) is defined as the type of the entity
4815 named by e. If there is no such entity, or e names a set of
4816 overloaded functions, the program is ill-formed. */
4817 if (TREE_CODE (expr
) == IDENTIFIER_NODE
)
4818 expr
= lookup_name (expr
);
4820 if (TREE_CODE (expr
) == INDIRECT_REF
)
4821 /* This can happen when the expression is, e.g., "a.b". Just
4822 look at the underlying operand. */
4823 expr
= TREE_OPERAND (expr
, 0);
4825 if (TREE_CODE (expr
) == OFFSET_REF
4826 || TREE_CODE (expr
) == MEMBER_REF
)
4827 /* We're only interested in the field itself. If it is a
4828 BASELINK, we will need to see through it in the next
4830 expr
= TREE_OPERAND (expr
, 1);
4832 if (TREE_CODE (expr
) == BASELINK
)
4833 /* See through BASELINK nodes to the underlying functions. */
4834 expr
= BASELINK_FUNCTIONS (expr
);
4836 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
4837 expr
= TREE_OPERAND (expr
, 0);
4839 if (TREE_CODE (expr
) == OVERLOAD
)
4841 if (OVL_CHAIN (expr
)
4842 || TREE_CODE (OVL_FUNCTION (expr
)) == TEMPLATE_DECL
)
4844 error ("%qE refers to a set of overloaded functions", orig_expr
);
4845 return error_mark_node
;
4848 /* An overload set containing only one function: just look
4849 at that function. */
4850 expr
= OVL_FUNCTION (expr
);
4853 switch (TREE_CODE (expr
))
4856 if (DECL_BIT_FIELD_TYPE (expr
))
4858 type
= DECL_BIT_FIELD_TYPE (expr
);
4861 /* Fall through for fields that aren't bitfields. */
4868 case TEMPLATE_PARM_INDEX
:
4869 type
= TREE_TYPE (expr
);
4873 type
= error_mark_node
;
4877 type
= is_bitfield_expr_with_lowered_type (expr
);
4879 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
4886 /* We can get here when the id-expression refers to an
4888 type
= TREE_TYPE (expr
);
4892 gcc_assert (TYPE_P (expr
) || DECL_P (expr
)
4893 || TREE_CODE (expr
) == SCOPE_REF
);
4894 error ("argument to decltype must be an expression");
4895 return error_mark_node
;
4900 /* Expressions of reference type are sometimes wrapped in
4901 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4902 representation, not part of the language, so we have to look
4904 if (TREE_CODE (expr
) == INDIRECT_REF
4905 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0)))
4907 expr
= TREE_OPERAND (expr
, 0);
4909 if (TREE_CODE (expr
) == CALL_EXPR
)
4911 /* If e is a function call (5.2.2 [expr.call]) or an
4912 invocation of an overloaded operator (parentheses around e
4913 are ignored), decltype(e) is defined as the return type of
4915 tree fndecl
= get_callee_fndecl (expr
);
4916 if (fndecl
&& fndecl
!= error_mark_node
)
4917 type
= TREE_TYPE (TREE_TYPE (fndecl
));
4920 tree target_type
= TREE_TYPE (CALL_EXPR_FN (expr
));
4921 if ((TREE_CODE (target_type
) == REFERENCE_TYPE
4922 || TREE_CODE (target_type
) == POINTER_TYPE
)
4923 && (TREE_CODE (TREE_TYPE (target_type
)) == FUNCTION_TYPE
4924 || TREE_CODE (TREE_TYPE (target_type
)) == METHOD_TYPE
))
4925 type
= TREE_TYPE (TREE_TYPE (target_type
));
4926 else if (processing_template_decl
)
4927 /* Within a template finish_call_expr doesn't resolve
4928 CALL_EXPR_FN, so even though this decltype isn't really
4929 dependent let's defer resolving it. */
4930 goto treat_as_dependent
;
4932 sorry ("unable to determine the declared type of expression %<%E%>",
4938 type
= is_bitfield_expr_with_lowered_type (expr
);
4941 /* Bitfields are special, because their type encodes the
4942 number of bits they store. If the expression referenced a
4943 bitfield, TYPE now has the declared type of that
4945 type
= cp_build_qualified_type (type
,
4946 cp_type_quals (TREE_TYPE (expr
)));
4948 if (real_lvalue_p (expr
))
4949 type
= build_reference_type (type
);
4951 /* Within a lambda-expression:
4953 Every occurrence of decltype((x)) where x is a possibly
4954 parenthesized id-expression that names an entity of
4955 automatic storage duration is treated as if x were
4956 transformed into an access to a corresponding data member
4957 of the closure type that would have been declared if x
4958 were a use of the denoted entity. */
4959 else if (outer_automatic_var_p (expr
)
4960 && current_function_decl
4961 && LAMBDA_FUNCTION_P (current_function_decl
))
4962 type
= capture_decltype (expr
);
4965 /* Otherwise, where T is the type of e, if e is an lvalue,
4966 decltype(e) is defined as T&, otherwise decltype(e) is
4968 type
= TREE_TYPE (expr
);
4969 if (type
== error_mark_node
)
4970 return error_mark_node
;
4971 else if (expr
== current_class_ptr
)
4972 /* If the expression is just "this", we want the
4973 cv-unqualified pointer for the "this" type. */
4974 type
= TYPE_MAIN_VARIANT (type
);
4975 else if (real_lvalue_p (expr
))
4977 if (TREE_CODE (type
) != REFERENCE_TYPE
)
4978 type
= build_reference_type (type
);
4981 type
= non_reference (type
);
4986 if (!type
|| type
== unknown_type_node
)
4988 error ("type of %qE is unknown", expr
);
4989 return error_mark_node
;
4995 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4996 __has_nothrow_copy, depending on assign_p. */
4999 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
5006 ix
= lookup_fnfields_1 (type
, ansi_assopname (NOP_EXPR
));
5009 fns
= VEC_index (tree
, CLASSTYPE_METHOD_VEC (type
), ix
);
5011 else if (TYPE_HAS_INIT_REF (type
))
5013 /* If construction of the copy constructor was postponed, create
5015 if (CLASSTYPE_LAZY_COPY_CTOR (type
))
5016 lazily_declare_fn (sfk_copy_constructor
, type
);
5017 if (CLASSTYPE_LAZY_MOVE_CTOR (type
))
5018 lazily_declare_fn (sfk_move_constructor
, type
);
5019 fns
= CLASSTYPE_CONSTRUCTORS (type
);
5024 for (; fns
; fns
= OVL_NEXT (fns
))
5026 tree fn
= OVL_CURRENT (fns
);
5030 if (copy_fn_p (fn
) == 0)
5033 else if (copy_fn_p (fn
) <= 0)
5036 if (!TYPE_NOTHROW_P (TREE_TYPE (fn
)))
5043 /* Actually evaluates the trait. */
5046 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
5048 enum tree_code type_code1
;
5051 type_code1
= TREE_CODE (type1
);
5055 case CPTK_HAS_NOTHROW_ASSIGN
:
5056 type1
= strip_array_types (type1
);
5057 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5058 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
5059 || (CLASS_TYPE_P (type1
)
5060 && classtype_has_nothrow_assign_or_copy_p (type1
,
5063 case CPTK_HAS_TRIVIAL_ASSIGN
:
5064 /* ??? The standard seems to be missing the "or array of such a class
5065 type" wording for this trait. */
5066 type1
= strip_array_types (type1
);
5067 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5068 && (trivial_type_p (type1
)
5069 || (CLASS_TYPE_P (type1
)
5070 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1
))));
5072 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5073 type1
= strip_array_types (type1
);
5074 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
5075 || (CLASS_TYPE_P (type1
)
5076 && (t
= locate_ctor (type1
, NULL
))
5077 && TYPE_NOTHROW_P (TREE_TYPE (t
))));
5079 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5080 type1
= strip_array_types (type1
);
5081 return (trivial_type_p (type1
)
5082 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
5084 case CPTK_HAS_NOTHROW_COPY
:
5085 type1
= strip_array_types (type1
);
5086 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
5087 || (CLASS_TYPE_P (type1
)
5088 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
5090 case CPTK_HAS_TRIVIAL_COPY
:
5091 /* ??? The standard seems to be missing the "or array of such a class
5092 type" wording for this trait. */
5093 type1
= strip_array_types (type1
);
5094 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5095 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_INIT_REF (type1
)));
5097 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5098 type1
= strip_array_types (type1
);
5099 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5100 || (CLASS_TYPE_P (type1
)
5101 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
5103 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5104 return (CLASS_TYPE_P (type1
)
5105 && (t
= locate_dtor (type1
, NULL
)) && DECL_VIRTUAL_P (t
));
5107 case CPTK_IS_ABSTRACT
:
5108 return (CLASS_TYPE_P (type1
) && CLASSTYPE_PURE_VIRTUALS (type1
));
5110 case CPTK_IS_BASE_OF
:
5111 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5112 && DERIVED_FROM_P (type1
, type2
));
5115 return (NON_UNION_CLASS_TYPE_P (type1
));
5117 case CPTK_IS_CONVERTIBLE_TO
:
5122 return (NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
));
5125 return (type_code1
== ENUMERAL_TYPE
);
5128 return (pod_type_p (type1
));
5130 case CPTK_IS_POLYMORPHIC
:
5131 return (CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
));
5133 case CPTK_IS_STD_LAYOUT
:
5134 return (std_layout_type_p (type1
));
5136 case CPTK_IS_TRIVIAL
:
5137 return (trivial_type_p (type1
));
5140 return (type_code1
== UNION_TYPE
);
5148 /* Returns true if TYPE is a complete type, an array of unknown bound,
5149 or (possibly cv-qualified) void, returns false otherwise. */
5152 check_trait_type (tree type
)
5154 if (COMPLETE_TYPE_P (type
))
5157 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
5160 if (VOID_TYPE_P (type
))
5166 /* Process a trait expression. */
5169 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
5171 gcc_assert (kind
== CPTK_HAS_NOTHROW_ASSIGN
5172 || kind
== CPTK_HAS_NOTHROW_CONSTRUCTOR
5173 || kind
== CPTK_HAS_NOTHROW_COPY
5174 || kind
== CPTK_HAS_TRIVIAL_ASSIGN
5175 || kind
== CPTK_HAS_TRIVIAL_CONSTRUCTOR
5176 || kind
== CPTK_HAS_TRIVIAL_COPY
5177 || kind
== CPTK_HAS_TRIVIAL_DESTRUCTOR
5178 || kind
== CPTK_HAS_VIRTUAL_DESTRUCTOR
5179 || kind
== CPTK_IS_ABSTRACT
5180 || kind
== CPTK_IS_BASE_OF
5181 || kind
== CPTK_IS_CLASS
5182 || kind
== CPTK_IS_CONVERTIBLE_TO
5183 || kind
== CPTK_IS_EMPTY
5184 || kind
== CPTK_IS_ENUM
5185 || kind
== CPTK_IS_POD
5186 || kind
== CPTK_IS_POLYMORPHIC
5187 || kind
== CPTK_IS_STD_LAYOUT
5188 || kind
== CPTK_IS_TRIVIAL
5189 || kind
== CPTK_IS_UNION
);
5191 if (kind
== CPTK_IS_CONVERTIBLE_TO
)
5193 sorry ("__is_convertible_to");
5194 return error_mark_node
;
5197 if (type1
== error_mark_node
5198 || ((kind
== CPTK_IS_BASE_OF
|| kind
== CPTK_IS_CONVERTIBLE_TO
)
5199 && type2
== error_mark_node
))
5200 return error_mark_node
;
5202 if (processing_template_decl
)
5204 tree trait_expr
= make_node (TRAIT_EXPR
);
5205 TREE_TYPE (trait_expr
) = boolean_type_node
;
5206 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
5207 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
5208 TRAIT_EXPR_KIND (trait_expr
) = kind
;
5212 complete_type (type1
);
5214 complete_type (type2
);
5218 case CPTK_HAS_NOTHROW_ASSIGN
:
5219 case CPTK_HAS_TRIVIAL_ASSIGN
:
5220 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5221 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5222 case CPTK_HAS_NOTHROW_COPY
:
5223 case CPTK_HAS_TRIVIAL_COPY
:
5224 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5225 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5226 case CPTK_IS_ABSTRACT
:
5229 case CPTK_IS_POLYMORPHIC
:
5230 case CPTK_IS_STD_LAYOUT
:
5231 case CPTK_IS_TRIVIAL
:
5232 if (!check_trait_type (type1
))
5234 error ("incomplete type %qT not allowed", type1
);
5235 return error_mark_node
;
5239 case CPTK_IS_BASE_OF
:
5240 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5241 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
5242 && !COMPLETE_TYPE_P (type2
))
5244 error ("incomplete type %qT not allowed", type2
);
5245 return error_mark_node
;
5254 case CPTK_IS_CONVERTIBLE_TO
:
5259 return (trait_expr_value (kind
, type1
, type2
)
5260 ? boolean_true_node
: boolean_false_node
);
5263 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5264 which is ignored for C++. */
5267 set_float_const_decimal64 (void)
5272 clear_float_const_decimal64 (void)
5277 float_const_decimal64_p (void)
5282 /* Return true if T is a literal type. */
5285 literal_type_p (tree t
)
5287 if (SCALAR_TYPE_P (t
))
5289 if (CLASS_TYPE_P (t
))
5290 return CLASSTYPE_LITERAL_P (t
);
5291 if (TREE_CODE (t
) == ARRAY_TYPE
)
5292 return literal_type_p (strip_array_types (t
));
5297 /* If DECL is a variable declared `constexpr', require its type
5298 be literal. Return the DECL if OK, otherwise NULL. */
5301 ensure_literal_type_for_constexpr_object (tree decl
)
5303 tree type
= TREE_TYPE (decl
);
5304 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_DECLARED_CONSTEXPR_P (decl
)
5305 && !processing_template_decl
&& !literal_type_p (type
))
5307 error ("the type %qT of constexpr variable %qD is not literal",
5314 /* Return non-null if FUN certainly designates a valid constexpr function
5315 declaration. Otherwise return NULL. Issue appropriate diagnostics
5316 if necessary. Note that we only check the declaration, not the body
5320 validate_constexpr_fundecl (tree fun
)
5322 tree rettype
= NULL
;
5325 /* Don't bother if FUN is not marked constexpr. */
5326 if (!DECL_DECLARED_CONSTEXPR_P (fun
))
5329 /* For a function template, we have absolutely no guarantee that all
5330 instantiations will be constexpr. */
5331 if (TREE_CODE (fun
) == TEMPLATE_DECL
)
5334 parm
= FUNCTION_FIRST_USER_PARM (fun
);
5335 for (; parm
!= NULL
; parm
= TREE_CHAIN (parm
))
5337 tree type
= TREE_TYPE (parm
);
5338 if (dependent_type_p (type
))
5340 if (!literal_type_p (type
))
5342 error ("parameter %q#D is not of literal type", parm
);
5347 if (DECL_CONSTRUCTOR_P (fun
))
5350 rettype
= TREE_TYPE (TREE_TYPE (fun
));
5351 if (dependent_type_p (rettype
))
5353 if (!literal_type_p (rettype
))
5355 error ("return type %qT of function %qD is not a literal type",
5356 TREE_TYPE (TREE_TYPE (fun
)), fun
);
5363 /* Constructor for a lambda expression. */
5366 build_lambda_expr (void)
5368 tree lambda
= make_node (LAMBDA_EXPR
);
5369 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) = CPLD_NONE
;
5370 LAMBDA_EXPR_CAPTURE_LIST (lambda
) = NULL_TREE
;
5371 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = NULL_TREE
;
5372 LAMBDA_EXPR_RETURN_TYPE (lambda
) = NULL_TREE
;
5373 LAMBDA_EXPR_MUTABLE_P (lambda
) = false;
5377 /* Create the closure object for a LAMBDA_EXPR. */
5380 build_lambda_object (tree lambda_expr
)
5382 /* Build aggregate constructor call.
5383 - cp_parser_braced_list
5384 - cp_parser_functional_cast */
5385 VEC(constructor_elt
,gc
) *elts
= NULL
;
5386 tree node
, expr
, type
;
5387 location_t saved_loc
;
5389 if (processing_template_decl
)
5392 /* Make sure any error messages refer to the lambda-introducer. */
5393 saved_loc
= input_location
;
5394 input_location
= LAMBDA_EXPR_LOCATION (lambda_expr
);
5396 for (node
= LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
);
5398 node
= TREE_CHAIN (node
))
5400 tree field
= TREE_PURPOSE (node
);
5401 tree val
= TREE_VALUE (node
);
5406 /* Mere mortals can't copy arrays with aggregate initialization, so
5407 do some magic to make it work here. */
5408 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
)
5409 val
= build_array_copy (val
);
5410 else if (DECL_NORMAL_CAPTURE_P (field
)
5411 && TREE_CODE (TREE_TYPE (field
)) != REFERENCE_TYPE
)
5413 /* "the entities that are captured by copy are used to
5414 direct-initialize each corresponding non-static data
5415 member of the resulting closure object."
5417 There's normally no way to express direct-initialization
5418 from an element of a CONSTRUCTOR, so we build up a special
5419 TARGET_EXPR to bypass the usual copy-initialization. */
5420 val
= force_rvalue (val
);
5421 if (TREE_CODE (val
) == TARGET_EXPR
)
5422 TARGET_EXPR_DIRECT_INIT_P (val
) = true;
5425 CONSTRUCTOR_APPEND_ELT (elts
, DECL_NAME (field
), val
);
5428 expr
= build_constructor (init_list_type_node
, elts
);
5429 CONSTRUCTOR_IS_DIRECT_INIT (expr
) = 1;
5431 /* N2927: "[The closure] class type is not an aggregate."
5432 But we briefly treat it as an aggregate to make this simpler. */
5433 type
= TREE_TYPE (lambda_expr
);
5434 CLASSTYPE_NON_AGGREGATE (type
) = 0;
5435 expr
= finish_compound_literal (type
, expr
);
5436 CLASSTYPE_NON_AGGREGATE (type
) = 1;
5438 input_location
= saved_loc
;
5442 /* Return an initialized RECORD_TYPE for LAMBDA.
5443 LAMBDA must have its explicit captures already. */
5446 begin_lambda_type (tree lambda
)
5451 /* Unique name. This is just like an unnamed class, but we cannot use
5452 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
5454 name
= make_lambda_name ();
5456 /* Create the new RECORD_TYPE for this lambda. */
5457 type
= xref_tag (/*tag_code=*/record_type
,
5459 /*scope=*/ts_within_enclosing_non_class
,
5460 /*template_header_p=*/false);
5463 /* Designate it as a struct so that we can use aggregate initialization. */
5464 CLASSTYPE_DECLARED_CLASS (type
) = false;
5466 /* Clear base types. */
5467 xref_basetypes (type
, /*bases=*/NULL_TREE
);
5469 /* Start the class. */
5470 type
= begin_class_definition (type
, /*attributes=*/NULL_TREE
);
5472 /* Cross-reference the expression and the type. */
5473 TREE_TYPE (lambda
) = type
;
5474 CLASSTYPE_LAMBDA_EXPR (type
) = lambda
;
5479 /* Returns the type to use for the return type of the operator() of a
5483 lambda_return_type (tree expr
)
5486 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
5488 warning (0, "cannot deduce lambda return type from a braced-init-list");
5489 return void_type_node
;
5491 if (type_dependent_expression_p (expr
))
5493 type
= cxx_make_type (DECLTYPE_TYPE
);
5494 DECLTYPE_TYPE_EXPR (type
) = expr
;
5495 DECLTYPE_FOR_LAMBDA_RETURN (type
) = true;
5496 SET_TYPE_STRUCTURAL_EQUALITY (type
);
5499 type
= type_decays_to (unlowered_expr_type (expr
));
5503 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
5507 lambda_function (tree lambda
)
5510 if (TREE_CODE (lambda
) == LAMBDA_EXPR
)
5511 type
= TREE_TYPE (lambda
);
5514 gcc_assert (LAMBDA_TYPE_P (type
));
5515 /* Don't let debug_tree cause instantiation. */
5516 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
) && !COMPLETE_TYPE_P (type
))
5518 lambda
= lookup_member (type
, ansi_opname (CALL_EXPR
),
5519 /*protect=*/0, /*want_type=*/false);
5521 lambda
= BASELINK_FUNCTIONS (lambda
);
5525 /* Returns the type to use for the FIELD_DECL corresponding to the
5527 The caller should add REFERENCE_TYPE for capture by reference. */
5530 lambda_capture_field_type (tree expr
)
5533 if (type_dependent_expression_p (expr
))
5535 type
= cxx_make_type (DECLTYPE_TYPE
);
5536 DECLTYPE_TYPE_EXPR (type
) = expr
;
5537 DECLTYPE_FOR_LAMBDA_CAPTURE (type
) = true;
5538 SET_TYPE_STRUCTURAL_EQUALITY (type
);
5541 type
= non_reference (unlowered_expr_type (expr
));
5545 /* Recompute the return type for LAMBDA with body of the form:
5546 { return EXPR ; } */
5549 apply_lambda_return_type (tree lambda
, tree return_type
)
5551 tree fco
= lambda_function (lambda
);
5554 LAMBDA_EXPR_RETURN_TYPE (lambda
) = return_type
;
5556 /* If we got a DECLTYPE_TYPE, don't stick it in the function yet,
5557 it would interfere with instantiating the closure type. */
5558 if (dependent_type_p (return_type
))
5560 if (return_type
== error_mark_node
)
5563 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
5564 TREE_TYPE (METHOD_TYPE) == return-type */
5565 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
5567 result
= DECL_RESULT (fco
);
5568 if (result
== NULL_TREE
)
5571 /* We already have a DECL_RESULT from start_preparsed_function.
5572 Now we need to redo the work it and allocate_struct_function
5573 did to reflect the new type. */
5574 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
5575 TYPE_MAIN_VARIANT (return_type
));
5576 DECL_ARTIFICIAL (result
) = 1;
5577 DECL_IGNORED_P (result
) = 1;
5578 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
5581 DECL_RESULT (fco
) = result
;
5583 if (!processing_template_decl
&& aggregate_value_p (result
, fco
))
5585 #ifdef PCC_STATIC_STRUCT_RETURN
5586 cfun
->returns_pcc_struct
= 1;
5588 cfun
->returns_struct
= 1;
5593 /* DECL is a local variable or parameter from the surrounding scope of a
5594 lambda-expression. Returns the decltype for a use of the capture field
5595 for DECL even if it hasn't been captured yet. */
5598 capture_decltype (tree decl
)
5600 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
5601 /* FIXME do lookup instead of list walk? */
5602 tree cap
= value_member (decl
, LAMBDA_EXPR_CAPTURE_LIST (lam
));
5606 type
= TREE_TYPE (TREE_PURPOSE (cap
));
5608 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
5611 error ("%qD is not captured", decl
);
5612 return error_mark_node
;
5615 type
= TREE_TYPE (decl
);
5616 if (TREE_CODE (type
) == REFERENCE_TYPE
5617 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
5618 type
= TREE_TYPE (type
);
5621 case CPLD_REFERENCE
:
5622 type
= TREE_TYPE (decl
);
5623 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5624 type
= build_reference_type (TREE_TYPE (decl
));
5631 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5633 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
5634 type
= cp_build_qualified_type (type
, (TYPE_QUALS (type
)
5636 type
= build_reference_type (type
);
5641 /* From an ID and INITIALIZER, create a capture (by reference if
5642 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
5646 add_capture (tree lambda
, tree id
, tree initializer
, bool by_reference_p
,
5647 bool explicit_init_p
)
5652 type
= lambda_capture_field_type (initializer
);
5655 type
= build_reference_type (type
);
5656 if (!real_lvalue_p (initializer
))
5657 error ("cannot capture %qE by reference", initializer
);
5660 /* Make member variable. */
5661 member
= build_lang_decl (FIELD_DECL
, id
, type
);
5662 if (!explicit_init_p
)
5663 /* Normal captures are invisible to name lookup but uses are replaced
5664 with references to the capture field; we implement this by only
5665 really making them invisible in unevaluated context; see
5666 qualify_lookup. For now, let's make explicitly initialized captures
5668 DECL_NORMAL_CAPTURE_P (member
) = true;
5670 /* Add it to the appropriate closure class if we've started it. */
5671 if (current_class_type
&& current_class_type
== TREE_TYPE (lambda
))
5672 finish_member_declaration (member
);
5674 LAMBDA_EXPR_CAPTURE_LIST (lambda
)
5675 = tree_cons (member
, initializer
, LAMBDA_EXPR_CAPTURE_LIST (lambda
));
5677 if (id
== get_identifier ("__this"))
5679 if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda
))
5680 error ("already captured %<this%> in lambda expression");
5681 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = member
;
5687 /* Register all the capture members on the list CAPTURES, which is the
5688 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
5690 void register_capture_members (tree captures
)
5694 register_capture_members (TREE_CHAIN (captures
));
5695 finish_member_declaration (TREE_PURPOSE (captures
));
5699 /* Given a FIELD_DECL decl belonging to a closure type, return a
5700 COMPONENT_REF of it relative to the 'this' parameter of the op() for
5704 thisify_lambda_field (tree decl
)
5706 tree context
= lambda_function (DECL_CONTEXT (decl
));
5707 tree object
= cp_build_indirect_ref (DECL_ARGUMENTS (context
),
5709 tf_warning_or_error
);
5710 return finish_non_static_data_member (decl
, object
,
5711 /*qualifying_scope*/NULL_TREE
);
5714 /* Similar to add_capture, except this works on a stack of nested lambdas.
5715 BY_REFERENCE_P in this case is derived from the default capture mode.
5716 Returns the capture for the lambda at the bottom of the stack. */
5719 add_default_capture (tree lambda_stack
, tree id
, tree initializer
)
5721 bool this_capture_p
= (id
== get_identifier ("__this"));
5723 tree member
= NULL_TREE
;
5725 tree saved_class_type
= current_class_type
;
5729 for (node
= lambda_stack
;
5731 node
= TREE_CHAIN (node
))
5733 tree lambda
= TREE_VALUE (node
);
5735 current_class_type
= TREE_TYPE (lambda
);
5736 member
= add_capture (lambda
,
5741 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
)
5742 == CPLD_REFERENCE
)),
5743 /*explicit_init_p=*/false);
5744 initializer
= thisify_lambda_field (member
);
5747 current_class_type
= saved_class_type
;
5752 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
5753 INDIRECT_REF, possibly adding it through default capturing. */
5756 lambda_expr_this_capture (tree lambda
)
5760 tree this_capture
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
5762 /* Try to default capture 'this' if we can. */
5764 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) != CPLD_NONE
)
5766 tree containing_function
= TYPE_CONTEXT (TREE_TYPE (lambda
));
5767 tree lambda_stack
= tree_cons (NULL_TREE
, lambda
, NULL_TREE
);
5768 tree init
= NULL_TREE
;
5770 /* If we are in a lambda function, we can move out until we hit:
5771 1. a non-lambda function,
5772 2. a lambda function capturing 'this', or
5773 3. a non-default capturing lambda function. */
5774 while (LAMBDA_FUNCTION_P (containing_function
))
5777 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function
));
5779 if (LAMBDA_EXPR_THIS_CAPTURE (lambda
))
5781 /* An outer lambda has already captured 'this'. */
5782 tree cap
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
5783 init
= thisify_lambda_field (cap
);
5787 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) == CPLD_NONE
)
5788 /* An outer lambda won't let us capture 'this'. */
5791 lambda_stack
= tree_cons (NULL_TREE
,
5795 containing_function
= decl_function_context (containing_function
);
5798 if (!init
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function
)
5799 && !LAMBDA_FUNCTION_P (containing_function
))
5800 /* First parameter is 'this'. */
5801 init
= DECL_ARGUMENTS (containing_function
);
5804 this_capture
= add_default_capture (lambda_stack
,
5805 /*id=*/get_identifier ("__this"),
5811 error ("%<this%> was not captured for this lambda function");
5812 result
= error_mark_node
;
5816 /* To make sure that current_class_ref is for the lambda. */
5817 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref
)) == TREE_TYPE (lambda
));
5819 result
= finish_non_static_data_member (this_capture
,
5821 /*qualifying_scope=*/NULL_TREE
);
5823 /* If 'this' is captured, each use of 'this' is transformed into an
5824 access to the corresponding unnamed data member of the closure
5825 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
5826 ensures that the transformed expression is an rvalue. ] */
5827 result
= rvalue (result
);
5833 /* Returns the method basetype of the innermost non-lambda function, or
5834 NULL_TREE if none. */
5837 nonlambda_method_basetype (void)
5840 if (!current_class_ref
)
5843 type
= current_class_type
;
5844 if (!LAMBDA_TYPE_P (type
))
5847 /* Find the nearest enclosing non-lambda function. */
5848 fn
= TYPE_NAME (type
);
5850 fn
= decl_function_context (fn
);
5851 while (fn
&& LAMBDA_FUNCTION_P (fn
));
5853 if (!fn
|| !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5856 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn
));
5859 /* If the closure TYPE has a static op(), also add a conversion to function
5863 maybe_add_lambda_conv_op (tree type
)
5865 bool nested
= (current_function_decl
!= NULL_TREE
);
5866 tree callop
= lambda_function (type
);
5867 tree rettype
, name
, fntype
, fn
, body
, compound_stmt
;
5868 tree thistype
, stattype
, statfn
, convfn
, call
, arg
;
5869 VEC (tree
, gc
) *argvec
;
5871 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type
)) != NULL_TREE
)
5874 stattype
= build_function_type (TREE_TYPE (TREE_TYPE (callop
)),
5875 FUNCTION_ARG_CHAIN (callop
));
5877 /* First build up the conversion op. */
5879 rettype
= build_pointer_type (stattype
);
5880 name
= mangle_conv_op_name_for_type (rettype
);
5881 thistype
= cp_build_qualified_type (type
, TYPE_QUAL_CONST
);
5882 fntype
= build_method_type_directly (thistype
, rettype
, void_list_node
);
5883 fn
= convfn
= build_lang_decl (FUNCTION_DECL
, name
, fntype
);
5884 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
5886 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
5887 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
5888 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
5890 SET_OVERLOADED_OPERATOR_CODE (fn
, TYPE_EXPR
);
5891 grokclassfn (type
, fn
, NO_SPECIAL
);
5892 set_linkage_according_to_type (type
, fn
);
5893 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
5894 DECL_IN_AGGR_P (fn
) = 1;
5895 DECL_ARTIFICIAL (fn
) = 1;
5896 DECL_NOT_REALLY_EXTERN (fn
) = 1;
5897 DECL_DECLARED_INLINE_P (fn
) = 1;
5898 DECL_ARGUMENTS (fn
) = build_this_parm (fntype
, TYPE_QUAL_CONST
);
5900 DECL_INTERFACE_KNOWN (fn
) = 1;
5902 add_method (type
, fn
, NULL_TREE
);
5904 /* Generic thunk code fails for varargs; we'll complain in mark_used if
5905 the conversion op is used. */
5906 if (varargs_function_p (callop
))
5908 DECL_DELETED_FN (fn
) = 1;
5912 /* Now build up the thunk to be returned. */
5914 name
= get_identifier ("_FUN");
5915 fn
= statfn
= build_lang_decl (FUNCTION_DECL
, name
, stattype
);
5916 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
5917 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
5918 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
5919 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
5920 grokclassfn (type
, fn
, NO_SPECIAL
);
5921 set_linkage_according_to_type (type
, fn
);
5922 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
5923 DECL_IN_AGGR_P (fn
) = 1;
5924 DECL_ARTIFICIAL (fn
) = 1;
5925 DECL_NOT_REALLY_EXTERN (fn
) = 1;
5926 DECL_DECLARED_INLINE_P (fn
) = 1;
5927 DECL_STATIC_FUNCTION_P (fn
) = 1;
5928 DECL_ARGUMENTS (fn
) = copy_list (TREE_CHAIN (DECL_ARGUMENTS (callop
)));
5929 for (arg
= DECL_ARGUMENTS (fn
); arg
; arg
= TREE_CHAIN (arg
))
5930 DECL_CONTEXT (arg
) = fn
;
5932 DECL_INTERFACE_KNOWN (fn
) = 1;
5934 add_method (type
, fn
, NULL_TREE
);
5937 push_function_context ();
5939 /* Generate the body of the thunk. */
5941 start_preparsed_function (statfn
, NULL_TREE
,
5942 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
5943 if (DECL_ONE_ONLY (statfn
))
5945 /* Put the thunk in the same comdat group as the call op. */
5946 struct cgraph_node
*callop_node
, *thunk_node
;
5947 DECL_COMDAT_GROUP (statfn
) = DECL_COMDAT_GROUP (callop
);
5948 callop_node
= cgraph_node (callop
);
5949 thunk_node
= cgraph_node (statfn
);
5950 gcc_assert (callop_node
->same_comdat_group
== NULL
);
5951 gcc_assert (thunk_node
->same_comdat_group
== NULL
);
5952 callop_node
->same_comdat_group
= thunk_node
;
5953 thunk_node
->same_comdat_group
= callop_node
;
5955 body
= begin_function_body ();
5956 compound_stmt
= begin_compound_stmt (0);
5958 arg
= build1 (NOP_EXPR
, TREE_TYPE (DECL_ARGUMENTS (callop
)),
5960 argvec
= make_tree_vector ();
5961 VEC_quick_push (tree
, argvec
, arg
);
5962 for (arg
= DECL_ARGUMENTS (statfn
); arg
; arg
= TREE_CHAIN (arg
))
5963 VEC_safe_push (tree
, gc
, argvec
, arg
);
5964 call
= build_call_a (callop
, VEC_length (tree
, argvec
),
5965 VEC_address (tree
, argvec
));
5966 CALL_FROM_THUNK_P (call
) = 1;
5967 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call
)))
5968 call
= build_cplus_new (TREE_TYPE (call
), call
);
5969 call
= convert_from_reference (call
);
5970 finish_return_stmt (call
);
5972 finish_compound_stmt (compound_stmt
);
5973 finish_function_body (body
);
5975 expand_or_defer_fn (finish_function (2));
5977 /* Generate the body of the conversion op. */
5979 start_preparsed_function (convfn
, NULL_TREE
,
5980 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
5981 body
= begin_function_body ();
5982 compound_stmt
= begin_compound_stmt (0);
5984 finish_return_stmt (decay_conversion (statfn
));
5986 finish_compound_stmt (compound_stmt
);
5987 finish_function_body (body
);
5989 expand_or_defer_fn (finish_function (2));
5992 pop_function_context ();
5994 #include "gt-cp-semantics.h"