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 2, 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 COPYING. If not, write to the Free
25 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
30 #include "coretypes.h"
35 #include "tree-inline.h"
36 #include "tree-mudflap.h"
45 #include "diagnostic.h"
47 #include "tree-iterator.h"
51 /* There routines provide a modular interface to perform many parsing
52 operations. They may therefore be used during actual parsing, or
53 during template instantiation, which may be regarded as a
54 degenerate form of parsing. */
56 static tree maybe_convert_cond (tree);
57 static tree simplify_aggr_init_exprs_r (tree *, int *, void *);
58 static void emit_associated_thunks (tree);
59 static tree finalize_nrv_r (tree *, int *, void *);
62 /* Deferred Access Checking Overview
63 ---------------------------------
65 Most C++ expressions and declarations require access checking
66 to be performed during parsing. However, in several cases,
67 this has to be treated differently.
69 For member declarations, access checking has to be deferred
70 until more information about the declaration is known. For
82 When we are parsing the function return type `A::X', we don't
83 really know if this is allowed until we parse the function name.
85 Furthermore, some contexts require that access checking is
86 never performed at all. These include class heads, and template
89 Typical use of access checking functions is described here:
91 1. When we enter a context that requires certain access checking
92 mode, the function `push_deferring_access_checks' is called with
93 DEFERRING argument specifying the desired mode. Access checking
94 may be performed immediately (dk_no_deferred), deferred
95 (dk_deferred), or not performed (dk_no_check).
97 2. When a declaration such as a type, or a variable, is encountered,
98 the function `perform_or_defer_access_check' is called. It
99 maintains a VEC of all deferred checks.
101 3. The global `current_class_type' or `current_function_decl' is then
102 setup by the parser. `enforce_access' relies on these information
105 4. Upon exiting the context mentioned in step 1,
106 `perform_deferred_access_checks' is called to check all declaration
107 stored in the VEC. `pop_deferring_access_checks' is then
108 called to restore the previous access checking mode.
110 In case of parsing error, we simply call `pop_deferring_access_checks'
111 without `perform_deferred_access_checks'. */
113 typedef struct deferred_access GTY(())
115 /* A VEC representing name-lookups for which we have deferred
116 checking access controls. We cannot check the accessibility of
117 names used in a decl-specifier-seq until we know what is being
118 declared because code like:
125 A::B* A::f() { return 0; }
127 is valid, even though `A::B' is not generally accessible. */
128 VEC (deferred_access_check,gc)* GTY(()) deferred_access_checks;
130 /* The current mode of access checks. */
131 enum deferring_kind deferring_access_checks_kind;
134 DEF_VEC_O (deferred_access);
135 DEF_VEC_ALLOC_O (deferred_access,gc);
137 /* Data for deferred access checking. */
138 static GTY(()) VEC(deferred_access,gc) *deferred_access_stack;
139 static GTY(()) unsigned deferred_access_no_check;
141 /* Save the current deferred access states and start deferred
142 access checking iff DEFER_P is true. */
145 push_deferring_access_checks (deferring_kind deferring)
147 /* For context like template instantiation, access checking
148 disabling applies to all nested context. */
149 if (deferred_access_no_check || deferring == dk_no_check)
150 deferred_access_no_check++;
153 deferred_access *ptr;
155 ptr = VEC_safe_push (deferred_access, gc, deferred_access_stack, NULL);
156 ptr->deferred_access_checks = NULL;
157 ptr->deferring_access_checks_kind = deferring;
161 /* Resume deferring access checks again after we stopped doing
165 resume_deferring_access_checks (void)
167 if (!deferred_access_no_check)
168 VEC_last (deferred_access, deferred_access_stack)
169 ->deferring_access_checks_kind = dk_deferred;
172 /* Stop deferring access checks. */
175 stop_deferring_access_checks (void)
177 if (!deferred_access_no_check)
178 VEC_last (deferred_access, deferred_access_stack)
179 ->deferring_access_checks_kind = dk_no_deferred;
182 /* Discard the current deferred access checks and restore the
186 pop_deferring_access_checks (void)
188 if (deferred_access_no_check)
189 deferred_access_no_check--;
191 VEC_pop (deferred_access, deferred_access_stack);
194 /* Returns a TREE_LIST representing the deferred checks.
195 The TREE_PURPOSE of each node is the type through which the
196 access occurred; the TREE_VALUE is the declaration named.
199 VEC (deferred_access_check,gc)*
200 get_deferred_access_checks (void)
202 if (deferred_access_no_check)
205 return (VEC_last (deferred_access, deferred_access_stack)
206 ->deferred_access_checks);
209 /* Take current deferred checks and combine with the
210 previous states if we also defer checks previously.
211 Otherwise perform checks now. */
214 pop_to_parent_deferring_access_checks (void)
216 if (deferred_access_no_check)
217 deferred_access_no_check--;
220 VEC (deferred_access_check,gc) *checks;
221 deferred_access *ptr;
223 checks = (VEC_last (deferred_access, deferred_access_stack)
224 ->deferred_access_checks);
226 VEC_pop (deferred_access, deferred_access_stack);
227 ptr = VEC_last (deferred_access, deferred_access_stack);
228 if (ptr->deferring_access_checks_kind == dk_no_deferred)
231 perform_access_checks (checks);
235 /* Merge with parent. */
237 deferred_access_check *chk, *probe;
240 VEC_iterate (deferred_access_check, checks, i, chk) ;
244 VEC_iterate (deferred_access_check,
245 ptr->deferred_access_checks, j, probe) ;
248 if (probe->binfo == chk->binfo &&
249 probe->decl == chk->decl &&
250 probe->diag_decl == chk->diag_decl)
253 /* Insert into parent's checks. */
254 VEC_safe_push (deferred_access_check, gc,
255 ptr->deferred_access_checks, chk);
262 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
263 is the BINFO indicating the qualifying scope used to access the
264 DECL node stored in the TREE_VALUE of the node. */
267 perform_access_checks (VEC (deferred_access_check,gc)* checks)
270 deferred_access_check *chk;
275 for (i = 0 ; VEC_iterate (deferred_access_check, checks, i, chk) ; ++i)
276 enforce_access (chk->binfo, chk->decl, chk->diag_decl);
279 /* Perform the deferred access checks.
281 After performing the checks, we still have to keep the list
282 `deferred_access_stack->deferred_access_checks' since we may want
283 to check access for them again later in a different context.
290 A::X A::a, x; // No error for `A::a', error for `x'
292 We have to perform deferred access of `A::X', first with `A::a',
296 perform_deferred_access_checks (void)
298 perform_access_checks (get_deferred_access_checks ());
301 /* Defer checking the accessibility of DECL, when looked up in
302 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */
305 perform_or_defer_access_check (tree binfo, tree decl, tree diag_decl)
308 deferred_access *ptr;
309 deferred_access_check *chk;
310 deferred_access_check *new_access;
313 /* Exit if we are in a context that no access checking is performed.
315 if (deferred_access_no_check)
318 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
320 ptr = VEC_last (deferred_access, deferred_access_stack);
322 /* If we are not supposed to defer access checks, just check now. */
323 if (ptr->deferring_access_checks_kind == dk_no_deferred)
325 enforce_access (binfo, decl, diag_decl);
329 /* See if we are already going to perform this check. */
331 VEC_iterate (deferred_access_check,
332 ptr->deferred_access_checks, i, chk) ;
335 if (chk->decl == decl && chk->binfo == binfo &&
336 chk->diag_decl == diag_decl)
341 /* If not, record the check. */
343 VEC_safe_push (deferred_access_check, gc,
344 ptr->deferred_access_checks, 0);
345 new_access->binfo = binfo;
346 new_access->decl = decl;
347 new_access->diag_decl = diag_decl;
350 /* Returns nonzero if the current statement is a full expression,
351 i.e. temporaries created during that statement should be destroyed
352 at the end of the statement. */
355 stmts_are_full_exprs_p (void)
357 return current_stmt_tree ()->stmts_are_full_exprs_p;
360 /* T is a statement. Add it to the statement-tree. This is the C++
361 version. The C/ObjC frontends have a slightly different version of
367 enum tree_code code = TREE_CODE (t);
369 if (EXPR_P (t) && code != LABEL_EXPR)
371 if (!EXPR_HAS_LOCATION (t))
372 SET_EXPR_LOCATION (t, input_location);
374 /* When we expand a statement-tree, we must know whether or not the
375 statements are full-expressions. We record that fact here. */
376 STMT_IS_FULL_EXPR_P (t) = stmts_are_full_exprs_p ();
379 /* Add T to the statement-tree. Non-side-effect statements need to be
380 recorded during statement expressions. */
381 append_to_statement_list_force (t, &cur_stmt_list);
386 /* Returns the stmt_tree (if any) to which statements are currently
387 being added. If there is no active statement-tree, NULL is
391 current_stmt_tree (void)
394 ? &cfun->language->base.x_stmt_tree
395 : &scope_chain->x_stmt_tree);
398 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
401 maybe_cleanup_point_expr (tree expr)
403 if (!processing_template_decl && stmts_are_full_exprs_p ())
404 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
408 /* Like maybe_cleanup_point_expr except have the type of the new expression be
409 void so we don't need to create a temporary variable to hold the inner
410 expression. The reason why we do this is because the original type might be
411 an aggregate and we cannot create a temporary variable for that type. */
414 maybe_cleanup_point_expr_void (tree expr)
416 if (!processing_template_decl && stmts_are_full_exprs_p ())
417 expr = fold_build_cleanup_point_expr (void_type_node, expr);
423 /* Create a declaration statement for the declaration given by the DECL. */
426 add_decl_expr (tree decl)
428 tree r = build_stmt (DECL_EXPR, decl);
429 if (DECL_INITIAL (decl)
430 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
431 r = maybe_cleanup_point_expr_void (r);
435 /* Nonzero if TYPE is an anonymous union or struct type. We have to use a
436 flag for this because "A union for which objects or pointers are
437 declared is not an anonymous union" [class.union]. */
440 anon_aggr_type_p (tree node)
442 return ANON_AGGR_TYPE_P (node);
445 /* Finish a scope. */
448 do_poplevel (tree stmt_list)
452 if (stmts_are_full_exprs_p ())
453 block = poplevel (kept_level_p (), 1, 0);
455 stmt_list = pop_stmt_list (stmt_list);
457 if (!processing_template_decl)
459 stmt_list = c_build_bind_expr (block, stmt_list);
460 /* ??? See c_end_compound_stmt re statement expressions. */
466 /* Begin a new scope. */
469 do_pushlevel (scope_kind sk)
471 tree ret = push_stmt_list ();
472 if (stmts_are_full_exprs_p ())
473 begin_scope (sk, NULL);
477 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
478 when the current scope is exited. EH_ONLY is true when this is not
479 meant to apply to normal control flow transfer. */
482 push_cleanup (tree decl, tree cleanup, bool eh_only)
484 tree stmt = build_stmt (CLEANUP_STMT, NULL, cleanup, decl);
485 CLEANUP_EH_ONLY (stmt) = eh_only;
487 CLEANUP_BODY (stmt) = push_stmt_list ();
490 /* Begin a conditional that might contain a declaration. When generating
491 normal code, we want the declaration to appear before the statement
492 containing the conditional. When generating template code, we want the
493 conditional to be rendered as the raw DECL_EXPR. */
496 begin_cond (tree *cond_p)
498 if (processing_template_decl)
499 *cond_p = push_stmt_list ();
502 /* Finish such a conditional. */
505 finish_cond (tree *cond_p, tree expr)
507 if (processing_template_decl)
509 tree cond = pop_stmt_list (*cond_p);
510 if (TREE_CODE (cond) == DECL_EXPR)
513 check_for_bare_parameter_packs (expr);
518 /* If *COND_P specifies a conditional with a declaration, transform the
521 for (; A x = 42;) { }
523 while (true) { A x = 42; if (!x) break; }
524 for (;;) { A x = 42; if (!x) break; }
525 The statement list for BODY will be empty if the conditional did
526 not declare anything. */
529 simplify_loop_decl_cond (tree *cond_p, tree body)
533 if (!TREE_SIDE_EFFECTS (body))
537 *cond_p = boolean_true_node;
539 if_stmt = begin_if_stmt ();
540 cond = build_unary_op (TRUTH_NOT_EXPR, cond, 0);
541 finish_if_stmt_cond (cond, if_stmt);
542 finish_break_stmt ();
543 finish_then_clause (if_stmt);
544 finish_if_stmt (if_stmt);
547 /* Finish a goto-statement. */
550 finish_goto_stmt (tree destination)
552 if (TREE_CODE (destination) == IDENTIFIER_NODE)
553 destination = lookup_label (destination);
555 /* We warn about unused labels with -Wunused. That means we have to
556 mark the used labels as used. */
557 if (TREE_CODE (destination) == LABEL_DECL)
558 TREE_USED (destination) = 1;
561 /* The DESTINATION is being used as an rvalue. */
562 if (!processing_template_decl)
563 destination = decay_conversion (destination);
564 /* We don't inline calls to functions with computed gotos.
565 Those functions are typically up to some funny business,
566 and may be depending on the labels being at particular
567 addresses, or some such. */
568 DECL_UNINLINABLE (current_function_decl) = 1;
571 check_goto (destination);
573 return add_stmt (build_stmt (GOTO_EXPR, destination));
576 /* COND is the condition-expression for an if, while, etc.,
577 statement. Convert it to a boolean value, if appropriate. */
580 maybe_convert_cond (tree cond)
582 /* Empty conditions remain empty. */
586 /* Wait until we instantiate templates before doing conversion. */
587 if (processing_template_decl)
590 /* Do the conversion. */
591 cond = convert_from_reference (cond);
593 if (TREE_CODE (cond) == MODIFY_EXPR
594 && !TREE_NO_WARNING (cond)
597 warning (OPT_Wparentheses,
598 "suggest parentheses around assignment used as truth value");
599 TREE_NO_WARNING (cond) = 1;
602 return condition_conversion (cond);
605 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
608 finish_expr_stmt (tree expr)
612 if (expr != NULL_TREE)
614 if (!processing_template_decl)
616 if (warn_sequence_point)
617 verify_sequence_points (expr);
618 expr = convert_to_void (expr, "statement");
620 else if (!type_dependent_expression_p (expr))
621 convert_to_void (build_non_dependent_expr (expr), "statement");
623 check_for_bare_parameter_packs (expr);
625 /* Simplification of inner statement expressions, compound exprs,
626 etc can result in us already having an EXPR_STMT. */
627 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
629 if (TREE_CODE (expr) != EXPR_STMT)
630 expr = build_stmt (EXPR_STMT, expr);
631 expr = maybe_cleanup_point_expr_void (expr);
643 /* Begin an if-statement. Returns a newly created IF_STMT if
650 scope = do_pushlevel (sk_block);
651 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
652 TREE_CHAIN (r) = scope;
653 begin_cond (&IF_COND (r));
657 /* Process the COND of an if-statement, which may be given by
661 finish_if_stmt_cond (tree cond, tree if_stmt)
663 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
665 THEN_CLAUSE (if_stmt) = push_stmt_list ();
668 /* Finish the then-clause of an if-statement, which may be given by
672 finish_then_clause (tree if_stmt)
674 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
678 /* Begin the else-clause of an if-statement. */
681 begin_else_clause (tree if_stmt)
683 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
686 /* Finish the else-clause of an if-statement, which may be given by
690 finish_else_clause (tree if_stmt)
692 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
695 /* Finish an if-statement. */
698 finish_if_stmt (tree if_stmt)
700 tree scope = TREE_CHAIN (if_stmt);
701 TREE_CHAIN (if_stmt) = NULL;
702 add_stmt (do_poplevel (scope));
704 empty_if_body_warning (THEN_CLAUSE (if_stmt), ELSE_CLAUSE (if_stmt));
707 /* Begin a while-statement. Returns a newly created WHILE_STMT if
711 begin_while_stmt (void)
714 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
716 WHILE_BODY (r) = do_pushlevel (sk_block);
717 begin_cond (&WHILE_COND (r));
721 /* Process the COND of a while-statement, which may be given by
725 finish_while_stmt_cond (tree cond, tree while_stmt)
727 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
728 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
731 /* Finish a while-statement, which may be given by WHILE_STMT. */
734 finish_while_stmt (tree while_stmt)
736 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
740 /* Begin a do-statement. Returns a newly created DO_STMT if
746 tree r = build_stmt (DO_STMT, NULL_TREE, NULL_TREE);
748 DO_BODY (r) = push_stmt_list ();
752 /* Finish the body of a do-statement, which may be given by DO_STMT. */
755 finish_do_body (tree do_stmt)
757 tree body = DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
759 if (TREE_CODE (body) == STATEMENT_LIST && STATEMENT_LIST_TAIL (body))
760 body = STATEMENT_LIST_TAIL (body)->stmt;
762 if (IS_EMPTY_STMT (body))
763 warning (OPT_Wempty_body,
764 "suggest explicit braces around empty body in %<do%> statement");
767 /* Finish a do-statement, which may be given by DO_STMT, and whose
768 COND is as indicated. */
771 finish_do_stmt (tree cond, tree do_stmt)
773 cond = maybe_convert_cond (cond);
774 DO_COND (do_stmt) = cond;
778 /* Finish a return-statement. The EXPRESSION returned, if any, is as
782 finish_return_stmt (tree expr)
787 expr = check_return_expr (expr, &no_warning);
789 if (flag_openmp && !check_omp_return ())
790 return error_mark_node;
791 if (!processing_template_decl)
793 if (DECL_DESTRUCTOR_P (current_function_decl)
794 || (DECL_CONSTRUCTOR_P (current_function_decl)
795 && targetm.cxx.cdtor_returns_this ()))
797 /* Similarly, all destructors must run destructors for
798 base-classes before returning. So, all returns in a
799 destructor get sent to the DTOR_LABEL; finish_function emits
800 code to return a value there. */
801 return finish_goto_stmt (cdtor_label);
805 r = build_stmt (RETURN_EXPR, expr);
806 TREE_NO_WARNING (r) |= no_warning;
807 r = maybe_cleanup_point_expr_void (r);
814 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
817 begin_for_stmt (void)
821 r = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE,
822 NULL_TREE, NULL_TREE);
824 if (flag_new_for_scope > 0)
825 TREE_CHAIN (r) = do_pushlevel (sk_for);
827 if (processing_template_decl)
828 FOR_INIT_STMT (r) = push_stmt_list ();
833 /* Finish the for-init-statement of a for-statement, which may be
834 given by FOR_STMT. */
837 finish_for_init_stmt (tree for_stmt)
839 if (processing_template_decl)
840 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
842 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
843 begin_cond (&FOR_COND (for_stmt));
846 /* Finish the COND of a for-statement, which may be given by
850 finish_for_cond (tree cond, tree for_stmt)
852 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
853 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
856 /* Finish the increment-EXPRESSION in a for-statement, which may be
857 given by FOR_STMT. */
860 finish_for_expr (tree expr, tree for_stmt)
864 /* If EXPR is an overloaded function, issue an error; there is no
865 context available to use to perform overload resolution. */
866 if (type_unknown_p (expr))
868 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
869 expr = error_mark_node;
871 if (!processing_template_decl)
873 if (warn_sequence_point)
874 verify_sequence_points (expr);
875 expr = convert_to_void (expr, "3rd expression in for");
877 else if (!type_dependent_expression_p (expr))
878 convert_to_void (build_non_dependent_expr (expr), "3rd expression in for");
879 expr = maybe_cleanup_point_expr_void (expr);
880 check_for_bare_parameter_packs (expr);
881 FOR_EXPR (for_stmt) = expr;
884 /* Finish the body of a for-statement, which may be given by
885 FOR_STMT. The increment-EXPR for the loop must be
889 finish_for_stmt (tree for_stmt)
891 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
893 /* Pop the scope for the body of the loop. */
894 if (flag_new_for_scope > 0)
896 tree scope = TREE_CHAIN (for_stmt);
897 TREE_CHAIN (for_stmt) = NULL;
898 add_stmt (do_poplevel (scope));
904 /* Finish a break-statement. */
907 finish_break_stmt (void)
909 return add_stmt (build_stmt (BREAK_STMT));
912 /* Finish a continue-statement. */
915 finish_continue_stmt (void)
917 return add_stmt (build_stmt (CONTINUE_STMT));
920 /* Begin a switch-statement. Returns a new SWITCH_STMT if
924 begin_switch_stmt (void)
928 r = build_stmt (SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
930 scope = do_pushlevel (sk_block);
931 TREE_CHAIN (r) = scope;
932 begin_cond (&SWITCH_STMT_COND (r));
937 /* Finish the cond of a switch-statement. */
940 finish_switch_cond (tree cond, tree switch_stmt)
942 tree orig_type = NULL;
943 if (!processing_template_decl)
947 /* Convert the condition to an integer or enumeration type. */
948 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
949 if (cond == NULL_TREE)
951 error ("switch quantity not an integer");
952 cond = error_mark_node;
954 orig_type = TREE_TYPE (cond);
955 if (cond != error_mark_node)
959 Integral promotions are performed. */
960 cond = perform_integral_promotions (cond);
961 cond = maybe_cleanup_point_expr (cond);
964 if (cond != error_mark_node)
966 index = get_unwidened (cond, NULL_TREE);
967 /* We can't strip a conversion from a signed type to an unsigned,
968 because if we did, int_fits_type_p would do the wrong thing
969 when checking case values for being in range,
970 and it's too hard to do the right thing. */
971 if (TYPE_UNSIGNED (TREE_TYPE (cond))
972 == TYPE_UNSIGNED (TREE_TYPE (index)))
976 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
977 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
978 add_stmt (switch_stmt);
979 push_switch (switch_stmt);
980 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
981 check_for_bare_parameter_packs (cond);
984 /* Finish the body of a switch-statement, which may be given by
985 SWITCH_STMT. The COND to switch on is indicated. */
988 finish_switch_stmt (tree switch_stmt)
992 SWITCH_STMT_BODY (switch_stmt) =
993 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
997 scope = TREE_CHAIN (switch_stmt);
998 TREE_CHAIN (switch_stmt) = NULL;
999 add_stmt (do_poplevel (scope));
1002 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1006 begin_try_block (void)
1008 tree r = build_stmt (TRY_BLOCK, NULL_TREE, NULL_TREE);
1010 TRY_STMTS (r) = push_stmt_list ();
1014 /* Likewise, for a function-try-block. The block returned in
1015 *COMPOUND_STMT is an artificial outer scope, containing the
1016 function-try-block. */
1019 begin_function_try_block (tree *compound_stmt)
1022 /* This outer scope does not exist in the C++ standard, but we need
1023 a place to put __FUNCTION__ and similar variables. */
1024 *compound_stmt = begin_compound_stmt (0);
1025 r = begin_try_block ();
1026 FN_TRY_BLOCK_P (r) = 1;
1030 /* Finish a try-block, which may be given by TRY_BLOCK. */
1033 finish_try_block (tree try_block)
1035 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1036 TRY_HANDLERS (try_block) = push_stmt_list ();
1039 /* Finish the body of a cleanup try-block, which may be given by
1043 finish_cleanup_try_block (tree try_block)
1045 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1048 /* Finish an implicitly generated try-block, with a cleanup is given
1052 finish_cleanup (tree cleanup, tree try_block)
1054 TRY_HANDLERS (try_block) = cleanup;
1055 CLEANUP_P (try_block) = 1;
1058 /* Likewise, for a function-try-block. */
1061 finish_function_try_block (tree try_block)
1063 finish_try_block (try_block);
1064 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1065 the try block, but moving it inside. */
1066 in_function_try_handler = 1;
1069 /* Finish a handler-sequence for a try-block, which may be given by
1073 finish_handler_sequence (tree try_block)
1075 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1076 check_handlers (TRY_HANDLERS (try_block));
1079 /* Finish the handler-seq for a function-try-block, given by
1080 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1081 begin_function_try_block. */
1084 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1086 in_function_try_handler = 0;
1087 finish_handler_sequence (try_block);
1088 finish_compound_stmt (compound_stmt);
1091 /* Begin a handler. Returns a HANDLER if appropriate. */
1094 begin_handler (void)
1098 r = build_stmt (HANDLER, NULL_TREE, NULL_TREE);
1101 /* Create a binding level for the eh_info and the exception object
1103 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1108 /* Finish the handler-parameters for a handler, which may be given by
1109 HANDLER. DECL is the declaration for the catch parameter, or NULL
1110 if this is a `catch (...)' clause. */
1113 finish_handler_parms (tree decl, tree handler)
1115 tree type = NULL_TREE;
1116 if (processing_template_decl)
1120 decl = pushdecl (decl);
1121 decl = push_template_decl (decl);
1122 HANDLER_PARMS (handler) = decl;
1123 type = TREE_TYPE (decl);
1127 type = expand_start_catch_block (decl);
1128 HANDLER_TYPE (handler) = type;
1129 if (!processing_template_decl && type)
1130 mark_used (eh_type_info (type));
1133 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1134 the return value from the matching call to finish_handler_parms. */
1137 finish_handler (tree handler)
1139 if (!processing_template_decl)
1140 expand_end_catch_block ();
1141 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1144 /* Begin a compound statement. FLAGS contains some bits that control the
1145 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1146 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1147 block of a function. If BCS_TRY_BLOCK is set, this is the block
1148 created on behalf of a TRY statement. Returns a token to be passed to
1149 finish_compound_stmt. */
1152 begin_compound_stmt (unsigned int flags)
1156 if (flags & BCS_NO_SCOPE)
1158 r = push_stmt_list ();
1159 STATEMENT_LIST_NO_SCOPE (r) = 1;
1161 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1162 But, if it's a statement-expression with a scopeless block, there's
1163 nothing to keep, and we don't want to accidentally keep a block
1164 *inside* the scopeless block. */
1165 keep_next_level (false);
1168 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1170 /* When processing a template, we need to remember where the braces were,
1171 so that we can set up identical scopes when instantiating the template
1172 later. BIND_EXPR is a handy candidate for this.
1173 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1174 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1175 processing templates. */
1176 if (processing_template_decl)
1178 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1179 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1180 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1181 TREE_SIDE_EFFECTS (r) = 1;
1187 /* Finish a compound-statement, which is given by STMT. */
1190 finish_compound_stmt (tree stmt)
1192 if (TREE_CODE (stmt) == BIND_EXPR)
1193 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1194 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1195 stmt = pop_stmt_list (stmt);
1198 /* Destroy any ObjC "super" receivers that may have been
1200 objc_clear_super_receiver ();
1202 stmt = do_poplevel (stmt);
1205 /* ??? See c_end_compound_stmt wrt statement expressions. */
1210 /* Finish an asm-statement, whose components are a STRING, some
1211 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1212 whether the asm-statement should be considered volatile. */
1215 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1216 tree input_operands, tree clobbers)
1220 int ninputs = list_length (input_operands);
1221 int noutputs = list_length (output_operands);
1223 if (!processing_template_decl)
1225 const char *constraint;
1226 const char **oconstraints;
1227 bool allows_mem, allows_reg, is_inout;
1231 oconstraints = (const char **) alloca (noutputs * sizeof (char *));
1233 string = resolve_asm_operand_names (string, output_operands,
1236 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1238 operand = TREE_VALUE (t);
1240 /* ??? Really, this should not be here. Users should be using a
1241 proper lvalue, dammit. But there's a long history of using
1242 casts in the output operands. In cases like longlong.h, this
1243 becomes a primitive form of typechecking -- if the cast can be
1244 removed, then the output operand had a type of the proper width;
1245 otherwise we'll get an error. Gross, but ... */
1246 STRIP_NOPS (operand);
1248 if (!lvalue_or_else (operand, lv_asm))
1249 operand = error_mark_node;
1251 if (operand != error_mark_node
1252 && (TREE_READONLY (operand)
1253 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1254 /* Functions are not modifiable, even though they are
1256 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1257 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1258 /* If it's an aggregate and any field is const, then it is
1259 effectively const. */
1260 || (CLASS_TYPE_P (TREE_TYPE (operand))
1261 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1262 readonly_error (operand, "assignment (via 'asm' output)");
1264 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1265 oconstraints[i] = constraint;
1267 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1268 &allows_mem, &allows_reg, &is_inout))
1270 /* If the operand is going to end up in memory,
1271 mark it addressable. */
1272 if (!allows_reg && !cxx_mark_addressable (operand))
1273 operand = error_mark_node;
1276 operand = error_mark_node;
1278 TREE_VALUE (t) = operand;
1281 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1283 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1284 operand = decay_conversion (TREE_VALUE (t));
1286 /* If the type of the operand hasn't been determined (e.g.,
1287 because it involves an overloaded function), then issue
1288 an error message. There's no context available to
1289 resolve the overloading. */
1290 if (TREE_TYPE (operand) == unknown_type_node)
1292 error ("type of asm operand %qE could not be determined",
1294 operand = error_mark_node;
1297 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1298 oconstraints, &allows_mem, &allows_reg))
1300 /* If the operand is going to end up in memory,
1301 mark it addressable. */
1302 if (!allows_reg && allows_mem)
1304 /* Strip the nops as we allow this case. FIXME, this really
1305 should be rejected or made deprecated. */
1306 STRIP_NOPS (operand);
1307 if (!cxx_mark_addressable (operand))
1308 operand = error_mark_node;
1312 operand = error_mark_node;
1314 TREE_VALUE (t) = operand;
1318 r = build_stmt (ASM_EXPR, string,
1319 output_operands, input_operands,
1321 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1322 r = maybe_cleanup_point_expr_void (r);
1323 return add_stmt (r);
1326 /* Finish a label with the indicated NAME. */
1329 finish_label_stmt (tree name)
1331 tree decl = define_label (input_location, name);
1333 if (decl == error_mark_node)
1334 return error_mark_node;
1336 return add_stmt (build_stmt (LABEL_EXPR, decl));
1339 /* Finish a series of declarations for local labels. G++ allows users
1340 to declare "local" labels, i.e., labels with scope. This extension
1341 is useful when writing code involving statement-expressions. */
1344 finish_label_decl (tree name)
1346 if (!at_function_scope_p ())
1348 error ("__label__ declarations are only allowed in function scopes");
1352 add_decl_expr (declare_local_label (name));
1355 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1358 finish_decl_cleanup (tree decl, tree cleanup)
1360 push_cleanup (decl, cleanup, false);
1363 /* If the current scope exits with an exception, run CLEANUP. */
1366 finish_eh_cleanup (tree cleanup)
1368 push_cleanup (NULL, cleanup, true);
1371 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1372 order they were written by the user. Each node is as for
1373 emit_mem_initializers. */
1376 finish_mem_initializers (tree mem_inits)
1378 /* Reorder the MEM_INITS so that they are in the order they appeared
1379 in the source program. */
1380 mem_inits = nreverse (mem_inits);
1382 if (processing_template_decl)
1386 for (mem = mem_inits; mem; mem = TREE_CHAIN (mem))
1388 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1389 check for bare parameter packs in the TREE_VALUE, because
1390 any parameter packs in the TREE_VALUE have already been
1391 bound as part of the TREE_PURPOSE. See
1392 make_pack_expansion for more information. */
1393 if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION)
1394 check_for_bare_parameter_packs (TREE_VALUE (mem));
1397 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1400 emit_mem_initializers (mem_inits);
1403 /* Finish a parenthesized expression EXPR. */
1406 finish_parenthesized_expr (tree expr)
1409 /* This inhibits warnings in c_common_truthvalue_conversion. */
1410 TREE_NO_WARNING (expr) = 1;
1412 if (TREE_CODE (expr) == OFFSET_REF)
1413 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1414 enclosed in parentheses. */
1415 PTRMEM_OK_P (expr) = 0;
1417 if (TREE_CODE (expr) == STRING_CST)
1418 PAREN_STRING_LITERAL_P (expr) = 1;
1423 /* Finish a reference to a non-static data member (DECL) that is not
1424 preceded by `.' or `->'. */
1427 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1429 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1433 if (current_function_decl
1434 && DECL_STATIC_FUNCTION_P (current_function_decl))
1435 error ("invalid use of member %q+D in static member function", decl);
1437 error ("invalid use of non-static data member %q+D", decl);
1438 error ("from this location");
1440 return error_mark_node;
1442 TREE_USED (current_class_ptr) = 1;
1443 if (processing_template_decl && !qualifying_scope)
1445 tree type = TREE_TYPE (decl);
1447 if (TREE_CODE (type) == REFERENCE_TYPE)
1448 type = TREE_TYPE (type);
1451 /* Set the cv qualifiers. */
1452 int quals = cp_type_quals (TREE_TYPE (current_class_ref));
1454 if (DECL_MUTABLE_P (decl))
1455 quals &= ~TYPE_QUAL_CONST;
1457 quals |= cp_type_quals (TREE_TYPE (decl));
1458 type = cp_build_qualified_type (type, quals);
1461 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1465 tree access_type = TREE_TYPE (object);
1466 tree lookup_context = context_for_name_lookup (decl);
1468 while (!DERIVED_FROM_P (lookup_context, access_type))
1470 access_type = TYPE_CONTEXT (access_type);
1471 while (access_type && DECL_P (access_type))
1472 access_type = DECL_CONTEXT (access_type);
1476 error ("object missing in reference to %q+D", decl);
1477 error ("from this location");
1478 return error_mark_node;
1482 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1483 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1485 if (processing_template_decl)
1486 return build_qualified_name (TREE_TYPE (decl),
1489 /*template_p=*/false);
1491 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1494 /* If the data member was named `C::M', convert `*this' to `C'
1496 if (qualifying_scope)
1498 tree binfo = NULL_TREE;
1499 object = build_scoped_ref (object, qualifying_scope,
1503 return build_class_member_access_expr (object, decl,
1504 /*access_path=*/NULL_TREE,
1505 /*preserve_reference=*/false);
1509 /* DECL was the declaration to which a qualified-id resolved. Issue
1510 an error message if it is not accessible. If OBJECT_TYPE is
1511 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1512 type of `*x', or `x', respectively. If the DECL was named as
1513 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1516 check_accessibility_of_qualified_id (tree decl,
1518 tree nested_name_specifier)
1521 tree qualifying_type = NULL_TREE;
1523 /* If we're not checking, return immediately. */
1524 if (deferred_access_no_check)
1527 /* Determine the SCOPE of DECL. */
1528 scope = context_for_name_lookup (decl);
1529 /* If the SCOPE is not a type, then DECL is not a member. */
1530 if (!TYPE_P (scope))
1532 /* Compute the scope through which DECL is being accessed. */
1534 /* OBJECT_TYPE might not be a class type; consider:
1536 class A { typedef int I; };
1540 In this case, we will have "A::I" as the DECL, but "I" as the
1542 && CLASS_TYPE_P (object_type)
1543 && DERIVED_FROM_P (scope, object_type))
1544 /* If we are processing a `->' or `.' expression, use the type of the
1546 qualifying_type = object_type;
1547 else if (nested_name_specifier)
1549 /* If the reference is to a non-static member of the
1550 current class, treat it as if it were referenced through
1552 if (DECL_NONSTATIC_MEMBER_P (decl)
1553 && current_class_ptr
1554 && DERIVED_FROM_P (scope, current_class_type))
1555 qualifying_type = current_class_type;
1556 /* Otherwise, use the type indicated by the
1557 nested-name-specifier. */
1559 qualifying_type = nested_name_specifier;
1562 /* Otherwise, the name must be from the current class or one of
1564 qualifying_type = currently_open_derived_class (scope);
1567 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1568 or similar in a default argument value. */
1569 && CLASS_TYPE_P (qualifying_type)
1570 && !dependent_type_p (qualifying_type))
1571 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1575 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1576 class named to the left of the "::" operator. DONE is true if this
1577 expression is a complete postfix-expression; it is false if this
1578 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1579 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1580 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1581 is true iff this qualified name appears as a template argument. */
1584 finish_qualified_id_expr (tree qualifying_class,
1589 bool template_arg_p)
1591 gcc_assert (TYPE_P (qualifying_class));
1593 if (error_operand_p (expr))
1594 return error_mark_node;
1596 if (DECL_P (expr) || BASELINK_P (expr))
1600 check_template_keyword (expr);
1602 /* If EXPR occurs as the operand of '&', use special handling that
1603 permits a pointer-to-member. */
1604 if (address_p && done)
1606 if (TREE_CODE (expr) == SCOPE_REF)
1607 expr = TREE_OPERAND (expr, 1);
1608 expr = build_offset_ref (qualifying_class, expr,
1609 /*address_p=*/true);
1613 /* Within the scope of a class, turn references to non-static
1614 members into expression of the form "this->...". */
1616 /* But, within a template argument, we do not want make the
1617 transformation, as there is no "this" pointer. */
1619 else if (TREE_CODE (expr) == FIELD_DECL)
1620 expr = finish_non_static_data_member (expr, current_class_ref,
1622 else if (BASELINK_P (expr) && !processing_template_decl)
1626 /* See if any of the functions are non-static members. */
1627 fns = BASELINK_FUNCTIONS (expr);
1628 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1629 fns = TREE_OPERAND (fns, 0);
1630 /* If so, the expression may be relative to the current
1632 if (!shared_member_p (fns)
1633 && current_class_type
1634 && DERIVED_FROM_P (qualifying_class, current_class_type))
1635 expr = (build_class_member_access_expr
1636 (maybe_dummy_object (qualifying_class, NULL),
1638 BASELINK_ACCESS_BINFO (expr),
1639 /*preserve_reference=*/false));
1641 /* The expression is a qualified name whose address is not
1643 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1649 /* Begin a statement-expression. The value returned must be passed to
1650 finish_stmt_expr. */
1653 begin_stmt_expr (void)
1655 return push_stmt_list ();
1658 /* Process the final expression of a statement expression. EXPR can be
1659 NULL, if the final expression is empty. Return a STATEMENT_LIST
1660 containing all the statements in the statement-expression, or
1661 ERROR_MARK_NODE if there was an error. */
1664 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1666 if (error_operand_p (expr))
1668 /* The type of the statement-expression is the type of the last
1670 TREE_TYPE (stmt_expr) = error_mark_node;
1671 return error_mark_node;
1674 /* If the last statement does not have "void" type, then the value
1675 of the last statement is the value of the entire expression. */
1678 tree type = TREE_TYPE (expr);
1680 if (processing_template_decl)
1682 expr = build_stmt (EXPR_STMT, expr);
1683 expr = add_stmt (expr);
1684 /* Mark the last statement so that we can recognize it as such at
1685 template-instantiation time. */
1686 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1688 else if (VOID_TYPE_P (type))
1690 /* Just treat this like an ordinary statement. */
1691 expr = finish_expr_stmt (expr);
1695 /* It actually has a value we need to deal with. First, force it
1696 to be an rvalue so that we won't need to build up a copy
1697 constructor call later when we try to assign it to something. */
1698 expr = force_rvalue (expr);
1699 if (error_operand_p (expr))
1700 return error_mark_node;
1702 /* Update for array-to-pointer decay. */
1703 type = TREE_TYPE (expr);
1705 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1706 normal statement, but don't convert to void or actually add
1708 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1709 expr = maybe_cleanup_point_expr (expr);
1713 /* The type of the statement-expression is the type of the last
1715 TREE_TYPE (stmt_expr) = type;
1721 /* Finish a statement-expression. EXPR should be the value returned
1722 by the previous begin_stmt_expr. Returns an expression
1723 representing the statement-expression. */
1726 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1731 if (error_operand_p (stmt_expr))
1732 return error_mark_node;
1734 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1736 type = TREE_TYPE (stmt_expr);
1737 result = pop_stmt_list (stmt_expr);
1738 TREE_TYPE (result) = type;
1740 if (processing_template_decl)
1742 result = build_min (STMT_EXPR, type, result);
1743 TREE_SIDE_EFFECTS (result) = 1;
1744 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1746 else if (CLASS_TYPE_P (type))
1748 /* Wrap the statement-expression in a TARGET_EXPR so that the
1749 temporary object created by the final expression is destroyed at
1750 the end of the full-expression containing the
1751 statement-expression. */
1752 result = force_target_expr (type, result);
1758 /* Perform Koenig lookup. FN is the postfix-expression representing
1759 the function (or functions) to call; ARGS are the arguments to the
1760 call. Returns the functions to be considered by overload
1764 perform_koenig_lookup (tree fn, tree args)
1766 tree identifier = NULL_TREE;
1767 tree functions = NULL_TREE;
1769 /* Find the name of the overloaded function. */
1770 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1772 else if (is_overloaded_fn (fn))
1775 identifier = DECL_NAME (get_first_fn (functions));
1777 else if (DECL_P (fn))
1780 identifier = DECL_NAME (fn);
1783 /* A call to a namespace-scope function using an unqualified name.
1785 Do Koenig lookup -- unless any of the arguments are
1787 if (!any_type_dependent_arguments_p (args))
1789 fn = lookup_arg_dependent (identifier, functions, args);
1791 /* The unqualified name could not be resolved. */
1792 fn = unqualified_fn_lookup_error (identifier);
1798 /* Generate an expression for `FN (ARGS)'.
1800 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1801 as a virtual call, even if FN is virtual. (This flag is set when
1802 encountering an expression where the function name is explicitly
1803 qualified. For example a call to `X::f' never generates a virtual
1806 Returns code for the call. */
1809 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p)
1815 if (fn == error_mark_node || args == error_mark_node)
1816 return error_mark_node;
1818 /* ARGS should be a list of arguments. */
1819 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1820 gcc_assert (!TYPE_P (fn));
1825 if (processing_template_decl)
1827 if (type_dependent_expression_p (fn)
1828 || any_type_dependent_arguments_p (args))
1830 result = build_nt_call_list (fn, args);
1831 KOENIG_LOOKUP_P (result) = koenig_p;
1834 if (!BASELINK_P (fn)
1835 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1836 && TREE_TYPE (fn) != unknown_type_node)
1837 fn = build_non_dependent_expr (fn);
1838 args = build_non_dependent_args (orig_args);
1841 if (is_overloaded_fn (fn))
1842 fn = baselink_for_fns (fn);
1845 if (BASELINK_P (fn))
1849 /* A call to a member function. From [over.call.func]:
1851 If the keyword this is in scope and refers to the class of
1852 that member function, or a derived class thereof, then the
1853 function call is transformed into a qualified function call
1854 using (*this) as the postfix-expression to the left of the
1855 . operator.... [Otherwise] a contrived object of type T
1856 becomes the implied object argument.
1858 This paragraph is unclear about this situation:
1860 struct A { void f(); };
1861 struct B : public A {};
1862 struct C : public A { void g() { B::f(); }};
1864 In particular, for `B::f', this paragraph does not make clear
1865 whether "the class of that member function" refers to `A' or
1866 to `B'. We believe it refers to `B'. */
1867 if (current_class_type
1868 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1870 && current_class_ref)
1871 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1875 tree representative_fn;
1877 representative_fn = BASELINK_FUNCTIONS (fn);
1878 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1879 representative_fn = TREE_OPERAND (representative_fn, 0);
1880 representative_fn = get_first_fn (representative_fn);
1881 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1884 if (processing_template_decl)
1886 if (type_dependent_expression_p (object))
1887 return build_nt_call_list (orig_fn, orig_args);
1888 object = build_non_dependent_expr (object);
1891 result = build_new_method_call (object, fn, args, NULL_TREE,
1893 ? LOOKUP_NONVIRTUAL : 0),
1896 else if (is_overloaded_fn (fn))
1898 /* If the function is an overloaded builtin, resolve it. */
1899 if (TREE_CODE (fn) == FUNCTION_DECL
1900 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
1901 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
1902 result = resolve_overloaded_builtin (fn, args);
1905 /* A call to a namespace-scope function. */
1906 result = build_new_function_call (fn, args, koenig_p);
1908 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1911 error ("arguments to destructor are not allowed");
1912 /* Mark the pseudo-destructor call as having side-effects so
1913 that we do not issue warnings about its use. */
1914 result = build1 (NOP_EXPR,
1916 TREE_OPERAND (fn, 0));
1917 TREE_SIDE_EFFECTS (result) = 1;
1919 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1920 /* If the "function" is really an object of class type, it might
1921 have an overloaded `operator ()'. */
1922 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1923 /*overloaded_p=*/NULL);
1926 /* A call where the function is unknown. */
1927 result = build_function_call (fn, args);
1929 if (processing_template_decl)
1931 result = build_call_list (TREE_TYPE (result), orig_fn, orig_args);
1932 KOENIG_LOOKUP_P (result) = koenig_p;
1937 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1938 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1939 POSTDECREMENT_EXPR.) */
1942 finish_increment_expr (tree expr, enum tree_code code)
1944 return build_x_unary_op (code, expr);
1947 /* Finish a use of `this'. Returns an expression for `this'. */
1950 finish_this_expr (void)
1954 if (current_class_ptr)
1956 result = current_class_ptr;
1958 else if (current_function_decl
1959 && DECL_STATIC_FUNCTION_P (current_function_decl))
1961 error ("%<this%> is unavailable for static member functions");
1962 result = error_mark_node;
1966 if (current_function_decl)
1967 error ("invalid use of %<this%> in non-member function");
1969 error ("invalid use of %<this%> at top level");
1970 result = error_mark_node;
1976 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
1977 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
1978 the TYPE for the type given. If SCOPE is non-NULL, the expression
1979 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
1982 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
1984 if (destructor == error_mark_node)
1985 return error_mark_node;
1987 gcc_assert (TYPE_P (destructor));
1989 if (!processing_template_decl)
1991 if (scope == error_mark_node)
1993 error ("invalid qualifying scope in pseudo-destructor name");
1994 return error_mark_node;
1996 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
1998 error ("qualified type %qT does not match destructor name ~%qT",
2000 return error_mark_node;
2004 /* [expr.pseudo] says both:
2006 The type designated by the pseudo-destructor-name shall be
2007 the same as the object type.
2011 The cv-unqualified versions of the object type and of the
2012 type designated by the pseudo-destructor-name shall be the
2015 We implement the more generous second sentence, since that is
2016 what most other compilers do. */
2017 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2020 error ("%qE is not of type %qT", object, destructor);
2021 return error_mark_node;
2025 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2028 /* Finish an expression of the form CODE EXPR. */
2031 finish_unary_op_expr (enum tree_code code, tree expr)
2033 tree result = build_x_unary_op (code, expr);
2034 /* Inside a template, build_x_unary_op does not fold the
2035 expression. So check whether the result is folded before
2036 setting TREE_NEGATED_INT. */
2037 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2038 && TREE_CODE (result) == INTEGER_CST
2039 && !TYPE_UNSIGNED (TREE_TYPE (result))
2040 && INT_CST_LT (result, integer_zero_node))
2042 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2043 setting TREE_NEGATED_INT. */
2044 result = copy_node (result);
2045 TREE_NEGATED_INT (result) = 1;
2047 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2048 overflow_warning (result);
2053 /* Finish a compound-literal expression. TYPE is the type to which
2054 the INITIALIZER_LIST is being cast. */
2057 finish_compound_literal (tree type, VEC(constructor_elt,gc) *initializer_list)
2060 tree compound_literal;
2062 if (!TYPE_OBJ_P (type))
2064 error ("compound literal of non-object type %qT", type);
2065 return error_mark_node;
2068 /* Build a CONSTRUCTOR for the INITIALIZER_LIST. */
2069 compound_literal = build_constructor (NULL_TREE, initializer_list);
2070 if (processing_template_decl)
2072 TREE_TYPE (compound_literal) = type;
2073 /* Mark the expression as a compound literal. */
2074 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2075 return compound_literal;
2078 /* Create a temporary variable to represent the compound literal. */
2079 var = create_temporary_var (type);
2080 if (!current_function_decl)
2082 /* If this compound-literal appears outside of a function, then
2083 the corresponding variable has static storage duration, just
2084 like the variable in whose initializer it appears. */
2085 TREE_STATIC (var) = 1;
2086 /* The variable has internal linkage, since there is no need to
2087 reference it from another translation unit. */
2088 TREE_PUBLIC (var) = 0;
2089 /* It must have a name, so that the name mangler can mangle it. */
2090 DECL_NAME (var) = make_anon_name ();
2092 /* We must call pushdecl, since the gimplifier complains if the
2093 variable has not been declared via a BIND_EXPR. */
2095 /* Initialize the variable as we would any other variable with a
2096 brace-enclosed initializer. */
2097 cp_finish_decl (var, compound_literal,
2098 /*init_const_expr_p=*/false,
2099 /*asmspec_tree=*/NULL_TREE,
2100 LOOKUP_ONLYCONVERTING);
2104 /* Return the declaration for the function-name variable indicated by
2108 finish_fname (tree id)
2112 decl = fname_decl (C_RID_CODE (id), id);
2113 if (processing_template_decl)
2114 decl = DECL_NAME (decl);
2118 /* Finish a translation unit. */
2121 finish_translation_unit (void)
2123 /* In case there were missing closebraces,
2124 get us back to the global binding level. */
2126 while (current_namespace != global_namespace)
2129 /* Do file scope __FUNCTION__ et al. */
2130 finish_fname_decls ();
2133 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2134 Returns the parameter. */
2137 finish_template_type_parm (tree aggr, tree identifier)
2139 if (aggr != class_type_node)
2141 pedwarn ("template type parameters must use the keyword %<class%> or %<typename%>");
2142 aggr = class_type_node;
2145 return build_tree_list (aggr, identifier);
2148 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2149 Returns the parameter. */
2152 finish_template_template_parm (tree aggr, tree identifier)
2154 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2155 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2156 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2157 DECL_TEMPLATE_RESULT (tmpl) = decl;
2158 DECL_ARTIFICIAL (decl) = 1;
2159 end_template_decl ();
2161 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2163 return finish_template_type_parm (aggr, tmpl);
2166 /* ARGUMENT is the default-argument value for a template template
2167 parameter. If ARGUMENT is invalid, issue error messages and return
2168 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2171 check_template_template_default_arg (tree argument)
2173 if (TREE_CODE (argument) != TEMPLATE_DECL
2174 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2175 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2177 if (TREE_CODE (argument) == TYPE_DECL)
2178 error ("invalid use of type %qT as a default value for a template "
2179 "template-parameter", TREE_TYPE (argument));
2181 error ("invalid default argument for a template template parameter");
2182 return error_mark_node;
2188 /* Begin a class definition, as indicated by T. */
2191 begin_class_definition (tree t, tree attributes)
2193 if (t == error_mark_node)
2194 return error_mark_node;
2196 if (processing_template_parmlist)
2198 error ("definition of %q#T inside template parameter list", t);
2199 return error_mark_node;
2201 /* A non-implicit typename comes from code like:
2203 template <typename T> struct A {
2204 template <typename U> struct A<T>::B ...
2206 This is erroneous. */
2207 else if (TREE_CODE (t) == TYPENAME_TYPE)
2209 error ("invalid definition of qualified type %qT", t);
2210 t = error_mark_node;
2213 if (t == error_mark_node || ! IS_AGGR_TYPE (t))
2215 t = make_aggr_type (RECORD_TYPE);
2216 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2219 /* Update the location of the decl. */
2220 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2222 if (TYPE_BEING_DEFINED (t))
2224 t = make_aggr_type (TREE_CODE (t));
2225 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2227 maybe_process_partial_specialization (t);
2229 TYPE_BEING_DEFINED (t) = 1;
2231 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2233 if (flag_pack_struct)
2236 TYPE_PACKED (t) = 1;
2237 /* Even though the type is being defined for the first time
2238 here, there might have been a forward declaration, so there
2239 might be cv-qualified variants of T. */
2240 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2241 TYPE_PACKED (v) = 1;
2243 /* Reset the interface data, at the earliest possible
2244 moment, as it might have been set via a class foo;
2246 if (! TYPE_ANONYMOUS_P (t))
2248 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2249 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2250 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2251 (t, finfo->interface_unknown);
2253 reset_specialization();
2255 /* Make a declaration for this class in its own scope. */
2256 build_self_reference ();
2261 /* Finish the member declaration given by DECL. */
2264 finish_member_declaration (tree decl)
2266 if (decl == error_mark_node || decl == NULL_TREE)
2269 if (decl == void_type_node)
2270 /* The COMPONENT was a friend, not a member, and so there's
2271 nothing for us to do. */
2274 /* We should see only one DECL at a time. */
2275 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2277 /* Set up access control for DECL. */
2279 = (current_access_specifier == access_private_node);
2280 TREE_PROTECTED (decl)
2281 = (current_access_specifier == access_protected_node);
2282 if (TREE_CODE (decl) == TEMPLATE_DECL)
2284 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2285 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2288 /* Mark the DECL as a member of the current class. */
2289 DECL_CONTEXT (decl) = current_class_type;
2291 /* Check for bare parameter packs in the member variable declaration. */
2292 if (TREE_CODE (decl) == FIELD_DECL
2293 && !check_for_bare_parameter_packs (TREE_TYPE (decl)))
2294 TREE_TYPE (decl) = error_mark_node;
2298 A C language linkage is ignored for the names of class members
2299 and the member function type of class member functions. */
2300 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2301 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2303 /* Put functions on the TYPE_METHODS list and everything else on the
2304 TYPE_FIELDS list. Note that these are built up in reverse order.
2305 We reverse them (to obtain declaration order) in finish_struct. */
2306 if (TREE_CODE (decl) == FUNCTION_DECL
2307 || DECL_FUNCTION_TEMPLATE_P (decl))
2309 /* We also need to add this function to the
2310 CLASSTYPE_METHOD_VEC. */
2311 if (add_method (current_class_type, decl, NULL_TREE))
2313 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2314 TYPE_METHODS (current_class_type) = decl;
2316 maybe_add_class_template_decl_list (current_class_type, decl,
2320 /* Enter the DECL into the scope of the class. */
2321 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2322 || pushdecl_class_level (decl))
2324 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2325 go at the beginning. The reason is that lookup_field_1
2326 searches the list in order, and we want a field name to
2327 override a type name so that the "struct stat hack" will
2328 work. In particular:
2330 struct S { enum E { }; int E } s;
2333 is valid. In addition, the FIELD_DECLs must be maintained in
2334 declaration order so that class layout works as expected.
2335 However, we don't need that order until class layout, so we
2336 save a little time by putting FIELD_DECLs on in reverse order
2337 here, and then reversing them in finish_struct_1. (We could
2338 also keep a pointer to the correct insertion points in the
2341 if (TREE_CODE (decl) == TYPE_DECL)
2342 TYPE_FIELDS (current_class_type)
2343 = chainon (TYPE_FIELDS (current_class_type), decl);
2346 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2347 TYPE_FIELDS (current_class_type) = decl;
2350 maybe_add_class_template_decl_list (current_class_type, decl,
2355 note_decl_for_pch (decl);
2358 /* DECL has been declared while we are building a PCH file. Perform
2359 actions that we might normally undertake lazily, but which can be
2360 performed now so that they do not have to be performed in
2361 translation units which include the PCH file. */
2364 note_decl_for_pch (tree decl)
2366 gcc_assert (pch_file);
2368 /* There's a good chance that we'll have to mangle names at some
2369 point, even if only for emission in debugging information. */
2370 if ((TREE_CODE (decl) == VAR_DECL
2371 || TREE_CODE (decl) == FUNCTION_DECL)
2372 && !processing_template_decl)
2376 /* Finish processing a complete template declaration. The PARMS are
2377 the template parameters. */
2380 finish_template_decl (tree parms)
2383 end_template_decl ();
2385 end_specialization ();
2388 /* Finish processing a template-id (which names a type) of the form
2389 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2390 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2391 the scope of template-id indicated. */
2394 finish_template_type (tree name, tree args, int entering_scope)
2398 decl = lookup_template_class (name, args,
2399 NULL_TREE, NULL_TREE, entering_scope,
2400 tf_warning_or_error | tf_user);
2401 if (decl != error_mark_node)
2402 decl = TYPE_STUB_DECL (decl);
2407 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2408 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2409 BASE_CLASS, or NULL_TREE if an error occurred. The
2410 ACCESS_SPECIFIER is one of
2411 access_{default,public,protected_private}_node. For a virtual base
2412 we set TREE_TYPE. */
2415 finish_base_specifier (tree base, tree access, bool virtual_p)
2419 if (base == error_mark_node)
2421 error ("invalid base-class specification");
2424 else if (! is_aggr_type (base, 1))
2428 if (cp_type_quals (base) != 0)
2430 error ("base class %qT has cv qualifiers", base);
2431 base = TYPE_MAIN_VARIANT (base);
2433 result = build_tree_list (access, base);
2435 TREE_TYPE (result) = integer_type_node;
2441 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2442 what we found when we tried to do the lookup. */
2445 qualified_name_lookup_error (tree scope, tree name, tree decl)
2447 if (scope == error_mark_node)
2448 ; /* We already complained. */
2449 else if (TYPE_P (scope))
2451 if (!COMPLETE_TYPE_P (scope))
2452 error ("incomplete type %qT used in nested name specifier", scope);
2453 else if (TREE_CODE (decl) == TREE_LIST)
2455 error ("reference to %<%T::%D%> is ambiguous", scope, name);
2456 print_candidates (decl);
2459 error ("%qD is not a member of %qT", name, scope);
2461 else if (scope != global_namespace)
2462 error ("%qD is not a member of %qD", name, scope);
2464 error ("%<::%D%> has not been declared", name);
2467 /* If FNS is a member function, a set of member functions, or a
2468 template-id referring to one or more member functions, return a
2469 BASELINK for FNS, incorporating the current access context.
2470 Otherwise, return FNS unchanged. */
2473 baselink_for_fns (tree fns)
2478 if (BASELINK_P (fns)
2479 || error_operand_p (fns))
2483 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2484 fn = TREE_OPERAND (fn, 0);
2485 fn = get_first_fn (fn);
2486 if (!DECL_FUNCTION_MEMBER_P (fn))
2489 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2491 cl = DECL_CONTEXT (fn);
2492 cl = TYPE_BINFO (cl);
2493 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2496 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2497 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2498 if non-NULL, is the type or namespace used to explicitly qualify
2499 ID_EXPRESSION. DECL is the entity to which that name has been
2502 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2503 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2504 be set to true if this expression isn't permitted in a
2505 constant-expression, but it is otherwise not set by this function.
2506 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2507 constant-expression, but a non-constant expression is also
2510 DONE is true if this expression is a complete postfix-expression;
2511 it is false if this expression is followed by '->', '[', '(', etc.
2512 ADDRESS_P is true iff this expression is the operand of '&'.
2513 TEMPLATE_P is true iff the qualified-id was of the form
2514 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2515 appears as a template argument.
2517 If an error occurs, and it is the kind of error that might cause
2518 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2519 is the caller's responsibility to issue the message. *ERROR_MSG
2520 will be a string with static storage duration, so the caller need
2523 Return an expression for the entity, after issuing appropriate
2524 diagnostics. This function is also responsible for transforming a
2525 reference to a non-static member into a COMPONENT_REF that makes
2526 the use of "this" explicit.
2528 Upon return, *IDK will be filled in appropriately. */
2531 finish_id_expression (tree id_expression,
2535 bool integral_constant_expression_p,
2536 bool allow_non_integral_constant_expression_p,
2537 bool *non_integral_constant_expression_p,
2541 bool template_arg_p,
2542 const char **error_msg)
2544 /* Initialize the output parameters. */
2545 *idk = CP_ID_KIND_NONE;
2548 if (id_expression == error_mark_node)
2549 return error_mark_node;
2550 /* If we have a template-id, then no further lookup is
2551 required. If the template-id was for a template-class, we
2552 will sometimes have a TYPE_DECL at this point. */
2553 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2554 || TREE_CODE (decl) == TYPE_DECL)
2556 /* Look up the name. */
2559 if (decl == error_mark_node)
2561 /* Name lookup failed. */
2564 || (!dependent_type_p (scope)
2565 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2566 && IDENTIFIER_TYPENAME_P (id_expression)
2567 && dependent_type_p (TREE_TYPE (id_expression))))))
2569 /* If the qualifying type is non-dependent (and the name
2570 does not name a conversion operator to a dependent
2571 type), issue an error. */
2572 qualified_name_lookup_error (scope, id_expression, decl);
2573 return error_mark_node;
2577 /* It may be resolved via Koenig lookup. */
2578 *idk = CP_ID_KIND_UNQUALIFIED;
2579 return id_expression;
2582 decl = id_expression;
2584 /* If DECL is a variable that would be out of scope under
2585 ANSI/ISO rules, but in scope in the ARM, name lookup
2586 will succeed. Issue a diagnostic here. */
2588 decl = check_for_out_of_scope_variable (decl);
2590 /* Remember that the name was used in the definition of
2591 the current class so that we can check later to see if
2592 the meaning would have been different after the class
2593 was entirely defined. */
2594 if (!scope && decl != error_mark_node)
2595 maybe_note_name_used_in_class (id_expression, decl);
2597 /* Disallow uses of local variables from containing functions. */
2598 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2600 tree context = decl_function_context (decl);
2601 if (context != NULL_TREE && context != current_function_decl
2602 && ! TREE_STATIC (decl))
2604 error (TREE_CODE (decl) == VAR_DECL
2605 ? "use of %<auto%> variable from containing function"
2606 : "use of parameter from containing function");
2607 error (" %q+#D declared here", decl);
2608 return error_mark_node;
2613 /* If we didn't find anything, or what we found was a type,
2614 then this wasn't really an id-expression. */
2615 if (TREE_CODE (decl) == TEMPLATE_DECL
2616 && !DECL_FUNCTION_TEMPLATE_P (decl))
2618 *error_msg = "missing template arguments";
2619 return error_mark_node;
2621 else if (TREE_CODE (decl) == TYPE_DECL
2622 || TREE_CODE (decl) == NAMESPACE_DECL)
2624 *error_msg = "expected primary-expression";
2625 return error_mark_node;
2628 /* If the name resolved to a template parameter, there is no
2629 need to look it up again later. */
2630 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2631 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2635 *idk = CP_ID_KIND_NONE;
2636 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2637 decl = TEMPLATE_PARM_DECL (decl);
2638 r = convert_from_reference (DECL_INITIAL (decl));
2640 if (integral_constant_expression_p
2641 && !dependent_type_p (TREE_TYPE (decl))
2642 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2644 if (!allow_non_integral_constant_expression_p)
2645 error ("template parameter %qD of type %qT is not allowed in "
2646 "an integral constant expression because it is not of "
2647 "integral or enumeration type", decl, TREE_TYPE (decl));
2648 *non_integral_constant_expression_p = true;
2652 /* Similarly, we resolve enumeration constants to their
2653 underlying values. */
2654 else if (TREE_CODE (decl) == CONST_DECL)
2656 *idk = CP_ID_KIND_NONE;
2657 if (!processing_template_decl)
2659 used_types_insert (TREE_TYPE (decl));
2660 return DECL_INITIAL (decl);
2668 /* If the declaration was explicitly qualified indicate
2669 that. The semantics of `A::f(3)' are different than
2670 `f(3)' if `f' is virtual. */
2672 ? CP_ID_KIND_QUALIFIED
2673 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2674 ? CP_ID_KIND_TEMPLATE_ID
2675 : CP_ID_KIND_UNQUALIFIED));
2680 An id-expression is type-dependent if it contains an
2681 identifier that was declared with a dependent type.
2683 The standard is not very specific about an id-expression that
2684 names a set of overloaded functions. What if some of them
2685 have dependent types and some of them do not? Presumably,
2686 such a name should be treated as a dependent name. */
2687 /* Assume the name is not dependent. */
2688 dependent_p = false;
2689 if (!processing_template_decl)
2690 /* No names are dependent outside a template. */
2692 /* A template-id where the name of the template was not resolved
2693 is definitely dependent. */
2694 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2695 && (TREE_CODE (TREE_OPERAND (decl, 0))
2696 == IDENTIFIER_NODE))
2698 /* For anything except an overloaded function, just check its
2700 else if (!is_overloaded_fn (decl))
2702 = dependent_type_p (TREE_TYPE (decl));
2703 /* For a set of overloaded functions, check each of the
2709 if (BASELINK_P (fns))
2710 fns = BASELINK_FUNCTIONS (fns);
2712 /* For a template-id, check to see if the template
2713 arguments are dependent. */
2714 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2716 tree args = TREE_OPERAND (fns, 1);
2717 dependent_p = any_dependent_template_arguments_p (args);
2718 /* The functions are those referred to by the
2720 fns = TREE_OPERAND (fns, 0);
2723 /* If there are no dependent template arguments, go through
2724 the overloaded functions. */
2725 while (fns && !dependent_p)
2727 tree fn = OVL_CURRENT (fns);
2729 /* Member functions of dependent classes are
2731 if (TREE_CODE (fn) == FUNCTION_DECL
2732 && type_dependent_expression_p (fn))
2734 else if (TREE_CODE (fn) == TEMPLATE_DECL
2735 && dependent_template_p (fn))
2738 fns = OVL_NEXT (fns);
2742 /* If the name was dependent on a template parameter, we will
2743 resolve the name at instantiation time. */
2746 /* Create a SCOPE_REF for qualified names, if the scope is
2750 /* Since this name was dependent, the expression isn't
2751 constant -- yet. No error is issued because it might
2752 be constant when things are instantiated. */
2753 if (integral_constant_expression_p)
2754 *non_integral_constant_expression_p = true;
2757 if (address_p && done)
2758 decl = finish_qualified_id_expr (scope, decl,
2762 else if (dependent_type_p (scope))
2763 decl = build_qualified_name (/*type=*/NULL_TREE,
2767 else if (DECL_P (decl))
2768 decl = build_qualified_name (TREE_TYPE (decl),
2773 if (TREE_TYPE (decl))
2774 decl = convert_from_reference (decl);
2777 /* A TEMPLATE_ID already contains all the information we
2779 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2780 return id_expression;
2781 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2782 /* If we found a variable, then name lookup during the
2783 instantiation will always resolve to the same VAR_DECL
2784 (or an instantiation thereof). */
2785 if (TREE_CODE (decl) == VAR_DECL
2786 || TREE_CODE (decl) == PARM_DECL)
2787 return convert_from_reference (decl);
2788 /* The same is true for FIELD_DECL, but we also need to
2789 make sure that the syntax is correct. */
2790 else if (TREE_CODE (decl) == FIELD_DECL)
2792 /* Since SCOPE is NULL here, this is an unqualified name.
2793 Access checking has been performed during name lookup
2794 already. Turn off checking to avoid duplicate errors. */
2795 push_deferring_access_checks (dk_no_check);
2796 decl = finish_non_static_data_member
2797 (decl, current_class_ref,
2798 /*qualifying_scope=*/NULL_TREE);
2799 pop_deferring_access_checks ();
2802 return id_expression;
2805 /* Only certain kinds of names are allowed in constant
2806 expression. Enumerators and template parameters have already
2807 been handled above. */
2808 if (integral_constant_expression_p
2809 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2810 && ! builtin_valid_in_constant_expr_p (decl))
2812 if (!allow_non_integral_constant_expression_p)
2814 error ("%qD cannot appear in a constant-expression", decl);
2815 return error_mark_node;
2817 *non_integral_constant_expression_p = true;
2820 if (TREE_CODE (decl) == NAMESPACE_DECL)
2822 error ("use of namespace %qD as expression", decl);
2823 return error_mark_node;
2825 else if (DECL_CLASS_TEMPLATE_P (decl))
2827 error ("use of class template %qT as expression", decl);
2828 return error_mark_node;
2830 else if (TREE_CODE (decl) == TREE_LIST)
2832 /* Ambiguous reference to base members. */
2833 error ("request for member %qD is ambiguous in "
2834 "multiple inheritance lattice", id_expression);
2835 print_candidates (decl);
2836 return error_mark_node;
2839 /* Mark variable-like entities as used. Functions are similarly
2840 marked either below or after overload resolution. */
2841 if (TREE_CODE (decl) == VAR_DECL
2842 || TREE_CODE (decl) == PARM_DECL
2843 || TREE_CODE (decl) == RESULT_DECL)
2848 decl = (adjust_result_of_qualified_name_lookup
2849 (decl, scope, current_class_type));
2851 if (TREE_CODE (decl) == FUNCTION_DECL)
2854 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2855 decl = finish_qualified_id_expr (scope,
2863 tree r = convert_from_reference (decl);
2865 if (processing_template_decl && TYPE_P (scope))
2866 r = build_qualified_name (TREE_TYPE (r),
2872 else if (TREE_CODE (decl) == FIELD_DECL)
2874 /* Since SCOPE is NULL here, this is an unqualified name.
2875 Access checking has been performed during name lookup
2876 already. Turn off checking to avoid duplicate errors. */
2877 push_deferring_access_checks (dk_no_check);
2878 decl = finish_non_static_data_member (decl, current_class_ref,
2879 /*qualifying_scope=*/NULL_TREE);
2880 pop_deferring_access_checks ();
2882 else if (is_overloaded_fn (decl))
2887 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
2888 first_fn = TREE_OPERAND (first_fn, 0);
2889 first_fn = get_first_fn (first_fn);
2890 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2891 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2893 if (!really_overloaded_fn (decl))
2894 mark_used (first_fn);
2897 && TREE_CODE (first_fn) == FUNCTION_DECL
2898 && DECL_FUNCTION_MEMBER_P (first_fn)
2899 && !shared_member_p (decl))
2901 /* A set of member functions. */
2902 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
2903 return finish_class_member_access_expr (decl, id_expression,
2904 /*template_p=*/false);
2907 decl = baselink_for_fns (decl);
2911 if (DECL_P (decl) && DECL_NONLOCAL (decl)
2912 && DECL_CLASS_SCOPE_P (decl)
2913 && DECL_CONTEXT (decl) != current_class_type)
2917 path = currently_open_derived_class (DECL_CONTEXT (decl));
2918 perform_or_defer_access_check (TYPE_BINFO (path), decl, decl);
2921 decl = convert_from_reference (decl);
2925 if (TREE_DEPRECATED (decl))
2926 warn_deprecated_use (decl);
2931 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
2932 use as a type-specifier. */
2935 finish_typeof (tree expr)
2939 if (type_dependent_expression_p (expr))
2941 type = make_aggr_type (TYPEOF_TYPE);
2942 TYPEOF_TYPE_EXPR (type) = expr;
2943 SET_TYPE_STRUCTURAL_EQUALITY (type);
2948 type = unlowered_expr_type (expr);
2950 if (!type || type == unknown_type_node)
2952 error ("type of %qE is unknown", expr);
2953 return error_mark_node;
2959 /* Perform C++-specific checks for __builtin_offsetof before calling
2963 finish_offsetof (tree expr)
2965 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
2967 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
2968 TREE_OPERAND (expr, 2));
2969 return error_mark_node;
2971 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
2972 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
2973 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
2975 if (TREE_CODE (expr) == COMPONENT_REF
2976 || TREE_CODE (expr) == COMPOUND_EXPR)
2977 expr = TREE_OPERAND (expr, 1);
2978 error ("cannot apply %<offsetof%> to member function %qD", expr);
2979 return error_mark_node;
2981 return fold_offsetof (expr, NULL_TREE);
2984 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
2985 with equivalent CALL_EXPRs. */
2988 simplify_aggr_init_exprs_r (tree* tp,
2990 void* data ATTRIBUTE_UNUSED)
2992 /* We don't need to walk into types; there's nothing in a type that
2993 needs simplification. (And, furthermore, there are places we
2994 actively don't want to go. For example, we don't want to wander
2995 into the default arguments for a FUNCTION_DECL that appears in a
3002 /* Only AGGR_INIT_EXPRs are interesting. */
3003 else if (TREE_CODE (*tp) != AGGR_INIT_EXPR)
3006 simplify_aggr_init_expr (tp);
3008 /* Keep iterating. */
3012 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3013 function is broken out from the above for the benefit of the tree-ssa
3017 simplify_aggr_init_expr (tree *tp)
3019 tree aggr_init_expr = *tp;
3021 /* Form an appropriate CALL_EXPR. */
3022 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3023 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3024 tree type = TREE_TYPE (slot);
3027 enum style_t { ctor, arg, pcc } style;
3029 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3031 #ifdef PCC_STATIC_STRUCT_RETURN
3037 gcc_assert (TREE_ADDRESSABLE (type));
3041 call_expr = build_call_array (TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3043 aggr_init_expr_nargs (aggr_init_expr),
3044 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3048 /* Replace the first argument to the ctor with the address of the
3050 cxx_mark_addressable (slot);
3051 CALL_EXPR_ARG (call_expr, 0) =
3052 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3054 else if (style == arg)
3056 /* Just mark it addressable here, and leave the rest to
3057 expand_call{,_inline}. */
3058 cxx_mark_addressable (slot);
3059 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3060 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3062 else if (style == pcc)
3064 /* If we're using the non-reentrant PCC calling convention, then we
3065 need to copy the returned value out of the static buffer into the
3067 push_deferring_access_checks (dk_no_check);
3068 call_expr = build_aggr_init (slot, call_expr,
3069 DIRECT_BIND | LOOKUP_ONLYCONVERTING);
3070 pop_deferring_access_checks ();
3071 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3077 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3080 emit_associated_thunks (tree fn)
3082 /* When we use vcall offsets, we emit thunks with the virtual
3083 functions to which they thunk. The whole point of vcall offsets
3084 is so that you can know statically the entire set of thunks that
3085 will ever be needed for a given virtual function, thereby
3086 enabling you to output all the thunks with the function itself. */
3087 if (DECL_VIRTUAL_P (fn))
3091 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3093 if (!THUNK_ALIAS (thunk))
3095 use_thunk (thunk, /*emit_p=*/1);
3096 if (DECL_RESULT_THUNK_P (thunk))
3100 for (probe = DECL_THUNKS (thunk);
3101 probe; probe = TREE_CHAIN (probe))
3102 use_thunk (probe, /*emit_p=*/1);
3106 gcc_assert (!DECL_THUNKS (thunk));
3111 /* Generate RTL for FN. */
3114 expand_body (tree fn)
3116 tree saved_function;
3118 /* Compute the appropriate object-file linkage for inline
3120 if (DECL_DECLARED_INLINE_P (fn))
3121 import_export_decl (fn);
3123 /* If FN is external, then there's no point in generating RTL for
3124 it. This situation can arise with an inline function under
3125 `-fexternal-templates'; we instantiate the function, even though
3126 we're not planning on emitting it, in case we get a chance to
3128 if (DECL_EXTERNAL (fn))
3131 /* ??? When is this needed? */
3132 saved_function = current_function_decl;
3134 /* Emit any thunks that should be emitted at the same time as FN. */
3135 emit_associated_thunks (fn);
3137 /* This function is only called from cgraph, or recursively from
3138 emit_associated_thunks. In neither case should we be currently
3139 generating trees for a function. */
3140 gcc_assert (function_depth == 0);
3144 current_function_decl = saved_function;
3146 if (DECL_CLONED_FUNCTION_P (fn))
3148 /* If this is a clone, go through the other clones now and mark
3149 their parameters used. We have to do that here, as we don't
3150 know whether any particular clone will be expanded, and
3151 therefore cannot pick one arbitrarily. */
3154 for (probe = TREE_CHAIN (DECL_CLONED_FUNCTION (fn));
3155 probe && DECL_CLONED_FUNCTION_P (probe);
3156 probe = TREE_CHAIN (probe))
3160 for (parms = DECL_ARGUMENTS (probe);
3161 parms; parms = TREE_CHAIN (parms))
3162 TREE_USED (parms) = 1;
3167 /* Generate RTL for FN. */
3170 expand_or_defer_fn (tree fn)
3172 /* When the parser calls us after finishing the body of a template
3173 function, we don't really want to expand the body. */
3174 if (processing_template_decl)
3176 /* Normally, collection only occurs in rest_of_compilation. So,
3177 if we don't collect here, we never collect junk generated
3178 during the processing of templates until we hit a
3179 non-template function. It's not safe to do this inside a
3180 nested class, though, as the parser may have local state that
3181 is not a GC root. */
3182 if (!function_depth)
3187 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
3188 walk_tree_without_duplicates (&DECL_SAVED_TREE (fn),
3189 simplify_aggr_init_exprs_r,
3192 /* If this is a constructor or destructor body, we have to clone
3194 if (maybe_clone_body (fn))
3196 /* We don't want to process FN again, so pretend we've written
3197 it out, even though we haven't. */
3198 TREE_ASM_WRITTEN (fn) = 1;
3202 /* We make a decision about linkage for these functions at the end
3203 of the compilation. Until that point, we do not want the back
3204 end to output them -- but we do want it to see the bodies of
3205 these functions so that it can inline them as appropriate. */
3206 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3208 if (DECL_INTERFACE_KNOWN (fn))
3209 /* We've already made a decision as to how this function will
3213 DECL_EXTERNAL (fn) = 1;
3214 DECL_NOT_REALLY_EXTERN (fn) = 1;
3215 note_vague_linkage_fn (fn);
3216 /* A non-template inline function with external linkage will
3217 always be COMDAT. As we must eventually determine the
3218 linkage of all functions, and as that causes writes to
3219 the data mapped in from the PCH file, it's advantageous
3220 to mark the functions at this point. */
3221 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3223 /* This function must have external linkage, as
3224 otherwise DECL_INTERFACE_KNOWN would have been
3226 gcc_assert (TREE_PUBLIC (fn));
3227 comdat_linkage (fn);
3228 DECL_INTERFACE_KNOWN (fn) = 1;
3232 import_export_decl (fn);
3234 /* If the user wants us to keep all inline functions, then mark
3235 this function as needed so that finish_file will make sure to
3237 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3241 /* There's no reason to do any of the work here if we're only doing
3242 semantic analysis; this code just generates RTL. */
3243 if (flag_syntax_only)
3248 /* Expand or defer, at the whim of the compilation unit manager. */
3249 cgraph_finalize_function (fn, function_depth > 1);
3261 /* Helper function for walk_tree, used by finalize_nrv below. */
3264 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3266 struct nrv_data *dp = (struct nrv_data *)data;
3269 /* No need to walk into types. There wouldn't be any need to walk into
3270 non-statements, except that we have to consider STMT_EXPRs. */
3273 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3274 but differs from using NULL_TREE in that it indicates that we care
3275 about the value of the RESULT_DECL. */
3276 else if (TREE_CODE (*tp) == RETURN_EXPR)
3277 TREE_OPERAND (*tp, 0) = dp->result;
3278 /* Change all cleanups for the NRV to only run when an exception is
3280 else if (TREE_CODE (*tp) == CLEANUP_STMT
3281 && CLEANUP_DECL (*tp) == dp->var)
3282 CLEANUP_EH_ONLY (*tp) = 1;
3283 /* Replace the DECL_EXPR for the NRV with an initialization of the
3284 RESULT_DECL, if needed. */
3285 else if (TREE_CODE (*tp) == DECL_EXPR
3286 && DECL_EXPR_DECL (*tp) == dp->var)
3289 if (DECL_INITIAL (dp->var)
3290 && DECL_INITIAL (dp->var) != error_mark_node)
3292 init = build2 (INIT_EXPR, void_type_node, dp->result,
3293 DECL_INITIAL (dp->var));
3294 DECL_INITIAL (dp->var) = error_mark_node;
3297 init = build_empty_stmt ();
3298 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3301 /* And replace all uses of the NRV with the RESULT_DECL. */
3302 else if (*tp == dp->var)
3305 /* Avoid walking into the same tree more than once. Unfortunately, we
3306 can't just use walk_tree_without duplicates because it would only call
3307 us for the first occurrence of dp->var in the function body. */
3308 slot = htab_find_slot (dp->visited, *tp, INSERT);
3314 /* Keep iterating. */
3318 /* Called from finish_function to implement the named return value
3319 optimization by overriding all the RETURN_EXPRs and pertinent
3320 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3321 RESULT_DECL for the function. */
3324 finalize_nrv (tree *tp, tree var, tree result)
3326 struct nrv_data data;
3328 /* Copy debugging information from VAR to RESULT. */
3329 DECL_NAME (result) = DECL_NAME (var);
3330 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3331 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3332 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3333 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3334 /* Don't forget that we take its address. */
3335 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3338 data.result = result;
3339 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3340 walk_tree (tp, finalize_nrv_r, &data, 0);
3341 htab_delete (data.visited);
3344 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3345 Remove any elements from the list that are invalid. */
3348 finish_omp_clauses (tree clauses)
3350 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3351 tree c, t, *pc = &clauses;
3354 bitmap_obstack_initialize (NULL);
3355 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3356 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3357 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3359 for (pc = &clauses, c = clauses; c ; c = *pc)
3361 bool remove = false;
3363 switch (OMP_CLAUSE_CODE (c))
3365 case OMP_CLAUSE_SHARED:
3367 goto check_dup_generic;
3368 case OMP_CLAUSE_PRIVATE:
3370 goto check_dup_generic;
3371 case OMP_CLAUSE_REDUCTION:
3373 goto check_dup_generic;
3374 case OMP_CLAUSE_COPYPRIVATE:
3375 name = "copyprivate";
3376 goto check_dup_generic;
3377 case OMP_CLAUSE_COPYIN:
3379 goto check_dup_generic;
3381 t = OMP_CLAUSE_DECL (c);
3382 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3384 if (processing_template_decl)
3387 error ("%qD is not a variable in clause %qs", t, name);
3389 error ("%qE is not a variable in clause %qs", t, name);
3392 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3393 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3394 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3396 error ("%qD appears more than once in data clauses", t);
3400 bitmap_set_bit (&generic_head, DECL_UID (t));
3403 case OMP_CLAUSE_FIRSTPRIVATE:
3404 t = OMP_CLAUSE_DECL (c);
3405 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3407 if (processing_template_decl)
3409 error ("%qE is not a variable in clause %<firstprivate%>", t);
3412 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3413 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3415 error ("%qE appears more than once in data clauses", t);
3419 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3422 case OMP_CLAUSE_LASTPRIVATE:
3423 t = OMP_CLAUSE_DECL (c);
3424 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3426 if (processing_template_decl)
3428 error ("%qE is not a variable in clause %<lastprivate%>", t);
3431 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3432 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3434 error ("%qE appears more than once in data clauses", t);
3438 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3442 t = OMP_CLAUSE_IF_EXPR (c);
3443 t = maybe_convert_cond (t);
3444 if (t == error_mark_node)
3446 OMP_CLAUSE_IF_EXPR (c) = t;
3449 case OMP_CLAUSE_NUM_THREADS:
3450 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3451 if (t == error_mark_node)
3453 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
3454 && !type_dependent_expression_p (t))
3456 error ("num_threads expression must be integral");
3461 case OMP_CLAUSE_SCHEDULE:
3462 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3465 else if (t == error_mark_node)
3467 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
3468 && !type_dependent_expression_p (t))
3470 error ("schedule chunk size expression must be integral");
3475 case OMP_CLAUSE_NOWAIT:
3476 case OMP_CLAUSE_ORDERED:
3477 case OMP_CLAUSE_DEFAULT:
3485 *pc = OMP_CLAUSE_CHAIN (c);
3487 pc = &OMP_CLAUSE_CHAIN (c);
3490 for (pc = &clauses, c = clauses; c ; c = *pc)
3492 enum tree_code c_kind = OMP_CLAUSE_CODE (c);
3493 bool remove = false;
3494 bool need_complete_non_reference = false;
3495 bool need_default_ctor = false;
3496 bool need_copy_ctor = false;
3497 bool need_copy_assignment = false;
3498 bool need_implicitly_determined = false;
3499 tree type, inner_type;
3503 case OMP_CLAUSE_SHARED:
3505 need_implicitly_determined = true;
3507 case OMP_CLAUSE_PRIVATE:
3509 need_complete_non_reference = true;
3510 need_default_ctor = true;
3511 need_implicitly_determined = true;
3513 case OMP_CLAUSE_FIRSTPRIVATE:
3514 name = "firstprivate";
3515 need_complete_non_reference = true;
3516 need_copy_ctor = true;
3517 need_implicitly_determined = true;
3519 case OMP_CLAUSE_LASTPRIVATE:
3520 name = "lastprivate";
3521 need_complete_non_reference = true;
3522 need_copy_assignment = true;
3523 need_implicitly_determined = true;
3525 case OMP_CLAUSE_REDUCTION:
3527 need_implicitly_determined = true;
3529 case OMP_CLAUSE_COPYPRIVATE:
3530 name = "copyprivate";
3531 need_copy_assignment = true;
3533 case OMP_CLAUSE_COPYIN:
3535 need_copy_assignment = true;
3538 pc = &OMP_CLAUSE_CHAIN (c);
3542 t = OMP_CLAUSE_DECL (c);
3543 if (processing_template_decl
3544 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3546 pc = &OMP_CLAUSE_CHAIN (c);
3552 case OMP_CLAUSE_LASTPRIVATE:
3553 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3554 need_default_ctor = true;
3557 case OMP_CLAUSE_REDUCTION:
3558 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3559 || POINTER_TYPE_P (TREE_TYPE (t)))
3561 error ("%qE has invalid type for %<reduction%>", t);
3564 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3566 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3574 error ("%qE has invalid type for %<reduction(%s)%>",
3575 t, operator_name_info[r_code].name);
3581 case OMP_CLAUSE_COPYIN:
3582 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3584 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3593 if (need_complete_non_reference)
3595 t = require_complete_type (t);
3596 if (t == error_mark_node)
3598 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3600 error ("%qE has reference type for %qs", t, name);
3604 if (need_implicitly_determined)
3606 const char *share_name = NULL;
3608 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3609 share_name = "threadprivate";
3610 else switch (cxx_omp_predetermined_sharing (t))
3612 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3614 case OMP_CLAUSE_DEFAULT_SHARED:
3615 share_name = "shared";
3617 case OMP_CLAUSE_DEFAULT_PRIVATE:
3618 share_name = "private";
3625 error ("%qE is predetermined %qs for %qs",
3626 t, share_name, name);
3631 /* We're interested in the base element, not arrays. */
3632 inner_type = type = TREE_TYPE (t);
3633 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3634 inner_type = TREE_TYPE (inner_type);
3636 /* Check for special function availability by building a call to one.
3637 Save the results, because later we won't be in the right context
3638 for making these queries. */
3639 if (CLASS_TYPE_P (inner_type)
3640 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3641 && !type_dependent_expression_p (t))
3643 int save_errorcount = errorcount;
3646 /* Always allocate 3 elements for simplicity. These are the
3647 function decls for the ctor, dtor, and assignment op.
3648 This layout is known to the three lang hooks,
3649 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3650 and cxx_omp_clause_assign_op. */
3651 info = make_tree_vec (3);
3652 CP_OMP_CLAUSE_INFO (c) = info;
3654 if (need_default_ctor
3656 && !TYPE_HAS_TRIVIAL_INIT_REF (inner_type)))
3658 if (need_default_ctor)
3662 t = build_int_cst (build_pointer_type (inner_type), 0);
3663 t = build1 (INDIRECT_REF, inner_type, t);
3664 t = build_tree_list (NULL, t);
3666 t = build_special_member_call (NULL_TREE,
3667 complete_ctor_identifier,
3668 t, inner_type, LOOKUP_NORMAL);
3669 t = get_callee_fndecl (t);
3670 TREE_VEC_ELT (info, 0) = t;
3673 if ((need_default_ctor || need_copy_ctor)
3674 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_type))
3676 t = build_int_cst (build_pointer_type (inner_type), 0);
3677 t = build1 (INDIRECT_REF, inner_type, t);
3678 t = build_special_member_call (t, complete_dtor_identifier,
3679 NULL, inner_type, LOOKUP_NORMAL);
3680 t = get_callee_fndecl (t);
3681 TREE_VEC_ELT (info, 1) = t;
3684 if (need_copy_assignment
3685 && !TYPE_HAS_TRIVIAL_ASSIGN_REF (inner_type))
3687 t = build_int_cst (build_pointer_type (inner_type), 0);
3688 t = build1 (INDIRECT_REF, inner_type, t);
3689 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3690 build_tree_list (NULL, t),
3691 inner_type, LOOKUP_NORMAL);
3693 /* We'll have called convert_from_reference on the call, which
3694 may well have added an indirect_ref. It's unneeded here,
3695 and in the way, so kill it. */
3696 if (TREE_CODE (t) == INDIRECT_REF)
3697 t = TREE_OPERAND (t, 0);
3699 t = get_callee_fndecl (t);
3700 TREE_VEC_ELT (info, 2) = t;
3703 if (errorcount != save_errorcount)
3708 *pc = OMP_CLAUSE_CHAIN (c);
3710 pc = &OMP_CLAUSE_CHAIN (c);
3713 bitmap_obstack_release (NULL);
3717 /* For all variables in the tree_list VARS, mark them as thread local. */
3720 finish_omp_threadprivate (tree vars)
3724 /* Mark every variable in VARS to be assigned thread local storage. */
3725 for (t = vars; t; t = TREE_CHAIN (t))
3727 tree v = TREE_PURPOSE (t);
3729 /* If V had already been marked threadprivate, it doesn't matter
3730 whether it had been used prior to this point. */
3732 && (DECL_LANG_SPECIFIC (v) == NULL
3733 || !CP_DECL_THREADPRIVATE_P (v)))
3734 error ("%qE declared %<threadprivate%> after first use", v);
3735 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3736 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3737 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3738 error ("%<threadprivate%> %qE has incomplete type", v);
3739 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v)))
3740 error ("%<threadprivate%> %qE is not file, namespace "
3741 "or block scope variable", v);
3744 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3745 if (DECL_LANG_SPECIFIC (v) == NULL)
3747 retrofit_lang_decl (v);
3749 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3750 after the allocation of the lang_decl structure. */
3751 if (DECL_DISCRIMINATOR_P (v))
3752 DECL_LANG_SPECIFIC (v)->decl_flags.u2sel = 1;
3755 if (! DECL_THREAD_LOCAL_P (v))
3757 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3758 /* If rtl has been already set for this var, call
3759 make_decl_rtl once again, so that encode_section_info
3760 has a chance to look at the new decl flags. */
3761 if (DECL_RTL_SET_P (v))
3764 CP_DECL_THREADPRIVATE_P (v) = 1;
3769 /* Build an OpenMP structured block. */
3772 begin_omp_structured_block (void)
3774 return do_pushlevel (sk_omp);
3778 finish_omp_structured_block (tree block)
3780 return do_poplevel (block);
3783 /* Similarly, except force the retention of the BLOCK. */
3786 begin_omp_parallel (void)
3788 keep_next_level (true);
3789 return begin_omp_structured_block ();
3793 finish_omp_parallel (tree clauses, tree body)
3797 body = finish_omp_structured_block (body);
3799 stmt = make_node (OMP_PARALLEL);
3800 TREE_TYPE (stmt) = void_type_node;
3801 OMP_PARALLEL_CLAUSES (stmt) = clauses;
3802 OMP_PARALLEL_BODY (stmt) = body;
3804 return add_stmt (stmt);
3807 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
3808 are directly for their associated operands in the statement. DECL
3809 and INIT are a combo; if DECL is NULL then INIT ought to be a
3810 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
3811 optional statements that need to go before the loop into its
3815 finish_omp_for (location_t locus, tree decl, tree init, tree cond,
3816 tree incr, tree body, tree pre_body)
3823 switch (TREE_CODE (init))
3826 decl = TREE_OPERAND (init, 0);
3827 init = TREE_OPERAND (init, 1);
3830 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
3832 decl = TREE_OPERAND (init, 0);
3833 init = TREE_OPERAND (init, 2);
3842 error ("expected iteration declaration or initialization");
3847 if (type_dependent_expression_p (decl)
3848 || type_dependent_expression_p (init)
3849 || (cond && type_dependent_expression_p (cond))
3850 || (incr && type_dependent_expression_p (incr)))
3856 error ("%Hmissing controlling predicate", &locus);
3862 error ("%Hmissing increment expression", &locus);
3866 stmt = make_node (OMP_FOR);
3868 /* This is really just a place-holder. We'll be decomposing this
3869 again and going through the build_modify_expr path below when
3870 we instantiate the thing. */
3871 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
3873 TREE_TYPE (stmt) = void_type_node;
3874 OMP_FOR_INIT (stmt) = init;
3875 OMP_FOR_COND (stmt) = cond;
3876 OMP_FOR_INCR (stmt) = incr;
3877 OMP_FOR_BODY (stmt) = body;
3878 OMP_FOR_PRE_BODY (stmt) = pre_body;
3880 SET_EXPR_LOCATION (stmt, locus);
3881 return add_stmt (stmt);
3886 error ("expected iteration declaration or initialization");
3890 if (pre_body == NULL || IS_EMPTY_STMT (pre_body))
3892 else if (! processing_template_decl)
3894 add_stmt (pre_body);
3898 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
3899 init = build_modify_expr (decl, NOP_EXPR, init);
3900 if (cond && TREE_SIDE_EFFECTS (cond) && COMPARISON_CLASS_P (cond))
3902 int n = TREE_SIDE_EFFECTS (TREE_OPERAND (cond, 1)) != 0;
3903 tree t = TREE_OPERAND (cond, n);
3905 TREE_OPERAND (cond, n)
3906 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
3908 omp_for = c_finish_omp_for (locus, decl, init, cond, incr, body, pre_body);
3910 && TREE_CODE (OMP_FOR_INCR (omp_for)) == MODIFY_EXPR
3911 && TREE_SIDE_EFFECTS (TREE_OPERAND (OMP_FOR_INCR (omp_for), 1))
3912 && BINARY_CLASS_P (TREE_OPERAND (OMP_FOR_INCR (omp_for), 1)))
3914 tree t = TREE_OPERAND (OMP_FOR_INCR (omp_for), 1);
3915 int n = TREE_SIDE_EFFECTS (TREE_OPERAND (t, 1)) != 0;
3918 = fold_build_cleanup_point_expr (TREE_TYPE (TREE_OPERAND (t, n)),
3919 TREE_OPERAND (t, n));
3925 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
3929 if (processing_template_decl
3930 && (type_dependent_expression_p (lhs)
3931 || type_dependent_expression_p (rhs)))
3932 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
3933 build2 (code, void_type_node, lhs, rhs));
3936 /* Even in a template, we can detect invalid uses of the atomic
3937 pragma if neither LHS nor RHS is type-dependent. */
3938 if (processing_template_decl)
3940 lhs = build_non_dependent_expr (lhs);
3941 rhs = build_non_dependent_expr (rhs);
3944 stmt = c_finish_omp_atomic (code, lhs, rhs);
3947 if (stmt != error_mark_node)
3952 finish_omp_barrier (void)
3954 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
3955 tree stmt = finish_call_expr (fn, NULL, false, false);
3956 finish_expr_stmt (stmt);
3960 finish_omp_flush (void)
3962 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
3963 tree stmt = finish_call_expr (fn, NULL, false, false);
3964 finish_expr_stmt (stmt);
3967 /* True if OpenMP sharing attribute of DECL is predetermined. */
3969 enum omp_clause_default_kind
3970 cxx_omp_predetermined_sharing (tree decl)
3972 enum omp_clause_default_kind kind;
3974 kind = c_omp_predetermined_sharing (decl);
3975 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
3978 /* Static data members are predetermined as shared. */
3979 if (TREE_STATIC (decl))
3981 tree ctx = CP_DECL_CONTEXT (decl);
3982 if (TYPE_P (ctx) && IS_AGGR_TYPE (ctx))
3983 return OMP_CLAUSE_DEFAULT_SHARED;
3986 return OMP_CLAUSE_DEFAULT_UNSPECIFIED;
3990 init_cp_semantics (void)
3994 /* Build a STATIC_ASSERT for a static assertion with the condition
3995 CONDITION and the message text MESSAGE. LOCATION is the location
3996 of the static assertion in the source code. When MEMBER_P, this
3997 static assertion is a member of a class. */
3999 finish_static_assert (tree condition, tree message, location_t location,
4002 if (type_dependent_expression_p (condition)
4003 || value_dependent_expression_p (condition))
4005 /* We're in a template; build a STATIC_ASSERT and put it in
4009 assertion = make_node (STATIC_ASSERT);
4010 STATIC_ASSERT_CONDITION (assertion) = condition;
4011 STATIC_ASSERT_MESSAGE (assertion) = message;
4012 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4015 maybe_add_class_template_decl_list (current_class_type,
4019 add_stmt (assertion);
4024 /* Fold the expression and convert it to a boolean value. */
4025 condition = fold_non_dependent_expr (condition);
4026 condition = cp_convert (boolean_type_node, condition);
4028 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4029 /* Do nothing; the condition is satisfied. */
4033 location_t saved_loc = input_location;
4035 input_location = location;
4036 if (TREE_CODE (condition) == INTEGER_CST
4037 && integer_zerop (condition))
4038 /* Report the error. */
4039 error ("static assertion failed: %E", message);
4040 else if (condition && condition != error_mark_node)
4041 error ("non-constant condition for static assertion");
4042 input_location = saved_loc;
4046 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4047 suitable for use as a type-specifier.
4049 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4050 id-expression or a class member access, FALSE when it was parsed as
4051 a full expression. */
4053 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4055 tree orig_expr = expr;
4058 if (type_dependent_expression_p (expr))
4060 type = make_aggr_type (DECLTYPE_TYPE);
4061 DECLTYPE_TYPE_EXPR (type) = expr;
4062 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4063 = id_expression_or_member_access_p;
4064 SET_TYPE_STRUCTURAL_EQUALITY (type);
4069 /* The type denoted by decltype(e) is defined as follows: */
4071 if (id_expression_or_member_access_p)
4073 /* If e is an id-expression or a class member access (5.2.5
4074 [expr.ref]), decltype(e) is defined as the type of the entity
4075 named by e. If there is no such entity, or e names a set of
4076 overloaded functions, the program is ill-formed. */
4077 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4078 expr = lookup_name (expr);
4080 if (TREE_CODE (expr) == INDIRECT_REF)
4081 /* This can happen when the expression is, e.g., "a.b". Just
4082 look at the underlying operand. */
4083 expr = TREE_OPERAND (expr, 0);
4085 if (TREE_CODE (expr) == OFFSET_REF
4086 || TREE_CODE (expr) == MEMBER_REF)
4087 /* We're only interested in the field itself. If it is a
4088 BASELINK, we will need to see through it in the next
4090 expr = TREE_OPERAND (expr, 1);
4092 if (TREE_CODE (expr) == BASELINK)
4093 /* See through BASELINK nodes to the underlying functions. */
4094 expr = BASELINK_FUNCTIONS (expr);
4096 if (TREE_CODE (expr) == OVERLOAD)
4098 if (OVL_CHAIN (expr))
4100 error ("%qE refers to a set of overloaded functions", orig_expr);
4101 return error_mark_node;
4104 /* An overload set containing only one function: just look
4105 at that function. */
4106 expr = OVL_FUNCTION (expr);
4109 switch (TREE_CODE (expr))
4112 if (DECL_C_BIT_FIELD (expr))
4114 type = DECL_BIT_FIELD_TYPE (expr);
4117 /* Fall through for fields that aren't bitfields. */
4124 type = TREE_TYPE (expr);
4128 type = error_mark_node;
4132 type = is_bitfield_expr_with_lowered_type (expr);
4134 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4141 /* We can get here when the id-expression refers to an
4143 type = TREE_TYPE (expr);
4147 gcc_assert (TYPE_P (expr) || DECL_P (expr));
4148 error ("argument to decltype must be an expression");
4149 return error_mark_node;
4156 if (TREE_CODE (expr) == CALL_EXPR
4157 && (fndecl = get_callee_fndecl (expr))
4158 && (fndecl != error_mark_node))
4159 /* If e is a function call (5.2.2 [expr.call]) or an
4160 invocation of an overloaded operator (parentheses around e
4161 are ignored), decltype(e) is defined as the return type of
4163 type = TREE_TYPE (TREE_TYPE (fndecl));
4166 type = is_bitfield_expr_with_lowered_type (expr);
4169 /* Bitfields are special, because their type encodes the
4170 number of bits they store. If the expression referenced a
4171 bitfield, TYPE now has the declared type of that
4173 type = cp_build_qualified_type (type,
4174 cp_type_quals (TREE_TYPE (expr)));
4176 if (real_lvalue_p (expr))
4177 type = build_reference_type (type);
4181 /* Otherwise, where T is the type of e, if e is an lvalue,
4182 decltype(e) is defined as T&, otherwise decltype(e) is
4184 type = TREE_TYPE (expr);
4185 if (expr == current_class_ptr)
4186 /* If the expression is just "this", we want the
4187 cv-unqualified pointer for the "this" type. */
4188 type = TYPE_MAIN_VARIANT (type);
4189 else if (real_lvalue_p (expr))
4191 if (TREE_CODE (type) != REFERENCE_TYPE)
4192 type = build_reference_type (type);
4195 type = non_reference (type);
4200 if (!type || type == unknown_type_node)
4202 error ("type of %qE is unknown", expr);
4203 return error_mark_node;
4209 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4210 __has_nothrow_copy, depending on assign_p. */
4213 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
4220 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
4223 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
4225 else if (TYPE_HAS_INIT_REF (type))
4227 /* If construction of the copy constructor was postponed, create
4229 if (CLASSTYPE_LAZY_COPY_CTOR (type))
4230 lazily_declare_fn (sfk_copy_constructor, type);
4231 fns = CLASSTYPE_CONSTRUCTORS (type);
4236 for (; fns; fns = OVL_NEXT (fns))
4237 if (!TREE_NOTHROW (OVL_CURRENT (fns)))
4243 /* Actually evaluates the trait. */
4246 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
4248 enum tree_code type_code1;
4251 type_code1 = TREE_CODE (type1);
4255 case CPTK_HAS_NOTHROW_ASSIGN:
4256 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4257 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
4258 || (CLASS_TYPE_P (type1)
4259 && classtype_has_nothrow_assign_or_copy_p (type1,
4262 case CPTK_HAS_TRIVIAL_ASSIGN:
4263 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4264 && (pod_type_p (type1)
4265 || (CLASS_TYPE_P (type1)
4266 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1))));
4268 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
4269 type1 = strip_array_types (type1);
4270 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
4271 || (CLASS_TYPE_P (type1)
4272 && (t = locate_ctor (type1, NULL)) && TREE_NOTHROW (t)));
4274 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
4275 type1 = strip_array_types (type1);
4276 return (pod_type_p (type1)
4277 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
4279 case CPTK_HAS_NOTHROW_COPY:
4280 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
4281 || (CLASS_TYPE_P (type1)
4282 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
4284 case CPTK_HAS_TRIVIAL_COPY:
4285 return (pod_type_p (type1) || type_code1 == REFERENCE_TYPE
4286 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_INIT_REF (type1)));
4288 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
4289 type1 = strip_array_types (type1);
4290 return (pod_type_p (type1)
4291 || (CLASS_TYPE_P (type1)
4292 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
4294 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
4295 return (CLASS_TYPE_P (type1)
4296 && (t = locate_dtor (type1, NULL)) && DECL_VIRTUAL_P (t));
4298 case CPTK_IS_ABSTRACT:
4299 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
4301 case CPTK_IS_BASE_OF:
4302 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
4303 && DERIVED_FROM_P (type1, type2));
4306 return (NON_UNION_CLASS_TYPE_P (type1));
4308 case CPTK_IS_CONVERTIBLE_TO:
4313 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
4316 return (type_code1 == ENUMERAL_TYPE);
4319 return (pod_type_p (type1));
4321 case CPTK_IS_POLYMORPHIC:
4322 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
4325 return (type_code1 == UNION_TYPE);
4333 /* Process a trait expression. */
4336 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
4338 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
4339 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
4340 || kind == CPTK_HAS_NOTHROW_COPY
4341 || kind == CPTK_HAS_TRIVIAL_ASSIGN
4342 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
4343 || kind == CPTK_HAS_TRIVIAL_COPY
4344 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
4345 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
4346 || kind == CPTK_IS_ABSTRACT
4347 || kind == CPTK_IS_BASE_OF
4348 || kind == CPTK_IS_CLASS
4349 || kind == CPTK_IS_CONVERTIBLE_TO
4350 || kind == CPTK_IS_EMPTY
4351 || kind == CPTK_IS_ENUM
4352 || kind == CPTK_IS_POD
4353 || kind == CPTK_IS_POLYMORPHIC
4354 || kind == CPTK_IS_UNION);
4356 if (kind == CPTK_IS_CONVERTIBLE_TO)
4358 sorry ("__is_convertible_to");
4359 return error_mark_node;
4362 if (type1 == error_mark_node
4363 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
4364 && type2 == error_mark_node))
4365 return error_mark_node;
4367 if (processing_template_decl)
4369 tree trait_expr = make_node (TRAIT_EXPR);
4370 TREE_TYPE (trait_expr) = boolean_type_node;
4371 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
4372 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
4373 TRAIT_EXPR_KIND (trait_expr) = kind;
4377 complete_type (type1);
4379 complete_type (type2);
4381 /* The only required diagnostic. */
4382 if (kind == CPTK_IS_BASE_OF
4383 && NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
4384 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
4385 && !COMPLETE_TYPE_P (type2))
4387 error ("incomplete type %qT not allowed", type2);
4388 return error_mark_node;
4391 return (trait_expr_value (kind, type1, type2)
4392 ? boolean_true_node : boolean_false_node);
4395 #include "gt-cp-semantics.h"