1 /* Perform the semantic phase of parsing, i.e., the process of
2 building tree structure, checking semantic consistency, and
3 building RTL. These routines are used both during actual parsing
4 and during the instantiation of template functions.
6 Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007,
7 2008, 2009, 2010 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"
52 /* There routines provide a modular interface to perform many parsing
53 operations. They may therefore be used during actual parsing, or
54 during template instantiation, which may be regarded as a
55 degenerate form of parsing. */
57 static tree
maybe_convert_cond (tree
);
58 static tree
finalize_nrv_r (tree
*, int *, void *);
59 static tree
capture_decltype (tree
);
60 static tree
thisify_lambda_field (tree
);
63 /* Deferred Access Checking Overview
64 ---------------------------------
66 Most C++ expressions and declarations require access checking
67 to be performed during parsing. However, in several cases,
68 this has to be treated differently.
70 For member declarations, access checking has to be deferred
71 until more information about the declaration is known. For
83 When we are parsing the function return type `A::X', we don't
84 really know if this is allowed until we parse the function name.
86 Furthermore, some contexts require that access checking is
87 never performed at all. These include class heads, and template
90 Typical use of access checking functions is described here:
92 1. When we enter a context that requires certain access checking
93 mode, the function `push_deferring_access_checks' is called with
94 DEFERRING argument specifying the desired mode. Access checking
95 may be performed immediately (dk_no_deferred), deferred
96 (dk_deferred), or not performed (dk_no_check).
98 2. When a declaration such as a type, or a variable, is encountered,
99 the function `perform_or_defer_access_check' is called. It
100 maintains a VEC of all deferred checks.
102 3. The global `current_class_type' or `current_function_decl' is then
103 setup by the parser. `enforce_access' relies on these information
106 4. Upon exiting the context mentioned in step 1,
107 `perform_deferred_access_checks' is called to check all declaration
108 stored in the VEC. `pop_deferring_access_checks' is then
109 called to restore the previous access checking mode.
111 In case of parsing error, we simply call `pop_deferring_access_checks'
112 without `perform_deferred_access_checks'. */
114 typedef struct GTY(()) deferred_access
{
115 /* A VEC representing name-lookups for which we have deferred
116 checking access controls. We cannot check the accessibility of
117 names used in a decl-specifier-seq until we know what is being
118 declared because code like:
125 A::B* A::f() { return 0; }
127 is valid, even though `A::B' is not generally accessible. */
128 VEC (deferred_access_check
,gc
)* GTY(()) deferred_access_checks
;
130 /* The current mode of access checks. */
131 enum deferring_kind deferring_access_checks_kind
;
134 DEF_VEC_O (deferred_access
);
135 DEF_VEC_ALLOC_O (deferred_access
,gc
);
137 /* Data for deferred access checking. */
138 static GTY(()) VEC(deferred_access
,gc
) *deferred_access_stack
;
139 static GTY(()) unsigned deferred_access_no_check
;
141 /* Save the current deferred access states and start deferred
142 access checking iff DEFER_P is true. */
145 push_deferring_access_checks (deferring_kind deferring
)
147 /* For context like template instantiation, access checking
148 disabling applies to all nested context. */
149 if (deferred_access_no_check
|| deferring
== dk_no_check
)
150 deferred_access_no_check
++;
153 deferred_access
*ptr
;
155 ptr
= VEC_safe_push (deferred_access
, gc
, deferred_access_stack
, NULL
);
156 ptr
->deferred_access_checks
= NULL
;
157 ptr
->deferring_access_checks_kind
= deferring
;
161 /* Resume deferring access checks again after we stopped doing
165 resume_deferring_access_checks (void)
167 if (!deferred_access_no_check
)
168 VEC_last (deferred_access
, deferred_access_stack
)
169 ->deferring_access_checks_kind
= dk_deferred
;
172 /* Stop deferring access checks. */
175 stop_deferring_access_checks (void)
177 if (!deferred_access_no_check
)
178 VEC_last (deferred_access
, deferred_access_stack
)
179 ->deferring_access_checks_kind
= dk_no_deferred
;
182 /* Discard the current deferred access checks and restore the
186 pop_deferring_access_checks (void)
188 if (deferred_access_no_check
)
189 deferred_access_no_check
--;
191 VEC_pop (deferred_access
, deferred_access_stack
);
194 /* Returns a TREE_LIST representing the deferred checks.
195 The TREE_PURPOSE of each node is the type through which the
196 access occurred; the TREE_VALUE is the declaration named.
199 VEC (deferred_access_check
,gc
)*
200 get_deferred_access_checks (void)
202 if (deferred_access_no_check
)
205 return (VEC_last (deferred_access
, deferred_access_stack
)
206 ->deferred_access_checks
);
209 /* Take current deferred checks and combine with the
210 previous states if we also defer checks previously.
211 Otherwise perform checks now. */
214 pop_to_parent_deferring_access_checks (void)
216 if (deferred_access_no_check
)
217 deferred_access_no_check
--;
220 VEC (deferred_access_check
,gc
) *checks
;
221 deferred_access
*ptr
;
223 checks
= (VEC_last (deferred_access
, deferred_access_stack
)
224 ->deferred_access_checks
);
226 VEC_pop (deferred_access
, deferred_access_stack
);
227 ptr
= VEC_last (deferred_access
, deferred_access_stack
);
228 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
231 perform_access_checks (checks
);
235 /* Merge with parent. */
237 deferred_access_check
*chk
, *probe
;
240 VEC_iterate (deferred_access_check
, checks
, i
, chk
) ;
244 VEC_iterate (deferred_access_check
,
245 ptr
->deferred_access_checks
, j
, probe
) ;
248 if (probe
->binfo
== chk
->binfo
&&
249 probe
->decl
== chk
->decl
&&
250 probe
->diag_decl
== chk
->diag_decl
)
253 /* Insert into parent's checks. */
254 VEC_safe_push (deferred_access_check
, gc
,
255 ptr
->deferred_access_checks
, chk
);
262 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
263 is the BINFO indicating the qualifying scope used to access the
264 DECL node stored in the TREE_VALUE of the node. */
267 perform_access_checks (VEC (deferred_access_check
,gc
)* checks
)
270 deferred_access_check
*chk
;
275 for (i
= 0 ; VEC_iterate (deferred_access_check
, checks
, i
, chk
) ; ++i
)
276 enforce_access (chk
->binfo
, chk
->decl
, chk
->diag_decl
);
279 /* Perform the deferred access checks.
281 After performing the checks, we still have to keep the list
282 `deferred_access_stack->deferred_access_checks' since we may want
283 to check access for them again later in a different context.
290 A::X A::a, x; // No error for `A::a', error for `x'
292 We have to perform deferred access of `A::X', first with `A::a',
296 perform_deferred_access_checks (void)
298 perform_access_checks (get_deferred_access_checks ());
301 /* Defer checking the accessibility of DECL, when looked up in
302 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */
305 perform_or_defer_access_check (tree binfo
, tree decl
, tree diag_decl
)
308 deferred_access
*ptr
;
309 deferred_access_check
*chk
;
310 deferred_access_check
*new_access
;
313 /* Exit if we are in a context that no access checking is performed.
315 if (deferred_access_no_check
)
318 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
320 ptr
= VEC_last (deferred_access
, deferred_access_stack
);
322 /* If we are not supposed to defer access checks, just check now. */
323 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
325 enforce_access (binfo
, decl
, diag_decl
);
329 /* See if we are already going to perform this check. */
331 VEC_iterate (deferred_access_check
,
332 ptr
->deferred_access_checks
, i
, chk
) ;
335 if (chk
->decl
== decl
&& chk
->binfo
== binfo
&&
336 chk
->diag_decl
== diag_decl
)
341 /* If not, record the check. */
343 VEC_safe_push (deferred_access_check
, gc
,
344 ptr
->deferred_access_checks
, 0);
345 new_access
->binfo
= binfo
;
346 new_access
->decl
= decl
;
347 new_access
->diag_decl
= diag_decl
;
350 /* Returns nonzero if the current statement is a full expression,
351 i.e. temporaries created during that statement should be destroyed
352 at the end of the statement. */
355 stmts_are_full_exprs_p (void)
357 return current_stmt_tree ()->stmts_are_full_exprs_p
;
360 /* T is a statement. Add it to the statement-tree. This is the C++
361 version. The C/ObjC frontends have a slightly different version of
367 enum tree_code code
= TREE_CODE (t
);
369 if (EXPR_P (t
) && code
!= LABEL_EXPR
)
371 if (!EXPR_HAS_LOCATION (t
))
372 SET_EXPR_LOCATION (t
, input_location
);
374 /* When we expand a statement-tree, we must know whether or not the
375 statements are full-expressions. We record that fact here. */
376 STMT_IS_FULL_EXPR_P (t
) = stmts_are_full_exprs_p ();
379 /* Add T to the statement-tree. Non-side-effect statements need to be
380 recorded during statement expressions. */
381 append_to_statement_list_force (t
, &cur_stmt_list
);
386 /* Returns the stmt_tree to which statements are currently being added. */
389 current_stmt_tree (void)
392 ? &cfun
->language
->base
.x_stmt_tree
393 : &scope_chain
->x_stmt_tree
);
396 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
399 maybe_cleanup_point_expr (tree expr
)
401 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
402 expr
= fold_build_cleanup_point_expr (TREE_TYPE (expr
), expr
);
406 /* Like maybe_cleanup_point_expr except have the type of the new expression be
407 void so we don't need to create a temporary variable to hold the inner
408 expression. The reason why we do this is because the original type might be
409 an aggregate and we cannot create a temporary variable for that type. */
412 maybe_cleanup_point_expr_void (tree expr
)
414 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
415 expr
= fold_build_cleanup_point_expr (void_type_node
, expr
);
421 /* Create a declaration statement for the declaration given by the DECL. */
424 add_decl_expr (tree decl
)
426 tree r
= build_stmt (input_location
, DECL_EXPR
, decl
);
427 if (DECL_INITIAL (decl
)
428 || (DECL_SIZE (decl
) && TREE_SIDE_EFFECTS (DECL_SIZE (decl
))))
429 r
= maybe_cleanup_point_expr_void (r
);
433 /* Finish a scope. */
436 do_poplevel (tree stmt_list
)
440 if (stmts_are_full_exprs_p ())
441 block
= poplevel (kept_level_p (), 1, 0);
443 stmt_list
= pop_stmt_list (stmt_list
);
445 if (!processing_template_decl
)
447 stmt_list
= c_build_bind_expr (input_location
, block
, stmt_list
);
448 /* ??? See c_end_compound_stmt re statement expressions. */
454 /* Begin a new scope. */
457 do_pushlevel (scope_kind sk
)
459 tree ret
= push_stmt_list ();
460 if (stmts_are_full_exprs_p ())
461 begin_scope (sk
, NULL
);
465 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
466 when the current scope is exited. EH_ONLY is true when this is not
467 meant to apply to normal control flow transfer. */
470 push_cleanup (tree decl
, tree cleanup
, bool eh_only
)
472 tree stmt
= build_stmt (input_location
, CLEANUP_STMT
, NULL
, cleanup
, decl
);
473 CLEANUP_EH_ONLY (stmt
) = eh_only
;
475 CLEANUP_BODY (stmt
) = push_stmt_list ();
478 /* Begin a conditional that might contain a declaration. When generating
479 normal code, we want the declaration to appear before the statement
480 containing the conditional. When generating template code, we want the
481 conditional to be rendered as the raw DECL_EXPR. */
484 begin_cond (tree
*cond_p
)
486 if (processing_template_decl
)
487 *cond_p
= push_stmt_list ();
490 /* Finish such a conditional. */
493 finish_cond (tree
*cond_p
, tree expr
)
495 if (processing_template_decl
)
497 tree cond
= pop_stmt_list (*cond_p
);
498 if (TREE_CODE (cond
) == DECL_EXPR
)
501 if (check_for_bare_parameter_packs (expr
))
502 *cond_p
= error_mark_node
;
507 /* If *COND_P specifies a conditional with a declaration, transform the
510 for (; A x = 42;) { }
512 while (true) { A x = 42; if (!x) break; }
513 for (;;) { A x = 42; if (!x) break; }
514 The statement list for BODY will be empty if the conditional did
515 not declare anything. */
518 simplify_loop_decl_cond (tree
*cond_p
, tree body
)
522 if (!TREE_SIDE_EFFECTS (body
))
526 *cond_p
= boolean_true_node
;
528 if_stmt
= begin_if_stmt ();
529 cond
= cp_build_unary_op (TRUTH_NOT_EXPR
, cond
, 0, tf_warning_or_error
);
530 finish_if_stmt_cond (cond
, if_stmt
);
531 finish_break_stmt ();
532 finish_then_clause (if_stmt
);
533 finish_if_stmt (if_stmt
);
536 /* Finish a goto-statement. */
539 finish_goto_stmt (tree destination
)
541 if (TREE_CODE (destination
) == IDENTIFIER_NODE
)
542 destination
= lookup_label (destination
);
544 /* We warn about unused labels with -Wunused. That means we have to
545 mark the used labels as used. */
546 if (TREE_CODE (destination
) == LABEL_DECL
)
547 TREE_USED (destination
) = 1;
550 if (!processing_template_decl
)
552 destination
= cp_convert (ptr_type_node
, destination
);
553 if (error_operand_p (destination
))
556 /* We don't inline calls to functions with computed gotos.
557 Those functions are typically up to some funny business,
558 and may be depending on the labels being at particular
559 addresses, or some such. */
560 DECL_UNINLINABLE (current_function_decl
) = 1;
563 check_goto (destination
);
565 return add_stmt (build_stmt (input_location
, GOTO_EXPR
, destination
));
568 /* COND is the condition-expression for an if, while, etc.,
569 statement. Convert it to a boolean value, if appropriate.
570 In addition, verify sequence points if -Wsequence-point is enabled. */
573 maybe_convert_cond (tree cond
)
575 /* Empty conditions remain empty. */
579 /* Wait until we instantiate templates before doing conversion. */
580 if (processing_template_decl
)
583 if (warn_sequence_point
)
584 verify_sequence_points (cond
);
586 /* Do the conversion. */
587 cond
= convert_from_reference (cond
);
589 if (TREE_CODE (cond
) == MODIFY_EXPR
590 && !TREE_NO_WARNING (cond
)
593 warning (OPT_Wparentheses
,
594 "suggest parentheses around assignment used as truth value");
595 TREE_NO_WARNING (cond
) = 1;
598 return condition_conversion (cond
);
601 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
604 finish_expr_stmt (tree expr
)
608 if (expr
!= NULL_TREE
)
610 if (!processing_template_decl
)
612 if (warn_sequence_point
)
613 verify_sequence_points (expr
);
614 expr
= convert_to_void (expr
, "statement", tf_warning_or_error
);
616 else if (!type_dependent_expression_p (expr
))
617 convert_to_void (build_non_dependent_expr (expr
), "statement",
618 tf_warning_or_error
);
620 if (check_for_bare_parameter_packs (expr
))
621 expr
= error_mark_node
;
623 /* Simplification of inner statement expressions, compound exprs,
624 etc can result in us already having an EXPR_STMT. */
625 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
627 if (TREE_CODE (expr
) != EXPR_STMT
)
628 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
629 expr
= maybe_cleanup_point_expr_void (expr
);
641 /* Begin an if-statement. Returns a newly created IF_STMT if
648 scope
= do_pushlevel (sk_block
);
649 r
= build_stmt (input_location
, IF_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
650 TREE_CHAIN (r
) = scope
;
651 begin_cond (&IF_COND (r
));
655 /* Process the COND of an if-statement, which may be given by
659 finish_if_stmt_cond (tree cond
, tree if_stmt
)
661 finish_cond (&IF_COND (if_stmt
), maybe_convert_cond (cond
));
663 THEN_CLAUSE (if_stmt
) = push_stmt_list ();
666 /* Finish the then-clause of an if-statement, which may be given by
670 finish_then_clause (tree if_stmt
)
672 THEN_CLAUSE (if_stmt
) = pop_stmt_list (THEN_CLAUSE (if_stmt
));
676 /* Begin the else-clause of an if-statement. */
679 begin_else_clause (tree if_stmt
)
681 ELSE_CLAUSE (if_stmt
) = push_stmt_list ();
684 /* Finish the else-clause of an if-statement, which may be given by
688 finish_else_clause (tree if_stmt
)
690 ELSE_CLAUSE (if_stmt
) = pop_stmt_list (ELSE_CLAUSE (if_stmt
));
693 /* Finish an if-statement. */
696 finish_if_stmt (tree if_stmt
)
698 tree scope
= TREE_CHAIN (if_stmt
);
699 TREE_CHAIN (if_stmt
) = NULL
;
700 add_stmt (do_poplevel (scope
));
704 /* Begin a while-statement. Returns a newly created WHILE_STMT if
708 begin_while_stmt (void)
711 r
= build_stmt (input_location
, WHILE_STMT
, NULL_TREE
, NULL_TREE
);
713 WHILE_BODY (r
) = do_pushlevel (sk_block
);
714 begin_cond (&WHILE_COND (r
));
718 /* Process the COND of a while-statement, which may be given by
722 finish_while_stmt_cond (tree cond
, tree while_stmt
)
724 finish_cond (&WHILE_COND (while_stmt
), maybe_convert_cond (cond
));
725 simplify_loop_decl_cond (&WHILE_COND (while_stmt
), WHILE_BODY (while_stmt
));
728 /* Finish a while-statement, which may be given by WHILE_STMT. */
731 finish_while_stmt (tree while_stmt
)
733 WHILE_BODY (while_stmt
) = do_poplevel (WHILE_BODY (while_stmt
));
737 /* Begin a do-statement. Returns a newly created DO_STMT if
743 tree r
= build_stmt (input_location
, DO_STMT
, NULL_TREE
, NULL_TREE
);
745 DO_BODY (r
) = push_stmt_list ();
749 /* Finish the body of a do-statement, which may be given by DO_STMT. */
752 finish_do_body (tree do_stmt
)
754 tree body
= DO_BODY (do_stmt
) = pop_stmt_list (DO_BODY (do_stmt
));
756 if (TREE_CODE (body
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (body
))
757 body
= STATEMENT_LIST_TAIL (body
)->stmt
;
759 if (IS_EMPTY_STMT (body
))
760 warning (OPT_Wempty_body
,
761 "suggest explicit braces around empty body in %<do%> statement");
764 /* Finish a do-statement, which may be given by DO_STMT, and whose
765 COND is as indicated. */
768 finish_do_stmt (tree cond
, tree do_stmt
)
770 cond
= maybe_convert_cond (cond
);
771 DO_COND (do_stmt
) = cond
;
775 /* Finish a return-statement. The EXPRESSION returned, if any, is as
779 finish_return_stmt (tree expr
)
784 expr
= check_return_expr (expr
, &no_warning
);
786 if (flag_openmp
&& !check_omp_return ())
787 return error_mark_node
;
788 if (!processing_template_decl
)
790 if (warn_sequence_point
)
791 verify_sequence_points (expr
);
793 if (DECL_DESTRUCTOR_P (current_function_decl
)
794 || (DECL_CONSTRUCTOR_P (current_function_decl
)
795 && targetm
.cxx
.cdtor_returns_this ()))
797 /* Similarly, all destructors must run destructors for
798 base-classes before returning. So, all returns in a
799 destructor get sent to the DTOR_LABEL; finish_function emits
800 code to return a value there. */
801 return finish_goto_stmt (cdtor_label
);
805 r
= build_stmt (input_location
, RETURN_EXPR
, expr
);
806 TREE_NO_WARNING (r
) |= no_warning
;
807 r
= maybe_cleanup_point_expr_void (r
);
814 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
817 begin_for_stmt (void)
821 r
= build_stmt (input_location
, FOR_STMT
, NULL_TREE
, NULL_TREE
,
822 NULL_TREE
, NULL_TREE
);
824 if (flag_new_for_scope
> 0)
825 TREE_CHAIN (r
) = do_pushlevel (sk_for
);
827 if (processing_template_decl
)
828 FOR_INIT_STMT (r
) = push_stmt_list ();
833 /* Finish the for-init-statement of a for-statement, which may be
834 given by FOR_STMT. */
837 finish_for_init_stmt (tree for_stmt
)
839 if (processing_template_decl
)
840 FOR_INIT_STMT (for_stmt
) = pop_stmt_list (FOR_INIT_STMT (for_stmt
));
842 FOR_BODY (for_stmt
) = do_pushlevel (sk_block
);
843 begin_cond (&FOR_COND (for_stmt
));
846 /* Finish the COND of a for-statement, which may be given by
850 finish_for_cond (tree cond
, tree for_stmt
)
852 finish_cond (&FOR_COND (for_stmt
), maybe_convert_cond (cond
));
853 simplify_loop_decl_cond (&FOR_COND (for_stmt
), FOR_BODY (for_stmt
));
856 /* Finish the increment-EXPRESSION in a for-statement, which may be
857 given by FOR_STMT. */
860 finish_for_expr (tree expr
, tree for_stmt
)
864 /* If EXPR is an overloaded function, issue an error; there is no
865 context available to use to perform overload resolution. */
866 if (type_unknown_p (expr
))
868 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
869 expr
= error_mark_node
;
871 if (!processing_template_decl
)
873 if (warn_sequence_point
)
874 verify_sequence_points (expr
);
875 expr
= convert_to_void (expr
, "3rd expression in for",
876 tf_warning_or_error
);
878 else if (!type_dependent_expression_p (expr
))
879 convert_to_void (build_non_dependent_expr (expr
), "3rd expression in for",
880 tf_warning_or_error
);
881 expr
= maybe_cleanup_point_expr_void (expr
);
882 if (check_for_bare_parameter_packs (expr
))
883 expr
= error_mark_node
;
884 FOR_EXPR (for_stmt
) = expr
;
887 /* Finish the body of a for-statement, which may be given by
888 FOR_STMT. The increment-EXPR for the loop must be
892 finish_for_stmt (tree for_stmt
)
894 FOR_BODY (for_stmt
) = do_poplevel (FOR_BODY (for_stmt
));
896 /* Pop the scope for the body of the loop. */
897 if (flag_new_for_scope
> 0)
899 tree scope
= TREE_CHAIN (for_stmt
);
900 TREE_CHAIN (for_stmt
) = NULL
;
901 add_stmt (do_poplevel (scope
));
907 /* Finish a break-statement. */
910 finish_break_stmt (void)
912 return add_stmt (build_stmt (input_location
, BREAK_STMT
));
915 /* Finish a continue-statement. */
918 finish_continue_stmt (void)
920 return add_stmt (build_stmt (input_location
, CONTINUE_STMT
));
923 /* Begin a switch-statement. Returns a new SWITCH_STMT if
927 begin_switch_stmt (void)
931 r
= build_stmt (input_location
, SWITCH_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
933 scope
= do_pushlevel (sk_block
);
934 TREE_CHAIN (r
) = scope
;
935 begin_cond (&SWITCH_STMT_COND (r
));
940 /* Finish the cond of a switch-statement. */
943 finish_switch_cond (tree cond
, tree switch_stmt
)
945 tree orig_type
= NULL
;
946 if (!processing_template_decl
)
948 /* Convert the condition to an integer or enumeration type. */
949 cond
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, cond
, true);
950 if (cond
== NULL_TREE
)
952 error ("switch quantity not an integer");
953 cond
= error_mark_node
;
955 orig_type
= TREE_TYPE (cond
);
956 if (cond
!= error_mark_node
)
960 Integral promotions are performed. */
961 cond
= perform_integral_promotions (cond
);
962 cond
= maybe_cleanup_point_expr (cond
);
965 if (check_for_bare_parameter_packs (cond
))
966 cond
= error_mark_node
;
967 else if (!processing_template_decl
&& warn_sequence_point
)
968 verify_sequence_points (cond
);
970 finish_cond (&SWITCH_STMT_COND (switch_stmt
), cond
);
971 SWITCH_STMT_TYPE (switch_stmt
) = orig_type
;
972 add_stmt (switch_stmt
);
973 push_switch (switch_stmt
);
974 SWITCH_STMT_BODY (switch_stmt
) = push_stmt_list ();
977 /* Finish the body of a switch-statement, which may be given by
978 SWITCH_STMT. The COND to switch on is indicated. */
981 finish_switch_stmt (tree switch_stmt
)
985 SWITCH_STMT_BODY (switch_stmt
) =
986 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt
));
990 scope
= TREE_CHAIN (switch_stmt
);
991 TREE_CHAIN (switch_stmt
) = NULL
;
992 add_stmt (do_poplevel (scope
));
995 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
999 begin_try_block (void)
1001 tree r
= build_stmt (input_location
, TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
1003 TRY_STMTS (r
) = push_stmt_list ();
1007 /* Likewise, for a function-try-block. The block returned in
1008 *COMPOUND_STMT is an artificial outer scope, containing the
1009 function-try-block. */
1012 begin_function_try_block (tree
*compound_stmt
)
1015 /* This outer scope does not exist in the C++ standard, but we need
1016 a place to put __FUNCTION__ and similar variables. */
1017 *compound_stmt
= begin_compound_stmt (0);
1018 r
= begin_try_block ();
1019 FN_TRY_BLOCK_P (r
) = 1;
1023 /* Finish a try-block, which may be given by TRY_BLOCK. */
1026 finish_try_block (tree try_block
)
1028 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1029 TRY_HANDLERS (try_block
) = push_stmt_list ();
1032 /* Finish the body of a cleanup try-block, which may be given by
1036 finish_cleanup_try_block (tree try_block
)
1038 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1041 /* Finish an implicitly generated try-block, with a cleanup is given
1045 finish_cleanup (tree cleanup
, tree try_block
)
1047 TRY_HANDLERS (try_block
) = cleanup
;
1048 CLEANUP_P (try_block
) = 1;
1051 /* Likewise, for a function-try-block. */
1054 finish_function_try_block (tree try_block
)
1056 finish_try_block (try_block
);
1057 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1058 the try block, but moving it inside. */
1059 in_function_try_handler
= 1;
1062 /* Finish a handler-sequence for a try-block, which may be given by
1066 finish_handler_sequence (tree try_block
)
1068 TRY_HANDLERS (try_block
) = pop_stmt_list (TRY_HANDLERS (try_block
));
1069 check_handlers (TRY_HANDLERS (try_block
));
1072 /* Finish the handler-seq for a function-try-block, given by
1073 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1074 begin_function_try_block. */
1077 finish_function_handler_sequence (tree try_block
, tree compound_stmt
)
1079 in_function_try_handler
= 0;
1080 finish_handler_sequence (try_block
);
1081 finish_compound_stmt (compound_stmt
);
1084 /* Begin a handler. Returns a HANDLER if appropriate. */
1087 begin_handler (void)
1091 r
= build_stmt (input_location
, HANDLER
, NULL_TREE
, NULL_TREE
);
1094 /* Create a binding level for the eh_info and the exception object
1096 HANDLER_BODY (r
) = do_pushlevel (sk_catch
);
1101 /* Finish the handler-parameters for a handler, which may be given by
1102 HANDLER. DECL is the declaration for the catch parameter, or NULL
1103 if this is a `catch (...)' clause. */
1106 finish_handler_parms (tree decl
, tree handler
)
1108 tree type
= NULL_TREE
;
1109 if (processing_template_decl
)
1113 decl
= pushdecl (decl
);
1114 decl
= push_template_decl (decl
);
1115 HANDLER_PARMS (handler
) = decl
;
1116 type
= TREE_TYPE (decl
);
1120 type
= expand_start_catch_block (decl
);
1121 HANDLER_TYPE (handler
) = type
;
1122 if (!processing_template_decl
&& type
)
1123 mark_used (eh_type_info (type
));
1126 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1127 the return value from the matching call to finish_handler_parms. */
1130 finish_handler (tree handler
)
1132 if (!processing_template_decl
)
1133 expand_end_catch_block ();
1134 HANDLER_BODY (handler
) = do_poplevel (HANDLER_BODY (handler
));
1137 /* Begin a compound statement. FLAGS contains some bits that control the
1138 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1139 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1140 block of a function. If BCS_TRY_BLOCK is set, this is the block
1141 created on behalf of a TRY statement. Returns a token to be passed to
1142 finish_compound_stmt. */
1145 begin_compound_stmt (unsigned int flags
)
1149 if (flags
& BCS_NO_SCOPE
)
1151 r
= push_stmt_list ();
1152 STATEMENT_LIST_NO_SCOPE (r
) = 1;
1154 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1155 But, if it's a statement-expression with a scopeless block, there's
1156 nothing to keep, and we don't want to accidentally keep a block
1157 *inside* the scopeless block. */
1158 keep_next_level (false);
1161 r
= do_pushlevel (flags
& BCS_TRY_BLOCK
? sk_try
: sk_block
);
1163 /* When processing a template, we need to remember where the braces were,
1164 so that we can set up identical scopes when instantiating the template
1165 later. BIND_EXPR is a handy candidate for this.
1166 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1167 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1168 processing templates. */
1169 if (processing_template_decl
)
1171 r
= build3 (BIND_EXPR
, NULL
, NULL
, r
, NULL
);
1172 BIND_EXPR_TRY_BLOCK (r
) = (flags
& BCS_TRY_BLOCK
) != 0;
1173 BIND_EXPR_BODY_BLOCK (r
) = (flags
& BCS_FN_BODY
) != 0;
1174 TREE_SIDE_EFFECTS (r
) = 1;
1180 /* Finish a compound-statement, which is given by STMT. */
1183 finish_compound_stmt (tree stmt
)
1185 if (TREE_CODE (stmt
) == BIND_EXPR
)
1186 BIND_EXPR_BODY (stmt
) = do_poplevel (BIND_EXPR_BODY (stmt
));
1187 else if (STATEMENT_LIST_NO_SCOPE (stmt
))
1188 stmt
= pop_stmt_list (stmt
);
1191 /* Destroy any ObjC "super" receivers that may have been
1193 objc_clear_super_receiver ();
1195 stmt
= do_poplevel (stmt
);
1198 /* ??? See c_end_compound_stmt wrt statement expressions. */
1203 /* Finish an asm-statement, whose components are a STRING, some
1204 OUTPUT_OPERANDS, some INPUT_OPERANDS, some CLOBBERS and some
1205 LABELS. Also note whether the asm-statement should be
1206 considered volatile. */
1209 finish_asm_stmt (int volatile_p
, tree string
, tree output_operands
,
1210 tree input_operands
, tree clobbers
, tree labels
)
1214 int ninputs
= list_length (input_operands
);
1215 int noutputs
= list_length (output_operands
);
1217 if (!processing_template_decl
)
1219 const char *constraint
;
1220 const char **oconstraints
;
1221 bool allows_mem
, allows_reg
, is_inout
;
1225 oconstraints
= (const char **) alloca (noutputs
* sizeof (char *));
1227 string
= resolve_asm_operand_names (string
, output_operands
,
1228 input_operands
, labels
);
1230 for (i
= 0, t
= output_operands
; t
; t
= TREE_CHAIN (t
), ++i
)
1232 operand
= TREE_VALUE (t
);
1234 /* ??? Really, this should not be here. Users should be using a
1235 proper lvalue, dammit. But there's a long history of using
1236 casts in the output operands. In cases like longlong.h, this
1237 becomes a primitive form of typechecking -- if the cast can be
1238 removed, then the output operand had a type of the proper width;
1239 otherwise we'll get an error. Gross, but ... */
1240 STRIP_NOPS (operand
);
1242 operand
= mark_lvalue_use (operand
);
1244 if (!lvalue_or_else (operand
, lv_asm
, tf_warning_or_error
))
1245 operand
= error_mark_node
;
1247 if (operand
!= error_mark_node
1248 && (TREE_READONLY (operand
)
1249 || CP_TYPE_CONST_P (TREE_TYPE (operand
))
1250 /* Functions are not modifiable, even though they are
1252 || TREE_CODE (TREE_TYPE (operand
)) == FUNCTION_TYPE
1253 || TREE_CODE (TREE_TYPE (operand
)) == METHOD_TYPE
1254 /* If it's an aggregate and any field is const, then it is
1255 effectively const. */
1256 || (CLASS_TYPE_P (TREE_TYPE (operand
))
1257 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand
)))))
1258 readonly_error (operand
, REK_ASSIGNMENT_ASM
);
1260 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1261 oconstraints
[i
] = constraint
;
1263 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
1264 &allows_mem
, &allows_reg
, &is_inout
))
1266 /* If the operand is going to end up in memory,
1267 mark it addressable. */
1268 if (!allows_reg
&& !cxx_mark_addressable (operand
))
1269 operand
= error_mark_node
;
1272 operand
= error_mark_node
;
1274 TREE_VALUE (t
) = operand
;
1277 for (i
= 0, t
= input_operands
; t
; ++i
, t
= TREE_CHAIN (t
))
1279 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1280 operand
= decay_conversion (TREE_VALUE (t
));
1282 /* If the type of the operand hasn't been determined (e.g.,
1283 because it involves an overloaded function), then issue
1284 an error message. There's no context available to
1285 resolve the overloading. */
1286 if (TREE_TYPE (operand
) == unknown_type_node
)
1288 error ("type of asm operand %qE could not be determined",
1290 operand
= error_mark_node
;
1293 if (parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
1294 oconstraints
, &allows_mem
, &allows_reg
))
1296 /* If the operand is going to end up in memory,
1297 mark it addressable. */
1298 if (!allows_reg
&& allows_mem
)
1300 /* Strip the nops as we allow this case. FIXME, this really
1301 should be rejected or made deprecated. */
1302 STRIP_NOPS (operand
);
1303 if (!cxx_mark_addressable (operand
))
1304 operand
= error_mark_node
;
1308 operand
= error_mark_node
;
1310 TREE_VALUE (t
) = operand
;
1314 r
= build_stmt (input_location
, ASM_EXPR
, string
,
1315 output_operands
, input_operands
,
1317 ASM_VOLATILE_P (r
) = volatile_p
|| noutputs
== 0;
1318 r
= maybe_cleanup_point_expr_void (r
);
1319 return add_stmt (r
);
1322 /* Finish a label with the indicated NAME. Returns the new label. */
1325 finish_label_stmt (tree name
)
1327 tree decl
= define_label (input_location
, name
);
1329 if (decl
== error_mark_node
)
1330 return error_mark_node
;
1332 add_stmt (build_stmt (input_location
, LABEL_EXPR
, decl
));
1337 /* Finish a series of declarations for local labels. G++ allows users
1338 to declare "local" labels, i.e., labels with scope. This extension
1339 is useful when writing code involving statement-expressions. */
1342 finish_label_decl (tree name
)
1344 if (!at_function_scope_p ())
1346 error ("__label__ declarations are only allowed in function scopes");
1350 add_decl_expr (declare_local_label (name
));
1353 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1356 finish_decl_cleanup (tree decl
, tree cleanup
)
1358 push_cleanup (decl
, cleanup
, false);
1361 /* If the current scope exits with an exception, run CLEANUP. */
1364 finish_eh_cleanup (tree cleanup
)
1366 push_cleanup (NULL
, cleanup
, true);
1369 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1370 order they were written by the user. Each node is as for
1371 emit_mem_initializers. */
1374 finish_mem_initializers (tree mem_inits
)
1376 /* Reorder the MEM_INITS so that they are in the order they appeared
1377 in the source program. */
1378 mem_inits
= nreverse (mem_inits
);
1380 if (processing_template_decl
)
1384 for (mem
= mem_inits
; mem
; mem
= TREE_CHAIN (mem
))
1386 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1387 check for bare parameter packs in the TREE_VALUE, because
1388 any parameter packs in the TREE_VALUE have already been
1389 bound as part of the TREE_PURPOSE. See
1390 make_pack_expansion for more information. */
1391 if (TREE_CODE (TREE_PURPOSE (mem
)) != TYPE_PACK_EXPANSION
1392 && check_for_bare_parameter_packs (TREE_VALUE (mem
)))
1393 TREE_VALUE (mem
) = error_mark_node
;
1396 add_stmt (build_min_nt (CTOR_INITIALIZER
, mem_inits
));
1399 emit_mem_initializers (mem_inits
);
1402 /* Finish a parenthesized expression EXPR. */
1405 finish_parenthesized_expr (tree expr
)
1408 /* This inhibits warnings in c_common_truthvalue_conversion. */
1409 TREE_NO_WARNING (expr
) = 1;
1411 if (TREE_CODE (expr
) == OFFSET_REF
)
1412 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1413 enclosed in parentheses. */
1414 PTRMEM_OK_P (expr
) = 0;
1416 if (TREE_CODE (expr
) == STRING_CST
)
1417 PAREN_STRING_LITERAL_P (expr
) = 1;
1422 /* Finish a reference to a non-static data member (DECL) that is not
1423 preceded by `.' or `->'. */
1426 finish_non_static_data_member (tree decl
, tree object
, tree qualifying_scope
)
1428 gcc_assert (TREE_CODE (decl
) == FIELD_DECL
);
1432 tree scope
= qualifying_scope
;
1433 if (scope
== NULL_TREE
)
1434 scope
= context_for_name_lookup (decl
);
1435 object
= maybe_dummy_object (scope
, NULL
);
1438 /* DR 613: Can use non-static data members without an associated
1439 object in sizeof/decltype/alignof. */
1440 if (is_dummy_object (object
) && cp_unevaluated_operand
== 0
1441 && (!processing_template_decl
|| !current_class_ref
))
1443 if (current_function_decl
1444 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1445 error ("invalid use of member %q+D in static member function", decl
);
1447 error ("invalid use of non-static data member %q+D", decl
);
1448 error ("from this location");
1450 return error_mark_node
;
1453 if (current_class_ptr
)
1454 TREE_USED (current_class_ptr
) = 1;
1455 if (processing_template_decl
&& !qualifying_scope
)
1457 tree type
= TREE_TYPE (decl
);
1459 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1460 type
= TREE_TYPE (type
);
1463 /* Set the cv qualifiers. */
1464 int quals
= (current_class_ref
1465 ? cp_type_quals (TREE_TYPE (current_class_ref
))
1466 : TYPE_UNQUALIFIED
);
1468 if (DECL_MUTABLE_P (decl
))
1469 quals
&= ~TYPE_QUAL_CONST
;
1471 quals
|= cp_type_quals (TREE_TYPE (decl
));
1472 type
= cp_build_qualified_type (type
, quals
);
1475 return build_min (COMPONENT_REF
, type
, object
, decl
, NULL_TREE
);
1477 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1478 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1480 else if (processing_template_decl
)
1481 return build_qualified_name (TREE_TYPE (decl
),
1484 /*template_p=*/false);
1487 tree access_type
= TREE_TYPE (object
);
1489 perform_or_defer_access_check (TYPE_BINFO (access_type
), decl
,
1492 /* If the data member was named `C::M', convert `*this' to `C'
1494 if (qualifying_scope
)
1496 tree binfo
= NULL_TREE
;
1497 object
= build_scoped_ref (object
, qualifying_scope
,
1501 return build_class_member_access_expr (object
, decl
,
1502 /*access_path=*/NULL_TREE
,
1503 /*preserve_reference=*/false,
1504 tf_warning_or_error
);
1508 /* If we are currently parsing a template and we encountered a typedef
1509 TYPEDEF_DECL that is being accessed though CONTEXT, this function
1510 adds the typedef to a list tied to the current template.
1511 At tempate instantiatin time, that list is walked and access check
1512 performed for each typedef.
1513 LOCATION is the location of the usage point of TYPEDEF_DECL. */
1516 add_typedef_to_current_template_for_access_check (tree typedef_decl
,
1518 location_t location
)
1520 tree template_info
= NULL
;
1521 tree cs
= current_scope ();
1523 if (!is_typedef_decl (typedef_decl
)
1525 || !CLASS_TYPE_P (context
)
1529 if (CLASS_TYPE_P (cs
) || TREE_CODE (cs
) == FUNCTION_DECL
)
1530 template_info
= get_template_info (cs
);
1533 && TI_TEMPLATE (template_info
)
1534 && !currently_open_class (context
))
1535 append_type_to_template_for_access_check (cs
, typedef_decl
,
1539 /* DECL was the declaration to which a qualified-id resolved. Issue
1540 an error message if it is not accessible. If OBJECT_TYPE is
1541 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1542 type of `*x', or `x', respectively. If the DECL was named as
1543 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1546 check_accessibility_of_qualified_id (tree decl
,
1548 tree nested_name_specifier
)
1551 tree qualifying_type
= NULL_TREE
;
1553 /* If we are parsing a template declaration and if decl is a typedef,
1554 add it to a list tied to the template.
1555 At template instantiation time, that list will be walked and
1556 access check performed. */
1557 add_typedef_to_current_template_for_access_check (decl
,
1558 nested_name_specifier
1559 ? nested_name_specifier
1560 : DECL_CONTEXT (decl
),
1563 /* If we're not checking, return immediately. */
1564 if (deferred_access_no_check
)
1567 /* Determine the SCOPE of DECL. */
1568 scope
= context_for_name_lookup (decl
);
1569 /* If the SCOPE is not a type, then DECL is not a member. */
1570 if (!TYPE_P (scope
))
1572 /* Compute the scope through which DECL is being accessed. */
1574 /* OBJECT_TYPE might not be a class type; consider:
1576 class A { typedef int I; };
1580 In this case, we will have "A::I" as the DECL, but "I" as the
1582 && CLASS_TYPE_P (object_type
)
1583 && DERIVED_FROM_P (scope
, object_type
))
1584 /* If we are processing a `->' or `.' expression, use the type of the
1586 qualifying_type
= object_type
;
1587 else if (nested_name_specifier
)
1589 /* If the reference is to a non-static member of the
1590 current class, treat it as if it were referenced through
1592 if (DECL_NONSTATIC_MEMBER_P (decl
)
1593 && current_class_ptr
1594 && DERIVED_FROM_P (scope
, current_class_type
))
1595 qualifying_type
= current_class_type
;
1596 /* Otherwise, use the type indicated by the
1597 nested-name-specifier. */
1599 qualifying_type
= nested_name_specifier
;
1602 /* Otherwise, the name must be from the current class or one of
1604 qualifying_type
= currently_open_derived_class (scope
);
1607 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1608 or similar in a default argument value. */
1609 && CLASS_TYPE_P (qualifying_type
)
1610 && !dependent_type_p (qualifying_type
))
1611 perform_or_defer_access_check (TYPE_BINFO (qualifying_type
), decl
,
1615 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1616 class named to the left of the "::" operator. DONE is true if this
1617 expression is a complete postfix-expression; it is false if this
1618 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1619 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1620 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1621 is true iff this qualified name appears as a template argument. */
1624 finish_qualified_id_expr (tree qualifying_class
,
1629 bool template_arg_p
)
1631 gcc_assert (TYPE_P (qualifying_class
));
1633 if (error_operand_p (expr
))
1634 return error_mark_node
;
1636 if (DECL_P (expr
) || BASELINK_P (expr
))
1640 check_template_keyword (expr
);
1642 /* If EXPR occurs as the operand of '&', use special handling that
1643 permits a pointer-to-member. */
1644 if (address_p
&& done
)
1646 if (TREE_CODE (expr
) == SCOPE_REF
)
1647 expr
= TREE_OPERAND (expr
, 1);
1648 expr
= build_offset_ref (qualifying_class
, expr
,
1649 /*address_p=*/true);
1653 /* Within the scope of a class, turn references to non-static
1654 members into expression of the form "this->...". */
1656 /* But, within a template argument, we do not want make the
1657 transformation, as there is no "this" pointer. */
1659 else if (TREE_CODE (expr
) == FIELD_DECL
)
1661 push_deferring_access_checks (dk_no_check
);
1662 expr
= finish_non_static_data_member (expr
, NULL_TREE
,
1664 pop_deferring_access_checks ();
1666 else if (BASELINK_P (expr
) && !processing_template_decl
)
1670 /* See if any of the functions are non-static members. */
1671 /* If so, the expression may be relative to 'this'. */
1672 if (!shared_member_p (expr
)
1673 && (ob
= maybe_dummy_object (qualifying_class
, NULL
),
1674 !is_dummy_object (ob
)))
1675 expr
= (build_class_member_access_expr
1678 BASELINK_ACCESS_BINFO (expr
),
1679 /*preserve_reference=*/false,
1680 tf_warning_or_error
));
1682 /* The expression is a qualified name whose address is not
1684 expr
= build_offset_ref (qualifying_class
, expr
, /*address_p=*/false);
1690 /* Begin a statement-expression. The value returned must be passed to
1691 finish_stmt_expr. */
1694 begin_stmt_expr (void)
1696 return push_stmt_list ();
1699 /* Process the final expression of a statement expression. EXPR can be
1700 NULL, if the final expression is empty. Return a STATEMENT_LIST
1701 containing all the statements in the statement-expression, or
1702 ERROR_MARK_NODE if there was an error. */
1705 finish_stmt_expr_expr (tree expr
, tree stmt_expr
)
1707 if (error_operand_p (expr
))
1709 /* The type of the statement-expression is the type of the last
1711 TREE_TYPE (stmt_expr
) = error_mark_node
;
1712 return error_mark_node
;
1715 /* If the last statement does not have "void" type, then the value
1716 of the last statement is the value of the entire expression. */
1719 tree type
= TREE_TYPE (expr
);
1721 if (processing_template_decl
)
1723 expr
= build_stmt (input_location
, EXPR_STMT
, expr
);
1724 expr
= add_stmt (expr
);
1725 /* Mark the last statement so that we can recognize it as such at
1726 template-instantiation time. */
1727 EXPR_STMT_STMT_EXPR_RESULT (expr
) = 1;
1729 else if (VOID_TYPE_P (type
))
1731 /* Just treat this like an ordinary statement. */
1732 expr
= finish_expr_stmt (expr
);
1736 /* It actually has a value we need to deal with. First, force it
1737 to be an rvalue so that we won't need to build up a copy
1738 constructor call later when we try to assign it to something. */
1739 expr
= force_rvalue (expr
);
1740 if (error_operand_p (expr
))
1741 return error_mark_node
;
1743 /* Update for array-to-pointer decay. */
1744 type
= TREE_TYPE (expr
);
1746 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1747 normal statement, but don't convert to void or actually add
1749 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
1750 expr
= maybe_cleanup_point_expr (expr
);
1754 /* The type of the statement-expression is the type of the last
1756 TREE_TYPE (stmt_expr
) = type
;
1762 /* Finish a statement-expression. EXPR should be the value returned
1763 by the previous begin_stmt_expr. Returns an expression
1764 representing the statement-expression. */
1767 finish_stmt_expr (tree stmt_expr
, bool has_no_scope
)
1772 if (error_operand_p (stmt_expr
))
1774 pop_stmt_list (stmt_expr
);
1775 return error_mark_node
;
1778 gcc_assert (TREE_CODE (stmt_expr
) == STATEMENT_LIST
);
1780 type
= TREE_TYPE (stmt_expr
);
1781 result
= pop_stmt_list (stmt_expr
);
1782 TREE_TYPE (result
) = type
;
1784 if (processing_template_decl
)
1786 result
= build_min (STMT_EXPR
, type
, result
);
1787 TREE_SIDE_EFFECTS (result
) = 1;
1788 STMT_EXPR_NO_SCOPE (result
) = has_no_scope
;
1790 else if (CLASS_TYPE_P (type
))
1792 /* Wrap the statement-expression in a TARGET_EXPR so that the
1793 temporary object created by the final expression is destroyed at
1794 the end of the full-expression containing the
1795 statement-expression. */
1796 result
= force_target_expr (type
, result
);
1802 /* Returns the expression which provides the value of STMT_EXPR. */
1805 stmt_expr_value_expr (tree stmt_expr
)
1807 tree t
= STMT_EXPR_STMT (stmt_expr
);
1809 if (TREE_CODE (t
) == BIND_EXPR
)
1810 t
= BIND_EXPR_BODY (t
);
1812 if (TREE_CODE (t
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (t
))
1813 t
= STATEMENT_LIST_TAIL (t
)->stmt
;
1815 if (TREE_CODE (t
) == EXPR_STMT
)
1816 t
= EXPR_STMT_EXPR (t
);
1821 /* Return TRUE iff EXPR_STMT is an empty list of
1822 expression statements. */
1825 empty_expr_stmt_p (tree expr_stmt
)
1827 tree body
= NULL_TREE
;
1829 if (expr_stmt
== void_zero_node
)
1834 if (TREE_CODE (expr_stmt
) == EXPR_STMT
)
1835 body
= EXPR_STMT_EXPR (expr_stmt
);
1836 else if (TREE_CODE (expr_stmt
) == STATEMENT_LIST
)
1842 if (TREE_CODE (body
) == STATEMENT_LIST
)
1843 return tsi_end_p (tsi_start (body
));
1845 return empty_expr_stmt_p (body
);
1850 /* Perform Koenig lookup. FN is the postfix-expression representing
1851 the function (or functions) to call; ARGS are the arguments to the
1852 call. Returns the functions to be considered by overload
1856 perform_koenig_lookup (tree fn
, VEC(tree
,gc
) *args
)
1858 tree identifier
= NULL_TREE
;
1859 tree functions
= NULL_TREE
;
1860 tree tmpl_args
= NULL_TREE
;
1861 bool template_id
= false;
1863 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
1865 /* Use a separate flag to handle null args. */
1867 tmpl_args
= TREE_OPERAND (fn
, 1);
1868 fn
= TREE_OPERAND (fn
, 0);
1871 /* Find the name of the overloaded function. */
1872 if (TREE_CODE (fn
) == IDENTIFIER_NODE
)
1874 else if (is_overloaded_fn (fn
))
1877 identifier
= DECL_NAME (get_first_fn (functions
));
1879 else if (DECL_P (fn
))
1882 identifier
= DECL_NAME (fn
);
1885 /* A call to a namespace-scope function using an unqualified name.
1887 Do Koenig lookup -- unless any of the arguments are
1889 if (!any_type_dependent_arguments_p (args
)
1890 && !any_dependent_template_arguments_p (tmpl_args
))
1892 fn
= lookup_arg_dependent (identifier
, functions
, args
);
1894 /* The unqualified name could not be resolved. */
1895 fn
= unqualified_fn_lookup_error (identifier
);
1898 if (fn
&& template_id
)
1899 fn
= build2 (TEMPLATE_ID_EXPR
, unknown_type_node
, fn
, tmpl_args
);
1904 /* Generate an expression for `FN (ARGS)'. This may change the
1907 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1908 as a virtual call, even if FN is virtual. (This flag is set when
1909 encountering an expression where the function name is explicitly
1910 qualified. For example a call to `X::f' never generates a virtual
1913 Returns code for the call. */
1916 finish_call_expr (tree fn
, VEC(tree
,gc
) **args
, bool disallow_virtual
,
1917 bool koenig_p
, tsubst_flags_t complain
)
1921 VEC(tree
,gc
) *orig_args
= NULL
;
1923 if (fn
== error_mark_node
)
1924 return error_mark_node
;
1926 gcc_assert (!TYPE_P (fn
));
1930 if (processing_template_decl
)
1932 if (type_dependent_expression_p (fn
)
1933 || any_type_dependent_arguments_p (*args
))
1935 result
= build_nt_call_vec (fn
, *args
);
1936 KOENIG_LOOKUP_P (result
) = koenig_p
;
1941 tree fndecl
= OVL_CURRENT (fn
);
1942 if (TREE_CODE (fndecl
) != FUNCTION_DECL
1943 || !TREE_THIS_VOLATILE (fndecl
))
1949 current_function_returns_abnormally
= 1;
1953 orig_args
= make_tree_vector_copy (*args
);
1954 if (!BASELINK_P (fn
)
1955 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
1956 && TREE_TYPE (fn
) != unknown_type_node
)
1957 fn
= build_non_dependent_expr (fn
);
1958 make_args_non_dependent (*args
);
1961 if (is_overloaded_fn (fn
))
1962 fn
= baselink_for_fns (fn
);
1965 if (BASELINK_P (fn
))
1969 /* A call to a member function. From [over.call.func]:
1971 If the keyword this is in scope and refers to the class of
1972 that member function, or a derived class thereof, then the
1973 function call is transformed into a qualified function call
1974 using (*this) as the postfix-expression to the left of the
1975 . operator.... [Otherwise] a contrived object of type T
1976 becomes the implied object argument.
1980 struct A { void f(); };
1981 struct B : public A {};
1982 struct C : public A { void g() { B::f(); }};
1984 "the class of that member function" refers to `A'. But 11.2
1985 [class.access.base] says that we need to convert 'this' to B* as
1986 part of the access, so we pass 'B' to maybe_dummy_object. */
1988 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
1991 if (processing_template_decl
)
1993 if (type_dependent_expression_p (object
))
1995 tree ret
= build_nt_call_vec (orig_fn
, orig_args
);
1996 release_tree_vector (orig_args
);
1999 object
= build_non_dependent_expr (object
);
2002 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
2004 ? LOOKUP_NONVIRTUAL
: 0),
2008 else if (is_overloaded_fn (fn
))
2010 /* If the function is an overloaded builtin, resolve it. */
2011 if (TREE_CODE (fn
) == FUNCTION_DECL
2012 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
2013 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
2014 result
= resolve_overloaded_builtin (input_location
, fn
, *args
);
2017 /* A call to a namespace-scope function. */
2018 result
= build_new_function_call (fn
, args
, koenig_p
, complain
);
2020 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
2022 if (!VEC_empty (tree
, *args
))
2023 error ("arguments to destructor are not allowed");
2024 /* Mark the pseudo-destructor call as having side-effects so
2025 that we do not issue warnings about its use. */
2026 result
= build1 (NOP_EXPR
,
2028 TREE_OPERAND (fn
, 0));
2029 TREE_SIDE_EFFECTS (result
) = 1;
2031 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
2032 /* If the "function" is really an object of class type, it might
2033 have an overloaded `operator ()'. */
2034 result
= build_op_call (fn
, args
, complain
);
2037 /* A call where the function is unknown. */
2038 result
= cp_build_function_call_vec (fn
, args
, complain
);
2040 if (processing_template_decl
)
2042 result
= build_call_vec (TREE_TYPE (result
), orig_fn
, orig_args
);
2043 KOENIG_LOOKUP_P (result
) = koenig_p
;
2044 release_tree_vector (orig_args
);
2050 /* Finish a call to a postfix increment or decrement or EXPR. (Which
2051 is indicated by CODE, which should be POSTINCREMENT_EXPR or
2052 POSTDECREMENT_EXPR.) */
2055 finish_increment_expr (tree expr
, enum tree_code code
)
2057 return build_x_unary_op (code
, expr
, tf_warning_or_error
);
2060 /* Finish a use of `this'. Returns an expression for `this'. */
2063 finish_this_expr (void)
2067 if (current_class_ptr
)
2069 tree type
= TREE_TYPE (current_class_ref
);
2071 /* In a lambda expression, 'this' refers to the captured 'this'. */
2072 if (LAMBDA_TYPE_P (type
))
2073 result
= lambda_expr_this_capture (CLASSTYPE_LAMBDA_EXPR (type
));
2075 result
= current_class_ptr
;
2078 else if (current_function_decl
2079 && DECL_STATIC_FUNCTION_P (current_function_decl
))
2081 error ("%<this%> is unavailable for static member functions");
2082 result
= error_mark_node
;
2086 if (current_function_decl
)
2087 error ("invalid use of %<this%> in non-member function");
2089 error ("invalid use of %<this%> at top level");
2090 result
= error_mark_node
;
2096 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2097 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2098 the TYPE for the type given. If SCOPE is non-NULL, the expression
2099 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2102 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
)
2104 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2105 return error_mark_node
;
2107 gcc_assert (TYPE_P (destructor
));
2109 if (!processing_template_decl
)
2111 if (scope
== error_mark_node
)
2113 error ("invalid qualifying scope in pseudo-destructor name");
2114 return error_mark_node
;
2116 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2118 error ("qualified type %qT does not match destructor name ~%qT",
2120 return error_mark_node
;
2124 /* [expr.pseudo] says both:
2126 The type designated by the pseudo-destructor-name shall be
2127 the same as the object type.
2131 The cv-unqualified versions of the object type and of the
2132 type designated by the pseudo-destructor-name shall be the
2135 We implement the more generous second sentence, since that is
2136 what most other compilers do. */
2137 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2140 error ("%qE is not of type %qT", object
, destructor
);
2141 return error_mark_node
;
2145 return build3 (PSEUDO_DTOR_EXPR
, void_type_node
, object
, scope
, destructor
);
2148 /* Finish an expression of the form CODE EXPR. */
2151 finish_unary_op_expr (enum tree_code code
, tree expr
)
2153 tree result
= build_x_unary_op (code
, expr
, tf_warning_or_error
);
2154 /* Inside a template, build_x_unary_op does not fold the
2155 expression. So check whether the result is folded before
2156 setting TREE_NEGATED_INT. */
2157 if (code
== NEGATE_EXPR
&& TREE_CODE (expr
) == INTEGER_CST
2158 && TREE_CODE (result
) == INTEGER_CST
2159 && !TYPE_UNSIGNED (TREE_TYPE (result
))
2160 && INT_CST_LT (result
, integer_zero_node
))
2162 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2163 setting TREE_NEGATED_INT. */
2164 result
= copy_node (result
);
2165 TREE_NEGATED_INT (result
) = 1;
2167 if (TREE_OVERFLOW_P (result
) && !TREE_OVERFLOW_P (expr
))
2168 overflow_warning (input_location
, result
);
2173 /* Finish a compound-literal expression. TYPE is the type to which
2174 the CONSTRUCTOR in COMPOUND_LITERAL is being cast. */
2177 finish_compound_literal (tree type
, tree compound_literal
)
2179 if (type
== error_mark_node
)
2180 return error_mark_node
;
2182 if (!TYPE_OBJ_P (type
))
2184 error ("compound literal of non-object type %qT", type
);
2185 return error_mark_node
;
2188 if (processing_template_decl
)
2190 TREE_TYPE (compound_literal
) = type
;
2191 /* Mark the expression as a compound literal. */
2192 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2193 return compound_literal
;
2196 type
= complete_type (type
);
2198 if (TYPE_NON_AGGREGATE_CLASS (type
))
2200 /* Trying to deal with a CONSTRUCTOR instead of a TREE_LIST
2201 everywhere that deals with function arguments would be a pain, so
2202 just wrap it in a TREE_LIST. The parser set a flag so we know
2203 that it came from T{} rather than T({}). */
2204 CONSTRUCTOR_IS_DIRECT_INIT (compound_literal
) = 1;
2205 compound_literal
= build_tree_list (NULL_TREE
, compound_literal
);
2206 return build_functional_cast (type
, compound_literal
, tf_error
);
2209 if (TREE_CODE (type
) == ARRAY_TYPE
2210 && check_array_initializer (NULL_TREE
, type
, compound_literal
))
2211 return error_mark_node
;
2212 compound_literal
= reshape_init (type
, compound_literal
);
2213 if (TREE_CODE (type
) == ARRAY_TYPE
)
2214 cp_complete_array_type (&type
, compound_literal
, false);
2215 compound_literal
= digest_init (type
, compound_literal
);
2216 if ((!at_function_scope_p () || CP_TYPE_CONST_P (type
))
2217 && initializer_constant_valid_p (compound_literal
, type
))
2219 tree decl
= create_temporary_var (type
);
2220 DECL_INITIAL (decl
) = compound_literal
;
2221 TREE_STATIC (decl
) = 1;
2222 cp_apply_type_quals_to_decl (cp_type_quals (type
), decl
);
2223 decl
= pushdecl_top_level (decl
);
2224 DECL_NAME (decl
) = make_anon_name ();
2225 SET_DECL_ASSEMBLER_NAME (decl
, DECL_NAME (decl
));
2229 return get_target_expr (compound_literal
);
2232 /* Return the declaration for the function-name variable indicated by
2236 finish_fname (tree id
)
2240 decl
= fname_decl (input_location
, C_RID_CODE (id
), id
);
2241 if (processing_template_decl
)
2242 decl
= DECL_NAME (decl
);
2246 /* Finish a translation unit. */
2249 finish_translation_unit (void)
2251 /* In case there were missing closebraces,
2252 get us back to the global binding level. */
2254 while (current_namespace
!= global_namespace
)
2257 /* Do file scope __FUNCTION__ et al. */
2258 finish_fname_decls ();
2261 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2262 Returns the parameter. */
2265 finish_template_type_parm (tree aggr
, tree identifier
)
2267 if (aggr
!= class_type_node
)
2269 permerror (input_location
, "template type parameters must use the keyword %<class%> or %<typename%>");
2270 aggr
= class_type_node
;
2273 return build_tree_list (aggr
, identifier
);
2276 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2277 Returns the parameter. */
2280 finish_template_template_parm (tree aggr
, tree identifier
)
2282 tree decl
= build_decl (input_location
,
2283 TYPE_DECL
, identifier
, NULL_TREE
);
2284 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2285 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2286 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2287 DECL_ARTIFICIAL (decl
) = 1;
2288 end_template_decl ();
2290 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2292 check_default_tmpl_args (decl
, DECL_TEMPLATE_PARMS (tmpl
),
2293 /*is_primary=*/true, /*is_partial=*/false,
2296 return finish_template_type_parm (aggr
, tmpl
);
2299 /* ARGUMENT is the default-argument value for a template template
2300 parameter. If ARGUMENT is invalid, issue error messages and return
2301 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2304 check_template_template_default_arg (tree argument
)
2306 if (TREE_CODE (argument
) != TEMPLATE_DECL
2307 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2308 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2310 if (TREE_CODE (argument
) == TYPE_DECL
)
2311 error ("invalid use of type %qT as a default value for a template "
2312 "template-parameter", TREE_TYPE (argument
));
2314 error ("invalid default argument for a template template parameter");
2315 return error_mark_node
;
2321 /* Begin a class definition, as indicated by T. */
2324 begin_class_definition (tree t
, tree attributes
)
2326 if (error_operand_p (t
) || error_operand_p (TYPE_MAIN_DECL (t
)))
2327 return error_mark_node
;
2329 if (processing_template_parmlist
)
2331 error ("definition of %q#T inside template parameter list", t
);
2332 return error_mark_node
;
2335 /* According to the C++ ABI, decimal classes defined in ISO/IEC TR 24733
2336 are passed the same as decimal scalar types. */
2337 if (TREE_CODE (t
) == RECORD_TYPE
2338 && !processing_template_decl
)
2340 tree ns
= TYPE_CONTEXT (t
);
2341 if (ns
&& TREE_CODE (ns
) == NAMESPACE_DECL
2342 && DECL_CONTEXT (ns
) == std_node
2344 && !strcmp (IDENTIFIER_POINTER (DECL_NAME (ns
)), "decimal"))
2346 const char *n
= TYPE_NAME_STRING (t
);
2347 if ((strcmp (n
, "decimal32") == 0)
2348 || (strcmp (n
, "decimal64") == 0)
2349 || (strcmp (n
, "decimal128") == 0))
2350 TYPE_TRANSPARENT_AGGR (t
) = 1;
2354 /* A non-implicit typename comes from code like:
2356 template <typename T> struct A {
2357 template <typename U> struct A<T>::B ...
2359 This is erroneous. */
2360 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2362 error ("invalid definition of qualified type %qT", t
);
2363 t
= error_mark_node
;
2366 if (t
== error_mark_node
|| ! MAYBE_CLASS_TYPE_P (t
))
2368 t
= make_class_type (RECORD_TYPE
);
2369 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
2372 if (TYPE_BEING_DEFINED (t
))
2374 t
= make_class_type (TREE_CODE (t
));
2375 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
2377 maybe_process_partial_specialization (t
);
2379 TYPE_BEING_DEFINED (t
) = 1;
2381 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
2383 if (flag_pack_struct
)
2386 TYPE_PACKED (t
) = 1;
2387 /* Even though the type is being defined for the first time
2388 here, there might have been a forward declaration, so there
2389 might be cv-qualified variants of T. */
2390 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
2391 TYPE_PACKED (v
) = 1;
2393 /* Reset the interface data, at the earliest possible
2394 moment, as it might have been set via a class foo;
2396 if (! TYPE_ANONYMOUS_P (t
))
2398 struct c_fileinfo
*finfo
= get_fileinfo (input_filename
);
2399 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
2400 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2401 (t
, finfo
->interface_unknown
);
2403 reset_specialization();
2405 /* Make a declaration for this class in its own scope. */
2406 build_self_reference ();
2411 /* Finish the member declaration given by DECL. */
2414 finish_member_declaration (tree decl
)
2416 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
2419 if (decl
== void_type_node
)
2420 /* The COMPONENT was a friend, not a member, and so there's
2421 nothing for us to do. */
2424 /* We should see only one DECL at a time. */
2425 gcc_assert (TREE_CHAIN (decl
) == NULL_TREE
);
2427 /* Set up access control for DECL. */
2429 = (current_access_specifier
== access_private_node
);
2430 TREE_PROTECTED (decl
)
2431 = (current_access_specifier
== access_protected_node
);
2432 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2434 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
2435 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
2438 /* Mark the DECL as a member of the current class. */
2439 DECL_CONTEXT (decl
) = current_class_type
;
2441 /* Check for bare parameter packs in the member variable declaration. */
2442 if (TREE_CODE (decl
) == FIELD_DECL
)
2444 if (check_for_bare_parameter_packs (TREE_TYPE (decl
)))
2445 TREE_TYPE (decl
) = error_mark_node
;
2446 if (check_for_bare_parameter_packs (DECL_ATTRIBUTES (decl
)))
2447 DECL_ATTRIBUTES (decl
) = NULL_TREE
;
2452 A C language linkage is ignored for the names of class members
2453 and the member function type of class member functions. */
2454 if (DECL_LANG_SPECIFIC (decl
) && DECL_LANGUAGE (decl
) == lang_c
)
2455 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
2457 /* Put functions on the TYPE_METHODS list and everything else on the
2458 TYPE_FIELDS list. Note that these are built up in reverse order.
2459 We reverse them (to obtain declaration order) in finish_struct. */
2460 if (TREE_CODE (decl
) == FUNCTION_DECL
2461 || DECL_FUNCTION_TEMPLATE_P (decl
))
2463 /* We also need to add this function to the
2464 CLASSTYPE_METHOD_VEC. */
2465 if (add_method (current_class_type
, decl
, NULL_TREE
))
2467 TREE_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
2468 TYPE_METHODS (current_class_type
) = decl
;
2470 maybe_add_class_template_decl_list (current_class_type
, decl
,
2474 /* Enter the DECL into the scope of the class. */
2475 else if ((TREE_CODE (decl
) == USING_DECL
&& !DECL_DEPENDENT_P (decl
))
2476 || pushdecl_class_level (decl
))
2478 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2479 go at the beginning. The reason is that lookup_field_1
2480 searches the list in order, and we want a field name to
2481 override a type name so that the "struct stat hack" will
2482 work. In particular:
2484 struct S { enum E { }; int E } s;
2487 is valid. In addition, the FIELD_DECLs must be maintained in
2488 declaration order so that class layout works as expected.
2489 However, we don't need that order until class layout, so we
2490 save a little time by putting FIELD_DECLs on in reverse order
2491 here, and then reversing them in finish_struct_1. (We could
2492 also keep a pointer to the correct insertion points in the
2495 if (TREE_CODE (decl
) == TYPE_DECL
)
2496 TYPE_FIELDS (current_class_type
)
2497 = chainon (TYPE_FIELDS (current_class_type
), decl
);
2500 TREE_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
2501 TYPE_FIELDS (current_class_type
) = decl
;
2504 maybe_add_class_template_decl_list (current_class_type
, decl
,
2509 note_decl_for_pch (decl
);
2512 /* DECL has been declared while we are building a PCH file. Perform
2513 actions that we might normally undertake lazily, but which can be
2514 performed now so that they do not have to be performed in
2515 translation units which include the PCH file. */
2518 note_decl_for_pch (tree decl
)
2520 gcc_assert (pch_file
);
2522 /* There's a good chance that we'll have to mangle names at some
2523 point, even if only for emission in debugging information. */
2524 if ((TREE_CODE (decl
) == VAR_DECL
2525 || TREE_CODE (decl
) == FUNCTION_DECL
)
2526 && !processing_template_decl
)
2530 /* Finish processing a complete template declaration. The PARMS are
2531 the template parameters. */
2534 finish_template_decl (tree parms
)
2537 end_template_decl ();
2539 end_specialization ();
2542 /* Finish processing a template-id (which names a type) of the form
2543 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2544 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2545 the scope of template-id indicated. */
2548 finish_template_type (tree name
, tree args
, int entering_scope
)
2552 decl
= lookup_template_class (name
, args
,
2553 NULL_TREE
, NULL_TREE
, entering_scope
,
2554 tf_warning_or_error
| tf_user
);
2555 if (decl
!= error_mark_node
)
2556 decl
= TYPE_STUB_DECL (decl
);
2561 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2562 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2563 BASE_CLASS, or NULL_TREE if an error occurred. The
2564 ACCESS_SPECIFIER is one of
2565 access_{default,public,protected_private}_node. For a virtual base
2566 we set TREE_TYPE. */
2569 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
2573 if (base
== error_mark_node
)
2575 error ("invalid base-class specification");
2578 else if (! MAYBE_CLASS_TYPE_P (base
))
2580 error ("%qT is not a class type", base
);
2585 if (cp_type_quals (base
) != 0)
2587 error ("base class %qT has cv qualifiers", base
);
2588 base
= TYPE_MAIN_VARIANT (base
);
2590 result
= build_tree_list (access
, base
);
2592 TREE_TYPE (result
) = integer_type_node
;
2598 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2599 what we found when we tried to do the lookup.
2600 LOCATION is the location of the NAME identifier;
2601 The location is used in the error message*/
2604 qualified_name_lookup_error (tree scope
, tree name
,
2605 tree decl
, location_t location
)
2607 if (scope
== error_mark_node
)
2608 ; /* We already complained. */
2609 else if (TYPE_P (scope
))
2611 if (!COMPLETE_TYPE_P (scope
))
2612 error_at (location
, "incomplete type %qT used in nested name specifier",
2614 else if (TREE_CODE (decl
) == TREE_LIST
)
2616 error_at (location
, "reference to %<%T::%D%> is ambiguous",
2618 print_candidates (decl
);
2621 error_at (location
, "%qD is not a member of %qT", name
, scope
);
2623 else if (scope
!= global_namespace
)
2624 error_at (location
, "%qD is not a member of %qD", name
, scope
);
2626 error_at (location
, "%<::%D%> has not been declared", name
);
2629 /* If FNS is a member function, a set of member functions, or a
2630 template-id referring to one or more member functions, return a
2631 BASELINK for FNS, incorporating the current access context.
2632 Otherwise, return FNS unchanged. */
2635 baselink_for_fns (tree fns
)
2640 if (BASELINK_P (fns
)
2641 || error_operand_p (fns
))
2645 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2646 fn
= TREE_OPERAND (fn
, 0);
2647 fn
= get_first_fn (fn
);
2648 if (!DECL_FUNCTION_MEMBER_P (fn
))
2651 cl
= currently_open_derived_class (DECL_CONTEXT (fn
));
2653 cl
= DECL_CONTEXT (fn
);
2654 cl
= TYPE_BINFO (cl
);
2655 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
2658 /* Returns true iff DECL is an automatic variable from a function outside
2662 outer_automatic_var_p (tree decl
)
2664 return ((TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
2665 && DECL_FUNCTION_SCOPE_P (decl
)
2666 && !TREE_STATIC (decl
)
2667 && DECL_CONTEXT (decl
) != current_function_decl
);
2670 /* Returns true iff DECL is a capture field from a lambda that is not our
2671 immediate context. */
2674 outer_lambda_capture_p (tree decl
)
2676 return (TREE_CODE (decl
) == FIELD_DECL
2677 && LAMBDA_TYPE_P (DECL_CONTEXT (decl
))
2678 && (!current_class_type
2679 || !DERIVED_FROM_P (DECL_CONTEXT (decl
), current_class_type
)));
2682 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2683 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2684 if non-NULL, is the type or namespace used to explicitly qualify
2685 ID_EXPRESSION. DECL is the entity to which that name has been
2688 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2689 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2690 be set to true if this expression isn't permitted in a
2691 constant-expression, but it is otherwise not set by this function.
2692 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2693 constant-expression, but a non-constant expression is also
2696 DONE is true if this expression is a complete postfix-expression;
2697 it is false if this expression is followed by '->', '[', '(', etc.
2698 ADDRESS_P is true iff this expression is the operand of '&'.
2699 TEMPLATE_P is true iff the qualified-id was of the form
2700 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2701 appears as a template argument.
2703 If an error occurs, and it is the kind of error that might cause
2704 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2705 is the caller's responsibility to issue the message. *ERROR_MSG
2706 will be a string with static storage duration, so the caller need
2709 Return an expression for the entity, after issuing appropriate
2710 diagnostics. This function is also responsible for transforming a
2711 reference to a non-static member into a COMPONENT_REF that makes
2712 the use of "this" explicit.
2714 Upon return, *IDK will be filled in appropriately. */
2716 finish_id_expression (tree id_expression
,
2720 bool integral_constant_expression_p
,
2721 bool allow_non_integral_constant_expression_p
,
2722 bool *non_integral_constant_expression_p
,
2726 bool template_arg_p
,
2727 const char **error_msg
,
2728 location_t location
)
2730 /* Initialize the output parameters. */
2731 *idk
= CP_ID_KIND_NONE
;
2734 if (id_expression
== error_mark_node
)
2735 return error_mark_node
;
2736 /* If we have a template-id, then no further lookup is
2737 required. If the template-id was for a template-class, we
2738 will sometimes have a TYPE_DECL at this point. */
2739 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2740 || TREE_CODE (decl
) == TYPE_DECL
)
2742 /* Look up the name. */
2745 if (decl
== error_mark_node
)
2747 /* Name lookup failed. */
2750 || (!dependent_type_p (scope
)
2751 && !(TREE_CODE (id_expression
) == IDENTIFIER_NODE
2752 && IDENTIFIER_TYPENAME_P (id_expression
)
2753 && dependent_type_p (TREE_TYPE (id_expression
))))))
2755 /* If the qualifying type is non-dependent (and the name
2756 does not name a conversion operator to a dependent
2757 type), issue an error. */
2758 qualified_name_lookup_error (scope
, id_expression
, decl
, location
);
2759 return error_mark_node
;
2763 /* It may be resolved via Koenig lookup. */
2764 *idk
= CP_ID_KIND_UNQUALIFIED
;
2765 return id_expression
;
2768 decl
= id_expression
;
2770 /* If DECL is a variable that would be out of scope under
2771 ANSI/ISO rules, but in scope in the ARM, name lookup
2772 will succeed. Issue a diagnostic here. */
2774 decl
= check_for_out_of_scope_variable (decl
);
2776 /* Remember that the name was used in the definition of
2777 the current class so that we can check later to see if
2778 the meaning would have been different after the class
2779 was entirely defined. */
2780 if (!scope
&& decl
!= error_mark_node
)
2781 maybe_note_name_used_in_class (id_expression
, decl
);
2783 /* Disallow uses of local variables from containing functions, except
2784 within lambda-expressions. */
2785 if ((outer_automatic_var_p (decl
)
2786 || outer_lambda_capture_p (decl
))
2787 /* It's not a use (3.2) if we're in an unevaluated context. */
2788 && !cp_unevaluated_operand
)
2790 tree context
= DECL_CONTEXT (decl
);
2791 tree containing_function
= current_function_decl
;
2792 tree lambda_stack
= NULL_TREE
;
2793 tree lambda_expr
= NULL_TREE
;
2794 tree initializer
= decl
;
2796 /* Core issue 696: "[At the July 2009 meeting] the CWG expressed
2797 support for an approach in which a reference to a local
2798 [constant] automatic variable in a nested class or lambda body
2799 would enter the expression as an rvalue, which would reduce
2800 the complexity of the problem"
2802 FIXME update for final resolution of core issue 696. */
2803 if (DECL_INTEGRAL_CONSTANT_VAR_P (decl
))
2804 return integral_constant_value (decl
);
2806 if (TYPE_P (context
))
2808 /* Implicit capture of an explicit capture. */
2809 context
= lambda_function (context
);
2810 initializer
= thisify_lambda_field (decl
);
2813 /* If we are in a lambda function, we can move out until we hit
2815 2. a non-lambda function, or
2816 3. a non-default capturing lambda function. */
2817 while (context
!= containing_function
2818 && LAMBDA_FUNCTION_P (containing_function
))
2820 lambda_expr
= CLASSTYPE_LAMBDA_EXPR
2821 (DECL_CONTEXT (containing_function
));
2823 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda_expr
)
2827 lambda_stack
= tree_cons (NULL_TREE
,
2832 = decl_function_context (containing_function
);
2835 if (context
== containing_function
)
2837 decl
= add_default_capture (lambda_stack
,
2838 /*id=*/DECL_NAME (decl
),
2841 else if (lambda_expr
)
2843 error ("%qD is not captured", decl
);
2844 return error_mark_node
;
2848 error (TREE_CODE (decl
) == VAR_DECL
2849 ? "use of %<auto%> variable from containing function"
2850 : "use of parameter from containing function");
2851 error (" %q+#D declared here", decl
);
2852 return error_mark_node
;
2857 /* If we didn't find anything, or what we found was a type,
2858 then this wasn't really an id-expression. */
2859 if (TREE_CODE (decl
) == TEMPLATE_DECL
2860 && !DECL_FUNCTION_TEMPLATE_P (decl
))
2862 *error_msg
= "missing template arguments";
2863 return error_mark_node
;
2865 else if (TREE_CODE (decl
) == TYPE_DECL
2866 || TREE_CODE (decl
) == NAMESPACE_DECL
)
2868 *error_msg
= "expected primary-expression";
2869 return error_mark_node
;
2872 /* If the name resolved to a template parameter, there is no
2873 need to look it up again later. */
2874 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
2875 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
2879 *idk
= CP_ID_KIND_NONE
;
2880 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
2881 decl
= TEMPLATE_PARM_DECL (decl
);
2882 r
= convert_from_reference (DECL_INITIAL (decl
));
2884 if (integral_constant_expression_p
2885 && !dependent_type_p (TREE_TYPE (decl
))
2886 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
2888 if (!allow_non_integral_constant_expression_p
)
2889 error ("template parameter %qD of type %qT is not allowed in "
2890 "an integral constant expression because it is not of "
2891 "integral or enumeration type", decl
, TREE_TYPE (decl
));
2892 *non_integral_constant_expression_p
= true;
2896 /* Similarly, we resolve enumeration constants to their
2897 underlying values. */
2898 else if (TREE_CODE (decl
) == CONST_DECL
)
2900 *idk
= CP_ID_KIND_NONE
;
2901 if (!processing_template_decl
)
2903 used_types_insert (TREE_TYPE (decl
));
2904 return DECL_INITIAL (decl
);
2912 /* If the declaration was explicitly qualified indicate
2913 that. The semantics of `A::f(3)' are different than
2914 `f(3)' if `f' is virtual. */
2916 ? CP_ID_KIND_QUALIFIED
2917 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2918 ? CP_ID_KIND_TEMPLATE_ID
2919 : CP_ID_KIND_UNQUALIFIED
));
2924 An id-expression is type-dependent if it contains an
2925 identifier that was declared with a dependent type.
2927 The standard is not very specific about an id-expression that
2928 names a set of overloaded functions. What if some of them
2929 have dependent types and some of them do not? Presumably,
2930 such a name should be treated as a dependent name. */
2931 /* Assume the name is not dependent. */
2932 dependent_p
= false;
2933 if (!processing_template_decl
)
2934 /* No names are dependent outside a template. */
2936 /* A template-id where the name of the template was not resolved
2937 is definitely dependent. */
2938 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2939 && (TREE_CODE (TREE_OPERAND (decl
, 0))
2940 == IDENTIFIER_NODE
))
2942 /* For anything except an overloaded function, just check its
2944 else if (!is_overloaded_fn (decl
))
2946 = dependent_type_p (TREE_TYPE (decl
));
2947 /* For a set of overloaded functions, check each of the
2953 if (BASELINK_P (fns
))
2954 fns
= BASELINK_FUNCTIONS (fns
);
2956 /* For a template-id, check to see if the template
2957 arguments are dependent. */
2958 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
2960 tree args
= TREE_OPERAND (fns
, 1);
2961 dependent_p
= any_dependent_template_arguments_p (args
);
2962 /* The functions are those referred to by the
2964 fns
= TREE_OPERAND (fns
, 0);
2967 /* If there are no dependent template arguments, go through
2968 the overloaded functions. */
2969 while (fns
&& !dependent_p
)
2971 tree fn
= OVL_CURRENT (fns
);
2973 /* Member functions of dependent classes are
2975 if (TREE_CODE (fn
) == FUNCTION_DECL
2976 && type_dependent_expression_p (fn
))
2978 else if (TREE_CODE (fn
) == TEMPLATE_DECL
2979 && dependent_template_p (fn
))
2982 fns
= OVL_NEXT (fns
);
2986 /* If the name was dependent on a template parameter, we will
2987 resolve the name at instantiation time. */
2990 /* Create a SCOPE_REF for qualified names, if the scope is
2996 if (address_p
&& done
)
2997 decl
= finish_qualified_id_expr (scope
, decl
,
3003 tree type
= NULL_TREE
;
3004 if (DECL_P (decl
) && !dependent_scope_p (scope
))
3005 type
= TREE_TYPE (decl
);
3006 decl
= build_qualified_name (type
,
3012 if (TREE_TYPE (decl
))
3013 decl
= convert_from_reference (decl
);
3016 /* A TEMPLATE_ID already contains all the information we
3018 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
)
3019 return id_expression
;
3020 *idk
= CP_ID_KIND_UNQUALIFIED_DEPENDENT
;
3021 /* If we found a variable, then name lookup during the
3022 instantiation will always resolve to the same VAR_DECL
3023 (or an instantiation thereof). */
3024 if (TREE_CODE (decl
) == VAR_DECL
3025 || TREE_CODE (decl
) == PARM_DECL
)
3026 return convert_from_reference (decl
);
3027 /* The same is true for FIELD_DECL, but we also need to
3028 make sure that the syntax is correct. */
3029 else if (TREE_CODE (decl
) == FIELD_DECL
)
3031 /* Since SCOPE is NULL here, this is an unqualified name.
3032 Access checking has been performed during name lookup
3033 already. Turn off checking to avoid duplicate errors. */
3034 push_deferring_access_checks (dk_no_check
);
3035 decl
= finish_non_static_data_member
3037 /*qualifying_scope=*/NULL_TREE
);
3038 pop_deferring_access_checks ();
3041 return id_expression
;
3044 /* Only certain kinds of names are allowed in constant
3045 expression. Enumerators and template parameters have already
3046 been handled above. */
3047 if (integral_constant_expression_p
3048 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl
)
3049 && ! builtin_valid_in_constant_expr_p (decl
))
3051 if (!allow_non_integral_constant_expression_p
)
3053 error ("%qD cannot appear in a constant-expression", decl
);
3054 return error_mark_node
;
3056 *non_integral_constant_expression_p
= true;
3059 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
3061 error ("use of namespace %qD as expression", decl
);
3062 return error_mark_node
;
3064 else if (DECL_CLASS_TEMPLATE_P (decl
))
3066 error ("use of class template %qT as expression", decl
);
3067 return error_mark_node
;
3069 else if (TREE_CODE (decl
) == TREE_LIST
)
3071 /* Ambiguous reference to base members. */
3072 error ("request for member %qD is ambiguous in "
3073 "multiple inheritance lattice", id_expression
);
3074 print_candidates (decl
);
3075 return error_mark_node
;
3078 /* Mark variable-like entities as used. Functions are similarly
3079 marked either below or after overload resolution. */
3080 if (TREE_CODE (decl
) == VAR_DECL
3081 || TREE_CODE (decl
) == PARM_DECL
3082 || TREE_CODE (decl
) == RESULT_DECL
)
3087 decl
= (adjust_result_of_qualified_name_lookup
3088 (decl
, scope
, current_class_type
));
3090 if (TREE_CODE (decl
) == FUNCTION_DECL
)
3093 if (TREE_CODE (decl
) == FIELD_DECL
|| BASELINK_P (decl
))
3094 decl
= finish_qualified_id_expr (scope
,
3102 tree r
= convert_from_reference (decl
);
3104 if (processing_template_decl
&& TYPE_P (scope
))
3105 r
= build_qualified_name (TREE_TYPE (r
),
3111 else if (TREE_CODE (decl
) == FIELD_DECL
)
3113 /* Since SCOPE is NULL here, this is an unqualified name.
3114 Access checking has been performed during name lookup
3115 already. Turn off checking to avoid duplicate errors. */
3116 push_deferring_access_checks (dk_no_check
);
3117 decl
= finish_non_static_data_member (decl
, NULL_TREE
,
3118 /*qualifying_scope=*/NULL_TREE
);
3119 pop_deferring_access_checks ();
3121 else if (is_overloaded_fn (decl
))
3125 first_fn
= get_first_fn (decl
);
3126 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
3127 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
3129 if (!really_overloaded_fn (decl
))
3130 mark_used (first_fn
);
3133 && TREE_CODE (first_fn
) == FUNCTION_DECL
3134 && DECL_FUNCTION_MEMBER_P (first_fn
)
3135 && !shared_member_p (decl
))
3137 /* A set of member functions. */
3138 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
3139 return finish_class_member_access_expr (decl
, id_expression
,
3140 /*template_p=*/false,
3141 tf_warning_or_error
);
3144 decl
= baselink_for_fns (decl
);
3148 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
3149 && DECL_CLASS_SCOPE_P (decl
))
3151 tree context
= context_for_name_lookup (decl
);
3152 if (context
!= current_class_type
)
3154 tree path
= currently_open_derived_class (context
);
3155 perform_or_defer_access_check (TYPE_BINFO (path
),
3160 decl
= convert_from_reference (decl
);
3164 if (TREE_DEPRECATED (decl
))
3165 warn_deprecated_use (decl
, NULL_TREE
);
3170 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
3171 use as a type-specifier. */
3174 finish_typeof (tree expr
)
3178 if (type_dependent_expression_p (expr
))
3180 type
= cxx_make_type (TYPEOF_TYPE
);
3181 TYPEOF_TYPE_EXPR (type
) = expr
;
3182 SET_TYPE_STRUCTURAL_EQUALITY (type
);
3187 expr
= mark_type_use (expr
);
3189 type
= unlowered_expr_type (expr
);
3191 if (!type
|| type
== unknown_type_node
)
3193 error ("type of %qE is unknown", expr
);
3194 return error_mark_node
;
3200 /* Perform C++-specific checks for __builtin_offsetof before calling
3204 finish_offsetof (tree expr
)
3206 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
3208 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3209 TREE_OPERAND (expr
, 2));
3210 return error_mark_node
;
3212 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
3213 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
3214 || TREE_TYPE (expr
) == unknown_type_node
)
3216 if (TREE_CODE (expr
) == COMPONENT_REF
3217 || TREE_CODE (expr
) == COMPOUND_EXPR
)
3218 expr
= TREE_OPERAND (expr
, 1);
3219 error ("cannot apply %<offsetof%> to member function %qD", expr
);
3220 return error_mark_node
;
3222 if (TREE_CODE (expr
) == INDIRECT_REF
&& REFERENCE_REF_P (expr
))
3223 expr
= TREE_OPERAND (expr
, 0);
3224 return fold_offsetof (expr
, NULL_TREE
);
3227 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3228 function is broken out from the above for the benefit of the tree-ssa
3232 simplify_aggr_init_expr (tree
*tp
)
3234 tree aggr_init_expr
= *tp
;
3236 /* Form an appropriate CALL_EXPR. */
3237 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
3238 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
3239 tree type
= TREE_TYPE (slot
);
3242 enum style_t
{ ctor
, arg
, pcc
} style
;
3244 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
3246 #ifdef PCC_STATIC_STRUCT_RETURN
3252 gcc_assert (TREE_ADDRESSABLE (type
));
3256 call_expr
= build_call_array_loc (input_location
,
3257 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
3259 aggr_init_expr_nargs (aggr_init_expr
),
3260 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
3264 /* Replace the first argument to the ctor with the address of the
3266 cxx_mark_addressable (slot
);
3267 CALL_EXPR_ARG (call_expr
, 0) =
3268 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
3270 else if (style
== arg
)
3272 /* Just mark it addressable here, and leave the rest to
3273 expand_call{,_inline}. */
3274 cxx_mark_addressable (slot
);
3275 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
3276 call_expr
= build2 (INIT_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
3278 else if (style
== pcc
)
3280 /* If we're using the non-reentrant PCC calling convention, then we
3281 need to copy the returned value out of the static buffer into the
3283 push_deferring_access_checks (dk_no_check
);
3284 call_expr
= build_aggr_init (slot
, call_expr
,
3285 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
,
3286 tf_warning_or_error
);
3287 pop_deferring_access_checks ();
3288 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
3291 if (AGGR_INIT_ZERO_FIRST (aggr_init_expr
))
3293 tree init
= build_zero_init (type
, NULL_TREE
,
3294 /*static_storage_p=*/false);
3295 init
= build2 (INIT_EXPR
, void_type_node
, slot
, init
);
3296 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (call_expr
),
3303 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3306 emit_associated_thunks (tree fn
)
3308 /* When we use vcall offsets, we emit thunks with the virtual
3309 functions to which they thunk. The whole point of vcall offsets
3310 is so that you can know statically the entire set of thunks that
3311 will ever be needed for a given virtual function, thereby
3312 enabling you to output all the thunks with the function itself. */
3313 if (DECL_VIRTUAL_P (fn
)
3314 /* Do not emit thunks for extern template instantiations. */
3315 && ! DECL_REALLY_EXTERN (fn
))
3319 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= TREE_CHAIN (thunk
))
3321 if (!THUNK_ALIAS (thunk
))
3323 use_thunk (thunk
, /*emit_p=*/1);
3324 if (DECL_RESULT_THUNK_P (thunk
))
3328 for (probe
= DECL_THUNKS (thunk
);
3329 probe
; probe
= TREE_CHAIN (probe
))
3330 use_thunk (probe
, /*emit_p=*/1);
3334 gcc_assert (!DECL_THUNKS (thunk
));
3339 /* Generate RTL for FN. */
3342 expand_or_defer_fn_1 (tree fn
)
3344 /* When the parser calls us after finishing the body of a template
3345 function, we don't really want to expand the body. */
3346 if (processing_template_decl
)
3348 /* Normally, collection only occurs in rest_of_compilation. So,
3349 if we don't collect here, we never collect junk generated
3350 during the processing of templates until we hit a
3351 non-template function. It's not safe to do this inside a
3352 nested class, though, as the parser may have local state that
3353 is not a GC root. */
3354 if (!function_depth
)
3359 gcc_assert (DECL_SAVED_TREE (fn
));
3361 /* If this is a constructor or destructor body, we have to clone
3363 if (maybe_clone_body (fn
))
3365 /* We don't want to process FN again, so pretend we've written
3366 it out, even though we haven't. */
3367 TREE_ASM_WRITTEN (fn
) = 1;
3368 DECL_SAVED_TREE (fn
) = NULL_TREE
;
3372 /* We make a decision about linkage for these functions at the end
3373 of the compilation. Until that point, we do not want the back
3374 end to output them -- but we do want it to see the bodies of
3375 these functions so that it can inline them as appropriate. */
3376 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
3378 if (DECL_INTERFACE_KNOWN (fn
))
3379 /* We've already made a decision as to how this function will
3383 DECL_EXTERNAL (fn
) = 1;
3384 DECL_NOT_REALLY_EXTERN (fn
) = 1;
3385 note_vague_linkage_fn (fn
);
3386 /* A non-template inline function with external linkage will
3387 always be COMDAT. As we must eventually determine the
3388 linkage of all functions, and as that causes writes to
3389 the data mapped in from the PCH file, it's advantageous
3390 to mark the functions at this point. */
3391 if (!DECL_IMPLICIT_INSTANTIATION (fn
))
3393 /* This function must have external linkage, as
3394 otherwise DECL_INTERFACE_KNOWN would have been
3396 gcc_assert (TREE_PUBLIC (fn
));
3397 comdat_linkage (fn
);
3398 DECL_INTERFACE_KNOWN (fn
) = 1;
3402 import_export_decl (fn
);
3404 /* If the user wants us to keep all inline functions, then mark
3405 this function as needed so that finish_file will make sure to
3406 output it later. Similarly, all dllexport'd functions must
3407 be emitted; there may be callers in other DLLs. */
3408 if ((flag_keep_inline_functions
3409 && DECL_DECLARED_INLINE_P (fn
)
3410 && !DECL_REALLY_EXTERN (fn
))
3411 || lookup_attribute ("dllexport", DECL_ATTRIBUTES (fn
)))
3415 /* There's no reason to do any of the work here if we're only doing
3416 semantic analysis; this code just generates RTL. */
3417 if (flag_syntax_only
)
3424 expand_or_defer_fn (tree fn
)
3426 if (expand_or_defer_fn_1 (fn
))
3430 /* Expand or defer, at the whim of the compilation unit manager. */
3431 cgraph_finalize_function (fn
, function_depth
> 1);
3432 emit_associated_thunks (fn
);
3445 /* Helper function for walk_tree, used by finalize_nrv below. */
3448 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
3450 struct nrv_data
*dp
= (struct nrv_data
*)data
;
3453 /* No need to walk into types. There wouldn't be any need to walk into
3454 non-statements, except that we have to consider STMT_EXPRs. */
3457 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3458 but differs from using NULL_TREE in that it indicates that we care
3459 about the value of the RESULT_DECL. */
3460 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
3461 TREE_OPERAND (*tp
, 0) = dp
->result
;
3462 /* Change all cleanups for the NRV to only run when an exception is
3464 else if (TREE_CODE (*tp
) == CLEANUP_STMT
3465 && CLEANUP_DECL (*tp
) == dp
->var
)
3466 CLEANUP_EH_ONLY (*tp
) = 1;
3467 /* Replace the DECL_EXPR for the NRV with an initialization of the
3468 RESULT_DECL, if needed. */
3469 else if (TREE_CODE (*tp
) == DECL_EXPR
3470 && DECL_EXPR_DECL (*tp
) == dp
->var
)
3473 if (DECL_INITIAL (dp
->var
)
3474 && DECL_INITIAL (dp
->var
) != error_mark_node
)
3475 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
3476 DECL_INITIAL (dp
->var
));
3478 init
= build_empty_stmt (EXPR_LOCATION (*tp
));
3479 DECL_INITIAL (dp
->var
) = NULL_TREE
;
3480 SET_EXPR_LOCATION (init
, EXPR_LOCATION (*tp
));
3483 /* And replace all uses of the NRV with the RESULT_DECL. */
3484 else if (*tp
== dp
->var
)
3487 /* Avoid walking into the same tree more than once. Unfortunately, we
3488 can't just use walk_tree_without duplicates because it would only call
3489 us for the first occurrence of dp->var in the function body. */
3490 slot
= htab_find_slot (dp
->visited
, *tp
, INSERT
);
3496 /* Keep iterating. */
3500 /* Called from finish_function to implement the named return value
3501 optimization by overriding all the RETURN_EXPRs and pertinent
3502 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3503 RESULT_DECL for the function. */
3506 finalize_nrv (tree
*tp
, tree var
, tree result
)
3508 struct nrv_data data
;
3510 /* Copy debugging information from VAR to RESULT. */
3511 DECL_NAME (result
) = DECL_NAME (var
);
3512 DECL_ARTIFICIAL (result
) = DECL_ARTIFICIAL (var
);
3513 DECL_IGNORED_P (result
) = DECL_IGNORED_P (var
);
3514 DECL_SOURCE_LOCATION (result
) = DECL_SOURCE_LOCATION (var
);
3515 DECL_ABSTRACT_ORIGIN (result
) = DECL_ABSTRACT_ORIGIN (var
);
3516 /* Don't forget that we take its address. */
3517 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
3520 data
.result
= result
;
3521 data
.visited
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
3522 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
3523 htab_delete (data
.visited
);
3526 /* Return the declaration for the function called by CALL_EXPR T,
3527 TYPE is the class type of the clause decl. */
3530 omp_clause_info_fndecl (tree t
, tree type
)
3532 tree ret
= get_callee_fndecl (t
);
3537 gcc_assert (TREE_CODE (t
) == CALL_EXPR
);
3538 t
= CALL_EXPR_FN (t
);
3540 if (TREE_CODE (t
) == OBJ_TYPE_REF
)
3542 t
= cp_fold_obj_type_ref (t
, type
);
3543 if (TREE_CODE (t
) == ADDR_EXPR
3544 && TREE_CODE (TREE_OPERAND (t
, 0)) == FUNCTION_DECL
)
3545 return TREE_OPERAND (t
, 0);
3551 /* Create CP_OMP_CLAUSE_INFO for clause C. Returns true if it is invalid. */
3554 cxx_omp_create_clause_info (tree c
, tree type
, bool need_default_ctor
,
3555 bool need_copy_ctor
, bool need_copy_assignment
)
3557 int save_errorcount
= errorcount
;
3560 /* Always allocate 3 elements for simplicity. These are the
3561 function decls for the ctor, dtor, and assignment op.
3562 This layout is known to the three lang hooks,
3563 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3564 and cxx_omp_clause_assign_op. */
3565 info
= make_tree_vec (3);
3566 CP_OMP_CLAUSE_INFO (c
) = info
;
3568 if (need_default_ctor
3569 || (need_copy_ctor
&& !TYPE_HAS_TRIVIAL_INIT_REF (type
)))
3573 if (need_default_ctor
)
3577 t
= build_int_cst (build_pointer_type (type
), 0);
3578 t
= build1 (INDIRECT_REF
, type
, t
);
3579 vec
= make_tree_vector_single (t
);
3581 t
= build_special_member_call (NULL_TREE
, complete_ctor_identifier
,
3582 &vec
, type
, LOOKUP_NORMAL
,
3583 tf_warning_or_error
);
3586 release_tree_vector (vec
);
3588 if (targetm
.cxx
.cdtor_returns_this () || errorcount
)
3589 /* Because constructors and destructors return this,
3590 the call will have been cast to "void". Remove the
3591 cast here. We would like to use STRIP_NOPS, but it
3592 wouldn't work here because TYPE_MODE (t) and
3593 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3594 They are VOIDmode and Pmode, respectively. */
3595 if (TREE_CODE (t
) == NOP_EXPR
)
3596 t
= TREE_OPERAND (t
, 0);
3598 TREE_VEC_ELT (info
, 0) = get_callee_fndecl (t
);
3601 if ((need_default_ctor
|| need_copy_ctor
)
3602 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (type
))
3604 t
= build_int_cst (build_pointer_type (type
), 0);
3605 t
= build1 (INDIRECT_REF
, type
, t
);
3606 t
= build_special_member_call (t
, complete_dtor_identifier
,
3607 NULL
, type
, LOOKUP_NORMAL
,
3608 tf_warning_or_error
);
3610 if (targetm
.cxx
.cdtor_returns_this () || errorcount
)
3611 /* Because constructors and destructors return this,
3612 the call will have been cast to "void". Remove the
3613 cast here. We would like to use STRIP_NOPS, but it
3614 wouldn't work here because TYPE_MODE (t) and
3615 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3616 They are VOIDmode and Pmode, respectively. */
3617 if (TREE_CODE (t
) == NOP_EXPR
)
3618 t
= TREE_OPERAND (t
, 0);
3620 TREE_VEC_ELT (info
, 1) = omp_clause_info_fndecl (t
, type
);
3623 if (need_copy_assignment
&& !TYPE_HAS_TRIVIAL_ASSIGN_REF (type
))
3627 t
= build_int_cst (build_pointer_type (type
), 0);
3628 t
= build1 (INDIRECT_REF
, type
, t
);
3629 vec
= make_tree_vector_single (t
);
3630 t
= build_special_member_call (t
, ansi_assopname (NOP_EXPR
),
3631 &vec
, type
, LOOKUP_NORMAL
,
3632 tf_warning_or_error
);
3633 release_tree_vector (vec
);
3635 /* We'll have called convert_from_reference on the call, which
3636 may well have added an indirect_ref. It's unneeded here,
3637 and in the way, so kill it. */
3638 if (TREE_CODE (t
) == INDIRECT_REF
)
3639 t
= TREE_OPERAND (t
, 0);
3641 TREE_VEC_ELT (info
, 2) = omp_clause_info_fndecl (t
, type
);
3644 return errorcount
!= save_errorcount
;
3647 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3648 Remove any elements from the list that are invalid. */
3651 finish_omp_clauses (tree clauses
)
3653 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
3654 tree c
, t
, *pc
= &clauses
;
3657 bitmap_obstack_initialize (NULL
);
3658 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
3659 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
3660 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
3662 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3664 bool remove
= false;
3666 switch (OMP_CLAUSE_CODE (c
))
3668 case OMP_CLAUSE_SHARED
:
3670 goto check_dup_generic
;
3671 case OMP_CLAUSE_PRIVATE
:
3673 goto check_dup_generic
;
3674 case OMP_CLAUSE_REDUCTION
:
3676 goto check_dup_generic
;
3677 case OMP_CLAUSE_COPYPRIVATE
:
3678 name
= "copyprivate";
3679 goto check_dup_generic
;
3680 case OMP_CLAUSE_COPYIN
:
3682 goto check_dup_generic
;
3684 t
= OMP_CLAUSE_DECL (c
);
3685 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3687 if (processing_template_decl
)
3690 error ("%qD is not a variable in clause %qs", t
, name
);
3692 error ("%qE is not a variable in clause %qs", t
, name
);
3695 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3696 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
3697 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
3699 error ("%qD appears more than once in data clauses", t
);
3703 bitmap_set_bit (&generic_head
, DECL_UID (t
));
3706 case OMP_CLAUSE_FIRSTPRIVATE
:
3707 t
= OMP_CLAUSE_DECL (c
);
3708 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3710 if (processing_template_decl
)
3713 error ("%qD is not a variable in clause %<firstprivate%>", t
);
3715 error ("%qE is not a variable in clause %<firstprivate%>", t
);
3718 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3719 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
3721 error ("%qD appears more than once in data clauses", t
);
3725 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
3728 case OMP_CLAUSE_LASTPRIVATE
:
3729 t
= OMP_CLAUSE_DECL (c
);
3730 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3732 if (processing_template_decl
)
3735 error ("%qD is not a variable in clause %<lastprivate%>", t
);
3737 error ("%qE is not a variable in clause %<lastprivate%>", t
);
3740 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3741 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
3743 error ("%qD appears more than once in data clauses", t
);
3747 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
3751 t
= OMP_CLAUSE_IF_EXPR (c
);
3752 t
= maybe_convert_cond (t
);
3753 if (t
== error_mark_node
)
3755 OMP_CLAUSE_IF_EXPR (c
) = t
;
3758 case OMP_CLAUSE_NUM_THREADS
:
3759 t
= OMP_CLAUSE_NUM_THREADS_EXPR (c
);
3760 if (t
== error_mark_node
)
3762 else if (!type_dependent_expression_p (t
)
3763 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
3765 error ("num_threads expression must be integral");
3770 case OMP_CLAUSE_SCHEDULE
:
3771 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
3774 else if (t
== error_mark_node
)
3776 else if (!type_dependent_expression_p (t
)
3777 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
3779 error ("schedule chunk size expression must be integral");
3784 case OMP_CLAUSE_NOWAIT
:
3785 case OMP_CLAUSE_ORDERED
:
3786 case OMP_CLAUSE_DEFAULT
:
3787 case OMP_CLAUSE_UNTIED
:
3788 case OMP_CLAUSE_COLLAPSE
:
3796 *pc
= OMP_CLAUSE_CHAIN (c
);
3798 pc
= &OMP_CLAUSE_CHAIN (c
);
3801 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3803 enum omp_clause_code c_kind
= OMP_CLAUSE_CODE (c
);
3804 bool remove
= false;
3805 bool need_complete_non_reference
= false;
3806 bool need_default_ctor
= false;
3807 bool need_copy_ctor
= false;
3808 bool need_copy_assignment
= false;
3809 bool need_implicitly_determined
= false;
3810 tree type
, inner_type
;
3814 case OMP_CLAUSE_SHARED
:
3816 need_implicitly_determined
= true;
3818 case OMP_CLAUSE_PRIVATE
:
3820 need_complete_non_reference
= true;
3821 need_default_ctor
= true;
3822 need_implicitly_determined
= true;
3824 case OMP_CLAUSE_FIRSTPRIVATE
:
3825 name
= "firstprivate";
3826 need_complete_non_reference
= true;
3827 need_copy_ctor
= true;
3828 need_implicitly_determined
= true;
3830 case OMP_CLAUSE_LASTPRIVATE
:
3831 name
= "lastprivate";
3832 need_complete_non_reference
= true;
3833 need_copy_assignment
= true;
3834 need_implicitly_determined
= true;
3836 case OMP_CLAUSE_REDUCTION
:
3838 need_implicitly_determined
= true;
3840 case OMP_CLAUSE_COPYPRIVATE
:
3841 name
= "copyprivate";
3842 need_copy_assignment
= true;
3844 case OMP_CLAUSE_COPYIN
:
3846 need_copy_assignment
= true;
3849 pc
= &OMP_CLAUSE_CHAIN (c
);
3853 t
= OMP_CLAUSE_DECL (c
);
3854 if (processing_template_decl
3855 && TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3857 pc
= &OMP_CLAUSE_CHAIN (c
);
3863 case OMP_CLAUSE_LASTPRIVATE
:
3864 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
3865 need_default_ctor
= true;
3868 case OMP_CLAUSE_REDUCTION
:
3869 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
3870 || POINTER_TYPE_P (TREE_TYPE (t
)))
3872 error ("%qE has invalid type for %<reduction%>", t
);
3875 else if (FLOAT_TYPE_P (TREE_TYPE (t
)))
3877 enum tree_code r_code
= OMP_CLAUSE_REDUCTION_CODE (c
);
3885 error ("%qE has invalid type for %<reduction(%s)%>",
3886 t
, operator_name_info
[r_code
].name
);
3892 case OMP_CLAUSE_COPYIN
:
3893 if (TREE_CODE (t
) != VAR_DECL
|| !DECL_THREAD_LOCAL_P (t
))
3895 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
3904 if (need_complete_non_reference
)
3906 t
= require_complete_type (t
);
3907 if (t
== error_mark_node
)
3909 else if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
3911 error ("%qE has reference type for %qs", t
, name
);
3915 if (need_implicitly_determined
)
3917 const char *share_name
= NULL
;
3919 if (TREE_CODE (t
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (t
))
3920 share_name
= "threadprivate";
3921 else switch (cxx_omp_predetermined_sharing (t
))
3923 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
3925 case OMP_CLAUSE_DEFAULT_SHARED
:
3926 share_name
= "shared";
3928 case OMP_CLAUSE_DEFAULT_PRIVATE
:
3929 share_name
= "private";
3936 error ("%qE is predetermined %qs for %qs",
3937 t
, share_name
, name
);
3942 /* We're interested in the base element, not arrays. */
3943 inner_type
= type
= TREE_TYPE (t
);
3944 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
3945 inner_type
= TREE_TYPE (inner_type
);
3947 /* Check for special function availability by building a call to one.
3948 Save the results, because later we won't be in the right context
3949 for making these queries. */
3950 if (CLASS_TYPE_P (inner_type
)
3951 && (need_default_ctor
|| need_copy_ctor
|| need_copy_assignment
)
3952 && !type_dependent_expression_p (t
)
3953 && cxx_omp_create_clause_info (c
, inner_type
, need_default_ctor
,
3954 need_copy_ctor
, need_copy_assignment
))
3958 *pc
= OMP_CLAUSE_CHAIN (c
);
3960 pc
= &OMP_CLAUSE_CHAIN (c
);
3963 bitmap_obstack_release (NULL
);
3967 /* For all variables in the tree_list VARS, mark them as thread local. */
3970 finish_omp_threadprivate (tree vars
)
3974 /* Mark every variable in VARS to be assigned thread local storage. */
3975 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
3977 tree v
= TREE_PURPOSE (t
);
3979 if (error_operand_p (v
))
3981 else if (TREE_CODE (v
) != VAR_DECL
)
3982 error ("%<threadprivate%> %qD is not file, namespace "
3983 "or block scope variable", v
);
3984 /* If V had already been marked threadprivate, it doesn't matter
3985 whether it had been used prior to this point. */
3986 else if (TREE_USED (v
)
3987 && (DECL_LANG_SPECIFIC (v
) == NULL
3988 || !CP_DECL_THREADPRIVATE_P (v
)))
3989 error ("%qE declared %<threadprivate%> after first use", v
);
3990 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
3991 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
3992 else if (! COMPLETE_TYPE_P (TREE_TYPE (v
)))
3993 error ("%<threadprivate%> %qE has incomplete type", v
);
3994 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
))
3995 && CP_DECL_CONTEXT (v
) != current_class_type
)
3996 error ("%<threadprivate%> %qE directive not "
3997 "in %qT definition", v
, CP_DECL_CONTEXT (v
));
4000 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
4001 if (DECL_LANG_SPECIFIC (v
) == NULL
)
4003 retrofit_lang_decl (v
);
4005 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
4006 after the allocation of the lang_decl structure. */
4007 if (DECL_DISCRIMINATOR_P (v
))
4008 DECL_LANG_SPECIFIC (v
)->u
.base
.u2sel
= 1;
4011 if (! DECL_THREAD_LOCAL_P (v
))
4013 DECL_TLS_MODEL (v
) = decl_default_tls_model (v
);
4014 /* If rtl has been already set for this var, call
4015 make_decl_rtl once again, so that encode_section_info
4016 has a chance to look at the new decl flags. */
4017 if (DECL_RTL_SET_P (v
))
4020 CP_DECL_THREADPRIVATE_P (v
) = 1;
4025 /* Build an OpenMP structured block. */
4028 begin_omp_structured_block (void)
4030 return do_pushlevel (sk_omp
);
4034 finish_omp_structured_block (tree block
)
4036 return do_poplevel (block
);
4039 /* Similarly, except force the retention of the BLOCK. */
4042 begin_omp_parallel (void)
4044 keep_next_level (true);
4045 return begin_omp_structured_block ();
4049 finish_omp_parallel (tree clauses
, tree body
)
4053 body
= finish_omp_structured_block (body
);
4055 stmt
= make_node (OMP_PARALLEL
);
4056 TREE_TYPE (stmt
) = void_type_node
;
4057 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
4058 OMP_PARALLEL_BODY (stmt
) = body
;
4060 return add_stmt (stmt
);
4064 begin_omp_task (void)
4066 keep_next_level (true);
4067 return begin_omp_structured_block ();
4071 finish_omp_task (tree clauses
, tree body
)
4075 body
= finish_omp_structured_block (body
);
4077 stmt
= make_node (OMP_TASK
);
4078 TREE_TYPE (stmt
) = void_type_node
;
4079 OMP_TASK_CLAUSES (stmt
) = clauses
;
4080 OMP_TASK_BODY (stmt
) = body
;
4082 return add_stmt (stmt
);
4085 /* Helper function for finish_omp_for. Convert Ith random access iterator
4086 into integral iterator. Return FALSE if successful. */
4089 handle_omp_for_class_iterator (int i
, location_t locus
, tree declv
, tree initv
,
4090 tree condv
, tree incrv
, tree
*body
,
4091 tree
*pre_body
, tree clauses
)
4093 tree diff
, iter_init
, iter_incr
= NULL
, last
;
4094 tree incr_var
= NULL
, orig_pre_body
, orig_body
, c
;
4095 tree decl
= TREE_VEC_ELT (declv
, i
);
4096 tree init
= TREE_VEC_ELT (initv
, i
);
4097 tree cond
= TREE_VEC_ELT (condv
, i
);
4098 tree incr
= TREE_VEC_ELT (incrv
, i
);
4100 location_t elocus
= locus
;
4102 if (init
&& EXPR_HAS_LOCATION (init
))
4103 elocus
= EXPR_LOCATION (init
);
4105 switch (TREE_CODE (cond
))
4111 if (TREE_OPERAND (cond
, 1) == iter
)
4112 cond
= build2 (swap_tree_comparison (TREE_CODE (cond
)),
4113 TREE_TYPE (cond
), iter
, TREE_OPERAND (cond
, 0));
4114 if (TREE_OPERAND (cond
, 0) != iter
)
4115 cond
= error_mark_node
;
4118 tree tem
= build_x_binary_op (TREE_CODE (cond
), iter
, ERROR_MARK
,
4119 TREE_OPERAND (cond
, 1), ERROR_MARK
,
4120 NULL
, tf_warning_or_error
);
4121 if (error_operand_p (tem
))
4126 cond
= error_mark_node
;
4129 if (cond
== error_mark_node
)
4131 error_at (elocus
, "invalid controlling predicate");
4134 diff
= build_x_binary_op (MINUS_EXPR
, TREE_OPERAND (cond
, 1),
4135 ERROR_MARK
, iter
, ERROR_MARK
, NULL
,
4136 tf_warning_or_error
);
4137 if (error_operand_p (diff
))
4139 if (TREE_CODE (TREE_TYPE (diff
)) != INTEGER_TYPE
)
4141 error_at (elocus
, "difference between %qE and %qD does not have integer type",
4142 TREE_OPERAND (cond
, 1), iter
);
4146 switch (TREE_CODE (incr
))
4148 case PREINCREMENT_EXPR
:
4149 case PREDECREMENT_EXPR
:
4150 case POSTINCREMENT_EXPR
:
4151 case POSTDECREMENT_EXPR
:
4152 if (TREE_OPERAND (incr
, 0) != iter
)
4154 incr
= error_mark_node
;
4157 iter_incr
= build_x_unary_op (TREE_CODE (incr
), iter
,
4158 tf_warning_or_error
);
4159 if (error_operand_p (iter_incr
))
4161 else if (TREE_CODE (incr
) == PREINCREMENT_EXPR
4162 || TREE_CODE (incr
) == POSTINCREMENT_EXPR
)
4163 incr
= integer_one_node
;
4165 incr
= integer_minus_one_node
;
4168 if (TREE_OPERAND (incr
, 0) != iter
)
4169 incr
= error_mark_node
;
4170 else if (TREE_CODE (TREE_OPERAND (incr
, 1)) == PLUS_EXPR
4171 || TREE_CODE (TREE_OPERAND (incr
, 1)) == MINUS_EXPR
)
4173 tree rhs
= TREE_OPERAND (incr
, 1);
4174 if (TREE_OPERAND (rhs
, 0) == iter
)
4176 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 1)))
4178 incr
= error_mark_node
;
4181 iter_incr
= build_x_modify_expr (iter
, TREE_CODE (rhs
),
4182 TREE_OPERAND (rhs
, 1),
4183 tf_warning_or_error
);
4184 if (error_operand_p (iter_incr
))
4186 incr
= TREE_OPERAND (rhs
, 1);
4187 incr
= cp_convert (TREE_TYPE (diff
), incr
);
4188 if (TREE_CODE (rhs
) == MINUS_EXPR
)
4190 incr
= build1 (NEGATE_EXPR
, TREE_TYPE (diff
), incr
);
4191 incr
= fold_if_not_in_template (incr
);
4193 if (TREE_CODE (incr
) != INTEGER_CST
4194 && (TREE_CODE (incr
) != NOP_EXPR
4195 || (TREE_CODE (TREE_OPERAND (incr
, 0))
4200 else if (TREE_OPERAND (rhs
, 1) == iter
)
4202 if (TREE_CODE (TREE_TYPE (TREE_OPERAND (rhs
, 0))) != INTEGER_TYPE
4203 || TREE_CODE (rhs
) != PLUS_EXPR
)
4204 incr
= error_mark_node
;
4207 iter_incr
= build_x_binary_op (PLUS_EXPR
,
4208 TREE_OPERAND (rhs
, 0),
4211 tf_warning_or_error
);
4212 if (error_operand_p (iter_incr
))
4214 iter_incr
= build_x_modify_expr (iter
, NOP_EXPR
,
4216 tf_warning_or_error
);
4217 if (error_operand_p (iter_incr
))
4219 incr
= TREE_OPERAND (rhs
, 0);
4224 incr
= error_mark_node
;
4227 incr
= error_mark_node
;
4230 incr
= error_mark_node
;
4234 if (incr
== error_mark_node
)
4236 error_at (elocus
, "invalid increment expression");
4240 incr
= cp_convert (TREE_TYPE (diff
), incr
);
4241 for (c
= clauses
; c
; c
= OMP_CLAUSE_CHAIN (c
))
4242 if (OMP_CLAUSE_CODE (c
) == OMP_CLAUSE_LASTPRIVATE
4243 && OMP_CLAUSE_DECL (c
) == iter
)
4246 decl
= create_temporary_var (TREE_TYPE (diff
));
4248 add_decl_expr (decl
);
4249 last
= create_temporary_var (TREE_TYPE (diff
));
4251 add_decl_expr (last
);
4252 if (c
&& iter_incr
== NULL
)
4254 incr_var
= create_temporary_var (TREE_TYPE (diff
));
4255 pushdecl (incr_var
);
4256 add_decl_expr (incr_var
);
4258 gcc_assert (stmts_are_full_exprs_p ());
4260 orig_pre_body
= *pre_body
;
4261 *pre_body
= push_stmt_list ();
4263 add_stmt (orig_pre_body
);
4265 finish_expr_stmt (build_x_modify_expr (iter
, NOP_EXPR
, init
,
4266 tf_warning_or_error
));
4267 init
= build_int_cst (TREE_TYPE (diff
), 0);
4268 if (c
&& iter_incr
== NULL
)
4270 finish_expr_stmt (build_x_modify_expr (incr_var
, NOP_EXPR
,
4271 incr
, tf_warning_or_error
));
4273 iter_incr
= build_x_modify_expr (iter
, PLUS_EXPR
, incr
,
4274 tf_warning_or_error
);
4276 finish_expr_stmt (build_x_modify_expr (last
, NOP_EXPR
, init
,
4277 tf_warning_or_error
));
4278 *pre_body
= pop_stmt_list (*pre_body
);
4280 cond
= cp_build_binary_op (elocus
,
4281 TREE_CODE (cond
), decl
, diff
,
4282 tf_warning_or_error
);
4283 incr
= build_modify_expr (elocus
, decl
, NULL_TREE
, PLUS_EXPR
,
4284 elocus
, incr
, NULL_TREE
);
4287 *body
= push_stmt_list ();
4288 iter_init
= build2 (MINUS_EXPR
, TREE_TYPE (diff
), decl
, last
);
4289 iter_init
= build_x_modify_expr (iter
, PLUS_EXPR
, iter_init
,
4290 tf_warning_or_error
);
4291 iter_init
= build1 (NOP_EXPR
, void_type_node
, iter_init
);
4292 finish_expr_stmt (iter_init
);
4293 finish_expr_stmt (build_x_modify_expr (last
, NOP_EXPR
, decl
,
4294 tf_warning_or_error
));
4295 add_stmt (orig_body
);
4296 *body
= pop_stmt_list (*body
);
4300 OMP_CLAUSE_LASTPRIVATE_STMT (c
) = push_stmt_list ();
4301 finish_expr_stmt (iter_incr
);
4302 OMP_CLAUSE_LASTPRIVATE_STMT (c
)
4303 = pop_stmt_list (OMP_CLAUSE_LASTPRIVATE_STMT (c
));
4306 TREE_VEC_ELT (declv
, i
) = decl
;
4307 TREE_VEC_ELT (initv
, i
) = init
;
4308 TREE_VEC_ELT (condv
, i
) = cond
;
4309 TREE_VEC_ELT (incrv
, i
) = incr
;
4314 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
4315 are directly for their associated operands in the statement. DECL
4316 and INIT are a combo; if DECL is NULL then INIT ought to be a
4317 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
4318 optional statements that need to go before the loop into its
4322 finish_omp_for (location_t locus
, tree declv
, tree initv
, tree condv
,
4323 tree incrv
, tree body
, tree pre_body
, tree clauses
)
4325 tree omp_for
= NULL
, orig_incr
= NULL
;
4326 tree decl
, init
, cond
, incr
;
4330 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (initv
));
4331 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (condv
));
4332 gcc_assert (TREE_VEC_LENGTH (declv
) == TREE_VEC_LENGTH (incrv
));
4333 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4335 decl
= TREE_VEC_ELT (declv
, i
);
4336 init
= TREE_VEC_ELT (initv
, i
);
4337 cond
= TREE_VEC_ELT (condv
, i
);
4338 incr
= TREE_VEC_ELT (incrv
, i
);
4344 switch (TREE_CODE (init
))
4347 decl
= TREE_OPERAND (init
, 0);
4348 init
= TREE_OPERAND (init
, 1);
4351 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
4353 decl
= TREE_OPERAND (init
, 0);
4354 init
= TREE_OPERAND (init
, 2);
4364 "expected iteration declaration or initialization");
4369 if (init
&& EXPR_HAS_LOCATION (init
))
4370 elocus
= EXPR_LOCATION (init
);
4374 error_at (elocus
, "missing controlling predicate");
4380 error_at (elocus
, "missing increment expression");
4384 TREE_VEC_ELT (declv
, i
) = decl
;
4385 TREE_VEC_ELT (initv
, i
) = init
;
4388 if (dependent_omp_for_p (declv
, initv
, condv
, incrv
))
4392 stmt
= make_node (OMP_FOR
);
4394 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); i
++)
4396 /* This is really just a place-holder. We'll be decomposing this
4397 again and going through the cp_build_modify_expr path below when
4398 we instantiate the thing. */
4399 TREE_VEC_ELT (initv
, i
)
4400 = build2 (MODIFY_EXPR
, void_type_node
, TREE_VEC_ELT (declv
, i
),
4401 TREE_VEC_ELT (initv
, i
));
4404 TREE_TYPE (stmt
) = void_type_node
;
4405 OMP_FOR_INIT (stmt
) = initv
;
4406 OMP_FOR_COND (stmt
) = condv
;
4407 OMP_FOR_INCR (stmt
) = incrv
;
4408 OMP_FOR_BODY (stmt
) = body
;
4409 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
4410 OMP_FOR_CLAUSES (stmt
) = clauses
;
4412 SET_EXPR_LOCATION (stmt
, locus
);
4413 return add_stmt (stmt
);
4416 if (processing_template_decl
)
4417 orig_incr
= make_tree_vec (TREE_VEC_LENGTH (incrv
));
4419 for (i
= 0; i
< TREE_VEC_LENGTH (declv
); )
4421 decl
= TREE_VEC_ELT (declv
, i
);
4422 init
= TREE_VEC_ELT (initv
, i
);
4423 cond
= TREE_VEC_ELT (condv
, i
);
4424 incr
= TREE_VEC_ELT (incrv
, i
);
4426 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4429 if (init
&& EXPR_HAS_LOCATION (init
))
4430 elocus
= EXPR_LOCATION (init
);
4434 error_at (elocus
, "expected iteration declaration or initialization");
4438 if (incr
&& TREE_CODE (incr
) == MODOP_EXPR
)
4441 TREE_VEC_ELT (orig_incr
, i
) = incr
;
4442 incr
= cp_build_modify_expr (TREE_OPERAND (incr
, 0),
4443 TREE_CODE (TREE_OPERAND (incr
, 1)),
4444 TREE_OPERAND (incr
, 2),
4445 tf_warning_or_error
);
4448 if (CLASS_TYPE_P (TREE_TYPE (decl
)))
4450 if (handle_omp_for_class_iterator (i
, locus
, declv
, initv
, condv
,
4451 incrv
, &body
, &pre_body
, clauses
))
4456 if (!INTEGRAL_TYPE_P (TREE_TYPE (decl
))
4457 && TREE_CODE (TREE_TYPE (decl
)) != POINTER_TYPE
)
4459 error_at (elocus
, "invalid type for iteration variable %qE", decl
);
4463 if (!processing_template_decl
)
4465 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
4466 init
= cp_build_modify_expr (decl
, NOP_EXPR
, init
, tf_warning_or_error
);
4469 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
4471 && TREE_SIDE_EFFECTS (cond
)
4472 && COMPARISON_CLASS_P (cond
)
4473 && !processing_template_decl
)
4475 tree t
= TREE_OPERAND (cond
, 0);
4476 if (TREE_SIDE_EFFECTS (t
)
4478 && (TREE_CODE (t
) != NOP_EXPR
4479 || TREE_OPERAND (t
, 0) != decl
))
4480 TREE_OPERAND (cond
, 0)
4481 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4483 t
= TREE_OPERAND (cond
, 1);
4484 if (TREE_SIDE_EFFECTS (t
)
4486 && (TREE_CODE (t
) != NOP_EXPR
4487 || TREE_OPERAND (t
, 0) != decl
))
4488 TREE_OPERAND (cond
, 1)
4489 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4491 if (decl
== error_mark_node
|| init
== error_mark_node
)
4494 TREE_VEC_ELT (declv
, i
) = decl
;
4495 TREE_VEC_ELT (initv
, i
) = init
;
4496 TREE_VEC_ELT (condv
, i
) = cond
;
4497 TREE_VEC_ELT (incrv
, i
) = incr
;
4501 if (IS_EMPTY_STMT (pre_body
))
4504 omp_for
= c_finish_omp_for (locus
, declv
, initv
, condv
, incrv
,
4507 if (omp_for
== NULL
)
4510 for (i
= 0; i
< TREE_VEC_LENGTH (OMP_FOR_INCR (omp_for
)); i
++)
4512 decl
= TREE_OPERAND (TREE_VEC_ELT (OMP_FOR_INIT (omp_for
), i
), 0);
4513 incr
= TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
);
4515 if (TREE_CODE (incr
) != MODIFY_EXPR
)
4518 if (TREE_SIDE_EFFECTS (TREE_OPERAND (incr
, 1))
4519 && BINARY_CLASS_P (TREE_OPERAND (incr
, 1))
4520 && !processing_template_decl
)
4522 tree t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 0);
4523 if (TREE_SIDE_EFFECTS (t
)
4525 && (TREE_CODE (t
) != NOP_EXPR
4526 || TREE_OPERAND (t
, 0) != decl
))
4527 TREE_OPERAND (TREE_OPERAND (incr
, 1), 0)
4528 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4530 t
= TREE_OPERAND (TREE_OPERAND (incr
, 1), 1);
4531 if (TREE_SIDE_EFFECTS (t
)
4533 && (TREE_CODE (t
) != NOP_EXPR
4534 || TREE_OPERAND (t
, 0) != decl
))
4535 TREE_OPERAND (TREE_OPERAND (incr
, 1), 1)
4536 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
4540 TREE_VEC_ELT (OMP_FOR_INCR (omp_for
), i
) = TREE_VEC_ELT (orig_incr
, i
);
4542 if (omp_for
!= NULL
)
4543 OMP_FOR_CLAUSES (omp_for
) = clauses
;
4548 finish_omp_atomic (enum tree_code code
, tree lhs
, tree rhs
)
4557 dependent_p
= false;
4560 /* Even in a template, we can detect invalid uses of the atomic
4561 pragma if neither LHS nor RHS is type-dependent. */
4562 if (processing_template_decl
)
4564 dependent_p
= (type_dependent_expression_p (lhs
)
4565 || type_dependent_expression_p (rhs
));
4568 lhs
= build_non_dependent_expr (lhs
);
4569 rhs
= build_non_dependent_expr (rhs
);
4574 stmt
= c_finish_omp_atomic (input_location
, code
, lhs
, rhs
);
4575 if (stmt
== error_mark_node
)
4578 if (processing_template_decl
)
4579 stmt
= build2 (OMP_ATOMIC
, void_type_node
, integer_zero_node
,
4580 build2 (code
, void_type_node
, orig_lhs
, orig_rhs
));
4585 finish_omp_barrier (void)
4587 tree fn
= built_in_decls
[BUILT_IN_GOMP_BARRIER
];
4588 VEC(tree
,gc
) *vec
= make_tree_vector ();
4589 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4590 release_tree_vector (vec
);
4591 finish_expr_stmt (stmt
);
4595 finish_omp_flush (void)
4597 tree fn
= built_in_decls
[BUILT_IN_SYNCHRONIZE
];
4598 VEC(tree
,gc
) *vec
= make_tree_vector ();
4599 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4600 release_tree_vector (vec
);
4601 finish_expr_stmt (stmt
);
4605 finish_omp_taskwait (void)
4607 tree fn
= built_in_decls
[BUILT_IN_GOMP_TASKWAIT
];
4608 VEC(tree
,gc
) *vec
= make_tree_vector ();
4609 tree stmt
= finish_call_expr (fn
, &vec
, false, false, tf_warning_or_error
);
4610 release_tree_vector (vec
);
4611 finish_expr_stmt (stmt
);
4615 init_cp_semantics (void)
4619 /* Build a STATIC_ASSERT for a static assertion with the condition
4620 CONDITION and the message text MESSAGE. LOCATION is the location
4621 of the static assertion in the source code. When MEMBER_P, this
4622 static assertion is a member of a class. */
4624 finish_static_assert (tree condition
, tree message
, location_t location
,
4627 if (check_for_bare_parameter_packs (condition
))
4628 condition
= error_mark_node
;
4630 if (type_dependent_expression_p (condition
)
4631 || value_dependent_expression_p (condition
))
4633 /* We're in a template; build a STATIC_ASSERT and put it in
4637 assertion
= make_node (STATIC_ASSERT
);
4638 STATIC_ASSERT_CONDITION (assertion
) = condition
;
4639 STATIC_ASSERT_MESSAGE (assertion
) = message
;
4640 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
4643 maybe_add_class_template_decl_list (current_class_type
,
4647 add_stmt (assertion
);
4652 /* Fold the expression and convert it to a boolean value. */
4653 condition
= fold_non_dependent_expr (condition
);
4654 condition
= cp_convert (boolean_type_node
, condition
);
4656 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
4657 /* Do nothing; the condition is satisfied. */
4661 location_t saved_loc
= input_location
;
4663 input_location
= location
;
4664 if (TREE_CODE (condition
) == INTEGER_CST
4665 && integer_zerop (condition
))
4666 /* Report the error. */
4667 error ("static assertion failed: %E", message
);
4668 else if (condition
&& condition
!= error_mark_node
)
4669 error ("non-constant condition for static assertion");
4670 input_location
= saved_loc
;
4674 /* Returns the type of EXPR for cases where we can determine it even though
4675 EXPR is a type-dependent expression. */
4678 describable_type (tree expr
)
4680 tree type
= NULL_TREE
;
4682 if (! type_dependent_expression_p (expr
)
4683 && ! type_unknown_p (expr
))
4685 type
= unlowered_expr_type (expr
);
4686 if (real_lvalue_p (expr
))
4687 type
= build_reference_type (type
);
4693 switch (TREE_CODE (expr
))
4699 return TREE_TYPE (expr
);
4704 case TEMPLATE_PARM_INDEX
:
4706 case STATIC_CAST_EXPR
:
4707 case REINTERPRET_CAST_EXPR
:
4708 case CONST_CAST_EXPR
:
4709 case DYNAMIC_CAST_EXPR
:
4710 type
= TREE_TYPE (expr
);
4715 tree ptrtype
= describable_type (TREE_OPERAND (expr
, 0));
4716 if (ptrtype
&& POINTER_TYPE_P (ptrtype
))
4717 type
= build_reference_type (TREE_TYPE (ptrtype
));
4722 if (TREE_CODE_CLASS (TREE_CODE (expr
)) == tcc_constant
)
4723 type
= TREE_TYPE (expr
);
4727 if (type
&& type_uses_auto (type
))
4733 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4734 suitable for use as a type-specifier.
4736 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4737 id-expression or a class member access, FALSE when it was parsed as
4738 a full expression. */
4741 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
)
4743 tree orig_expr
= expr
;
4744 tree type
= NULL_TREE
;
4746 if (!expr
|| error_operand_p (expr
))
4747 return error_mark_node
;
4750 || TREE_CODE (expr
) == TYPE_DECL
4751 || (TREE_CODE (expr
) == BIT_NOT_EXPR
4752 && TYPE_P (TREE_OPERAND (expr
, 0))))
4754 error ("argument to decltype must be an expression");
4755 return error_mark_node
;
4758 if (type_dependent_expression_p (expr
)
4759 /* In a template, a COMPONENT_REF has an IDENTIFIER_NODE for op1 even
4760 if it isn't dependent, so that we can check access control at
4761 instantiation time, so defer the decltype as well (PR 42277). */
4762 || (id_expression_or_member_access_p
4763 && processing_template_decl
4764 && TREE_CODE (expr
) == COMPONENT_REF
))
4766 if (id_expression_or_member_access_p
)
4768 switch (TREE_CODE (expr
))
4775 case TEMPLATE_PARM_INDEX
:
4776 type
= TREE_TYPE (expr
);
4784 if (type
&& !type_uses_auto (type
))
4788 type
= cxx_make_type (DECLTYPE_TYPE
);
4789 DECLTYPE_TYPE_EXPR (type
) = expr
;
4790 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
4791 = id_expression_or_member_access_p
;
4792 SET_TYPE_STRUCTURAL_EQUALITY (type
);
4797 /* The type denoted by decltype(e) is defined as follows: */
4799 expr
= resolve_nondeduced_context (expr
);
4801 /* To get the size of a static data member declared as an array of
4802 unknown bound, we need to instantiate it. */
4803 if (TREE_CODE (expr
) == VAR_DECL
4804 && VAR_HAD_UNKNOWN_BOUND (expr
)
4805 && DECL_TEMPLATE_INSTANTIATION (expr
))
4806 instantiate_decl (expr
, /*defer_ok*/true, /*expl_inst_mem*/false);
4808 if (id_expression_or_member_access_p
)
4810 /* If e is an id-expression or a class member access (5.2.5
4811 [expr.ref]), decltype(e) is defined as the type of the entity
4812 named by e. If there is no such entity, or e names a set of
4813 overloaded functions, the program is ill-formed. */
4814 if (TREE_CODE (expr
) == IDENTIFIER_NODE
)
4815 expr
= lookup_name (expr
);
4817 if (TREE_CODE (expr
) == INDIRECT_REF
)
4818 /* This can happen when the expression is, e.g., "a.b". Just
4819 look at the underlying operand. */
4820 expr
= TREE_OPERAND (expr
, 0);
4822 if (TREE_CODE (expr
) == OFFSET_REF
4823 || TREE_CODE (expr
) == MEMBER_REF
)
4824 /* We're only interested in the field itself. If it is a
4825 BASELINK, we will need to see through it in the next
4827 expr
= TREE_OPERAND (expr
, 1);
4829 if (TREE_CODE (expr
) == BASELINK
)
4830 /* See through BASELINK nodes to the underlying functions. */
4831 expr
= BASELINK_FUNCTIONS (expr
);
4833 if (TREE_CODE (expr
) == TEMPLATE_ID_EXPR
)
4834 expr
= TREE_OPERAND (expr
, 0);
4836 if (TREE_CODE (expr
) == OVERLOAD
)
4838 if (OVL_CHAIN (expr
)
4839 || TREE_CODE (OVL_FUNCTION (expr
)) == TEMPLATE_DECL
)
4841 error ("%qE refers to a set of overloaded functions", orig_expr
);
4842 return error_mark_node
;
4845 /* An overload set containing only one function: just look
4846 at that function. */
4847 expr
= OVL_FUNCTION (expr
);
4850 switch (TREE_CODE (expr
))
4853 if (DECL_BIT_FIELD_TYPE (expr
))
4855 type
= DECL_BIT_FIELD_TYPE (expr
);
4858 /* Fall through for fields that aren't bitfields. */
4865 case TEMPLATE_PARM_INDEX
:
4866 expr
= mark_type_use (expr
);
4867 type
= TREE_TYPE (expr
);
4871 type
= error_mark_node
;
4875 mark_type_use (expr
);
4876 type
= is_bitfield_expr_with_lowered_type (expr
);
4878 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
4885 /* We can get here when the id-expression refers to an
4887 type
= TREE_TYPE (expr
);
4891 gcc_assert (TYPE_P (expr
) || DECL_P (expr
)
4892 || TREE_CODE (expr
) == SCOPE_REF
);
4893 error ("argument to decltype must be an expression");
4894 return error_mark_node
;
4899 /* Expressions of reference type are sometimes wrapped in
4900 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4901 representation, not part of the language, so we have to look
4903 if (TREE_CODE (expr
) == INDIRECT_REF
4904 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0)))
4906 expr
= TREE_OPERAND (expr
, 0);
4908 if (TREE_CODE (expr
) == CALL_EXPR
)
4910 /* If e is a function call (5.2.2 [expr.call]) or an
4911 invocation of an overloaded operator (parentheses around e
4912 are ignored), decltype(e) is defined as the return type of
4914 tree fndecl
= get_callee_fndecl (expr
);
4915 if (fndecl
&& fndecl
!= error_mark_node
)
4916 type
= TREE_TYPE (TREE_TYPE (fndecl
));
4919 tree target_type
= TREE_TYPE (CALL_EXPR_FN (expr
));
4920 if ((TREE_CODE (target_type
) == REFERENCE_TYPE
4921 || TREE_CODE (target_type
) == POINTER_TYPE
)
4922 && (TREE_CODE (TREE_TYPE (target_type
)) == FUNCTION_TYPE
4923 || TREE_CODE (TREE_TYPE (target_type
)) == METHOD_TYPE
))
4924 type
= TREE_TYPE (TREE_TYPE (target_type
));
4925 else if (processing_template_decl
)
4926 /* Within a template finish_call_expr doesn't resolve
4927 CALL_EXPR_FN, so even though this decltype isn't really
4928 dependent let's defer resolving it. */
4929 goto treat_as_dependent
;
4931 sorry ("unable to determine the declared type of expression %<%E%>",
4937 type
= is_bitfield_expr_with_lowered_type (expr
);
4940 /* Bitfields are special, because their type encodes the
4941 number of bits they store. If the expression referenced a
4942 bitfield, TYPE now has the declared type of that
4944 type
= cp_build_qualified_type (type
,
4945 cp_type_quals (TREE_TYPE (expr
)));
4947 if (real_lvalue_p (expr
))
4948 type
= build_reference_type (type
);
4950 /* Within a lambda-expression:
4952 Every occurrence of decltype((x)) where x is a possibly
4953 parenthesized id-expression that names an entity of
4954 automatic storage duration is treated as if x were
4955 transformed into an access to a corresponding data member
4956 of the closure type that would have been declared if x
4957 were a use of the denoted entity. */
4958 else if (outer_automatic_var_p (expr
)
4959 && current_function_decl
4960 && LAMBDA_FUNCTION_P (current_function_decl
))
4961 type
= capture_decltype (expr
);
4964 /* Otherwise, where T is the type of e, if e is an lvalue,
4965 decltype(e) is defined as T&, otherwise decltype(e) is
4967 type
= TREE_TYPE (expr
);
4968 if (type
== error_mark_node
)
4969 return error_mark_node
;
4970 else if (expr
== current_class_ptr
)
4971 /* If the expression is just "this", we want the
4972 cv-unqualified pointer for the "this" type. */
4973 type
= TYPE_MAIN_VARIANT (type
);
4974 else if (real_lvalue_p (expr
))
4976 if (TREE_CODE (type
) != REFERENCE_TYPE
)
4977 type
= build_reference_type (type
);
4980 type
= non_reference (type
);
4985 if (!type
|| type
== unknown_type_node
)
4987 error ("type of %qE is unknown", expr
);
4988 return error_mark_node
;
4994 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4995 __has_nothrow_copy, depending on assign_p. */
4998 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
5005 ix
= lookup_fnfields_1 (type
, ansi_assopname (NOP_EXPR
));
5008 fns
= VEC_index (tree
, CLASSTYPE_METHOD_VEC (type
), ix
);
5010 else if (TYPE_HAS_INIT_REF (type
))
5012 /* If construction of the copy constructor was postponed, create
5014 if (CLASSTYPE_LAZY_COPY_CTOR (type
))
5015 lazily_declare_fn (sfk_copy_constructor
, type
);
5016 if (CLASSTYPE_LAZY_MOVE_CTOR (type
))
5017 lazily_declare_fn (sfk_move_constructor
, type
);
5018 fns
= CLASSTYPE_CONSTRUCTORS (type
);
5023 for (; fns
; fns
= OVL_NEXT (fns
))
5025 tree fn
= OVL_CURRENT (fns
);
5029 if (copy_fn_p (fn
) == 0)
5032 else if (copy_fn_p (fn
) <= 0)
5035 if (!TYPE_NOTHROW_P (TREE_TYPE (fn
)))
5042 /* Actually evaluates the trait. */
5045 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
5047 enum tree_code type_code1
;
5050 type_code1
= TREE_CODE (type1
);
5054 case CPTK_HAS_NOTHROW_ASSIGN
:
5055 type1
= strip_array_types (type1
);
5056 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5057 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
5058 || (CLASS_TYPE_P (type1
)
5059 && classtype_has_nothrow_assign_or_copy_p (type1
,
5062 case CPTK_HAS_TRIVIAL_ASSIGN
:
5063 /* ??? The standard seems to be missing the "or array of such a class
5064 type" wording for this trait. */
5065 type1
= strip_array_types (type1
);
5066 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
5067 && (trivial_type_p (type1
)
5068 || (CLASS_TYPE_P (type1
)
5069 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1
))));
5071 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5072 type1
= strip_array_types (type1
);
5073 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
5074 || (CLASS_TYPE_P (type1
)
5075 && (t
= locate_ctor (type1
, NULL
))
5076 && TYPE_NOTHROW_P (TREE_TYPE (t
))));
5078 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5079 type1
= strip_array_types (type1
);
5080 return (trivial_type_p (type1
)
5081 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
5083 case CPTK_HAS_NOTHROW_COPY
:
5084 type1
= strip_array_types (type1
);
5085 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
5086 || (CLASS_TYPE_P (type1
)
5087 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
5089 case CPTK_HAS_TRIVIAL_COPY
:
5090 /* ??? The standard seems to be missing the "or array of such a class
5091 type" wording for this trait. */
5092 type1
= strip_array_types (type1
);
5093 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5094 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_INIT_REF (type1
)));
5096 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5097 type1
= strip_array_types (type1
);
5098 return (trivial_type_p (type1
) || type_code1
== REFERENCE_TYPE
5099 || (CLASS_TYPE_P (type1
)
5100 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
5102 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5103 return (CLASS_TYPE_P (type1
)
5104 && (t
= locate_dtor (type1
, NULL
)) && DECL_VIRTUAL_P (t
));
5106 case CPTK_IS_ABSTRACT
:
5107 return (CLASS_TYPE_P (type1
) && CLASSTYPE_PURE_VIRTUALS (type1
));
5109 case CPTK_IS_BASE_OF
:
5110 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5111 && DERIVED_FROM_P (type1
, type2
));
5114 return (NON_UNION_CLASS_TYPE_P (type1
));
5116 case CPTK_IS_CONVERTIBLE_TO
:
5121 return (NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
));
5124 return (type_code1
== ENUMERAL_TYPE
);
5127 return (pod_type_p (type1
));
5129 case CPTK_IS_POLYMORPHIC
:
5130 return (CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
));
5132 case CPTK_IS_STD_LAYOUT
:
5133 return (std_layout_type_p (type1
));
5135 case CPTK_IS_TRIVIAL
:
5136 return (trivial_type_p (type1
));
5139 return (type_code1
== UNION_TYPE
);
5147 /* Returns true if TYPE is a complete type, an array of unknown bound,
5148 or (possibly cv-qualified) void, returns false otherwise. */
5151 check_trait_type (tree type
)
5153 if (COMPLETE_TYPE_P (type
))
5156 if (TREE_CODE (type
) == ARRAY_TYPE
&& !TYPE_DOMAIN (type
))
5159 if (VOID_TYPE_P (type
))
5165 /* Process a trait expression. */
5168 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
5170 gcc_assert (kind
== CPTK_HAS_NOTHROW_ASSIGN
5171 || kind
== CPTK_HAS_NOTHROW_CONSTRUCTOR
5172 || kind
== CPTK_HAS_NOTHROW_COPY
5173 || kind
== CPTK_HAS_TRIVIAL_ASSIGN
5174 || kind
== CPTK_HAS_TRIVIAL_CONSTRUCTOR
5175 || kind
== CPTK_HAS_TRIVIAL_COPY
5176 || kind
== CPTK_HAS_TRIVIAL_DESTRUCTOR
5177 || kind
== CPTK_HAS_VIRTUAL_DESTRUCTOR
5178 || kind
== CPTK_IS_ABSTRACT
5179 || kind
== CPTK_IS_BASE_OF
5180 || kind
== CPTK_IS_CLASS
5181 || kind
== CPTK_IS_CONVERTIBLE_TO
5182 || kind
== CPTK_IS_EMPTY
5183 || kind
== CPTK_IS_ENUM
5184 || kind
== CPTK_IS_POD
5185 || kind
== CPTK_IS_POLYMORPHIC
5186 || kind
== CPTK_IS_STD_LAYOUT
5187 || kind
== CPTK_IS_TRIVIAL
5188 || kind
== CPTK_IS_UNION
);
5190 if (kind
== CPTK_IS_CONVERTIBLE_TO
)
5192 sorry ("__is_convertible_to");
5193 return error_mark_node
;
5196 if (type1
== error_mark_node
5197 || ((kind
== CPTK_IS_BASE_OF
|| kind
== CPTK_IS_CONVERTIBLE_TO
)
5198 && type2
== error_mark_node
))
5199 return error_mark_node
;
5201 if (processing_template_decl
)
5203 tree trait_expr
= make_node (TRAIT_EXPR
);
5204 TREE_TYPE (trait_expr
) = boolean_type_node
;
5205 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
5206 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
5207 TRAIT_EXPR_KIND (trait_expr
) = kind
;
5211 complete_type (type1
);
5213 complete_type (type2
);
5217 case CPTK_HAS_NOTHROW_ASSIGN
:
5218 case CPTK_HAS_TRIVIAL_ASSIGN
:
5219 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
5220 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
5221 case CPTK_HAS_NOTHROW_COPY
:
5222 case CPTK_HAS_TRIVIAL_COPY
:
5223 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
5224 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
5225 case CPTK_IS_ABSTRACT
:
5228 case CPTK_IS_POLYMORPHIC
:
5229 case CPTK_IS_STD_LAYOUT
:
5230 case CPTK_IS_TRIVIAL
:
5231 if (!check_trait_type (type1
))
5233 error ("incomplete type %qT not allowed", type1
);
5234 return error_mark_node
;
5238 case CPTK_IS_BASE_OF
:
5239 if (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
5240 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
5241 && !COMPLETE_TYPE_P (type2
))
5243 error ("incomplete type %qT not allowed", type2
);
5244 return error_mark_node
;
5253 case CPTK_IS_CONVERTIBLE_TO
:
5258 return (trait_expr_value (kind
, type1
, type2
)
5259 ? boolean_true_node
: boolean_false_node
);
5262 /* Do-nothing variants of functions to handle pragma FLOAT_CONST_DECIMAL64,
5263 which is ignored for C++. */
5266 set_float_const_decimal64 (void)
5271 clear_float_const_decimal64 (void)
5276 float_const_decimal64_p (void)
5281 /* Return true if T is a literal type. */
5284 literal_type_p (tree t
)
5286 if (SCALAR_TYPE_P (t
))
5288 if (CLASS_TYPE_P (t
))
5289 return CLASSTYPE_LITERAL_P (t
);
5290 if (TREE_CODE (t
) == ARRAY_TYPE
)
5291 return literal_type_p (strip_array_types (t
));
5296 /* If DECL is a variable declared `constexpr', require its type
5297 be literal. Return the DECL if OK, otherwise NULL. */
5300 ensure_literal_type_for_constexpr_object (tree decl
)
5302 tree type
= TREE_TYPE (decl
);
5303 if (TREE_CODE (decl
) == VAR_DECL
&& DECL_DECLARED_CONSTEXPR_P (decl
)
5304 && !processing_template_decl
&& !literal_type_p (type
))
5306 error ("the type %qT of constexpr variable %qD is not literal",
5313 /* Return non-null if FUN certainly designates a valid constexpr function
5314 declaration. Otherwise return NULL. Issue appropriate diagnostics
5315 if necessary. Note that we only check the declaration, not the body
5319 validate_constexpr_fundecl (tree fun
)
5321 tree rettype
= NULL
;
5324 /* Don't bother if FUN is not marked constexpr. */
5325 if (!DECL_DECLARED_CONSTEXPR_P (fun
))
5328 /* For a function template, we have absolutely no guarantee that all
5329 instantiations will be constexpr. */
5330 if (TREE_CODE (fun
) == TEMPLATE_DECL
)
5333 parm
= FUNCTION_FIRST_USER_PARM (fun
);
5334 for (; parm
!= NULL
; parm
= TREE_CHAIN (parm
))
5336 tree type
= TREE_TYPE (parm
);
5337 if (dependent_type_p (type
))
5339 if (!literal_type_p (type
))
5341 error ("parameter %q#D is not of literal type", parm
);
5346 if (DECL_CONSTRUCTOR_P (fun
))
5349 rettype
= TREE_TYPE (TREE_TYPE (fun
));
5350 if (dependent_type_p (rettype
))
5352 if (!literal_type_p (rettype
))
5354 error ("return type %qT of function %qD is not a literal type",
5355 TREE_TYPE (TREE_TYPE (fun
)), fun
);
5362 /* Constructor for a lambda expression. */
5365 build_lambda_expr (void)
5367 tree lambda
= make_node (LAMBDA_EXPR
);
5368 LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) = CPLD_NONE
;
5369 LAMBDA_EXPR_CAPTURE_LIST (lambda
) = NULL_TREE
;
5370 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = NULL_TREE
;
5371 LAMBDA_EXPR_RETURN_TYPE (lambda
) = NULL_TREE
;
5372 LAMBDA_EXPR_MUTABLE_P (lambda
) = false;
5376 /* Create the closure object for a LAMBDA_EXPR. */
5379 build_lambda_object (tree lambda_expr
)
5381 /* Build aggregate constructor call.
5382 - cp_parser_braced_list
5383 - cp_parser_functional_cast */
5384 VEC(constructor_elt
,gc
) *elts
= NULL
;
5385 tree node
, expr
, type
;
5386 location_t saved_loc
;
5388 if (processing_template_decl
)
5391 /* Make sure any error messages refer to the lambda-introducer. */
5392 saved_loc
= input_location
;
5393 input_location
= LAMBDA_EXPR_LOCATION (lambda_expr
);
5395 for (node
= LAMBDA_EXPR_CAPTURE_LIST (lambda_expr
);
5397 node
= TREE_CHAIN (node
))
5399 tree field
= TREE_PURPOSE (node
);
5400 tree val
= TREE_VALUE (node
);
5405 /* Mere mortals can't copy arrays with aggregate initialization, so
5406 do some magic to make it work here. */
5407 if (TREE_CODE (TREE_TYPE (field
)) == ARRAY_TYPE
)
5408 val
= build_array_copy (val
);
5409 else if (DECL_NORMAL_CAPTURE_P (field
)
5410 && TREE_CODE (TREE_TYPE (field
)) != REFERENCE_TYPE
)
5412 /* "the entities that are captured by copy are used to
5413 direct-initialize each corresponding non-static data
5414 member of the resulting closure object."
5416 There's normally no way to express direct-initialization
5417 from an element of a CONSTRUCTOR, so we build up a special
5418 TARGET_EXPR to bypass the usual copy-initialization. */
5419 val
= force_rvalue (val
);
5420 if (TREE_CODE (val
) == TARGET_EXPR
)
5421 TARGET_EXPR_DIRECT_INIT_P (val
) = true;
5424 CONSTRUCTOR_APPEND_ELT (elts
, DECL_NAME (field
), val
);
5427 expr
= build_constructor (init_list_type_node
, elts
);
5428 CONSTRUCTOR_IS_DIRECT_INIT (expr
) = 1;
5430 /* N2927: "[The closure] class type is not an aggregate."
5431 But we briefly treat it as an aggregate to make this simpler. */
5432 type
= TREE_TYPE (lambda_expr
);
5433 CLASSTYPE_NON_AGGREGATE (type
) = 0;
5434 expr
= finish_compound_literal (type
, expr
);
5435 CLASSTYPE_NON_AGGREGATE (type
) = 1;
5437 input_location
= saved_loc
;
5441 /* Return an initialized RECORD_TYPE for LAMBDA.
5442 LAMBDA must have its explicit captures already. */
5445 begin_lambda_type (tree lambda
)
5450 /* Unique name. This is just like an unnamed class, but we cannot use
5451 make_anon_name because of certain checks against TYPE_ANONYMOUS_P. */
5453 name
= make_lambda_name ();
5455 /* Create the new RECORD_TYPE for this lambda. */
5456 type
= xref_tag (/*tag_code=*/record_type
,
5458 /*scope=*/ts_within_enclosing_non_class
,
5459 /*template_header_p=*/false);
5462 /* Designate it as a struct so that we can use aggregate initialization. */
5463 CLASSTYPE_DECLARED_CLASS (type
) = false;
5465 /* Clear base types. */
5466 xref_basetypes (type
, /*bases=*/NULL_TREE
);
5468 /* Start the class. */
5469 type
= begin_class_definition (type
, /*attributes=*/NULL_TREE
);
5471 /* Cross-reference the expression and the type. */
5472 TREE_TYPE (lambda
) = type
;
5473 CLASSTYPE_LAMBDA_EXPR (type
) = lambda
;
5478 /* Returns the type to use for the return type of the operator() of a
5482 lambda_return_type (tree expr
)
5485 if (BRACE_ENCLOSED_INITIALIZER_P (expr
))
5487 warning (0, "cannot deduce lambda return type from a braced-init-list");
5488 return void_type_node
;
5490 if (type_dependent_expression_p (expr
))
5492 type
= cxx_make_type (DECLTYPE_TYPE
);
5493 DECLTYPE_TYPE_EXPR (type
) = expr
;
5494 DECLTYPE_FOR_LAMBDA_RETURN (type
) = true;
5495 SET_TYPE_STRUCTURAL_EQUALITY (type
);
5498 type
= type_decays_to (unlowered_expr_type (expr
));
5502 /* Given a LAMBDA_EXPR or closure type LAMBDA, return the op() of the
5506 lambda_function (tree lambda
)
5509 if (TREE_CODE (lambda
) == LAMBDA_EXPR
)
5510 type
= TREE_TYPE (lambda
);
5513 gcc_assert (LAMBDA_TYPE_P (type
));
5514 /* Don't let debug_tree cause instantiation. */
5515 if (CLASSTYPE_TEMPLATE_INSTANTIATION (type
) && !COMPLETE_TYPE_P (type
))
5517 lambda
= lookup_member (type
, ansi_opname (CALL_EXPR
),
5518 /*protect=*/0, /*want_type=*/false);
5520 lambda
= BASELINK_FUNCTIONS (lambda
);
5524 /* Returns the type to use for the FIELD_DECL corresponding to the
5526 The caller should add REFERENCE_TYPE for capture by reference. */
5529 lambda_capture_field_type (tree expr
)
5532 if (type_dependent_expression_p (expr
))
5534 type
= cxx_make_type (DECLTYPE_TYPE
);
5535 DECLTYPE_TYPE_EXPR (type
) = expr
;
5536 DECLTYPE_FOR_LAMBDA_CAPTURE (type
) = true;
5537 SET_TYPE_STRUCTURAL_EQUALITY (type
);
5540 type
= non_reference (unlowered_expr_type (expr
));
5544 /* Recompute the return type for LAMBDA with body of the form:
5545 { return EXPR ; } */
5548 apply_lambda_return_type (tree lambda
, tree return_type
)
5550 tree fco
= lambda_function (lambda
);
5553 LAMBDA_EXPR_RETURN_TYPE (lambda
) = return_type
;
5555 /* If we got a DECLTYPE_TYPE, don't stick it in the function yet,
5556 it would interfere with instantiating the closure type. */
5557 if (dependent_type_p (return_type
))
5559 if (return_type
== error_mark_node
)
5562 /* TREE_TYPE (FUNCTION_DECL) == METHOD_TYPE
5563 TREE_TYPE (METHOD_TYPE) == return-type */
5564 TREE_TYPE (fco
) = change_return_type (return_type
, TREE_TYPE (fco
));
5566 result
= DECL_RESULT (fco
);
5567 if (result
== NULL_TREE
)
5570 /* We already have a DECL_RESULT from start_preparsed_function.
5571 Now we need to redo the work it and allocate_struct_function
5572 did to reflect the new type. */
5573 result
= build_decl (input_location
, RESULT_DECL
, NULL_TREE
,
5574 TYPE_MAIN_VARIANT (return_type
));
5575 DECL_ARTIFICIAL (result
) = 1;
5576 DECL_IGNORED_P (result
) = 1;
5577 cp_apply_type_quals_to_decl (cp_type_quals (return_type
),
5580 DECL_RESULT (fco
) = result
;
5582 if (!processing_template_decl
&& aggregate_value_p (result
, fco
))
5584 #ifdef PCC_STATIC_STRUCT_RETURN
5585 cfun
->returns_pcc_struct
= 1;
5587 cfun
->returns_struct
= 1;
5592 /* DECL is a local variable or parameter from the surrounding scope of a
5593 lambda-expression. Returns the decltype for a use of the capture field
5594 for DECL even if it hasn't been captured yet. */
5597 capture_decltype (tree decl
)
5599 tree lam
= CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (current_function_decl
));
5600 /* FIXME do lookup instead of list walk? */
5601 tree cap
= value_member (decl
, LAMBDA_EXPR_CAPTURE_LIST (lam
));
5605 type
= TREE_TYPE (TREE_PURPOSE (cap
));
5607 switch (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lam
))
5610 error ("%qD is not captured", decl
);
5611 return error_mark_node
;
5614 type
= TREE_TYPE (decl
);
5615 if (TREE_CODE (type
) == REFERENCE_TYPE
5616 && TREE_CODE (TREE_TYPE (type
)) != FUNCTION_TYPE
)
5617 type
= TREE_TYPE (type
);
5620 case CPLD_REFERENCE
:
5621 type
= TREE_TYPE (decl
);
5622 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5623 type
= build_reference_type (TREE_TYPE (decl
));
5630 if (TREE_CODE (type
) != REFERENCE_TYPE
)
5632 if (!LAMBDA_EXPR_MUTABLE_P (lam
))
5633 type
= cp_build_qualified_type (type
, (cp_type_quals (type
)
5635 type
= build_reference_type (type
);
5640 /* From an ID and INITIALIZER, create a capture (by reference if
5641 BY_REFERENCE_P is true), add it to the capture-list for LAMBDA,
5645 add_capture (tree lambda
, tree id
, tree initializer
, bool by_reference_p
,
5646 bool explicit_init_p
)
5651 type
= lambda_capture_field_type (initializer
);
5654 type
= build_reference_type (type
);
5655 if (!real_lvalue_p (initializer
))
5656 error ("cannot capture %qE by reference", initializer
);
5659 /* Make member variable. */
5660 member
= build_lang_decl (FIELD_DECL
, id
, type
);
5661 if (!explicit_init_p
)
5662 /* Normal captures are invisible to name lookup but uses are replaced
5663 with references to the capture field; we implement this by only
5664 really making them invisible in unevaluated context; see
5665 qualify_lookup. For now, let's make explicitly initialized captures
5667 DECL_NORMAL_CAPTURE_P (member
) = true;
5669 /* Add it to the appropriate closure class if we've started it. */
5670 if (current_class_type
&& current_class_type
== TREE_TYPE (lambda
))
5671 finish_member_declaration (member
);
5673 LAMBDA_EXPR_CAPTURE_LIST (lambda
)
5674 = tree_cons (member
, initializer
, LAMBDA_EXPR_CAPTURE_LIST (lambda
));
5676 if (id
== get_identifier ("__this"))
5678 if (LAMBDA_EXPR_CAPTURES_THIS_P (lambda
))
5679 error ("already captured %<this%> in lambda expression");
5680 LAMBDA_EXPR_THIS_CAPTURE (lambda
) = member
;
5686 /* Register all the capture members on the list CAPTURES, which is the
5687 LAMBDA_EXPR_CAPTURE_LIST for the lambda after the introducer. */
5689 void register_capture_members (tree captures
)
5693 register_capture_members (TREE_CHAIN (captures
));
5694 finish_member_declaration (TREE_PURPOSE (captures
));
5698 /* Given a FIELD_DECL decl belonging to a closure type, return a
5699 COMPONENT_REF of it relative to the 'this' parameter of the op() for
5703 thisify_lambda_field (tree decl
)
5705 tree context
= lambda_function (DECL_CONTEXT (decl
));
5706 tree object
= cp_build_indirect_ref (DECL_ARGUMENTS (context
),
5708 tf_warning_or_error
);
5709 return finish_non_static_data_member (decl
, object
,
5710 /*qualifying_scope*/NULL_TREE
);
5713 /* Similar to add_capture, except this works on a stack of nested lambdas.
5714 BY_REFERENCE_P in this case is derived from the default capture mode.
5715 Returns the capture for the lambda at the bottom of the stack. */
5718 add_default_capture (tree lambda_stack
, tree id
, tree initializer
)
5720 bool this_capture_p
= (id
== get_identifier ("__this"));
5722 tree member
= NULL_TREE
;
5724 tree saved_class_type
= current_class_type
;
5728 for (node
= lambda_stack
;
5730 node
= TREE_CHAIN (node
))
5732 tree lambda
= TREE_VALUE (node
);
5734 current_class_type
= TREE_TYPE (lambda
);
5735 member
= add_capture (lambda
,
5740 && (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
)
5741 == CPLD_REFERENCE
)),
5742 /*explicit_init_p=*/false);
5743 initializer
= thisify_lambda_field (member
);
5746 current_class_type
= saved_class_type
;
5751 /* Return the capture pertaining to a use of 'this' in LAMBDA, in the form of an
5752 INDIRECT_REF, possibly adding it through default capturing. */
5755 lambda_expr_this_capture (tree lambda
)
5759 tree this_capture
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
5761 /* Try to default capture 'this' if we can. */
5763 && LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) != CPLD_NONE
)
5765 tree containing_function
= TYPE_CONTEXT (TREE_TYPE (lambda
));
5766 tree lambda_stack
= tree_cons (NULL_TREE
, lambda
, NULL_TREE
);
5767 tree init
= NULL_TREE
;
5769 /* If we are in a lambda function, we can move out until we hit:
5770 1. a non-lambda function,
5771 2. a lambda function capturing 'this', or
5772 3. a non-default capturing lambda function. */
5773 while (LAMBDA_FUNCTION_P (containing_function
))
5776 = CLASSTYPE_LAMBDA_EXPR (DECL_CONTEXT (containing_function
));
5778 if (LAMBDA_EXPR_THIS_CAPTURE (lambda
))
5780 /* An outer lambda has already captured 'this'. */
5781 tree cap
= LAMBDA_EXPR_THIS_CAPTURE (lambda
);
5782 init
= thisify_lambda_field (cap
);
5786 if (LAMBDA_EXPR_DEFAULT_CAPTURE_MODE (lambda
) == CPLD_NONE
)
5787 /* An outer lambda won't let us capture 'this'. */
5790 lambda_stack
= tree_cons (NULL_TREE
,
5794 containing_function
= decl_function_context (containing_function
);
5797 if (!init
&& DECL_NONSTATIC_MEMBER_FUNCTION_P (containing_function
)
5798 && !LAMBDA_FUNCTION_P (containing_function
))
5799 /* First parameter is 'this'. */
5800 init
= DECL_ARGUMENTS (containing_function
);
5803 this_capture
= add_default_capture (lambda_stack
,
5804 /*id=*/get_identifier ("__this"),
5810 error ("%<this%> was not captured for this lambda function");
5811 result
= error_mark_node
;
5815 /* To make sure that current_class_ref is for the lambda. */
5816 gcc_assert (TYPE_MAIN_VARIANT (TREE_TYPE (current_class_ref
)) == TREE_TYPE (lambda
));
5818 result
= finish_non_static_data_member (this_capture
,
5820 /*qualifying_scope=*/NULL_TREE
);
5822 /* If 'this' is captured, each use of 'this' is transformed into an
5823 access to the corresponding unnamed data member of the closure
5824 type cast (_expr.cast_ 5.4) to the type of 'this'. [ The cast
5825 ensures that the transformed expression is an rvalue. ] */
5826 result
= rvalue (result
);
5832 /* Returns the method basetype of the innermost non-lambda function, or
5833 NULL_TREE if none. */
5836 nonlambda_method_basetype (void)
5839 if (!current_class_ref
)
5842 type
= current_class_type
;
5843 if (!LAMBDA_TYPE_P (type
))
5846 /* Find the nearest enclosing non-lambda function. */
5847 fn
= TYPE_NAME (type
);
5849 fn
= decl_function_context (fn
);
5850 while (fn
&& LAMBDA_FUNCTION_P (fn
));
5852 if (!fn
|| !DECL_NONSTATIC_MEMBER_FUNCTION_P (fn
))
5855 return TYPE_METHOD_BASETYPE (TREE_TYPE (fn
));
5858 /* If the closure TYPE has a static op(), also add a conversion to function
5862 maybe_add_lambda_conv_op (tree type
)
5864 bool nested
= (current_function_decl
!= NULL_TREE
);
5865 tree callop
= lambda_function (type
);
5866 tree rettype
, name
, fntype
, fn
, body
, compound_stmt
;
5867 tree thistype
, stattype
, statfn
, convfn
, call
, arg
;
5868 VEC (tree
, gc
) *argvec
;
5870 if (LAMBDA_EXPR_CAPTURE_LIST (CLASSTYPE_LAMBDA_EXPR (type
)) != NULL_TREE
)
5873 stattype
= build_function_type (TREE_TYPE (TREE_TYPE (callop
)),
5874 FUNCTION_ARG_CHAIN (callop
));
5876 /* First build up the conversion op. */
5878 rettype
= build_pointer_type (stattype
);
5879 name
= mangle_conv_op_name_for_type (rettype
);
5880 thistype
= cp_build_qualified_type (type
, TYPE_QUAL_CONST
);
5881 fntype
= build_method_type_directly (thistype
, rettype
, void_list_node
);
5882 fn
= convfn
= build_lang_decl (FUNCTION_DECL
, name
, fntype
);
5883 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
5885 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
5886 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
5887 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
5889 SET_OVERLOADED_OPERATOR_CODE (fn
, TYPE_EXPR
);
5890 grokclassfn (type
, fn
, NO_SPECIAL
);
5891 set_linkage_according_to_type (type
, fn
);
5892 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
5893 DECL_IN_AGGR_P (fn
) = 1;
5894 DECL_ARTIFICIAL (fn
) = 1;
5895 DECL_NOT_REALLY_EXTERN (fn
) = 1;
5896 DECL_DECLARED_INLINE_P (fn
) = 1;
5897 DECL_ARGUMENTS (fn
) = build_this_parm (fntype
, TYPE_QUAL_CONST
);
5899 DECL_INTERFACE_KNOWN (fn
) = 1;
5901 add_method (type
, fn
, NULL_TREE
);
5903 /* Generic thunk code fails for varargs; we'll complain in mark_used if
5904 the conversion op is used. */
5905 if (varargs_function_p (callop
))
5907 DECL_DELETED_FN (fn
) = 1;
5911 /* Now build up the thunk to be returned. */
5913 name
= get_identifier ("_FUN");
5914 fn
= statfn
= build_lang_decl (FUNCTION_DECL
, name
, stattype
);
5915 DECL_SOURCE_LOCATION (fn
) = DECL_SOURCE_LOCATION (callop
);
5916 if (TARGET_PTRMEMFUNC_VBIT_LOCATION
== ptrmemfunc_vbit_in_pfn
5917 && DECL_ALIGN (fn
) < 2 * BITS_PER_UNIT
)
5918 DECL_ALIGN (fn
) = 2 * BITS_PER_UNIT
;
5919 grokclassfn (type
, fn
, NO_SPECIAL
);
5920 set_linkage_according_to_type (type
, fn
);
5921 rest_of_decl_compilation (fn
, toplevel_bindings_p (), at_eof
);
5922 DECL_IN_AGGR_P (fn
) = 1;
5923 DECL_ARTIFICIAL (fn
) = 1;
5924 DECL_NOT_REALLY_EXTERN (fn
) = 1;
5925 DECL_DECLARED_INLINE_P (fn
) = 1;
5926 DECL_STATIC_FUNCTION_P (fn
) = 1;
5927 DECL_ARGUMENTS (fn
) = copy_list (TREE_CHAIN (DECL_ARGUMENTS (callop
)));
5928 for (arg
= DECL_ARGUMENTS (fn
); arg
; arg
= TREE_CHAIN (arg
))
5929 DECL_CONTEXT (arg
) = fn
;
5931 DECL_INTERFACE_KNOWN (fn
) = 1;
5933 add_method (type
, fn
, NULL_TREE
);
5936 push_function_context ();
5938 /* Generate the body of the thunk. */
5940 start_preparsed_function (statfn
, NULL_TREE
,
5941 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
5942 if (DECL_ONE_ONLY (statfn
))
5944 /* Put the thunk in the same comdat group as the call op. */
5945 struct cgraph_node
*callop_node
, *thunk_node
;
5946 DECL_COMDAT_GROUP (statfn
) = DECL_COMDAT_GROUP (callop
);
5947 callop_node
= cgraph_node (callop
);
5948 thunk_node
= cgraph_node (statfn
);
5949 gcc_assert (callop_node
->same_comdat_group
== NULL
);
5950 gcc_assert (thunk_node
->same_comdat_group
== NULL
);
5951 callop_node
->same_comdat_group
= thunk_node
;
5952 thunk_node
->same_comdat_group
= callop_node
;
5954 body
= begin_function_body ();
5955 compound_stmt
= begin_compound_stmt (0);
5957 arg
= build1 (NOP_EXPR
, TREE_TYPE (DECL_ARGUMENTS (callop
)),
5959 argvec
= make_tree_vector ();
5960 VEC_quick_push (tree
, argvec
, arg
);
5961 for (arg
= DECL_ARGUMENTS (statfn
); arg
; arg
= TREE_CHAIN (arg
))
5962 VEC_safe_push (tree
, gc
, argvec
, arg
);
5963 call
= build_call_a (callop
, VEC_length (tree
, argvec
),
5964 VEC_address (tree
, argvec
));
5965 CALL_FROM_THUNK_P (call
) = 1;
5966 if (MAYBE_CLASS_TYPE_P (TREE_TYPE (call
)))
5967 call
= build_cplus_new (TREE_TYPE (call
), call
);
5968 call
= convert_from_reference (call
);
5969 finish_return_stmt (call
);
5971 finish_compound_stmt (compound_stmt
);
5972 finish_function_body (body
);
5974 expand_or_defer_fn (finish_function (2));
5976 /* Generate the body of the conversion op. */
5978 start_preparsed_function (convfn
, NULL_TREE
,
5979 SF_PRE_PARSED
| SF_INCLASS_INLINE
);
5980 body
= begin_function_body ();
5981 compound_stmt
= begin_compound_stmt (0);
5983 finish_return_stmt (decay_conversion (statfn
));
5985 finish_compound_stmt (compound_stmt
);
5986 finish_function_body (body
);
5988 expand_or_defer_fn (finish_function (2));
5991 pop_function_context ();
5993 #include "gt-cp-semantics.h"