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 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"
50 /* There routines provide a modular interface to perform many parsing
51 operations. They may therefore be used during actual parsing, or
52 during template instantiation, which may be regarded as a
53 degenerate form of parsing. */
55 static tree
maybe_convert_cond (tree
);
56 static tree
simplify_aggr_init_exprs_r (tree
*, int *, void *);
57 static tree
finalize_nrv_r (tree
*, int *, void *);
60 /* Deferred Access Checking Overview
61 ---------------------------------
63 Most C++ expressions and declarations require access checking
64 to be performed during parsing. However, in several cases,
65 this has to be treated differently.
67 For member declarations, access checking has to be deferred
68 until more information about the declaration is known. For
80 When we are parsing the function return type `A::X', we don't
81 really know if this is allowed until we parse the function name.
83 Furthermore, some contexts require that access checking is
84 never performed at all. These include class heads, and template
87 Typical use of access checking functions is described here:
89 1. When we enter a context that requires certain access checking
90 mode, the function `push_deferring_access_checks' is called with
91 DEFERRING argument specifying the desired mode. Access checking
92 may be performed immediately (dk_no_deferred), deferred
93 (dk_deferred), or not performed (dk_no_check).
95 2. When a declaration such as a type, or a variable, is encountered,
96 the function `perform_or_defer_access_check' is called. It
97 maintains a VEC of all deferred checks.
99 3. The global `current_class_type' or `current_function_decl' is then
100 setup by the parser. `enforce_access' relies on these information
103 4. Upon exiting the context mentioned in step 1,
104 `perform_deferred_access_checks' is called to check all declaration
105 stored in the VEC. `pop_deferring_access_checks' is then
106 called to restore the previous access checking mode.
108 In case of parsing error, we simply call `pop_deferring_access_checks'
109 without `perform_deferred_access_checks'. */
111 typedef struct deferred_access
GTY(())
113 /* A VEC representing name-lookups for which we have deferred
114 checking access controls. We cannot check the accessibility of
115 names used in a decl-specifier-seq until we know what is being
116 declared because code like:
123 A::B* A::f() { return 0; }
125 is valid, even though `A::B' is not generally accessible. */
126 VEC (deferred_access_check
,gc
)* GTY(()) deferred_access_checks
;
128 /* The current mode of access checks. */
129 enum deferring_kind deferring_access_checks_kind
;
132 DEF_VEC_O (deferred_access
);
133 DEF_VEC_ALLOC_O (deferred_access
,gc
);
135 /* Data for deferred access checking. */
136 static GTY(()) VEC(deferred_access
,gc
) *deferred_access_stack
;
137 static GTY(()) unsigned deferred_access_no_check
;
139 /* Save the current deferred access states and start deferred
140 access checking iff DEFER_P is true. */
143 push_deferring_access_checks (deferring_kind deferring
)
145 /* For context like template instantiation, access checking
146 disabling applies to all nested context. */
147 if (deferred_access_no_check
|| deferring
== dk_no_check
)
148 deferred_access_no_check
++;
151 deferred_access
*ptr
;
153 ptr
= VEC_safe_push (deferred_access
, gc
, deferred_access_stack
, NULL
);
154 ptr
->deferred_access_checks
= NULL
;
155 ptr
->deferring_access_checks_kind
= deferring
;
159 /* Resume deferring access checks again after we stopped doing
163 resume_deferring_access_checks (void)
165 if (!deferred_access_no_check
)
166 VEC_last (deferred_access
, deferred_access_stack
)
167 ->deferring_access_checks_kind
= dk_deferred
;
170 /* Stop deferring access checks. */
173 stop_deferring_access_checks (void)
175 if (!deferred_access_no_check
)
176 VEC_last (deferred_access
, deferred_access_stack
)
177 ->deferring_access_checks_kind
= dk_no_deferred
;
180 /* Discard the current deferred access checks and restore the
184 pop_deferring_access_checks (void)
186 if (deferred_access_no_check
)
187 deferred_access_no_check
--;
189 VEC_pop (deferred_access
, deferred_access_stack
);
192 /* Returns a TREE_LIST representing the deferred checks.
193 The TREE_PURPOSE of each node is the type through which the
194 access occurred; the TREE_VALUE is the declaration named.
197 VEC (deferred_access_check
,gc
)*
198 get_deferred_access_checks (void)
200 if (deferred_access_no_check
)
203 return (VEC_last (deferred_access
, deferred_access_stack
)
204 ->deferred_access_checks
);
207 /* Take current deferred checks and combine with the
208 previous states if we also defer checks previously.
209 Otherwise perform checks now. */
212 pop_to_parent_deferring_access_checks (void)
214 if (deferred_access_no_check
)
215 deferred_access_no_check
--;
218 VEC (deferred_access_check
,gc
) *checks
;
219 deferred_access
*ptr
;
221 checks
= (VEC_last (deferred_access
, deferred_access_stack
)
222 ->deferred_access_checks
);
224 VEC_pop (deferred_access
, deferred_access_stack
);
225 ptr
= VEC_last (deferred_access
, deferred_access_stack
);
226 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
229 perform_access_checks (checks
);
233 /* Merge with parent. */
235 deferred_access_check
*chk
, *probe
;
238 VEC_iterate (deferred_access_check
, checks
, i
, chk
) ;
242 VEC_iterate (deferred_access_check
,
243 ptr
->deferred_access_checks
, j
, probe
) ;
246 if (probe
->binfo
== chk
->binfo
&&
247 probe
->decl
== chk
->decl
&&
248 probe
->diag_decl
== chk
->diag_decl
)
251 /* Insert into parent's checks. */
252 VEC_safe_push (deferred_access_check
, gc
,
253 ptr
->deferred_access_checks
, chk
);
260 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
261 is the BINFO indicating the qualifying scope used to access the
262 DECL node stored in the TREE_VALUE of the node. */
265 perform_access_checks (VEC (deferred_access_check
,gc
)* checks
)
268 deferred_access_check
*chk
;
273 for (i
= 0 ; VEC_iterate (deferred_access_check
, checks
, i
, chk
) ; ++i
)
274 enforce_access (chk
->binfo
, chk
->decl
, chk
->diag_decl
);
277 /* Perform the deferred access checks.
279 After performing the checks, we still have to keep the list
280 `deferred_access_stack->deferred_access_checks' since we may want
281 to check access for them again later in a different context.
288 A::X A::a, x; // No error for `A::a', error for `x'
290 We have to perform deferred access of `A::X', first with `A::a',
294 perform_deferred_access_checks (void)
296 perform_access_checks (get_deferred_access_checks ());
299 /* Defer checking the accessibility of DECL, when looked up in
300 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */
303 perform_or_defer_access_check (tree binfo
, tree decl
, tree diag_decl
)
306 deferred_access
*ptr
;
307 deferred_access_check
*chk
;
308 deferred_access_check
*new_access
;
311 /* Exit if we are in a context that no access checking is performed.
313 if (deferred_access_no_check
)
316 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
318 ptr
= VEC_last (deferred_access
, deferred_access_stack
);
320 /* If we are not supposed to defer access checks, just check now. */
321 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
323 enforce_access (binfo
, decl
, diag_decl
);
327 /* See if we are already going to perform this check. */
329 VEC_iterate (deferred_access_check
,
330 ptr
->deferred_access_checks
, i
, chk
) ;
333 if (chk
->decl
== decl
&& chk
->binfo
== binfo
&&
334 chk
->diag_decl
== diag_decl
)
339 /* If not, record the check. */
341 VEC_safe_push (deferred_access_check
, gc
,
342 ptr
->deferred_access_checks
, 0);
343 new_access
->binfo
= binfo
;
344 new_access
->decl
= decl
;
345 new_access
->diag_decl
= diag_decl
;
348 /* Returns nonzero if the current statement is a full expression,
349 i.e. temporaries created during that statement should be destroyed
350 at the end of the statement. */
353 stmts_are_full_exprs_p (void)
355 return current_stmt_tree ()->stmts_are_full_exprs_p
;
358 /* T is a statement. Add it to the statement-tree. This is the C++
359 version. The C/ObjC frontends have a slightly different version of
365 enum tree_code code
= TREE_CODE (t
);
367 if (EXPR_P (t
) && code
!= LABEL_EXPR
)
369 if (!EXPR_HAS_LOCATION (t
))
370 SET_EXPR_LOCATION (t
, input_location
);
372 /* When we expand a statement-tree, we must know whether or not the
373 statements are full-expressions. We record that fact here. */
374 STMT_IS_FULL_EXPR_P (t
) = stmts_are_full_exprs_p ();
377 /* Add T to the statement-tree. Non-side-effect statements need to be
378 recorded during statement expressions. */
379 append_to_statement_list_force (t
, &cur_stmt_list
);
384 /* Returns the stmt_tree (if any) to which statements are currently
385 being added. If there is no active statement-tree, NULL is
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 (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 /* Nonzero if TYPE is an anonymous union or struct type. We have to use a
434 flag for this because "A union for which objects or pointers are
435 declared is not an anonymous union" [class.union]. */
438 anon_aggr_type_p (const_tree node
)
440 return ANON_AGGR_TYPE_P (node
);
443 /* Finish a scope. */
446 do_poplevel (tree stmt_list
)
450 if (stmts_are_full_exprs_p ())
451 block
= poplevel (kept_level_p (), 1, 0);
453 stmt_list
= pop_stmt_list (stmt_list
);
455 if (!processing_template_decl
)
457 stmt_list
= c_build_bind_expr (block
, stmt_list
);
458 /* ??? See c_end_compound_stmt re statement expressions. */
464 /* Begin a new scope. */
467 do_pushlevel (scope_kind sk
)
469 tree ret
= push_stmt_list ();
470 if (stmts_are_full_exprs_p ())
471 begin_scope (sk
, NULL
);
475 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
476 when the current scope is exited. EH_ONLY is true when this is not
477 meant to apply to normal control flow transfer. */
480 push_cleanup (tree decl
, tree cleanup
, bool eh_only
)
482 tree stmt
= build_stmt (CLEANUP_STMT
, NULL
, cleanup
, decl
);
483 CLEANUP_EH_ONLY (stmt
) = eh_only
;
485 CLEANUP_BODY (stmt
) = push_stmt_list ();
488 /* Begin a conditional that might contain a declaration. When generating
489 normal code, we want the declaration to appear before the statement
490 containing the conditional. When generating template code, we want the
491 conditional to be rendered as the raw DECL_EXPR. */
494 begin_cond (tree
*cond_p
)
496 if (processing_template_decl
)
497 *cond_p
= push_stmt_list ();
500 /* Finish such a conditional. */
503 finish_cond (tree
*cond_p
, tree expr
)
505 if (processing_template_decl
)
507 tree cond
= pop_stmt_list (*cond_p
);
508 if (TREE_CODE (cond
) == DECL_EXPR
)
511 check_for_bare_parameter_packs (&expr
);
516 /* If *COND_P specifies a conditional with a declaration, transform the
519 for (; A x = 42;) { }
521 while (true) { A x = 42; if (!x) break; }
522 for (;;) { A x = 42; if (!x) break; }
523 The statement list for BODY will be empty if the conditional did
524 not declare anything. */
527 simplify_loop_decl_cond (tree
*cond_p
, tree body
)
531 if (!TREE_SIDE_EFFECTS (body
))
535 *cond_p
= boolean_true_node
;
537 if_stmt
= begin_if_stmt ();
538 cond
= build_unary_op (TRUTH_NOT_EXPR
, cond
, 0);
539 finish_if_stmt_cond (cond
, if_stmt
);
540 finish_break_stmt ();
541 finish_then_clause (if_stmt
);
542 finish_if_stmt (if_stmt
);
545 /* Finish a goto-statement. */
548 finish_goto_stmt (tree destination
)
550 if (TREE_CODE (destination
) == IDENTIFIER_NODE
)
551 destination
= lookup_label (destination
);
553 /* We warn about unused labels with -Wunused. That means we have to
554 mark the used labels as used. */
555 if (TREE_CODE (destination
) == LABEL_DECL
)
556 TREE_USED (destination
) = 1;
559 /* The DESTINATION is being used as an rvalue. */
560 if (!processing_template_decl
)
561 destination
= decay_conversion (destination
);
562 /* We don't inline calls to functions with computed gotos.
563 Those functions are typically up to some funny business,
564 and may be depending on the labels being at particular
565 addresses, or some such. */
566 DECL_UNINLINABLE (current_function_decl
) = 1;
569 check_goto (destination
);
571 return add_stmt (build_stmt (GOTO_EXPR
, destination
));
574 /* COND is the condition-expression for an if, while, etc.,
575 statement. Convert it to a boolean value, if appropriate. */
578 maybe_convert_cond (tree cond
)
580 /* Empty conditions remain empty. */
584 /* Wait until we instantiate templates before doing conversion. */
585 if (processing_template_decl
)
588 /* Do the conversion. */
589 cond
= convert_from_reference (cond
);
591 if (TREE_CODE (cond
) == MODIFY_EXPR
592 && !TREE_NO_WARNING (cond
)
595 warning (OPT_Wparentheses
,
596 "suggest parentheses around assignment used as truth value");
597 TREE_NO_WARNING (cond
) = 1;
600 return condition_conversion (cond
);
603 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
606 finish_expr_stmt (tree expr
)
610 if (expr
!= NULL_TREE
)
612 if (!processing_template_decl
)
614 if (warn_sequence_point
)
615 verify_sequence_points (expr
);
616 expr
= convert_to_void (expr
, "statement");
618 else if (!type_dependent_expression_p (expr
))
619 convert_to_void (build_non_dependent_expr (expr
), "statement");
621 check_for_bare_parameter_packs (&expr
);
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 (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 (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
));
702 empty_if_body_warning (THEN_CLAUSE (if_stmt
), ELSE_CLAUSE (if_stmt
));
705 /* Begin a while-statement. Returns a newly created WHILE_STMT if
709 begin_while_stmt (void)
712 r
= build_stmt (WHILE_STMT
, NULL_TREE
, NULL_TREE
);
714 WHILE_BODY (r
) = do_pushlevel (sk_block
);
715 begin_cond (&WHILE_COND (r
));
719 /* Process the COND of a while-statement, which may be given by
723 finish_while_stmt_cond (tree cond
, tree while_stmt
)
725 finish_cond (&WHILE_COND (while_stmt
), maybe_convert_cond (cond
));
726 simplify_loop_decl_cond (&WHILE_COND (while_stmt
), WHILE_BODY (while_stmt
));
729 /* Finish a while-statement, which may be given by WHILE_STMT. */
732 finish_while_stmt (tree while_stmt
)
734 WHILE_BODY (while_stmt
) = do_poplevel (WHILE_BODY (while_stmt
));
738 /* Begin a do-statement. Returns a newly created DO_STMT if
744 tree r
= build_stmt (DO_STMT
, NULL_TREE
, NULL_TREE
);
746 DO_BODY (r
) = push_stmt_list ();
750 /* Finish the body of a do-statement, which may be given by DO_STMT. */
753 finish_do_body (tree do_stmt
)
755 tree body
= DO_BODY (do_stmt
) = pop_stmt_list (DO_BODY (do_stmt
));
757 if (TREE_CODE (body
) == STATEMENT_LIST
&& STATEMENT_LIST_TAIL (body
))
758 body
= STATEMENT_LIST_TAIL (body
)->stmt
;
760 if (IS_EMPTY_STMT (body
))
761 warning (OPT_Wempty_body
,
762 "suggest explicit braces around empty body in %<do%> statement");
765 /* Finish a do-statement, which may be given by DO_STMT, and whose
766 COND is as indicated. */
769 finish_do_stmt (tree cond
, tree do_stmt
)
771 cond
= maybe_convert_cond (cond
);
772 DO_COND (do_stmt
) = cond
;
776 /* Finish a return-statement. The EXPRESSION returned, if any, is as
780 finish_return_stmt (tree expr
)
785 expr
= check_return_expr (expr
, &no_warning
);
787 if (flag_openmp
&& !check_omp_return ())
788 return error_mark_node
;
789 if (!processing_template_decl
)
791 if (DECL_DESTRUCTOR_P (current_function_decl
)
792 || (DECL_CONSTRUCTOR_P (current_function_decl
)
793 && targetm
.cxx
.cdtor_returns_this ()))
795 /* Similarly, all destructors must run destructors for
796 base-classes before returning. So, all returns in a
797 destructor get sent to the DTOR_LABEL; finish_function emits
798 code to return a value there. */
799 return finish_goto_stmt (cdtor_label
);
803 r
= build_stmt (RETURN_EXPR
, expr
);
804 TREE_NO_WARNING (r
) |= no_warning
;
805 r
= maybe_cleanup_point_expr_void (r
);
812 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
815 begin_for_stmt (void)
819 r
= build_stmt (FOR_STMT
, NULL_TREE
, NULL_TREE
,
820 NULL_TREE
, NULL_TREE
);
822 if (flag_new_for_scope
> 0)
823 TREE_CHAIN (r
) = do_pushlevel (sk_for
);
825 if (processing_template_decl
)
826 FOR_INIT_STMT (r
) = push_stmt_list ();
831 /* Finish the for-init-statement of a for-statement, which may be
832 given by FOR_STMT. */
835 finish_for_init_stmt (tree for_stmt
)
837 if (processing_template_decl
)
838 FOR_INIT_STMT (for_stmt
) = pop_stmt_list (FOR_INIT_STMT (for_stmt
));
840 FOR_BODY (for_stmt
) = do_pushlevel (sk_block
);
841 begin_cond (&FOR_COND (for_stmt
));
844 /* Finish the COND of a for-statement, which may be given by
848 finish_for_cond (tree cond
, tree for_stmt
)
850 finish_cond (&FOR_COND (for_stmt
), maybe_convert_cond (cond
));
851 simplify_loop_decl_cond (&FOR_COND (for_stmt
), FOR_BODY (for_stmt
));
854 /* Finish the increment-EXPRESSION in a for-statement, which may be
855 given by FOR_STMT. */
858 finish_for_expr (tree expr
, tree for_stmt
)
862 /* If EXPR is an overloaded function, issue an error; there is no
863 context available to use to perform overload resolution. */
864 if (type_unknown_p (expr
))
866 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
867 expr
= error_mark_node
;
869 if (!processing_template_decl
)
871 if (warn_sequence_point
)
872 verify_sequence_points (expr
);
873 expr
= convert_to_void (expr
, "3rd expression in for");
875 else if (!type_dependent_expression_p (expr
))
876 convert_to_void (build_non_dependent_expr (expr
), "3rd expression in for");
877 expr
= maybe_cleanup_point_expr_void (expr
);
878 check_for_bare_parameter_packs (&expr
);
879 FOR_EXPR (for_stmt
) = expr
;
882 /* Finish the body of a for-statement, which may be given by
883 FOR_STMT. The increment-EXPR for the loop must be
887 finish_for_stmt (tree for_stmt
)
889 FOR_BODY (for_stmt
) = do_poplevel (FOR_BODY (for_stmt
));
891 /* Pop the scope for the body of the loop. */
892 if (flag_new_for_scope
> 0)
894 tree scope
= TREE_CHAIN (for_stmt
);
895 TREE_CHAIN (for_stmt
) = NULL
;
896 add_stmt (do_poplevel (scope
));
902 /* Finish a break-statement. */
905 finish_break_stmt (void)
907 return add_stmt (build_stmt (BREAK_STMT
));
910 /* Finish a continue-statement. */
913 finish_continue_stmt (void)
915 return add_stmt (build_stmt (CONTINUE_STMT
));
918 /* Begin a switch-statement. Returns a new SWITCH_STMT if
922 begin_switch_stmt (void)
926 r
= build_stmt (SWITCH_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
928 scope
= do_pushlevel (sk_block
);
929 TREE_CHAIN (r
) = scope
;
930 begin_cond (&SWITCH_STMT_COND (r
));
935 /* Finish the cond of a switch-statement. */
938 finish_switch_cond (tree cond
, tree switch_stmt
)
940 tree orig_type
= NULL
;
941 if (!processing_template_decl
)
945 /* Convert the condition to an integer or enumeration type. */
946 cond
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, cond
, true);
947 if (cond
== NULL_TREE
)
949 error ("switch quantity not an integer");
950 cond
= error_mark_node
;
952 orig_type
= TREE_TYPE (cond
);
953 if (cond
!= error_mark_node
)
957 Integral promotions are performed. */
958 cond
= perform_integral_promotions (cond
);
959 cond
= maybe_cleanup_point_expr (cond
);
962 if (cond
!= error_mark_node
)
964 index
= get_unwidened (cond
, NULL_TREE
);
965 /* We can't strip a conversion from a signed type to an unsigned,
966 because if we did, int_fits_type_p would do the wrong thing
967 when checking case values for being in range,
968 and it's too hard to do the right thing. */
969 if (TYPE_UNSIGNED (TREE_TYPE (cond
))
970 == TYPE_UNSIGNED (TREE_TYPE (index
)))
974 check_for_bare_parameter_packs (&cond
);
975 finish_cond (&SWITCH_STMT_COND (switch_stmt
), cond
);
976 SWITCH_STMT_TYPE (switch_stmt
) = orig_type
;
977 add_stmt (switch_stmt
);
978 push_switch (switch_stmt
);
979 SWITCH_STMT_BODY (switch_stmt
) = push_stmt_list ();
982 /* Finish the body of a switch-statement, which may be given by
983 SWITCH_STMT. The COND to switch on is indicated. */
986 finish_switch_stmt (tree switch_stmt
)
990 SWITCH_STMT_BODY (switch_stmt
) =
991 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt
));
995 scope
= TREE_CHAIN (switch_stmt
);
996 TREE_CHAIN (switch_stmt
) = NULL
;
997 add_stmt (do_poplevel (scope
));
1000 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1004 begin_try_block (void)
1006 tree r
= build_stmt (TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
1008 TRY_STMTS (r
) = push_stmt_list ();
1012 /* Likewise, for a function-try-block. The block returned in
1013 *COMPOUND_STMT is an artificial outer scope, containing the
1014 function-try-block. */
1017 begin_function_try_block (tree
*compound_stmt
)
1020 /* This outer scope does not exist in the C++ standard, but we need
1021 a place to put __FUNCTION__ and similar variables. */
1022 *compound_stmt
= begin_compound_stmt (0);
1023 r
= begin_try_block ();
1024 FN_TRY_BLOCK_P (r
) = 1;
1028 /* Finish a try-block, which may be given by TRY_BLOCK. */
1031 finish_try_block (tree try_block
)
1033 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1034 TRY_HANDLERS (try_block
) = push_stmt_list ();
1037 /* Finish the body of a cleanup try-block, which may be given by
1041 finish_cleanup_try_block (tree try_block
)
1043 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
1046 /* Finish an implicitly generated try-block, with a cleanup is given
1050 finish_cleanup (tree cleanup
, tree try_block
)
1052 TRY_HANDLERS (try_block
) = cleanup
;
1053 CLEANUP_P (try_block
) = 1;
1056 /* Likewise, for a function-try-block. */
1059 finish_function_try_block (tree try_block
)
1061 finish_try_block (try_block
);
1062 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1063 the try block, but moving it inside. */
1064 in_function_try_handler
= 1;
1067 /* Finish a handler-sequence for a try-block, which may be given by
1071 finish_handler_sequence (tree try_block
)
1073 TRY_HANDLERS (try_block
) = pop_stmt_list (TRY_HANDLERS (try_block
));
1074 check_handlers (TRY_HANDLERS (try_block
));
1077 /* Finish the handler-seq for a function-try-block, given by
1078 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1079 begin_function_try_block. */
1082 finish_function_handler_sequence (tree try_block
, tree compound_stmt
)
1084 in_function_try_handler
= 0;
1085 finish_handler_sequence (try_block
);
1086 finish_compound_stmt (compound_stmt
);
1089 /* Begin a handler. Returns a HANDLER if appropriate. */
1092 begin_handler (void)
1096 r
= build_stmt (HANDLER
, NULL_TREE
, NULL_TREE
);
1099 /* Create a binding level for the eh_info and the exception object
1101 HANDLER_BODY (r
) = do_pushlevel (sk_catch
);
1106 /* Finish the handler-parameters for a handler, which may be given by
1107 HANDLER. DECL is the declaration for the catch parameter, or NULL
1108 if this is a `catch (...)' clause. */
1111 finish_handler_parms (tree decl
, tree handler
)
1113 tree type
= NULL_TREE
;
1114 if (processing_template_decl
)
1118 decl
= pushdecl (decl
);
1119 decl
= push_template_decl (decl
);
1120 HANDLER_PARMS (handler
) = decl
;
1121 type
= TREE_TYPE (decl
);
1125 type
= expand_start_catch_block (decl
);
1126 HANDLER_TYPE (handler
) = type
;
1127 if (!processing_template_decl
&& type
)
1128 mark_used (eh_type_info (type
));
1131 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1132 the return value from the matching call to finish_handler_parms. */
1135 finish_handler (tree handler
)
1137 if (!processing_template_decl
)
1138 expand_end_catch_block ();
1139 HANDLER_BODY (handler
) = do_poplevel (HANDLER_BODY (handler
));
1142 /* Begin a compound statement. FLAGS contains some bits that control the
1143 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1144 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1145 block of a function. If BCS_TRY_BLOCK is set, this is the block
1146 created on behalf of a TRY statement. Returns a token to be passed to
1147 finish_compound_stmt. */
1150 begin_compound_stmt (unsigned int flags
)
1154 if (flags
& BCS_NO_SCOPE
)
1156 r
= push_stmt_list ();
1157 STATEMENT_LIST_NO_SCOPE (r
) = 1;
1159 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1160 But, if it's a statement-expression with a scopeless block, there's
1161 nothing to keep, and we don't want to accidentally keep a block
1162 *inside* the scopeless block. */
1163 keep_next_level (false);
1166 r
= do_pushlevel (flags
& BCS_TRY_BLOCK
? sk_try
: sk_block
);
1168 /* When processing a template, we need to remember where the braces were,
1169 so that we can set up identical scopes when instantiating the template
1170 later. BIND_EXPR is a handy candidate for this.
1171 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1172 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1173 processing templates. */
1174 if (processing_template_decl
)
1176 r
= build3 (BIND_EXPR
, NULL
, NULL
, r
, NULL
);
1177 BIND_EXPR_TRY_BLOCK (r
) = (flags
& BCS_TRY_BLOCK
) != 0;
1178 BIND_EXPR_BODY_BLOCK (r
) = (flags
& BCS_FN_BODY
) != 0;
1179 TREE_SIDE_EFFECTS (r
) = 1;
1185 /* Finish a compound-statement, which is given by STMT. */
1188 finish_compound_stmt (tree stmt
)
1190 if (TREE_CODE (stmt
) == BIND_EXPR
)
1191 BIND_EXPR_BODY (stmt
) = do_poplevel (BIND_EXPR_BODY (stmt
));
1192 else if (STATEMENT_LIST_NO_SCOPE (stmt
))
1193 stmt
= pop_stmt_list (stmt
);
1196 /* Destroy any ObjC "super" receivers that may have been
1198 objc_clear_super_receiver ();
1200 stmt
= do_poplevel (stmt
);
1203 /* ??? See c_end_compound_stmt wrt statement expressions. */
1208 /* Finish an asm-statement, whose components are a STRING, some
1209 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1210 whether the asm-statement should be considered volatile. */
1213 finish_asm_stmt (int volatile_p
, tree string
, tree output_operands
,
1214 tree input_operands
, tree clobbers
)
1218 int ninputs
= list_length (input_operands
);
1219 int noutputs
= list_length (output_operands
);
1221 if (!processing_template_decl
)
1223 const char *constraint
;
1224 const char **oconstraints
;
1225 bool allows_mem
, allows_reg
, is_inout
;
1229 oconstraints
= (const char **) alloca (noutputs
* sizeof (char *));
1231 string
= resolve_asm_operand_names (string
, output_operands
,
1234 for (i
= 0, t
= output_operands
; t
; t
= TREE_CHAIN (t
), ++i
)
1236 operand
= TREE_VALUE (t
);
1238 /* ??? Really, this should not be here. Users should be using a
1239 proper lvalue, dammit. But there's a long history of using
1240 casts in the output operands. In cases like longlong.h, this
1241 becomes a primitive form of typechecking -- if the cast can be
1242 removed, then the output operand had a type of the proper width;
1243 otherwise we'll get an error. Gross, but ... */
1244 STRIP_NOPS (operand
);
1246 if (!lvalue_or_else (operand
, lv_asm
))
1247 operand
= error_mark_node
;
1249 if (operand
!= error_mark_node
1250 && (TREE_READONLY (operand
)
1251 || CP_TYPE_CONST_P (TREE_TYPE (operand
))
1252 /* Functions are not modifiable, even though they are
1254 || TREE_CODE (TREE_TYPE (operand
)) == FUNCTION_TYPE
1255 || TREE_CODE (TREE_TYPE (operand
)) == METHOD_TYPE
1256 /* If it's an aggregate and any field is const, then it is
1257 effectively const. */
1258 || (CLASS_TYPE_P (TREE_TYPE (operand
))
1259 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand
)))))
1260 readonly_error (operand
, "assignment (via 'asm' output)");
1262 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1263 oconstraints
[i
] = constraint
;
1265 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
1266 &allows_mem
, &allows_reg
, &is_inout
))
1268 /* If the operand is going to end up in memory,
1269 mark it addressable. */
1270 if (!allows_reg
&& !cxx_mark_addressable (operand
))
1271 operand
= error_mark_node
;
1274 operand
= error_mark_node
;
1276 TREE_VALUE (t
) = operand
;
1279 for (i
= 0, t
= input_operands
; t
; ++i
, t
= TREE_CHAIN (t
))
1281 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1282 operand
= decay_conversion (TREE_VALUE (t
));
1284 /* If the type of the operand hasn't been determined (e.g.,
1285 because it involves an overloaded function), then issue
1286 an error message. There's no context available to
1287 resolve the overloading. */
1288 if (TREE_TYPE (operand
) == unknown_type_node
)
1290 error ("type of asm operand %qE could not be determined",
1292 operand
= error_mark_node
;
1295 if (parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
1296 oconstraints
, &allows_mem
, &allows_reg
))
1298 /* If the operand is going to end up in memory,
1299 mark it addressable. */
1300 if (!allows_reg
&& allows_mem
)
1302 /* Strip the nops as we allow this case. FIXME, this really
1303 should be rejected or made deprecated. */
1304 STRIP_NOPS (operand
);
1305 if (!cxx_mark_addressable (operand
))
1306 operand
= error_mark_node
;
1310 operand
= error_mark_node
;
1312 TREE_VALUE (t
) = operand
;
1316 r
= build_stmt (ASM_EXPR
, string
,
1317 output_operands
, input_operands
,
1319 ASM_VOLATILE_P (r
) = volatile_p
|| noutputs
== 0;
1320 r
= maybe_cleanup_point_expr_void (r
);
1321 return add_stmt (r
);
1324 /* Finish a label with the indicated NAME. */
1327 finish_label_stmt (tree name
)
1329 tree decl
= define_label (input_location
, name
);
1331 if (decl
== error_mark_node
)
1332 return error_mark_node
;
1334 return add_stmt (build_stmt (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
));
1395 add_stmt (build_min_nt (CTOR_INITIALIZER
, mem_inits
));
1398 emit_mem_initializers (mem_inits
);
1401 /* Finish a parenthesized expression EXPR. */
1404 finish_parenthesized_expr (tree expr
)
1407 /* This inhibits warnings in c_common_truthvalue_conversion. */
1408 TREE_NO_WARNING (expr
) = 1;
1410 if (TREE_CODE (expr
) == OFFSET_REF
)
1411 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1412 enclosed in parentheses. */
1413 PTRMEM_OK_P (expr
) = 0;
1415 if (TREE_CODE (expr
) == STRING_CST
)
1416 PAREN_STRING_LITERAL_P (expr
) = 1;
1421 /* Finish a reference to a non-static data member (DECL) that is not
1422 preceded by `.' or `->'. */
1425 finish_non_static_data_member (tree decl
, tree object
, tree qualifying_scope
)
1427 gcc_assert (TREE_CODE (decl
) == FIELD_DECL
);
1431 if (current_function_decl
1432 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1433 error ("invalid use of member %q+D in static member function", decl
);
1435 error ("invalid use of non-static data member %q+D", decl
);
1436 error ("from this location");
1438 return error_mark_node
;
1440 TREE_USED (current_class_ptr
) = 1;
1441 if (processing_template_decl
&& !qualifying_scope
)
1443 tree type
= TREE_TYPE (decl
);
1445 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1446 type
= TREE_TYPE (type
);
1449 /* Set the cv qualifiers. */
1450 int quals
= cp_type_quals (TREE_TYPE (current_class_ref
));
1452 if (DECL_MUTABLE_P (decl
))
1453 quals
&= ~TYPE_QUAL_CONST
;
1455 quals
|= cp_type_quals (TREE_TYPE (decl
));
1456 type
= cp_build_qualified_type (type
, quals
);
1459 return build_min (COMPONENT_REF
, type
, object
, decl
, NULL_TREE
);
1463 tree access_type
= TREE_TYPE (object
);
1464 tree lookup_context
= context_for_name_lookup (decl
);
1466 while (!DERIVED_FROM_P (lookup_context
, access_type
))
1468 access_type
= TYPE_CONTEXT (access_type
);
1469 while (access_type
&& DECL_P (access_type
))
1470 access_type
= DECL_CONTEXT (access_type
);
1474 error ("object missing in reference to %q+D", decl
);
1475 error ("from this location");
1476 return error_mark_node
;
1480 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1481 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1483 if (processing_template_decl
)
1484 return build_qualified_name (TREE_TYPE (decl
),
1487 /*template_p=*/false);
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);
1507 /* DECL was the declaration to which a qualified-id resolved. Issue
1508 an error message if it is not accessible. If OBJECT_TYPE is
1509 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1510 type of `*x', or `x', respectively. If the DECL was named as
1511 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1514 check_accessibility_of_qualified_id (tree decl
,
1516 tree nested_name_specifier
)
1519 tree qualifying_type
= NULL_TREE
;
1521 /* If we're not checking, return immediately. */
1522 if (deferred_access_no_check
)
1525 /* Determine the SCOPE of DECL. */
1526 scope
= context_for_name_lookup (decl
);
1527 /* If the SCOPE is not a type, then DECL is not a member. */
1528 if (!TYPE_P (scope
))
1530 /* Compute the scope through which DECL is being accessed. */
1532 /* OBJECT_TYPE might not be a class type; consider:
1534 class A { typedef int I; };
1538 In this case, we will have "A::I" as the DECL, but "I" as the
1540 && CLASS_TYPE_P (object_type
)
1541 && DERIVED_FROM_P (scope
, object_type
))
1542 /* If we are processing a `->' or `.' expression, use the type of the
1544 qualifying_type
= object_type
;
1545 else if (nested_name_specifier
)
1547 /* If the reference is to a non-static member of the
1548 current class, treat it as if it were referenced through
1550 if (DECL_NONSTATIC_MEMBER_P (decl
)
1551 && current_class_ptr
1552 && DERIVED_FROM_P (scope
, current_class_type
))
1553 qualifying_type
= current_class_type
;
1554 /* Otherwise, use the type indicated by the
1555 nested-name-specifier. */
1557 qualifying_type
= nested_name_specifier
;
1560 /* Otherwise, the name must be from the current class or one of
1562 qualifying_type
= currently_open_derived_class (scope
);
1565 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1566 or similar in a default argument value. */
1567 && CLASS_TYPE_P (qualifying_type
)
1568 && !dependent_type_p (qualifying_type
))
1569 perform_or_defer_access_check (TYPE_BINFO (qualifying_type
), decl
,
1573 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1574 class named to the left of the "::" operator. DONE is true if this
1575 expression is a complete postfix-expression; it is false if this
1576 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1577 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1578 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1579 is true iff this qualified name appears as a template argument. */
1582 finish_qualified_id_expr (tree qualifying_class
,
1587 bool template_arg_p
)
1589 gcc_assert (TYPE_P (qualifying_class
));
1591 if (error_operand_p (expr
))
1592 return error_mark_node
;
1594 if (DECL_P (expr
) || BASELINK_P (expr
))
1598 check_template_keyword (expr
);
1600 /* If EXPR occurs as the operand of '&', use special handling that
1601 permits a pointer-to-member. */
1602 if (address_p
&& done
)
1604 if (TREE_CODE (expr
) == SCOPE_REF
)
1605 expr
= TREE_OPERAND (expr
, 1);
1606 expr
= build_offset_ref (qualifying_class
, expr
,
1607 /*address_p=*/true);
1611 /* Within the scope of a class, turn references to non-static
1612 members into expression of the form "this->...". */
1614 /* But, within a template argument, we do not want make the
1615 transformation, as there is no "this" pointer. */
1617 else if (TREE_CODE (expr
) == FIELD_DECL
)
1618 expr
= finish_non_static_data_member (expr
, current_class_ref
,
1620 else if (BASELINK_P (expr
) && !processing_template_decl
)
1624 /* See if any of the functions are non-static members. */
1625 fns
= BASELINK_FUNCTIONS (expr
);
1626 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
1627 fns
= TREE_OPERAND (fns
, 0);
1628 /* If so, the expression may be relative to the current
1630 if (!shared_member_p (fns
)
1631 && current_class_type
1632 && DERIVED_FROM_P (qualifying_class
, current_class_type
))
1633 expr
= (build_class_member_access_expr
1634 (maybe_dummy_object (qualifying_class
, NULL
),
1636 BASELINK_ACCESS_BINFO (expr
),
1637 /*preserve_reference=*/false));
1639 /* The expression is a qualified name whose address is not
1641 expr
= build_offset_ref (qualifying_class
, expr
, /*address_p=*/false);
1647 /* Begin a statement-expression. The value returned must be passed to
1648 finish_stmt_expr. */
1651 begin_stmt_expr (void)
1653 return push_stmt_list ();
1656 /* Process the final expression of a statement expression. EXPR can be
1657 NULL, if the final expression is empty. Return a STATEMENT_LIST
1658 containing all the statements in the statement-expression, or
1659 ERROR_MARK_NODE if there was an error. */
1662 finish_stmt_expr_expr (tree expr
, tree stmt_expr
)
1664 if (error_operand_p (expr
))
1666 /* The type of the statement-expression is the type of the last
1668 TREE_TYPE (stmt_expr
) = error_mark_node
;
1669 return error_mark_node
;
1672 /* If the last statement does not have "void" type, then the value
1673 of the last statement is the value of the entire expression. */
1676 tree type
= TREE_TYPE (expr
);
1678 if (processing_template_decl
)
1680 expr
= build_stmt (EXPR_STMT
, expr
);
1681 expr
= add_stmt (expr
);
1682 /* Mark the last statement so that we can recognize it as such at
1683 template-instantiation time. */
1684 EXPR_STMT_STMT_EXPR_RESULT (expr
) = 1;
1686 else if (VOID_TYPE_P (type
))
1688 /* Just treat this like an ordinary statement. */
1689 expr
= finish_expr_stmt (expr
);
1693 /* It actually has a value we need to deal with. First, force it
1694 to be an rvalue so that we won't need to build up a copy
1695 constructor call later when we try to assign it to something. */
1696 expr
= force_rvalue (expr
);
1697 if (error_operand_p (expr
))
1698 return error_mark_node
;
1700 /* Update for array-to-pointer decay. */
1701 type
= TREE_TYPE (expr
);
1703 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1704 normal statement, but don't convert to void or actually add
1706 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
1707 expr
= maybe_cleanup_point_expr (expr
);
1711 /* The type of the statement-expression is the type of the last
1713 TREE_TYPE (stmt_expr
) = type
;
1719 /* Finish a statement-expression. EXPR should be the value returned
1720 by the previous begin_stmt_expr. Returns an expression
1721 representing the statement-expression. */
1724 finish_stmt_expr (tree stmt_expr
, bool has_no_scope
)
1729 if (error_operand_p (stmt_expr
))
1730 return error_mark_node
;
1732 gcc_assert (TREE_CODE (stmt_expr
) == STATEMENT_LIST
);
1734 type
= TREE_TYPE (stmt_expr
);
1735 result
= pop_stmt_list (stmt_expr
);
1736 TREE_TYPE (result
) = type
;
1738 if (processing_template_decl
)
1740 result
= build_min (STMT_EXPR
, type
, result
);
1741 TREE_SIDE_EFFECTS (result
) = 1;
1742 STMT_EXPR_NO_SCOPE (result
) = has_no_scope
;
1744 else if (CLASS_TYPE_P (type
))
1746 /* Wrap the statement-expression in a TARGET_EXPR so that the
1747 temporary object created by the final expression is destroyed at
1748 the end of the full-expression containing the
1749 statement-expression. */
1750 result
= force_target_expr (type
, result
);
1756 /* Returns the expression which provides the value of STMT_EXPR. */
1759 stmt_expr_value_expr (tree stmt_expr
)
1761 tree t
= STMT_EXPR_STMT (stmt_expr
);
1763 if (TREE_CODE (t
) == BIND_EXPR
)
1764 t
= BIND_EXPR_BODY (t
);
1766 if (TREE_CODE (t
) == STATEMENT_LIST
)
1767 t
= STATEMENT_LIST_TAIL (t
)->stmt
;
1769 if (TREE_CODE (t
) == EXPR_STMT
)
1770 t
= EXPR_STMT_EXPR (t
);
1775 /* Perform Koenig lookup. FN is the postfix-expression representing
1776 the function (or functions) to call; ARGS are the arguments to the
1777 call. Returns the functions to be considered by overload
1781 perform_koenig_lookup (tree fn
, tree args
)
1783 tree identifier
= NULL_TREE
;
1784 tree functions
= NULL_TREE
;
1786 /* Find the name of the overloaded function. */
1787 if (TREE_CODE (fn
) == IDENTIFIER_NODE
)
1789 else if (is_overloaded_fn (fn
))
1792 identifier
= DECL_NAME (get_first_fn (functions
));
1794 else if (DECL_P (fn
))
1797 identifier
= DECL_NAME (fn
);
1800 /* A call to a namespace-scope function using an unqualified name.
1802 Do Koenig lookup -- unless any of the arguments are
1804 if (!any_type_dependent_arguments_p (args
))
1806 fn
= lookup_arg_dependent (identifier
, functions
, args
);
1808 /* The unqualified name could not be resolved. */
1809 fn
= unqualified_fn_lookup_error (identifier
);
1815 /* Generate an expression for `FN (ARGS)'.
1817 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1818 as a virtual call, even if FN is virtual. (This flag is set when
1819 encountering an expression where the function name is explicitly
1820 qualified. For example a call to `X::f' never generates a virtual
1823 Returns code for the call. */
1826 finish_call_expr (tree fn
, tree args
, bool disallow_virtual
, bool koenig_p
)
1832 if (fn
== error_mark_node
|| args
== error_mark_node
)
1833 return error_mark_node
;
1835 /* ARGS should be a list of arguments. */
1836 gcc_assert (!args
|| TREE_CODE (args
) == TREE_LIST
);
1837 gcc_assert (!TYPE_P (fn
));
1842 if (processing_template_decl
)
1844 if (type_dependent_expression_p (fn
)
1845 || any_type_dependent_arguments_p (args
))
1847 result
= build_nt_call_list (fn
, args
);
1848 KOENIG_LOOKUP_P (result
) = koenig_p
;
1853 tree fndecl
= OVL_CURRENT (fn
);
1854 if (TREE_CODE (fndecl
) != FUNCTION_DECL
1855 || !TREE_THIS_VOLATILE (fndecl
))
1861 current_function_returns_abnormally
= 1;
1865 if (!BASELINK_P (fn
)
1866 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
1867 && TREE_TYPE (fn
) != unknown_type_node
)
1868 fn
= build_non_dependent_expr (fn
);
1869 args
= build_non_dependent_args (orig_args
);
1872 if (is_overloaded_fn (fn
))
1873 fn
= baselink_for_fns (fn
);
1876 if (BASELINK_P (fn
))
1880 /* A call to a member function. From [over.call.func]:
1882 If the keyword this is in scope and refers to the class of
1883 that member function, or a derived class thereof, then the
1884 function call is transformed into a qualified function call
1885 using (*this) as the postfix-expression to the left of the
1886 . operator.... [Otherwise] a contrived object of type T
1887 becomes the implied object argument.
1889 This paragraph is unclear about this situation:
1891 struct A { void f(); };
1892 struct B : public A {};
1893 struct C : public A { void g() { B::f(); }};
1895 In particular, for `B::f', this paragraph does not make clear
1896 whether "the class of that member function" refers to `A' or
1897 to `B'. We believe it refers to `B'. */
1898 if (current_class_type
1899 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
1901 && current_class_ref
)
1902 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
1906 tree representative_fn
;
1908 representative_fn
= BASELINK_FUNCTIONS (fn
);
1909 if (TREE_CODE (representative_fn
) == TEMPLATE_ID_EXPR
)
1910 representative_fn
= TREE_OPERAND (representative_fn
, 0);
1911 representative_fn
= get_first_fn (representative_fn
);
1912 object
= build_dummy_object (DECL_CONTEXT (representative_fn
));
1915 if (processing_template_decl
)
1917 if (type_dependent_expression_p (object
))
1918 return build_nt_call_list (orig_fn
, orig_args
);
1919 object
= build_non_dependent_expr (object
);
1922 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
1924 ? LOOKUP_NONVIRTUAL
: 0),
1927 else if (is_overloaded_fn (fn
))
1929 /* If the function is an overloaded builtin, resolve it. */
1930 if (TREE_CODE (fn
) == FUNCTION_DECL
1931 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
1932 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
1933 result
= resolve_overloaded_builtin (fn
, args
);
1936 /* A call to a namespace-scope function. */
1937 result
= build_new_function_call (fn
, args
, koenig_p
);
1939 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
1942 error ("arguments to destructor are not allowed");
1943 /* Mark the pseudo-destructor call as having side-effects so
1944 that we do not issue warnings about its use. */
1945 result
= build1 (NOP_EXPR
,
1947 TREE_OPERAND (fn
, 0));
1948 TREE_SIDE_EFFECTS (result
) = 1;
1950 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
1951 /* If the "function" is really an object of class type, it might
1952 have an overloaded `operator ()'. */
1953 result
= build_new_op (CALL_EXPR
, LOOKUP_NORMAL
, fn
, args
, NULL_TREE
,
1954 /*overloaded_p=*/NULL
);
1957 /* A call where the function is unknown. */
1958 result
= build_function_call (fn
, args
);
1960 if (processing_template_decl
)
1962 result
= build_call_list (TREE_TYPE (result
), orig_fn
, orig_args
);
1963 KOENIG_LOOKUP_P (result
) = koenig_p
;
1968 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1969 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1970 POSTDECREMENT_EXPR.) */
1973 finish_increment_expr (tree expr
, enum tree_code code
)
1975 return build_x_unary_op (code
, expr
);
1978 /* Finish a use of `this'. Returns an expression for `this'. */
1981 finish_this_expr (void)
1985 if (current_class_ptr
)
1987 result
= current_class_ptr
;
1989 else if (current_function_decl
1990 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1992 error ("%<this%> is unavailable for static member functions");
1993 result
= error_mark_node
;
1997 if (current_function_decl
)
1998 error ("invalid use of %<this%> in non-member function");
2000 error ("invalid use of %<this%> at top level");
2001 result
= error_mark_node
;
2007 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2008 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2009 the TYPE for the type given. If SCOPE is non-NULL, the expression
2010 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2013 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
)
2015 if (object
== error_mark_node
|| destructor
== error_mark_node
)
2016 return error_mark_node
;
2018 gcc_assert (TYPE_P (destructor
));
2020 if (!processing_template_decl
)
2022 if (scope
== error_mark_node
)
2024 error ("invalid qualifying scope in pseudo-destructor name");
2025 return error_mark_node
;
2027 if (scope
&& TYPE_P (scope
) && !check_dtor_name (scope
, destructor
))
2029 error ("qualified type %qT does not match destructor name ~%qT",
2031 return error_mark_node
;
2035 /* [expr.pseudo] says both:
2037 The type designated by the pseudo-destructor-name shall be
2038 the same as the object type.
2042 The cv-unqualified versions of the object type and of the
2043 type designated by the pseudo-destructor-name shall be the
2046 We implement the more generous second sentence, since that is
2047 what most other compilers do. */
2048 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
2051 error ("%qE is not of type %qT", object
, destructor
);
2052 return error_mark_node
;
2056 return build3 (PSEUDO_DTOR_EXPR
, void_type_node
, object
, scope
, destructor
);
2059 /* Finish an expression of the form CODE EXPR. */
2062 finish_unary_op_expr (enum tree_code code
, tree expr
)
2064 tree result
= build_x_unary_op (code
, expr
);
2065 /* Inside a template, build_x_unary_op does not fold the
2066 expression. So check whether the result is folded before
2067 setting TREE_NEGATED_INT. */
2068 if (code
== NEGATE_EXPR
&& TREE_CODE (expr
) == INTEGER_CST
2069 && TREE_CODE (result
) == INTEGER_CST
2070 && !TYPE_UNSIGNED (TREE_TYPE (result
))
2071 && INT_CST_LT (result
, integer_zero_node
))
2073 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2074 setting TREE_NEGATED_INT. */
2075 result
= copy_node (result
);
2076 TREE_NEGATED_INT (result
) = 1;
2078 if (TREE_OVERFLOW_P (result
) && !TREE_OVERFLOW_P (expr
))
2079 overflow_warning (result
);
2084 /* Finish a compound-literal expression. TYPE is the type to which
2085 the INITIALIZER_LIST is being cast. */
2088 finish_compound_literal (tree type
, VEC(constructor_elt
,gc
) *initializer_list
)
2091 tree compound_literal
;
2093 if (!TYPE_OBJ_P (type
))
2095 error ("compound literal of non-object type %qT", type
);
2096 return error_mark_node
;
2099 /* Build a CONSTRUCTOR for the INITIALIZER_LIST. */
2100 compound_literal
= build_constructor (NULL_TREE
, initializer_list
);
2101 if (processing_template_decl
)
2103 TREE_TYPE (compound_literal
) = type
;
2104 /* Mark the expression as a compound literal. */
2105 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2106 return compound_literal
;
2109 /* Create a temporary variable to represent the compound literal. */
2110 var
= create_temporary_var (type
);
2111 if (!current_function_decl
)
2113 /* If this compound-literal appears outside of a function, then
2114 the corresponding variable has static storage duration, just
2115 like the variable in whose initializer it appears. */
2116 TREE_STATIC (var
) = 1;
2117 /* The variable has internal linkage, since there is no need to
2118 reference it from another translation unit. */
2119 TREE_PUBLIC (var
) = 0;
2120 /* It must have a name, so that the name mangler can mangle it. */
2121 DECL_NAME (var
) = make_anon_name ();
2123 /* We must call pushdecl, since the gimplifier complains if the
2124 variable has not been declared via a BIND_EXPR. */
2126 /* Initialize the variable as we would any other variable with a
2127 brace-enclosed initializer. */
2128 cp_finish_decl (var
, compound_literal
,
2129 /*init_const_expr_p=*/false,
2130 /*asmspec_tree=*/NULL_TREE
,
2131 LOOKUP_ONLYCONVERTING
);
2135 /* Return the declaration for the function-name variable indicated by
2139 finish_fname (tree id
)
2143 decl
= fname_decl (C_RID_CODE (id
), id
);
2144 if (processing_template_decl
)
2145 decl
= DECL_NAME (decl
);
2149 /* Finish a translation unit. */
2152 finish_translation_unit (void)
2154 /* In case there were missing closebraces,
2155 get us back to the global binding level. */
2157 while (current_namespace
!= global_namespace
)
2160 /* Do file scope __FUNCTION__ et al. */
2161 finish_fname_decls ();
2164 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2165 Returns the parameter. */
2168 finish_template_type_parm (tree aggr
, tree identifier
)
2170 if (aggr
!= class_type_node
)
2172 pedwarn ("template type parameters must use the keyword %<class%> or %<typename%>");
2173 aggr
= class_type_node
;
2176 return build_tree_list (aggr
, identifier
);
2179 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2180 Returns the parameter. */
2183 finish_template_template_parm (tree aggr
, tree identifier
)
2185 tree decl
= build_decl (TYPE_DECL
, identifier
, NULL_TREE
);
2186 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2187 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2188 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2189 DECL_ARTIFICIAL (decl
) = 1;
2190 end_template_decl ();
2192 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2194 return finish_template_type_parm (aggr
, tmpl
);
2197 /* ARGUMENT is the default-argument value for a template template
2198 parameter. If ARGUMENT is invalid, issue error messages and return
2199 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2202 check_template_template_default_arg (tree argument
)
2204 if (TREE_CODE (argument
) != TEMPLATE_DECL
2205 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2206 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2208 if (TREE_CODE (argument
) == TYPE_DECL
)
2209 error ("invalid use of type %qT as a default value for a template "
2210 "template-parameter", TREE_TYPE (argument
));
2212 error ("invalid default argument for a template template parameter");
2213 return error_mark_node
;
2219 /* Begin a class definition, as indicated by T. */
2222 begin_class_definition (tree t
, tree attributes
)
2224 if (t
== error_mark_node
)
2225 return error_mark_node
;
2227 if (processing_template_parmlist
)
2229 error ("definition of %q#T inside template parameter list", t
);
2230 return error_mark_node
;
2232 /* A non-implicit typename comes from code like:
2234 template <typename T> struct A {
2235 template <typename U> struct A<T>::B ...
2237 This is erroneous. */
2238 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2240 error ("invalid definition of qualified type %qT", t
);
2241 t
= error_mark_node
;
2244 if (t
== error_mark_node
|| ! IS_AGGR_TYPE (t
))
2246 t
= make_aggr_type (RECORD_TYPE
);
2247 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
2250 /* Update the location of the decl. */
2251 DECL_SOURCE_LOCATION (TYPE_NAME (t
)) = input_location
;
2253 if (TYPE_BEING_DEFINED (t
))
2255 t
= make_aggr_type (TREE_CODE (t
));
2256 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
2258 maybe_process_partial_specialization (t
);
2260 TYPE_BEING_DEFINED (t
) = 1;
2262 cplus_decl_attributes (&t
, attributes
, (int) ATTR_FLAG_TYPE_IN_PLACE
);
2264 if (flag_pack_struct
)
2267 TYPE_PACKED (t
) = 1;
2268 /* Even though the type is being defined for the first time
2269 here, there might have been a forward declaration, so there
2270 might be cv-qualified variants of T. */
2271 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
2272 TYPE_PACKED (v
) = 1;
2274 /* Reset the interface data, at the earliest possible
2275 moment, as it might have been set via a class foo;
2277 if (! TYPE_ANONYMOUS_P (t
))
2279 struct c_fileinfo
*finfo
= get_fileinfo (input_filename
);
2280 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
2281 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2282 (t
, finfo
->interface_unknown
);
2284 reset_specialization();
2286 /* Make a declaration for this class in its own scope. */
2287 build_self_reference ();
2292 /* Finish the member declaration given by DECL. */
2295 finish_member_declaration (tree decl
)
2297 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
2300 if (decl
== void_type_node
)
2301 /* The COMPONENT was a friend, not a member, and so there's
2302 nothing for us to do. */
2305 /* We should see only one DECL at a time. */
2306 gcc_assert (TREE_CHAIN (decl
) == NULL_TREE
);
2308 /* Set up access control for DECL. */
2310 = (current_access_specifier
== access_private_node
);
2311 TREE_PROTECTED (decl
)
2312 = (current_access_specifier
== access_protected_node
);
2313 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2315 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
2316 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
2319 /* Mark the DECL as a member of the current class. */
2320 DECL_CONTEXT (decl
) = current_class_type
;
2322 /* Check for bare parameter packs in the member variable declaration. */
2323 if (TREE_CODE (decl
) == FIELD_DECL
)
2324 check_for_bare_parameter_packs (&TREE_TYPE (decl
));
2328 A C language linkage is ignored for the names of class members
2329 and the member function type of class member functions. */
2330 if (DECL_LANG_SPECIFIC (decl
) && DECL_LANGUAGE (decl
) == lang_c
)
2331 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
2333 /* Put functions on the TYPE_METHODS list and everything else on the
2334 TYPE_FIELDS list. Note that these are built up in reverse order.
2335 We reverse them (to obtain declaration order) in finish_struct. */
2336 if (TREE_CODE (decl
) == FUNCTION_DECL
2337 || DECL_FUNCTION_TEMPLATE_P (decl
))
2339 /* We also need to add this function to the
2340 CLASSTYPE_METHOD_VEC. */
2341 if (add_method (current_class_type
, decl
, NULL_TREE
))
2343 TREE_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
2344 TYPE_METHODS (current_class_type
) = decl
;
2346 maybe_add_class_template_decl_list (current_class_type
, decl
,
2350 /* Enter the DECL into the scope of the class. */
2351 else if ((TREE_CODE (decl
) == USING_DECL
&& !DECL_DEPENDENT_P (decl
))
2352 || pushdecl_class_level (decl
))
2354 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2355 go at the beginning. The reason is that lookup_field_1
2356 searches the list in order, and we want a field name to
2357 override a type name so that the "struct stat hack" will
2358 work. In particular:
2360 struct S { enum E { }; int E } s;
2363 is valid. In addition, the FIELD_DECLs must be maintained in
2364 declaration order so that class layout works as expected.
2365 However, we don't need that order until class layout, so we
2366 save a little time by putting FIELD_DECLs on in reverse order
2367 here, and then reversing them in finish_struct_1. (We could
2368 also keep a pointer to the correct insertion points in the
2371 if (TREE_CODE (decl
) == TYPE_DECL
)
2372 TYPE_FIELDS (current_class_type
)
2373 = chainon (TYPE_FIELDS (current_class_type
), decl
);
2376 TREE_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
2377 TYPE_FIELDS (current_class_type
) = decl
;
2380 maybe_add_class_template_decl_list (current_class_type
, decl
,
2385 note_decl_for_pch (decl
);
2388 /* DECL has been declared while we are building a PCH file. Perform
2389 actions that we might normally undertake lazily, but which can be
2390 performed now so that they do not have to be performed in
2391 translation units which include the PCH file. */
2394 note_decl_for_pch (tree decl
)
2396 gcc_assert (pch_file
);
2398 /* There's a good chance that we'll have to mangle names at some
2399 point, even if only for emission in debugging information. */
2400 if ((TREE_CODE (decl
) == VAR_DECL
2401 || TREE_CODE (decl
) == FUNCTION_DECL
)
2402 && !processing_template_decl
)
2406 /* Finish processing a complete template declaration. The PARMS are
2407 the template parameters. */
2410 finish_template_decl (tree parms
)
2413 end_template_decl ();
2415 end_specialization ();
2418 /* Finish processing a template-id (which names a type) of the form
2419 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2420 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2421 the scope of template-id indicated. */
2424 finish_template_type (tree name
, tree args
, int entering_scope
)
2428 decl
= lookup_template_class (name
, args
,
2429 NULL_TREE
, NULL_TREE
, entering_scope
,
2430 tf_warning_or_error
| tf_user
);
2431 if (decl
!= error_mark_node
)
2432 decl
= TYPE_STUB_DECL (decl
);
2437 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2438 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2439 BASE_CLASS, or NULL_TREE if an error occurred. The
2440 ACCESS_SPECIFIER is one of
2441 access_{default,public,protected_private}_node. For a virtual base
2442 we set TREE_TYPE. */
2445 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
2449 if (base
== error_mark_node
)
2451 error ("invalid base-class specification");
2454 else if (! is_aggr_type (base
, 1))
2458 if (cp_type_quals (base
) != 0)
2460 error ("base class %qT has cv qualifiers", base
);
2461 base
= TYPE_MAIN_VARIANT (base
);
2463 result
= build_tree_list (access
, base
);
2465 TREE_TYPE (result
) = integer_type_node
;
2471 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2472 what we found when we tried to do the lookup. */
2475 qualified_name_lookup_error (tree scope
, tree name
, tree decl
)
2477 if (scope
== error_mark_node
)
2478 ; /* We already complained. */
2479 else if (TYPE_P (scope
))
2481 if (!COMPLETE_TYPE_P (scope
))
2482 error ("incomplete type %qT used in nested name specifier", scope
);
2483 else if (TREE_CODE (decl
) == TREE_LIST
)
2485 error ("reference to %<%T::%D%> is ambiguous", scope
, name
);
2486 print_candidates (decl
);
2489 error ("%qD is not a member of %qT", name
, scope
);
2491 else if (scope
!= global_namespace
)
2492 error ("%qD is not a member of %qD", name
, scope
);
2494 error ("%<::%D%> has not been declared", name
);
2497 /* If FNS is a member function, a set of member functions, or a
2498 template-id referring to one or more member functions, return a
2499 BASELINK for FNS, incorporating the current access context.
2500 Otherwise, return FNS unchanged. */
2503 baselink_for_fns (tree fns
)
2508 if (BASELINK_P (fns
)
2509 || error_operand_p (fns
))
2513 if (TREE_CODE (fn
) == TEMPLATE_ID_EXPR
)
2514 fn
= TREE_OPERAND (fn
, 0);
2515 fn
= get_first_fn (fn
);
2516 if (!DECL_FUNCTION_MEMBER_P (fn
))
2519 cl
= currently_open_derived_class (DECL_CONTEXT (fn
));
2521 cl
= DECL_CONTEXT (fn
);
2522 cl
= TYPE_BINFO (cl
);
2523 return build_baselink (cl
, cl
, fns
, /*optype=*/NULL_TREE
);
2526 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2527 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2528 if non-NULL, is the type or namespace used to explicitly qualify
2529 ID_EXPRESSION. DECL is the entity to which that name has been
2532 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2533 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2534 be set to true if this expression isn't permitted in a
2535 constant-expression, but it is otherwise not set by this function.
2536 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2537 constant-expression, but a non-constant expression is also
2540 DONE is true if this expression is a complete postfix-expression;
2541 it is false if this expression is followed by '->', '[', '(', etc.
2542 ADDRESS_P is true iff this expression is the operand of '&'.
2543 TEMPLATE_P is true iff the qualified-id was of the form
2544 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2545 appears as a template argument.
2547 If an error occurs, and it is the kind of error that might cause
2548 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2549 is the caller's responsibility to issue the message. *ERROR_MSG
2550 will be a string with static storage duration, so the caller need
2553 Return an expression for the entity, after issuing appropriate
2554 diagnostics. This function is also responsible for transforming a
2555 reference to a non-static member into a COMPONENT_REF that makes
2556 the use of "this" explicit.
2558 Upon return, *IDK will be filled in appropriately. */
2561 finish_id_expression (tree id_expression
,
2565 bool integral_constant_expression_p
,
2566 bool allow_non_integral_constant_expression_p
,
2567 bool *non_integral_constant_expression_p
,
2571 bool template_arg_p
,
2572 const char **error_msg
)
2574 /* Initialize the output parameters. */
2575 *idk
= CP_ID_KIND_NONE
;
2578 if (id_expression
== error_mark_node
)
2579 return error_mark_node
;
2580 /* If we have a template-id, then no further lookup is
2581 required. If the template-id was for a template-class, we
2582 will sometimes have a TYPE_DECL at this point. */
2583 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2584 || TREE_CODE (decl
) == TYPE_DECL
)
2586 /* Look up the name. */
2589 if (decl
== error_mark_node
)
2591 /* Name lookup failed. */
2594 || (!dependent_type_p (scope
)
2595 && !(TREE_CODE (id_expression
) == IDENTIFIER_NODE
2596 && IDENTIFIER_TYPENAME_P (id_expression
)
2597 && dependent_type_p (TREE_TYPE (id_expression
))))))
2599 /* If the qualifying type is non-dependent (and the name
2600 does not name a conversion operator to a dependent
2601 type), issue an error. */
2602 qualified_name_lookup_error (scope
, id_expression
, decl
);
2603 return error_mark_node
;
2607 /* It may be resolved via Koenig lookup. */
2608 *idk
= CP_ID_KIND_UNQUALIFIED
;
2609 return id_expression
;
2612 decl
= id_expression
;
2614 /* If DECL is a variable that would be out of scope under
2615 ANSI/ISO rules, but in scope in the ARM, name lookup
2616 will succeed. Issue a diagnostic here. */
2618 decl
= check_for_out_of_scope_variable (decl
);
2620 /* Remember that the name was used in the definition of
2621 the current class so that we can check later to see if
2622 the meaning would have been different after the class
2623 was entirely defined. */
2624 if (!scope
&& decl
!= error_mark_node
)
2625 maybe_note_name_used_in_class (id_expression
, decl
);
2627 /* Disallow uses of local variables from containing functions. */
2628 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
2630 tree context
= decl_function_context (decl
);
2631 if (context
!= NULL_TREE
&& context
!= current_function_decl
2632 && ! TREE_STATIC (decl
))
2634 error (TREE_CODE (decl
) == VAR_DECL
2635 ? "use of %<auto%> variable from containing function"
2636 : "use of parameter from containing function");
2637 error (" %q+#D declared here", decl
);
2638 return error_mark_node
;
2643 /* If we didn't find anything, or what we found was a type,
2644 then this wasn't really an id-expression. */
2645 if (TREE_CODE (decl
) == TEMPLATE_DECL
2646 && !DECL_FUNCTION_TEMPLATE_P (decl
))
2648 *error_msg
= "missing template arguments";
2649 return error_mark_node
;
2651 else if (TREE_CODE (decl
) == TYPE_DECL
2652 || TREE_CODE (decl
) == NAMESPACE_DECL
)
2654 *error_msg
= "expected primary-expression";
2655 return error_mark_node
;
2658 /* If the name resolved to a template parameter, there is no
2659 need to look it up again later. */
2660 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
2661 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
2665 *idk
= CP_ID_KIND_NONE
;
2666 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
2667 decl
= TEMPLATE_PARM_DECL (decl
);
2668 r
= convert_from_reference (DECL_INITIAL (decl
));
2670 if (integral_constant_expression_p
2671 && !dependent_type_p (TREE_TYPE (decl
))
2672 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
2674 if (!allow_non_integral_constant_expression_p
)
2675 error ("template parameter %qD of type %qT is not allowed in "
2676 "an integral constant expression because it is not of "
2677 "integral or enumeration type", decl
, TREE_TYPE (decl
));
2678 *non_integral_constant_expression_p
= true;
2682 /* Similarly, we resolve enumeration constants to their
2683 underlying values. */
2684 else if (TREE_CODE (decl
) == CONST_DECL
)
2686 *idk
= CP_ID_KIND_NONE
;
2687 if (!processing_template_decl
)
2689 used_types_insert (TREE_TYPE (decl
));
2690 return DECL_INITIAL (decl
);
2698 /* If the declaration was explicitly qualified indicate
2699 that. The semantics of `A::f(3)' are different than
2700 `f(3)' if `f' is virtual. */
2702 ? CP_ID_KIND_QUALIFIED
2703 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2704 ? CP_ID_KIND_TEMPLATE_ID
2705 : CP_ID_KIND_UNQUALIFIED
));
2710 An id-expression is type-dependent if it contains an
2711 identifier that was declared with a dependent type.
2713 The standard is not very specific about an id-expression that
2714 names a set of overloaded functions. What if some of them
2715 have dependent types and some of them do not? Presumably,
2716 such a name should be treated as a dependent name. */
2717 /* Assume the name is not dependent. */
2718 dependent_p
= false;
2719 if (!processing_template_decl
)
2720 /* No names are dependent outside a template. */
2722 /* A template-id where the name of the template was not resolved
2723 is definitely dependent. */
2724 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2725 && (TREE_CODE (TREE_OPERAND (decl
, 0))
2726 == IDENTIFIER_NODE
))
2728 /* For anything except an overloaded function, just check its
2730 else if (!is_overloaded_fn (decl
))
2732 = dependent_type_p (TREE_TYPE (decl
));
2733 /* For a set of overloaded functions, check each of the
2739 if (BASELINK_P (fns
))
2740 fns
= BASELINK_FUNCTIONS (fns
);
2742 /* For a template-id, check to see if the template
2743 arguments are dependent. */
2744 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
2746 tree args
= TREE_OPERAND (fns
, 1);
2747 dependent_p
= any_dependent_template_arguments_p (args
);
2748 /* The functions are those referred to by the
2750 fns
= TREE_OPERAND (fns
, 0);
2753 /* If there are no dependent template arguments, go through
2754 the overloaded functions. */
2755 while (fns
&& !dependent_p
)
2757 tree fn
= OVL_CURRENT (fns
);
2759 /* Member functions of dependent classes are
2761 if (TREE_CODE (fn
) == FUNCTION_DECL
2762 && type_dependent_expression_p (fn
))
2764 else if (TREE_CODE (fn
) == TEMPLATE_DECL
2765 && dependent_template_p (fn
))
2768 fns
= OVL_NEXT (fns
);
2772 /* If the name was dependent on a template parameter, we will
2773 resolve the name at instantiation time. */
2776 /* Create a SCOPE_REF for qualified names, if the scope is
2780 /* Since this name was dependent, the expression isn't
2781 constant -- yet. No error is issued because it might
2782 be constant when things are instantiated. */
2783 if (integral_constant_expression_p
)
2784 *non_integral_constant_expression_p
= true;
2787 if (address_p
&& done
)
2788 decl
= finish_qualified_id_expr (scope
, decl
,
2792 else if (dependent_type_p (scope
))
2793 decl
= build_qualified_name (/*type=*/NULL_TREE
,
2797 else if (DECL_P (decl
))
2798 decl
= build_qualified_name (TREE_TYPE (decl
),
2803 if (TREE_TYPE (decl
))
2804 decl
= convert_from_reference (decl
);
2807 /* A TEMPLATE_ID already contains all the information we
2809 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
)
2810 return id_expression
;
2811 *idk
= CP_ID_KIND_UNQUALIFIED_DEPENDENT
;
2812 /* If we found a variable, then name lookup during the
2813 instantiation will always resolve to the same VAR_DECL
2814 (or an instantiation thereof). */
2815 if (TREE_CODE (decl
) == VAR_DECL
2816 || TREE_CODE (decl
) == PARM_DECL
)
2817 return convert_from_reference (decl
);
2818 /* The same is true for FIELD_DECL, but we also need to
2819 make sure that the syntax is correct. */
2820 else if (TREE_CODE (decl
) == FIELD_DECL
)
2822 /* Since SCOPE is NULL here, this is an unqualified name.
2823 Access checking has been performed during name lookup
2824 already. Turn off checking to avoid duplicate errors. */
2825 push_deferring_access_checks (dk_no_check
);
2826 decl
= finish_non_static_data_member
2827 (decl
, current_class_ref
,
2828 /*qualifying_scope=*/NULL_TREE
);
2829 pop_deferring_access_checks ();
2832 return id_expression
;
2835 /* Only certain kinds of names are allowed in constant
2836 expression. Enumerators and template parameters have already
2837 been handled above. */
2838 if (integral_constant_expression_p
2839 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl
)
2840 && ! builtin_valid_in_constant_expr_p (decl
))
2842 if (!allow_non_integral_constant_expression_p
)
2844 error ("%qD cannot appear in a constant-expression", decl
);
2845 return error_mark_node
;
2847 *non_integral_constant_expression_p
= true;
2850 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
2852 error ("use of namespace %qD as expression", decl
);
2853 return error_mark_node
;
2855 else if (DECL_CLASS_TEMPLATE_P (decl
))
2857 error ("use of class template %qT as expression", decl
);
2858 return error_mark_node
;
2860 else if (TREE_CODE (decl
) == TREE_LIST
)
2862 /* Ambiguous reference to base members. */
2863 error ("request for member %qD is ambiguous in "
2864 "multiple inheritance lattice", id_expression
);
2865 print_candidates (decl
);
2866 return error_mark_node
;
2869 /* Mark variable-like entities as used. Functions are similarly
2870 marked either below or after overload resolution. */
2871 if (TREE_CODE (decl
) == VAR_DECL
2872 || TREE_CODE (decl
) == PARM_DECL
2873 || TREE_CODE (decl
) == RESULT_DECL
)
2878 decl
= (adjust_result_of_qualified_name_lookup
2879 (decl
, scope
, current_class_type
));
2881 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2884 if (TREE_CODE (decl
) == FIELD_DECL
|| BASELINK_P (decl
))
2885 decl
= finish_qualified_id_expr (scope
,
2893 tree r
= convert_from_reference (decl
);
2895 if (processing_template_decl
&& TYPE_P (scope
))
2896 r
= build_qualified_name (TREE_TYPE (r
),
2902 else if (TREE_CODE (decl
) == FIELD_DECL
)
2904 /* Since SCOPE is NULL here, this is an unqualified name.
2905 Access checking has been performed during name lookup
2906 already. Turn off checking to avoid duplicate errors. */
2907 push_deferring_access_checks (dk_no_check
);
2908 decl
= finish_non_static_data_member (decl
, current_class_ref
,
2909 /*qualifying_scope=*/NULL_TREE
);
2910 pop_deferring_access_checks ();
2912 else if (is_overloaded_fn (decl
))
2917 if (TREE_CODE (first_fn
) == TEMPLATE_ID_EXPR
)
2918 first_fn
= TREE_OPERAND (first_fn
, 0);
2919 first_fn
= get_first_fn (first_fn
);
2920 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
2921 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
2923 if (!really_overloaded_fn (decl
))
2924 mark_used (first_fn
);
2927 && TREE_CODE (first_fn
) == FUNCTION_DECL
2928 && DECL_FUNCTION_MEMBER_P (first_fn
)
2929 && !shared_member_p (decl
))
2931 /* A set of member functions. */
2932 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
2933 return finish_class_member_access_expr (decl
, id_expression
,
2934 /*template_p=*/false);
2937 decl
= baselink_for_fns (decl
);
2941 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
2942 && DECL_CLASS_SCOPE_P (decl
))
2944 tree context
= context_for_name_lookup (decl
);
2945 if (context
!= current_class_type
)
2947 tree path
= currently_open_derived_class (context
);
2948 perform_or_defer_access_check (TYPE_BINFO (path
),
2953 decl
= convert_from_reference (decl
);
2957 if (TREE_DEPRECATED (decl
))
2958 warn_deprecated_use (decl
);
2963 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
2964 use as a type-specifier. */
2967 finish_typeof (tree expr
)
2971 if (type_dependent_expression_p (expr
))
2973 type
= make_aggr_type (TYPEOF_TYPE
);
2974 TYPEOF_TYPE_EXPR (type
) = expr
;
2975 SET_TYPE_STRUCTURAL_EQUALITY (type
);
2980 type
= unlowered_expr_type (expr
);
2982 if (!type
|| type
== unknown_type_node
)
2984 error ("type of %qE is unknown", expr
);
2985 return error_mark_node
;
2991 /* Perform C++-specific checks for __builtin_offsetof before calling
2995 finish_offsetof (tree expr
)
2997 if (TREE_CODE (expr
) == PSEUDO_DTOR_EXPR
)
2999 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3000 TREE_OPERAND (expr
, 2));
3001 return error_mark_node
;
3003 if (TREE_CODE (TREE_TYPE (expr
)) == FUNCTION_TYPE
3004 || TREE_CODE (TREE_TYPE (expr
)) == METHOD_TYPE
3005 || TREE_CODE (TREE_TYPE (expr
)) == UNKNOWN_TYPE
)
3007 if (TREE_CODE (expr
) == COMPONENT_REF
3008 || TREE_CODE (expr
) == COMPOUND_EXPR
)
3009 expr
= TREE_OPERAND (expr
, 1);
3010 error ("cannot apply %<offsetof%> to member function %qD", expr
);
3011 return error_mark_node
;
3013 return fold_offsetof (expr
, NULL_TREE
);
3016 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
3017 with equivalent CALL_EXPRs. */
3020 simplify_aggr_init_exprs_r (tree
* tp
,
3022 void* data ATTRIBUTE_UNUSED
)
3024 /* We don't need to walk into types; there's nothing in a type that
3025 needs simplification. (And, furthermore, there are places we
3026 actively don't want to go. For example, we don't want to wander
3027 into the default arguments for a FUNCTION_DECL that appears in a
3034 /* Only AGGR_INIT_EXPRs are interesting. */
3035 else if (TREE_CODE (*tp
) != AGGR_INIT_EXPR
)
3038 simplify_aggr_init_expr (tp
);
3040 /* Keep iterating. */
3044 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3045 function is broken out from the above for the benefit of the tree-ssa
3049 simplify_aggr_init_expr (tree
*tp
)
3051 tree aggr_init_expr
= *tp
;
3053 /* Form an appropriate CALL_EXPR. */
3054 tree fn
= AGGR_INIT_EXPR_FN (aggr_init_expr
);
3055 tree slot
= AGGR_INIT_EXPR_SLOT (aggr_init_expr
);
3056 tree type
= TREE_TYPE (slot
);
3059 enum style_t
{ ctor
, arg
, pcc
} style
;
3061 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
3063 #ifdef PCC_STATIC_STRUCT_RETURN
3069 gcc_assert (TREE_ADDRESSABLE (type
));
3073 call_expr
= build_call_array (TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
3075 aggr_init_expr_nargs (aggr_init_expr
),
3076 AGGR_INIT_EXPR_ARGP (aggr_init_expr
));
3080 /* Replace the first argument to the ctor with the address of the
3082 cxx_mark_addressable (slot
);
3083 CALL_EXPR_ARG (call_expr
, 0) =
3084 build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
3086 else if (style
== arg
)
3088 /* Just mark it addressable here, and leave the rest to
3089 expand_call{,_inline}. */
3090 cxx_mark_addressable (slot
);
3091 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
3092 call_expr
= build2 (MODIFY_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
3094 else if (style
== pcc
)
3096 /* If we're using the non-reentrant PCC calling convention, then we
3097 need to copy the returned value out of the static buffer into the
3099 push_deferring_access_checks (dk_no_check
);
3100 call_expr
= build_aggr_init (slot
, call_expr
,
3101 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
);
3102 pop_deferring_access_checks ();
3103 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
3109 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3112 emit_associated_thunks (tree fn
)
3114 /* When we use vcall offsets, we emit thunks with the virtual
3115 functions to which they thunk. The whole point of vcall offsets
3116 is so that you can know statically the entire set of thunks that
3117 will ever be needed for a given virtual function, thereby
3118 enabling you to output all the thunks with the function itself. */
3119 if (DECL_VIRTUAL_P (fn
))
3123 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= TREE_CHAIN (thunk
))
3125 if (!THUNK_ALIAS (thunk
))
3127 use_thunk (thunk
, /*emit_p=*/1);
3128 if (DECL_RESULT_THUNK_P (thunk
))
3132 for (probe
= DECL_THUNKS (thunk
);
3133 probe
; probe
= TREE_CHAIN (probe
))
3134 use_thunk (probe
, /*emit_p=*/1);
3138 gcc_assert (!DECL_THUNKS (thunk
));
3143 /* Generate RTL for FN. */
3146 expand_or_defer_fn (tree fn
)
3148 /* When the parser calls us after finishing the body of a template
3149 function, we don't really want to expand the body. */
3150 if (processing_template_decl
)
3152 /* Normally, collection only occurs in rest_of_compilation. So,
3153 if we don't collect here, we never collect junk generated
3154 during the processing of templates until we hit a
3155 non-template function. It's not safe to do this inside a
3156 nested class, though, as the parser may have local state that
3157 is not a GC root. */
3158 if (!function_depth
)
3163 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
3164 cp_walk_tree_without_duplicates (&DECL_SAVED_TREE (fn
),
3165 simplify_aggr_init_exprs_r
,
3168 /* If this is a constructor or destructor body, we have to clone
3170 if (maybe_clone_body (fn
))
3172 /* We don't want to process FN again, so pretend we've written
3173 it out, even though we haven't. */
3174 TREE_ASM_WRITTEN (fn
) = 1;
3178 /* We make a decision about linkage for these functions at the end
3179 of the compilation. Until that point, we do not want the back
3180 end to output them -- but we do want it to see the bodies of
3181 these functions so that it can inline them as appropriate. */
3182 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
3184 if (DECL_INTERFACE_KNOWN (fn
))
3185 /* We've already made a decision as to how this function will
3189 DECL_EXTERNAL (fn
) = 1;
3190 DECL_NOT_REALLY_EXTERN (fn
) = 1;
3191 note_vague_linkage_fn (fn
);
3192 /* A non-template inline function with external linkage will
3193 always be COMDAT. As we must eventually determine the
3194 linkage of all functions, and as that causes writes to
3195 the data mapped in from the PCH file, it's advantageous
3196 to mark the functions at this point. */
3197 if (!DECL_IMPLICIT_INSTANTIATION (fn
))
3199 /* This function must have external linkage, as
3200 otherwise DECL_INTERFACE_KNOWN would have been
3202 gcc_assert (TREE_PUBLIC (fn
));
3203 comdat_linkage (fn
);
3204 DECL_INTERFACE_KNOWN (fn
) = 1;
3208 import_export_decl (fn
);
3210 /* If the user wants us to keep all inline functions, then mark
3211 this function as needed so that finish_file will make sure to
3213 if (flag_keep_inline_functions
&& DECL_DECLARED_INLINE_P (fn
))
3217 /* There's no reason to do any of the work here if we're only doing
3218 semantic analysis; this code just generates RTL. */
3219 if (flag_syntax_only
)
3224 /* Expand or defer, at the whim of the compilation unit manager. */
3225 cgraph_finalize_function (fn
, function_depth
> 1);
3237 /* Helper function for walk_tree, used by finalize_nrv below. */
3240 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
3242 struct nrv_data
*dp
= (struct nrv_data
*)data
;
3245 /* No need to walk into types. There wouldn't be any need to walk into
3246 non-statements, except that we have to consider STMT_EXPRs. */
3249 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3250 but differs from using NULL_TREE in that it indicates that we care
3251 about the value of the RESULT_DECL. */
3252 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
3253 TREE_OPERAND (*tp
, 0) = dp
->result
;
3254 /* Change all cleanups for the NRV to only run when an exception is
3256 else if (TREE_CODE (*tp
) == CLEANUP_STMT
3257 && CLEANUP_DECL (*tp
) == dp
->var
)
3258 CLEANUP_EH_ONLY (*tp
) = 1;
3259 /* Replace the DECL_EXPR for the NRV with an initialization of the
3260 RESULT_DECL, if needed. */
3261 else if (TREE_CODE (*tp
) == DECL_EXPR
3262 && DECL_EXPR_DECL (*tp
) == dp
->var
)
3265 if (DECL_INITIAL (dp
->var
)
3266 && DECL_INITIAL (dp
->var
) != error_mark_node
)
3268 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
3269 DECL_INITIAL (dp
->var
));
3270 DECL_INITIAL (dp
->var
) = error_mark_node
;
3273 init
= build_empty_stmt ();
3274 SET_EXPR_LOCUS (init
, EXPR_LOCUS (*tp
));
3277 /* And replace all uses of the NRV with the RESULT_DECL. */
3278 else if (*tp
== dp
->var
)
3281 /* Avoid walking into the same tree more than once. Unfortunately, we
3282 can't just use walk_tree_without duplicates because it would only call
3283 us for the first occurrence of dp->var in the function body. */
3284 slot
= htab_find_slot (dp
->visited
, *tp
, INSERT
);
3290 /* Keep iterating. */
3294 /* Called from finish_function to implement the named return value
3295 optimization by overriding all the RETURN_EXPRs and pertinent
3296 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3297 RESULT_DECL for the function. */
3300 finalize_nrv (tree
*tp
, tree var
, tree result
)
3302 struct nrv_data data
;
3304 /* Copy debugging information from VAR to RESULT. */
3305 DECL_NAME (result
) = DECL_NAME (var
);
3306 DECL_ARTIFICIAL (result
) = DECL_ARTIFICIAL (var
);
3307 DECL_IGNORED_P (result
) = DECL_IGNORED_P (var
);
3308 DECL_SOURCE_LOCATION (result
) = DECL_SOURCE_LOCATION (var
);
3309 DECL_ABSTRACT_ORIGIN (result
) = DECL_ABSTRACT_ORIGIN (var
);
3310 /* Don't forget that we take its address. */
3311 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
3314 data
.result
= result
;
3315 data
.visited
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
3316 cp_walk_tree (tp
, finalize_nrv_r
, &data
, 0);
3317 htab_delete (data
.visited
);
3320 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3321 Remove any elements from the list that are invalid. */
3324 finish_omp_clauses (tree clauses
)
3326 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
3327 tree c
, t
, *pc
= &clauses
;
3330 bitmap_obstack_initialize (NULL
);
3331 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
3332 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
3333 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
3335 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3337 bool remove
= false;
3339 switch (OMP_CLAUSE_CODE (c
))
3341 case OMP_CLAUSE_SHARED
:
3343 goto check_dup_generic
;
3344 case OMP_CLAUSE_PRIVATE
:
3346 goto check_dup_generic
;
3347 case OMP_CLAUSE_REDUCTION
:
3349 goto check_dup_generic
;
3350 case OMP_CLAUSE_COPYPRIVATE
:
3351 name
= "copyprivate";
3352 goto check_dup_generic
;
3353 case OMP_CLAUSE_COPYIN
:
3355 goto check_dup_generic
;
3357 t
= OMP_CLAUSE_DECL (c
);
3358 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3360 if (processing_template_decl
)
3363 error ("%qD is not a variable in clause %qs", t
, name
);
3365 error ("%qE is not a variable in clause %qs", t
, name
);
3368 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3369 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
3370 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
3372 error ("%qD appears more than once in data clauses", t
);
3376 bitmap_set_bit (&generic_head
, DECL_UID (t
));
3379 case OMP_CLAUSE_FIRSTPRIVATE
:
3380 t
= OMP_CLAUSE_DECL (c
);
3381 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3383 if (processing_template_decl
)
3385 error ("%qE is not a variable in clause %<firstprivate%>", t
);
3388 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3389 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
3391 error ("%qE appears more than once in data clauses", t
);
3395 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
3398 case OMP_CLAUSE_LASTPRIVATE
:
3399 t
= OMP_CLAUSE_DECL (c
);
3400 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3402 if (processing_template_decl
)
3404 error ("%qE is not a variable in clause %<lastprivate%>", t
);
3407 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3408 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
3410 error ("%qE appears more than once in data clauses", t
);
3414 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
3418 t
= OMP_CLAUSE_IF_EXPR (c
);
3419 t
= maybe_convert_cond (t
);
3420 if (t
== error_mark_node
)
3422 OMP_CLAUSE_IF_EXPR (c
) = t
;
3425 case OMP_CLAUSE_NUM_THREADS
:
3426 t
= OMP_CLAUSE_NUM_THREADS_EXPR (c
);
3427 if (t
== error_mark_node
)
3429 else if (!type_dependent_expression_p (t
)
3430 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
3432 error ("num_threads expression must be integral");
3437 case OMP_CLAUSE_SCHEDULE
:
3438 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
3441 else if (t
== error_mark_node
)
3443 else if (!type_dependent_expression_p (t
)
3444 && !INTEGRAL_TYPE_P (TREE_TYPE (t
)))
3446 error ("schedule chunk size expression must be integral");
3451 case OMP_CLAUSE_NOWAIT
:
3452 case OMP_CLAUSE_ORDERED
:
3453 case OMP_CLAUSE_DEFAULT
:
3461 *pc
= OMP_CLAUSE_CHAIN (c
);
3463 pc
= &OMP_CLAUSE_CHAIN (c
);
3466 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3468 enum tree_code c_kind
= OMP_CLAUSE_CODE (c
);
3469 bool remove
= false;
3470 bool need_complete_non_reference
= false;
3471 bool need_default_ctor
= false;
3472 bool need_copy_ctor
= false;
3473 bool need_copy_assignment
= false;
3474 bool need_implicitly_determined
= false;
3475 tree type
, inner_type
;
3479 case OMP_CLAUSE_SHARED
:
3481 need_implicitly_determined
= true;
3483 case OMP_CLAUSE_PRIVATE
:
3485 need_complete_non_reference
= true;
3486 need_default_ctor
= true;
3487 need_implicitly_determined
= true;
3489 case OMP_CLAUSE_FIRSTPRIVATE
:
3490 name
= "firstprivate";
3491 need_complete_non_reference
= true;
3492 need_copy_ctor
= true;
3493 need_implicitly_determined
= true;
3495 case OMP_CLAUSE_LASTPRIVATE
:
3496 name
= "lastprivate";
3497 need_complete_non_reference
= true;
3498 need_copy_assignment
= true;
3499 need_implicitly_determined
= true;
3501 case OMP_CLAUSE_REDUCTION
:
3503 need_implicitly_determined
= true;
3505 case OMP_CLAUSE_COPYPRIVATE
:
3506 name
= "copyprivate";
3507 need_copy_assignment
= true;
3509 case OMP_CLAUSE_COPYIN
:
3511 need_copy_assignment
= true;
3514 pc
= &OMP_CLAUSE_CHAIN (c
);
3518 t
= OMP_CLAUSE_DECL (c
);
3519 if (processing_template_decl
3520 && TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3522 pc
= &OMP_CLAUSE_CHAIN (c
);
3528 case OMP_CLAUSE_LASTPRIVATE
:
3529 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
3530 need_default_ctor
= true;
3533 case OMP_CLAUSE_REDUCTION
:
3534 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
3535 || POINTER_TYPE_P (TREE_TYPE (t
)))
3537 error ("%qE has invalid type for %<reduction%>", t
);
3540 else if (FLOAT_TYPE_P (TREE_TYPE (t
)))
3542 enum tree_code r_code
= OMP_CLAUSE_REDUCTION_CODE (c
);
3550 error ("%qE has invalid type for %<reduction(%s)%>",
3551 t
, operator_name_info
[r_code
].name
);
3557 case OMP_CLAUSE_COPYIN
:
3558 if (TREE_CODE (t
) != VAR_DECL
|| !DECL_THREAD_LOCAL_P (t
))
3560 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
3569 if (need_complete_non_reference
)
3571 t
= require_complete_type (t
);
3572 if (t
== error_mark_node
)
3574 else if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
3576 error ("%qE has reference type for %qs", t
, name
);
3580 if (need_implicitly_determined
)
3582 const char *share_name
= NULL
;
3584 if (TREE_CODE (t
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (t
))
3585 share_name
= "threadprivate";
3586 else switch (cxx_omp_predetermined_sharing (t
))
3588 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
3590 case OMP_CLAUSE_DEFAULT_SHARED
:
3591 share_name
= "shared";
3593 case OMP_CLAUSE_DEFAULT_PRIVATE
:
3594 share_name
= "private";
3601 error ("%qE is predetermined %qs for %qs",
3602 t
, share_name
, name
);
3607 /* We're interested in the base element, not arrays. */
3608 inner_type
= type
= TREE_TYPE (t
);
3609 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
3610 inner_type
= TREE_TYPE (inner_type
);
3612 /* Check for special function availability by building a call to one.
3613 Save the results, because later we won't be in the right context
3614 for making these queries. */
3615 if (CLASS_TYPE_P (inner_type
)
3616 && (need_default_ctor
|| need_copy_ctor
|| need_copy_assignment
)
3617 && !type_dependent_expression_p (t
))
3619 int save_errorcount
= errorcount
;
3622 /* Always allocate 3 elements for simplicity. These are the
3623 function decls for the ctor, dtor, and assignment op.
3624 This layout is known to the three lang hooks,
3625 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3626 and cxx_omp_clause_assign_op. */
3627 info
= make_tree_vec (3);
3628 CP_OMP_CLAUSE_INFO (c
) = info
;
3630 if (need_default_ctor
3632 && !TYPE_HAS_TRIVIAL_INIT_REF (inner_type
)))
3634 if (need_default_ctor
)
3638 t
= build_int_cst (build_pointer_type (inner_type
), 0);
3639 t
= build1 (INDIRECT_REF
, inner_type
, t
);
3640 t
= build_tree_list (NULL
, t
);
3642 t
= build_special_member_call (NULL_TREE
,
3643 complete_ctor_identifier
,
3644 t
, inner_type
, LOOKUP_NORMAL
);
3646 if (targetm
.cxx
.cdtor_returns_this ())
3647 /* Because constructors and destructors return this,
3648 the call will have been cast to "void". Remove the
3649 cast here. We would like to use STRIP_NOPS, but it
3650 wouldn't work here because TYPE_MODE (t) and
3651 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3652 They are VOIDmode and Pmode, respectively. */
3653 if (TREE_CODE (t
) == NOP_EXPR
)
3654 t
= TREE_OPERAND (t
, 0);
3656 t
= get_callee_fndecl (t
);
3657 TREE_VEC_ELT (info
, 0) = t
;
3660 if ((need_default_ctor
|| need_copy_ctor
)
3661 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_type
))
3663 t
= build_int_cst (build_pointer_type (inner_type
), 0);
3664 t
= build1 (INDIRECT_REF
, inner_type
, t
);
3665 t
= build_special_member_call (t
, complete_dtor_identifier
,
3666 NULL
, inner_type
, LOOKUP_NORMAL
);
3668 if (targetm
.cxx
.cdtor_returns_this ())
3669 /* Because constructors and destructors return this,
3670 the call will have been cast to "void". Remove the
3671 cast here. We would like to use STRIP_NOPS, but it
3672 wouldn't work here because TYPE_MODE (t) and
3673 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3674 They are VOIDmode and Pmode, respectively. */
3675 if (TREE_CODE (t
) == NOP_EXPR
)
3676 t
= TREE_OPERAND (t
, 0);
3678 t
= get_callee_fndecl (t
);
3679 TREE_VEC_ELT (info
, 1) = t
;
3682 if (need_copy_assignment
3683 && !TYPE_HAS_TRIVIAL_ASSIGN_REF (inner_type
))
3685 t
= build_int_cst (build_pointer_type (inner_type
), 0);
3686 t
= build1 (INDIRECT_REF
, inner_type
, t
);
3687 t
= build_special_member_call (t
, ansi_assopname (NOP_EXPR
),
3688 build_tree_list (NULL
, t
),
3689 inner_type
, LOOKUP_NORMAL
);
3691 /* We'll have called convert_from_reference on the call, which
3692 may well have added an indirect_ref. It's unneeded here,
3693 and in the way, so kill it. */
3694 if (TREE_CODE (t
) == INDIRECT_REF
)
3695 t
= TREE_OPERAND (t
, 0);
3697 t
= get_callee_fndecl (t
);
3698 TREE_VEC_ELT (info
, 2) = t
;
3701 if (errorcount
!= save_errorcount
)
3706 *pc
= OMP_CLAUSE_CHAIN (c
);
3708 pc
= &OMP_CLAUSE_CHAIN (c
);
3711 bitmap_obstack_release (NULL
);
3715 /* For all variables in the tree_list VARS, mark them as thread local. */
3718 finish_omp_threadprivate (tree vars
)
3722 /* Mark every variable in VARS to be assigned thread local storage. */
3723 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
3725 tree v
= TREE_PURPOSE (t
);
3727 /* If V had already been marked threadprivate, it doesn't matter
3728 whether it had been used prior to this point. */
3730 && (DECL_LANG_SPECIFIC (v
) == NULL
3731 || !CP_DECL_THREADPRIVATE_P (v
)))
3732 error ("%qE declared %<threadprivate%> after first use", v
);
3733 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
3734 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
3735 else if (! COMPLETE_TYPE_P (TREE_TYPE (v
)))
3736 error ("%<threadprivate%> %qE has incomplete type", v
);
3737 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
)))
3738 error ("%<threadprivate%> %qE is not file, namespace "
3739 "or block scope variable", v
);
3742 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3743 if (DECL_LANG_SPECIFIC (v
) == NULL
)
3745 retrofit_lang_decl (v
);
3747 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3748 after the allocation of the lang_decl structure. */
3749 if (DECL_DISCRIMINATOR_P (v
))
3750 DECL_LANG_SPECIFIC (v
)->decl_flags
.u2sel
= 1;
3753 if (! DECL_THREAD_LOCAL_P (v
))
3755 DECL_TLS_MODEL (v
) = decl_default_tls_model (v
);
3756 /* If rtl has been already set for this var, call
3757 make_decl_rtl once again, so that encode_section_info
3758 has a chance to look at the new decl flags. */
3759 if (DECL_RTL_SET_P (v
))
3762 CP_DECL_THREADPRIVATE_P (v
) = 1;
3767 /* Build an OpenMP structured block. */
3770 begin_omp_structured_block (void)
3772 return do_pushlevel (sk_omp
);
3776 finish_omp_structured_block (tree block
)
3778 return do_poplevel (block
);
3781 /* Similarly, except force the retention of the BLOCK. */
3784 begin_omp_parallel (void)
3786 keep_next_level (true);
3787 return begin_omp_structured_block ();
3791 finish_omp_parallel (tree clauses
, tree body
)
3795 body
= finish_omp_structured_block (body
);
3797 stmt
= make_node (OMP_PARALLEL
);
3798 TREE_TYPE (stmt
) = void_type_node
;
3799 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
3800 OMP_PARALLEL_BODY (stmt
) = body
;
3802 return add_stmt (stmt
);
3805 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
3806 are directly for their associated operands in the statement. DECL
3807 and INIT are a combo; if DECL is NULL then INIT ought to be a
3808 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
3809 optional statements that need to go before the loop into its
3813 finish_omp_for (location_t locus
, tree decl
, tree init
, tree cond
,
3814 tree incr
, tree body
, tree pre_body
)
3821 switch (TREE_CODE (init
))
3824 decl
= TREE_OPERAND (init
, 0);
3825 init
= TREE_OPERAND (init
, 1);
3828 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
3830 decl
= TREE_OPERAND (init
, 0);
3831 init
= TREE_OPERAND (init
, 2);
3840 error ("expected iteration declaration or initialization");
3845 if (type_dependent_expression_p (decl
)
3846 || type_dependent_expression_p (init
)
3847 || (cond
&& type_dependent_expression_p (cond
))
3848 || (incr
&& type_dependent_expression_p (incr
)))
3854 error ("%Hmissing controlling predicate", &locus
);
3860 error ("%Hmissing increment expression", &locus
);
3864 stmt
= make_node (OMP_FOR
);
3866 /* This is really just a place-holder. We'll be decomposing this
3867 again and going through the build_modify_expr path below when
3868 we instantiate the thing. */
3869 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
3871 TREE_TYPE (stmt
) = void_type_node
;
3872 OMP_FOR_INIT (stmt
) = init
;
3873 OMP_FOR_COND (stmt
) = cond
;
3874 OMP_FOR_INCR (stmt
) = incr
;
3875 OMP_FOR_BODY (stmt
) = body
;
3876 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
3878 SET_EXPR_LOCATION (stmt
, locus
);
3879 return add_stmt (stmt
);
3884 error ("expected iteration declaration or initialization");
3888 if (pre_body
== NULL
|| IS_EMPTY_STMT (pre_body
))
3890 else if (! processing_template_decl
)
3892 add_stmt (pre_body
);
3896 init
= fold_build_cleanup_point_expr (TREE_TYPE (init
), init
);
3897 init
= build_modify_expr (decl
, NOP_EXPR
, init
);
3898 if (cond
&& TREE_SIDE_EFFECTS (cond
) && COMPARISON_CLASS_P (cond
))
3900 int n
= TREE_SIDE_EFFECTS (TREE_OPERAND (cond
, 1)) != 0;
3901 tree t
= TREE_OPERAND (cond
, n
);
3903 TREE_OPERAND (cond
, n
)
3904 = fold_build_cleanup_point_expr (TREE_TYPE (t
), t
);
3906 omp_for
= c_finish_omp_for (locus
, decl
, init
, cond
, incr
, body
, pre_body
);
3908 && TREE_CODE (OMP_FOR_INCR (omp_for
)) == MODIFY_EXPR
3909 && TREE_SIDE_EFFECTS (TREE_OPERAND (OMP_FOR_INCR (omp_for
), 1))
3910 && BINARY_CLASS_P (TREE_OPERAND (OMP_FOR_INCR (omp_for
), 1)))
3912 tree t
= TREE_OPERAND (OMP_FOR_INCR (omp_for
), 1);
3913 int n
= TREE_SIDE_EFFECTS (TREE_OPERAND (t
, 1)) != 0;
3916 = fold_build_cleanup_point_expr (TREE_TYPE (TREE_OPERAND (t
, n
)),
3917 TREE_OPERAND (t
, n
));
3923 finish_omp_atomic (enum tree_code code
, tree lhs
, tree rhs
)
3932 dependent_p
= false;
3935 /* Even in a template, we can detect invalid uses of the atomic
3936 pragma if neither LHS nor RHS is type-dependent. */
3937 if (processing_template_decl
)
3939 dependent_p
= (type_dependent_expression_p (lhs
)
3940 || type_dependent_expression_p (rhs
));
3943 lhs
= build_non_dependent_expr (lhs
);
3944 rhs
= build_non_dependent_expr (rhs
);
3949 stmt
= c_finish_omp_atomic (code
, lhs
, rhs
);
3950 if (stmt
== error_mark_node
)
3953 if (processing_template_decl
)
3954 stmt
= build2 (OMP_ATOMIC
, void_type_node
, integer_zero_node
,
3955 build2 (code
, void_type_node
, orig_lhs
, orig_rhs
));
3960 finish_omp_barrier (void)
3962 tree fn
= built_in_decls
[BUILT_IN_GOMP_BARRIER
];
3963 tree stmt
= finish_call_expr (fn
, NULL
, false, false);
3964 finish_expr_stmt (stmt
);
3968 finish_omp_flush (void)
3970 tree fn
= built_in_decls
[BUILT_IN_SYNCHRONIZE
];
3971 tree stmt
= finish_call_expr (fn
, NULL
, false, false);
3972 finish_expr_stmt (stmt
);
3975 /* True if OpenMP sharing attribute of DECL is predetermined. */
3977 enum omp_clause_default_kind
3978 cxx_omp_predetermined_sharing (tree decl
)
3980 enum omp_clause_default_kind kind
;
3982 kind
= c_omp_predetermined_sharing (decl
);
3983 if (kind
!= OMP_CLAUSE_DEFAULT_UNSPECIFIED
)
3986 /* Static data members are predetermined as shared. */
3987 if (TREE_STATIC (decl
))
3989 tree ctx
= CP_DECL_CONTEXT (decl
);
3990 if (TYPE_P (ctx
) && IS_AGGR_TYPE (ctx
))
3991 return OMP_CLAUSE_DEFAULT_SHARED
;
3994 return OMP_CLAUSE_DEFAULT_UNSPECIFIED
;
3998 init_cp_semantics (void)
4002 /* Build a STATIC_ASSERT for a static assertion with the condition
4003 CONDITION and the message text MESSAGE. LOCATION is the location
4004 of the static assertion in the source code. When MEMBER_P, this
4005 static assertion is a member of a class. */
4007 finish_static_assert (tree condition
, tree message
, location_t location
,
4010 if (type_dependent_expression_p (condition
)
4011 || value_dependent_expression_p (condition
))
4013 /* We're in a template; build a STATIC_ASSERT and put it in
4017 assertion
= make_node (STATIC_ASSERT
);
4018 STATIC_ASSERT_CONDITION (assertion
) = condition
;
4019 STATIC_ASSERT_MESSAGE (assertion
) = message
;
4020 STATIC_ASSERT_SOURCE_LOCATION (assertion
) = location
;
4023 maybe_add_class_template_decl_list (current_class_type
,
4027 add_stmt (assertion
);
4032 /* Fold the expression and convert it to a boolean value. */
4033 condition
= fold_non_dependent_expr (condition
);
4034 condition
= cp_convert (boolean_type_node
, condition
);
4036 if (TREE_CODE (condition
) == INTEGER_CST
&& !integer_zerop (condition
))
4037 /* Do nothing; the condition is satisfied. */
4041 location_t saved_loc
= input_location
;
4043 input_location
= location
;
4044 if (TREE_CODE (condition
) == INTEGER_CST
4045 && integer_zerop (condition
))
4046 /* Report the error. */
4047 error ("static assertion failed: %E", message
);
4048 else if (condition
&& condition
!= error_mark_node
)
4049 error ("non-constant condition for static assertion");
4050 input_location
= saved_loc
;
4054 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4055 suitable for use as a type-specifier.
4057 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4058 id-expression or a class member access, FALSE when it was parsed as
4059 a full expression. */
4061 finish_decltype_type (tree expr
, bool id_expression_or_member_access_p
)
4063 tree orig_expr
= expr
;
4066 if (!expr
|| error_operand_p (expr
))
4067 return error_mark_node
;
4070 || TREE_CODE (expr
) == TYPE_DECL
4071 || (TREE_CODE (expr
) == BIT_NOT_EXPR
4072 && TYPE_P (TREE_OPERAND (expr
, 0))))
4074 error ("argument to decltype must be an expression");
4075 return error_mark_node
;
4078 if (type_dependent_expression_p (expr
))
4080 type
= make_aggr_type (DECLTYPE_TYPE
);
4081 DECLTYPE_TYPE_EXPR (type
) = expr
;
4082 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type
)
4083 = id_expression_or_member_access_p
;
4084 SET_TYPE_STRUCTURAL_EQUALITY (type
);
4089 /* The type denoted by decltype(e) is defined as follows: */
4091 if (id_expression_or_member_access_p
)
4093 /* If e is an id-expression or a class member access (5.2.5
4094 [expr.ref]), decltype(e) is defined as the type of the entity
4095 named by e. If there is no such entity, or e names a set of
4096 overloaded functions, the program is ill-formed. */
4097 if (TREE_CODE (expr
) == IDENTIFIER_NODE
)
4098 expr
= lookup_name (expr
);
4100 if (TREE_CODE (expr
) == INDIRECT_REF
)
4101 /* This can happen when the expression is, e.g., "a.b". Just
4102 look at the underlying operand. */
4103 expr
= TREE_OPERAND (expr
, 0);
4105 if (TREE_CODE (expr
) == OFFSET_REF
4106 || TREE_CODE (expr
) == MEMBER_REF
)
4107 /* We're only interested in the field itself. If it is a
4108 BASELINK, we will need to see through it in the next
4110 expr
= TREE_OPERAND (expr
, 1);
4112 if (TREE_CODE (expr
) == BASELINK
)
4113 /* See through BASELINK nodes to the underlying functions. */
4114 expr
= BASELINK_FUNCTIONS (expr
);
4116 if (TREE_CODE (expr
) == OVERLOAD
)
4118 if (OVL_CHAIN (expr
))
4120 error ("%qE refers to a set of overloaded functions", orig_expr
);
4121 return error_mark_node
;
4124 /* An overload set containing only one function: just look
4125 at that function. */
4126 expr
= OVL_FUNCTION (expr
);
4129 switch (TREE_CODE (expr
))
4132 if (DECL_C_BIT_FIELD (expr
))
4134 type
= DECL_BIT_FIELD_TYPE (expr
);
4137 /* Fall through for fields that aren't bitfields. */
4144 type
= TREE_TYPE (expr
);
4148 type
= error_mark_node
;
4152 type
= is_bitfield_expr_with_lowered_type (expr
);
4154 type
= TREE_TYPE (TREE_OPERAND (expr
, 1));
4161 /* We can get here when the id-expression refers to an
4163 type
= TREE_TYPE (expr
);
4167 gcc_assert (TYPE_P (expr
) || DECL_P (expr
)
4168 || TREE_CODE (expr
) == SCOPE_REF
);
4169 error ("argument to decltype must be an expression");
4170 return error_mark_node
;
4177 /* Expressions of reference type are sometimes wrapped in
4178 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4179 representation, not part of the language, so we have to look
4181 if (TREE_CODE (expr
) == INDIRECT_REF
4182 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr
, 0)))
4184 expr
= TREE_OPERAND (expr
, 0);
4186 if (TREE_CODE (expr
) == CALL_EXPR
4187 && (fndecl
= get_callee_fndecl (expr
))
4188 && (fndecl
!= error_mark_node
))
4189 /* If e is a function call (5.2.2 [expr.call]) or an
4190 invocation of an overloaded operator (parentheses around e
4191 are ignored), decltype(e) is defined as the return type of
4193 type
= TREE_TYPE (TREE_TYPE (fndecl
));
4196 type
= is_bitfield_expr_with_lowered_type (expr
);
4199 /* Bitfields are special, because their type encodes the
4200 number of bits they store. If the expression referenced a
4201 bitfield, TYPE now has the declared type of that
4203 type
= cp_build_qualified_type (type
,
4204 cp_type_quals (TREE_TYPE (expr
)));
4206 if (real_lvalue_p (expr
))
4207 type
= build_reference_type (type
);
4211 /* Otherwise, where T is the type of e, if e is an lvalue,
4212 decltype(e) is defined as T&, otherwise decltype(e) is
4214 type
= TREE_TYPE (expr
);
4215 if (type
== error_mark_node
)
4216 return error_mark_node
;
4217 else if (expr
== current_class_ptr
)
4218 /* If the expression is just "this", we want the
4219 cv-unqualified pointer for the "this" type. */
4220 type
= TYPE_MAIN_VARIANT (type
);
4221 else if (real_lvalue_p (expr
))
4223 if (TREE_CODE (type
) != REFERENCE_TYPE
)
4224 type
= build_reference_type (type
);
4227 type
= non_reference (type
);
4232 if (!type
|| type
== unknown_type_node
)
4234 error ("type of %qE is unknown", expr
);
4235 return error_mark_node
;
4241 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4242 __has_nothrow_copy, depending on assign_p. */
4245 classtype_has_nothrow_assign_or_copy_p (tree type
, bool assign_p
)
4252 ix
= lookup_fnfields_1 (type
, ansi_assopname (NOP_EXPR
));
4255 fns
= VEC_index (tree
, CLASSTYPE_METHOD_VEC (type
), ix
);
4257 else if (TYPE_HAS_INIT_REF (type
))
4259 /* If construction of the copy constructor was postponed, create
4261 if (CLASSTYPE_LAZY_COPY_CTOR (type
))
4262 lazily_declare_fn (sfk_copy_constructor
, type
);
4263 fns
= CLASSTYPE_CONSTRUCTORS (type
);
4268 for (; fns
; fns
= OVL_NEXT (fns
))
4269 if (!TREE_NOTHROW (OVL_CURRENT (fns
)))
4275 /* Actually evaluates the trait. */
4278 trait_expr_value (cp_trait_kind kind
, tree type1
, tree type2
)
4280 enum tree_code type_code1
;
4283 type_code1
= TREE_CODE (type1
);
4287 case CPTK_HAS_NOTHROW_ASSIGN
:
4288 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
4289 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN
, type1
, type2
)
4290 || (CLASS_TYPE_P (type1
)
4291 && classtype_has_nothrow_assign_or_copy_p (type1
,
4294 case CPTK_HAS_TRIVIAL_ASSIGN
:
4295 return (!CP_TYPE_CONST_P (type1
) && type_code1
!= REFERENCE_TYPE
4296 && (pod_type_p (type1
)
4297 || (CLASS_TYPE_P (type1
)
4298 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1
))));
4300 case CPTK_HAS_NOTHROW_CONSTRUCTOR
:
4301 type1
= strip_array_types (type1
);
4302 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR
, type1
, type2
)
4303 || (CLASS_TYPE_P (type1
)
4304 && (t
= locate_ctor (type1
, NULL
)) && TREE_NOTHROW (t
)));
4306 case CPTK_HAS_TRIVIAL_CONSTRUCTOR
:
4307 type1
= strip_array_types (type1
);
4308 return (pod_type_p (type1
)
4309 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_DFLT (type1
)));
4311 case CPTK_HAS_NOTHROW_COPY
:
4312 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY
, type1
, type2
)
4313 || (CLASS_TYPE_P (type1
)
4314 && classtype_has_nothrow_assign_or_copy_p (type1
, false)));
4316 case CPTK_HAS_TRIVIAL_COPY
:
4317 return (pod_type_p (type1
) || type_code1
== REFERENCE_TYPE
4318 || (CLASS_TYPE_P (type1
) && TYPE_HAS_TRIVIAL_INIT_REF (type1
)));
4320 case CPTK_HAS_TRIVIAL_DESTRUCTOR
:
4321 type1
= strip_array_types (type1
);
4322 return (pod_type_p (type1
)
4323 || (CLASS_TYPE_P (type1
)
4324 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1
)));
4326 case CPTK_HAS_VIRTUAL_DESTRUCTOR
:
4327 return (CLASS_TYPE_P (type1
)
4328 && (t
= locate_dtor (type1
, NULL
)) && DECL_VIRTUAL_P (t
));
4330 case CPTK_IS_ABSTRACT
:
4331 return (CLASS_TYPE_P (type1
) && CLASSTYPE_PURE_VIRTUALS (type1
));
4333 case CPTK_IS_BASE_OF
:
4334 return (NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
4335 && DERIVED_FROM_P (type1
, type2
));
4338 return (NON_UNION_CLASS_TYPE_P (type1
));
4340 case CPTK_IS_CONVERTIBLE_TO
:
4345 return (NON_UNION_CLASS_TYPE_P (type1
) && CLASSTYPE_EMPTY_P (type1
));
4348 return (type_code1
== ENUMERAL_TYPE
);
4351 return (pod_type_p (type1
));
4353 case CPTK_IS_POLYMORPHIC
:
4354 return (CLASS_TYPE_P (type1
) && TYPE_POLYMORPHIC_P (type1
));
4357 return (type_code1
== UNION_TYPE
);
4365 /* Process a trait expression. */
4368 finish_trait_expr (cp_trait_kind kind
, tree type1
, tree type2
)
4370 gcc_assert (kind
== CPTK_HAS_NOTHROW_ASSIGN
4371 || kind
== CPTK_HAS_NOTHROW_CONSTRUCTOR
4372 || kind
== CPTK_HAS_NOTHROW_COPY
4373 || kind
== CPTK_HAS_TRIVIAL_ASSIGN
4374 || kind
== CPTK_HAS_TRIVIAL_CONSTRUCTOR
4375 || kind
== CPTK_HAS_TRIVIAL_COPY
4376 || kind
== CPTK_HAS_TRIVIAL_DESTRUCTOR
4377 || kind
== CPTK_HAS_VIRTUAL_DESTRUCTOR
4378 || kind
== CPTK_IS_ABSTRACT
4379 || kind
== CPTK_IS_BASE_OF
4380 || kind
== CPTK_IS_CLASS
4381 || kind
== CPTK_IS_CONVERTIBLE_TO
4382 || kind
== CPTK_IS_EMPTY
4383 || kind
== CPTK_IS_ENUM
4384 || kind
== CPTK_IS_POD
4385 || kind
== CPTK_IS_POLYMORPHIC
4386 || kind
== CPTK_IS_UNION
);
4388 if (kind
== CPTK_IS_CONVERTIBLE_TO
)
4390 sorry ("__is_convertible_to");
4391 return error_mark_node
;
4394 if (type1
== error_mark_node
4395 || ((kind
== CPTK_IS_BASE_OF
|| kind
== CPTK_IS_CONVERTIBLE_TO
)
4396 && type2
== error_mark_node
))
4397 return error_mark_node
;
4399 if (processing_template_decl
)
4401 tree trait_expr
= make_node (TRAIT_EXPR
);
4402 TREE_TYPE (trait_expr
) = boolean_type_node
;
4403 TRAIT_EXPR_TYPE1 (trait_expr
) = type1
;
4404 TRAIT_EXPR_TYPE2 (trait_expr
) = type2
;
4405 TRAIT_EXPR_KIND (trait_expr
) = kind
;
4409 complete_type (type1
);
4411 complete_type (type2
);
4413 /* The only required diagnostic. */
4414 if (kind
== CPTK_IS_BASE_OF
4415 && NON_UNION_CLASS_TYPE_P (type1
) && NON_UNION_CLASS_TYPE_P (type2
)
4416 && !same_type_ignoring_top_level_qualifiers_p (type1
, type2
)
4417 && !COMPLETE_TYPE_P (type2
))
4419 error ("incomplete type %qT not allowed", type2
);
4420 return error_mark_node
;
4423 return (trait_expr_value (kind
, type1
, type2
)
4424 ? boolean_true_node
: boolean_false_node
);
4427 #include "gt-cp-semantics.h"