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 /* The DESTINATION is being used as an rvalue. */
550 if (!processing_template_decl
)
552 destination
= decay_conversion (destination
);
553 destination
= cp_convert (ptr_type_node
, destination
);
554 if (error_operand_p (destination
))
557 /* We don't inline calls to functions with computed gotos.
558 Those functions are typically up to some funny business,
559 and may be depending on the labels being at particular
560 addresses, or some such. */
561 DECL_UNINLINABLE (current_function_decl
) = 1;
564 check_goto (destination
);
566 return add_stmt (build_stmt (input_location
, GOTO_EXPR
, destination
));
569 /* COND is the condition-expression for an if, while, etc.,
570 statement. Convert it to a boolean value, if appropriate.
571 In addition, verify sequence points if -Wsequence-point is enabled. */
574 maybe_convert_cond (tree cond
)
576 /* Empty conditions remain empty. */
580 /* Wait until we instantiate templates before doing conversion. */
581 if (processing_template_decl
)
584 if (warn_sequence_point
)
585 verify_sequence_points (cond
);
587 /* Do the conversion. */
588 cond
= convert_from_reference (cond
);
590 if (TREE_CODE (cond
) == MODIFY_EXPR
591 && !TREE_NO_WARNING (cond
)
594 warning (OPT_Wparentheses
,
595 "suggest parentheses around assignment used as truth value");
596 TREE_NO_WARNING (cond
) = 1;
599 return condition_conversion (cond
);
602 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
605 finish_expr_stmt (tree expr
)
609 if (expr
!= NULL_TREE
)
611 if (!processing_template_decl
)
613 if (warn_sequence_point
)
614 verify_sequence_points (expr
);
615 expr
= convert_to_void (expr
, "statement", tf_warning_or_error
);
617 else if (!type_dependent_expression_p (expr
))
618 convert_to_void (build_non_dependent_expr (expr
), "statement",
619 tf_warning_or_error
);
621 if (check_for_bare_parameter_packs (expr
))
622 expr
= error_mark_node
;
624 /* Simplification of inner statement expressions, compound exprs,
625 etc can result in us already having an EXPR_STMT. */
626 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
628 if (TREE_CODE (expr
) != EXPR_STMT
)
629 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
630 expr
= maybe_cleanup_point_expr_void (expr
);
642 /* Begin an if-statement. Returns a newly created IF_STMT if
649 scope
= do_pushlevel (sk_block
);
650 r
= build_stmt (input_location
, IF_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
651 TREE_CHAIN (r
) = scope
;
652 begin_cond (&IF_COND (r
));
656 /* Process the COND of an if-statement, which may be given by
660 finish_if_stmt_cond (tree cond
, tree if_stmt
)
662 finish_cond (&IF_COND (if_stmt
), maybe_convert_cond (cond
));
664 THEN_CLAUSE (if_stmt
) = push_stmt_list ();
667 /* Finish the then-clause of an if-statement, which may be given by
671 finish_then_clause (tree if_stmt
)
673 THEN_CLAUSE (if_stmt
) = pop_stmt_list (THEN_CLAUSE (if_stmt
));
677 /* Begin the else-clause of an if-statement. */
680 begin_else_clause (tree if_stmt
)
682 ELSE_CLAUSE (if_stmt
) = push_stmt_list ();
685 /* Finish the else-clause of an if-statement, which may be given by
689 finish_else_clause (tree if_stmt
)
691 ELSE_CLAUSE (if_stmt
) = pop_stmt_list (ELSE_CLAUSE (if_stmt
));
694 /* Finish an if-statement. */
697 finish_if_stmt (tree if_stmt
)
699 tree scope
= TREE_CHAIN (if_stmt
);
700 TREE_CHAIN (if_stmt
) = NULL
;
701 add_stmt (do_poplevel (scope
));
705 /* Begin a while-statement. Returns a newly created WHILE_STMT if
709 begin_while_stmt (void)
712 r
= build_stmt (input_location
, WHILE_STMT
, NULL_TREE
, NULL_TREE
);
714 WHILE_BODY (r
) = do_pushlevel (sk_block
);
715 begin_cond (&WHILE_COND (r
));
719 /* Process the COND of a while-statement, which may be given by
723 finish_while_stmt_cond (tree cond
, tree while_stmt
)
725 finish_cond (&WHILE_COND (while_stmt
), maybe_convert_cond (cond
));
726 simplify_loop_decl_cond (&WHILE_COND (while_stmt
), WHILE_BODY (while_stmt
));
729 /* Finish a while-statement, which may be given by WHILE_STMT. */
732 finish_while_stmt (tree while_stmt
)
734 WHILE_BODY (while_stmt
) = do_poplevel (WHILE_BODY (while_stmt
));
738 /* Begin a do-statement. Returns a newly created DO_STMT if
744 tree r
= build_stmt (input_location
, DO_STMT
, NULL_TREE
, NULL_TREE
);
746 DO_BODY (r
) = push_stmt_list ();
750 /* Finish the body of a do-statement, which may be given by DO_STMT. */
753 finish_do_body (tree do_stmt
)
755 tree body
= DO_BODY (do_stmt
) = pop_stmt_list (DO_BODY (do_stmt
));
757 if (TREE_CODE (body
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (body
))
758 body
= STATEMENT_LIST_TAIL (body
)->stmt
;
760 if (IS_EMPTY_STMT (body
))
761 warning (OPT_Wempty_body
,
762 "suggest explicit braces around empty body in %<do%> statement");
765 /* Finish a do-statement, which may be given by DO_STMT, and whose
766 COND is as indicated. */
769 finish_do_stmt (tree cond
, tree do_stmt
)
771 cond
= maybe_convert_cond (cond
);
772 DO_COND (do_stmt
) = cond
;
776 /* Finish a return-statement. The EXPRESSION returned, if any, is as
780 finish_return_stmt (tree expr
)
785 expr
= check_return_expr (expr
, &no_warning
);
787 if (flag_openmp
&& !check_omp_return ())
788 return error_mark_node
;
789 if (!processing_template_decl
)
791 if (warn_sequence_point
)
792 verify_sequence_points (expr
);
794 if (DECL_DESTRUCTOR_P (current_function_decl
)
795 || (DECL_CONSTRUCTOR_P (current_function_decl
)
796 && targetm
.cxx
.cdtor_returns_this ()))
798 /* Similarly, all destructors must run destructors for
799 base-classes before returning. So, all returns in a
800 destructor get sent to the DTOR_LABEL; finish_function emits
801 code to return a value there. */
802 return finish_goto_stmt (cdtor_label
);
806 r
= build_stmt (input_location
, RETURN_EXPR
, expr
);
807 TREE_NO_WARNING (r
) |= no_warning
;
808 r
= maybe_cleanup_point_expr_void (r
);
815 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
818 begin_for_stmt (void)
822 r
= build_stmt (input_location
, FOR_STMT
, NULL_TREE
, NULL_TREE
,
823 NULL_TREE
, NULL_TREE
);
825 if (flag_new_for_scope
> 0)
826 TREE_CHAIN (r
) = do_pushlevel (sk_for
);
828 if (processing_template_decl
)
829 FOR_INIT_STMT (r
) = push_stmt_list ();
834 /* Finish the for-init-statement of a for-statement, which may be
835 given by FOR_STMT. */
838 finish_for_init_stmt (tree for_stmt
)
840 if (processing_template_decl
)
841 FOR_INIT_STMT (for_stmt
) = pop_stmt_list (FOR_INIT_STMT (for_stmt
));
843 FOR_BODY (for_stmt
) = do_pushlevel (sk_block
);
844 begin_cond (&FOR_COND (for_stmt
));
847 /* Finish the COND of a for-statement, which may be given by
851 finish_for_cond (tree cond
, tree for_stmt
)
853 finish_cond (&FOR_COND (for_stmt
), maybe_convert_cond (cond
));
854 simplify_loop_decl_cond (&FOR_COND (for_stmt
), FOR_BODY (for_stmt
));
857 /* Finish the increment-EXPRESSION in a for-statement, which may be
858 given by FOR_STMT. */
861 finish_for_expr (tree expr
, tree for_stmt
)
865 /* If EXPR is an overloaded function, issue an error; there is no
866 context available to use to perform overload resolution. */
867 if (type_unknown_p (expr
))
869 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
870 expr
= error_mark_node
;
872 if (!processing_template_decl
)
874 if (warn_sequence_point
)
875 verify_sequence_points (expr
);
876 expr
= convert_to_void (expr
, "3rd expression in for",
877 tf_warning_or_error
);
879 else if (!type_dependent_expression_p (expr
))
880 convert_to_void (build_non_dependent_expr (expr
), "3rd expression in for",
881 tf_warning_or_error
);
882 expr
= maybe_cleanup_point_expr_void (expr
);
883 if (check_for_bare_parameter_packs (expr
))
884 expr
= error_mark_node
;
885 FOR_EXPR (for_stmt
) = expr
;
888 /* Finish the body of a for-statement, which may be given by
889 FOR_STMT. The increment-EXPR for the loop must be
893 finish_for_stmt (tree for_stmt
)
895 FOR_BODY (for_stmt
) = do_poplevel (FOR_BODY (for_stmt
));
897 /* Pop the scope for the body of the loop. */
898 if (flag_new_for_scope
> 0)
900 tree scope
= TREE_CHAIN (for_stmt
);
901 TREE_CHAIN (for_stmt
) = NULL
;
902 add_stmt (do_poplevel (scope
));
908 /* Finish a break-statement. */
911 finish_break_stmt (void)
913 return add_stmt (build_stmt (input_location
, BREAK_STMT
));
916 /* Finish a continue-statement. */
919 finish_continue_stmt (void)
921 return add_stmt (build_stmt (input_location
, CONTINUE_STMT
));
924 /* Begin a switch-statement. Returns a new SWITCH_STMT if
928 begin_switch_stmt (void)
932 r
= build_stmt (input_location
, SWITCH_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
934 scope
= do_pushlevel (sk_block
);
935 TREE_CHAIN (r
) = scope
;
936 begin_cond (&SWITCH_STMT_COND (r
));
941 /* Finish the cond of a switch-statement. */
944 finish_switch_cond (tree cond
, tree switch_stmt
)
946 tree orig_type
= NULL
;
947 if (!processing_template_decl
)
949 /* Convert the condition to an integer or enumeration type. */
950 cond
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, cond
, true);
951 if (cond
== NULL_TREE
)
953 error ("switch quantity not an integer");
954 cond
= error_mark_node
;
956 orig_type
= TREE_TYPE (cond
);
957 if (cond
!= error_mark_node
)
961 Integral promotions are performed. */
962 cond
= perform_integral_promotions (cond
);
963 cond
= maybe_cleanup_point_expr (cond
);
966 if (check_for_bare_parameter_packs (cond
))
967 cond
= error_mark_node
;
968 else if (!processing_template_decl
&& warn_sequence_point
)
969 verify_sequence_points (cond
);
971 finish_cond (&SWITCH_STMT_COND (switch_stmt
), cond
);
972 SWITCH_STMT_TYPE (switch_stmt
) = orig_type
;
973 add_stmt (switch_stmt
);
974 push_switch (switch_stmt
);
975 SWITCH_STMT_BODY (switch_stmt
) = push_stmt_list ();
978 /* Finish the body of a switch-statement, which may be given by
979 SWITCH_STMT. The COND to switch on is indicated. */
982 finish_switch_stmt (tree switch_stmt
)
986 SWITCH_STMT_BODY (switch_stmt
) =
987 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt
));
991 scope
= TREE_CHAIN (switch_stmt
);
992 TREE_CHAIN (switch_stmt
) = NULL
;
993 add_stmt (do_poplevel (scope
));
996 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1000 begin_try_block (void)
1002 tree r
= build_stmt (input_location
, TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
1004 TRY_STMTS (r
) = push_stmt_list ();
1008 /* Likewise, for a function-try-block. The block returned in
1009 *COMPOUND_STMT is an artificial outer scope, containing the
1010 function-try-block. */
1013 begin_function_try_block (tree
*compound_stmt
)
1016 /* This outer scope does not exist in the C++ standard, but we need
1017 a place to put __FUNCTION__ and similar variables. */
1018 *compound_stmt
= begin_compound_stmt (0);
1019 r
= begin_try_block ();
1020 FN_TRY_BLOCK_P (r
) = 1;
1024 /* Finish a try-block, which may be given by TRY_BLOCK. */
1027 finish_try_block (tree try_block
)
1029 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1030 TRY_HANDLERS (try_block
) = push_stmt_list ();
1033 /* Finish the body of a cleanup try-block, which may be given by
1037 finish_cleanup_try_block (tree try_block
)
1039 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1042 /* Finish an implicitly generated try-block, with a cleanup is given
1046 finish_cleanup (tree cleanup
, tree try_block
)
1048 TRY_HANDLERS (try_block
) = cleanup
;
1049 CLEANUP_P (try_block
) = 1;
1052 /* Likewise, for a function-try-block. */
1055 finish_function_try_block (tree try_block
)
1057 finish_try_block (try_block
);
1058 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1059 the try block, but moving it inside. */
1060 in_function_try_handler
= 1;
1063 /* Finish a handler-sequence for a try-block, which may be given by
1067 finish_handler_sequence (tree try_block
)
1069 TRY_HANDLERS (try_block
) = pop_stmt_list (TRY_HANDLERS (try_block
));
1070 check_handlers (TRY_HANDLERS (try_block
));
1073 /* Finish the handler-seq for a function-try-block, given by
1074 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1075 begin_function_try_block. */
1078 finish_function_handler_sequence (tree try_block
, tree compound_stmt
)
1080 in_function_try_handler
= 0;
1081 finish_handler_sequence (try_block
);
1082 finish_compound_stmt (compound_stmt
);
1085 /* Begin a handler. Returns a HANDLER if appropriate. */
1088 begin_handler (void)
1092 r
= build_stmt (input_location
, HANDLER
, NULL_TREE
, NULL_TREE
);
1095 /* Create a binding level for the eh_info and the exception object
1097 HANDLER_BODY (r
) = do_pushlevel (sk_catch
);
1102 /* Finish the handler-parameters for a handler, which may be given by
1103 HANDLER. DECL is the declaration for the catch parameter, or NULL
1104 if this is a `catch (...)' clause. */
1107 finish_handler_parms (tree decl
, tree handler
)
1109 tree type
= NULL_TREE
;
1110 if (processing_template_decl
)
1114 decl
= pushdecl (decl
);
1115 decl
= push_template_decl (decl
);
1116 HANDLER_PARMS (handler
) = decl
;
1117 type
= TREE_TYPE (decl
);
1121 type
= expand_start_catch_block (decl
);
1122 HANDLER_TYPE (handler
) = type
;
1123 if (!processing_template_decl
&& type
)
1124 mark_used (eh_type_info (type
));
1127 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1128 the return value from the matching call to finish_handler_parms. */
1131 finish_handler (tree handler
)
1133 if (!processing_template_decl
)
1134 expand_end_catch_block ();
1135 HANDLER_BODY (handler
) = do_poplevel (HANDLER_BODY (handler
));
1138 /* Begin a compound statement. FLAGS contains some bits that control the
1139 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1140 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1141 block of a function. If BCS_TRY_BLOCK is set, this is the block
1142 created on behalf of a TRY statement. Returns a token to be passed to
1143 finish_compound_stmt. */
1146 begin_compound_stmt (unsigned int flags
)
1150 if (flags
& BCS_NO_SCOPE
)
1152 r
= push_stmt_list ();
1153 STATEMENT_LIST_NO_SCOPE (r
) = 1;
1155 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1156 But, if it's a statement-expression with a scopeless block, there's
1157 nothing to keep, and we don't want to accidentally keep a block
1158 *inside* the scopeless block. */
1159 keep_next_level (false);
1162 r
= do_pushlevel (flags
& BCS_TRY_BLOCK
? sk_try
: sk_block
);
1164 /* When processing a template, we need to remember where the braces were,
1165 so that we can set up identical scopes when instantiating the template
1166 later. BIND_EXPR is a handy candidate for this.
1167 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1168 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1169 processing templates. */
1170 if (processing_template_decl
)
1172 r
= build3 (BIND_EXPR
, NULL
, NULL
, r
, NULL
);
1173 BIND_EXPR_TRY_BLOCK (r
) = (flags
& BCS_TRY_BLOCK
) != 0;
1174 BIND_EXPR_BODY_BLOCK (r
) = (flags
& BCS_FN_BODY
) != 0;
1175 TREE_SIDE_EFFECTS (r
) = 1;
1181 /* Finish a compound-statement, which is given by STMT. */
1184 finish_compound_stmt (tree stmt
)
1186 if (TREE_CODE (stmt
) == BIND_EXPR
)
1187 BIND_EXPR_BODY (stmt
) = do_poplevel (BIND_EXPR_BODY (stmt
));
1188 else if (STATEMENT_LIST_NO_SCOPE (stmt
))
1189 stmt
= pop_stmt_list (stmt
);
1192 /* Destroy any ObjC "super" receivers that may have been
1194 objc_clear_super_receiver ();
1196 stmt
= do_poplevel (stmt
);
1199 /* ??? See c_end_compound_stmt wrt statement expressions. */
1204 /* Finish an asm-statement, whose components are a STRING, some
1205 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1206 LABELS. Also note whether the asm-statement should be
1207 considered volatile. */
1210 finish_asm_stmt (int volatile_p
, tree string
, tree output_operands
,
1211 tree input_operands
, tree clobbers
, tree labels
)
1215 int ninputs
= list_length (input_operands
);
1216 int noutputs
= list_length (output_operands
);
1218 if (!processing_template_decl
)
1220 const char *constraint
;
1221 const char **oconstraints
;
1222 bool allows_mem
, allows_reg
, is_inout
;
1226 oconstraints
= (const char **) alloca (noutputs
* sizeof (char *));
1228 string
= resolve_asm_operand_names (string
, output_operands
,
1229 input_operands
, labels
);
1231 for (i
= 0, t
= output_operands
; t
; t
= TREE_CHAIN (t
), ++i
)
1233 operand
= TREE_VALUE (t
);
1235 /* ??? Really, this should not be here. Users should be using a
1236 proper lvalue, dammit. But there's a long history of using
1237 casts in the output operands. In cases like longlong.h, this
1238 becomes a primitive form of typechecking -- if the cast can be
1239 removed, then the output operand had a type of the proper width;
1240 otherwise we'll get an error. Gross, but ... */
1241 STRIP_NOPS (operand
);
1243 if (!lvalue_or_else (operand
, lv_asm
, tf_warning_or_error
))
1244 operand
= error_mark_node
;
1246 if (operand
!= error_mark_node
1247 && (TREE_READONLY (operand
)
1248 || CP_TYPE_CONST_P (TREE_TYPE (operand
))
1249 /* Functions are not modifiable, even though they are
1251 || TREE_CODE (TREE_TYPE (operand
)) == FUNCTION_TYPE
1252 || TREE_CODE (TREE_TYPE (operand
)) == METHOD_TYPE
1253 /* If it's an aggregate and any field is const, then it is
1254 effectively const. */
1255 || (CLASS_TYPE_P (TREE_TYPE (operand
))
1256 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand
)))))
1257 readonly_error (operand
, REK_ASSIGNMENT_ASM
);
1259 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1260 oconstraints
[i
] = constraint
;
1262 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
1263 &allows_mem
, &allows_reg
, &is_inout
))
1265 /* If the operand is going to end up in memory,
1266 mark it addressable. */
1267 if (!allows_reg
&& !cxx_mark_addressable (operand
))
1268 operand
= error_mark_node
;
1271 operand
= error_mark_node
;
1273 TREE_VALUE (t
) = operand
;
1276 for (i
= 0, t
= input_operands
; t
; ++i
, t
= TREE_CHAIN (t
))
1278 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1279 operand
= decay_conversion (TREE_VALUE (t
));
1281 /* If the type of the operand hasn't been determined (e.g.,
1282 because it involves an overloaded function), then issue
1283 an error message. There's no context available to
1284 resolve the overloading. */
1285 if (TREE_TYPE (operand
) == unknown_type_node
)
1287 error ("type of asm operand %qE could not be determined",
1289 operand
= error_mark_node
;
1292 if (parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
1293 oconstraints
, &allows_mem
, &allows_reg
))
1295 /* If the operand is going to end up in memory,
1296 mark it addressable. */
1297 if (!allows_reg
&& allows_mem
)
1299 /* Strip the nops as we allow this case. FIXME, this really
1300 should be rejected or made deprecated. */
1301 STRIP_NOPS (operand
);
1302 if (!cxx_mark_addressable (operand
))
1303 operand
= error_mark_node
;
1307 operand
= error_mark_node
;
1309 TREE_VALUE (t
) = operand
;
1313 r
= build_stmt (input_location
, ASM_EXPR
, string
,
1314 output_operands
, input_operands
,
1316 ASM_VOLATILE_P (r
) = volatile_p
|| noutputs
== 0;
1317 r
= maybe_cleanup_point_expr_void (r
);
1318 return add_stmt (r
);
1321 /* Finish a label with the indicated NAME. Returns the new label. */
1324 finish_label_stmt (tree name
)
1326 tree decl
= define_label (input_location
, name
);
1328 if (decl
== error_mark_node
)
1329 return error_mark_node
;
1331 add_stmt (build_stmt (input_location
, LABEL_EXPR
, decl
));
1336 /* Finish a series of declarations for local labels. G++ allows users
1337 to declare "local" labels, i.e., labels with scope. This extension
1338 is useful when writing code involving statement-expressions. */
1341 finish_label_decl (tree name
)
1343 if (!at_function_scope_p ())
1345 error ("__label__ declarations are only allowed in function scopes");
1349 add_decl_expr (declare_local_label (name
));
1352 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1355 finish_decl_cleanup (tree decl
, tree cleanup
)
1357 push_cleanup (decl
, cleanup
, false);
1360 /* If the current scope exits with an exception, run CLEANUP. */
1363 finish_eh_cleanup (tree cleanup
)
1365 push_cleanup (NULL
, cleanup
, true);
1368 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1369 order they were written by the user. Each node is as for
1370 emit_mem_initializers. */
1373 finish_mem_initializers (tree mem_inits
)
1375 /* Reorder the MEM_INITS so that they are in the order they appeared
1376 in the source program. */
1377 mem_inits
= nreverse (mem_inits
);
1379 if (processing_template_decl
)
1383 for (mem
= mem_inits
; mem
; mem
= TREE_CHAIN (mem
))
1385 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1386 check for bare parameter packs in the TREE_VALUE, because
1387 any parameter packs in the TREE_VALUE have already been
1388 bound as part of the TREE_PURPOSE. See
1389 make_pack_expansion for more information. */
1390 if (TREE_CODE (TREE_PURPOSE (mem
)) != TYPE_PACK_EXPANSION
1391 && check_for_bare_parameter_packs (TREE_VALUE (mem
)))
1392 TREE_VALUE (mem
) = error_mark_node
;
1395 add_stmt (build_min_nt (CTOR_INITIALIZER
, mem_inits
));
1398 emit_mem_initializers (mem_inits
);
1401 /* Finish a parenthesized expression EXPR. */
1404 finish_parenthesized_expr (tree expr
)
1407 /* This inhibits warnings in c_common_truthvalue_conversion. */
1408 TREE_NO_WARNING (expr
) = 1;
1410 if (TREE_CODE (expr
) == OFFSET_REF
)
1411 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1412 enclosed in parentheses. */
1413 PTRMEM_OK_P (expr
) = 0;
1415 if (TREE_CODE (expr
) == STRING_CST
)
1416 PAREN_STRING_LITERAL_P (expr
) = 1;
1421 /* Finish a reference to a non-static data member (DECL) that is not
1422 preceded by `.' or `->'. */
1425 finish_non_static_data_member (tree decl
, tree object
, tree qualifying_scope
)
1427 gcc_assert (TREE_CODE (decl
) == FIELD_DECL
);
1429 if (!object
&& cp_unevaluated_operand
!= 0)
1431 /* DR 613: Can use non-static data members without an associated
1432 object in sizeof/decltype/alignof. */
1433 tree scope
= qualifying_scope
;
1434 if (scope
== NULL_TREE
)
1435 scope
= context_for_name_lookup (decl
);
1436 object
= maybe_dummy_object (scope
, NULL
);
1441 if (current_function_decl
1442 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1443 error ("invalid use of member %q+D in static member function", decl
);
1445 error ("invalid use of non-static data member %q+D", decl
);
1446 error ("from this location");
1448 return error_mark_node
;
1451 /* If decl is a non-capture field and object has a lambda type,
1452 then we have a reference to a member of 'this' from a
1453 lambda inside a non-static member function, and we must get to decl
1454 through the 'this' capture. If decl is not a member of that object,
1455 either, then its access will still fail later. */
1456 if (LAMBDA_TYPE_P (TREE_TYPE (object
))
1457 && !LAMBDA_TYPE_P (DECL_CONTEXT (decl
)))
1458 object
= cp_build_indirect_ref (lambda_expr_this_capture
1459 (CLASSTYPE_LAMBDA_EXPR
1460 (TREE_TYPE (object
))),
1462 /*complain=*/tf_warning_or_error
);
1464 if (current_class_ptr
)
1465 TREE_USED (current_class_ptr
) = 1;
1466 if (processing_template_decl
&& !qualifying_scope
)
1468 tree type
= TREE_TYPE (decl
);
1470 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1471 type
= TREE_TYPE (type
);
1474 /* Set the cv qualifiers. */
1475 int quals
= (current_class_ref
1476 ? cp_type_quals (TREE_TYPE (current_class_ref
))
1477 : TYPE_UNQUALIFIED
);
1479 if (DECL_MUTABLE_P (decl
))
1480 quals
&= ~TYPE_QUAL_CONST
;
1482 quals
|= cp_type_quals (TREE_TYPE (decl
));
1483 type
= cp_build_qualified_type (type
, quals
);
1486 return build_min (COMPONENT_REF
, type
, object
, decl
, NULL_TREE
);
1488 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1489 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1491 else if (processing_template_decl
)
1492 return build_qualified_name (TREE_TYPE (decl
),
1495 /*template_p=*/false);
1498 tree access_type
= TREE_TYPE (object
);
1499 tree lookup_context
= context_for_name_lookup (decl
);
1501 while (!DERIVED_FROM_P (lookup_context
, access_type
))
1503 access_type
= TYPE_CONTEXT (access_type
);
1504 while (access_type
&& DECL_P (access_type
))
1505 access_type
= DECL_CONTEXT (access_type
);
1509 error ("object missing in reference to %q+D", decl
);
1510 error ("from this location");
1511 return error_mark_node
;
1515 perform_or_defer_access_check (TYPE_BINFO (access_type
), decl
,
1518 /* If the data member was named `C::M', convert `*this' to `C'
1520 if (qualifying_scope
)
1522 tree binfo
= NULL_TREE
;
1523 object
= build_scoped_ref (object
, qualifying_scope
,
1527 return build_class_member_access_expr (object
, decl
,
1528 /*access_path=*/NULL_TREE
,
1529 /*preserve_reference=*/false,
1530 tf_warning_or_error
);
1534 /* If we are currently parsing a template and we encountered a typedef
1535 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1536 adds the typedef to a list tied to the current template.
1537 At tempate instantiatin time, that list is walked and access check
1538 performed for each typedef.
1539 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1542 add_typedef_to_current_template_for_access_check (tree typedef_decl
,
1544 location_t location
)
1546 tree template_info
= NULL
;
1547 tree cs
= current_scope ();
1549 if (!is_typedef_decl (typedef_decl
)
1551 || !CLASS_TYPE_P (context
)
1555 if (CLASS_TYPE_P (cs
) || TREE_CODE (cs
) == FUNCTION_DECL
)
1556 template_info
= get_template_info (cs
);
1559 && TI_TEMPLATE (template_info
)
1560 && !currently_open_class (context
))
1561 append_type_to_template_for_access_check (cs
, typedef_decl
,
1565 /* DECL was the declaration to which a qualified-id resolved. Issue
1566 an error message if it is not accessible. If OBJECT_TYPE is
1567 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1568 type of `*x', or `x', respectively. If the DECL was named as
1569 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1572 check_accessibility_of_qualified_id (tree decl
,
1574 tree nested_name_specifier
)
1577 tree qualifying_type
= NULL_TREE
;
1579 /* If we are parsing a template declaration and if decl is a typedef,
1580 add it to a list tied to the template.
1581 At template instantiation time, that list will be walked and
1582 access check performed. */
1583 add_typedef_to_current_template_for_access_check (decl
,
1584 nested_name_specifier
1585 ? nested_name_specifier
1586 : DECL_CONTEXT (decl
),
1589 /* If we're not checking, return immediately. */
1590 if (deferred_access_no_check
)
1593 /* Determine the SCOPE of DECL. */
1594 scope
= context_for_name_lookup (decl
);
1595 /* If the SCOPE is not a type, then DECL is not a member. */
1596 if (!TYPE_P (scope
))
1598 /* Compute the scope through which DECL is being accessed. */
1600 /* OBJECT_TYPE might not be a class type; consider:
1602 class A { typedef int I; };
1606 In this case, we will have "A::I" as the DECL, but "I" as the
1608 && CLASS_TYPE_P (object_type
)
1609 && DERIVED_FROM_P (scope
, object_type
))
1610 /* If we are processing a `->' or `.' expression, use the type of the
1612 qualifying_type
= object_type
;
1613 else if (nested_name_specifier
)
1615 /* If the reference is to a non-static member of the
1616 current class, treat it as if it were referenced through
1618 if (DECL_NONSTATIC_MEMBER_P (decl
)
1619 && current_class_ptr
1620 && DERIVED_FROM_P (scope
, current_class_type
))
1621 qualifying_type
= current_class_type
;
1622 /* Otherwise, use the type indicated by the
1623 nested-name-specifier. */
1625 qualifying_type
= nested_name_specifier
;
1628 /* Otherwise, the name must be from the current class or one of
1630 qualifying_type
= currently_open_derived_class (scope
);
1633 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1634 or similar in a default argument value. */
1635 && CLASS_TYPE_P (qualifying_type
)
1636 && !dependent_type_p (qualifying_type
))
1637 perform_or_defer_access_check (TYPE_BINFO (qualifying_type
), decl
,
1641 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1642 class named to the left of the "::" operator. DONE is true if this
1643 expression is a complete postfix-expression; it is false if this
1644 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1645 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1646 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1647 is true iff this qualified name appears as a template argument. */
1650 finish_qualified_id_expr (tree qualifying_class
,
1655 bool template_arg_p
)
1657 gcc_assert (TYPE_P (qualifying_class
));
1659 if (error_operand_p (expr
))
1660 return error_mark_node
;
1662 if (DECL_P (expr
) || BASELINK_P (expr
))
1666 check_template_keyword (expr
);
1668 /* If EXPR occurs as the operand of '&', use special handling that
1669 permits a pointer-to-member. */
1670 if (address_p
&& done
)
1672 if (TREE_CODE (expr
) == SCOPE_REF
)
1673 expr
= TREE_OPERAND (expr
, 1);
1674 expr
= build_offset_ref (qualifying_class
, expr
,
1675 /*address_p=*/true);
1679 /* Within the scope of a class, turn references to non-static
1680 members into expression of the form "this->...". */
1682 /* But, within a template argument, we do not want make the
1683 transformation, as there is no "this" pointer. */
1685 else if (TREE_CODE (expr
) == FIELD_DECL
)
1687 push_deferring_access_checks (dk_no_check
);
1688 expr
= finish_non_static_data_member (expr
, current_class_ref
,
1690 pop_deferring_access_checks ();
1692 else if (BASELINK_P (expr
) && !processing_template_decl
)
1696 /* See if any of the functions are non-static members. */
1697 fns
= BASELINK_FUNCTIONS (expr
);
1698 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
1699 fns
= TREE_OPERAND (fns
, 0);
1700 /* If so, the expression may be relative to 'this'. */
1701 if (!shared_member_p (fns
)
1702 && current_class_ref
1703 && DERIVED_FROM_P (qualifying_class
, TREE_TYPE (current_class_ref
)))
1704 expr
= (build_class_member_access_expr
1705 (maybe_dummy_object (qualifying_class
, NULL
),
1707 BASELINK_ACCESS_BINFO (expr
),
1708 /*preserve_reference=*/false,
1709 tf_warning_or_error
));
1711 /* The expression is a qualified name whose address is not
1713 expr
= build_offset_ref (qualifying_class
, expr
, /*address_p=*/false);
1719 /* Begin a statement-expression. The value returned must be passed to
1720 finish_stmt_expr. */
1723 begin_stmt_expr (void)
1725 return push_stmt_list ();
1728 /* Process the final expression of a statement expression. EXPR can be
1729 NULL, if the final expression is empty. Return a STATEMENT_LIST
1730 containing all the statements in the statement-expression, or
1731 ERROR_MARK_NODE if there was an error. */
1734 finish_stmt_expr_expr (tree expr
, tree stmt_expr
)
1736 if (error_operand_p (expr
))
1738 /* The type of the statement-expression is the type of the last
1740 TREE_TYPE (stmt_expr
) = error_mark_node
;
1741 return error_mark_node
;
1744 /* If the last statement does not have "void" type, then the value
1745 of the last statement is the value of the entire expression. */
1748 tree type
= TREE_TYPE (expr
);
1750 if (processing_template_decl
)
1752 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
1753 expr
= add_stmt (expr
);
1754 /* Mark the last statement so that we can recognize it as such at
1755 template-instantiation time. */
1756 EXPR_STMT_STMT_EXPR_RESULT (expr
) = 1;
1758 else if (VOID_TYPE_P (type
))
1760 /* Just treat this like an ordinary statement. */
1761 expr
= finish_expr_stmt (expr
);
1765 /* It actually has a value we need to deal with. First, force it
1766 to be an rvalue so that we won't need to build up a copy
1767 constructor call later when we try to assign it to something. */
1768 expr
= force_rvalue (expr
);
1769 if (error_operand_p (expr
))
1770 return error_mark_node
;
1772 /* Update for array-to-pointer decay. */
1773 type
= TREE_TYPE (expr
);
1775 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1776 normal statement, but don't convert to void or actually add
1778 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
1779 expr
= maybe_cleanup_point_expr (expr
);
1783 /* The type of the statement-expression is the type of the last
1785 TREE_TYPE (stmt_expr
) = type
;
1791 /* Finish a statement-expression. EXPR should be the value returned
1792 by the previous begin_stmt_expr. Returns an expression
1793 representing the statement-expression. */
1796 finish_stmt_expr (tree stmt_expr
, bool has_no_scope
)
1801 if (error_operand_p (stmt_expr
))
1803 pop_stmt_list (stmt_expr
);
1804 return error_mark_node
;
1807 gcc_assert (TREE_CODE (stmt_expr
) == STATEMENT_LIST
);
1809 type
= TREE_TYPE (stmt_expr
);
1810 result
= pop_stmt_list (stmt_expr
);
1811 TREE_TYPE (result
) = type
;
1813 if (processing_template_decl
)
1815 result
= build_min (STMT_EXPR
, type
, result
);
1816 TREE_SIDE_EFFECTS (result
) = 1;
1817 STMT_EXPR_NO_SCOPE (result
) = has_no_scope
;
1819 else if (CLASS_TYPE_P (type
))
1821 /* Wrap the statement-expression in a TARGET_EXPR so that the
1822 temporary object created by the final expression is destroyed at
1823 the end of the full-expression containing the
1824 statement-expression. */
1825 result
= force_target_expr (type
, result
);
1831 /* Returns the expression which provides the value of STMT_EXPR. */
1834 stmt_expr_value_expr (tree stmt_expr
)
1836 tree t
= STMT_EXPR_STMT (stmt_expr
);
1838 if (TREE_CODE (t
) == BIND_EXPR
)
1839 t
= BIND_EXPR_BODY (t
);
1841 if (TREE_CODE (t
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (t
))
1842 t
= STATEMENT_LIST_TAIL (t
)->stmt
;
1844 if (TREE_CODE (t
) == EXPR_STMT
)
1845 t
= EXPR_STMT_EXPR (t
);
1850 /* Return TRUE iff EXPR_STMT is an empty list of
1851 expression statements. */
1854 empty_expr_stmt_p (tree expr_stmt
)
1856 tree body
= NULL_TREE
;
1858 if (expr_stmt
== void_zero_node
)
1863 if (TREE_CODE (expr_stmt
) == EXPR_STMT
)
1864 body
= EXPR_STMT_EXPR (expr_stmt
);
1865 else if (TREE_CODE (expr_stmt
) == STATEMENT_LIST
)
1871 if (TREE_CODE (body
) == STATEMENT_LIST
)
1872 return tsi_end_p (tsi_start (body
));
1874 return empty_expr_stmt_p (body
);
1879 /* Perform Koenig lookup. FN is the postfix-expression representing
1880 the function (or functions) to call; ARGS are the arguments to the
1881 call. Returns the functions to be considered by overload
1885 perform_koenig_lookup (tree fn
, VEC(tree
,gc
) *args
)
1887 tree identifier
= NULL_TREE
;
1888 tree functions
= NULL_TREE
;
1889 tree tmpl_args
= NULL_TREE
;
1890 bool template_id
= false;
1892 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
1894 /* Use a separate flag to handle null args. */
1896 tmpl_args
= TREE_OPERAND (fn
, 1);
1897 fn
= TREE_OPERAND (fn
, 0);
1900 /* Find the name of the overloaded function. */
1901 if (TREE_CODE (fn
) == IDENTIFIER_NODE
)
1903 else if (is_overloaded_fn (fn
))
1906 identifier
= DECL_NAME (get_first_fn (functions
));
1908 else if (DECL_P (fn
))
1911 identifier
= DECL_NAME (fn
);
1914 /* A call to a namespace-scope function using an unqualified name.
1916 Do Koenig lookup -- unless any of the arguments are
1918 if (!any_type_dependent_arguments_p (args
)
1919 && !any_dependent_template_arguments_p (tmpl_args
))
1921 fn
= lookup_arg_dependent (identifier
, functions
, args
);
1923 /* The unqualified name could not be resolved. */
1924 fn
= unqualified_fn_lookup_error (identifier
);
1927 if (fn
&& template_id
)
1928 fn
= build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fn
, tmpl_args
);
1933 /* Generate an expression for `FN (ARGS)'. This may change the
1936 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1937 as a virtual call, even if FN is virtual. (This flag is set when
1938 encountering an expression where the function name is explicitly
1939 qualified. For example a call to `X::f' never generates a virtual
1942 Returns code for the call. */
1945 finish_call_expr (tree fn
, VEC(tree
,gc
) **args
, bool disallow_virtual
,
1946 bool koenig_p
, tsubst_flags_t complain
)
1950 VEC(tree
,gc
) *orig_args
= NULL
;
1952 if (fn
== error_mark_node
)
1953 return error_mark_node
;
1955 gcc_assert (!TYPE_P (fn
));
1959 if (processing_template_decl
)
1961 if (type_dependent_expression_p (fn
)
1962 || any_type_dependent_arguments_p (*args
))
1964 result
= build_nt_call_vec (fn
, *args
);
1965 KOENIG_LOOKUP_P (result
) = koenig_p
;
1970 tree fndecl
= OVL_CURRENT (fn
);
1971 if (TREE_CODE (fndecl
) != FUNCTION_DECL
1972 || !TREE_THIS_VOLATILE (fndecl
))
1978 current_function_returns_abnormally
= 1;
1982 orig_args
= make_tree_vector_copy (*args
);
1983 if (!BASELINK_P (fn
)
1984 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
1985 && TREE_TYPE (fn
) != unknown_type_node
)
1986 fn
= build_non_dependent_expr (fn
);
1987 make_args_non_dependent (*args
);
1990 if (is_overloaded_fn (fn
))
1991 fn
= baselink_for_fns (fn
);
1994 if (BASELINK_P (fn
))
1998 /* A call to a member function. From [over.call.func]:
2000 If the keyword this is in scope and refers to the class of
2001 that member function, or a derived class thereof, then the
2002 function call is transformed into a qualified function call
2003 using (*this) as the postfix-expression to the left of the
2004 . operator.... [Otherwise] a contrived object of type T
2005 becomes the implied object argument.
2007 This paragraph is unclear about this situation:
2009 struct A { void f(); };
2010 struct B : public A {};
2011 struct C : public A { void g() { B::f(); }};
2013 In particular, for `B::f', this paragraph does not make clear
2014 whether "the class of that member function" refers to `A' or
2015 to `B'. We believe it refers to `B'. */
2016 if (current_class_type
2017 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
2019 && current_class_ref
)
2020 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
2024 tree representative_fn
;
2026 representative_fn
= BASELINK_FUNCTIONS (fn
);
2027 if (TREE_CODE (representative_fn
) == TEMPLATE_ID_EXPR
)
2028 representative_fn
= TREE_OPERAND (representative_fn
, 0);
2029 representative_fn
= get_first_fn (representative_fn
);
2030 object
= build_dummy_object (DECL_CONTEXT (representative_fn
));
2033 if (processing_template_decl
)
2035 if (type_dependent_expression_p (object
))
2037 tree ret
= build_nt_call_vec (orig_fn
, orig_args
);
2038 release_tree_vector (orig_args
);
2041 object
= build_non_dependent_expr (object
);
2044 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
2046 ? LOOKUP_NONVIRTUAL
: 0),
2050 else if (is_overloaded_fn (fn
))
2052 /* If the function is an overloaded builtin, resolve it. */
2053 if (TREE_CODE (fn
) == FUNCTION_DECL
2054 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2055 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
2056 result
= resolve_overloaded_builtin (input_location
, fn
, *args
);
2059 /* A call to a namespace-scope function. */
2060 result
= build_new_function_call (fn
, args
, koenig_p
, complain
);
2062 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
2064 if (!VEC_empty (tree
, *args
))
2065 error ("arguments to destructor are not allowed");
2066 /* Mark the pseudo-destructor call as having side-effects so
2067 that we do not issue warnings about its use. */
2068 result
= build1 (NOP_EXPR
,
2070 TREE_OPERAND (fn
, 0));
2071 TREE_SIDE_EFFECTS (result
) = 1;
2073 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
2074 /* If the "function" is really an object of class type, it might
2075 have an overloaded `operator ()'. */
2076 result
= build_op_call (fn
, args
, complain
);
2079 /* A call where the function is unknown. */
2080 result
= cp_build_function_call_vec (fn
, args
, complain
);
2082 if (processing_template_decl
)
2084 result
= build_call_vec (TREE_TYPE (result
), orig_fn
, orig_args
);
2085 KOENIG_LOOKUP_P (result
) = koenig_p
;
2086 release_tree_vector (orig_args
);
2092 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2093 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2094 POSTDECREMENT_EXPR.) */
2097 finish_increment_expr (tree expr
, enum tree_code code
)
2099 return build_x_unary_op (code
, expr
, tf_warning_or_error
);
2102 /* Finish a use of `this'. Returns an expression for `this'. */
2105 finish_this_expr (void)
2109 /* In a lambda expression, 'this' refers to the captured 'this'. */
2110 if (current_function_decl
2111 && LAMBDA_FUNCTION_P (current_function_decl
))
2112 result
= (lambda_expr_this_capture
2113 (CLASSTYPE_LAMBDA_EXPR (current_class_type
)));
2114 else if (current_class_ptr
)
2115 result
= current_class_ptr
;
2116 else if (current_function_decl
2117 && DECL_STATIC_FUNCTION_P (current_function_decl
))
2119 error ("%<this%> is unavailable for static member functions");
2120 result
= error_mark_node
;
2124 if (current_function_decl
)
2125 error ("invalid use of %<this%> in non-member function");
2127 error ("invalid use of %<this%> at top level");
2128 result
= error_mark_node
;
2134 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2135 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2136 the TYPE for the type given. If SCOPE is non-NULL, the expression
2137 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2140 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
)
2142 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2143 return error_mark_node
;
2145 gcc_assert (TYPE_P (destructor
));
2147 if (!processing_template_decl
)
2149 if (scope
== error_mark_node
)
2151 error ("invalid qualifying scope in pseudo-destructor name");
2152 return error_mark_node
;
2154 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2156 error ("qualified type %qT does not match destructor name ~%qT",
2158 return error_mark_node
;
2162 /* [expr.pseudo] says both:
2164 The type designated by the pseudo-destructor-name shall be
2165 the same as the object type.
2169 The cv-unqualified versions of the object type and of the
2170 type designated by the pseudo-destructor-name shall be the
2173 We implement the more generous second sentence, since that is
2174 what most other compilers do. */
2175 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2178 error ("%qE is not of type %qT", object
, destructor
);
2179 return error_mark_node
;
2183 return build3 (PSEUDO_DTOR_EXPR
, void_type_node
, object
, scope
, destructor
);
2186 /* Finish an expression of the form CODE EXPR. */
2189 finish_unary_op_expr (enum tree_code code
, tree expr
)
2191 tree result
= build_x_unary_op (code
, expr
, tf_warning_or_error
);
2192 /* Inside a template, build_x_unary_op does not fold the
2193 expression. So check whether the result is folded before
2194 setting TREE_NEGATED_INT. */
2195 if (code
== NEGATE_EXPR
&& TREE_CODE (expr
) == INTEGER_CST
2196 && TREE_CODE (result
) == INTEGER_CST
2197 && !TYPE_UNSIGNED (TREE_TYPE (result
))
2198 && INT_CST_LT (result
, integer_zero_node
))
2200 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2201 setting TREE_NEGATED_INT. */
2202 result
= copy_node (result
);
2203 TREE_NEGATED_INT (result
) = 1;
2205 if (TREE_OVERFLOW_P (result
) && !TREE_OVERFLOW_P (expr
))
2206 overflow_warning (input_location
, result
);
2211 /* Finish a compound-literal expression. TYPE is the type to which
2212 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2215 finish_compound_literal (tree type
, tree compound_literal
)
2217 if (type
== error_mark_node
)
2218 return error_mark_node
;
2220 if (!TYPE_OBJ_P (type
))
2222 error ("compound literal of non-object type %qT", type
);
2223 return error_mark_node
;
2226 if (processing_template_decl
)
2228 TREE_TYPE (compound_literal
) = type
;
2229 /* Mark the expression as a compound literal. */
2230 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2231 return compound_literal
;
2234 type
= complete_type (type
);
2236 if (TYPE_NON_AGGREGATE_CLASS (type
))
2238 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2239 everywhere that deals with function arguments would be a pain, so
2240 just wrap it in a TREE_LIST. The parser set a flag so we know
2241 that it came from T{} rather than T({}). */
2242 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal
) = 1;
2243 compound_literal
= build_tree_list (NULL_TREE
, compound_literal
);
2244 return build_functional_cast (type
, compound_literal
, tf_error
);
2247 if (TREE_CODE (type
) == ARRAY_TYPE
2248 && check_array_initializer (NULL_TREE
, type
, compound_literal
))
2249 return error_mark_node
;
2250 compound_literal
= reshape_init (type
, compound_literal
);
2251 if (TREE_CODE (type
) == ARRAY_TYPE
)
2252 cp_complete_array_type (&type
, compound_literal
, false);
2253 compound_literal
= digest_init (type
, compound_literal
);
2254 if ((!at_function_scope_p () || cp_type_readonly (type
))
2255 && initializer_constant_valid_p (compound_literal
, type
))
2257 tree decl
= create_temporary_var (type
);
2258 DECL_INITIAL (decl
) = compound_literal
;
2259 TREE_STATIC (decl
) = 1;
2260 cp_apply_type_quals_to_decl (cp_type_quals (type
), decl
);
2261 decl
= pushdecl_top_level (decl
);
2262 DECL_NAME (decl
) = make_anon_name ();
2263 SET_DECL_ASSEMBLER_NAME (decl
, DECL_NAME (decl
));
2267 return get_target_expr (compound_literal
);
2270 /* Return the declaration for the function-name variable indicated by
2274 finish_fname (tree id
)
2278 decl
= fname_decl (input_location
, C_RID_CODE (id
), id
);
2279 if (processing_template_decl
)
2280 decl
= DECL_NAME (decl
);
2284 /* Finish a translation unit. */
2287 finish_translation_unit (void)
2289 /* In case there were missing closebraces,
2290 get us back to the global binding level. */
2292 while (current_namespace
!= global_namespace
)
2295 /* Do file scope __FUNCTION__ et al. */
2296 finish_fname_decls ();
2299 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2300 Returns the parameter. */
2303 finish_template_type_parm (tree aggr
, tree identifier
)
2305 if (aggr
!= class_type_node
)
2307 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
2308 aggr
= class_type_node
;
2311 return build_tree_list (aggr
, identifier
);
2314 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2315 Returns the parameter. */
2318 finish_template_template_parm (tree aggr
, tree identifier
)
2320 tree decl
= build_decl (input_location
,
2321 TYPE_DECL
, identifier
, NULL_TREE
);
2322 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2323 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2324 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2325 DECL_ARTIFICIAL (decl
) = 1;
2326 end_template_decl ();
2328 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2330 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
2331 /*is_primary=*/true, /*is_partial=*/false,
2334 return finish_template_type_parm (aggr
, tmpl
);
2337 /* ARGUMENT is the default-argument value for a template template
2338 parameter. If ARGUMENT is invalid, issue error messages and return
2339 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2342 check_template_template_default_arg (tree argument
)
2344 if (TREE_CODE (argument
) != TEMPLATE_DECL
2345 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2346 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2348 if (TREE_CODE (argument
) == TYPE_DECL
)
2349 error ("invalid use of type %qT as a default value for a template "
2350 "template-parameter", TREE_TYPE (argument
));
2352 error ("invalid default argument for a template template parameter");
2353 return error_mark_node
;
2359 /* Begin a class definition, as indicated by T. */
2362 begin_class_definition (tree t
, tree attributes
)
2364 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
2365 return error_mark_node
;
2367 if (processing_template_parmlist
)
2369 error ("definition of %q#T inside template parameter list", t
);
2370 return error_mark_node
;
2373 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2374 are passed the same as decimal scalar types. */
2375 if (TREE_CODE (t
) == RECORD_TYPE
2376 && !processing_template_decl
)
2378 tree ns
= TYPE_CONTEXT (t
);
2379 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
2380 && DECL_CONTEXT (ns
) == std_node
2382 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns
)), "decimal"))
2384 const char *n
= TYPE_NAME_STRING (t
);
2385 if ((strcmp (n
, "decimal32") == 0)
2386 || (strcmp (n
, "decimal64") == 0)
2387 || (strcmp (n
, "decimal128") == 0))
2388 TYPE_TRANSPARENT_AGGR (t
) = 1;
2392 /* A non-implicit typename comes from code like:
2394 template <typename T> struct A {
2395 template <typename U> struct A<T>::B ...
2397 This is erroneous. */
2398 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2400 error ("invalid definition of qualified type %qT", t
);
2401 t
= error_mark_node
;
2404 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
2406 t
= make_class_type (RECORD_TYPE
);
2407 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
2410 /* Update the location of the decl. */
2411 DECL_SOURCE_LOCATION (TYPE_NAME (t
)) = input_location
;
2413 if (TYPE_BEING_DEFINED (t
))
2415 t
= make_class_type (TREE_CODE (t
));
2416 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
2418 maybe_process_partial_specialization (t
);
2420 TYPE_BEING_DEFINED (t
) = 1;
2422 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
2424 if (flag_pack_struct
)
2427 TYPE_PACKED (t
) = 1;
2428 /* Even though the type is being defined for the first time
2429 here, there might have been a forward declaration, so there
2430 might be cv-qualified variants of T. */
2431 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
2432 TYPE_PACKED (v
) = 1;
2434 /* Reset the interface data, at the earliest possible
2435 moment, as it might have been set via a class foo;
2437 if (! TYPE_ANONYMOUS_P (t
))
2439 struct c_fileinfo
*finfo
= get_fileinfo (input_filename
);
2440 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
2441 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2442 (t
, finfo
->interface_unknown
);
2444 reset_specialization();
2446 /* Make a declaration for this class in its own scope. */
2447 build_self_reference ();
2452 /* Finish the member declaration given by DECL. */
2455 finish_member_declaration (tree decl
)
2457 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
2460 if (decl
== void_type_node
)
2461 /* The COMPONENT was a friend, not a member, and so there's
2462 nothing for us to do. */
2465 /* We should see only one DECL at a time. */
2466 gcc_assert (TREE_CHAIN (decl
) == NULL_TREE
);
2468 /* Set up access control for DECL. */
2470 = (current_access_specifier
== access_private_node
);
2471 TREE_PROTECTED (decl
)
2472 = (current_access_specifier
== access_protected_node
);
2473 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2475 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
2476 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
2479 /* Mark the DECL as a member of the current class. */
2480 DECL_CONTEXT (decl
) = current_class_type
;
2482 /* Check for bare parameter packs in the member variable declaration. */
2483 if (TREE_CODE (decl
) == FIELD_DECL
)
2485 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
2486 TREE_TYPE (decl
) = error_mark_node
;
2487 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
2488 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
2493 A C language linkage is ignored for the names of class members
2494 and the member function type of class member functions. */
2495 if (DECL_LANG_SPECIFIC (decl
) && DECL_LANGUAGE (decl
) == lang_c
)
2496 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
2498 /* Put functions on the TYPE_METHODS list and everything else on the
2499 TYPE_FIELDS list. Note that these are built up in reverse order.
2500 We reverse them (to obtain declaration order) in finish_struct. */
2501 if (TREE_CODE (decl
) == FUNCTION_DECL
2502 || DECL_FUNCTION_TEMPLATE_P (decl
))
2504 /* We also need to add this function to the
2505 CLASSTYPE_METHOD_VEC. */
2506 if (add_method (current_class_type
, decl
, NULL_TREE
))
2508 TREE_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
2509 TYPE_METHODS (current_class_type
) = decl
;
2511 maybe_add_class_template_decl_list (current_class_type
, decl
,
2515 /* Enter the DECL into the scope of the class. */
2516 else if ((TREE_CODE (decl
) == USING_DECL
&& !DECL_DEPENDENT_P (decl
))
2517 || pushdecl_class_level (decl
))
2519 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2520 go at the beginning. The reason is that lookup_field_1
2521 searches the list in order, and we want a field name to
2522 override a type name so that the "struct stat hack" will
2523 work. In particular:
2525 struct S { enum E { }; int E } s;
2528 is valid. In addition, the FIELD_DECLs must be maintained in
2529 declaration order so that class layout works as expected.
2530 However, we don't need that order until class layout, so we
2531 save a little time by putting FIELD_DECLs on in reverse order
2532 here, and then reversing them in finish_struct_1. (We could
2533 also keep a pointer to the correct insertion points in the
2536 if (TREE_CODE (decl
) == TYPE_DECL
)
2537 TYPE_FIELDS (current_class_type
)
2538 = chainon (TYPE_FIELDS (current_class_type
), decl
);
2541 TREE_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
2542 TYPE_FIELDS (current_class_type
) = decl
;
2545 maybe_add_class_template_decl_list (current_class_type
, decl
,
2550 note_decl_for_pch (decl
);
2553 /* DECL has been declared while we are building a PCH file. Perform
2554 actions that we might normally undertake lazily, but which can be
2555 performed now so that they do not have to be performed in
2556 translation units which include the PCH file. */
2559 note_decl_for_pch (tree decl
)
2561 gcc_assert (pch_file
);
2563 /* There's a good chance that we'll have to mangle names at some
2564 point, even if only for emission in debugging information. */
2565 if ((TREE_CODE (decl
) == VAR_DECL
2566 || TREE_CODE (decl
) == FUNCTION_DECL
)
2567 && !processing_template_decl
)
2571 /* Finish processing a complete template declaration. The PARMS are
2572 the template parameters. */
2575 finish_template_decl (tree parms
)
2578 end_template_decl ();
2580 end_specialization ();
2583 /* Finish processing a template-id (which names a type) of the form
2584 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2585 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2586 the scope of template-id indicated. */
2589 finish_template_type (tree name
, tree args
, int entering_scope
)
2593 decl
= lookup_template_class (name
, args
,
2594 NULL_TREE
, NULL_TREE
, entering_scope
,
2595 tf_warning_or_error
| tf_user
);
2596 if (decl
!= error_mark_node
)
2597 decl
= TYPE_STUB_DECL (decl
);
2602 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2603 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2604 BASE_CLASS, or NULL_TREE if an error occurred. The
2605 ACCESS_SPECIFIER is one of
2606 access_{default,public,protected_private}_node. For a virtual base
2607 we set TREE_TYPE. */
2610 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
2614 if (base
== error_mark_node
)
2616 error ("invalid base-class specification");
2619 else if (! MAYBE_CLASS_TYPE_P (base
))
2621 error ("%qT is not a class type", base
);
2626 if (cp_type_quals (base
) != 0)
2628 error ("base class %qT has cv qualifiers", base
);
2629 base
= TYPE_MAIN_VARIANT (base
);
2631 result
= build_tree_list (access
, base
);
2633 TREE_TYPE (result
) = integer_type_node
;
2639 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2640 what we found when we tried to do the lookup.
2641 LOCATION is the location of the NAME identifier;
2642 The location is used in the error message*/
2645 qualified_name_lookup_error (tree scope
, tree name
,
2646 tree decl
, location_t location
)
2648 if (scope
== error_mark_node
)
2649 ; /* We already complained. */
2650 else if (TYPE_P (scope
))
2652 if (!COMPLETE_TYPE_P (scope
))
2653 error_at (location
, "incomplete type %qT used in nested name specifier",
2655 else if (TREE_CODE (decl
) == TREE_LIST
)
2657 error_at (location
, "reference to %<%T::%D%> is ambiguous",
2659 print_candidates (decl
);
2662 error_at (location
, "%qD is not a member of %qT", name
, scope
);
2664 else if (scope
!= global_namespace
)
2665 error_at (location
, "%qD is not a member of %qD", name
, scope
);
2667 error_at (location
, "%<::%D%> has not been declared", name
);
2670 /* If FNS is a member function, a set of member functions, or a
2671 template-id referring to one or more member functions, return a
2672 BASELINK for FNS, incorporating the current access context.
2673 Otherwise, return FNS unchanged. */
2676 baselink_for_fns (tree fns
)
2681 if (BASELINK_P (fns
)
2682 || error_operand_p (fns
))
2686 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2687 fn
= TREE_OPERAND (fn
, 0);
2688 fn
= get_first_fn (fn
);
2689 if (!DECL_FUNCTION_MEMBER_P (fn
))
2692 cl
= currently_open_derived_class (DECL_CONTEXT (fn
));
2694 cl
= DECL_CONTEXT (fn
);
2695 cl
= TYPE_BINFO (cl
);
2696 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
2699 /* Returns true iff DECL is an automatic variable from a function outside
2703 outer_automatic_var_p (tree decl
)
2705 return ((TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
2706 && DECL_FUNCTION_SCOPE_P (decl
)
2707 && !TREE_STATIC (decl
)
2708 && DECL_CONTEXT (decl
) != current_function_decl
);
2711 /* Returns true iff DECL is a capture field from a lambda that is not our
2712 immediate context. */
2715 outer_lambda_capture_p (tree decl
)
2717 return (TREE_CODE (decl
) == FIELD_DECL
2718 && LAMBDA_TYPE_P (DECL_CONTEXT (decl
))
2719 && (!current_class_type
2720 || !DERIVED_FROM_P (DECL_CONTEXT (decl
), current_class_type
)));
2723 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2724 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2725 if non-NULL, is the type or namespace used to explicitly qualify
2726 ID_EXPRESSION. DECL is the entity to which that name has been
2729 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2730 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2731 be set to true if this expression isn't permitted in a
2732 constant-expression, but it is otherwise not set by this function.
2733 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2734 constant-expression, but a non-constant expression is also
2737 DONE is true if this expression is a complete postfix-expression;
2738 it is false if this expression is followed by '->', '[', '(', etc.
2739 ADDRESS_P is true iff this expression is the operand of '&'.
2740 TEMPLATE_P is true iff the qualified-id was of the form
2741 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2742 appears as a template argument.
2744 If an error occurs, and it is the kind of error that might cause
2745 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2746 is the caller's responsibility to issue the message. *ERROR_MSG
2747 will be a string with static storage duration, so the caller need
2750 Return an expression for the entity, after issuing appropriate
2751 diagnostics. This function is also responsible for transforming a
2752 reference to a non-static member into a COMPONENT_REF that makes
2753 the use of "this" explicit.
2755 Upon return, *IDK will be filled in appropriately. */
2757 finish_id_expression (tree id_expression
,
2761 bool integral_constant_expression_p
,
2762 bool allow_non_integral_constant_expression_p
,
2763 bool *non_integral_constant_expression_p
,
2767 bool template_arg_p
,
2768 const char **error_msg
,
2769 location_t location
)
2771 /* Initialize the output parameters. */
2772 *idk
= CP_ID_KIND_NONE
;
2775 if (id_expression
== error_mark_node
)
2776 return error_mark_node
;
2777 /* If we have a template-id, then no further lookup is
2778 required. If the template-id was for a template-class, we
2779 will sometimes have a TYPE_DECL at this point. */
2780 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2781 || TREE_CODE (decl
) == TYPE_DECL
)
2783 /* Look up the name. */
2786 if (decl
== error_mark_node
)
2788 /* Name lookup failed. */
2791 || (!dependent_type_p (scope
)
2792 && !(TREE_CODE (id_expression
) == IDENTIFIER_NODE
2793 && IDENTIFIER_TYPENAME_P (id_expression
)
2794 && dependent_type_p (TREE_TYPE (id_expression
))))))
2796 /* If the qualifying type is non-dependent (and the name
2797 does not name a conversion operator to a dependent
2798 type), issue an error. */
2799 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
2800 return error_mark_node
;
2804 /* It may be resolved via Koenig lookup. */
2805 *idk
= CP_ID_KIND_UNQUALIFIED
;
2806 return id_expression
;
2809 decl
= id_expression
;
2811 /* If DECL is a variable that would be out of scope under
2812 ANSI/ISO rules, but in scope in the ARM, name lookup
2813 will succeed. Issue a diagnostic here. */
2815 decl
= check_for_out_of_scope_variable (decl
);
2817 /* Remember that the name was used in the definition of
2818 the current class so that we can check later to see if
2819 the meaning would have been different after the class
2820 was entirely defined. */
2821 if (!scope
&& decl
!= error_mark_node
)
2822 maybe_note_name_used_in_class (id_expression
, decl
);
2824 /* Disallow uses of local variables from containing functions, except
2825 within lambda-expressions. */
2826 if ((outer_automatic_var_p (decl
)
2827 || outer_lambda_capture_p (decl
))
2828 /* It's not a use (3.2) if we're in an unevaluated context. */
2829 && !cp_unevaluated_operand
)
2831 tree context
= DECL_CONTEXT (decl
);
2832 tree containing_function
= current_function_decl
;
2833 tree lambda_stack
= NULL_TREE
;
2834 tree lambda_expr
= NULL_TREE
;
2835 tree initializer
= decl
;
2837 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2838 support for an approach in which a reference to a local
2839 [constant] automatic variable in a nested class or lambda body
2840 would enter the expression as an rvalue, which would reduce
2841 the complexity of the problem"
2843 FIXME update for final resolution of core issue 696. */
2844 if (DECL_INTEGRAL_CONSTANT_VAR_P (decl
))
2845 return integral_constant_value (decl
);
2847 if (TYPE_P (context
))
2849 /* Implicit capture of an explicit capture. */
2850 context
= lambda_function (context
);
2851 initializer
= thisify_lambda_field (decl
);
2854 /* If we are in a lambda function, we can move out until we hit
2856 2. a non-lambda function, or
2857 3. a non-default capturing lambda function. */
2858 while (context
!= containing_function
2859 && LAMBDA_FUNCTION_P (containing_function
))
2861 lambda_expr
= CLASSTYPE_LAMBDA_EXPR
2862 (DECL_CONTEXT (containing_function
));
2864 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
2868 lambda_stack
= tree_cons (NULL_TREE
,
2873 = decl_function_context (containing_function
);
2876 if (context
== containing_function
)
2878 decl
= add_default_capture (lambda_stack
,
2879 /*id=*/DECL_NAME (decl
),
2882 else if (lambda_expr
)
2884 error ("%qD is not captured", decl
);
2885 return error_mark_node
;
2889 error (TREE_CODE (decl
) == VAR_DECL
2890 ? "use of %<auto%> variable from containing function"
2891 : "use of parameter from containing function");
2892 error (" %q+#D declared here", decl
);
2893 return error_mark_node
;
2898 /* If we didn't find anything, or what we found was a type,
2899 then this wasn't really an id-expression. */
2900 if (TREE_CODE (decl
) == TEMPLATE_DECL
2901 && !DECL_FUNCTION_TEMPLATE_P (decl
))
2903 *error_msg
= "missing template arguments";
2904 return error_mark_node
;
2906 else if (TREE_CODE (decl
) == TYPE_DECL
2907 || TREE_CODE (decl
) == NAMESPACE_DECL
)
2909 *error_msg
= "expected primary-expression";
2910 return error_mark_node
;
2913 /* If the name resolved to a template parameter, there is no
2914 need to look it up again later. */
2915 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
2916 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
2920 *idk
= CP_ID_KIND_NONE
;
2921 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
2922 decl
= TEMPLATE_PARM_DECL (decl
);
2923 r
= convert_from_reference (DECL_INITIAL (decl
));
2925 if (integral_constant_expression_p
2926 && !dependent_type_p (TREE_TYPE (decl
))
2927 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
2929 if (!allow_non_integral_constant_expression_p
)
2930 error ("template parameter %qD of type %qT is not allowed in "
2931 "an integral constant expression because it is not of "
2932 "integral or enumeration type", decl
, TREE_TYPE (decl
));
2933 *non_integral_constant_expression_p
= true;
2937 /* Similarly, we resolve enumeration constants to their
2938 underlying values. */
2939 else if (TREE_CODE (decl
) == CONST_DECL
)
2941 *idk
= CP_ID_KIND_NONE
;
2942 if (!processing_template_decl
)
2944 used_types_insert (TREE_TYPE (decl
));
2945 return DECL_INITIAL (decl
);
2953 /* If the declaration was explicitly qualified indicate
2954 that. The semantics of `A::f(3)' are different than
2955 `f(3)' if `f' is virtual. */
2957 ? CP_ID_KIND_QUALIFIED
2958 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2959 ? CP_ID_KIND_TEMPLATE_ID
2960 : CP_ID_KIND_UNQUALIFIED
));
2965 An id-expression is type-dependent if it contains an
2966 identifier that was declared with a dependent type.
2968 The standard is not very specific about an id-expression that
2969 names a set of overloaded functions. What if some of them
2970 have dependent types and some of them do not? Presumably,
2971 such a name should be treated as a dependent name. */
2972 /* Assume the name is not dependent. */
2973 dependent_p
= false;
2974 if (!processing_template_decl
)
2975 /* No names are dependent outside a template. */
2977 /* A template-id where the name of the template was not resolved
2978 is definitely dependent. */
2979 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2980 && (TREE_CODE (TREE_OPERAND (decl
, 0))
2981 == IDENTIFIER_NODE
))
2983 /* For anything except an overloaded function, just check its
2985 else if (!is_overloaded_fn (decl
))
2987 = dependent_type_p (TREE_TYPE (decl
));
2988 /* For a set of overloaded functions, check each of the
2994 if (BASELINK_P (fns
))
2995 fns
= BASELINK_FUNCTIONS (fns
);
2997 /* For a template-id, check to see if the template
2998 arguments are dependent. */
2999 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
3001 tree args
= TREE_OPERAND (fns
, 1);
3002 dependent_p
= any_dependent_template_arguments_p (args
);
3003 /* The functions are those referred to by the
3005 fns
= TREE_OPERAND (fns
, 0);
3008 /* If there are no dependent template arguments, go through
3009 the overloaded functions. */
3010 while (fns
&& !dependent_p
)
3012 tree fn
= OVL_CURRENT (fns
);
3014 /* Member functions of dependent classes are
3016 if (TREE_CODE (fn
) == FUNCTION_DECL
3017 && type_dependent_expression_p (fn
))
3019 else if (TREE_CODE (fn
) == TEMPLATE_DECL
3020 && dependent_template_p (fn
))
3023 fns
= OVL_NEXT (fns
);
3027 /* If the name was dependent on a template parameter, we will
3028 resolve the name at instantiation time. */
3031 /* Create a SCOPE_REF for qualified names, if the scope is
3037 if (address_p
&& done
)
3038 decl
= finish_qualified_id_expr (scope
, decl
,
3044 tree type
= NULL_TREE
;
3045 if (DECL_P (decl
) && !dependent_scope_p (scope
))
3046 type
= TREE_TYPE (decl
);
3047 decl
= build_qualified_name (type
,
3053 if (TREE_TYPE (decl
))
3054 decl
= convert_from_reference (decl
);
3057 /* A TEMPLATE_ID already contains all the information we
3059 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
)
3060 return id_expression
;
3061 *idk
= CP_ID_KIND_UNQUALIFIED_DEPENDENT
;
3062 /* If we found a variable, then name lookup during the
3063 instantiation will always resolve to the same VAR_DECL
3064 (or an instantiation thereof). */
3065 if (TREE_CODE (decl
) == VAR_DECL
3066 || TREE_CODE (decl
) == PARM_DECL
)
3067 return convert_from_reference (decl
);
3068 /* The same is true for FIELD_DECL, but we also need to
3069 make sure that the syntax is correct. */
3070 else if (TREE_CODE (decl
) == FIELD_DECL
)
3072 /* Since SCOPE is NULL here, this is an unqualified name.
3073 Access checking has been performed during name lookup
3074 already. Turn off checking to avoid duplicate errors. */
3075 push_deferring_access_checks (dk_no_check
);
3076 decl
= finish_non_static_data_member
3077 (decl
, current_class_ref
,
3078 /*qualifying_scope=*/NULL_TREE
);
3079 pop_deferring_access_checks ();
3082 return id_expression
;
3085 /* Only certain kinds of names are allowed in constant
3086 expression. Enumerators and template parameters have already
3087 been handled above. */
3088 if (integral_constant_expression_p
3089 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl
)
3090 && ! builtin_valid_in_constant_expr_p (decl
))
3092 if (!allow_non_integral_constant_expression_p
)
3094 error ("%qD cannot appear in a constant-expression", decl
);
3095 return error_mark_node
;
3097 *non_integral_constant_expression_p
= true;
3100 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3102 error ("use of namespace %qD as expression", decl
);
3103 return error_mark_node
;
3105 else if (DECL_CLASS_TEMPLATE_P (decl
))
3107 error ("use of class template %qT as expression", decl
);
3108 return error_mark_node
;
3110 else if (TREE_CODE (decl
) == TREE_LIST
)
3112 /* Ambiguous reference to base members. */
3113 error ("request for member %qD is ambiguous in "
3114 "multiple inheritance lattice", id_expression
);
3115 print_candidates (decl
);
3116 return error_mark_node
;
3119 /* Mark variable-like entities as used. Functions are similarly
3120 marked either below or after overload resolution. */
3121 if (TREE_CODE (decl
) == VAR_DECL
3122 || TREE_CODE (decl
) == PARM_DECL
3123 || TREE_CODE (decl
) == RESULT_DECL
)
3128 decl
= (adjust_result_of_qualified_name_lookup
3129 (decl
, scope
, current_class_type
));
3131 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3134 if (TREE_CODE (decl
) == FIELD_DECL
|| BASELINK_P (decl
))
3135 decl
= finish_qualified_id_expr (scope
,
3143 tree r
= convert_from_reference (decl
);
3145 if (processing_template_decl
&& TYPE_P (scope
))
3146 r
= build_qualified_name (TREE_TYPE (r
),
3152 else if (TREE_CODE (decl
) == FIELD_DECL
)
3154 /* Since SCOPE is NULL here, this is an unqualified name.
3155 Access checking has been performed during name lookup
3156 already. Turn off checking to avoid duplicate errors. */
3157 push_deferring_access_checks (dk_no_check
);
3158 decl
= finish_non_static_data_member (decl
, current_class_ref
,
3159 /*qualifying_scope=*/NULL_TREE
);
3160 pop_deferring_access_checks ();
3162 else if (is_overloaded_fn (decl
))
3167 if (TREE_CODE (first_fn
) == TEMPLATE_ID_EXPR
)
3168 first_fn
= TREE_OPERAND (first_fn
, 0);
3169 first_fn
= get_first_fn (first_fn
);
3170 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
3171 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
3173 if (!really_overloaded_fn (decl
))
3174 mark_used (first_fn
);
3177 && TREE_CODE (first_fn
) == FUNCTION_DECL
3178 && DECL_FUNCTION_MEMBER_P (first_fn
)
3179 && !shared_member_p (decl
))
3181 /* A set of member functions. */
3182 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3183 return finish_class_member_access_expr (decl
, id_expression
,
3184 /*template_p=*/false,
3185 tf_warning_or_error
);
3188 decl
= baselink_for_fns (decl
);
3192 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3193 && DECL_CLASS_SCOPE_P (decl
))
3195 tree context
= context_for_name_lookup (decl
);
3196 if (context
!= current_class_type
)
3198 tree path
= currently_open_derived_class (context
);
3199 perform_or_defer_access_check (TYPE_BINFO (path
),
3204 decl
= convert_from_reference (decl
);
3208 if (TREE_DEPRECATED (decl
))
3209 warn_deprecated_use (decl
, NULL_TREE
);
3214 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3215 use as a type-specifier. */
3218 finish_typeof (tree expr
)
3222 if (type_dependent_expression_p (expr
))
3224 type
= cxx_make_type (TYPEOF_TYPE
);
3225 TYPEOF_TYPE_EXPR (type
) = expr
;
3226 SET_TYPE_STRUCTURAL_EQUALITY (type
);
3231 type
= unlowered_expr_type (expr
);
3233 if (!type
|| type
== unknown_type_node
)
3235 error ("type of %qE is unknown", expr
);
3236 return error_mark_node
;
3242 /* Perform C++-specific checks for __builtin_offsetof before calling
3246 finish_offsetof (tree expr
)
3248 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
3250 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3251 TREE_OPERAND (expr
, 2));
3252 return error_mark_node
;
3254 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
3255 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
3256 || TREE_CODE (TREE_TYPE (expr
)) == UNKNOWN_TYPE
)
3258 if (TREE_CODE (expr
) == COMPONENT_REF
3259 || TREE_CODE (expr
) == COMPOUND_EXPR
)
3260 expr
= TREE_OPERAND (expr
, 1);
3261 error ("cannot apply %<offsetof%> to member function %qD", expr
);
3262 return error_mark_node
;
3264 if (TREE_CODE (expr
) == INDIRECT_REF
&& REFERENCE_REF_P (expr
))
3265 expr
= TREE_OPERAND (expr
, 0);
3266 return fold_offsetof (expr
, NULL_TREE
);
3269 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3270 function is broken out from the above for the benefit of the tree-ssa
3274 simplify_aggr_init_expr (tree
*tp
)
3276 tree aggr_init_expr
= *tp
;
3278 /* Form an appropriate CALL_EXPR. */
3279 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
3280 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
3281 tree type
= TREE_TYPE (slot
);
3284 enum style_t
{ ctor
, arg
, pcc
} style
;
3286 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
3288 #ifdef PCC_STATIC_STRUCT_RETURN
3294 gcc_assert (TREE_ADDRESSABLE (type
));
3298 call_expr
= build_call_array_loc (input_location
,
3299 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
3301 aggr_init_expr_nargs (aggr_init_expr
),
3302 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
3306 /* Replace the first argument to the ctor with the address of the
3308 cxx_mark_addressable (slot
);
3309 CALL_EXPR_ARG (call_expr
, 0) =
3310 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
3312 else if (style
== arg
)
3314 /* Just mark it addressable here, and leave the rest to
3315 expand_call{,_inline}. */
3316 cxx_mark_addressable (slot
);
3317 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
3318 call_expr
= build2 (MODIFY_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
3320 else if (style
== pcc
)
3322 /* If we're using the non-reentrant PCC calling convention, then we
3323 need to copy the returned value out of the static buffer into the
3325 push_deferring_access_checks (dk_no_check
);
3326 call_expr
= build_aggr_init (slot
, call_expr
,
3327 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
3328 tf_warning_or_error
);
3329 pop_deferring_access_checks ();
3330 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
3333 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
3335 tree init
= build_zero_init (type
, NULL_TREE
,
3336 /*static_storage_p=*/false);
3337 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
3338 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
3345 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3348 emit_associated_thunks (tree fn
)
3350 /* When we use vcall offsets, we emit thunks with the virtual
3351 functions to which they thunk. The whole point of vcall offsets
3352 is so that you can know statically the entire set of thunks that
3353 will ever be needed for a given virtual function, thereby
3354 enabling you to output all the thunks with the function itself. */
3355 if (DECL_VIRTUAL_P (fn
)
3356 /* Do not emit thunks for extern template instantiations. */
3357 && ! DECL_REALLY_EXTERN (fn
))
3361 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= TREE_CHAIN (thunk
))
3363 if (!THUNK_ALIAS (thunk
))
3365 use_thunk (thunk
, /*emit_p=*/1);
3366 if (DECL_RESULT_THUNK_P (thunk
))
3370 for (probe
= DECL_THUNKS (thunk
);
3371 probe
; probe
= TREE_CHAIN (probe
))
3372 use_thunk (probe
, /*emit_p=*/1);
3376 gcc_assert (!DECL_THUNKS (thunk
));
3381 /* Generate RTL for FN. */
3384 expand_or_defer_fn_1 (tree fn
)
3386 /* When the parser calls us after finishing the body of a template
3387 function, we don't really want to expand the body. */
3388 if (processing_template_decl
)
3390 /* Normally, collection only occurs in rest_of_compilation. So,
3391 if we don't collect here, we never collect junk generated
3392 during the processing of templates until we hit a
3393 non-template function. It's not safe to do this inside a
3394 nested class, though, as the parser may have local state that
3395 is not a GC root. */
3396 if (!function_depth
)
3401 gcc_assert (DECL_SAVED_TREE (fn
));
3403 /* If this is a constructor or destructor body, we have to clone
3405 if (maybe_clone_body (fn
))
3407 /* We don't want to process FN again, so pretend we've written
3408 it out, even though we haven't. */
3409 TREE_ASM_WRITTEN (fn
) = 1;
3410 DECL_SAVED_TREE (fn
) = NULL_TREE
;
3414 /* We make a decision about linkage for these functions at the end
3415 of the compilation. Until that point, we do not want the back
3416 end to output them -- but we do want it to see the bodies of
3417 these functions so that it can inline them as appropriate. */
3418 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
3420 if (DECL_INTERFACE_KNOWN (fn
))
3421 /* We've already made a decision as to how this function will
3425 DECL_EXTERNAL (fn
) = 1;
3426 DECL_NOT_REALLY_EXTERN (fn
) = 1;
3427 note_vague_linkage_fn (fn
);
3428 /* A non-template inline function with external linkage will
3429 always be COMDAT. As we must eventually determine the
3430 linkage of all functions, and as that causes writes to
3431 the data mapped in from the PCH file, it's advantageous
3432 to mark the functions at this point. */
3433 if (!DECL_IMPLICIT_INSTANTIATION (fn
))
3435 /* This function must have external linkage, as
3436 otherwise DECL_INTERFACE_KNOWN would have been
3438 gcc_assert (TREE_PUBLIC (fn
));
3439 comdat_linkage (fn
);
3440 DECL_INTERFACE_KNOWN (fn
) = 1;
3444 import_export_decl (fn
);
3446 /* If the user wants us to keep all inline functions, then mark
3447 this function as needed so that finish_file will make sure to
3448 output it later. Similarly, all dllexport'd functions must
3449 be emitted; there may be callers in other DLLs. */
3450 if ((flag_keep_inline_functions
&& DECL_DECLARED_INLINE_P (fn
))
3451 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
)))
3455 /* There's no reason to do any of the work here if we're only doing
3456 semantic analysis; this code just generates RTL. */
3457 if (flag_syntax_only
)
3464 expand_or_defer_fn (tree fn
)
3466 if (expand_or_defer_fn_1 (fn
))
3470 /* Expand or defer, at the whim of the compilation unit manager. */
3471 cgraph_finalize_function (fn
, function_depth
> 1);
3472 emit_associated_thunks (fn
);
3485 /* Helper function for walk_tree, used by finalize_nrv below. */
3488 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
3490 struct nrv_data
*dp
= (struct nrv_data
*)data
;
3493 /* No need to walk into types. There wouldn't be any need to walk into
3494 non-statements, except that we have to consider STMT_EXPRs. */
3497 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3498 but differs from using NULL_TREE in that it indicates that we care
3499 about the value of the RESULT_DECL. */
3500 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
3501 TREE_OPERAND (*tp
, 0) = dp
->result
;
3502 /* Change all cleanups for the NRV to only run when an exception is
3504 else if (TREE_CODE (*tp
) == CLEANUP_STMT
3505 && CLEANUP_DECL (*tp
) == dp
->var
)
3506 CLEANUP_EH_ONLY (*tp
) = 1;
3507 /* Replace the DECL_EXPR for the NRV with an initialization of the
3508 RESULT_DECL, if needed. */
3509 else if (TREE_CODE (*tp
) == DECL_EXPR
3510 && DECL_EXPR_DECL (*tp
) == dp
->var
)
3513 if (DECL_INITIAL (dp
->var
)
3514 && DECL_INITIAL (dp
->var
) != error_mark_node
)
3515 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
3516 DECL_INITIAL (dp
->var
));
3518 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
3519 DECL_INITIAL (dp
->var
) = NULL_TREE
;
3520 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
3523 /* And replace all uses of the NRV with the RESULT_DECL. */
3524 else if (*tp
== dp
->var
)
3527 /* Avoid walking into the same tree more than once. Unfortunately, we
3528 can't just use walk_tree_without duplicates because it would only call
3529 us for the first occurrence of dp->var in the function body. */
3530 slot
= htab_find_slot (dp
->visited
, *tp
, INSERT
);
3536 /* Keep iterating. */
3540 /* Called from finish_function to implement the named return value
3541 optimization by overriding all the RETURN_EXPRs and pertinent
3542 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3543 RESULT_DECL for the function. */
3546 finalize_nrv (tree
*tp
, tree var
, tree result
)
3548 struct nrv_data data
;
3550 /* Copy debugging information from VAR to RESULT. */
3551 DECL_NAME (result
) = DECL_NAME (var
);
3552 DECL_ARTIFICIAL (result
) = DECL_ARTIFICIAL (var
);
3553 DECL_IGNORED_P (result
) = DECL_IGNORED_P (var
);
3554 DECL_SOURCE_LOCATION (result
) = DECL_SOURCE_LOCATION (var
);
3555 DECL_ABSTRACT_ORIGIN (result
) = DECL_ABSTRACT_ORIGIN (var
);
3556 /* Don't forget that we take its address. */
3557 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
3560 data
.result
= result
;
3561 data
.visited
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
3562 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
3563 htab_delete (data
.visited
);
3566 /* Return the declaration for the function called by CALL_EXPR T,
3567 TYPE is the class type of the clause decl. */
3570 omp_clause_info_fndecl (tree t
, tree type
)
3572 tree ret
= get_callee_fndecl (t
);
3577 gcc_assert (TREE_CODE (t
) == CALL_EXPR
);
3578 t
= CALL_EXPR_FN (t
);
3580 if (TREE_CODE (t
) == OBJ_TYPE_REF
)
3582 t
= cp_fold_obj_type_ref (t
, type
);
3583 if (TREE_CODE (t
) == ADDR_EXPR
3584 && TREE_CODE (TREE_OPERAND (t
, 0)) == FUNCTION_DECL
)
3585 return TREE_OPERAND (t
, 0);
3591 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3594 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
3595 bool need_copy_ctor
, bool need_copy_assignment
)
3597 int save_errorcount
= errorcount
;
3600 /* Always allocate 3 elements for simplicity. These are the
3601 function decls for the ctor, dtor, and assignment op.
3602 This layout is known to the three lang hooks,
3603 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3604 and cxx_omp_clause_assign_op. */
3605 info
= make_tree_vec (3);
3606 CP_OMP_CLAUSE_INFO (c
) = info
;
3608 if (need_default_ctor
3609 || (need_copy_ctor
&& !TYPE_HAS_TRIVIAL_INIT_REF (type
)))
3613 if (need_default_ctor
)
3617 t
= build_int_cst (build_pointer_type (type
), 0);
3618 t
= build1 (INDIRECT_REF
, type
, t
);
3619 vec
= make_tree_vector_single (t
);
3621 t
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
3622 &vec
, type
, LOOKUP_NORMAL
,
3623 tf_warning_or_error
);
3626 release_tree_vector (vec
);
3628 if (targetm
.cxx
.cdtor_returns_this () || errorcount
)
3629 /* Because constructors and destructors return this,
3630 the call will have been cast to "void". Remove the
3631 cast here. We would like to use STRIP_NOPS, but it
3632 wouldn't work here because TYPE_MODE (t) and
3633 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3634 They are VOIDmode and Pmode, respectively. */
3635 if (TREE_CODE (t
) == NOP_EXPR
)
3636 t
= TREE_OPERAND (t
, 0);
3638 TREE_VEC_ELT (info
, 0) = get_callee_fndecl (t
);
3641 if ((need_default_ctor
|| need_copy_ctor
)
3642 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3644 t
= build_int_cst (build_pointer_type (type
), 0);
3645 t
= build1 (INDIRECT_REF
, type
, t
);
3646 t
= build_special_member_call (t
, complete_dtor_identifier
,
3647 NULL
, type
, LOOKUP_NORMAL
,
3648 tf_warning_or_error
);
3650 if (targetm
.cxx
.cdtor_returns_this () || errorcount
)
3651 /* Because constructors and destructors return this,
3652 the call will have been cast to "void". Remove the
3653 cast here. We would like to use STRIP_NOPS, but it
3654 wouldn't work here because TYPE_MODE (t) and
3655 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3656 They are VOIDmode and Pmode, respectively. */
3657 if (TREE_CODE (t
) == NOP_EXPR
)
3658 t
= TREE_OPERAND (t
, 0);
3660 TREE_VEC_ELT (info
, 1) = omp_clause_info_fndecl (t
, type
);
3663 if (need_copy_assignment
&& !TYPE_HAS_TRIVIAL_ASSIGN_REF (type
))
3667 t
= build_int_cst (build_pointer_type (type
), 0);
3668 t
= build1 (INDIRECT_REF
, type
, t
);
3669 vec
= make_tree_vector_single (t
);
3670 t
= build_special_member_call (t
, ansi_assopname (NOP_EXPR
),
3671 &vec
, type
, LOOKUP_NORMAL
,
3672 tf_warning_or_error
);
3673 release_tree_vector (vec
);
3675 /* We'll have called convert_from_reference on the call, which
3676 may well have added an indirect_ref. It's unneeded here,
3677 and in the way, so kill it. */
3678 if (TREE_CODE (t
) == INDIRECT_REF
)
3679 t
= TREE_OPERAND (t
, 0);
3681 TREE_VEC_ELT (info
, 2) = omp_clause_info_fndecl (t
, type
);
3684 return errorcount
!= save_errorcount
;
3687 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3688 Remove any elements from the list that are invalid. */
3691 finish_omp_clauses (tree clauses
)
3693 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
3694 tree c
, t
, *pc
= &clauses
;
3697 bitmap_obstack_initialize (NULL
);
3698 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
3699 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
3700 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
3702 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3704 bool remove
= false;
3706 switch (OMP_CLAUSE_CODE (c
))
3708 case OMP_CLAUSE_SHARED
:
3710 goto check_dup_generic
;
3711 case OMP_CLAUSE_PRIVATE
:
3713 goto check_dup_generic
;
3714 case OMP_CLAUSE_REDUCTION
:
3716 goto check_dup_generic
;
3717 case OMP_CLAUSE_COPYPRIVATE
:
3718 name
= "copyprivate";
3719 goto check_dup_generic
;
3720 case OMP_CLAUSE_COPYIN
:
3722 goto check_dup_generic
;
3724 t
= OMP_CLAUSE_DECL (c
);
3725 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3727 if (processing_template_decl
)
3730 error ("%qD is not a variable in clause %qs", t
, name
);
3732 error ("%qE is not a variable in clause %qs", t
, name
);
3735 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3736 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
3737 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
3739 error ("%qD appears more than once in data clauses", t
);
3743 bitmap_set_bit (&generic_head
, DECL_UID (t
));
3746 case OMP_CLAUSE_FIRSTPRIVATE
:
3747 t
= OMP_CLAUSE_DECL (c
);
3748 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3750 if (processing_template_decl
)
3753 error ("%qD is not a variable in clause %<firstprivate%>", t
);
3755 error ("%qE is not a variable in clause %<firstprivate%>", t
);
3758 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3759 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
3761 error ("%qD appears more than once in data clauses", t
);
3765 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
3768 case OMP_CLAUSE_LASTPRIVATE
:
3769 t
= OMP_CLAUSE_DECL (c
);
3770 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3772 if (processing_template_decl
)
3775 error ("%qD is not a variable in clause %<lastprivate%>", t
);
3777 error ("%qE is not a variable in clause %<lastprivate%>", t
);
3780 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3781 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
3783 error ("%qD appears more than once in data clauses", t
);
3787 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
3791 t
= OMP_CLAUSE_IF_EXPR (c
);
3792 t
= maybe_convert_cond (t
);
3793 if (t
== error_mark_node
)
3795 OMP_CLAUSE_IF_EXPR (c
) = t
;
3798 case OMP_CLAUSE_NUM_THREADS
:
3799 t
= OMP_CLAUSE_NUM_THREADS_EXPR (c
);
3800 if (t
== error_mark_node
)
3802 else if (!type_dependent_expression_p (t
)
3803 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
3805 error ("num_threads expression must be integral");
3810 case OMP_CLAUSE_SCHEDULE
:
3811 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
3814 else if (t
== error_mark_node
)
3816 else if (!type_dependent_expression_p (t
)
3817 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
3819 error ("schedule chunk size expression must be integral");
3824 case OMP_CLAUSE_NOWAIT
:
3825 case OMP_CLAUSE_ORDERED
:
3826 case OMP_CLAUSE_DEFAULT
:
3827 case OMP_CLAUSE_UNTIED
:
3828 case OMP_CLAUSE_COLLAPSE
:
3836 *pc
= OMP_CLAUSE_CHAIN (c
);
3838 pc
= &OMP_CLAUSE_CHAIN (c
);
3841 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3843 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
3844 bool remove
= false;
3845 bool need_complete_non_reference
= false;
3846 bool need_default_ctor
= false;
3847 bool need_copy_ctor
= false;
3848 bool need_copy_assignment
= false;
3849 bool need_implicitly_determined
= false;
3850 tree type
, inner_type
;
3854 case OMP_CLAUSE_SHARED
:
3856 need_implicitly_determined
= true;
3858 case OMP_CLAUSE_PRIVATE
:
3860 need_complete_non_reference
= true;
3861 need_default_ctor
= true;
3862 need_implicitly_determined
= true;
3864 case OMP_CLAUSE_FIRSTPRIVATE
:
3865 name
= "firstprivate";
3866 need_complete_non_reference
= true;
3867 need_copy_ctor
= true;
3868 need_implicitly_determined
= true;
3870 case OMP_CLAUSE_LASTPRIVATE
:
3871 name
= "lastprivate";
3872 need_complete_non_reference
= true;
3873 need_copy_assignment
= true;
3874 need_implicitly_determined
= true;
3876 case OMP_CLAUSE_REDUCTION
:
3878 need_implicitly_determined
= true;
3880 case OMP_CLAUSE_COPYPRIVATE
:
3881 name
= "copyprivate";
3882 need_copy_assignment
= true;
3884 case OMP_CLAUSE_COPYIN
:
3886 need_copy_assignment
= true;
3889 pc
= &OMP_CLAUSE_CHAIN (c
);
3893 t
= OMP_CLAUSE_DECL (c
);
3894 if (processing_template_decl
3895 && TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3897 pc
= &OMP_CLAUSE_CHAIN (c
);
3903 case OMP_CLAUSE_LASTPRIVATE
:
3904 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
3905 need_default_ctor
= true;
3908 case OMP_CLAUSE_REDUCTION
:
3909 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
3910 || POINTER_TYPE_P (TREE_TYPE (t
)))
3912 error ("%qE has invalid type for %<reduction%>", t
);
3915 else if (FLOAT_TYPE_P (TREE_TYPE (t
)))
3917 enum tree_code r_code
= OMP_CLAUSE_REDUCTION_CODE (c
);
3925 error ("%qE has invalid type for %<reduction(%s)%>",
3926 t
, operator_name_info
[r_code
].name
);
3932 case OMP_CLAUSE_COPYIN
:
3933 if (TREE_CODE (t
) != VAR_DECL
|| !DECL_THREAD_LOCAL_P (t
))
3935 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
3944 if (need_complete_non_reference
)
3946 t
= require_complete_type (t
);
3947 if (t
== error_mark_node
)
3949 else if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
3951 error ("%qE has reference type for %qs", t
, name
);
3955 if (need_implicitly_determined
)
3957 const char *share_name
= NULL
;
3959 if (TREE_CODE (t
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (t
))
3960 share_name
= "threadprivate";
3961 else switch (cxx_omp_predetermined_sharing (t
))
3963 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
3965 case OMP_CLAUSE_DEFAULT_SHARED
:
3966 share_name
= "shared";
3968 case OMP_CLAUSE_DEFAULT_PRIVATE
:
3969 share_name
= "private";
3976 error ("%qE is predetermined %qs for %qs",
3977 t
, share_name
, name
);
3982 /* We're interested in the base element, not arrays. */
3983 inner_type
= type
= TREE_TYPE (t
);
3984 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
3985 inner_type
= TREE_TYPE (inner_type
);
3987 /* Check for special function availability by building a call to one.
3988 Save the results, because later we won't be in the right context
3989 for making these queries. */
3990 if (CLASS_TYPE_P (inner_type
)
3991 && (need_default_ctor
|| need_copy_ctor
|| need_copy_assignment
)
3992 && !type_dependent_expression_p (t
)
3993 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
3994 need_copy_ctor
, need_copy_assignment
))
3998 *pc
= OMP_CLAUSE_CHAIN (c
);
4000 pc
= &OMP_CLAUSE_CHAIN (c
);
4003 bitmap_obstack_release (NULL
);
4007 /* For all variables in the tree_list VARS, mark them as thread local. */
4010 finish_omp_threadprivate (tree vars
)
4014 /* Mark every variable in VARS to be assigned thread local storage. */
4015 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
4017 tree v
= TREE_PURPOSE (t
);
4019 if (error_operand_p (v
))
4021 else if (TREE_CODE (v
) != VAR_DECL
)
4022 error ("%<threadprivate%> %qD is not file, namespace "
4023 "or block scope variable", v
);
4024 /* If V had already been marked threadprivate, it doesn't matter
4025 whether it had been used prior to this point. */
4026 else if (TREE_USED (v
)
4027 && (DECL_LANG_SPECIFIC (v
) == NULL
4028 || !CP_DECL_THREADPRIVATE_P (v
)))
4029 error ("%qE declared %<threadprivate%> after first use", v
);
4030 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
4031 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
4032 else if (! COMPLETE_TYPE_P (TREE_TYPE (v
)))
4033 error ("%<threadprivate%> %qE has incomplete type", v
);
4034 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
4035 && CP_DECL_CONTEXT (v
) != current_class_type
)
4036 error ("%<threadprivate%> %qE directive not "
4037 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
4040 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4041 if (DECL_LANG_SPECIFIC (v
) == NULL
)
4043 retrofit_lang_decl (v
);
4045 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4046 after the allocation of the lang_decl structure. */
4047 if (DECL_DISCRIMINATOR_P (v
))
4048 DECL_LANG_SPECIFIC (v
)->u
.base
.u2sel
= 1;
4051 if (! DECL_THREAD_LOCAL_P (v
))
4053 DECL_TLS_MODEL (v
) = decl_default_tls_model (v
);
4054 /* If rtl has been already set for this var, call
4055 make_decl_rtl once again, so that encode_section_info
4056 has a chance to look at the new decl flags. */
4057 if (DECL_RTL_SET_P (v
))
4060 CP_DECL_THREADPRIVATE_P (v
) = 1;
4065 /* Build an OpenMP structured block. */
4068 begin_omp_structured_block (void)
4070 return do_pushlevel (sk_omp
);
4074 finish_omp_structured_block (tree block
)
4076 return do_poplevel (block
);
4079 /* Similarly, except force the retention of the BLOCK. */
4082 begin_omp_parallel (void)
4084 keep_next_level (true);
4085 return begin_omp_structured_block ();
4089 finish_omp_parallel (tree clauses
, tree body
)
4093 body
= finish_omp_structured_block (body
);
4095 stmt
= make_node (OMP_PARALLEL
);
4096 TREE_TYPE (stmt
) = void_type_node
;
4097 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
4098 OMP_PARALLEL_BODY (stmt
) = body
;
4100 return add_stmt (stmt
);
4104 begin_omp_task (void)
4106 keep_next_level (true);
4107 return begin_omp_structured_block ();
4111 finish_omp_task (tree clauses
, tree body
)
4115 body
= finish_omp_structured_block (body
);
4117 stmt
= make_node (OMP_TASK
);
4118 TREE_TYPE (stmt
) = void_type_node
;
4119 OMP_TASK_CLAUSES (stmt
) = clauses
;
4120 OMP_TASK_BODY (stmt
) = body
;
4122 return add_stmt (stmt
);
4125 /* Helper function for finish_omp_for. Convert Ith random access iterator
4126 into integral iterator. Return FALSE if successful. */
4129 handle_omp_for_class_iterator (int i
, location_t locus
, tree declv
, tree initv
,
4130 tree condv
, tree incrv
, tree
*body
,
4131 tree
*pre_body
, tree clauses
)
4133 tree diff
, iter_init
, iter_incr
= NULL
, last
;
4134 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
4135 tree decl
= TREE_VEC_ELT (declv
, i
);
4136 tree init
= TREE_VEC_ELT (initv
, i
);
4137 tree cond
= TREE_VEC_ELT (condv
, i
);
4138 tree incr
= TREE_VEC_ELT (incrv
, i
);
4140 location_t elocus
= locus
;
4142 if (init
&& EXPR_HAS_LOCATION (init
))
4143 elocus
= EXPR_LOCATION (init
);
4145 switch (TREE_CODE (cond
))
4151 if (TREE_OPERAND (cond
, 1) == iter
)
4152 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
4153 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
4154 if (TREE_OPERAND (cond
, 0) != iter
)
4155 cond
= error_mark_node
;
4158 tree tem
= build_x_binary_op (TREE_CODE (cond
), iter
, ERROR_MARK
,
4159 TREE_OPERAND (cond
, 1), ERROR_MARK
,
4160 NULL
, tf_warning_or_error
);
4161 if (error_operand_p (tem
))
4166 cond
= error_mark_node
;
4169 if (cond
== error_mark_node
)
4171 error_at (elocus
, "invalid controlling predicate");
4174 diff
= build_x_binary_op (MINUS_EXPR
, TREE_OPERAND (cond
, 1),
4175 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
4176 tf_warning_or_error
);
4177 if (error_operand_p (diff
))
4179 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
4181 error_at (elocus
, "difference between %qE and %qD does not have integer type",
4182 TREE_OPERAND (cond
, 1), iter
);
4186 switch (TREE_CODE (incr
))
4188 case PREINCREMENT_EXPR
:
4189 case PREDECREMENT_EXPR
:
4190 case POSTINCREMENT_EXPR
:
4191 case POSTDECREMENT_EXPR
:
4192 if (TREE_OPERAND (incr
, 0) != iter
)
4194 incr
= error_mark_node
;
4197 iter_incr
= build_x_unary_op (TREE_CODE (incr
), iter
,
4198 tf_warning_or_error
);
4199 if (error_operand_p (iter_incr
))
4201 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
4202 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
4203 incr
= integer_one_node
;
4205 incr
= integer_minus_one_node
;
4208 if (TREE_OPERAND (incr
, 0) != iter
)
4209 incr
= error_mark_node
;
4210 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
4211 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
4213 tree rhs
= TREE_OPERAND (incr
, 1);
4214 if (TREE_OPERAND (rhs
, 0) == iter
)
4216 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
4218 incr
= error_mark_node
;
4221 iter_incr
= build_x_modify_expr (iter
, TREE_CODE (rhs
),
4222 TREE_OPERAND (rhs
, 1),
4223 tf_warning_or_error
);
4224 if (error_operand_p (iter_incr
))
4226 incr
= TREE_OPERAND (rhs
, 1);
4227 incr
= cp_convert (TREE_TYPE (diff
), incr
);
4228 if (TREE_CODE (rhs
) == MINUS_EXPR
)
4230 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
4231 incr
= fold_if_not_in_template (incr
);
4233 if (TREE_CODE (incr
) != INTEGER_CST
4234 && (TREE_CODE (incr
) != NOP_EXPR
4235 || (TREE_CODE (TREE_OPERAND (incr
, 0))
4240 else if (TREE_OPERAND (rhs
, 1) == iter
)
4242 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
4243 || TREE_CODE (rhs
) != PLUS_EXPR
)
4244 incr
= error_mark_node
;
4247 iter_incr
= build_x_binary_op (PLUS_EXPR
,
4248 TREE_OPERAND (rhs
, 0),
4251 tf_warning_or_error
);
4252 if (error_operand_p (iter_incr
))
4254 iter_incr
= build_x_modify_expr (iter
, NOP_EXPR
,
4256 tf_warning_or_error
);
4257 if (error_operand_p (iter_incr
))
4259 incr
= TREE_OPERAND (rhs
, 0);
4264 incr
= error_mark_node
;
4267 incr
= error_mark_node
;
4270 incr
= error_mark_node
;
4274 if (incr
== error_mark_node
)
4276 error_at (elocus
, "invalid increment expression");
4280 incr
= cp_convert (TREE_TYPE (diff
), incr
);
4281 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
4282 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
4283 && OMP_CLAUSE_DECL (c
) == iter
)
4286 decl
= create_temporary_var (TREE_TYPE (diff
));
4288 add_decl_expr (decl
);
4289 last
= create_temporary_var (TREE_TYPE (diff
));
4291 add_decl_expr (last
);
4292 if (c
&& iter_incr
== NULL
)
4294 incr_var
= create_temporary_var (TREE_TYPE (diff
));
4295 pushdecl (incr_var
);
4296 add_decl_expr (incr_var
);
4298 gcc_assert (stmts_are_full_exprs_p ());
4300 orig_pre_body
= *pre_body
;
4301 *pre_body
= push_stmt_list ();
4303 add_stmt (orig_pre_body
);
4305 finish_expr_stmt (build_x_modify_expr (iter
, NOP_EXPR
, init
,
4306 tf_warning_or_error
));
4307 init
= build_int_cst (TREE_TYPE (diff
), 0);
4308 if (c
&& iter_incr
== NULL
)
4310 finish_expr_stmt (build_x_modify_expr (incr_var
, NOP_EXPR
,
4311 incr
, tf_warning_or_error
));
4313 iter_incr
= build_x_modify_expr (iter
, PLUS_EXPR
, incr
,
4314 tf_warning_or_error
);
4316 finish_expr_stmt (build_x_modify_expr (last
, NOP_EXPR
, init
,
4317 tf_warning_or_error
));
4318 *pre_body
= pop_stmt_list (*pre_body
);
4320 cond
= cp_build_binary_op (elocus
,
4321 TREE_CODE (cond
), decl
, diff
,
4322 tf_warning_or_error
);
4323 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
4324 elocus
, incr
, NULL_TREE
);
4327 *body
= push_stmt_list ();
4328 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
4329 iter_init
= build_x_modify_expr (iter
, PLUS_EXPR
, iter_init
,
4330 tf_warning_or_error
);
4331 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
4332 finish_expr_stmt (iter_init
);
4333 finish_expr_stmt (build_x_modify_expr (last
, NOP_EXPR
, decl
,
4334 tf_warning_or_error
));
4335 add_stmt (orig_body
);
4336 *body
= pop_stmt_list (*body
);
4340 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
4341 finish_expr_stmt (iter_incr
);
4342 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
4343 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
4346 TREE_VEC_ELT (declv
, i
) = decl
;
4347 TREE_VEC_ELT (initv
, i
) = init
;
4348 TREE_VEC_ELT (condv
, i
) = cond
;
4349 TREE_VEC_ELT (incrv
, i
) = incr
;
4354 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4355 are directly for their associated operands in the statement. DECL
4356 and INIT are a combo; if DECL is NULL then INIT ought to be a
4357 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4358 optional statements that need to go before the loop into its
4362 finish_omp_for (location_t locus
, tree declv
, tree initv
, tree condv
,
4363 tree incrv
, tree body
, tree pre_body
, tree clauses
)
4365 tree omp_for
= NULL
, orig_incr
= NULL
;
4366 tree decl
, init
, cond
, incr
;
4370 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
4371 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
4372 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
4373 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4375 decl
= TREE_VEC_ELT (declv
, i
);
4376 init
= TREE_VEC_ELT (initv
, i
);
4377 cond
= TREE_VEC_ELT (condv
, i
);
4378 incr
= TREE_VEC_ELT (incrv
, i
);
4384 switch (TREE_CODE (init
))
4387 decl
= TREE_OPERAND (init
, 0);
4388 init
= TREE_OPERAND (init
, 1);
4391 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
4393 decl
= TREE_OPERAND (init
, 0);
4394 init
= TREE_OPERAND (init
, 2);
4404 "expected iteration declaration or initialization");
4409 if (init
&& EXPR_HAS_LOCATION (init
))
4410 elocus
= EXPR_LOCATION (init
);
4414 error_at (elocus
, "missing controlling predicate");
4420 error_at (elocus
, "missing increment expression");
4424 TREE_VEC_ELT (declv
, i
) = decl
;
4425 TREE_VEC_ELT (initv
, i
) = init
;
4428 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
4432 stmt
= make_node (OMP_FOR
);
4434 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4436 /* This is really just a place-holder. We'll be decomposing this
4437 again and going through the cp_build_modify_expr path below when
4438 we instantiate the thing. */
4439 TREE_VEC_ELT (initv
, i
)
4440 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
4441 TREE_VEC_ELT (initv
, i
));
4444 TREE_TYPE (stmt
) = void_type_node
;
4445 OMP_FOR_INIT (stmt
) = initv
;
4446 OMP_FOR_COND (stmt
) = condv
;
4447 OMP_FOR_INCR (stmt
) = incrv
;
4448 OMP_FOR_BODY (stmt
) = body
;
4449 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
4450 OMP_FOR_CLAUSES (stmt
) = clauses
;
4452 SET_EXPR_LOCATION (stmt
, locus
);
4453 return add_stmt (stmt
);
4456 if (processing_template_decl
)
4457 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
4459 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
4461 decl
= TREE_VEC_ELT (declv
, i
);
4462 init
= TREE_VEC_ELT (initv
, i
);
4463 cond
= TREE_VEC_ELT (condv
, i
);
4464 incr
= TREE_VEC_ELT (incrv
, i
);
4466 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4469 if (init
&& EXPR_HAS_LOCATION (init
))
4470 elocus
= EXPR_LOCATION (init
);
4474 error_at (elocus
, "expected iteration declaration or initialization");
4478 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
4481 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4482 incr
= cp_build_modify_expr (TREE_OPERAND (incr
, 0),
4483 TREE_CODE (TREE_OPERAND (incr
, 1)),
4484 TREE_OPERAND (incr
, 2),
4485 tf_warning_or_error
);
4488 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
4490 if (handle_omp_for_class_iterator (i
, locus
, declv
, initv
, condv
,
4491 incrv
, &body
, &pre_body
, clauses
))
4496 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
4497 && TREE_CODE (TREE_TYPE (decl
)) != POINTER_TYPE
)
4499 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
4503 if (!processing_template_decl
)
4505 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
4506 init
= cp_build_modify_expr (decl
, NOP_EXPR
, init
, tf_warning_or_error
);
4509 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
4511 && TREE_SIDE_EFFECTS (cond
)
4512 && COMPARISON_CLASS_P (cond
)
4513 && !processing_template_decl
)
4515 tree t
= TREE_OPERAND (cond
, 0);
4516 if (TREE_SIDE_EFFECTS (t
)
4518 && (TREE_CODE (t
) != NOP_EXPR
4519 || TREE_OPERAND (t
, 0) != decl
))
4520 TREE_OPERAND (cond
, 0)
4521 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4523 t
= TREE_OPERAND (cond
, 1);
4524 if (TREE_SIDE_EFFECTS (t
)
4526 && (TREE_CODE (t
) != NOP_EXPR
4527 || TREE_OPERAND (t
, 0) != decl
))
4528 TREE_OPERAND (cond
, 1)
4529 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4531 if (decl
== error_mark_node
|| init
== error_mark_node
)
4534 TREE_VEC_ELT (declv
, i
) = decl
;
4535 TREE_VEC_ELT (initv
, i
) = init
;
4536 TREE_VEC_ELT (condv
, i
) = cond
;
4537 TREE_VEC_ELT (incrv
, i
) = incr
;
4541 if (IS_EMPTY_STMT (pre_body
))
4544 omp_for
= c_finish_omp_for (locus
, declv
, initv
, condv
, incrv
,
4547 if (omp_for
== NULL
)
4550 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
4552 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
4553 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
4555 if (TREE_CODE (incr
) != MODIFY_EXPR
)
4558 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
4559 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
4560 && !processing_template_decl
)
4562 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
4563 if (TREE_SIDE_EFFECTS (t
)
4565 && (TREE_CODE (t
) != NOP_EXPR
4566 || TREE_OPERAND (t
, 0) != decl
))
4567 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
4568 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4570 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
4571 if (TREE_SIDE_EFFECTS (t
)
4573 && (TREE_CODE (t
) != NOP_EXPR
4574 || TREE_OPERAND (t
, 0) != decl
))
4575 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
4576 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4580 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
4582 if (omp_for
!= NULL
)
4583 OMP_FOR_CLAUSES (omp_for
) = clauses
;
4588 finish_omp_atomic (enum tree_code code
, tree lhs
, tree rhs
)
4597 dependent_p
= false;
4600 /* Even in a template, we can detect invalid uses of the atomic
4601 pragma if neither LHS nor RHS is type-dependent. */
4602 if (processing_template_decl
)
4604 dependent_p
= (type_dependent_expression_p (lhs
)
4605 || type_dependent_expression_p (rhs
));
4608 lhs
= build_non_dependent_expr (lhs
);
4609 rhs
= build_non_dependent_expr (rhs
);
4614 stmt
= c_finish_omp_atomic (input_location
, code
, lhs
, rhs
);
4615 if (stmt
== error_mark_node
)
4618 if (processing_template_decl
)
4619 stmt
= build2 (OMP_ATOMIC
, void_type_node
, integer_zero_node
,
4620 build2 (code
, void_type_node
, orig_lhs
, orig_rhs
));
4625 finish_omp_barrier (void)
4627 tree fn
= built_in_decls
[BUILT_IN_GOMP_BARRIER
];
4628 VEC(tree
,gc
) *vec
= make_tree_vector ();
4629 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4630 release_tree_vector (vec
);
4631 finish_expr_stmt (stmt
);
4635 finish_omp_flush (void)
4637 tree fn
= built_in_decls
[BUILT_IN_SYNCHRONIZE
];
4638 VEC(tree
,gc
) *vec
= make_tree_vector ();
4639 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4640 release_tree_vector (vec
);
4641 finish_expr_stmt (stmt
);
4645 finish_omp_taskwait (void)
4647 tree fn
= built_in_decls
[BUILT_IN_GOMP_TASKWAIT
];
4648 VEC(tree
,gc
) *vec
= make_tree_vector ();
4649 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4650 release_tree_vector (vec
);
4651 finish_expr_stmt (stmt
);
4655 init_cp_semantics (void)
4659 /* Build a STATIC_ASSERT for a static assertion with the condition
4660 CONDITION and the message text MESSAGE. LOCATION is the location
4661 of the static assertion in the source code. When MEMBER_P, this
4662 static assertion is a member of a class. */
4664 finish_static_assert (tree condition
, tree message
, location_t location
,
4667 if (check_for_bare_parameter_packs (condition
))
4668 condition
= error_mark_node
;
4670 if (type_dependent_expression_p (condition
)
4671 || value_dependent_expression_p (condition
))
4673 /* We're in a template; build a STATIC_ASSERT and put it in
4677 assertion
= make_node (STATIC_ASSERT
);
4678 STATIC_ASSERT_CONDITION (assertion
) = condition
;
4679 STATIC_ASSERT_MESSAGE (assertion
) = message
;
4680 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
4683 maybe_add_class_template_decl_list (current_class_type
,
4687 add_stmt (assertion
);
4692 /* Fold the expression and convert it to a boolean value. */
4693 condition
= fold_non_dependent_expr (condition
);
4694 condition
= cp_convert (boolean_type_node
, condition
);
4696 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
4697 /* Do nothing; the condition is satisfied. */
4701 location_t saved_loc
= input_location
;
4703 input_location
= location
;
4704 if (TREE_CODE (condition
) == INTEGER_CST
4705 && integer_zerop (condition
))
4706 /* Report the error. */
4707 error ("static assertion failed: %E", message
);
4708 else if (condition
&& condition
!= error_mark_node
)
4709 error ("non-constant condition for static assertion");
4710 input_location
= saved_loc
;
4714 /* Returns the type of EXPR for cases where we can determine it even though
4715 EXPR is a type-dependent expression. */
4718 describable_type (tree expr
)
4720 tree type
= NULL_TREE
;
4722 if (! type_dependent_expression_p (expr
)
4723 && ! type_unknown_p (expr
))
4725 type
= unlowered_expr_type (expr
);
4726 if (real_lvalue_p (expr
))
4727 type
= build_reference_type (type
);
4733 switch (TREE_CODE (expr
))
4739 return TREE_TYPE (expr
);
4744 case TEMPLATE_PARM_INDEX
:
4746 case STATIC_CAST_EXPR
:
4747 case REINTERPRET_CAST_EXPR
:
4748 case CONST_CAST_EXPR
:
4749 case DYNAMIC_CAST_EXPR
:
4750 type
= TREE_TYPE (expr
);
4755 tree ptrtype
= describable_type (TREE_OPERAND (expr
, 0));
4756 if (ptrtype
&& POINTER_TYPE_P (ptrtype
))
4757 type
= build_reference_type (TREE_TYPE (ptrtype
));
4762 if (TREE_CODE_CLASS (TREE_CODE (expr
)) == tcc_constant
)
4763 type
= TREE_TYPE (expr
);
4767 if (type
&& type_uses_auto (type
))
4773 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4774 suitable for use as a type-specifier.
4776 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4777 id-expression or a class member access, FALSE when it was parsed as
4778 a full expression. */
4781 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
)
4783 tree orig_expr
= expr
;
4784 tree type
= NULL_TREE
;
4786 if (!expr
|| error_operand_p (expr
))
4787 return error_mark_node
;
4790 || TREE_CODE (expr
) == TYPE_DECL
4791 || (TREE_CODE (expr
) == BIT_NOT_EXPR
4792 && TYPE_P (TREE_OPERAND (expr
, 0))))
4794 error ("argument to decltype must be an expression");
4795 return error_mark_node
;
4798 if (type_dependent_expression_p (expr
)
4799 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
4800 if it isn't dependent, so that we can check access control at
4801 instantiation time, so defer the decltype as well (PR 42277). */
4802 || (id_expression_or_member_access_p
4803 && processing_template_decl
4804 && TREE_CODE (expr
) == COMPONENT_REF
))
4806 if (id_expression_or_member_access_p
)
4808 switch (TREE_CODE (expr
))
4815 case TEMPLATE_PARM_INDEX
:
4816 type
= TREE_TYPE (expr
);
4824 if (type
&& !type_uses_auto (type
))
4828 type
= cxx_make_type (DECLTYPE_TYPE
);
4829 DECLTYPE_TYPE_EXPR (type
) = expr
;
4830 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
4831 = id_expression_or_member_access_p
;
4832 SET_TYPE_STRUCTURAL_EQUALITY (type
);
4837 /* The type denoted by decltype(e) is defined as follows: */
4839 expr
= resolve_nondeduced_context (expr
);
4840 if (id_expression_or_member_access_p
)
4842 /* If e is an id-expression or a class member access (5.2.5
4843 [expr.ref]), decltype(e) is defined as the type of the entity
4844 named by e. If there is no such entity, or e names a set of
4845 overloaded functions, the program is ill-formed. */
4846 if (TREE_CODE (expr
) == IDENTIFIER_NODE
)
4847 expr
= lookup_name (expr
);
4849 if (TREE_CODE (expr
) == INDIRECT_REF
)
4850 /* This can happen when the expression is, e.g., "a.b". Just
4851 look at the underlying operand. */
4852 expr
= TREE_OPERAND (expr
, 0);
4854 if (TREE_CODE (expr
) == OFFSET_REF
4855 || TREE_CODE (expr
) == MEMBER_REF
)
4856 /* We're only interested in the field itself. If it is a
4857 BASELINK, we will need to see through it in the next
4859 expr
= TREE_OPERAND (expr
, 1);
4861 if (TREE_CODE (expr
) == BASELINK
)
4862 /* See through BASELINK nodes to the underlying functions. */
4863 expr
= BASELINK_FUNCTIONS (expr
);
4865 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
4866 expr
= TREE_OPERAND (expr
, 0);
4868 if (TREE_CODE (expr
) == OVERLOAD
)
4870 if (OVL_CHAIN (expr
)
4871 || TREE_CODE (OVL_FUNCTION (expr
)) == TEMPLATE_DECL
)
4873 error ("%qE refers to a set of overloaded functions", orig_expr
);
4874 return error_mark_node
;
4877 /* An overload set containing only one function: just look
4878 at that function. */
4879 expr
= OVL_FUNCTION (expr
);
4882 switch (TREE_CODE (expr
))
4885 if (DECL_BIT_FIELD_TYPE (expr
))
4887 type
= DECL_BIT_FIELD_TYPE (expr
);
4890 /* Fall through for fields that aren't bitfields. */
4897 case TEMPLATE_PARM_INDEX
:
4898 type
= TREE_TYPE (expr
);
4902 type
= error_mark_node
;
4906 type
= is_bitfield_expr_with_lowered_type (expr
);
4908 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
4915 /* We can get here when the id-expression refers to an
4917 type
= TREE_TYPE (expr
);
4921 gcc_assert (TYPE_P (expr
) || DECL_P (expr
)
4922 || TREE_CODE (expr
) == SCOPE_REF
);
4923 error ("argument to decltype must be an expression");
4924 return error_mark_node
;
4929 /* Expressions of reference type are sometimes wrapped in
4930 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4931 representation, not part of the language, so we have to look
4933 if (TREE_CODE (expr
) == INDIRECT_REF
4934 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0)))
4936 expr
= TREE_OPERAND (expr
, 0);
4938 if (TREE_CODE (expr
) == CALL_EXPR
)
4940 /* If e is a function call (5.2.2 [expr.call]) or an
4941 invocation of an overloaded operator (parentheses around e
4942 are ignored), decltype(e) is defined as the return type of
4944 tree fndecl
= get_callee_fndecl (expr
);
4945 if (fndecl
&& fndecl
!= error_mark_node
)
4946 type
= TREE_TYPE (TREE_TYPE (fndecl
));
4949 tree target_type
= TREE_TYPE (CALL_EXPR_FN (expr
));
4950 if ((TREE_CODE (target_type
) == REFERENCE_TYPE
4951 || TREE_CODE (target_type
) == POINTER_TYPE
)
4952 && (TREE_CODE (TREE_TYPE (target_type
)) == FUNCTION_TYPE
4953 || TREE_CODE (TREE_TYPE (target_type
)) == METHOD_TYPE
))
4954 type
= TREE_TYPE (TREE_TYPE (target_type
));
4955 else if (processing_template_decl
)
4956 /* Within a template finish_call_expr doesn't resolve
4957 CALL_EXPR_FN, so even though this decltype isn't really
4958 dependent let's defer resolving it. */
4959 goto treat_as_dependent
;
4961 sorry ("unable to determine the declared type of expression %<%E%>",
4967 type
= is_bitfield_expr_with_lowered_type (expr
);
4970 /* Bitfields are special, because their type encodes the
4971 number of bits they store. If the expression referenced a
4972 bitfield, TYPE now has the declared type of that
4974 type
= cp_build_qualified_type (type
,
4975 cp_type_quals (TREE_TYPE (expr
)));
4977 if (real_lvalue_p (expr
))
4978 type
= build_reference_type (type
);
4980 /* Within a lambda-expression:
4982 Every occurrence of decltype((x)) where x is a possibly
4983 parenthesized id-expression that names an entity of
4984 automatic storage duration is treated as if x were
4985 transformed into an access to a corresponding data member
4986 of the closure type that would have been declared if x
4987 were a use of the denoted entity. */
4988 else if (outer_automatic_var_p (expr
)
4989 && current_function_decl
4990 && LAMBDA_FUNCTION_P (current_function_decl
))
4991 type
= capture_decltype (expr
);
4994 /* Otherwise, where T is the type of e, if e is an lvalue,
4995 decltype(e) is defined as T&, otherwise decltype(e) is
4997 type
= TREE_TYPE (expr
);
4998 if (type
== error_mark_node
)
4999 return error_mark_node
;
5000 else if (expr
== current_class_ptr
)
5001 /* If the expression is just "this", we want the
5002 cv-unqualified pointer for the "this" type. */
5003 type
= TYPE_MAIN_VARIANT (type
);
5004 else if (real_lvalue_p (expr
))
5006 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5007 type
= build_reference_type (type
);
5010 type
= non_reference (type
);
5015 if (!type
|| type
== unknown_type_node
)
5017 error ("type of %qE is unknown", expr
);
5018 return error_mark_node
;
5024 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
5025 __has_nothrow_copy, depending on assign_p. */
5028 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
5035 ix
= lookup_fnfields_1 (type
, ansi_assopname (NOP_EXPR
));
5038 fns
= VEC_index (tree
, CLASSTYPE_METHOD_VEC (type
), ix
);
5040 else if (TYPE_HAS_INIT_REF (type
))
5042 /* If construction of the copy constructor was postponed, create
5044 if (CLASSTYPE_LAZY_COPY_CTOR (type
))
5045 lazily_declare_fn (sfk_copy_constructor
, type
);
5046 if (CLASSTYPE_LAZY_MOVE_CTOR (type
))
5047 lazily_declare_fn (sfk_move_constructor
, type
);
5048 fns
= CLASSTYPE_CONSTRUCTORS (type
);
5053 for (; fns
; fns
= OVL_NEXT (fns
))
5055 tree fn
= OVL_CURRENT (fns
);
5059 if (copy_fn_p (fn
) == 0)
5062 else if (copy_fn_p (fn
) <= 0)
5065 if (!TYPE_NOTHROW_P (TREE_TYPE (fn
)))
5072 /* Actually evaluates the trait. */
5075 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
5077 enum tree_code type_code1
;
5080 type_code1
= TREE_CODE (type1
);
5084 case CPTK_HAS_NOTHROW_ASSIGN
:
5085 type1
= strip_array_types (type1
);
5086 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5087 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
5088 || (CLASS_TYPE_P (type1
)
5089 && classtype_has_nothrow_assign_or_copy_p (type1
,
5092 case CPTK_HAS_TRIVIAL_ASSIGN
:
5093 /* ??? The standard seems to be missing the "or array of such a class
5094 type" wording for this trait. */
5095 type1
= strip_array_types (type1
);
5096 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5097 && (trivial_type_p (type1
)
5098 || (CLASS_TYPE_P (type1
)
5099 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1
))));
5101 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5102 type1
= strip_array_types (type1
);
5103 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
5104 || (CLASS_TYPE_P (type1
)
5105 && (t
= locate_ctor (type1
, NULL
))
5106 && TYPE_NOTHROW_P (TREE_TYPE (t
))));
5108 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5109 type1
= strip_array_types (type1
);
5110 return (trivial_type_p (type1
)
5111 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
5113 case CPTK_HAS_NOTHROW_COPY
:
5114 type1
= strip_array_types (type1
);
5115 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
5116 || (CLASS_TYPE_P (type1
)
5117 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
5119 case CPTK_HAS_TRIVIAL_COPY
:
5120 /* ??? The standard seems to be missing the "or array of such a class
5121 type" wording for this trait. */
5122 type1
= strip_array_types (type1
);
5123 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5124 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_INIT_REF (type1
)));
5126 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5127 type1
= strip_array_types (type1
);
5128 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5129 || (CLASS_TYPE_P (type1
)
5130 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
5132 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5133 return (CLASS_TYPE_P (type1
)
5134 && (t
= locate_dtor (type1
, NULL
)) && DECL_VIRTUAL_P (t
));
5136 case CPTK_IS_ABSTRACT
:
5137 return (CLASS_TYPE_P (type1
) && CLASSTYPE_PURE_VIRTUALS (type1
));
5139 case CPTK_IS_BASE_OF
:
5140 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5141 && DERIVED_FROM_P (type1
, type2
));
5144 return (NON_UNION_CLASS_TYPE_P (type1
));
5146 case CPTK_IS_CONVERTIBLE_TO
:
5151 return (NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
));
5154 return (type_code1
== ENUMERAL_TYPE
);
5157 return (pod_type_p (type1
));
5159 case CPTK_IS_POLYMORPHIC
:
5160 return (CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
));
5162 case CPTK_IS_STD_LAYOUT
:
5163 return (std_layout_type_p (type1
));
5165 case CPTK_IS_TRIVIAL
:
5166 return (trivial_type_p (type1
));
5169 return (type_code1
== UNION_TYPE
);
5177 /* Returns true if TYPE is a complete type, an array of unknown bound,
5178 or (possibly cv-qualified) void, returns false otherwise. */
5181 check_trait_type (tree type
)
5183 if (COMPLETE_TYPE_P (type
))
5186 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
5189 if (VOID_TYPE_P (type
))
5195 /* Process a trait expression. */
5198 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
5200 gcc_assert (kind
== CPTK_HAS_NOTHROW_ASSIGN
5201 || kind
== CPTK_HAS_NOTHROW_CONSTRUCTOR
5202 || kind
== CPTK_HAS_NOTHROW_COPY
5203 || kind
== CPTK_HAS_TRIVIAL_ASSIGN
5204 || kind
== CPTK_HAS_TRIVIAL_CONSTRUCTOR
5205 || kind
== CPTK_HAS_TRIVIAL_COPY
5206 || kind
== CPTK_HAS_TRIVIAL_DESTRUCTOR
5207 || kind
== CPTK_HAS_VIRTUAL_DESTRUCTOR
5208 || kind
== CPTK_IS_ABSTRACT
5209 || kind
== CPTK_IS_BASE_OF
5210 || kind
== CPTK_IS_CLASS
5211 || kind
== CPTK_IS_CONVERTIBLE_TO
5212 || kind
== CPTK_IS_EMPTY
5213 || kind
== CPTK_IS_ENUM
5214 || kind
== CPTK_IS_POD
5215 || kind
== CPTK_IS_POLYMORPHIC
5216 || kind
== CPTK_IS_STD_LAYOUT
5217 || kind
== CPTK_IS_TRIVIAL
5218 || kind
== CPTK_IS_UNION
);
5220 if (kind
== CPTK_IS_CONVERTIBLE_TO
)
5222 sorry ("__is_convertible_to");
5223 return error_mark_node
;
5226 if (type1
== error_mark_node
5227 || ((kind
== CPTK_IS_BASE_OF
|| kind
== CPTK_IS_CONVERTIBLE_TO
)
5228 && type2
== error_mark_node
))
5229 return error_mark_node
;
5231 if (processing_template_decl
)
5233 tree trait_expr
= make_node (TRAIT_EXPR
);
5234 TREE_TYPE (trait_expr
) = boolean_type_node
;
5235 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
5236 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
5237 TRAIT_EXPR_KIND (trait_expr
) = kind
;
5241 complete_type (type1
);
5243 complete_type (type2
);
5247 case CPTK_HAS_NOTHROW_ASSIGN
:
5248 case CPTK_HAS_TRIVIAL_ASSIGN
:
5249 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5250 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5251 case CPTK_HAS_NOTHROW_COPY
:
5252 case CPTK_HAS_TRIVIAL_COPY
:
5253 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5254 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5255 case CPTK_IS_ABSTRACT
:
5258 case CPTK_IS_POLYMORPHIC
:
5259 case CPTK_IS_STD_LAYOUT
:
5260 case CPTK_IS_TRIVIAL
:
5261 if (!check_trait_type (type1
))
5263 error ("incomplete type %qT not allowed", type1
);
5264 return error_mark_node
;
5268 case CPTK_IS_BASE_OF
:
5269 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5270 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
5271 && !COMPLETE_TYPE_P (type2
))
5273 error ("incomplete type %qT not allowed", type2
);
5274 return error_mark_node
;
5283 case CPTK_IS_CONVERTIBLE_TO
:
5288 return (trait_expr_value (kind
, type1
, type2
)
5289 ? boolean_true_node
: boolean_false_node
);
5292 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5293 which is ignored for C++. */
5296 set_float_const_decimal64 (void)
5301 clear_float_const_decimal64 (void)
5306 float_const_decimal64_p (void)
5311 /* Return true if T is a literal type. */
5314 literal_type_p (tree t
)
5316 if (SCALAR_TYPE_P (t
))
5318 if (CLASS_TYPE_P (t
))
5319 return CLASSTYPE_LITERAL_P (t
);
5320 if (TREE_CODE (t
) == ARRAY_TYPE
)
5321 return literal_type_p (strip_array_types (t
));
5326 /* If DECL is a variable declared `constexpr', require its type
5327 be literal. Return the DECL if OK, otherwise NULL. */
5330 ensure_literal_type_for_constexpr_object (tree decl
)
5332 tree type
= TREE_TYPE (decl
);
5333 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_DECLARED_CONSTEXPR_P (decl
)
5334 && !processing_template_decl
&& !literal_type_p (type
))
5336 error ("the type %qT of constexpr variable %qD is not literal",
5343 /* Return non-null if FUN certainly designates a valid constexpr function
5344 declaration. Otherwise return NULL. Issue appropriate diagnostics
5345 if necessary. Note that we only check the declaration, not the body
5349 validate_constexpr_fundecl (tree fun
)
5351 tree rettype
= NULL
;
5354 /* Don't bother if FUN is not marked constexpr. */
5355 if (!DECL_DECLARED_CONSTEXPR_P (fun
))
5358 /* For a function template, we have absolutely no guarantee that all
5359 instantiations will be constexpr. */
5360 if (TREE_CODE (fun
) == TEMPLATE_DECL
)
5363 parm
= FUNCTION_FIRST_USER_PARM (fun
);
5364 for (; parm
!= NULL
; parm
= TREE_CHAIN (parm
))
5366 tree type
= TREE_TYPE (parm
);
5367 if (dependent_type_p (type
))
5369 if (!literal_type_p (type
))
5371 error ("parameter %q#D is not of literal type", parm
);
5376 if (DECL_CONSTRUCTOR_P (fun
))
5379 rettype
= TREE_TYPE (TREE_TYPE (fun
));
5380 if (dependent_type_p (rettype
))
5382 if (!literal_type_p (rettype
))
5384 error ("return type %qT of function %qD is not a literal type",
5385 TREE_TYPE (TREE_TYPE (fun
)), fun
);
5392 /* Constructor for a lambda expression. */
5395 build_lambda_expr (void)
5397 tree lambda
= make_node (LAMBDA_EXPR
);
5398 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) = CPLD_NONE
;
5399 LAMBDA_EXPR_CAPTURE_LIST (lambda
) = NULL_TREE
;
5400 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = NULL_TREE
;
5401 LAMBDA_EXPR_RETURN_TYPE (lambda
) = NULL_TREE
;
5402 LAMBDA_EXPR_MUTABLE_P (lambda
) = false;
5406 /* Create the closure object for a LAMBDA_EXPR. */
5409 build_lambda_object (tree lambda_expr
)
5411 /* Build aggregate constructor call.
5412 - cp_parser_braced_list
5413 - cp_parser_functional_cast */
5414 VEC(constructor_elt
,gc
) *elts
= NULL
;
5415 tree node
, expr
, type
;
5416 location_t saved_loc
;
5418 if (processing_template_decl
)
5421 /* Make sure any error messages refer to the lambda-introducer. */
5422 saved_loc
= input_location
;
5423 input_location
= LAMBDA_EXPR_LOCATION (lambda_expr
);
5425 for (node
= LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
);
5427 node
= TREE_CHAIN (node
))
5429 tree field
= TREE_PURPOSE (node
);
5430 tree val
= TREE_VALUE (node
);
5435 /* Mere mortals can't copy arrays with aggregate initialization, so
5436 do some magic to make it work here. */
5437 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
)
5438 val
= build_array_copy (val
);
5439 else if (DECL_NORMAL_CAPTURE_P (field
)
5440 && TREE_CODE (TREE_TYPE (field
)) != REFERENCE_TYPE
)
5442 /* "the entities that are captured by copy are used to
5443 direct-initialize each corresponding non-static data
5444 member of the resulting closure object."
5446 There's normally no way to express direct-initialization
5447 from an element of a CONSTRUCTOR, so we build up a special
5448 TARGET_EXPR to bypass the usual copy-initialization. */
5449 val
= force_rvalue (val
);
5450 if (TREE_CODE (val
) == TARGET_EXPR
)
5451 TARGET_EXPR_DIRECT_INIT_P (val
) = true;
5454 CONSTRUCTOR_APPEND_ELT (elts
, DECL_NAME (field
), val
);
5457 expr
= build_constructor (init_list_type_node
, elts
);
5458 CONSTRUCTOR_IS_DIRECT_INIT (expr
) = 1;
5460 /* N2927: "[The closure] class type is not an aggregate."
5461 But we briefly treat it as an aggregate to make this simpler. */
5462 type
= TREE_TYPE (lambda_expr
);
5463 CLASSTYPE_NON_AGGREGATE (type
) = 0;
5464 expr
= finish_compound_literal (type
, expr
);
5465 CLASSTYPE_NON_AGGREGATE (type
) = 1;
5467 input_location
= saved_loc
;
5471 /* Return an initialized RECORD_TYPE for LAMBDA.
5472 LAMBDA must have its explicit captures already. */
5475 begin_lambda_type (tree lambda
)
5480 /* Unique name. This is just like an unnamed class, but we cannot use
5481 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
5483 name
= make_lambda_name ();
5485 /* Create the new RECORD_TYPE for this lambda. */
5486 type
= xref_tag (/*tag_code=*/record_type
,
5488 /*scope=*/ts_within_enclosing_non_class
,
5489 /*template_header_p=*/false);
5492 /* Designate it as a struct so that we can use aggregate initialization. */
5493 CLASSTYPE_DECLARED_CLASS (type
) = false;
5495 /* Clear base types. */
5496 xref_basetypes (type
, /*bases=*/NULL_TREE
);
5498 /* Start the class. */
5499 type
= begin_class_definition (type
, /*attributes=*/NULL_TREE
);
5501 /* Cross-reference the expression and the type. */
5502 TREE_TYPE (lambda
) = type
;
5503 CLASSTYPE_LAMBDA_EXPR (type
) = lambda
;
5508 /* Returns the type to use for the return type of the operator() of a
5512 lambda_return_type (tree expr
)
5515 if (type_dependent_expression_p (expr
))
5517 type
= cxx_make_type (DECLTYPE_TYPE
);
5518 DECLTYPE_TYPE_EXPR (type
) = expr
;
5519 DECLTYPE_FOR_LAMBDA_RETURN (type
) = true;
5520 SET_TYPE_STRUCTURAL_EQUALITY (type
);
5523 type
= type_decays_to (unlowered_expr_type (expr
));
5527 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
5531 lambda_function (tree lambda
)
5534 if (TREE_CODE (lambda
) == LAMBDA_EXPR
)
5535 type
= TREE_TYPE (lambda
);
5538 gcc_assert (LAMBDA_TYPE_P (type
));
5539 /* Don't let debug_tree cause instantiation. */
5540 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
) && !COMPLETE_TYPE_P (type
))
5542 lambda
= lookup_member (type
, ansi_opname (CALL_EXPR
),
5543 /*protect=*/0, /*want_type=*/false);
5545 lambda
= BASELINK_FUNCTIONS (lambda
);
5549 /* Returns the type to use for the FIELD_DECL corresponding to the
5551 The caller should add REFERENCE_TYPE for capture by reference. */
5554 lambda_capture_field_type (tree expr
)
5557 if (type_dependent_expression_p (expr
))
5559 type
= cxx_make_type (DECLTYPE_TYPE
);
5560 DECLTYPE_TYPE_EXPR (type
) = expr
;
5561 DECLTYPE_FOR_LAMBDA_CAPTURE (type
) = true;
5562 SET_TYPE_STRUCTURAL_EQUALITY (type
);
5565 type
= non_reference (unlowered_expr_type (expr
));
5569 /* Recompute the return type for LAMBDA with body of the form:
5570 { return EXPR ; } */
5573 apply_lambda_return_type (tree lambda
, tree return_type
)
5575 tree fco
= lambda_function (lambda
);
5578 LAMBDA_EXPR_RETURN_TYPE (lambda
) = return_type
;
5580 /* If we got a DECLTYPE_TYPE, don't stick it in the function yet,
5581 it would interfere with instantiating the closure type. */
5582 if (dependent_type_p (return_type
))
5584 if (return_type
== error_mark_node
)
5587 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
5588 TREE_TYPE (METHOD_TYPE) == return-type */
5589 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
5591 result
= DECL_RESULT (fco
);
5592 if (result
== NULL_TREE
)
5595 /* We already have a DECL_RESULT from start_preparsed_function.
5596 Now we need to redo the work it and allocate_struct_function
5597 did to reflect the new type. */
5598 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
5599 TYPE_MAIN_VARIANT (return_type
));
5600 DECL_ARTIFICIAL (result
) = 1;
5601 DECL_IGNORED_P (result
) = 1;
5602 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
5605 DECL_RESULT (fco
) = result
;
5607 if (!processing_template_decl
&& aggregate_value_p (result
, fco
))
5609 #ifdef PCC_STATIC_STRUCT_RETURN
5610 cfun
->returns_pcc_struct
= 1;
5612 cfun
->returns_struct
= 1;
5617 /* DECL is a local variable or parameter from the surrounding scope of a
5618 lambda-expression. Returns the decltype for a use of the capture field
5619 for DECL even if it hasn't been captured yet. */
5622 capture_decltype (tree decl
)
5624 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
5625 /* FIXME do lookup instead of list walk? */
5626 tree cap
= value_member (decl
, LAMBDA_EXPR_CAPTURE_LIST (lam
));
5630 type
= TREE_TYPE (TREE_PURPOSE (cap
));
5632 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
5635 error ("%qD is not captured", decl
);
5636 return error_mark_node
;
5639 type
= TREE_TYPE (decl
);
5640 if (TREE_CODE (type
) == REFERENCE_TYPE
5641 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
5642 type
= TREE_TYPE (type
);
5645 case CPLD_REFERENCE
:
5646 type
= TREE_TYPE (decl
);
5647 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5648 type
= build_reference_type (TREE_TYPE (decl
));
5655 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5657 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
5658 type
= cp_build_qualified_type (type
, (TYPE_QUALS (type
)
5660 type
= build_reference_type (type
);
5665 /* From an ID and INITIALIZER, create a capture (by reference if
5666 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
5670 add_capture (tree lambda
, tree id
, tree initializer
, bool by_reference_p
,
5671 bool explicit_init_p
)
5676 type
= lambda_capture_field_type (initializer
);
5679 type
= build_reference_type (type
);
5680 if (!real_lvalue_p (initializer
))
5681 error ("cannot capture %qE by reference", initializer
);
5684 /* Make member variable. */
5685 member
= build_lang_decl (FIELD_DECL
, id
, type
);
5686 if (!explicit_init_p
)
5687 /* Normal captures are invisible to name lookup but uses are replaced
5688 with references to the capture field; we implement this by only
5689 really making them invisible in unevaluated context; see
5690 qualify_lookup. For now, let's make explicitly initialized captures
5692 DECL_NORMAL_CAPTURE_P (member
) = true;
5694 /* Add it to the appropriate closure class if we've started it. */
5695 if (current_class_type
&& current_class_type
== TREE_TYPE (lambda
))
5696 finish_member_declaration (member
);
5698 LAMBDA_EXPR_CAPTURE_LIST (lambda
)
5699 = tree_cons (member
, initializer
, LAMBDA_EXPR_CAPTURE_LIST (lambda
));
5701 if (id
== get_identifier ("__this"))
5703 if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda
))
5704 error ("already captured %<this%> in lambda expression");
5705 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = member
;
5711 /* Register all the capture members on the list CAPTURES, which is the
5712 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
5714 void register_capture_members (tree captures
)
5718 register_capture_members (TREE_CHAIN (captures
));
5719 finish_member_declaration (TREE_PURPOSE (captures
));
5723 /* Given a FIELD_DECL decl belonging to a closure type, return a
5724 COMPONENT_REF of it relative to the 'this' parameter of the op() for
5728 thisify_lambda_field (tree decl
)
5730 tree context
= lambda_function (DECL_CONTEXT (decl
));
5731 tree object
= cp_build_indirect_ref (DECL_ARGUMENTS (context
),
5733 tf_warning_or_error
);
5734 return finish_non_static_data_member (decl
, object
,
5735 /*qualifying_scope*/NULL_TREE
);
5738 /* Similar to add_capture, except this works on a stack of nested lambdas.
5739 BY_REFERENCE_P in this case is derived from the default capture mode.
5740 Returns the capture for the lambda at the bottom of the stack. */
5743 add_default_capture (tree lambda_stack
, tree id
, tree initializer
)
5745 bool this_capture_p
= (id
== get_identifier ("__this"));
5747 tree member
= NULL_TREE
;
5749 tree saved_class_type
= current_class_type
;
5753 for (node
= lambda_stack
;
5755 node
= TREE_CHAIN (node
))
5757 tree lambda
= TREE_VALUE (node
);
5759 current_class_type
= TREE_TYPE (lambda
);
5760 member
= add_capture (lambda
,
5765 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
)
5766 == CPLD_REFERENCE
)),
5767 /*explicit_init_p=*/false);
5768 initializer
= thisify_lambda_field (member
);
5771 current_class_type
= saved_class_type
;
5776 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
5777 INDIRECT_REF, possibly adding it through default capturing. */
5780 lambda_expr_this_capture (tree lambda
)
5784 tree this_capture
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
5786 /* Try to default capture 'this' if we can. */
5788 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) != CPLD_NONE
)
5790 tree containing_function
= TYPE_CONTEXT (TREE_TYPE (lambda
));
5791 tree lambda_stack
= tree_cons (NULL_TREE
, lambda
, NULL_TREE
);
5792 tree init
= NULL_TREE
;
5794 /* If we are in a lambda function, we can move out until we hit:
5795 1. a non-lambda function,
5796 2. a lambda function capturing 'this', or
5797 3. a non-default capturing lambda function. */
5798 while (LAMBDA_FUNCTION_P (containing_function
))
5801 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function
));
5803 if (LAMBDA_EXPR_THIS_CAPTURE (lambda
))
5805 /* An outer lambda has already captured 'this'. */
5806 tree cap
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
5807 init
= thisify_lambda_field (cap
);
5811 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) == CPLD_NONE
)
5812 /* An outer lambda won't let us capture 'this'. */
5815 lambda_stack
= tree_cons (NULL_TREE
,
5819 containing_function
= decl_function_context (containing_function
);
5822 if (!init
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function
)
5823 && !LAMBDA_FUNCTION_P (containing_function
))
5824 /* First parameter is 'this'. */
5825 init
= DECL_ARGUMENTS (containing_function
);
5828 this_capture
= add_default_capture (lambda_stack
,
5829 /*id=*/get_identifier ("__this"),
5835 error ("%<this%> was not captured for this lambda function");
5836 result
= error_mark_node
;
5840 /* To make sure that current_class_ref is for the lambda. */
5841 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref
)) == TREE_TYPE (lambda
));
5843 result
= finish_non_static_data_member (this_capture
,
5845 /*qualifying_scope=*/NULL_TREE
);
5847 /* If 'this' is captured, each use of 'this' is transformed into an
5848 access to the corresponding unnamed data member of the closure
5849 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
5850 ensures that the transformed expression is an rvalue. ] */
5851 result
= rvalue (result
);
5857 /* If the closure TYPE has a static op(), also add a conversion to function
5861 maybe_add_lambda_conv_op (tree type
)
5863 bool nested
= (current_function_decl
!= NULL_TREE
);
5864 tree callop
= lambda_function (type
);
5865 tree rettype
, name
, fntype
, fn
, body
, compound_stmt
;
5867 if (!DECL_STATIC_FUNCTION_P (callop
))
5870 rettype
= build_pointer_type (TREE_TYPE (callop
));
5871 name
= mangle_conv_op_name_for_type (rettype
);
5872 fntype
= build_function_type (rettype
, void_list_node
);
5873 fn
= build_lang_decl (FUNCTION_DECL
, name
, fntype
);
5874 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
5876 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
5877 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
5878 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
5880 SET_OVERLOADED_OPERATOR_CODE (fn
, TYPE_EXPR
);
5881 grokclassfn (type
, fn
, NO_SPECIAL
);
5882 set_linkage_according_to_type (type
, fn
);
5883 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
5884 DECL_IN_AGGR_P (fn
) = 1;
5885 DECL_ARTIFICIAL (fn
) = 1;
5886 DECL_NOT_REALLY_EXTERN (fn
) = 1;
5887 DECL_DECLARED_INLINE_P (fn
) = 1;
5888 DECL_STATIC_FUNCTION_P (fn
) = 1;
5890 DECL_INTERFACE_KNOWN (fn
) = 1;
5892 add_method (type
, fn
, NULL_TREE
);
5895 push_function_context ();
5896 start_preparsed_function (fn
, NULL_TREE
,
5897 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
5898 body
= begin_function_body ();
5899 compound_stmt
= begin_compound_stmt (0);
5901 finish_return_stmt (decay_conversion (callop
));
5903 finish_compound_stmt (compound_stmt
);
5904 finish_function_body (body
);
5906 expand_or_defer_fn (finish_function (2));
5908 pop_function_context ();
5910 #include "gt-cp-semantics.h"