1 /* Perform the semantic phase of parsing, i.e., the process of
2 building tree structure, checking semantic consistency, and
3 building RTL. These routines are used both during actual parsing
4 and during the instantiation of template functions.
6 Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005, 2006, 2007,
7 2008 Free Software Foundation, Inc.
8 Written by Mark Mitchell (mmitchell@usa.net) based on code found
9 formerly in parse.y and pt.c.
11 This file is part of GCC.
13 GCC is free software; you can redistribute it and/or modify it
14 under the terms of the GNU General Public License as published by
15 the Free Software Foundation; either version 3, or (at your option)
18 GCC is distributed in the hope that it will be useful, but
19 WITHOUT ANY WARRANTY; without even the implied warranty of
20 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
21 General Public License for more details.
23 You should have received a copy of the GNU General Public License
24 along with GCC; see the file COPYING3. If not see
25 <http://www.gnu.org/licenses/>. */
29 #include "coretypes.h"
34 #include "tree-inline.h"
35 #include "tree-mudflap.h"
44 #include "diagnostic.h"
46 #include "tree-iterator.h"
50 /* There routines provide a modular interface to perform many parsing
51 operations. They may therefore be used during actual parsing, or
52 during template instantiation, which may be regarded as a
53 degenerate form of parsing. */
55 static tree maybe_convert_cond (tree);
56 static tree simplify_aggr_init_exprs_r (tree *, int *, void *);
57 static tree finalize_nrv_r (tree *, int *, void *);
60 /* Deferred Access Checking Overview
61 ---------------------------------
63 Most C++ expressions and declarations require access checking
64 to be performed during parsing. However, in several cases,
65 this has to be treated differently.
67 For member declarations, access checking has to be deferred
68 until more information about the declaration is known. For
80 When we are parsing the function return type `A::X', we don't
81 really know if this is allowed until we parse the function name.
83 Furthermore, some contexts require that access checking is
84 never performed at all. These include class heads, and template
87 Typical use of access checking functions is described here:
89 1. When we enter a context that requires certain access checking
90 mode, the function `push_deferring_access_checks' is called with
91 DEFERRING argument specifying the desired mode. Access checking
92 may be performed immediately (dk_no_deferred), deferred
93 (dk_deferred), or not performed (dk_no_check).
95 2. When a declaration such as a type, or a variable, is encountered,
96 the function `perform_or_defer_access_check' is called. It
97 maintains a VEC of all deferred checks.
99 3. The global `current_class_type' or `current_function_decl' is then
100 setup by the parser. `enforce_access' relies on these information
103 4. Upon exiting the context mentioned in step 1,
104 `perform_deferred_access_checks' is called to check all declaration
105 stored in the VEC. `pop_deferring_access_checks' is then
106 called to restore the previous access checking mode.
108 In case of parsing error, we simply call `pop_deferring_access_checks'
109 without `perform_deferred_access_checks'. */
111 typedef struct deferred_access GTY(())
113 /* A VEC representing name-lookups for which we have deferred
114 checking access controls. We cannot check the accessibility of
115 names used in a decl-specifier-seq until we know what is being
116 declared because code like:
123 A::B* A::f() { return 0; }
125 is valid, even though `A::B' is not generally accessible. */
126 VEC (deferred_access_check,gc)* GTY(()) deferred_access_checks;
128 /* The current mode of access checks. */
129 enum deferring_kind deferring_access_checks_kind;
132 DEF_VEC_O (deferred_access);
133 DEF_VEC_ALLOC_O (deferred_access,gc);
135 /* Data for deferred access checking. */
136 static GTY(()) VEC(deferred_access,gc) *deferred_access_stack;
137 static GTY(()) unsigned deferred_access_no_check;
139 /* Save the current deferred access states and start deferred
140 access checking iff DEFER_P is true. */
143 push_deferring_access_checks (deferring_kind deferring)
145 /* For context like template instantiation, access checking
146 disabling applies to all nested context. */
147 if (deferred_access_no_check || deferring == dk_no_check)
148 deferred_access_no_check++;
151 deferred_access *ptr;
153 ptr = VEC_safe_push (deferred_access, gc, deferred_access_stack, NULL);
154 ptr->deferred_access_checks = NULL;
155 ptr->deferring_access_checks_kind = deferring;
159 /* Resume deferring access checks again after we stopped doing
163 resume_deferring_access_checks (void)
165 if (!deferred_access_no_check)
166 VEC_last (deferred_access, deferred_access_stack)
167 ->deferring_access_checks_kind = dk_deferred;
170 /* Stop deferring access checks. */
173 stop_deferring_access_checks (void)
175 if (!deferred_access_no_check)
176 VEC_last (deferred_access, deferred_access_stack)
177 ->deferring_access_checks_kind = dk_no_deferred;
180 /* Discard the current deferred access checks and restore the
184 pop_deferring_access_checks (void)
186 if (deferred_access_no_check)
187 deferred_access_no_check--;
189 VEC_pop (deferred_access, deferred_access_stack);
192 /* Returns a TREE_LIST representing the deferred checks.
193 The TREE_PURPOSE of each node is the type through which the
194 access occurred; the TREE_VALUE is the declaration named.
197 VEC (deferred_access_check,gc)*
198 get_deferred_access_checks (void)
200 if (deferred_access_no_check)
203 return (VEC_last (deferred_access, deferred_access_stack)
204 ->deferred_access_checks);
207 /* Take current deferred checks and combine with the
208 previous states if we also defer checks previously.
209 Otherwise perform checks now. */
212 pop_to_parent_deferring_access_checks (void)
214 if (deferred_access_no_check)
215 deferred_access_no_check--;
218 VEC (deferred_access_check,gc) *checks;
219 deferred_access *ptr;
221 checks = (VEC_last (deferred_access, deferred_access_stack)
222 ->deferred_access_checks);
224 VEC_pop (deferred_access, deferred_access_stack);
225 ptr = VEC_last (deferred_access, deferred_access_stack);
226 if (ptr->deferring_access_checks_kind == dk_no_deferred)
229 perform_access_checks (checks);
233 /* Merge with parent. */
235 deferred_access_check *chk, *probe;
238 VEC_iterate (deferred_access_check, checks, i, chk) ;
242 VEC_iterate (deferred_access_check,
243 ptr->deferred_access_checks, j, probe) ;
246 if (probe->binfo == chk->binfo &&
247 probe->decl == chk->decl &&
248 probe->diag_decl == chk->diag_decl)
251 /* Insert into parent's checks. */
252 VEC_safe_push (deferred_access_check, gc,
253 ptr->deferred_access_checks, chk);
260 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
261 is the BINFO indicating the qualifying scope used to access the
262 DECL node stored in the TREE_VALUE of the node. */
265 perform_access_checks (VEC (deferred_access_check,gc)* checks)
268 deferred_access_check *chk;
273 for (i = 0 ; VEC_iterate (deferred_access_check, checks, i, chk) ; ++i)
274 enforce_access (chk->binfo, chk->decl, chk->diag_decl);
277 /* Perform the deferred access checks.
279 After performing the checks, we still have to keep the list
280 `deferred_access_stack->deferred_access_checks' since we may want
281 to check access for them again later in a different context.
288 A::X A::a, x; // No error for `A::a', error for `x'
290 We have to perform deferred access of `A::X', first with `A::a',
294 perform_deferred_access_checks (void)
296 perform_access_checks (get_deferred_access_checks ());
299 /* Defer checking the accessibility of DECL, when looked up in
300 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */
303 perform_or_defer_access_check (tree binfo, tree decl, tree diag_decl)
306 deferred_access *ptr;
307 deferred_access_check *chk;
308 deferred_access_check *new_access;
311 /* Exit if we are in a context that no access checking is performed.
313 if (deferred_access_no_check)
316 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
318 ptr = VEC_last (deferred_access, deferred_access_stack);
320 /* If we are not supposed to defer access checks, just check now. */
321 if (ptr->deferring_access_checks_kind == dk_no_deferred)
323 enforce_access (binfo, decl, diag_decl);
327 /* See if we are already going to perform this check. */
329 VEC_iterate (deferred_access_check,
330 ptr->deferred_access_checks, i, chk) ;
333 if (chk->decl == decl && chk->binfo == binfo &&
334 chk->diag_decl == diag_decl)
339 /* If not, record the check. */
341 VEC_safe_push (deferred_access_check, gc,
342 ptr->deferred_access_checks, 0);
343 new_access->binfo = binfo;
344 new_access->decl = decl;
345 new_access->diag_decl = diag_decl;
348 /* Returns nonzero if the current statement is a full expression,
349 i.e. temporaries created during that statement should be destroyed
350 at the end of the statement. */
353 stmts_are_full_exprs_p (void)
355 return current_stmt_tree ()->stmts_are_full_exprs_p;
358 /* T is a statement. Add it to the statement-tree. This is the C++
359 version. The C/ObjC frontends have a slightly different version of
365 enum tree_code code = TREE_CODE (t);
367 if (EXPR_P (t) && code != LABEL_EXPR)
369 if (!EXPR_HAS_LOCATION (t))
370 SET_EXPR_LOCATION (t, input_location);
372 /* When we expand a statement-tree, we must know whether or not the
373 statements are full-expressions. We record that fact here. */
374 STMT_IS_FULL_EXPR_P (t) = stmts_are_full_exprs_p ();
377 /* Add T to the statement-tree. Non-side-effect statements need to be
378 recorded during statement expressions. */
379 append_to_statement_list_force (t, &cur_stmt_list);
384 /* Returns the stmt_tree (if any) to which statements are currently
385 being added. If there is no active statement-tree, NULL is
389 current_stmt_tree (void)
392 ? &cfun->language->base.x_stmt_tree
393 : &scope_chain->x_stmt_tree);
396 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
399 maybe_cleanup_point_expr (tree expr)
401 if (!processing_template_decl && stmts_are_full_exprs_p ())
402 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
406 /* Like maybe_cleanup_point_expr except have the type of the new expression be
407 void so we don't need to create a temporary variable to hold the inner
408 expression. The reason why we do this is because the original type might be
409 an aggregate and we cannot create a temporary variable for that type. */
412 maybe_cleanup_point_expr_void (tree expr)
414 if (!processing_template_decl && stmts_are_full_exprs_p ())
415 expr = fold_build_cleanup_point_expr (void_type_node, expr);
421 /* Create a declaration statement for the declaration given by the DECL. */
424 add_decl_expr (tree decl)
426 tree r = build_stmt (DECL_EXPR, decl);
427 if (DECL_INITIAL (decl)
428 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
429 r = maybe_cleanup_point_expr_void (r);
433 /* Nonzero if TYPE is an anonymous union or struct type. We have to use a
434 flag for this because "A union for which objects or pointers are
435 declared is not an anonymous union" [class.union]. */
438 anon_aggr_type_p (const_tree node)
440 return ANON_AGGR_TYPE_P (node);
443 /* Finish a scope. */
446 do_poplevel (tree stmt_list)
450 if (stmts_are_full_exprs_p ())
451 block = poplevel (kept_level_p (), 1, 0);
453 stmt_list = pop_stmt_list (stmt_list);
455 if (!processing_template_decl)
457 stmt_list = c_build_bind_expr (block, stmt_list);
458 /* ??? See c_end_compound_stmt re statement expressions. */
464 /* Begin a new scope. */
467 do_pushlevel (scope_kind sk)
469 tree ret = push_stmt_list ();
470 if (stmts_are_full_exprs_p ())
471 begin_scope (sk, NULL);
475 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
476 when the current scope is exited. EH_ONLY is true when this is not
477 meant to apply to normal control flow transfer. */
480 push_cleanup (tree decl, tree cleanup, bool eh_only)
482 tree stmt = build_stmt (CLEANUP_STMT, NULL, cleanup, decl);
483 CLEANUP_EH_ONLY (stmt) = eh_only;
485 CLEANUP_BODY (stmt) = push_stmt_list ();
488 /* Begin a conditional that might contain a declaration. When generating
489 normal code, we want the declaration to appear before the statement
490 containing the conditional. When generating template code, we want the
491 conditional to be rendered as the raw DECL_EXPR. */
494 begin_cond (tree *cond_p)
496 if (processing_template_decl)
497 *cond_p = push_stmt_list ();
500 /* Finish such a conditional. */
503 finish_cond (tree *cond_p, tree expr)
505 if (processing_template_decl)
507 tree cond = pop_stmt_list (*cond_p);
508 if (TREE_CODE (cond) == DECL_EXPR)
511 if (check_for_bare_parameter_packs (&expr))
512 *cond_p = error_mark_node;
517 /* If *COND_P specifies a conditional with a declaration, transform the
520 for (; A x = 42;) { }
522 while (true) { A x = 42; if (!x) break; }
523 for (;;) { A x = 42; if (!x) break; }
524 The statement list for BODY will be empty if the conditional did
525 not declare anything. */
528 simplify_loop_decl_cond (tree *cond_p, tree body)
532 if (!TREE_SIDE_EFFECTS (body))
536 *cond_p = boolean_true_node;
538 if_stmt = begin_if_stmt ();
539 cond = build_unary_op (TRUTH_NOT_EXPR, cond, 0);
540 finish_if_stmt_cond (cond, if_stmt);
541 finish_break_stmt ();
542 finish_then_clause (if_stmt);
543 finish_if_stmt (if_stmt);
546 /* Finish a goto-statement. */
549 finish_goto_stmt (tree destination)
551 if (TREE_CODE (destination) == IDENTIFIER_NODE)
552 destination = lookup_label (destination);
554 /* We warn about unused labels with -Wunused. That means we have to
555 mark the used labels as used. */
556 if (TREE_CODE (destination) == LABEL_DECL)
557 TREE_USED (destination) = 1;
560 /* The DESTINATION is being used as an rvalue. */
561 if (!processing_template_decl)
562 destination = decay_conversion (destination);
563 /* We don't inline calls to functions with computed gotos.
564 Those functions are typically up to some funny business,
565 and may be depending on the labels being at particular
566 addresses, or some such. */
567 DECL_UNINLINABLE (current_function_decl) = 1;
570 check_goto (destination);
572 return add_stmt (build_stmt (GOTO_EXPR, destination));
575 /* COND is the condition-expression for an if, while, etc.,
576 statement. Convert it to a boolean value, if appropriate. */
579 maybe_convert_cond (tree cond)
581 /* Empty conditions remain empty. */
585 /* Wait until we instantiate templates before doing conversion. */
586 if (processing_template_decl)
589 /* Do the conversion. */
590 cond = convert_from_reference (cond);
592 if (TREE_CODE (cond) == MODIFY_EXPR
593 && !TREE_NO_WARNING (cond)
596 warning (OPT_Wparentheses,
597 "suggest parentheses around assignment used as truth value");
598 TREE_NO_WARNING (cond) = 1;
601 return condition_conversion (cond);
604 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
607 finish_expr_stmt (tree expr)
611 if (expr != NULL_TREE)
613 if (!processing_template_decl)
615 if (warn_sequence_point)
616 verify_sequence_points (expr);
617 expr = convert_to_void (expr, "statement");
619 else if (!type_dependent_expression_p (expr))
620 convert_to_void (build_non_dependent_expr (expr), "statement");
622 if (check_for_bare_parameter_packs (&expr))
623 expr = error_mark_node;
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 if (check_for_bare_parameter_packs (&expr))
881 expr = error_mark_node;
882 FOR_EXPR (for_stmt) = expr;
885 /* Finish the body of a for-statement, which may be given by
886 FOR_STMT. The increment-EXPR for the loop must be
890 finish_for_stmt (tree for_stmt)
892 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
894 /* Pop the scope for the body of the loop. */
895 if (flag_new_for_scope > 0)
897 tree scope = TREE_CHAIN (for_stmt);
898 TREE_CHAIN (for_stmt) = NULL;
899 add_stmt (do_poplevel (scope));
905 /* Finish a break-statement. */
908 finish_break_stmt (void)
910 return add_stmt (build_stmt (BREAK_STMT));
913 /* Finish a continue-statement. */
916 finish_continue_stmt (void)
918 return add_stmt (build_stmt (CONTINUE_STMT));
921 /* Begin a switch-statement. Returns a new SWITCH_STMT if
925 begin_switch_stmt (void)
929 r = build_stmt (SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
931 scope = do_pushlevel (sk_block);
932 TREE_CHAIN (r) = scope;
933 begin_cond (&SWITCH_STMT_COND (r));
938 /* Finish the cond of a switch-statement. */
941 finish_switch_cond (tree cond, tree switch_stmt)
943 tree orig_type = NULL;
944 if (!processing_template_decl)
948 /* Convert the condition to an integer or enumeration type. */
949 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
950 if (cond == NULL_TREE)
952 error ("switch quantity not an integer");
953 cond = error_mark_node;
955 orig_type = TREE_TYPE (cond);
956 if (cond != error_mark_node)
960 Integral promotions are performed. */
961 cond = perform_integral_promotions (cond);
962 cond = maybe_cleanup_point_expr (cond);
965 if (cond != error_mark_node)
967 index = get_unwidened (cond, NULL_TREE);
968 /* We can't strip a conversion from a signed type to an unsigned,
969 because if we did, int_fits_type_p would do the wrong thing
970 when checking case values for being in range,
971 and it's too hard to do the right thing. */
972 if (TYPE_UNSIGNED (TREE_TYPE (cond))
973 == TYPE_UNSIGNED (TREE_TYPE (index)))
977 if (check_for_bare_parameter_packs (&cond))
978 cond = error_mark_node;
979 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
980 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
981 add_stmt (switch_stmt);
982 push_switch (switch_stmt);
983 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
986 /* Finish the body of a switch-statement, which may be given by
987 SWITCH_STMT. The COND to switch on is indicated. */
990 finish_switch_stmt (tree switch_stmt)
994 SWITCH_STMT_BODY (switch_stmt) =
995 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
999 scope = TREE_CHAIN (switch_stmt);
1000 TREE_CHAIN (switch_stmt) = NULL;
1001 add_stmt (do_poplevel (scope));
1004 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1008 begin_try_block (void)
1010 tree r = build_stmt (TRY_BLOCK, NULL_TREE, NULL_TREE);
1012 TRY_STMTS (r) = push_stmt_list ();
1016 /* Likewise, for a function-try-block. The block returned in
1017 *COMPOUND_STMT is an artificial outer scope, containing the
1018 function-try-block. */
1021 begin_function_try_block (tree *compound_stmt)
1024 /* This outer scope does not exist in the C++ standard, but we need
1025 a place to put __FUNCTION__ and similar variables. */
1026 *compound_stmt = begin_compound_stmt (0);
1027 r = begin_try_block ();
1028 FN_TRY_BLOCK_P (r) = 1;
1032 /* Finish a try-block, which may be given by TRY_BLOCK. */
1035 finish_try_block (tree try_block)
1037 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1038 TRY_HANDLERS (try_block) = push_stmt_list ();
1041 /* Finish the body of a cleanup try-block, which may be given by
1045 finish_cleanup_try_block (tree try_block)
1047 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1050 /* Finish an implicitly generated try-block, with a cleanup is given
1054 finish_cleanup (tree cleanup, tree try_block)
1056 TRY_HANDLERS (try_block) = cleanup;
1057 CLEANUP_P (try_block) = 1;
1060 /* Likewise, for a function-try-block. */
1063 finish_function_try_block (tree try_block)
1065 finish_try_block (try_block);
1066 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1067 the try block, but moving it inside. */
1068 in_function_try_handler = 1;
1071 /* Finish a handler-sequence for a try-block, which may be given by
1075 finish_handler_sequence (tree try_block)
1077 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1078 check_handlers (TRY_HANDLERS (try_block));
1081 /* Finish the handler-seq for a function-try-block, given by
1082 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1083 begin_function_try_block. */
1086 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1088 in_function_try_handler = 0;
1089 finish_handler_sequence (try_block);
1090 finish_compound_stmt (compound_stmt);
1093 /* Begin a handler. Returns a HANDLER if appropriate. */
1096 begin_handler (void)
1100 r = build_stmt (HANDLER, NULL_TREE, NULL_TREE);
1103 /* Create a binding level for the eh_info and the exception object
1105 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1110 /* Finish the handler-parameters for a handler, which may be given by
1111 HANDLER. DECL is the declaration for the catch parameter, or NULL
1112 if this is a `catch (...)' clause. */
1115 finish_handler_parms (tree decl, tree handler)
1117 tree type = NULL_TREE;
1118 if (processing_template_decl)
1122 decl = pushdecl (decl);
1123 decl = push_template_decl (decl);
1124 HANDLER_PARMS (handler) = decl;
1125 type = TREE_TYPE (decl);
1129 type = expand_start_catch_block (decl);
1130 HANDLER_TYPE (handler) = type;
1131 if (!processing_template_decl && type)
1132 mark_used (eh_type_info (type));
1135 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1136 the return value from the matching call to finish_handler_parms. */
1139 finish_handler (tree handler)
1141 if (!processing_template_decl)
1142 expand_end_catch_block ();
1143 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1146 /* Begin a compound statement. FLAGS contains some bits that control the
1147 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1148 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1149 block of a function. If BCS_TRY_BLOCK is set, this is the block
1150 created on behalf of a TRY statement. Returns a token to be passed to
1151 finish_compound_stmt. */
1154 begin_compound_stmt (unsigned int flags)
1158 if (flags & BCS_NO_SCOPE)
1160 r = push_stmt_list ();
1161 STATEMENT_LIST_NO_SCOPE (r) = 1;
1163 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1164 But, if it's a statement-expression with a scopeless block, there's
1165 nothing to keep, and we don't want to accidentally keep a block
1166 *inside* the scopeless block. */
1167 keep_next_level (false);
1170 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1172 /* When processing a template, we need to remember where the braces were,
1173 so that we can set up identical scopes when instantiating the template
1174 later. BIND_EXPR is a handy candidate for this.
1175 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1176 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1177 processing templates. */
1178 if (processing_template_decl)
1180 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1181 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1182 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1183 TREE_SIDE_EFFECTS (r) = 1;
1189 /* Finish a compound-statement, which is given by STMT. */
1192 finish_compound_stmt (tree stmt)
1194 if (TREE_CODE (stmt) == BIND_EXPR)
1195 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1196 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1197 stmt = pop_stmt_list (stmt);
1200 /* Destroy any ObjC "super" receivers that may have been
1202 objc_clear_super_receiver ();
1204 stmt = do_poplevel (stmt);
1207 /* ??? See c_end_compound_stmt wrt statement expressions. */
1212 /* Finish an asm-statement, whose components are a STRING, some
1213 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1214 whether the asm-statement should be considered volatile. */
1217 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1218 tree input_operands, tree clobbers)
1222 int ninputs = list_length (input_operands);
1223 int noutputs = list_length (output_operands);
1225 if (!processing_template_decl)
1227 const char *constraint;
1228 const char **oconstraints;
1229 bool allows_mem, allows_reg, is_inout;
1233 oconstraints = (const char **) alloca (noutputs * sizeof (char *));
1235 string = resolve_asm_operand_names (string, output_operands,
1238 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1240 operand = TREE_VALUE (t);
1242 /* ??? Really, this should not be here. Users should be using a
1243 proper lvalue, dammit. But there's a long history of using
1244 casts in the output operands. In cases like longlong.h, this
1245 becomes a primitive form of typechecking -- if the cast can be
1246 removed, then the output operand had a type of the proper width;
1247 otherwise we'll get an error. Gross, but ... */
1248 STRIP_NOPS (operand);
1250 if (!lvalue_or_else (operand, lv_asm))
1251 operand = error_mark_node;
1253 if (operand != error_mark_node
1254 && (TREE_READONLY (operand)
1255 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1256 /* Functions are not modifiable, even though they are
1258 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1259 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1260 /* If it's an aggregate and any field is const, then it is
1261 effectively const. */
1262 || (CLASS_TYPE_P (TREE_TYPE (operand))
1263 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1264 readonly_error (operand, "assignment (via 'asm' output)");
1266 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1267 oconstraints[i] = constraint;
1269 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1270 &allows_mem, &allows_reg, &is_inout))
1272 /* If the operand is going to end up in memory,
1273 mark it addressable. */
1274 if (!allows_reg && !cxx_mark_addressable (operand))
1275 operand = error_mark_node;
1278 operand = error_mark_node;
1280 TREE_VALUE (t) = operand;
1283 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1285 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1286 operand = decay_conversion (TREE_VALUE (t));
1288 /* If the type of the operand hasn't been determined (e.g.,
1289 because it involves an overloaded function), then issue
1290 an error message. There's no context available to
1291 resolve the overloading. */
1292 if (TREE_TYPE (operand) == unknown_type_node)
1294 error ("type of asm operand %qE could not be determined",
1296 operand = error_mark_node;
1299 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1300 oconstraints, &allows_mem, &allows_reg))
1302 /* If the operand is going to end up in memory,
1303 mark it addressable. */
1304 if (!allows_reg && allows_mem)
1306 /* Strip the nops as we allow this case. FIXME, this really
1307 should be rejected or made deprecated. */
1308 STRIP_NOPS (operand);
1309 if (!cxx_mark_addressable (operand))
1310 operand = error_mark_node;
1314 operand = error_mark_node;
1316 TREE_VALUE (t) = operand;
1320 r = build_stmt (ASM_EXPR, string,
1321 output_operands, input_operands,
1323 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1324 r = maybe_cleanup_point_expr_void (r);
1325 return add_stmt (r);
1328 /* Finish a label with the indicated NAME. */
1331 finish_label_stmt (tree name)
1333 tree decl = define_label (input_location, name);
1335 if (decl == error_mark_node)
1336 return error_mark_node;
1338 return add_stmt (build_stmt (LABEL_EXPR, decl));
1341 /* Finish a series of declarations for local labels. G++ allows users
1342 to declare "local" labels, i.e., labels with scope. This extension
1343 is useful when writing code involving statement-expressions. */
1346 finish_label_decl (tree name)
1348 if (!at_function_scope_p ())
1350 error ("__label__ declarations are only allowed in function scopes");
1354 add_decl_expr (declare_local_label (name));
1357 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1360 finish_decl_cleanup (tree decl, tree cleanup)
1362 push_cleanup (decl, cleanup, false);
1365 /* If the current scope exits with an exception, run CLEANUP. */
1368 finish_eh_cleanup (tree cleanup)
1370 push_cleanup (NULL, cleanup, true);
1373 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1374 order they were written by the user. Each node is as for
1375 emit_mem_initializers. */
1378 finish_mem_initializers (tree mem_inits)
1380 /* Reorder the MEM_INITS so that they are in the order they appeared
1381 in the source program. */
1382 mem_inits = nreverse (mem_inits);
1384 if (processing_template_decl)
1388 for (mem = mem_inits; mem; mem = TREE_CHAIN (mem))
1390 /* If the TREE_PURPOSE is a TYPE_PACK_EXPANSION, skip the
1391 check for bare parameter packs in the TREE_VALUE, because
1392 any parameter packs in the TREE_VALUE have already been
1393 bound as part of the TREE_PURPOSE. See
1394 make_pack_expansion for more information. */
1395 if (TREE_CODE (TREE_PURPOSE (mem)) != TYPE_PACK_EXPANSION
1396 && check_for_bare_parameter_packs (&TREE_VALUE (mem)))
1397 TREE_VALUE (mem) = error_mark_node;
1400 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1403 emit_mem_initializers (mem_inits);
1406 /* Finish a parenthesized expression EXPR. */
1409 finish_parenthesized_expr (tree expr)
1412 /* This inhibits warnings in c_common_truthvalue_conversion. */
1413 TREE_NO_WARNING (expr) = 1;
1415 if (TREE_CODE (expr) == OFFSET_REF)
1416 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1417 enclosed in parentheses. */
1418 PTRMEM_OK_P (expr) = 0;
1420 if (TREE_CODE (expr) == STRING_CST)
1421 PAREN_STRING_LITERAL_P (expr) = 1;
1426 /* Finish a reference to a non-static data member (DECL) that is not
1427 preceded by `.' or `->'. */
1430 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1432 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1436 if (current_function_decl
1437 && DECL_STATIC_FUNCTION_P (current_function_decl))
1438 error ("invalid use of member %q+D in static member function", decl);
1440 error ("invalid use of non-static data member %q+D", decl);
1441 error ("from this location");
1443 return error_mark_node;
1445 TREE_USED (current_class_ptr) = 1;
1446 if (processing_template_decl && !qualifying_scope)
1448 tree type = TREE_TYPE (decl);
1450 if (TREE_CODE (type) == REFERENCE_TYPE)
1451 type = TREE_TYPE (type);
1454 /* Set the cv qualifiers. */
1455 int quals = cp_type_quals (TREE_TYPE (current_class_ref));
1457 if (DECL_MUTABLE_P (decl))
1458 quals &= ~TYPE_QUAL_CONST;
1460 quals |= cp_type_quals (TREE_TYPE (decl));
1461 type = cp_build_qualified_type (type, quals);
1464 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1468 tree access_type = TREE_TYPE (object);
1469 tree lookup_context = context_for_name_lookup (decl);
1471 while (!DERIVED_FROM_P (lookup_context, access_type))
1473 access_type = TYPE_CONTEXT (access_type);
1474 while (access_type && DECL_P (access_type))
1475 access_type = DECL_CONTEXT (access_type);
1479 error ("object missing in reference to %q+D", decl);
1480 error ("from this location");
1481 return error_mark_node;
1485 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1486 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1488 if (processing_template_decl)
1489 return build_qualified_name (TREE_TYPE (decl),
1492 /*template_p=*/false);
1494 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1497 /* If the data member was named `C::M', convert `*this' to `C'
1499 if (qualifying_scope)
1501 tree binfo = NULL_TREE;
1502 object = build_scoped_ref (object, qualifying_scope,
1506 return build_class_member_access_expr (object, decl,
1507 /*access_path=*/NULL_TREE,
1508 /*preserve_reference=*/false);
1512 /* DECL was the declaration to which a qualified-id resolved. Issue
1513 an error message if it is not accessible. If OBJECT_TYPE is
1514 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1515 type of `*x', or `x', respectively. If the DECL was named as
1516 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1519 check_accessibility_of_qualified_id (tree decl,
1521 tree nested_name_specifier)
1524 tree qualifying_type = NULL_TREE;
1526 /* If we're not checking, return immediately. */
1527 if (deferred_access_no_check)
1530 /* Determine the SCOPE of DECL. */
1531 scope = context_for_name_lookup (decl);
1532 /* If the SCOPE is not a type, then DECL is not a member. */
1533 if (!TYPE_P (scope))
1535 /* Compute the scope through which DECL is being accessed. */
1537 /* OBJECT_TYPE might not be a class type; consider:
1539 class A { typedef int I; };
1543 In this case, we will have "A::I" as the DECL, but "I" as the
1545 && CLASS_TYPE_P (object_type)
1546 && DERIVED_FROM_P (scope, object_type))
1547 /* If we are processing a `->' or `.' expression, use the type of the
1549 qualifying_type = object_type;
1550 else if (nested_name_specifier)
1552 /* If the reference is to a non-static member of the
1553 current class, treat it as if it were referenced through
1555 if (DECL_NONSTATIC_MEMBER_P (decl)
1556 && current_class_ptr
1557 && DERIVED_FROM_P (scope, current_class_type))
1558 qualifying_type = current_class_type;
1559 /* Otherwise, use the type indicated by the
1560 nested-name-specifier. */
1562 qualifying_type = nested_name_specifier;
1565 /* Otherwise, the name must be from the current class or one of
1567 qualifying_type = currently_open_derived_class (scope);
1570 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1571 or similar in a default argument value. */
1572 && CLASS_TYPE_P (qualifying_type)
1573 && !dependent_type_p (qualifying_type))
1574 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1578 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1579 class named to the left of the "::" operator. DONE is true if this
1580 expression is a complete postfix-expression; it is false if this
1581 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1582 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1583 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1584 is true iff this qualified name appears as a template argument. */
1587 finish_qualified_id_expr (tree qualifying_class,
1592 bool template_arg_p)
1594 gcc_assert (TYPE_P (qualifying_class));
1596 if (error_operand_p (expr))
1597 return error_mark_node;
1599 if (DECL_P (expr) || BASELINK_P (expr))
1603 check_template_keyword (expr);
1605 /* If EXPR occurs as the operand of '&', use special handling that
1606 permits a pointer-to-member. */
1607 if (address_p && done)
1609 if (TREE_CODE (expr) == SCOPE_REF)
1610 expr = TREE_OPERAND (expr, 1);
1611 expr = build_offset_ref (qualifying_class, expr,
1612 /*address_p=*/true);
1616 /* Within the scope of a class, turn references to non-static
1617 members into expression of the form "this->...". */
1619 /* But, within a template argument, we do not want make the
1620 transformation, as there is no "this" pointer. */
1622 else if (TREE_CODE (expr) == FIELD_DECL)
1623 expr = finish_non_static_data_member (expr, current_class_ref,
1625 else if (BASELINK_P (expr) && !processing_template_decl)
1629 /* See if any of the functions are non-static members. */
1630 fns = BASELINK_FUNCTIONS (expr);
1631 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1632 fns = TREE_OPERAND (fns, 0);
1633 /* If so, the expression may be relative to the current
1635 if (!shared_member_p (fns)
1636 && current_class_type
1637 && DERIVED_FROM_P (qualifying_class, current_class_type))
1638 expr = (build_class_member_access_expr
1639 (maybe_dummy_object (qualifying_class, NULL),
1641 BASELINK_ACCESS_BINFO (expr),
1642 /*preserve_reference=*/false));
1644 /* The expression is a qualified name whose address is not
1646 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1652 /* Begin a statement-expression. The value returned must be passed to
1653 finish_stmt_expr. */
1656 begin_stmt_expr (void)
1658 return push_stmt_list ();
1661 /* Process the final expression of a statement expression. EXPR can be
1662 NULL, if the final expression is empty. Return a STATEMENT_LIST
1663 containing all the statements in the statement-expression, or
1664 ERROR_MARK_NODE if there was an error. */
1667 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1669 if (error_operand_p (expr))
1671 /* The type of the statement-expression is the type of the last
1673 TREE_TYPE (stmt_expr) = error_mark_node;
1674 return error_mark_node;
1677 /* If the last statement does not have "void" type, then the value
1678 of the last statement is the value of the entire expression. */
1681 tree type = TREE_TYPE (expr);
1683 if (processing_template_decl)
1685 expr = build_stmt (EXPR_STMT, expr);
1686 expr = add_stmt (expr);
1687 /* Mark the last statement so that we can recognize it as such at
1688 template-instantiation time. */
1689 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1691 else if (VOID_TYPE_P (type))
1693 /* Just treat this like an ordinary statement. */
1694 expr = finish_expr_stmt (expr);
1698 /* It actually has a value we need to deal with. First, force it
1699 to be an rvalue so that we won't need to build up a copy
1700 constructor call later when we try to assign it to something. */
1701 expr = force_rvalue (expr);
1702 if (error_operand_p (expr))
1703 return error_mark_node;
1705 /* Update for array-to-pointer decay. */
1706 type = TREE_TYPE (expr);
1708 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1709 normal statement, but don't convert to void or actually add
1711 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1712 expr = maybe_cleanup_point_expr (expr);
1716 /* The type of the statement-expression is the type of the last
1718 TREE_TYPE (stmt_expr) = type;
1724 /* Finish a statement-expression. EXPR should be the value returned
1725 by the previous begin_stmt_expr. Returns an expression
1726 representing the statement-expression. */
1729 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1734 if (error_operand_p (stmt_expr))
1735 return error_mark_node;
1737 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1739 type = TREE_TYPE (stmt_expr);
1740 result = pop_stmt_list (stmt_expr);
1741 TREE_TYPE (result) = type;
1743 if (processing_template_decl)
1745 result = build_min (STMT_EXPR, type, result);
1746 TREE_SIDE_EFFECTS (result) = 1;
1747 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1749 else if (CLASS_TYPE_P (type))
1751 /* Wrap the statement-expression in a TARGET_EXPR so that the
1752 temporary object created by the final expression is destroyed at
1753 the end of the full-expression containing the
1754 statement-expression. */
1755 result = force_target_expr (type, result);
1761 /* Returns the expression which provides the value of STMT_EXPR. */
1764 stmt_expr_value_expr (tree stmt_expr)
1766 tree t = STMT_EXPR_STMT (stmt_expr);
1768 if (TREE_CODE (t) == BIND_EXPR)
1769 t = BIND_EXPR_BODY (t);
1771 if (TREE_CODE (t) == STATEMENT_LIST)
1772 t = STATEMENT_LIST_TAIL (t)->stmt;
1774 if (TREE_CODE (t) == EXPR_STMT)
1775 t = EXPR_STMT_EXPR (t);
1780 /* Perform Koenig lookup. FN is the postfix-expression representing
1781 the function (or functions) to call; ARGS are the arguments to the
1782 call. Returns the functions to be considered by overload
1786 perform_koenig_lookup (tree fn, tree args)
1788 tree identifier = NULL_TREE;
1789 tree functions = NULL_TREE;
1791 /* Find the name of the overloaded function. */
1792 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1794 else if (is_overloaded_fn (fn))
1797 identifier = DECL_NAME (get_first_fn (functions));
1799 else if (DECL_P (fn))
1802 identifier = DECL_NAME (fn);
1805 /* A call to a namespace-scope function using an unqualified name.
1807 Do Koenig lookup -- unless any of the arguments are
1809 if (!any_type_dependent_arguments_p (args))
1811 fn = lookup_arg_dependent (identifier, functions, args);
1813 /* The unqualified name could not be resolved. */
1814 fn = unqualified_fn_lookup_error (identifier);
1820 /* Generate an expression for `FN (ARGS)'.
1822 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1823 as a virtual call, even if FN is virtual. (This flag is set when
1824 encountering an expression where the function name is explicitly
1825 qualified. For example a call to `X::f' never generates a virtual
1828 Returns code for the call. */
1831 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p)
1837 if (fn == error_mark_node || args == error_mark_node)
1838 return error_mark_node;
1840 /* ARGS should be a list of arguments. */
1841 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1842 gcc_assert (!TYPE_P (fn));
1847 if (processing_template_decl)
1849 if (type_dependent_expression_p (fn)
1850 || any_type_dependent_arguments_p (args))
1852 result = build_nt_call_list (fn, args);
1853 KOENIG_LOOKUP_P (result) = koenig_p;
1858 tree fndecl = OVL_CURRENT (fn);
1859 if (TREE_CODE (fndecl) != FUNCTION_DECL
1860 || !TREE_THIS_VOLATILE (fndecl))
1866 current_function_returns_abnormally = 1;
1870 if (!BASELINK_P (fn)
1871 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1872 && TREE_TYPE (fn) != unknown_type_node)
1873 fn = build_non_dependent_expr (fn);
1874 args = build_non_dependent_args (orig_args);
1877 if (is_overloaded_fn (fn))
1878 fn = baselink_for_fns (fn);
1881 if (BASELINK_P (fn))
1885 /* A call to a member function. From [over.call.func]:
1887 If the keyword this is in scope and refers to the class of
1888 that member function, or a derived class thereof, then the
1889 function call is transformed into a qualified function call
1890 using (*this) as the postfix-expression to the left of the
1891 . operator.... [Otherwise] a contrived object of type T
1892 becomes the implied object argument.
1894 This paragraph is unclear about this situation:
1896 struct A { void f(); };
1897 struct B : public A {};
1898 struct C : public A { void g() { B::f(); }};
1900 In particular, for `B::f', this paragraph does not make clear
1901 whether "the class of that member function" refers to `A' or
1902 to `B'. We believe it refers to `B'. */
1903 if (current_class_type
1904 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1906 && current_class_ref)
1907 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1911 tree representative_fn;
1913 representative_fn = BASELINK_FUNCTIONS (fn);
1914 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1915 representative_fn = TREE_OPERAND (representative_fn, 0);
1916 representative_fn = get_first_fn (representative_fn);
1917 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1920 if (processing_template_decl)
1922 if (type_dependent_expression_p (object))
1923 return build_nt_call_list (orig_fn, orig_args);
1924 object = build_non_dependent_expr (object);
1927 result = build_new_method_call (object, fn, args, NULL_TREE,
1929 ? LOOKUP_NONVIRTUAL : 0),
1932 else if (is_overloaded_fn (fn))
1934 /* If the function is an overloaded builtin, resolve it. */
1935 if (TREE_CODE (fn) == FUNCTION_DECL
1936 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
1937 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
1938 result = resolve_overloaded_builtin (fn, args);
1941 /* A call to a namespace-scope function. */
1942 result = build_new_function_call (fn, args, koenig_p);
1944 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1947 error ("arguments to destructor are not allowed");
1948 /* Mark the pseudo-destructor call as having side-effects so
1949 that we do not issue warnings about its use. */
1950 result = build1 (NOP_EXPR,
1952 TREE_OPERAND (fn, 0));
1953 TREE_SIDE_EFFECTS (result) = 1;
1955 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1956 /* If the "function" is really an object of class type, it might
1957 have an overloaded `operator ()'. */
1958 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1959 /*overloaded_p=*/NULL);
1962 /* A call where the function is unknown. */
1963 result = build_function_call (fn, args);
1965 if (processing_template_decl)
1967 result = build_call_list (TREE_TYPE (result), orig_fn, orig_args);
1968 KOENIG_LOOKUP_P (result) = koenig_p;
1973 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1974 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1975 POSTDECREMENT_EXPR.) */
1978 finish_increment_expr (tree expr, enum tree_code code)
1980 return build_x_unary_op (code, expr);
1983 /* Finish a use of `this'. Returns an expression for `this'. */
1986 finish_this_expr (void)
1990 if (current_class_ptr)
1992 result = current_class_ptr;
1994 else if (current_function_decl
1995 && DECL_STATIC_FUNCTION_P (current_function_decl))
1997 error ("%<this%> is unavailable for static member functions");
1998 result = error_mark_node;
2002 if (current_function_decl)
2003 error ("invalid use of %<this%> in non-member function");
2005 error ("invalid use of %<this%> at top level");
2006 result = error_mark_node;
2012 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
2013 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
2014 the TYPE for the type given. If SCOPE is non-NULL, the expression
2015 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
2018 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
2020 if (object == error_mark_node || destructor == error_mark_node)
2021 return error_mark_node;
2023 gcc_assert (TYPE_P (destructor));
2025 if (!processing_template_decl)
2027 if (scope == error_mark_node)
2029 error ("invalid qualifying scope in pseudo-destructor name");
2030 return error_mark_node;
2032 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
2034 error ("qualified type %qT does not match destructor name ~%qT",
2036 return error_mark_node;
2040 /* [expr.pseudo] says both:
2042 The type designated by the pseudo-destructor-name shall be
2043 the same as the object type.
2047 The cv-unqualified versions of the object type and of the
2048 type designated by the pseudo-destructor-name shall be the
2051 We implement the more generous second sentence, since that is
2052 what most other compilers do. */
2053 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2056 error ("%qE is not of type %qT", object, destructor);
2057 return error_mark_node;
2061 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2064 /* Finish an expression of the form CODE EXPR. */
2067 finish_unary_op_expr (enum tree_code code, tree expr)
2069 tree result = build_x_unary_op (code, expr);
2070 /* Inside a template, build_x_unary_op does not fold the
2071 expression. So check whether the result is folded before
2072 setting TREE_NEGATED_INT. */
2073 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2074 && TREE_CODE (result) == INTEGER_CST
2075 && !TYPE_UNSIGNED (TREE_TYPE (result))
2076 && INT_CST_LT (result, integer_zero_node))
2078 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2079 setting TREE_NEGATED_INT. */
2080 result = copy_node (result);
2081 TREE_NEGATED_INT (result) = 1;
2083 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2084 overflow_warning (result);
2089 /* Finish a compound-literal expression. TYPE is the type to which
2090 the INITIALIZER_LIST is being cast. */
2093 finish_compound_literal (tree type, VEC(constructor_elt,gc) *initializer_list)
2096 tree compound_literal;
2098 if (!TYPE_OBJ_P (type))
2100 error ("compound literal of non-object type %qT", type);
2101 return error_mark_node;
2104 /* Build a CONSTRUCTOR for the INITIALIZER_LIST. */
2105 compound_literal = build_constructor (NULL_TREE, initializer_list);
2106 if (processing_template_decl)
2108 TREE_TYPE (compound_literal) = type;
2109 /* Mark the expression as a compound literal. */
2110 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2111 return compound_literal;
2114 /* Create a temporary variable to represent the compound literal. */
2115 var = create_temporary_var (type);
2116 if (!current_function_decl)
2118 /* If this compound-literal appears outside of a function, then
2119 the corresponding variable has static storage duration, just
2120 like the variable in whose initializer it appears. */
2121 TREE_STATIC (var) = 1;
2122 /* The variable has internal linkage, since there is no need to
2123 reference it from another translation unit. */
2124 TREE_PUBLIC (var) = 0;
2125 /* It must have a name, so that the name mangler can mangle it. */
2126 DECL_NAME (var) = make_anon_name ();
2128 /* We must call pushdecl, since the gimplifier complains if the
2129 variable has not been declared via a BIND_EXPR. */
2131 /* Initialize the variable as we would any other variable with a
2132 brace-enclosed initializer. */
2133 cp_finish_decl (var, compound_literal,
2134 /*init_const_expr_p=*/false,
2135 /*asmspec_tree=*/NULL_TREE,
2136 LOOKUP_ONLYCONVERTING);
2140 /* Return the declaration for the function-name variable indicated by
2144 finish_fname (tree id)
2148 decl = fname_decl (C_RID_CODE (id), id);
2149 if (processing_template_decl)
2150 decl = DECL_NAME (decl);
2154 /* Finish a translation unit. */
2157 finish_translation_unit (void)
2159 /* In case there were missing closebraces,
2160 get us back to the global binding level. */
2162 while (current_namespace != global_namespace)
2165 /* Do file scope __FUNCTION__ et al. */
2166 finish_fname_decls ();
2169 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2170 Returns the parameter. */
2173 finish_template_type_parm (tree aggr, tree identifier)
2175 if (aggr != class_type_node)
2177 pedwarn ("template type parameters must use the keyword %<class%> or %<typename%>");
2178 aggr = class_type_node;
2181 return build_tree_list (aggr, identifier);
2184 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2185 Returns the parameter. */
2188 finish_template_template_parm (tree aggr, tree identifier)
2190 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2191 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2192 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2193 DECL_TEMPLATE_RESULT (tmpl) = decl;
2194 DECL_ARTIFICIAL (decl) = 1;
2195 end_template_decl ();
2197 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2199 check_default_tmpl_args (decl, DECL_TEMPLATE_PARMS (tmpl),
2200 /*is_primary=*/true, /*is_partial=*/false,
2203 return finish_template_type_parm (aggr, tmpl);
2206 /* ARGUMENT is the default-argument value for a template template
2207 parameter. If ARGUMENT is invalid, issue error messages and return
2208 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2211 check_template_template_default_arg (tree argument)
2213 if (TREE_CODE (argument) != TEMPLATE_DECL
2214 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2215 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2217 if (TREE_CODE (argument) == TYPE_DECL)
2218 error ("invalid use of type %qT as a default value for a template "
2219 "template-parameter", TREE_TYPE (argument));
2221 error ("invalid default argument for a template template parameter");
2222 return error_mark_node;
2228 /* Begin a class definition, as indicated by T. */
2231 begin_class_definition (tree t, tree attributes)
2233 if (t == error_mark_node)
2234 return error_mark_node;
2236 if (processing_template_parmlist)
2238 error ("definition of %q#T inside template parameter list", t);
2239 return error_mark_node;
2241 /* A non-implicit typename comes from code like:
2243 template <typename T> struct A {
2244 template <typename U> struct A<T>::B ...
2246 This is erroneous. */
2247 else if (TREE_CODE (t) == TYPENAME_TYPE)
2249 error ("invalid definition of qualified type %qT", t);
2250 t = error_mark_node;
2253 if (t == error_mark_node || ! IS_AGGR_TYPE (t))
2255 t = make_aggr_type (RECORD_TYPE);
2256 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2259 /* Update the location of the decl. */
2260 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2262 if (TYPE_BEING_DEFINED (t))
2264 t = make_aggr_type (TREE_CODE (t));
2265 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2267 maybe_process_partial_specialization (t);
2269 TYPE_BEING_DEFINED (t) = 1;
2271 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2273 if (flag_pack_struct)
2276 TYPE_PACKED (t) = 1;
2277 /* Even though the type is being defined for the first time
2278 here, there might have been a forward declaration, so there
2279 might be cv-qualified variants of T. */
2280 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2281 TYPE_PACKED (v) = 1;
2283 /* Reset the interface data, at the earliest possible
2284 moment, as it might have been set via a class foo;
2286 if (! TYPE_ANONYMOUS_P (t))
2288 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2289 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2290 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2291 (t, finfo->interface_unknown);
2293 reset_specialization();
2295 /* Make a declaration for this class in its own scope. */
2296 build_self_reference ();
2301 /* Finish the member declaration given by DECL. */
2304 finish_member_declaration (tree decl)
2306 if (decl == error_mark_node || decl == NULL_TREE)
2309 if (decl == void_type_node)
2310 /* The COMPONENT was a friend, not a member, and so there's
2311 nothing for us to do. */
2314 /* We should see only one DECL at a time. */
2315 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2317 /* Set up access control for DECL. */
2319 = (current_access_specifier == access_private_node);
2320 TREE_PROTECTED (decl)
2321 = (current_access_specifier == access_protected_node);
2322 if (TREE_CODE (decl) == TEMPLATE_DECL)
2324 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2325 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2328 /* Mark the DECL as a member of the current class. */
2329 DECL_CONTEXT (decl) = current_class_type;
2331 /* Check for bare parameter packs in the member variable declaration. */
2332 if (TREE_CODE (decl) == FIELD_DECL)
2334 if (check_for_bare_parameter_packs (&TREE_TYPE (decl)))
2335 TREE_TYPE (decl) = error_mark_node;
2336 if (check_for_bare_parameter_packs (&DECL_ATTRIBUTES (decl)))
2337 DECL_ATTRIBUTES (decl) = NULL_TREE;
2342 A C language linkage is ignored for the names of class members
2343 and the member function type of class member functions. */
2344 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2345 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2347 /* Put functions on the TYPE_METHODS list and everything else on the
2348 TYPE_FIELDS list. Note that these are built up in reverse order.
2349 We reverse them (to obtain declaration order) in finish_struct. */
2350 if (TREE_CODE (decl) == FUNCTION_DECL
2351 || DECL_FUNCTION_TEMPLATE_P (decl))
2353 /* We also need to add this function to the
2354 CLASSTYPE_METHOD_VEC. */
2355 if (add_method (current_class_type, decl, NULL_TREE))
2357 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2358 TYPE_METHODS (current_class_type) = decl;
2360 maybe_add_class_template_decl_list (current_class_type, decl,
2364 /* Enter the DECL into the scope of the class. */
2365 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2366 || pushdecl_class_level (decl))
2368 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2369 go at the beginning. The reason is that lookup_field_1
2370 searches the list in order, and we want a field name to
2371 override a type name so that the "struct stat hack" will
2372 work. In particular:
2374 struct S { enum E { }; int E } s;
2377 is valid. In addition, the FIELD_DECLs must be maintained in
2378 declaration order so that class layout works as expected.
2379 However, we don't need that order until class layout, so we
2380 save a little time by putting FIELD_DECLs on in reverse order
2381 here, and then reversing them in finish_struct_1. (We could
2382 also keep a pointer to the correct insertion points in the
2385 if (TREE_CODE (decl) == TYPE_DECL)
2386 TYPE_FIELDS (current_class_type)
2387 = chainon (TYPE_FIELDS (current_class_type), decl);
2390 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2391 TYPE_FIELDS (current_class_type) = decl;
2394 maybe_add_class_template_decl_list (current_class_type, decl,
2399 note_decl_for_pch (decl);
2402 /* DECL has been declared while we are building a PCH file. Perform
2403 actions that we might normally undertake lazily, but which can be
2404 performed now so that they do not have to be performed in
2405 translation units which include the PCH file. */
2408 note_decl_for_pch (tree decl)
2410 gcc_assert (pch_file);
2412 /* There's a good chance that we'll have to mangle names at some
2413 point, even if only for emission in debugging information. */
2414 if ((TREE_CODE (decl) == VAR_DECL
2415 || TREE_CODE (decl) == FUNCTION_DECL)
2416 && !processing_template_decl)
2420 /* Finish processing a complete template declaration. The PARMS are
2421 the template parameters. */
2424 finish_template_decl (tree parms)
2427 end_template_decl ();
2429 end_specialization ();
2432 /* Finish processing a template-id (which names a type) of the form
2433 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2434 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2435 the scope of template-id indicated. */
2438 finish_template_type (tree name, tree args, int entering_scope)
2442 decl = lookup_template_class (name, args,
2443 NULL_TREE, NULL_TREE, entering_scope,
2444 tf_warning_or_error | tf_user);
2445 if (decl != error_mark_node)
2446 decl = TYPE_STUB_DECL (decl);
2451 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2452 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2453 BASE_CLASS, or NULL_TREE if an error occurred. The
2454 ACCESS_SPECIFIER is one of
2455 access_{default,public,protected_private}_node. For a virtual base
2456 we set TREE_TYPE. */
2459 finish_base_specifier (tree base, tree access, bool virtual_p)
2463 if (base == error_mark_node)
2465 error ("invalid base-class specification");
2468 else if (! is_aggr_type (base, 1))
2472 if (cp_type_quals (base) != 0)
2474 error ("base class %qT has cv qualifiers", base);
2475 base = TYPE_MAIN_VARIANT (base);
2477 result = build_tree_list (access, base);
2479 TREE_TYPE (result) = integer_type_node;
2485 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2486 what we found when we tried to do the lookup. */
2489 qualified_name_lookup_error (tree scope, tree name, tree decl)
2491 if (scope == error_mark_node)
2492 ; /* We already complained. */
2493 else if (TYPE_P (scope))
2495 if (!COMPLETE_TYPE_P (scope))
2496 error ("incomplete type %qT used in nested name specifier", scope);
2497 else if (TREE_CODE (decl) == TREE_LIST)
2499 error ("reference to %<%T::%D%> is ambiguous", scope, name);
2500 print_candidates (decl);
2503 error ("%qD is not a member of %qT", name, scope);
2505 else if (scope != global_namespace)
2506 error ("%qD is not a member of %qD", name, scope);
2508 error ("%<::%D%> has not been declared", name);
2511 /* If FNS is a member function, a set of member functions, or a
2512 template-id referring to one or more member functions, return a
2513 BASELINK for FNS, incorporating the current access context.
2514 Otherwise, return FNS unchanged. */
2517 baselink_for_fns (tree fns)
2522 if (BASELINK_P (fns)
2523 || error_operand_p (fns))
2527 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2528 fn = TREE_OPERAND (fn, 0);
2529 fn = get_first_fn (fn);
2530 if (!DECL_FUNCTION_MEMBER_P (fn))
2533 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2535 cl = DECL_CONTEXT (fn);
2536 cl = TYPE_BINFO (cl);
2537 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2540 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2541 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2542 if non-NULL, is the type or namespace used to explicitly qualify
2543 ID_EXPRESSION. DECL is the entity to which that name has been
2546 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2547 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2548 be set to true if this expression isn't permitted in a
2549 constant-expression, but it is otherwise not set by this function.
2550 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2551 constant-expression, but a non-constant expression is also
2554 DONE is true if this expression is a complete postfix-expression;
2555 it is false if this expression is followed by '->', '[', '(', etc.
2556 ADDRESS_P is true iff this expression is the operand of '&'.
2557 TEMPLATE_P is true iff the qualified-id was of the form
2558 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2559 appears as a template argument.
2561 If an error occurs, and it is the kind of error that might cause
2562 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2563 is the caller's responsibility to issue the message. *ERROR_MSG
2564 will be a string with static storage duration, so the caller need
2567 Return an expression for the entity, after issuing appropriate
2568 diagnostics. This function is also responsible for transforming a
2569 reference to a non-static member into a COMPONENT_REF that makes
2570 the use of "this" explicit.
2572 Upon return, *IDK will be filled in appropriately. */
2575 finish_id_expression (tree id_expression,
2579 bool integral_constant_expression_p,
2580 bool allow_non_integral_constant_expression_p,
2581 bool *non_integral_constant_expression_p,
2585 bool template_arg_p,
2586 const char **error_msg)
2588 /* Initialize the output parameters. */
2589 *idk = CP_ID_KIND_NONE;
2592 if (id_expression == error_mark_node)
2593 return error_mark_node;
2594 /* If we have a template-id, then no further lookup is
2595 required. If the template-id was for a template-class, we
2596 will sometimes have a TYPE_DECL at this point. */
2597 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2598 || TREE_CODE (decl) == TYPE_DECL)
2600 /* Look up the name. */
2603 if (decl == error_mark_node)
2605 /* Name lookup failed. */
2608 || (!dependent_type_p (scope)
2609 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2610 && IDENTIFIER_TYPENAME_P (id_expression)
2611 && dependent_type_p (TREE_TYPE (id_expression))))))
2613 /* If the qualifying type is non-dependent (and the name
2614 does not name a conversion operator to a dependent
2615 type), issue an error. */
2616 qualified_name_lookup_error (scope, id_expression, decl);
2617 return error_mark_node;
2621 /* It may be resolved via Koenig lookup. */
2622 *idk = CP_ID_KIND_UNQUALIFIED;
2623 return id_expression;
2626 decl = id_expression;
2628 /* If DECL is a variable that would be out of scope under
2629 ANSI/ISO rules, but in scope in the ARM, name lookup
2630 will succeed. Issue a diagnostic here. */
2632 decl = check_for_out_of_scope_variable (decl);
2634 /* Remember that the name was used in the definition of
2635 the current class so that we can check later to see if
2636 the meaning would have been different after the class
2637 was entirely defined. */
2638 if (!scope && decl != error_mark_node)
2639 maybe_note_name_used_in_class (id_expression, decl);
2641 /* Disallow uses of local variables from containing functions. */
2642 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2644 tree context = decl_function_context (decl);
2645 if (context != NULL_TREE && context != current_function_decl
2646 && ! TREE_STATIC (decl))
2648 error (TREE_CODE (decl) == VAR_DECL
2649 ? "use of %<auto%> variable from containing function"
2650 : "use of parameter from containing function");
2651 error (" %q+#D declared here", decl);
2652 return error_mark_node;
2657 /* If we didn't find anything, or what we found was a type,
2658 then this wasn't really an id-expression. */
2659 if (TREE_CODE (decl) == TEMPLATE_DECL
2660 && !DECL_FUNCTION_TEMPLATE_P (decl))
2662 *error_msg = "missing template arguments";
2663 return error_mark_node;
2665 else if (TREE_CODE (decl) == TYPE_DECL
2666 || TREE_CODE (decl) == NAMESPACE_DECL)
2668 *error_msg = "expected primary-expression";
2669 return error_mark_node;
2672 /* If the name resolved to a template parameter, there is no
2673 need to look it up again later. */
2674 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2675 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2679 *idk = CP_ID_KIND_NONE;
2680 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2681 decl = TEMPLATE_PARM_DECL (decl);
2682 r = convert_from_reference (DECL_INITIAL (decl));
2684 if (integral_constant_expression_p
2685 && !dependent_type_p (TREE_TYPE (decl))
2686 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2688 if (!allow_non_integral_constant_expression_p)
2689 error ("template parameter %qD of type %qT is not allowed in "
2690 "an integral constant expression because it is not of "
2691 "integral or enumeration type", decl, TREE_TYPE (decl));
2692 *non_integral_constant_expression_p = true;
2696 /* Similarly, we resolve enumeration constants to their
2697 underlying values. */
2698 else if (TREE_CODE (decl) == CONST_DECL)
2700 *idk = CP_ID_KIND_NONE;
2701 if (!processing_template_decl)
2703 used_types_insert (TREE_TYPE (decl));
2704 return DECL_INITIAL (decl);
2712 /* If the declaration was explicitly qualified indicate
2713 that. The semantics of `A::f(3)' are different than
2714 `f(3)' if `f' is virtual. */
2716 ? CP_ID_KIND_QUALIFIED
2717 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2718 ? CP_ID_KIND_TEMPLATE_ID
2719 : CP_ID_KIND_UNQUALIFIED));
2724 An id-expression is type-dependent if it contains an
2725 identifier that was declared with a dependent type.
2727 The standard is not very specific about an id-expression that
2728 names a set of overloaded functions. What if some of them
2729 have dependent types and some of them do not? Presumably,
2730 such a name should be treated as a dependent name. */
2731 /* Assume the name is not dependent. */
2732 dependent_p = false;
2733 if (!processing_template_decl)
2734 /* No names are dependent outside a template. */
2736 /* A template-id where the name of the template was not resolved
2737 is definitely dependent. */
2738 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2739 && (TREE_CODE (TREE_OPERAND (decl, 0))
2740 == IDENTIFIER_NODE))
2742 /* For anything except an overloaded function, just check its
2744 else if (!is_overloaded_fn (decl))
2746 = dependent_type_p (TREE_TYPE (decl));
2747 /* For a set of overloaded functions, check each of the
2753 if (BASELINK_P (fns))
2754 fns = BASELINK_FUNCTIONS (fns);
2756 /* For a template-id, check to see if the template
2757 arguments are dependent. */
2758 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2760 tree args = TREE_OPERAND (fns, 1);
2761 dependent_p = any_dependent_template_arguments_p (args);
2762 /* The functions are those referred to by the
2764 fns = TREE_OPERAND (fns, 0);
2767 /* If there are no dependent template arguments, go through
2768 the overloaded functions. */
2769 while (fns && !dependent_p)
2771 tree fn = OVL_CURRENT (fns);
2773 /* Member functions of dependent classes are
2775 if (TREE_CODE (fn) == FUNCTION_DECL
2776 && type_dependent_expression_p (fn))
2778 else if (TREE_CODE (fn) == TEMPLATE_DECL
2779 && dependent_template_p (fn))
2782 fns = OVL_NEXT (fns);
2786 /* If the name was dependent on a template parameter, we will
2787 resolve the name at instantiation time. */
2790 /* Create a SCOPE_REF for qualified names, if the scope is
2794 /* Since this name was dependent, the expression isn't
2795 constant -- yet. No error is issued because it might
2796 be constant when things are instantiated. */
2797 if (integral_constant_expression_p)
2798 *non_integral_constant_expression_p = true;
2801 if (address_p && done)
2802 decl = finish_qualified_id_expr (scope, decl,
2806 else if (dependent_type_p (scope))
2807 decl = build_qualified_name (/*type=*/NULL_TREE,
2811 else if (DECL_P (decl))
2812 decl = build_qualified_name (TREE_TYPE (decl),
2817 if (TREE_TYPE (decl))
2818 decl = convert_from_reference (decl);
2821 /* A TEMPLATE_ID already contains all the information we
2823 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2824 return id_expression;
2825 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2826 /* If we found a variable, then name lookup during the
2827 instantiation will always resolve to the same VAR_DECL
2828 (or an instantiation thereof). */
2829 if (TREE_CODE (decl) == VAR_DECL
2830 || TREE_CODE (decl) == PARM_DECL)
2831 return convert_from_reference (decl);
2832 /* The same is true for FIELD_DECL, but we also need to
2833 make sure that the syntax is correct. */
2834 else if (TREE_CODE (decl) == FIELD_DECL)
2836 /* Since SCOPE is NULL here, this is an unqualified name.
2837 Access checking has been performed during name lookup
2838 already. Turn off checking to avoid duplicate errors. */
2839 push_deferring_access_checks (dk_no_check);
2840 decl = finish_non_static_data_member
2841 (decl, current_class_ref,
2842 /*qualifying_scope=*/NULL_TREE);
2843 pop_deferring_access_checks ();
2846 return id_expression;
2849 /* Only certain kinds of names are allowed in constant
2850 expression. Enumerators and template parameters have already
2851 been handled above. */
2852 if (integral_constant_expression_p
2853 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2854 && ! builtin_valid_in_constant_expr_p (decl))
2856 if (!allow_non_integral_constant_expression_p)
2858 error ("%qD cannot appear in a constant-expression", decl);
2859 return error_mark_node;
2861 *non_integral_constant_expression_p = true;
2864 if (TREE_CODE (decl) == NAMESPACE_DECL)
2866 error ("use of namespace %qD as expression", decl);
2867 return error_mark_node;
2869 else if (DECL_CLASS_TEMPLATE_P (decl))
2871 error ("use of class template %qT as expression", decl);
2872 return error_mark_node;
2874 else if (TREE_CODE (decl) == TREE_LIST)
2876 /* Ambiguous reference to base members. */
2877 error ("request for member %qD is ambiguous in "
2878 "multiple inheritance lattice", id_expression);
2879 print_candidates (decl);
2880 return error_mark_node;
2883 /* Mark variable-like entities as used. Functions are similarly
2884 marked either below or after overload resolution. */
2885 if (TREE_CODE (decl) == VAR_DECL
2886 || TREE_CODE (decl) == PARM_DECL
2887 || TREE_CODE (decl) == RESULT_DECL)
2892 decl = (adjust_result_of_qualified_name_lookup
2893 (decl, scope, current_class_type));
2895 if (TREE_CODE (decl) == FUNCTION_DECL)
2898 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2899 decl = finish_qualified_id_expr (scope,
2907 tree r = convert_from_reference (decl);
2909 if (processing_template_decl && TYPE_P (scope))
2910 r = build_qualified_name (TREE_TYPE (r),
2916 else if (TREE_CODE (decl) == FIELD_DECL)
2918 /* Since SCOPE is NULL here, this is an unqualified name.
2919 Access checking has been performed during name lookup
2920 already. Turn off checking to avoid duplicate errors. */
2921 push_deferring_access_checks (dk_no_check);
2922 decl = finish_non_static_data_member (decl, current_class_ref,
2923 /*qualifying_scope=*/NULL_TREE);
2924 pop_deferring_access_checks ();
2926 else if (is_overloaded_fn (decl))
2931 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
2932 first_fn = TREE_OPERAND (first_fn, 0);
2933 first_fn = get_first_fn (first_fn);
2934 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2935 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2937 if (!really_overloaded_fn (decl))
2938 mark_used (first_fn);
2941 && TREE_CODE (first_fn) == FUNCTION_DECL
2942 && DECL_FUNCTION_MEMBER_P (first_fn)
2943 && !shared_member_p (decl))
2945 /* A set of member functions. */
2946 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
2947 return finish_class_member_access_expr (decl, id_expression,
2948 /*template_p=*/false);
2951 decl = baselink_for_fns (decl);
2955 if (DECL_P (decl) && DECL_NONLOCAL (decl)
2956 && DECL_CLASS_SCOPE_P (decl))
2958 tree context = context_for_name_lookup (decl);
2959 if (context != current_class_type)
2961 tree path = currently_open_derived_class (context);
2962 perform_or_defer_access_check (TYPE_BINFO (path),
2967 decl = convert_from_reference (decl);
2971 if (TREE_DEPRECATED (decl))
2972 warn_deprecated_use (decl);
2977 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
2978 use as a type-specifier. */
2981 finish_typeof (tree expr)
2985 if (type_dependent_expression_p (expr))
2987 type = make_aggr_type (TYPEOF_TYPE);
2988 TYPEOF_TYPE_EXPR (type) = expr;
2989 SET_TYPE_STRUCTURAL_EQUALITY (type);
2994 type = unlowered_expr_type (expr);
2996 if (!type || type == unknown_type_node)
2998 error ("type of %qE is unknown", expr);
2999 return error_mark_node;
3005 /* Perform C++-specific checks for __builtin_offsetof before calling
3009 finish_offsetof (tree expr)
3011 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
3013 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
3014 TREE_OPERAND (expr, 2));
3015 return error_mark_node;
3017 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
3018 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
3019 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
3021 if (TREE_CODE (expr) == COMPONENT_REF
3022 || TREE_CODE (expr) == COMPOUND_EXPR)
3023 expr = TREE_OPERAND (expr, 1);
3024 error ("cannot apply %<offsetof%> to member function %qD", expr);
3025 return error_mark_node;
3027 return fold_offsetof (expr, NULL_TREE);
3030 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
3031 with equivalent CALL_EXPRs. */
3034 simplify_aggr_init_exprs_r (tree* tp,
3036 void* data ATTRIBUTE_UNUSED)
3038 /* We don't need to walk into types; there's nothing in a type that
3039 needs simplification. (And, furthermore, there are places we
3040 actively don't want to go. For example, we don't want to wander
3041 into the default arguments for a FUNCTION_DECL that appears in a
3048 /* Only AGGR_INIT_EXPRs are interesting. */
3049 else if (TREE_CODE (*tp) != AGGR_INIT_EXPR)
3052 simplify_aggr_init_expr (tp);
3054 /* Keep iterating. */
3058 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
3059 function is broken out from the above for the benefit of the tree-ssa
3063 simplify_aggr_init_expr (tree *tp)
3065 tree aggr_init_expr = *tp;
3067 /* Form an appropriate CALL_EXPR. */
3068 tree fn = AGGR_INIT_EXPR_FN (aggr_init_expr);
3069 tree slot = AGGR_INIT_EXPR_SLOT (aggr_init_expr);
3070 tree type = TREE_TYPE (slot);
3073 enum style_t { ctor, arg, pcc } style;
3075 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3077 #ifdef PCC_STATIC_STRUCT_RETURN
3083 gcc_assert (TREE_ADDRESSABLE (type));
3087 call_expr = build_call_array (TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3089 aggr_init_expr_nargs (aggr_init_expr),
3090 AGGR_INIT_EXPR_ARGP (aggr_init_expr));
3094 /* Replace the first argument to the ctor with the address of the
3096 cxx_mark_addressable (slot);
3097 CALL_EXPR_ARG (call_expr, 0) =
3098 build1 (ADDR_EXPR, build_pointer_type (type), slot);
3100 else if (style == arg)
3102 /* Just mark it addressable here, and leave the rest to
3103 expand_call{,_inline}. */
3104 cxx_mark_addressable (slot);
3105 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3106 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3108 else if (style == pcc)
3110 /* If we're using the non-reentrant PCC calling convention, then we
3111 need to copy the returned value out of the static buffer into the
3113 push_deferring_access_checks (dk_no_check);
3114 call_expr = build_aggr_init (slot, call_expr,
3115 DIRECT_BIND | LOOKUP_ONLYCONVERTING);
3116 pop_deferring_access_checks ();
3117 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3123 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3126 emit_associated_thunks (tree fn)
3128 /* When we use vcall offsets, we emit thunks with the virtual
3129 functions to which they thunk. The whole point of vcall offsets
3130 is so that you can know statically the entire set of thunks that
3131 will ever be needed for a given virtual function, thereby
3132 enabling you to output all the thunks with the function itself. */
3133 if (DECL_VIRTUAL_P (fn))
3137 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3139 if (!THUNK_ALIAS (thunk))
3141 use_thunk (thunk, /*emit_p=*/1);
3142 if (DECL_RESULT_THUNK_P (thunk))
3146 for (probe = DECL_THUNKS (thunk);
3147 probe; probe = TREE_CHAIN (probe))
3148 use_thunk (probe, /*emit_p=*/1);
3152 gcc_assert (!DECL_THUNKS (thunk));
3157 /* Generate RTL for FN. */
3160 expand_or_defer_fn (tree fn)
3162 /* When the parser calls us after finishing the body of a template
3163 function, we don't really want to expand the body. */
3164 if (processing_template_decl)
3166 /* Normally, collection only occurs in rest_of_compilation. So,
3167 if we don't collect here, we never collect junk generated
3168 during the processing of templates until we hit a
3169 non-template function. It's not safe to do this inside a
3170 nested class, though, as the parser may have local state that
3171 is not a GC root. */
3172 if (!function_depth)
3177 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
3178 cp_walk_tree_without_duplicates (&DECL_SAVED_TREE (fn),
3179 simplify_aggr_init_exprs_r,
3182 /* If this is a constructor or destructor body, we have to clone
3184 if (maybe_clone_body (fn))
3186 /* We don't want to process FN again, so pretend we've written
3187 it out, even though we haven't. */
3188 TREE_ASM_WRITTEN (fn) = 1;
3192 /* We make a decision about linkage for these functions at the end
3193 of the compilation. Until that point, we do not want the back
3194 end to output them -- but we do want it to see the bodies of
3195 these functions so that it can inline them as appropriate. */
3196 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3198 if (DECL_INTERFACE_KNOWN (fn))
3199 /* We've already made a decision as to how this function will
3203 DECL_EXTERNAL (fn) = 1;
3204 DECL_NOT_REALLY_EXTERN (fn) = 1;
3205 note_vague_linkage_fn (fn);
3206 /* A non-template inline function with external linkage will
3207 always be COMDAT. As we must eventually determine the
3208 linkage of all functions, and as that causes writes to
3209 the data mapped in from the PCH file, it's advantageous
3210 to mark the functions at this point. */
3211 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3213 /* This function must have external linkage, as
3214 otherwise DECL_INTERFACE_KNOWN would have been
3216 gcc_assert (TREE_PUBLIC (fn));
3217 comdat_linkage (fn);
3218 DECL_INTERFACE_KNOWN (fn) = 1;
3222 import_export_decl (fn);
3224 /* If the user wants us to keep all inline functions, then mark
3225 this function as needed so that finish_file will make sure to
3227 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3231 /* There's no reason to do any of the work here if we're only doing
3232 semantic analysis; this code just generates RTL. */
3233 if (flag_syntax_only)
3238 /* Expand or defer, at the whim of the compilation unit manager. */
3239 cgraph_finalize_function (fn, function_depth > 1);
3251 /* Helper function for walk_tree, used by finalize_nrv below. */
3254 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3256 struct nrv_data *dp = (struct nrv_data *)data;
3259 /* No need to walk into types. There wouldn't be any need to walk into
3260 non-statements, except that we have to consider STMT_EXPRs. */
3263 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3264 but differs from using NULL_TREE in that it indicates that we care
3265 about the value of the RESULT_DECL. */
3266 else if (TREE_CODE (*tp) == RETURN_EXPR)
3267 TREE_OPERAND (*tp, 0) = dp->result;
3268 /* Change all cleanups for the NRV to only run when an exception is
3270 else if (TREE_CODE (*tp) == CLEANUP_STMT
3271 && CLEANUP_DECL (*tp) == dp->var)
3272 CLEANUP_EH_ONLY (*tp) = 1;
3273 /* Replace the DECL_EXPR for the NRV with an initialization of the
3274 RESULT_DECL, if needed. */
3275 else if (TREE_CODE (*tp) == DECL_EXPR
3276 && DECL_EXPR_DECL (*tp) == dp->var)
3279 if (DECL_INITIAL (dp->var)
3280 && DECL_INITIAL (dp->var) != error_mark_node)
3282 init = build2 (INIT_EXPR, void_type_node, dp->result,
3283 DECL_INITIAL (dp->var));
3284 DECL_INITIAL (dp->var) = error_mark_node;
3287 init = build_empty_stmt ();
3288 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3291 /* And replace all uses of the NRV with the RESULT_DECL. */
3292 else if (*tp == dp->var)
3295 /* Avoid walking into the same tree more than once. Unfortunately, we
3296 can't just use walk_tree_without duplicates because it would only call
3297 us for the first occurrence of dp->var in the function body. */
3298 slot = htab_find_slot (dp->visited, *tp, INSERT);
3304 /* Keep iterating. */
3308 /* Called from finish_function to implement the named return value
3309 optimization by overriding all the RETURN_EXPRs and pertinent
3310 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3311 RESULT_DECL for the function. */
3314 finalize_nrv (tree *tp, tree var, tree result)
3316 struct nrv_data data;
3318 /* Copy debugging information from VAR to RESULT. */
3319 DECL_NAME (result) = DECL_NAME (var);
3320 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3321 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3322 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3323 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3324 /* Don't forget that we take its address. */
3325 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3328 data.result = result;
3329 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3330 cp_walk_tree (tp, finalize_nrv_r, &data, 0);
3331 htab_delete (data.visited);
3334 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3335 Remove any elements from the list that are invalid. */
3338 finish_omp_clauses (tree clauses)
3340 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3341 tree c, t, *pc = &clauses;
3344 bitmap_obstack_initialize (NULL);
3345 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3346 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3347 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3349 for (pc = &clauses, c = clauses; c ; c = *pc)
3351 bool remove = false;
3353 switch (OMP_CLAUSE_CODE (c))
3355 case OMP_CLAUSE_SHARED:
3357 goto check_dup_generic;
3358 case OMP_CLAUSE_PRIVATE:
3360 goto check_dup_generic;
3361 case OMP_CLAUSE_REDUCTION:
3363 goto check_dup_generic;
3364 case OMP_CLAUSE_COPYPRIVATE:
3365 name = "copyprivate";
3366 goto check_dup_generic;
3367 case OMP_CLAUSE_COPYIN:
3369 goto check_dup_generic;
3371 t = OMP_CLAUSE_DECL (c);
3372 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3374 if (processing_template_decl)
3377 error ("%qD is not a variable in clause %qs", t, name);
3379 error ("%qE is not a variable in clause %qs", t, name);
3382 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3383 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3384 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3386 error ("%qD appears more than once in data clauses", t);
3390 bitmap_set_bit (&generic_head, DECL_UID (t));
3393 case OMP_CLAUSE_FIRSTPRIVATE:
3394 t = OMP_CLAUSE_DECL (c);
3395 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3397 if (processing_template_decl)
3399 error ("%qE is not a variable in clause %<firstprivate%>", t);
3402 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3403 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3405 error ("%qE appears more than once in data clauses", t);
3409 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3412 case OMP_CLAUSE_LASTPRIVATE:
3413 t = OMP_CLAUSE_DECL (c);
3414 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3416 if (processing_template_decl)
3418 error ("%qE is not a variable in clause %<lastprivate%>", t);
3421 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3422 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3424 error ("%qE appears more than once in data clauses", t);
3428 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3432 t = OMP_CLAUSE_IF_EXPR (c);
3433 t = maybe_convert_cond (t);
3434 if (t == error_mark_node)
3436 OMP_CLAUSE_IF_EXPR (c) = t;
3439 case OMP_CLAUSE_NUM_THREADS:
3440 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3441 if (t == error_mark_node)
3443 else if (!type_dependent_expression_p (t)
3444 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3446 error ("num_threads expression must be integral");
3451 case OMP_CLAUSE_SCHEDULE:
3452 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3455 else if (t == error_mark_node)
3457 else if (!type_dependent_expression_p (t)
3458 && !INTEGRAL_TYPE_P (TREE_TYPE (t)))
3460 error ("schedule chunk size expression must be integral");
3465 case OMP_CLAUSE_NOWAIT:
3466 case OMP_CLAUSE_ORDERED:
3467 case OMP_CLAUSE_DEFAULT:
3475 *pc = OMP_CLAUSE_CHAIN (c);
3477 pc = &OMP_CLAUSE_CHAIN (c);
3480 for (pc = &clauses, c = clauses; c ; c = *pc)
3482 enum tree_code c_kind = OMP_CLAUSE_CODE (c);
3483 bool remove = false;
3484 bool need_complete_non_reference = false;
3485 bool need_default_ctor = false;
3486 bool need_copy_ctor = false;
3487 bool need_copy_assignment = false;
3488 bool need_implicitly_determined = false;
3489 tree type, inner_type;
3493 case OMP_CLAUSE_SHARED:
3495 need_implicitly_determined = true;
3497 case OMP_CLAUSE_PRIVATE:
3499 need_complete_non_reference = true;
3500 need_default_ctor = true;
3501 need_implicitly_determined = true;
3503 case OMP_CLAUSE_FIRSTPRIVATE:
3504 name = "firstprivate";
3505 need_complete_non_reference = true;
3506 need_copy_ctor = true;
3507 need_implicitly_determined = true;
3509 case OMP_CLAUSE_LASTPRIVATE:
3510 name = "lastprivate";
3511 need_complete_non_reference = true;
3512 need_copy_assignment = true;
3513 need_implicitly_determined = true;
3515 case OMP_CLAUSE_REDUCTION:
3517 need_implicitly_determined = true;
3519 case OMP_CLAUSE_COPYPRIVATE:
3520 name = "copyprivate";
3521 need_copy_assignment = true;
3523 case OMP_CLAUSE_COPYIN:
3525 need_copy_assignment = true;
3528 pc = &OMP_CLAUSE_CHAIN (c);
3532 t = OMP_CLAUSE_DECL (c);
3533 if (processing_template_decl
3534 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3536 pc = &OMP_CLAUSE_CHAIN (c);
3542 case OMP_CLAUSE_LASTPRIVATE:
3543 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3544 need_default_ctor = true;
3547 case OMP_CLAUSE_REDUCTION:
3548 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3549 || POINTER_TYPE_P (TREE_TYPE (t)))
3551 error ("%qE has invalid type for %<reduction%>", t);
3554 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3556 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3564 error ("%qE has invalid type for %<reduction(%s)%>",
3565 t, operator_name_info[r_code].name);
3571 case OMP_CLAUSE_COPYIN:
3572 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3574 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3583 if (need_complete_non_reference)
3585 t = require_complete_type (t);
3586 if (t == error_mark_node)
3588 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3590 error ("%qE has reference type for %qs", t, name);
3594 if (need_implicitly_determined)
3596 const char *share_name = NULL;
3598 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3599 share_name = "threadprivate";
3600 else switch (cxx_omp_predetermined_sharing (t))
3602 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3604 case OMP_CLAUSE_DEFAULT_SHARED:
3605 share_name = "shared";
3607 case OMP_CLAUSE_DEFAULT_PRIVATE:
3608 share_name = "private";
3615 error ("%qE is predetermined %qs for %qs",
3616 t, share_name, name);
3621 /* We're interested in the base element, not arrays. */
3622 inner_type = type = TREE_TYPE (t);
3623 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3624 inner_type = TREE_TYPE (inner_type);
3626 /* Check for special function availability by building a call to one.
3627 Save the results, because later we won't be in the right context
3628 for making these queries. */
3629 if (CLASS_TYPE_P (inner_type)
3630 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3631 && !type_dependent_expression_p (t))
3633 int save_errorcount = errorcount;
3636 /* Always allocate 3 elements for simplicity. These are the
3637 function decls for the ctor, dtor, and assignment op.
3638 This layout is known to the three lang hooks,
3639 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3640 and cxx_omp_clause_assign_op. */
3641 info = make_tree_vec (3);
3642 CP_OMP_CLAUSE_INFO (c) = info;
3644 if (need_default_ctor
3646 && !TYPE_HAS_TRIVIAL_INIT_REF (inner_type)))
3648 if (need_default_ctor)
3652 t = build_int_cst (build_pointer_type (inner_type), 0);
3653 t = build1 (INDIRECT_REF, inner_type, t);
3654 t = build_tree_list (NULL, t);
3656 t = build_special_member_call (NULL_TREE,
3657 complete_ctor_identifier,
3658 t, inner_type, LOOKUP_NORMAL);
3660 if (targetm.cxx.cdtor_returns_this ())
3661 /* Because constructors and destructors return this,
3662 the call will have been cast to "void". Remove the
3663 cast here. We would like to use STRIP_NOPS, but it
3664 wouldn't work here because TYPE_MODE (t) and
3665 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3666 They are VOIDmode and Pmode, respectively. */
3667 if (TREE_CODE (t) == NOP_EXPR)
3668 t = TREE_OPERAND (t, 0);
3670 t = get_callee_fndecl (t);
3671 TREE_VEC_ELT (info, 0) = t;
3674 if ((need_default_ctor || need_copy_ctor)
3675 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_type))
3677 t = build_int_cst (build_pointer_type (inner_type), 0);
3678 t = build1 (INDIRECT_REF, inner_type, t);
3679 t = build_special_member_call (t, complete_dtor_identifier,
3680 NULL, inner_type, LOOKUP_NORMAL);
3682 if (targetm.cxx.cdtor_returns_this ())
3683 /* Because constructors and destructors return this,
3684 the call will have been cast to "void". Remove the
3685 cast here. We would like to use STRIP_NOPS, but it
3686 wouldn't work here because TYPE_MODE (t) and
3687 TYPE_MODE (TREE_OPERAND (t, 0)) are different.
3688 They are VOIDmode and Pmode, respectively. */
3689 if (TREE_CODE (t) == NOP_EXPR)
3690 t = TREE_OPERAND (t, 0);
3692 t = get_callee_fndecl (t);
3693 TREE_VEC_ELT (info, 1) = t;
3696 if (need_copy_assignment
3697 && !TYPE_HAS_TRIVIAL_ASSIGN_REF (inner_type))
3699 t = build_int_cst (build_pointer_type (inner_type), 0);
3700 t = build1 (INDIRECT_REF, inner_type, t);
3701 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3702 build_tree_list (NULL, t),
3703 inner_type, LOOKUP_NORMAL);
3705 /* We'll have called convert_from_reference on the call, which
3706 may well have added an indirect_ref. It's unneeded here,
3707 and in the way, so kill it. */
3708 if (TREE_CODE (t) == INDIRECT_REF)
3709 t = TREE_OPERAND (t, 0);
3711 t = get_callee_fndecl (t);
3712 TREE_VEC_ELT (info, 2) = t;
3715 if (errorcount != save_errorcount)
3720 *pc = OMP_CLAUSE_CHAIN (c);
3722 pc = &OMP_CLAUSE_CHAIN (c);
3725 bitmap_obstack_release (NULL);
3729 /* For all variables in the tree_list VARS, mark them as thread local. */
3732 finish_omp_threadprivate (tree vars)
3736 /* Mark every variable in VARS to be assigned thread local storage. */
3737 for (t = vars; t; t = TREE_CHAIN (t))
3739 tree v = TREE_PURPOSE (t);
3741 /* If V had already been marked threadprivate, it doesn't matter
3742 whether it had been used prior to this point. */
3744 && (DECL_LANG_SPECIFIC (v) == NULL
3745 || !CP_DECL_THREADPRIVATE_P (v)))
3746 error ("%qE declared %<threadprivate%> after first use", v);
3747 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3748 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3749 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3750 error ("%<threadprivate%> %qE has incomplete type", v);
3751 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v)))
3752 error ("%<threadprivate%> %qE is not file, namespace "
3753 "or block scope variable", v);
3756 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3757 if (DECL_LANG_SPECIFIC (v) == NULL)
3759 retrofit_lang_decl (v);
3761 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3762 after the allocation of the lang_decl structure. */
3763 if (DECL_DISCRIMINATOR_P (v))
3764 DECL_LANG_SPECIFIC (v)->decl_flags.u2sel = 1;
3767 if (! DECL_THREAD_LOCAL_P (v))
3769 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3770 /* If rtl has been already set for this var, call
3771 make_decl_rtl once again, so that encode_section_info
3772 has a chance to look at the new decl flags. */
3773 if (DECL_RTL_SET_P (v))
3776 CP_DECL_THREADPRIVATE_P (v) = 1;
3781 /* Build an OpenMP structured block. */
3784 begin_omp_structured_block (void)
3786 return do_pushlevel (sk_omp);
3790 finish_omp_structured_block (tree block)
3792 return do_poplevel (block);
3795 /* Similarly, except force the retention of the BLOCK. */
3798 begin_omp_parallel (void)
3800 keep_next_level (true);
3801 return begin_omp_structured_block ();
3805 finish_omp_parallel (tree clauses, tree body)
3809 body = finish_omp_structured_block (body);
3811 stmt = make_node (OMP_PARALLEL);
3812 TREE_TYPE (stmt) = void_type_node;
3813 OMP_PARALLEL_CLAUSES (stmt) = clauses;
3814 OMP_PARALLEL_BODY (stmt) = body;
3816 return add_stmt (stmt);
3819 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
3820 are directly for their associated operands in the statement. DECL
3821 and INIT are a combo; if DECL is NULL then INIT ought to be a
3822 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
3823 optional statements that need to go before the loop into its
3827 finish_omp_for (location_t locus, tree decl, tree init, tree cond,
3828 tree incr, tree body, tree pre_body)
3830 tree omp_for = NULL;
3835 switch (TREE_CODE (init))
3838 decl = TREE_OPERAND (init, 0);
3839 init = TREE_OPERAND (init, 1);
3842 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
3844 decl = TREE_OPERAND (init, 0);
3845 init = TREE_OPERAND (init, 2);
3854 error ("expected iteration declaration or initialization");
3859 if (type_dependent_expression_p (decl)
3860 || type_dependent_expression_p (init)
3861 || (cond && type_dependent_expression_p (cond))
3862 || (incr && type_dependent_expression_p (incr)))
3868 error ("%Hmissing controlling predicate", &locus);
3874 error ("%Hmissing increment expression", &locus);
3878 stmt = make_node (OMP_FOR);
3880 /* This is really just a place-holder. We'll be decomposing this
3881 again and going through the build_modify_expr path below when
3882 we instantiate the thing. */
3883 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
3885 TREE_TYPE (stmt) = void_type_node;
3886 OMP_FOR_INIT (stmt) = init;
3887 OMP_FOR_COND (stmt) = cond;
3888 OMP_FOR_INCR (stmt) = incr;
3889 OMP_FOR_BODY (stmt) = body;
3890 OMP_FOR_PRE_BODY (stmt) = pre_body;
3892 SET_EXPR_LOCATION (stmt, locus);
3893 return add_stmt (stmt);
3898 error ("expected iteration declaration or initialization");
3902 if (pre_body == NULL || IS_EMPTY_STMT (pre_body))
3904 else if (! processing_template_decl)
3906 add_stmt (pre_body);
3910 if (!processing_template_decl)
3911 init = fold_build_cleanup_point_expr (TREE_TYPE (init), init);
3912 init = build_modify_expr (decl, NOP_EXPR, init);
3913 if (cond && TREE_SIDE_EFFECTS (cond) && COMPARISON_CLASS_P (cond))
3915 int n = TREE_SIDE_EFFECTS (TREE_OPERAND (cond, 1)) != 0;
3916 tree t = TREE_OPERAND (cond, n);
3918 if (!processing_template_decl)
3919 TREE_OPERAND (cond, n)
3920 = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
3922 if (decl != error_mark_node && init != error_mark_node)
3923 omp_for = c_finish_omp_for (locus, decl, init, cond, incr, body, pre_body);
3925 && TREE_CODE (OMP_FOR_INCR (omp_for)) == MODIFY_EXPR
3926 && TREE_SIDE_EFFECTS (TREE_OPERAND (OMP_FOR_INCR (omp_for), 1))
3927 && BINARY_CLASS_P (TREE_OPERAND (OMP_FOR_INCR (omp_for), 1)))
3929 tree t = TREE_OPERAND (OMP_FOR_INCR (omp_for), 1);
3930 int n = TREE_SIDE_EFFECTS (TREE_OPERAND (t, 1)) != 0;
3932 if (!processing_template_decl)
3934 = fold_build_cleanup_point_expr (TREE_TYPE (TREE_OPERAND (t, n)),
3935 TREE_OPERAND (t, n));
3941 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
3950 dependent_p = false;
3953 /* Even in a template, we can detect invalid uses of the atomic
3954 pragma if neither LHS nor RHS is type-dependent. */
3955 if (processing_template_decl)
3957 dependent_p = (type_dependent_expression_p (lhs)
3958 || type_dependent_expression_p (rhs));
3961 lhs = build_non_dependent_expr (lhs);
3962 rhs = build_non_dependent_expr (rhs);
3967 stmt = c_finish_omp_atomic (code, lhs, rhs);
3968 if (stmt == error_mark_node)
3971 if (processing_template_decl)
3972 stmt = build2 (OMP_ATOMIC, void_type_node, integer_zero_node,
3973 build2 (code, void_type_node, orig_lhs, orig_rhs));
3978 finish_omp_barrier (void)
3980 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
3981 tree stmt = finish_call_expr (fn, NULL, false, false);
3982 finish_expr_stmt (stmt);
3986 finish_omp_flush (void)
3988 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
3989 tree stmt = finish_call_expr (fn, NULL, false, false);
3990 finish_expr_stmt (stmt);
3993 /* True if OpenMP sharing attribute of DECL is predetermined. */
3995 enum omp_clause_default_kind
3996 cxx_omp_predetermined_sharing (tree decl)
3998 enum omp_clause_default_kind kind;
4000 kind = c_omp_predetermined_sharing (decl);
4001 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
4004 /* Static data members are predetermined as shared. */
4005 if (TREE_STATIC (decl))
4007 tree ctx = CP_DECL_CONTEXT (decl);
4008 if (TYPE_P (ctx) && IS_AGGR_TYPE (ctx))
4009 return OMP_CLAUSE_DEFAULT_SHARED;
4012 return OMP_CLAUSE_DEFAULT_UNSPECIFIED;
4016 init_cp_semantics (void)
4020 /* Build a STATIC_ASSERT for a static assertion with the condition
4021 CONDITION and the message text MESSAGE. LOCATION is the location
4022 of the static assertion in the source code. When MEMBER_P, this
4023 static assertion is a member of a class. */
4025 finish_static_assert (tree condition, tree message, location_t location,
4028 if (type_dependent_expression_p (condition)
4029 || value_dependent_expression_p (condition))
4031 /* We're in a template; build a STATIC_ASSERT and put it in
4035 assertion = make_node (STATIC_ASSERT);
4036 STATIC_ASSERT_CONDITION (assertion) = condition;
4037 STATIC_ASSERT_MESSAGE (assertion) = message;
4038 STATIC_ASSERT_SOURCE_LOCATION (assertion) = location;
4041 maybe_add_class_template_decl_list (current_class_type,
4045 add_stmt (assertion);
4050 /* Fold the expression and convert it to a boolean value. */
4051 condition = fold_non_dependent_expr (condition);
4052 condition = cp_convert (boolean_type_node, condition);
4054 if (TREE_CODE (condition) == INTEGER_CST && !integer_zerop (condition))
4055 /* Do nothing; the condition is satisfied. */
4059 location_t saved_loc = input_location;
4061 input_location = location;
4062 if (TREE_CODE (condition) == INTEGER_CST
4063 && integer_zerop (condition))
4064 /* Report the error. */
4065 error ("static assertion failed: %E", message);
4066 else if (condition && condition != error_mark_node)
4067 error ("non-constant condition for static assertion");
4068 input_location = saved_loc;
4072 /* Implements the C++0x decltype keyword. Returns the type of EXPR,
4073 suitable for use as a type-specifier.
4075 ID_EXPRESSION_OR_MEMBER_ACCESS_P is true when EXPR was parsed as an
4076 id-expression or a class member access, FALSE when it was parsed as
4077 a full expression. */
4079 finish_decltype_type (tree expr, bool id_expression_or_member_access_p)
4081 tree orig_expr = expr;
4084 if (!expr || error_operand_p (expr))
4085 return error_mark_node;
4088 || TREE_CODE (expr) == TYPE_DECL
4089 || (TREE_CODE (expr) == BIT_NOT_EXPR
4090 && TYPE_P (TREE_OPERAND (expr, 0))))
4092 error ("argument to decltype must be an expression");
4093 return error_mark_node;
4096 if (type_dependent_expression_p (expr))
4098 type = make_aggr_type (DECLTYPE_TYPE);
4099 DECLTYPE_TYPE_EXPR (type) = expr;
4100 DECLTYPE_TYPE_ID_EXPR_OR_MEMBER_ACCESS_P (type)
4101 = id_expression_or_member_access_p;
4102 SET_TYPE_STRUCTURAL_EQUALITY (type);
4107 /* The type denoted by decltype(e) is defined as follows: */
4109 if (id_expression_or_member_access_p)
4111 /* If e is an id-expression or a class member access (5.2.5
4112 [expr.ref]), decltype(e) is defined as the type of the entity
4113 named by e. If there is no such entity, or e names a set of
4114 overloaded functions, the program is ill-formed. */
4115 if (TREE_CODE (expr) == IDENTIFIER_NODE)
4116 expr = lookup_name (expr);
4118 if (TREE_CODE (expr) == INDIRECT_REF)
4119 /* This can happen when the expression is, e.g., "a.b". Just
4120 look at the underlying operand. */
4121 expr = TREE_OPERAND (expr, 0);
4123 if (TREE_CODE (expr) == OFFSET_REF
4124 || TREE_CODE (expr) == MEMBER_REF)
4125 /* We're only interested in the field itself. If it is a
4126 BASELINK, we will need to see through it in the next
4128 expr = TREE_OPERAND (expr, 1);
4130 if (TREE_CODE (expr) == BASELINK)
4131 /* See through BASELINK nodes to the underlying functions. */
4132 expr = BASELINK_FUNCTIONS (expr);
4134 if (TREE_CODE (expr) == OVERLOAD)
4136 if (OVL_CHAIN (expr))
4138 error ("%qE refers to a set of overloaded functions", orig_expr);
4139 return error_mark_node;
4142 /* An overload set containing only one function: just look
4143 at that function. */
4144 expr = OVL_FUNCTION (expr);
4147 switch (TREE_CODE (expr))
4150 if (DECL_C_BIT_FIELD (expr))
4152 type = DECL_BIT_FIELD_TYPE (expr);
4155 /* Fall through for fields that aren't bitfields. */
4162 type = TREE_TYPE (expr);
4166 type = error_mark_node;
4170 type = is_bitfield_expr_with_lowered_type (expr);
4172 type = TREE_TYPE (TREE_OPERAND (expr, 1));
4179 /* We can get here when the id-expression refers to an
4181 type = TREE_TYPE (expr);
4185 gcc_assert (TYPE_P (expr) || DECL_P (expr)
4186 || TREE_CODE (expr) == SCOPE_REF);
4187 error ("argument to decltype must be an expression");
4188 return error_mark_node;
4195 /* Expressions of reference type are sometimes wrapped in
4196 INDIRECT_REFs. INDIRECT_REFs are just internal compiler
4197 representation, not part of the language, so we have to look
4199 if (TREE_CODE (expr) == INDIRECT_REF
4200 && TREE_CODE (TREE_TYPE (TREE_OPERAND (expr, 0)))
4202 expr = TREE_OPERAND (expr, 0);
4204 if (TREE_CODE (expr) == CALL_EXPR
4205 && (fndecl = get_callee_fndecl (expr))
4206 && (fndecl != error_mark_node))
4207 /* If e is a function call (5.2.2 [expr.call]) or an
4208 invocation of an overloaded operator (parentheses around e
4209 are ignored), decltype(e) is defined as the return type of
4211 type = TREE_TYPE (TREE_TYPE (fndecl));
4214 type = is_bitfield_expr_with_lowered_type (expr);
4217 /* Bitfields are special, because their type encodes the
4218 number of bits they store. If the expression referenced a
4219 bitfield, TYPE now has the declared type of that
4221 type = cp_build_qualified_type (type,
4222 cp_type_quals (TREE_TYPE (expr)));
4224 if (real_lvalue_p (expr))
4225 type = build_reference_type (type);
4229 /* Otherwise, where T is the type of e, if e is an lvalue,
4230 decltype(e) is defined as T&, otherwise decltype(e) is
4232 type = TREE_TYPE (expr);
4233 if (type == error_mark_node)
4234 return error_mark_node;
4235 else if (expr == current_class_ptr)
4236 /* If the expression is just "this", we want the
4237 cv-unqualified pointer for the "this" type. */
4238 type = TYPE_MAIN_VARIANT (type);
4239 else if (real_lvalue_p (expr))
4241 if (TREE_CODE (type) != REFERENCE_TYPE)
4242 type = build_reference_type (type);
4245 type = non_reference (type);
4250 if (!type || type == unknown_type_node)
4252 error ("type of %qE is unknown", expr);
4253 return error_mark_node;
4259 /* Called from trait_expr_value to evaluate either __has_nothrow_assign or
4260 __has_nothrow_copy, depending on assign_p. */
4263 classtype_has_nothrow_assign_or_copy_p (tree type, bool assign_p)
4270 ix = lookup_fnfields_1 (type, ansi_assopname (NOP_EXPR));
4273 fns = VEC_index (tree, CLASSTYPE_METHOD_VEC (type), ix);
4275 else if (TYPE_HAS_INIT_REF (type))
4277 /* If construction of the copy constructor was postponed, create
4279 if (CLASSTYPE_LAZY_COPY_CTOR (type))
4280 lazily_declare_fn (sfk_copy_constructor, type);
4281 fns = CLASSTYPE_CONSTRUCTORS (type);
4286 for (; fns; fns = OVL_NEXT (fns))
4287 if (!TREE_NOTHROW (OVL_CURRENT (fns)))
4293 /* Actually evaluates the trait. */
4296 trait_expr_value (cp_trait_kind kind, tree type1, tree type2)
4298 enum tree_code type_code1;
4301 type_code1 = TREE_CODE (type1);
4305 case CPTK_HAS_NOTHROW_ASSIGN:
4306 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4307 && (trait_expr_value (CPTK_HAS_TRIVIAL_ASSIGN, type1, type2)
4308 || (CLASS_TYPE_P (type1)
4309 && classtype_has_nothrow_assign_or_copy_p (type1,
4312 case CPTK_HAS_TRIVIAL_ASSIGN:
4313 return (!CP_TYPE_CONST_P (type1) && type_code1 != REFERENCE_TYPE
4314 && (pod_type_p (type1)
4315 || (CLASS_TYPE_P (type1)
4316 && TYPE_HAS_TRIVIAL_ASSIGN_REF (type1))));
4318 case CPTK_HAS_NOTHROW_CONSTRUCTOR:
4319 type1 = strip_array_types (type1);
4320 return (trait_expr_value (CPTK_HAS_TRIVIAL_CONSTRUCTOR, type1, type2)
4321 || (CLASS_TYPE_P (type1)
4322 && (t = locate_ctor (type1, NULL)) && TREE_NOTHROW (t)));
4324 case CPTK_HAS_TRIVIAL_CONSTRUCTOR:
4325 type1 = strip_array_types (type1);
4326 return (pod_type_p (type1)
4327 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_DFLT (type1)));
4329 case CPTK_HAS_NOTHROW_COPY:
4330 return (trait_expr_value (CPTK_HAS_TRIVIAL_COPY, type1, type2)
4331 || (CLASS_TYPE_P (type1)
4332 && classtype_has_nothrow_assign_or_copy_p (type1, false)));
4334 case CPTK_HAS_TRIVIAL_COPY:
4335 return (pod_type_p (type1) || type_code1 == REFERENCE_TYPE
4336 || (CLASS_TYPE_P (type1) && TYPE_HAS_TRIVIAL_INIT_REF (type1)));
4338 case CPTK_HAS_TRIVIAL_DESTRUCTOR:
4339 type1 = strip_array_types (type1);
4340 return (pod_type_p (type1)
4341 || (CLASS_TYPE_P (type1)
4342 && TYPE_HAS_TRIVIAL_DESTRUCTOR (type1)));
4344 case CPTK_HAS_VIRTUAL_DESTRUCTOR:
4345 return (CLASS_TYPE_P (type1)
4346 && (t = locate_dtor (type1, NULL)) && DECL_VIRTUAL_P (t));
4348 case CPTK_IS_ABSTRACT:
4349 return (CLASS_TYPE_P (type1) && CLASSTYPE_PURE_VIRTUALS (type1));
4351 case CPTK_IS_BASE_OF:
4352 return (NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
4353 && DERIVED_FROM_P (type1, type2));
4356 return (NON_UNION_CLASS_TYPE_P (type1));
4358 case CPTK_IS_CONVERTIBLE_TO:
4363 return (NON_UNION_CLASS_TYPE_P (type1) && CLASSTYPE_EMPTY_P (type1));
4366 return (type_code1 == ENUMERAL_TYPE);
4369 return (pod_type_p (type1));
4371 case CPTK_IS_POLYMORPHIC:
4372 return (CLASS_TYPE_P (type1) && TYPE_POLYMORPHIC_P (type1));
4375 return (type_code1 == UNION_TYPE);
4383 /* Process a trait expression. */
4386 finish_trait_expr (cp_trait_kind kind, tree type1, tree type2)
4388 gcc_assert (kind == CPTK_HAS_NOTHROW_ASSIGN
4389 || kind == CPTK_HAS_NOTHROW_CONSTRUCTOR
4390 || kind == CPTK_HAS_NOTHROW_COPY
4391 || kind == CPTK_HAS_TRIVIAL_ASSIGN
4392 || kind == CPTK_HAS_TRIVIAL_CONSTRUCTOR
4393 || kind == CPTK_HAS_TRIVIAL_COPY
4394 || kind == CPTK_HAS_TRIVIAL_DESTRUCTOR
4395 || kind == CPTK_HAS_VIRTUAL_DESTRUCTOR
4396 || kind == CPTK_IS_ABSTRACT
4397 || kind == CPTK_IS_BASE_OF
4398 || kind == CPTK_IS_CLASS
4399 || kind == CPTK_IS_CONVERTIBLE_TO
4400 || kind == CPTK_IS_EMPTY
4401 || kind == CPTK_IS_ENUM
4402 || kind == CPTK_IS_POD
4403 || kind == CPTK_IS_POLYMORPHIC
4404 || kind == CPTK_IS_UNION);
4406 if (kind == CPTK_IS_CONVERTIBLE_TO)
4408 sorry ("__is_convertible_to");
4409 return error_mark_node;
4412 if (type1 == error_mark_node
4413 || ((kind == CPTK_IS_BASE_OF || kind == CPTK_IS_CONVERTIBLE_TO)
4414 && type2 == error_mark_node))
4415 return error_mark_node;
4417 if (processing_template_decl)
4419 tree trait_expr = make_node (TRAIT_EXPR);
4420 TREE_TYPE (trait_expr) = boolean_type_node;
4421 TRAIT_EXPR_TYPE1 (trait_expr) = type1;
4422 TRAIT_EXPR_TYPE2 (trait_expr) = type2;
4423 TRAIT_EXPR_KIND (trait_expr) = kind;
4427 complete_type (type1);
4429 complete_type (type2);
4431 /* The only required diagnostic. */
4432 if (kind == CPTK_IS_BASE_OF
4433 && NON_UNION_CLASS_TYPE_P (type1) && NON_UNION_CLASS_TYPE_P (type2)
4434 && !same_type_ignoring_top_level_qualifiers_p (type1, type2)
4435 && !COMPLETE_TYPE_P (type2))
4437 error ("incomplete type %qT not allowed", type2);
4438 return error_mark_node;
4441 return (trait_expr_value (kind, type1, type2)
4442 ? boolean_true_node : boolean_false_node);
4445 #include "gt-cp-semantics.h"