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
7 Free Software Foundation, Inc.
8 Written by Mark Mitchell (mmitchell@usa.net) based on code found
9 formerly in parse.y and pt.c.
11 This file is part of GCC.
13 GCC is free software; you can redistribute it and/or modify it
14 under the terms of the GNU General Public License as published by
15 the Free Software Foundation; either version 2, or (at your option)
18 GCC is distributed in the hope that it will be useful, but
19 WITHOUT ANY WARRANTY; without even the implied warranty of
20 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
21 General Public License for more details.
23 You should have received a copy of the GNU General Public License
24 along with GCC; see the file COPYING. If not, write to the Free
25 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
30 #include "coretypes.h"
35 #include "tree-inline.h"
36 #include "tree-mudflap.h"
45 #include "diagnostic.h"
47 #include "tree-iterator.h"
51 /* There routines provide a modular interface to perform many parsing
52 operations. They may therefore be used during actual parsing, or
53 during template instantiation, which may be regarded as a
54 degenerate form of parsing. */
56 static tree maybe_convert_cond (tree);
57 static tree simplify_aggr_init_exprs_r (tree *, int *, void *);
58 static void emit_associated_thunks (tree);
59 static tree finalize_nrv_r (tree *, int *, void *);
62 /* Deferred Access Checking Overview
63 ---------------------------------
65 Most C++ expressions and declarations require access checking
66 to be performed during parsing. However, in several cases,
67 this has to be treated differently.
69 For member declarations, access checking has to be deferred
70 until more information about the declaration is known. For
82 When we are parsing the function return type `A::X', we don't
83 really know if this is allowed until we parse the function name.
85 Furthermore, some contexts require that access checking is
86 never performed at all. These include class heads, and template
89 Typical use of access checking functions is described here:
91 1. When we enter a context that requires certain access checking
92 mode, the function `push_deferring_access_checks' is called with
93 DEFERRING argument specifying the desired mode. Access checking
94 may be performed immediately (dk_no_deferred), deferred
95 (dk_deferred), or not performed (dk_no_check).
97 2. When a declaration such as a type, or a variable, is encountered,
98 the function `perform_or_defer_access_check' is called. It
99 maintains a VEC of all deferred checks.
101 3. The global `current_class_type' or `current_function_decl' is then
102 setup by the parser. `enforce_access' relies on these information
105 4. Upon exiting the context mentioned in step 1,
106 `perform_deferred_access_checks' is called to check all declaration
107 stored in the VEC. `pop_deferring_access_checks' is then
108 called to restore the previous access checking mode.
110 In case of parsing error, we simply call `pop_deferring_access_checks'
111 without `perform_deferred_access_checks'. */
113 typedef struct deferred_access GTY(())
115 /* A VEC representing name-lookups for which we have deferred
116 checking access controls. We cannot check the accessibility of
117 names used in a decl-specifier-seq until we know what is being
118 declared because code like:
125 A::B* A::f() { return 0; }
127 is valid, even though `A::B' is not generally accessible. */
128 VEC (deferred_access_check,gc)* GTY(()) deferred_access_checks;
130 /* The current mode of access checks. */
131 enum deferring_kind deferring_access_checks_kind;
134 DEF_VEC_O (deferred_access);
135 DEF_VEC_ALLOC_O (deferred_access,gc);
137 /* Data for deferred access checking. */
138 static GTY(()) VEC(deferred_access,gc) *deferred_access_stack;
139 static GTY(()) unsigned deferred_access_no_check;
141 /* Save the current deferred access states and start deferred
142 access checking iff DEFER_P is true. */
145 push_deferring_access_checks (deferring_kind deferring)
147 /* For context like template instantiation, access checking
148 disabling applies to all nested context. */
149 if (deferred_access_no_check || deferring == dk_no_check)
150 deferred_access_no_check++;
153 deferred_access *ptr;
155 ptr = VEC_safe_push (deferred_access, gc, deferred_access_stack, NULL);
156 ptr->deferred_access_checks = NULL;
157 ptr->deferring_access_checks_kind = deferring;
161 /* Resume deferring access checks again after we stopped doing
165 resume_deferring_access_checks (void)
167 if (!deferred_access_no_check)
168 VEC_last (deferred_access, deferred_access_stack)
169 ->deferring_access_checks_kind = dk_deferred;
172 /* Stop deferring access checks. */
175 stop_deferring_access_checks (void)
177 if (!deferred_access_no_check)
178 VEC_last (deferred_access, deferred_access_stack)
179 ->deferring_access_checks_kind = dk_no_deferred;
182 /* Discard the current deferred access checks and restore the
186 pop_deferring_access_checks (void)
188 if (deferred_access_no_check)
189 deferred_access_no_check--;
191 VEC_pop (deferred_access, deferred_access_stack);
194 /* Returns a TREE_LIST representing the deferred checks.
195 The TREE_PURPOSE of each node is the type through which the
196 access occurred; the TREE_VALUE is the declaration named.
199 VEC (deferred_access_check,gc)*
200 get_deferred_access_checks (void)
202 if (deferred_access_no_check)
205 return (VEC_last (deferred_access, deferred_access_stack)
206 ->deferred_access_checks);
209 /* Take current deferred checks and combine with the
210 previous states if we also defer checks previously.
211 Otherwise perform checks now. */
214 pop_to_parent_deferring_access_checks (void)
216 if (deferred_access_no_check)
217 deferred_access_no_check--;
220 VEC (deferred_access_check,gc) *checks;
221 deferred_access *ptr;
223 checks = (VEC_last (deferred_access, deferred_access_stack)
224 ->deferred_access_checks);
226 VEC_pop (deferred_access, deferred_access_stack);
227 ptr = VEC_last (deferred_access, deferred_access_stack);
228 if (ptr->deferring_access_checks_kind == dk_no_deferred)
231 perform_access_checks (checks);
235 /* Merge with parent. */
237 deferred_access_check *chk, *probe;
240 VEC_iterate (deferred_access_check, checks, i, chk) ;
244 VEC_iterate (deferred_access_check,
245 ptr->deferred_access_checks, j, probe) ;
248 if (probe->binfo == chk->binfo &&
249 probe->decl == chk->decl &&
250 probe->diag_decl == chk->diag_decl)
253 /* Insert into parent's checks. */
254 VEC_safe_push (deferred_access_check, gc,
255 ptr->deferred_access_checks, chk);
262 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
263 is the BINFO indicating the qualifying scope used to access the
264 DECL node stored in the TREE_VALUE of the node. */
267 perform_access_checks (VEC (deferred_access_check,gc)* checks)
270 deferred_access_check *chk;
275 for (i = 0 ; VEC_iterate (deferred_access_check, checks, i, chk) ; ++i)
276 enforce_access (chk->binfo, chk->decl, chk->diag_decl);
279 /* Perform the deferred access checks.
281 After performing the checks, we still have to keep the list
282 `deferred_access_stack->deferred_access_checks' since we may want
283 to check access for them again later in a different context.
290 A::X A::a, x; // No error for `A::a', error for `x'
292 We have to perform deferred access of `A::X', first with `A::a',
296 perform_deferred_access_checks (void)
298 perform_access_checks (get_deferred_access_checks ());
301 /* Defer checking the accessibility of DECL, when looked up in
302 BINFO. DIAG_DECL is the declaration to use to print diagnostics. */
305 perform_or_defer_access_check (tree binfo, tree decl, tree diag_decl)
308 deferred_access *ptr;
309 deferred_access_check *chk;
310 deferred_access_check *new_access;
313 /* Exit if we are in a context that no access checking is performed.
315 if (deferred_access_no_check)
318 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
320 ptr = VEC_last (deferred_access, deferred_access_stack);
322 /* If we are not supposed to defer access checks, just check now. */
323 if (ptr->deferring_access_checks_kind == dk_no_deferred)
325 enforce_access (binfo, decl, diag_decl);
329 /* See if we are already going to perform this check. */
331 VEC_iterate (deferred_access_check,
332 ptr->deferred_access_checks, i, chk) ;
335 if (chk->decl == decl && chk->binfo == binfo &&
336 chk->diag_decl == diag_decl)
341 /* If not, record the check. */
343 VEC_safe_push (deferred_access_check, gc,
344 ptr->deferred_access_checks, 0);
345 new_access->binfo = binfo;
346 new_access->decl = decl;
347 new_access->diag_decl = diag_decl;
350 /* Returns nonzero if the current statement is a full expression,
351 i.e. temporaries created during that statement should be destroyed
352 at the end of the statement. */
355 stmts_are_full_exprs_p (void)
357 return current_stmt_tree ()->stmts_are_full_exprs_p;
360 /* T is a statement. Add it to the statement-tree. This is the C++
361 version. The C/ObjC frontends have a slightly different version of
367 enum tree_code code = TREE_CODE (t);
369 if (EXPR_P (t) && code != LABEL_EXPR)
371 if (!EXPR_HAS_LOCATION (t))
372 SET_EXPR_LOCATION (t, input_location);
374 /* When we expand a statement-tree, we must know whether or not the
375 statements are full-expressions. We record that fact here. */
376 STMT_IS_FULL_EXPR_P (t) = stmts_are_full_exprs_p ();
379 /* Add T to the statement-tree. Non-side-effect statements need to be
380 recorded during statement expressions. */
381 append_to_statement_list_force (t, &cur_stmt_list);
386 /* Returns the stmt_tree (if any) to which statements are currently
387 being added. If there is no active statement-tree, NULL is
391 current_stmt_tree (void)
394 ? &cfun->language->base.x_stmt_tree
395 : &scope_chain->x_stmt_tree);
398 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
401 maybe_cleanup_point_expr (tree expr)
403 if (!processing_template_decl && stmts_are_full_exprs_p ())
404 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
408 /* Like maybe_cleanup_point_expr except have the type of the new expression be
409 void so we don't need to create a temporary variable to hold the inner
410 expression. The reason why we do this is because the original type might be
411 an aggregate and we cannot create a temporary variable for that type. */
414 maybe_cleanup_point_expr_void (tree expr)
416 if (!processing_template_decl && stmts_are_full_exprs_p ())
417 expr = fold_build_cleanup_point_expr (void_type_node, expr);
423 /* Create a declaration statement for the declaration given by the DECL. */
426 add_decl_expr (tree decl)
428 tree r = build_stmt (DECL_EXPR, decl);
429 if (DECL_INITIAL (decl)
430 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
431 r = maybe_cleanup_point_expr_void (r);
435 /* Nonzero if TYPE is an anonymous union or struct type. We have to use a
436 flag for this because "A union for which objects or pointers are
437 declared is not an anonymous union" [class.union]. */
440 anon_aggr_type_p (tree node)
442 return ANON_AGGR_TYPE_P (node);
445 /* Finish a scope. */
448 do_poplevel (tree stmt_list)
452 if (stmts_are_full_exprs_p ())
453 block = poplevel (kept_level_p (), 1, 0);
455 stmt_list = pop_stmt_list (stmt_list);
457 if (!processing_template_decl)
459 stmt_list = c_build_bind_expr (block, stmt_list);
460 /* ??? See c_end_compound_stmt re statement expressions. */
466 /* Begin a new scope. */
469 do_pushlevel (scope_kind sk)
471 tree ret = push_stmt_list ();
472 if (stmts_are_full_exprs_p ())
473 begin_scope (sk, NULL);
477 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
478 when the current scope is exited. EH_ONLY is true when this is not
479 meant to apply to normal control flow transfer. */
482 push_cleanup (tree decl, tree cleanup, bool eh_only)
484 tree stmt = build_stmt (CLEANUP_STMT, NULL, cleanup, decl);
485 CLEANUP_EH_ONLY (stmt) = eh_only;
487 CLEANUP_BODY (stmt) = push_stmt_list ();
490 /* Begin a conditional that might contain a declaration. When generating
491 normal code, we want the declaration to appear before the statement
492 containing the conditional. When generating template code, we want the
493 conditional to be rendered as the raw DECL_EXPR. */
496 begin_cond (tree *cond_p)
498 if (processing_template_decl)
499 *cond_p = push_stmt_list ();
502 /* Finish such a conditional. */
505 finish_cond (tree *cond_p, tree expr)
507 if (processing_template_decl)
509 tree cond = pop_stmt_list (*cond_p);
510 if (TREE_CODE (cond) == DECL_EXPR)
516 /* If *COND_P specifies a conditional with a declaration, transform the
519 for (; A x = 42;) { }
521 while (true) { A x = 42; if (!x) break; }
522 for (;;) { A x = 42; if (!x) break; }
523 The statement list for BODY will be empty if the conditional did
524 not declare anything. */
527 simplify_loop_decl_cond (tree *cond_p, tree body)
531 if (!TREE_SIDE_EFFECTS (body))
535 *cond_p = boolean_true_node;
537 if_stmt = begin_if_stmt ();
538 cond = build_unary_op (TRUTH_NOT_EXPR, cond, 0);
539 finish_if_stmt_cond (cond, if_stmt);
540 finish_break_stmt ();
541 finish_then_clause (if_stmt);
542 finish_if_stmt (if_stmt);
545 /* Finish a goto-statement. */
548 finish_goto_stmt (tree destination)
550 if (TREE_CODE (destination) == IDENTIFIER_NODE)
551 destination = lookup_label (destination);
553 /* We warn about unused labels with -Wunused. That means we have to
554 mark the used labels as used. */
555 if (TREE_CODE (destination) == LABEL_DECL)
556 TREE_USED (destination) = 1;
559 /* The DESTINATION is being used as an rvalue. */
560 if (!processing_template_decl)
561 destination = decay_conversion (destination);
562 /* We don't inline calls to functions with computed gotos.
563 Those functions are typically up to some funny business,
564 and may be depending on the labels being at particular
565 addresses, or some such. */
566 DECL_UNINLINABLE (current_function_decl) = 1;
569 check_goto (destination);
571 return add_stmt (build_stmt (GOTO_EXPR, destination));
574 /* COND is the condition-expression for an if, while, etc.,
575 statement. Convert it to a boolean value, if appropriate. */
578 maybe_convert_cond (tree cond)
580 /* Empty conditions remain empty. */
584 /* Wait until we instantiate templates before doing conversion. */
585 if (processing_template_decl)
588 /* Do the conversion. */
589 cond = convert_from_reference (cond);
591 if (TREE_CODE (cond) == MODIFY_EXPR
592 && !TREE_NO_WARNING (cond)
595 warning (OPT_Wparentheses,
596 "suggest parentheses around assignment used as truth value");
597 TREE_NO_WARNING (cond) = 1;
600 return condition_conversion (cond);
603 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
606 finish_expr_stmt (tree expr)
610 if (expr != NULL_TREE)
612 if (!processing_template_decl)
614 if (warn_sequence_point)
615 verify_sequence_points (expr);
616 expr = convert_to_void (expr, "statement");
618 else if (!type_dependent_expression_p (expr))
619 convert_to_void (build_non_dependent_expr (expr), "statement");
621 /* Simplification of inner statement expressions, compound exprs,
622 etc can result in us already having an EXPR_STMT. */
623 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
625 if (TREE_CODE (expr) != EXPR_STMT)
626 expr = build_stmt (EXPR_STMT, expr);
627 expr = maybe_cleanup_point_expr_void (expr);
639 /* Begin an if-statement. Returns a newly created IF_STMT if
646 scope = do_pushlevel (sk_block);
647 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
648 TREE_CHAIN (r) = scope;
649 begin_cond (&IF_COND (r));
653 /* Process the COND of an if-statement, which may be given by
657 finish_if_stmt_cond (tree cond, tree if_stmt)
659 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
661 THEN_CLAUSE (if_stmt) = push_stmt_list ();
664 /* Finish the then-clause of an if-statement, which may be given by
668 finish_then_clause (tree if_stmt)
670 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
674 /* Begin the else-clause of an if-statement. */
677 begin_else_clause (tree if_stmt)
679 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
682 /* Finish the else-clause of an if-statement, which may be given by
686 finish_else_clause (tree if_stmt)
688 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
691 /* Finish an if-statement. */
694 finish_if_stmt (tree if_stmt)
696 tree scope = TREE_CHAIN (if_stmt);
697 TREE_CHAIN (if_stmt) = NULL;
698 add_stmt (do_poplevel (scope));
700 empty_body_warning (THEN_CLAUSE (if_stmt), ELSE_CLAUSE (if_stmt));
703 /* Begin a while-statement. Returns a newly created WHILE_STMT if
707 /* APPLE LOCAL begin for-fsf-4_4 3274130 5295549 */ \
708 begin_while_stmt (tree attribs)
709 /* APPLE LOCAL end for-fsf-4_4 3274130 5295549 */ \
712 /* APPLE LOCAL begin for-fsf-4_4 3274130 5295549 */ \
713 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE, attribs);
714 /* APPLE LOCAL end for-fsf-4_4 3274130 5295549 */ \
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
744 /* APPLE LOCAL begin for-fsf-4_4 3274130 5295549 */ \
745 begin_do_stmt (tree attribs)
746 /* APPLE LOCAL end for-fsf-4_4 3274130 5295549 */ \
748 /* APPLE LOCAL radar 4445586 */
749 /* APPLE LOCAL begin for-fsf-4_4 3274130 5295549 */ \
750 tree r = build_stmt (DO_STMT, NULL_TREE, NULL_TREE, attribs, NULL_TREE);
751 /* APPLE LOCAL end for-fsf-4_4 3274130 5295549 */ \
753 DO_BODY (r) = push_stmt_list ();
757 /* Finish the body of a do-statement, which may be given by DO_STMT. */
760 finish_do_body (tree do_stmt)
762 DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
765 /* Finish a do-statement, which may be given by DO_STMT, and whose
766 COND is as indicated. */
769 finish_do_stmt (tree cond, tree do_stmt)
771 cond = maybe_convert_cond (cond);
772 DO_COND (do_stmt) = cond;
776 /* Finish a return-statement. The EXPRESSION returned, if any, is as
780 finish_return_stmt (tree expr)
785 expr = check_return_expr (expr, &no_warning);
787 if (flag_openmp && !check_omp_return ())
788 return error_mark_node;
789 if (!processing_template_decl)
791 if (DECL_DESTRUCTOR_P (current_function_decl)
792 || (DECL_CONSTRUCTOR_P (current_function_decl)
793 && targetm.cxx.cdtor_returns_this ()))
795 /* Similarly, all destructors must run destructors for
796 base-classes before returning. So, all returns in a
797 destructor get sent to the DTOR_LABEL; finish_function emits
798 code to return a value there. */
799 return finish_goto_stmt (cdtor_label);
803 r = build_stmt (RETURN_EXPR, expr);
804 TREE_NO_WARNING (r) |= no_warning;
805 r = maybe_cleanup_point_expr_void (r);
812 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
815 /* APPLE LOCAL begin for-fsf-4_4 3274130 5295549 */ \
816 begin_for_stmt (tree attribs)
817 /* APPLE LOCAL end for-fsf-4_4 3274130 5295549 */ \
821 r = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE,
822 /* APPLE LOCAL begin for-fsf-4_4 3274130 5295549 */ \
823 NULL_TREE, NULL_TREE, attribs);
825 /* APPLE LOCAL end for-fsf-4_4 3274130 5295549 */ \
827 if (flag_new_for_scope > 0)
828 TREE_CHAIN (r) = do_pushlevel (sk_for);
830 if (processing_template_decl)
831 FOR_INIT_STMT (r) = push_stmt_list ();
836 /* Finish the for-init-statement of a for-statement, which may be
837 given by FOR_STMT. */
840 finish_for_init_stmt (tree for_stmt)
842 if (processing_template_decl)
843 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
845 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
846 begin_cond (&FOR_COND (for_stmt));
849 /* Finish the COND of a for-statement, which may be given by
853 finish_for_cond (tree cond, tree for_stmt)
855 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
856 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
859 /* Finish the increment-EXPRESSION in a for-statement, which may be
860 given by FOR_STMT. */
863 finish_for_expr (tree expr, tree for_stmt)
867 /* If EXPR is an overloaded function, issue an error; there is no
868 context available to use to perform overload resolution. */
869 if (type_unknown_p (expr))
871 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
872 expr = error_mark_node;
874 if (!processing_template_decl)
876 if (warn_sequence_point)
877 verify_sequence_points (expr);
878 expr = convert_to_void (expr, "3rd expression in for");
880 else if (!type_dependent_expression_p (expr))
881 convert_to_void (build_non_dependent_expr (expr), "3rd expression in for");
882 expr = maybe_cleanup_point_expr_void (expr);
883 FOR_EXPR (for_stmt) = expr;
886 /* Finish the body of a for-statement, which may be given by
887 FOR_STMT. The increment-EXPR for the loop must be
891 finish_for_stmt (tree for_stmt)
893 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
895 /* Pop the scope for the body of the loop. */
896 if (flag_new_for_scope > 0)
898 tree scope = TREE_CHAIN (for_stmt);
899 TREE_CHAIN (for_stmt) = NULL;
900 add_stmt (do_poplevel (scope));
906 /* Finish a break-statement. */
909 finish_break_stmt (void)
911 return add_stmt (build_stmt (BREAK_STMT));
914 /* Finish a continue-statement. */
917 finish_continue_stmt (void)
919 return add_stmt (build_stmt (CONTINUE_STMT));
922 /* Begin a switch-statement. Returns a new SWITCH_STMT if
926 begin_switch_stmt (void)
930 r = build_stmt (SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
932 scope = do_pushlevel (sk_block);
933 TREE_CHAIN (r) = scope;
934 begin_cond (&SWITCH_STMT_COND (r));
939 /* Finish the cond of a switch-statement. */
942 finish_switch_cond (tree cond, tree switch_stmt)
944 tree orig_type = NULL;
945 if (!processing_template_decl)
949 /* Convert the condition to an integer or enumeration type. */
950 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
951 if (cond == NULL_TREE)
953 error ("switch quantity not an integer");
954 cond = error_mark_node;
956 orig_type = TREE_TYPE (cond);
957 if (cond != error_mark_node)
961 Integral promotions are performed. */
962 cond = perform_integral_promotions (cond);
963 cond = maybe_cleanup_point_expr (cond);
966 if (cond != error_mark_node)
968 index = get_unwidened (cond, NULL_TREE);
969 /* We can't strip a conversion from a signed type to an unsigned,
970 because if we did, int_fits_type_p would do the wrong thing
971 when checking case values for being in range,
972 and it's too hard to do the right thing. */
973 if (TYPE_UNSIGNED (TREE_TYPE (cond))
974 == TYPE_UNSIGNED (TREE_TYPE (index)))
978 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
979 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
980 add_stmt (switch_stmt);
981 push_switch (switch_stmt);
982 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
985 /* Finish the body of a switch-statement, which may be given by
986 SWITCH_STMT. The COND to switch on is indicated. */
989 finish_switch_stmt (tree switch_stmt)
993 SWITCH_STMT_BODY (switch_stmt) =
994 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
998 scope = TREE_CHAIN (switch_stmt);
999 TREE_CHAIN (switch_stmt) = NULL;
1000 add_stmt (do_poplevel (scope));
1003 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
1007 begin_try_block (void)
1009 tree r = build_stmt (TRY_BLOCK, NULL_TREE, NULL_TREE);
1011 TRY_STMTS (r) = push_stmt_list ();
1015 /* Likewise, for a function-try-block. The block returned in
1016 *COMPOUND_STMT is an artificial outer scope, containing the
1017 function-try-block. */
1020 begin_function_try_block (tree *compound_stmt)
1023 /* This outer scope does not exist in the C++ standard, but we need
1024 a place to put __FUNCTION__ and similar variables. */
1025 *compound_stmt = begin_compound_stmt (0);
1026 r = begin_try_block ();
1027 FN_TRY_BLOCK_P (r) = 1;
1031 /* Finish a try-block, which may be given by TRY_BLOCK. */
1034 finish_try_block (tree try_block)
1036 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1037 TRY_HANDLERS (try_block) = push_stmt_list ();
1040 /* Finish the body of a cleanup try-block, which may be given by
1044 finish_cleanup_try_block (tree try_block)
1046 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1049 /* Finish an implicitly generated try-block, with a cleanup is given
1053 finish_cleanup (tree cleanup, tree try_block)
1055 TRY_HANDLERS (try_block) = cleanup;
1056 CLEANUP_P (try_block) = 1;
1059 /* Likewise, for a function-try-block. */
1062 finish_function_try_block (tree try_block)
1064 finish_try_block (try_block);
1065 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1066 the try block, but moving it inside. */
1067 in_function_try_handler = 1;
1070 /* Finish a handler-sequence for a try-block, which may be given by
1074 finish_handler_sequence (tree try_block)
1076 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1077 check_handlers (TRY_HANDLERS (try_block));
1080 /* Finish the handler-seq for a function-try-block, given by
1081 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1082 begin_function_try_block. */
1085 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1087 in_function_try_handler = 0;
1088 finish_handler_sequence (try_block);
1089 finish_compound_stmt (compound_stmt);
1092 /* Begin a handler. Returns a HANDLER if appropriate. */
1095 begin_handler (void)
1099 r = build_stmt (HANDLER, NULL_TREE, NULL_TREE);
1102 /* Create a binding level for the eh_info and the exception object
1104 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1109 /* Finish the handler-parameters for a handler, which may be given by
1110 HANDLER. DECL is the declaration for the catch parameter, or NULL
1111 if this is a `catch (...)' clause. */
1114 finish_handler_parms (tree decl, tree handler)
1116 tree type = NULL_TREE;
1117 if (processing_template_decl)
1121 decl = pushdecl (decl);
1122 decl = push_template_decl (decl);
1123 HANDLER_PARMS (handler) = decl;
1124 type = TREE_TYPE (decl);
1128 type = expand_start_catch_block (decl);
1129 HANDLER_TYPE (handler) = type;
1130 if (!processing_template_decl && type)
1131 mark_used (eh_type_info (type));
1134 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1135 the return value from the matching call to finish_handler_parms. */
1138 finish_handler (tree handler)
1140 if (!processing_template_decl)
1141 expand_end_catch_block ();
1142 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1145 /* Begin a compound statement. FLAGS contains some bits that control the
1146 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1147 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1148 block of a function. If BCS_TRY_BLOCK is set, this is the block
1149 created on behalf of a TRY statement. Returns a token to be passed to
1150 finish_compound_stmt. */
1153 begin_compound_stmt (unsigned int flags)
1157 if (flags & BCS_NO_SCOPE)
1159 r = push_stmt_list ();
1160 STATEMENT_LIST_NO_SCOPE (r) = 1;
1162 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1163 But, if it's a statement-expression with a scopeless block, there's
1164 nothing to keep, and we don't want to accidentally keep a block
1165 *inside* the scopeless block. */
1166 keep_next_level (false);
1169 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1171 /* When processing a template, we need to remember where the braces were,
1172 so that we can set up identical scopes when instantiating the template
1173 later. BIND_EXPR is a handy candidate for this.
1174 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1175 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1176 processing templates. */
1177 if (processing_template_decl)
1179 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1180 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1181 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1182 TREE_SIDE_EFFECTS (r) = 1;
1188 /* Finish a compound-statement, which is given by STMT. */
1191 finish_compound_stmt (tree stmt)
1193 if (TREE_CODE (stmt) == BIND_EXPR)
1194 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1195 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1196 stmt = pop_stmt_list (stmt);
1199 /* Destroy any ObjC "super" receivers that may have been
1201 objc_clear_super_receiver ();
1203 stmt = do_poplevel (stmt);
1206 /* ??? See c_end_compound_stmt wrt statement expressions. */
1211 /* Finish an asm-statement, whose components are a STRING, some
1212 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1213 whether the asm-statement should be considered volatile. */
1216 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1217 tree input_operands, tree clobbers)
1221 int ninputs = list_length (input_operands);
1222 int noutputs = list_length (output_operands);
1224 if (!processing_template_decl)
1226 const char *constraint;
1227 const char **oconstraints;
1228 bool allows_mem, allows_reg, is_inout;
1232 oconstraints = (const char **) alloca (noutputs * sizeof (char *));
1234 string = resolve_asm_operand_names (string, output_operands,
1237 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1239 operand = TREE_VALUE (t);
1241 /* ??? Really, this should not be here. Users should be using a
1242 proper lvalue, dammit. But there's a long history of using
1243 casts in the output operands. In cases like longlong.h, this
1244 becomes a primitive form of typechecking -- if the cast can be
1245 removed, then the output operand had a type of the proper width;
1246 otherwise we'll get an error. Gross, but ... */
1247 STRIP_NOPS (operand);
1249 if (!lvalue_or_else (operand, lv_asm))
1250 operand = error_mark_node;
1252 if (operand != error_mark_node
1253 && (TREE_READONLY (operand)
1254 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1255 /* Functions are not modifiable, even though they are
1257 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1258 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1259 /* If it's an aggregate and any field is const, then it is
1260 effectively const. */
1261 || (CLASS_TYPE_P (TREE_TYPE (operand))
1262 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1263 readonly_error (operand, "assignment (via 'asm' output)", 0);
1265 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1266 oconstraints[i] = constraint;
1268 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1269 &allows_mem, &allows_reg, &is_inout))
1271 /* If the operand is going to end up in memory,
1272 mark it addressable. */
1273 if (!allows_reg && !cxx_mark_addressable (operand))
1274 operand = error_mark_node;
1277 operand = error_mark_node;
1279 TREE_VALUE (t) = operand;
1282 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1284 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1285 operand = decay_conversion (TREE_VALUE (t));
1287 /* If the type of the operand hasn't been determined (e.g.,
1288 because it involves an overloaded function), then issue
1289 an error message. There's no context available to
1290 resolve the overloading. */
1291 if (TREE_TYPE (operand) == unknown_type_node)
1293 error ("type of asm operand %qE could not be determined",
1295 operand = error_mark_node;
1298 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1299 oconstraints, &allows_mem, &allows_reg))
1301 /* If the operand is going to end up in memory,
1302 mark it addressable. */
1303 if (!allows_reg && allows_mem)
1305 /* Strip the nops as we allow this case. FIXME, this really
1306 should be rejected or made deprecated. */
1307 STRIP_NOPS (operand);
1308 if (!cxx_mark_addressable (operand))
1309 operand = error_mark_node;
1313 operand = error_mark_node;
1315 TREE_VALUE (t) = operand;
1319 r = build_stmt (ASM_EXPR, string,
1320 output_operands, input_operands,
1322 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1323 r = maybe_cleanup_point_expr_void (r);
1324 return add_stmt (r);
1327 /* Finish a label with the indicated NAME. */
1330 finish_label_stmt (tree name)
1332 tree decl = define_label (input_location, name);
1334 if (decl == error_mark_node)
1335 return error_mark_node;
1337 return add_stmt (build_stmt (LABEL_EXPR, decl));
1340 /* Finish a series of declarations for local labels. G++ allows users
1341 to declare "local" labels, i.e., labels with scope. This extension
1342 is useful when writing code involving statement-expressions. */
1345 finish_label_decl (tree name)
1347 if (!at_function_scope_p ())
1349 error ("__label__ declarations are only allowed in function scopes");
1353 add_decl_expr (declare_local_label (name));
1356 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1359 finish_decl_cleanup (tree decl, tree cleanup)
1361 push_cleanup (decl, cleanup, false);
1364 /* If the current scope exits with an exception, run CLEANUP. */
1367 finish_eh_cleanup (tree cleanup)
1369 push_cleanup (NULL, cleanup, true);
1372 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1373 order they were written by the user. Each node is as for
1374 emit_mem_initializers. */
1377 finish_mem_initializers (tree mem_inits)
1379 /* Reorder the MEM_INITS so that they are in the order they appeared
1380 in the source program. */
1381 mem_inits = nreverse (mem_inits);
1383 if (processing_template_decl)
1384 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1386 emit_mem_initializers (mem_inits);
1389 /* Finish a parenthesized expression EXPR. */
1392 finish_parenthesized_expr (tree expr)
1395 /* This inhibits warnings in c_common_truthvalue_conversion. */
1396 TREE_NO_WARNING (expr) = 1;
1398 if (TREE_CODE (expr) == OFFSET_REF)
1399 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1400 enclosed in parentheses. */
1401 PTRMEM_OK_P (expr) = 0;
1403 if (TREE_CODE (expr) == STRING_CST)
1404 PAREN_STRING_LITERAL_P (expr) = 1;
1409 /* Finish a reference to a non-static data member (DECL) that is not
1410 preceded by `.' or `->'. */
1413 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1415 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1419 if (current_function_decl
1420 && DECL_STATIC_FUNCTION_P (current_function_decl))
1421 error ("invalid use of member %q+D in static member function", decl);
1423 error ("invalid use of non-static data member %q+D", decl);
1424 error ("from this location");
1426 return error_mark_node;
1428 TREE_USED (current_class_ptr) = 1;
1429 if (processing_template_decl && !qualifying_scope)
1431 tree type = TREE_TYPE (decl);
1433 if (TREE_CODE (type) == REFERENCE_TYPE)
1434 type = TREE_TYPE (type);
1437 /* Set the cv qualifiers. */
1438 int quals = cp_type_quals (TREE_TYPE (current_class_ref));
1440 if (DECL_MUTABLE_P (decl))
1441 quals &= ~TYPE_QUAL_CONST;
1443 quals |= cp_type_quals (TREE_TYPE (decl));
1444 type = cp_build_qualified_type (type, quals);
1447 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1451 tree access_type = TREE_TYPE (object);
1452 tree lookup_context = context_for_name_lookup (decl);
1454 while (!DERIVED_FROM_P (lookup_context, access_type))
1456 access_type = TYPE_CONTEXT (access_type);
1457 while (access_type && DECL_P (access_type))
1458 access_type = DECL_CONTEXT (access_type);
1462 error ("object missing in reference to %q+D", decl);
1463 error ("from this location");
1464 return error_mark_node;
1468 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1469 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1471 if (processing_template_decl)
1472 return build_qualified_name (TREE_TYPE (decl),
1475 /*template_p=*/false);
1477 perform_or_defer_access_check (TYPE_BINFO (access_type), decl,
1480 /* If the data member was named `C::M', convert `*this' to `C'
1482 if (qualifying_scope)
1484 tree binfo = NULL_TREE;
1485 object = build_scoped_ref (object, qualifying_scope,
1489 return build_class_member_access_expr (object, decl,
1490 /*access_path=*/NULL_TREE,
1491 /*preserve_reference=*/false);
1495 /* DECL was the declaration to which a qualified-id resolved. Issue
1496 an error message if it is not accessible. If OBJECT_TYPE is
1497 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1498 type of `*x', or `x', respectively. If the DECL was named as
1499 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1502 check_accessibility_of_qualified_id (tree decl,
1504 tree nested_name_specifier)
1507 tree qualifying_type = NULL_TREE;
1509 /* If we're not checking, return immediately. */
1510 if (deferred_access_no_check)
1513 /* Determine the SCOPE of DECL. */
1514 scope = context_for_name_lookup (decl);
1515 /* If the SCOPE is not a type, then DECL is not a member. */
1516 if (!TYPE_P (scope))
1518 /* Compute the scope through which DECL is being accessed. */
1520 /* OBJECT_TYPE might not be a class type; consider:
1522 class A { typedef int I; };
1526 In this case, we will have "A::I" as the DECL, but "I" as the
1528 && CLASS_TYPE_P (object_type)
1529 && DERIVED_FROM_P (scope, object_type))
1530 /* If we are processing a `->' or `.' expression, use the type of the
1532 qualifying_type = object_type;
1533 else if (nested_name_specifier)
1535 /* If the reference is to a non-static member of the
1536 current class, treat it as if it were referenced through
1538 if (DECL_NONSTATIC_MEMBER_P (decl)
1539 && current_class_ptr
1540 && DERIVED_FROM_P (scope, current_class_type))
1541 qualifying_type = current_class_type;
1542 /* Otherwise, use the type indicated by the
1543 nested-name-specifier. */
1545 qualifying_type = nested_name_specifier;
1548 /* Otherwise, the name must be from the current class or one of
1550 qualifying_type = currently_open_derived_class (scope);
1553 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1554 or similar in a default argument value. */
1555 && CLASS_TYPE_P (qualifying_type)
1556 && !dependent_type_p (qualifying_type))
1557 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl,
1561 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1562 class named to the left of the "::" operator. DONE is true if this
1563 expression is a complete postfix-expression; it is false if this
1564 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1565 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1566 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1567 is true iff this qualified name appears as a template argument. */
1570 finish_qualified_id_expr (tree qualifying_class,
1575 bool template_arg_p)
1577 gcc_assert (TYPE_P (qualifying_class));
1579 if (error_operand_p (expr))
1580 return error_mark_node;
1582 if (DECL_P (expr) || BASELINK_P (expr))
1586 check_template_keyword (expr);
1588 /* If EXPR occurs as the operand of '&', use special handling that
1589 permits a pointer-to-member. */
1590 if (address_p && done)
1592 if (TREE_CODE (expr) == SCOPE_REF)
1593 expr = TREE_OPERAND (expr, 1);
1594 expr = build_offset_ref (qualifying_class, expr,
1595 /*address_p=*/true);
1599 /* Within the scope of a class, turn references to non-static
1600 members into expression of the form "this->...". */
1602 /* But, within a template argument, we do not want make the
1603 transformation, as there is no "this" pointer. */
1605 else if (TREE_CODE (expr) == FIELD_DECL)
1606 expr = finish_non_static_data_member (expr, current_class_ref,
1608 else if (BASELINK_P (expr) && !processing_template_decl)
1612 /* See if any of the functions are non-static members. */
1613 fns = BASELINK_FUNCTIONS (expr);
1614 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1615 fns = TREE_OPERAND (fns, 0);
1616 /* If so, the expression may be relative to the current
1618 if (!shared_member_p (fns)
1619 && current_class_type
1620 && DERIVED_FROM_P (qualifying_class, current_class_type))
1621 expr = (build_class_member_access_expr
1622 (maybe_dummy_object (qualifying_class, NULL),
1624 BASELINK_ACCESS_BINFO (expr),
1625 /*preserve_reference=*/false));
1627 /* The expression is a qualified name whose address is not
1629 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1635 /* Begin a statement-expression. The value returned must be passed to
1636 finish_stmt_expr. */
1639 begin_stmt_expr (void)
1641 return push_stmt_list ();
1644 /* Process the final expression of a statement expression. EXPR can be
1645 NULL, if the final expression is empty. Return a STATEMENT_LIST
1646 containing all the statements in the statement-expression, or
1647 ERROR_MARK_NODE if there was an error. */
1650 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1652 if (error_operand_p (expr))
1653 return error_mark_node;
1655 /* If the last statement does not have "void" type, then the value
1656 of the last statement is the value of the entire expression. */
1659 tree type = TREE_TYPE (expr);
1661 if (processing_template_decl)
1663 expr = build_stmt (EXPR_STMT, expr);
1664 expr = add_stmt (expr);
1665 /* Mark the last statement so that we can recognize it as such at
1666 template-instantiation time. */
1667 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1669 else if (VOID_TYPE_P (type))
1671 /* Just treat this like an ordinary statement. */
1672 expr = finish_expr_stmt (expr);
1676 /* It actually has a value we need to deal with. First, force it
1677 to be an rvalue so that we won't need to build up a copy
1678 constructor call later when we try to assign it to something. */
1679 expr = force_rvalue (expr);
1680 if (error_operand_p (expr))
1681 return error_mark_node;
1683 /* Update for array-to-pointer decay. */
1684 type = TREE_TYPE (expr);
1686 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1687 normal statement, but don't convert to void or actually add
1689 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1690 expr = maybe_cleanup_point_expr (expr);
1694 /* The type of the statement-expression is the type of the last
1696 TREE_TYPE (stmt_expr) = type;
1702 /* Finish a statement-expression. EXPR should be the value returned
1703 by the previous begin_stmt_expr. Returns an expression
1704 representing the statement-expression. */
1707 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1712 if (error_operand_p (stmt_expr))
1713 return error_mark_node;
1715 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1717 type = TREE_TYPE (stmt_expr);
1718 result = pop_stmt_list (stmt_expr);
1719 TREE_TYPE (result) = type;
1721 if (processing_template_decl)
1723 result = build_min (STMT_EXPR, type, result);
1724 TREE_SIDE_EFFECTS (result) = 1;
1725 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1727 else if (CLASS_TYPE_P (type))
1729 /* Wrap the statement-expression in a TARGET_EXPR so that the
1730 temporary object created by the final expression is destroyed at
1731 the end of the full-expression containing the
1732 statement-expression. */
1733 result = force_target_expr (type, result);
1739 /* Perform Koenig lookup. FN is the postfix-expression representing
1740 the function (or functions) to call; ARGS are the arguments to the
1741 call. Returns the functions to be considered by overload
1745 perform_koenig_lookup (tree fn, tree args)
1747 tree identifier = NULL_TREE;
1748 tree functions = NULL_TREE;
1750 /* Find the name of the overloaded function. */
1751 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1753 else if (is_overloaded_fn (fn))
1756 identifier = DECL_NAME (get_first_fn (functions));
1758 else if (DECL_P (fn))
1761 identifier = DECL_NAME (fn);
1764 /* A call to a namespace-scope function using an unqualified name.
1766 Do Koenig lookup -- unless any of the arguments are
1768 if (!any_type_dependent_arguments_p (args))
1770 fn = lookup_arg_dependent (identifier, functions, args);
1772 /* The unqualified name could not be resolved. */
1773 fn = unqualified_fn_lookup_error (identifier);
1779 /* Generate an expression for `FN (ARGS)'.
1781 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1782 as a virtual call, even if FN is virtual. (This flag is set when
1783 encountering an expression where the function name is explicitly
1784 qualified. For example a call to `X::f' never generates a virtual
1787 Returns code for the call. */
1790 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p)
1796 if (fn == error_mark_node || args == error_mark_node)
1797 return error_mark_node;
1799 /* ARGS should be a list of arguments. */
1800 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1801 gcc_assert (!TYPE_P (fn));
1806 if (processing_template_decl)
1808 if (type_dependent_expression_p (fn)
1809 || any_type_dependent_arguments_p (args))
1811 result = build_nt (CALL_EXPR, fn, args, NULL_TREE);
1812 KOENIG_LOOKUP_P (result) = koenig_p;
1815 if (!BASELINK_P (fn)
1816 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1817 && TREE_TYPE (fn) != unknown_type_node)
1818 fn = build_non_dependent_expr (fn);
1819 args = build_non_dependent_args (orig_args);
1822 if (is_overloaded_fn (fn))
1823 fn = baselink_for_fns (fn);
1826 if (BASELINK_P (fn))
1830 /* A call to a member function. From [over.call.func]:
1832 If the keyword this is in scope and refers to the class of
1833 that member function, or a derived class thereof, then the
1834 function call is transformed into a qualified function call
1835 using (*this) as the postfix-expression to the left of the
1836 . operator.... [Otherwise] a contrived object of type T
1837 becomes the implied object argument.
1839 This paragraph is unclear about this situation:
1841 struct A { void f(); };
1842 struct B : public A {};
1843 struct C : public A { void g() { B::f(); }};
1845 In particular, for `B::f', this paragraph does not make clear
1846 whether "the class of that member function" refers to `A' or
1847 to `B'. We believe it refers to `B'. */
1848 if (current_class_type
1849 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1851 && current_class_ref)
1852 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1856 tree representative_fn;
1858 representative_fn = BASELINK_FUNCTIONS (fn);
1859 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1860 representative_fn = TREE_OPERAND (representative_fn, 0);
1861 representative_fn = get_first_fn (representative_fn);
1862 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1865 if (processing_template_decl)
1867 if (type_dependent_expression_p (object))
1868 return build_nt (CALL_EXPR, orig_fn, orig_args, NULL_TREE);
1869 object = build_non_dependent_expr (object);
1872 result = build_new_method_call (object, fn, args, NULL_TREE,
1874 ? LOOKUP_NONVIRTUAL : 0),
1877 else if (is_overloaded_fn (fn))
1879 /* If the function is an overloaded builtin, resolve it. */
1880 if (TREE_CODE (fn) == FUNCTION_DECL
1881 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
1882 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
1883 result = resolve_overloaded_builtin (fn, args);
1886 /* A call to a namespace-scope function. */
1887 result = build_new_function_call (fn, args, koenig_p);
1889 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1892 error ("arguments to destructor are not allowed");
1893 /* Mark the pseudo-destructor call as having side-effects so
1894 that we do not issue warnings about its use. */
1895 result = build1 (NOP_EXPR,
1897 TREE_OPERAND (fn, 0));
1898 TREE_SIDE_EFFECTS (result) = 1;
1900 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1901 /* If the "function" is really an object of class type, it might
1902 have an overloaded `operator ()'. */
1903 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1904 /*overloaded_p=*/NULL);
1907 /* A call where the function is unknown. */
1908 result = build_function_call (fn, args);
1910 if (processing_template_decl)
1912 result = build3 (CALL_EXPR, TREE_TYPE (result), orig_fn,
1913 orig_args, NULL_TREE);
1914 KOENIG_LOOKUP_P (result) = koenig_p;
1919 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1920 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1921 POSTDECREMENT_EXPR.) */
1924 finish_increment_expr (tree expr, enum tree_code code)
1926 return build_x_unary_op (code, expr);
1929 /* Finish a use of `this'. Returns an expression for `this'. */
1932 finish_this_expr (void)
1936 if (current_class_ptr)
1938 result = current_class_ptr;
1940 else if (current_function_decl
1941 && DECL_STATIC_FUNCTION_P (current_function_decl))
1943 error ("%<this%> is unavailable for static member functions");
1944 result = error_mark_node;
1948 if (current_function_decl)
1949 error ("invalid use of %<this%> in non-member function");
1951 error ("invalid use of %<this%> at top level");
1952 result = error_mark_node;
1958 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
1959 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
1960 the TYPE for the type given. If SCOPE is non-NULL, the expression
1961 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
1964 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
1966 if (destructor == error_mark_node)
1967 return error_mark_node;
1969 gcc_assert (TYPE_P (destructor));
1971 if (!processing_template_decl)
1973 if (scope == error_mark_node)
1975 error ("invalid qualifying scope in pseudo-destructor name");
1976 return error_mark_node;
1978 if (scope && TYPE_P (scope) && !check_dtor_name (scope, destructor))
1980 error ("qualified type %qT does not match destructor name ~%qT",
1982 return error_mark_node;
1986 /* [expr.pseudo] says both:
1988 The type designated by the pseudo-destructor-name shall be
1989 the same as the object type.
1993 The cv-unqualified versions of the object type and of the
1994 type designated by the pseudo-destructor-name shall be the
1997 We implement the more generous second sentence, since that is
1998 what most other compilers do. */
1999 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
2002 error ("%qE is not of type %qT", object, destructor);
2003 return error_mark_node;
2007 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
2010 /* Finish an expression of the form CODE EXPR. */
2013 finish_unary_op_expr (enum tree_code code, tree expr)
2015 tree result = build_x_unary_op (code, expr);
2016 /* Inside a template, build_x_unary_op does not fold the
2017 expression. So check whether the result is folded before
2018 setting TREE_NEGATED_INT. */
2019 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2020 && TREE_CODE (result) == INTEGER_CST
2021 && !TYPE_UNSIGNED (TREE_TYPE (result))
2022 && INT_CST_LT (result, integer_zero_node))
2024 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2025 setting TREE_NEGATED_INT. */
2026 result = copy_node (result);
2027 TREE_NEGATED_INT (result) = 1;
2029 if (TREE_OVERFLOW_P (result) && !TREE_OVERFLOW_P (expr))
2030 overflow_warning (result);
2035 /* Finish a compound-literal expression. TYPE is the type to which
2036 the INITIALIZER_LIST is being cast. */
2039 finish_compound_literal (tree type, VEC(constructor_elt,gc) *initializer_list)
2042 tree compound_literal;
2044 if (!TYPE_OBJ_P (type))
2046 error ("compound literal of non-object type %qT", type);
2047 return error_mark_node;
2050 /* Build a CONSTRUCTOR for the INITIALIZER_LIST. */
2051 compound_literal = build_constructor (NULL_TREE, initializer_list);
2052 if (processing_template_decl)
2054 TREE_TYPE (compound_literal) = type;
2055 /* Mark the expression as a compound literal. */
2056 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2057 return compound_literal;
2060 /* Create a temporary variable to represent the compound literal. */
2061 var = create_temporary_var (type);
2062 if (!current_function_decl)
2064 /* If this compound-literal appears outside of a function, then
2065 the corresponding variable has static storage duration, just
2066 like the variable in whose initializer it appears. */
2067 TREE_STATIC (var) = 1;
2068 /* The variable has internal linkage, since there is no need to
2069 reference it from another translation unit. */
2070 TREE_PUBLIC (var) = 0;
2071 /* It must have a name, so that the name mangler can mangle it. */
2072 DECL_NAME (var) = make_anon_name ();
2074 /* We must call pushdecl, since the gimplifier complains if the
2075 variable has not been declared via a BIND_EXPR. */
2077 /* Initialize the variable as we would any other variable with a
2078 brace-enclosed initializer. */
2079 cp_finish_decl (var, compound_literal,
2080 /*init_const_expr_p=*/false,
2081 /*asmspec_tree=*/NULL_TREE,
2082 LOOKUP_ONLYCONVERTING);
2086 /* Return the declaration for the function-name variable indicated by
2090 finish_fname (tree id)
2094 decl = fname_decl (C_RID_CODE (id), id);
2095 if (processing_template_decl)
2096 decl = DECL_NAME (decl);
2100 /* Finish a translation unit. */
2103 finish_translation_unit (void)
2105 /* In case there were missing closebraces,
2106 get us back to the global binding level. */
2108 while (current_namespace != global_namespace)
2111 /* Do file scope __FUNCTION__ et al. */
2112 finish_fname_decls ();
2115 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2116 Returns the parameter. */
2119 finish_template_type_parm (tree aggr, tree identifier)
2121 if (aggr != class_type_node)
2123 pedwarn ("template type parameters must use the keyword %<class%> or %<typename%>");
2124 aggr = class_type_node;
2127 return build_tree_list (aggr, identifier);
2130 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2131 Returns the parameter. */
2134 finish_template_template_parm (tree aggr, tree identifier)
2136 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2137 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2138 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2139 DECL_TEMPLATE_RESULT (tmpl) = decl;
2140 DECL_ARTIFICIAL (decl) = 1;
2141 end_template_decl ();
2143 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2145 return finish_template_type_parm (aggr, tmpl);
2148 /* ARGUMENT is the default-argument value for a template template
2149 parameter. If ARGUMENT is invalid, issue error messages and return
2150 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2153 check_template_template_default_arg (tree argument)
2155 if (TREE_CODE (argument) != TEMPLATE_DECL
2156 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2157 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2159 if (TREE_CODE (argument) == TYPE_DECL)
2160 error ("invalid use of type %qT as a default value for a template "
2161 "template-parameter", TREE_TYPE (argument));
2163 error ("invalid default argument for a template template parameter");
2164 return error_mark_node;
2170 /* Begin a class definition, as indicated by T. */
2173 begin_class_definition (tree t, tree attributes)
2175 if (t == error_mark_node)
2176 return error_mark_node;
2178 if (processing_template_parmlist)
2180 error ("definition of %q#T inside template parameter list", t);
2181 return error_mark_node;
2183 /* A non-implicit typename comes from code like:
2185 template <typename T> struct A {
2186 template <typename U> struct A<T>::B ...
2188 This is erroneous. */
2189 else if (TREE_CODE (t) == TYPENAME_TYPE)
2191 error ("invalid definition of qualified type %qT", t);
2192 t = error_mark_node;
2195 if (t == error_mark_node || ! IS_AGGR_TYPE (t))
2197 t = make_aggr_type (RECORD_TYPE);
2198 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2201 /* Update the location of the decl. */
2202 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2204 if (TYPE_BEING_DEFINED (t))
2206 t = make_aggr_type (TREE_CODE (t));
2207 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2209 maybe_process_partial_specialization (t);
2211 TYPE_BEING_DEFINED (t) = 1;
2213 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2215 if (flag_pack_struct)
2218 TYPE_PACKED (t) = 1;
2219 /* Even though the type is being defined for the first time
2220 here, there might have been a forward declaration, so there
2221 might be cv-qualified variants of T. */
2222 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2223 TYPE_PACKED (v) = 1;
2225 /* Reset the interface data, at the earliest possible
2226 moment, as it might have been set via a class foo;
2228 if (! TYPE_ANONYMOUS_P (t))
2230 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2231 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2232 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2233 (t, finfo->interface_unknown);
2235 reset_specialization();
2237 /* Make a declaration for this class in its own scope. */
2238 build_self_reference ();
2243 /* Finish the member declaration given by DECL. */
2246 finish_member_declaration (tree decl)
2248 if (decl == error_mark_node || decl == NULL_TREE)
2251 if (decl == void_type_node)
2252 /* The COMPONENT was a friend, not a member, and so there's
2253 nothing for us to do. */
2256 /* We should see only one DECL at a time. */
2257 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2259 /* Set up access control for DECL. */
2261 = (current_access_specifier == access_private_node);
2262 TREE_PROTECTED (decl)
2263 = (current_access_specifier == access_protected_node);
2264 if (TREE_CODE (decl) == TEMPLATE_DECL)
2266 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2267 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2270 /* Mark the DECL as a member of the current class. */
2271 DECL_CONTEXT (decl) = current_class_type;
2275 A C language linkage is ignored for the names of class members
2276 and the member function type of class member functions. */
2277 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2278 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2280 /* Put functions on the TYPE_METHODS list and everything else on the
2281 TYPE_FIELDS list. Note that these are built up in reverse order.
2282 We reverse them (to obtain declaration order) in finish_struct. */
2283 if (TREE_CODE (decl) == FUNCTION_DECL
2284 || DECL_FUNCTION_TEMPLATE_P (decl))
2286 /* We also need to add this function to the
2287 CLASSTYPE_METHOD_VEC. */
2288 if (add_method (current_class_type, decl, NULL_TREE))
2290 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2291 TYPE_METHODS (current_class_type) = decl;
2293 maybe_add_class_template_decl_list (current_class_type, decl,
2297 /* Enter the DECL into the scope of the class. */
2298 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2299 || pushdecl_class_level (decl))
2301 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2302 go at the beginning. The reason is that lookup_field_1
2303 searches the list in order, and we want a field name to
2304 override a type name so that the "struct stat hack" will
2305 work. In particular:
2307 struct S { enum E { }; int E } s;
2310 is valid. In addition, the FIELD_DECLs must be maintained in
2311 declaration order so that class layout works as expected.
2312 However, we don't need that order until class layout, so we
2313 save a little time by putting FIELD_DECLs on in reverse order
2314 here, and then reversing them in finish_struct_1. (We could
2315 also keep a pointer to the correct insertion points in the
2318 if (TREE_CODE (decl) == TYPE_DECL)
2319 TYPE_FIELDS (current_class_type)
2320 = chainon (TYPE_FIELDS (current_class_type), decl);
2323 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2324 TYPE_FIELDS (current_class_type) = decl;
2327 maybe_add_class_template_decl_list (current_class_type, decl,
2332 note_decl_for_pch (decl);
2335 /* DECL has been declared while we are building a PCH file. Perform
2336 actions that we might normally undertake lazily, but which can be
2337 performed now so that they do not have to be performed in
2338 translation units which include the PCH file. */
2341 note_decl_for_pch (tree decl)
2343 gcc_assert (pch_file);
2345 /* There's a good chance that we'll have to mangle names at some
2346 point, even if only for emission in debugging information. */
2347 if ((TREE_CODE (decl) == VAR_DECL
2348 || TREE_CODE (decl) == FUNCTION_DECL)
2349 && !processing_template_decl)
2353 /* Finish processing a complete template declaration. The PARMS are
2354 the template parameters. */
2357 finish_template_decl (tree parms)
2360 end_template_decl ();
2362 end_specialization ();
2365 /* Finish processing a template-id (which names a type) of the form
2366 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2367 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2368 the scope of template-id indicated. */
2371 finish_template_type (tree name, tree args, int entering_scope)
2375 decl = lookup_template_class (name, args,
2376 NULL_TREE, NULL_TREE, entering_scope,
2377 tf_warning_or_error | tf_user);
2378 if (decl != error_mark_node)
2379 decl = TYPE_STUB_DECL (decl);
2384 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2385 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2386 BASE_CLASS, or NULL_TREE if an error occurred. The
2387 ACCESS_SPECIFIER is one of
2388 access_{default,public,protected_private}_node. For a virtual base
2389 we set TREE_TYPE. */
2392 finish_base_specifier (tree base, tree access, bool virtual_p)
2396 if (base == error_mark_node)
2398 error ("invalid base-class specification");
2401 else if (! is_aggr_type (base, 1))
2405 if (cp_type_quals (base) != 0)
2407 error ("base class %qT has cv qualifiers", base);
2408 base = TYPE_MAIN_VARIANT (base);
2410 result = build_tree_list (access, base);
2412 TREE_TYPE (result) = integer_type_node;
2418 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2419 what we found when we tried to do the lookup. */
2422 qualified_name_lookup_error (tree scope, tree name, tree decl)
2424 if (scope == error_mark_node)
2425 ; /* We already complained. */
2426 else if (TYPE_P (scope))
2428 if (!COMPLETE_TYPE_P (scope))
2429 error ("incomplete type %qT used in nested name specifier", scope);
2430 else if (TREE_CODE (decl) == TREE_LIST)
2432 error ("reference to %<%T::%D%> is ambiguous", scope, name);
2433 print_candidates (decl);
2436 error ("%qD is not a member of %qT", name, scope);
2438 else if (scope != global_namespace)
2439 error ("%qD is not a member of %qD", name, scope);
2441 error ("%<::%D%> has not been declared", name);
2444 /* If FNS is a member function, a set of member functions, or a
2445 template-id referring to one or more member functions, return a
2446 BASELINK for FNS, incorporating the current access context.
2447 Otherwise, return FNS unchanged. */
2450 baselink_for_fns (tree fns)
2455 if (BASELINK_P (fns)
2456 || error_operand_p (fns))
2460 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2461 fn = TREE_OPERAND (fn, 0);
2462 fn = get_first_fn (fn);
2463 if (!DECL_FUNCTION_MEMBER_P (fn))
2466 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2468 cl = DECL_CONTEXT (fn);
2469 cl = TYPE_BINFO (cl);
2470 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2473 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2474 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2475 if non-NULL, is the type or namespace used to explicitly qualify
2476 ID_EXPRESSION. DECL is the entity to which that name has been
2479 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2480 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2481 be set to true if this expression isn't permitted in a
2482 constant-expression, but it is otherwise not set by this function.
2483 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2484 constant-expression, but a non-constant expression is also
2487 DONE is true if this expression is a complete postfix-expression;
2488 it is false if this expression is followed by '->', '[', '(', etc.
2489 ADDRESS_P is true iff this expression is the operand of '&'.
2490 TEMPLATE_P is true iff the qualified-id was of the form
2491 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2492 appears as a template argument.
2494 If an error occurs, and it is the kind of error that might cause
2495 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2496 is the caller's responsibility to issue the message. *ERROR_MSG
2497 will be a string with static storage duration, so the caller need
2500 Return an expression for the entity, after issuing appropriate
2501 diagnostics. This function is also responsible for transforming a
2502 reference to a non-static member into a COMPONENT_REF that makes
2503 the use of "this" explicit.
2505 Upon return, *IDK will be filled in appropriately. */
2508 finish_id_expression (tree id_expression,
2512 bool integral_constant_expression_p,
2513 bool allow_non_integral_constant_expression_p,
2514 bool *non_integral_constant_expression_p,
2518 bool template_arg_p,
2519 const char **error_msg)
2521 /* Initialize the output parameters. */
2522 *idk = CP_ID_KIND_NONE;
2525 if (id_expression == error_mark_node)
2526 return error_mark_node;
2527 /* If we have a template-id, then no further lookup is
2528 required. If the template-id was for a template-class, we
2529 will sometimes have a TYPE_DECL at this point. */
2530 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2531 || TREE_CODE (decl) == TYPE_DECL)
2533 /* Look up the name. */
2536 if (decl == error_mark_node)
2538 /* Name lookup failed. */
2541 || (!dependent_type_p (scope)
2542 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2543 && IDENTIFIER_TYPENAME_P (id_expression)
2544 && dependent_type_p (TREE_TYPE (id_expression))))))
2546 /* If the qualifying type is non-dependent (and the name
2547 does not name a conversion operator to a dependent
2548 type), issue an error. */
2549 qualified_name_lookup_error (scope, id_expression, decl);
2550 return error_mark_node;
2554 /* It may be resolved via Koenig lookup. */
2555 *idk = CP_ID_KIND_UNQUALIFIED;
2556 return id_expression;
2559 decl = id_expression;
2561 /* If DECL is a variable that would be out of scope under
2562 ANSI/ISO rules, but in scope in the ARM, name lookup
2563 will succeed. Issue a diagnostic here. */
2565 decl = check_for_out_of_scope_variable (decl);
2567 /* Remember that the name was used in the definition of
2568 the current class so that we can check later to see if
2569 the meaning would have been different after the class
2570 was entirely defined. */
2571 if (!scope && decl != error_mark_node)
2572 maybe_note_name_used_in_class (id_expression, decl);
2574 /* Disallow uses of local variables from containing functions. */
2575 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2577 tree context = decl_function_context (decl);
2578 if (context != NULL_TREE && context != current_function_decl
2579 && ! TREE_STATIC (decl))
2581 error (TREE_CODE (decl) == VAR_DECL
2582 ? "use of %<auto%> variable from containing function"
2583 : "use of parameter from containing function");
2584 error (" %q+#D declared here", decl);
2585 return error_mark_node;
2590 /* If we didn't find anything, or what we found was a type,
2591 then this wasn't really an id-expression. */
2592 if (TREE_CODE (decl) == TEMPLATE_DECL
2593 && !DECL_FUNCTION_TEMPLATE_P (decl))
2595 *error_msg = "missing template arguments";
2596 return error_mark_node;
2598 else if (TREE_CODE (decl) == TYPE_DECL
2599 || TREE_CODE (decl) == NAMESPACE_DECL)
2601 *error_msg = "expected primary-expression";
2602 return error_mark_node;
2605 /* If the name resolved to a template parameter, there is no
2606 need to look it up again later. */
2607 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2608 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2612 *idk = CP_ID_KIND_NONE;
2613 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2614 decl = TEMPLATE_PARM_DECL (decl);
2615 r = convert_from_reference (DECL_INITIAL (decl));
2617 if (integral_constant_expression_p
2618 && !dependent_type_p (TREE_TYPE (decl))
2619 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2621 if (!allow_non_integral_constant_expression_p)
2622 error ("template parameter %qD of type %qT is not allowed in "
2623 "an integral constant expression because it is not of "
2624 "integral or enumeration type", decl, TREE_TYPE (decl));
2625 *non_integral_constant_expression_p = true;
2629 /* Similarly, we resolve enumeration constants to their
2630 underlying values. */
2631 else if (TREE_CODE (decl) == CONST_DECL)
2633 *idk = CP_ID_KIND_NONE;
2634 if (!processing_template_decl)
2636 used_types_insert (TREE_TYPE (decl));
2637 return DECL_INITIAL (decl);
2645 /* If the declaration was explicitly qualified indicate
2646 that. The semantics of `A::f(3)' are different than
2647 `f(3)' if `f' is virtual. */
2649 ? CP_ID_KIND_QUALIFIED
2650 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2651 ? CP_ID_KIND_TEMPLATE_ID
2652 : CP_ID_KIND_UNQUALIFIED));
2657 An id-expression is type-dependent if it contains an
2658 identifier that was declared with a dependent type.
2660 The standard is not very specific about an id-expression that
2661 names a set of overloaded functions. What if some of them
2662 have dependent types and some of them do not? Presumably,
2663 such a name should be treated as a dependent name. */
2664 /* Assume the name is not dependent. */
2665 dependent_p = false;
2666 if (!processing_template_decl)
2667 /* No names are dependent outside a template. */
2669 /* A template-id where the name of the template was not resolved
2670 is definitely dependent. */
2671 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2672 && (TREE_CODE (TREE_OPERAND (decl, 0))
2673 == IDENTIFIER_NODE))
2675 /* For anything except an overloaded function, just check its
2677 else if (!is_overloaded_fn (decl))
2679 = dependent_type_p (TREE_TYPE (decl));
2680 /* For a set of overloaded functions, check each of the
2686 if (BASELINK_P (fns))
2687 fns = BASELINK_FUNCTIONS (fns);
2689 /* For a template-id, check to see if the template
2690 arguments are dependent. */
2691 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2693 tree args = TREE_OPERAND (fns, 1);
2694 dependent_p = any_dependent_template_arguments_p (args);
2695 /* The functions are those referred to by the
2697 fns = TREE_OPERAND (fns, 0);
2700 /* If there are no dependent template arguments, go through
2701 the overloaded functions. */
2702 while (fns && !dependent_p)
2704 tree fn = OVL_CURRENT (fns);
2706 /* Member functions of dependent classes are
2708 if (TREE_CODE (fn) == FUNCTION_DECL
2709 && type_dependent_expression_p (fn))
2711 else if (TREE_CODE (fn) == TEMPLATE_DECL
2712 && dependent_template_p (fn))
2715 fns = OVL_NEXT (fns);
2719 /* If the name was dependent on a template parameter, we will
2720 resolve the name at instantiation time. */
2723 /* Create a SCOPE_REF for qualified names, if the scope is
2727 /* Since this name was dependent, the expression isn't
2728 constant -- yet. No error is issued because it might
2729 be constant when things are instantiated. */
2730 if (integral_constant_expression_p)
2731 *non_integral_constant_expression_p = true;
2734 if (address_p && done)
2735 decl = finish_qualified_id_expr (scope, decl,
2739 else if (dependent_type_p (scope))
2740 decl = build_qualified_name (/*type=*/NULL_TREE,
2744 else if (DECL_P (decl))
2745 decl = build_qualified_name (TREE_TYPE (decl),
2750 if (TREE_TYPE (decl))
2751 decl = convert_from_reference (decl);
2754 /* A TEMPLATE_ID already contains all the information we
2756 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2757 return id_expression;
2758 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2759 /* If we found a variable, then name lookup during the
2760 instantiation will always resolve to the same VAR_DECL
2761 (or an instantiation thereof). */
2762 if (TREE_CODE (decl) == VAR_DECL
2763 || TREE_CODE (decl) == PARM_DECL)
2764 return convert_from_reference (decl);
2765 /* The same is true for FIELD_DECL, but we also need to
2766 make sure that the syntax is correct. */
2767 else if (TREE_CODE (decl) == FIELD_DECL)
2769 /* Since SCOPE is NULL here, this is an unqualified name.
2770 Access checking has been performed during name lookup
2771 already. Turn off checking to avoid duplicate errors. */
2772 push_deferring_access_checks (dk_no_check);
2773 decl = finish_non_static_data_member
2774 (decl, current_class_ref,
2775 /*qualifying_scope=*/NULL_TREE);
2776 pop_deferring_access_checks ();
2779 return id_expression;
2782 /* Only certain kinds of names are allowed in constant
2783 expression. Enumerators and template parameters have already
2784 been handled above. */
2785 if (integral_constant_expression_p
2786 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2787 && ! builtin_valid_in_constant_expr_p (decl))
2789 if (!allow_non_integral_constant_expression_p)
2791 error ("%qD cannot appear in a constant-expression", decl);
2792 return error_mark_node;
2794 *non_integral_constant_expression_p = true;
2797 if (TREE_CODE (decl) == NAMESPACE_DECL)
2799 error ("use of namespace %qD as expression", decl);
2800 return error_mark_node;
2802 else if (DECL_CLASS_TEMPLATE_P (decl))
2804 error ("use of class template %qT as expression", decl);
2805 return error_mark_node;
2807 else if (TREE_CODE (decl) == TREE_LIST)
2809 /* Ambiguous reference to base members. */
2810 error ("request for member %qD is ambiguous in "
2811 "multiple inheritance lattice", id_expression);
2812 print_candidates (decl);
2813 return error_mark_node;
2816 /* Mark variable-like entities as used. Functions are similarly
2817 marked either below or after overload resolution. */
2818 if (TREE_CODE (decl) == VAR_DECL
2819 || TREE_CODE (decl) == PARM_DECL
2820 || TREE_CODE (decl) == RESULT_DECL)
2825 decl = (adjust_result_of_qualified_name_lookup
2826 (decl, scope, current_class_type));
2828 if (TREE_CODE (decl) == FUNCTION_DECL)
2831 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2832 decl = finish_qualified_id_expr (scope,
2840 tree r = convert_from_reference (decl);
2842 if (processing_template_decl && TYPE_P (scope))
2843 r = build_qualified_name (TREE_TYPE (r),
2849 else if (TREE_CODE (decl) == FIELD_DECL)
2851 /* Since SCOPE is NULL here, this is an unqualified name.
2852 Access checking has been performed during name lookup
2853 already. Turn off checking to avoid duplicate errors. */
2854 push_deferring_access_checks (dk_no_check);
2855 decl = finish_non_static_data_member (decl, current_class_ref,
2856 /*qualifying_scope=*/NULL_TREE);
2857 pop_deferring_access_checks ();
2859 else if (is_overloaded_fn (decl))
2864 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
2865 first_fn = TREE_OPERAND (first_fn, 0);
2866 first_fn = get_first_fn (first_fn);
2867 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2868 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2870 if (!really_overloaded_fn (decl))
2871 mark_used (first_fn);
2874 && TREE_CODE (first_fn) == FUNCTION_DECL
2875 && DECL_FUNCTION_MEMBER_P (first_fn)
2876 && !shared_member_p (decl))
2878 /* A set of member functions. */
2879 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
2880 return finish_class_member_access_expr (decl, id_expression,
2881 /*template_p=*/false);
2884 decl = baselink_for_fns (decl);
2888 if (DECL_P (decl) && DECL_NONLOCAL (decl)
2889 && DECL_CLASS_SCOPE_P (decl)
2890 && DECL_CONTEXT (decl) != current_class_type)
2894 path = currently_open_derived_class (DECL_CONTEXT (decl));
2895 perform_or_defer_access_check (TYPE_BINFO (path), decl, decl);
2898 decl = convert_from_reference (decl);
2902 if (TREE_DEPRECATED (decl))
2903 warn_deprecated_use (decl);
2908 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
2909 use as a type-specifier. */
2912 finish_typeof (tree expr)
2916 if (type_dependent_expression_p (expr))
2918 type = make_aggr_type (TYPEOF_TYPE);
2919 TYPEOF_TYPE_EXPR (type) = expr;
2924 type = unlowered_expr_type (expr);
2926 if (!type || type == unknown_type_node)
2928 error ("type of %qE is unknown", expr);
2929 return error_mark_node;
2935 /* Perform C++-specific checks for __builtin_offsetof before calling
2939 finish_offsetof (tree expr)
2941 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
2943 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
2944 TREE_OPERAND (expr, 2));
2945 return error_mark_node;
2947 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
2948 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
2949 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
2951 if (TREE_CODE (expr) == COMPONENT_REF
2952 || TREE_CODE (expr) == COMPOUND_EXPR)
2953 expr = TREE_OPERAND (expr, 1);
2954 error ("cannot apply %<offsetof%> to member function %qD", expr);
2955 return error_mark_node;
2957 return fold_offsetof (expr, NULL_TREE);
2960 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
2961 with equivalent CALL_EXPRs. */
2964 simplify_aggr_init_exprs_r (tree* tp,
2966 void* data ATTRIBUTE_UNUSED)
2968 /* We don't need to walk into types; there's nothing in a type that
2969 needs simplification. (And, furthermore, there are places we
2970 actively don't want to go. For example, we don't want to wander
2971 into the default arguments for a FUNCTION_DECL that appears in a
2978 /* Only AGGR_INIT_EXPRs are interesting. */
2979 else if (TREE_CODE (*tp) != AGGR_INIT_EXPR)
2982 simplify_aggr_init_expr (tp);
2984 /* Keep iterating. */
2988 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
2989 function is broken out from the above for the benefit of the tree-ssa
2993 simplify_aggr_init_expr (tree *tp)
2995 tree aggr_init_expr = *tp;
2997 /* Form an appropriate CALL_EXPR. */
2998 tree fn = TREE_OPERAND (aggr_init_expr, 0);
2999 tree args = TREE_OPERAND (aggr_init_expr, 1);
3000 tree slot = TREE_OPERAND (aggr_init_expr, 2);
3001 tree type = TREE_TYPE (slot);
3004 enum style_t { ctor, arg, pcc } style;
3006 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
3008 #ifdef PCC_STATIC_STRUCT_RETURN
3014 gcc_assert (TREE_ADDRESSABLE (type));
3020 /* Replace the first argument to the ctor with the address of the
3024 args = TREE_CHAIN (args);
3025 cxx_mark_addressable (slot);
3026 addr = build1 (ADDR_EXPR, build_pointer_type (type), slot);
3027 args = tree_cons (NULL_TREE, addr, args);
3030 call_expr = build3 (CALL_EXPR,
3031 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
3032 fn, args, NULL_TREE);
3036 /* Just mark it addressable here, and leave the rest to
3037 expand_call{,_inline}. */
3038 cxx_mark_addressable (slot);
3039 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
3040 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
3042 else if (style == pcc)
3044 /* If we're using the non-reentrant PCC calling convention, then we
3045 need to copy the returned value out of the static buffer into the
3047 push_deferring_access_checks (dk_no_check);
3048 call_expr = build_aggr_init (slot, call_expr,
3049 DIRECT_BIND | LOOKUP_ONLYCONVERTING);
3050 pop_deferring_access_checks ();
3051 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3057 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3060 emit_associated_thunks (tree fn)
3062 /* When we use vcall offsets, we emit thunks with the virtual
3063 functions to which they thunk. The whole point of vcall offsets
3064 is so that you can know statically the entire set of thunks that
3065 will ever be needed for a given virtual function, thereby
3066 enabling you to output all the thunks with the function itself. */
3067 if (DECL_VIRTUAL_P (fn))
3071 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3073 if (!THUNK_ALIAS (thunk))
3075 use_thunk (thunk, /*emit_p=*/1);
3076 if (DECL_RESULT_THUNK_P (thunk))
3080 for (probe = DECL_THUNKS (thunk);
3081 probe; probe = TREE_CHAIN (probe))
3082 use_thunk (probe, /*emit_p=*/1);
3086 gcc_assert (!DECL_THUNKS (thunk));
3091 /* Generate RTL for FN. */
3094 expand_body (tree fn)
3096 tree saved_function;
3098 /* Compute the appropriate object-file linkage for inline
3100 if (DECL_DECLARED_INLINE_P (fn))
3101 import_export_decl (fn);
3103 /* If FN is external, then there's no point in generating RTL for
3104 it. This situation can arise with an inline function under
3105 `-fexternal-templates'; we instantiate the function, even though
3106 we're not planning on emitting it, in case we get a chance to
3108 if (DECL_EXTERNAL (fn))
3111 /* ??? When is this needed? */
3112 saved_function = current_function_decl;
3114 /* Emit any thunks that should be emitted at the same time as FN. */
3115 emit_associated_thunks (fn);
3117 /* This function is only called from cgraph, or recursively from
3118 emit_associated_thunks. In neither case should we be currently
3119 generating trees for a function. */
3120 gcc_assert (function_depth == 0);
3122 tree_rest_of_compilation (fn);
3124 current_function_decl = saved_function;
3126 if (DECL_CLONED_FUNCTION_P (fn))
3128 /* If this is a clone, go through the other clones now and mark
3129 their parameters used. We have to do that here, as we don't
3130 know whether any particular clone will be expanded, and
3131 therefore cannot pick one arbitrarily. */
3134 for (probe = TREE_CHAIN (DECL_CLONED_FUNCTION (fn));
3135 probe && DECL_CLONED_FUNCTION_P (probe);
3136 probe = TREE_CHAIN (probe))
3140 for (parms = DECL_ARGUMENTS (probe);
3141 parms; parms = TREE_CHAIN (parms))
3142 TREE_USED (parms) = 1;
3147 /* Generate RTL for FN. */
3150 expand_or_defer_fn (tree fn)
3152 /* When the parser calls us after finishing the body of a template
3153 function, we don't really want to expand the body. */
3154 if (processing_template_decl)
3156 /* Normally, collection only occurs in rest_of_compilation. So,
3157 if we don't collect here, we never collect junk generated
3158 during the processing of templates until we hit a
3159 non-template function. It's not safe to do this inside a
3160 nested class, though, as the parser may have local state that
3161 is not a GC root. */
3162 if (!function_depth)
3167 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
3168 walk_tree_without_duplicates (&DECL_SAVED_TREE (fn),
3169 simplify_aggr_init_exprs_r,
3172 /* If this is a constructor or destructor body, we have to clone
3174 if (maybe_clone_body (fn))
3176 /* We don't want to process FN again, so pretend we've written
3177 it out, even though we haven't. */
3178 TREE_ASM_WRITTEN (fn) = 1;
3182 /* If this function is marked with the constructor attribute, add it
3183 to the list of functions to be called along with constructors
3184 from static duration objects. */
3185 if (DECL_STATIC_CONSTRUCTOR (fn))
3186 static_ctors = tree_cons (NULL_TREE, fn, static_ctors);
3188 /* If this function is marked with the destructor attribute, add it
3189 to the list of functions to be called along with destructors from
3190 static duration objects. */
3191 if (DECL_STATIC_DESTRUCTOR (fn))
3192 static_dtors = tree_cons (NULL_TREE, fn, static_dtors);
3194 /* We make a decision about linkage for these functions at the end
3195 of the compilation. Until that point, we do not want the back
3196 end to output them -- but we do want it to see the bodies of
3197 these functions so that it can inline them as appropriate. */
3198 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3200 if (DECL_INTERFACE_KNOWN (fn))
3201 /* We've already made a decision as to how this function will
3205 DECL_EXTERNAL (fn) = 1;
3206 DECL_NOT_REALLY_EXTERN (fn) = 1;
3207 note_vague_linkage_fn (fn);
3208 /* A non-template inline function with external linkage will
3209 always be COMDAT. As we must eventually determine the
3210 linkage of all functions, and as that causes writes to
3211 the data mapped in from the PCH file, it's advantageous
3212 to mark the functions at this point. */
3213 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3215 /* This function must have external linkage, as
3216 otherwise DECL_INTERFACE_KNOWN would have been
3218 gcc_assert (TREE_PUBLIC (fn));
3219 comdat_linkage (fn);
3220 DECL_INTERFACE_KNOWN (fn) = 1;
3224 import_export_decl (fn);
3226 /* If the user wants us to keep all inline functions, then mark
3227 this function as needed so that finish_file will make sure to
3229 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3233 /* There's no reason to do any of the work here if we're only doing
3234 semantic analysis; this code just generates RTL. */
3235 if (flag_syntax_only)
3240 /* Expand or defer, at the whim of the compilation unit manager. */
3241 cgraph_finalize_function (fn, function_depth > 1);
3253 /* Helper function for walk_tree, used by finalize_nrv below. */
3256 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3258 struct nrv_data *dp = (struct nrv_data *)data;
3261 /* No need to walk into types. There wouldn't be any need to walk into
3262 non-statements, except that we have to consider STMT_EXPRs. */
3265 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3266 but differs from using NULL_TREE in that it indicates that we care
3267 about the value of the RESULT_DECL. */
3268 else if (TREE_CODE (*tp) == RETURN_EXPR)
3269 TREE_OPERAND (*tp, 0) = dp->result;
3270 /* Change all cleanups for the NRV to only run when an exception is
3272 else if (TREE_CODE (*tp) == CLEANUP_STMT
3273 && CLEANUP_DECL (*tp) == dp->var)
3274 CLEANUP_EH_ONLY (*tp) = 1;
3275 /* Replace the DECL_EXPR for the NRV with an initialization of the
3276 RESULT_DECL, if needed. */
3277 else if (TREE_CODE (*tp) == DECL_EXPR
3278 && DECL_EXPR_DECL (*tp) == dp->var)
3281 if (DECL_INITIAL (dp->var)
3282 && DECL_INITIAL (dp->var) != error_mark_node)
3284 init = build2 (INIT_EXPR, void_type_node, dp->result,
3285 DECL_INITIAL (dp->var));
3286 DECL_INITIAL (dp->var) = error_mark_node;
3289 init = build_empty_stmt ();
3290 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3293 /* And replace all uses of the NRV with the RESULT_DECL. */
3294 else if (*tp == dp->var)
3297 /* Avoid walking into the same tree more than once. Unfortunately, we
3298 can't just use walk_tree_without duplicates because it would only call
3299 us for the first occurrence of dp->var in the function body. */
3300 slot = htab_find_slot (dp->visited, *tp, INSERT);
3306 /* Keep iterating. */
3310 /* Called from finish_function to implement the named return value
3311 optimization by overriding all the RETURN_EXPRs and pertinent
3312 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3313 RESULT_DECL for the function. */
3316 finalize_nrv (tree *tp, tree var, tree result)
3318 struct nrv_data data;
3320 /* Copy debugging information from VAR to RESULT. */
3321 DECL_NAME (result) = DECL_NAME (var);
3322 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3323 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3324 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3325 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3326 /* Don't forget that we take its address. */
3327 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3330 data.result = result;
3331 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3332 walk_tree (tp, finalize_nrv_r, &data, 0);
3333 htab_delete (data.visited);
3336 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3337 Remove any elements from the list that are invalid. */
3340 finish_omp_clauses (tree clauses)
3342 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3343 tree c, t, *pc = &clauses;
3346 bitmap_obstack_initialize (NULL);
3347 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3348 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3349 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3351 for (pc = &clauses, c = clauses; c ; c = *pc)
3353 bool remove = false;
3355 switch (OMP_CLAUSE_CODE (c))
3357 case OMP_CLAUSE_SHARED:
3359 goto check_dup_generic;
3360 case OMP_CLAUSE_PRIVATE:
3362 goto check_dup_generic;
3363 case OMP_CLAUSE_REDUCTION:
3365 goto check_dup_generic;
3366 case OMP_CLAUSE_COPYPRIVATE:
3367 name = "copyprivate";
3368 goto check_dup_generic;
3369 case OMP_CLAUSE_COPYIN:
3371 goto check_dup_generic;
3373 t = OMP_CLAUSE_DECL (c);
3374 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3376 if (processing_template_decl)
3379 error ("%qD is not a variable in clause %qs", t, name);
3381 error ("%qE is not a variable in clause %qs", t, name);
3384 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3385 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3386 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3388 error ("%qD appears more than once in data clauses", t);
3392 bitmap_set_bit (&generic_head, DECL_UID (t));
3395 case OMP_CLAUSE_FIRSTPRIVATE:
3396 t = OMP_CLAUSE_DECL (c);
3397 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3399 if (processing_template_decl)
3401 error ("%qE is not a variable in clause %<firstprivate%>", t);
3404 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3405 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3407 error ("%qE appears more than once in data clauses", t);
3411 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3414 case OMP_CLAUSE_LASTPRIVATE:
3415 t = OMP_CLAUSE_DECL (c);
3416 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3418 if (processing_template_decl)
3420 error ("%qE is not a variable in clause %<lastprivate%>", t);
3423 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3424 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3426 error ("%qE appears more than once in data clauses", t);
3430 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3434 t = OMP_CLAUSE_IF_EXPR (c);
3435 t = maybe_convert_cond (t);
3436 if (t == error_mark_node)
3438 OMP_CLAUSE_IF_EXPR (c) = t;
3441 case OMP_CLAUSE_NUM_THREADS:
3442 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3443 if (t == error_mark_node)
3445 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
3446 && !type_dependent_expression_p (t))
3448 error ("num_threads expression must be integral");
3453 case OMP_CLAUSE_SCHEDULE:
3454 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3457 else if (t == error_mark_node)
3459 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
3460 && !type_dependent_expression_p (t))
3462 error ("schedule chunk size expression must be integral");
3467 case OMP_CLAUSE_NOWAIT:
3468 case OMP_CLAUSE_ORDERED:
3469 case OMP_CLAUSE_DEFAULT:
3477 *pc = OMP_CLAUSE_CHAIN (c);
3479 pc = &OMP_CLAUSE_CHAIN (c);
3482 for (pc = &clauses, c = clauses; c ; c = *pc)
3484 enum tree_code c_kind = OMP_CLAUSE_CODE (c);
3485 bool remove = false;
3486 bool need_complete_non_reference = false;
3487 bool need_default_ctor = false;
3488 bool need_copy_ctor = false;
3489 bool need_copy_assignment = false;
3490 bool need_implicitly_determined = false;
3491 tree type, inner_type;
3495 case OMP_CLAUSE_SHARED:
3497 need_implicitly_determined = true;
3499 case OMP_CLAUSE_PRIVATE:
3501 need_complete_non_reference = true;
3502 need_default_ctor = true;
3503 need_implicitly_determined = true;
3505 case OMP_CLAUSE_FIRSTPRIVATE:
3506 name = "firstprivate";
3507 need_complete_non_reference = true;
3508 need_copy_ctor = true;
3509 need_implicitly_determined = true;
3511 case OMP_CLAUSE_LASTPRIVATE:
3512 name = "lastprivate";
3513 need_complete_non_reference = true;
3514 need_copy_assignment = true;
3515 need_implicitly_determined = true;
3517 case OMP_CLAUSE_REDUCTION:
3519 need_implicitly_determined = true;
3521 case OMP_CLAUSE_COPYPRIVATE:
3522 name = "copyprivate";
3523 need_copy_assignment = true;
3525 case OMP_CLAUSE_COPYIN:
3527 need_copy_assignment = true;
3530 pc = &OMP_CLAUSE_CHAIN (c);
3534 t = OMP_CLAUSE_DECL (c);
3535 if (processing_template_decl
3536 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3538 pc = &OMP_CLAUSE_CHAIN (c);
3544 case OMP_CLAUSE_LASTPRIVATE:
3545 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3546 need_default_ctor = true;
3549 case OMP_CLAUSE_REDUCTION:
3550 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3551 || POINTER_TYPE_P (TREE_TYPE (t)))
3553 error ("%qE has invalid type for %<reduction%>", t);
3556 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3558 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3566 error ("%qE has invalid type for %<reduction(%s)%>",
3567 t, operator_name_info[r_code].name);
3573 case OMP_CLAUSE_COPYIN:
3574 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3576 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3585 if (need_complete_non_reference)
3587 t = require_complete_type (t);
3588 if (t == error_mark_node)
3590 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3592 error ("%qE has reference type for %qs", t, name);
3596 if (need_implicitly_determined)
3598 const char *share_name = NULL;
3600 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3601 share_name = "threadprivate";
3602 else switch (cxx_omp_predetermined_sharing (t))
3604 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3606 case OMP_CLAUSE_DEFAULT_SHARED:
3607 share_name = "shared";
3609 case OMP_CLAUSE_DEFAULT_PRIVATE:
3610 share_name = "private";
3617 error ("%qE is predetermined %qs for %qs",
3618 t, share_name, name);
3623 /* We're interested in the base element, not arrays. */
3624 inner_type = type = TREE_TYPE (t);
3625 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3626 inner_type = TREE_TYPE (inner_type);
3628 /* Check for special function availability by building a call to one.
3629 Save the results, because later we won't be in the right context
3630 for making these queries. */
3631 if (CLASS_TYPE_P (inner_type)
3632 && (need_default_ctor || need_copy_ctor || need_copy_assignment)
3633 && !type_dependent_expression_p (t))
3635 int save_errorcount = errorcount;
3638 /* Always allocate 3 elements for simplicity. These are the
3639 function decls for the ctor, dtor, and assignment op.
3640 This layout is known to the three lang hooks,
3641 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3642 and cxx_omp_clause_assign_op. */
3643 info = make_tree_vec (3);
3644 CP_OMP_CLAUSE_INFO (c) = info;
3646 if (need_default_ctor
3648 && !TYPE_HAS_TRIVIAL_INIT_REF (inner_type)))
3650 if (need_default_ctor)
3654 t = build_int_cst (build_pointer_type (inner_type), 0);
3655 t = build1 (INDIRECT_REF, inner_type, t);
3656 t = build_tree_list (NULL, t);
3658 t = build_special_member_call (NULL_TREE,
3659 complete_ctor_identifier,
3660 t, inner_type, LOOKUP_NORMAL);
3661 t = get_callee_fndecl (t);
3662 TREE_VEC_ELT (info, 0) = t;
3665 if ((need_default_ctor || need_copy_ctor)
3666 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_type))
3668 t = build_int_cst (build_pointer_type (inner_type), 0);
3669 t = build1 (INDIRECT_REF, inner_type, t);
3670 t = build_special_member_call (t, complete_dtor_identifier,
3671 NULL, inner_type, LOOKUP_NORMAL);
3672 t = get_callee_fndecl (t);
3673 TREE_VEC_ELT (info, 1) = t;
3676 if (need_copy_assignment
3677 && !TYPE_HAS_TRIVIAL_ASSIGN_REF (inner_type))
3679 t = build_int_cst (build_pointer_type (inner_type), 0);
3680 t = build1 (INDIRECT_REF, inner_type, t);
3681 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3682 build_tree_list (NULL, t),
3683 inner_type, LOOKUP_NORMAL);
3685 /* We'll have called convert_from_reference on the call, which
3686 may well have added an indirect_ref. It's unneeded here,
3687 and in the way, so kill it. */
3688 if (TREE_CODE (t) == INDIRECT_REF)
3689 t = TREE_OPERAND (t, 0);
3691 t = get_callee_fndecl (t);
3692 TREE_VEC_ELT (info, 2) = t;
3695 if (errorcount != save_errorcount)
3700 *pc = OMP_CLAUSE_CHAIN (c);
3702 pc = &OMP_CLAUSE_CHAIN (c);
3705 bitmap_obstack_release (NULL);
3709 /* For all variables in the tree_list VARS, mark them as thread local. */
3712 finish_omp_threadprivate (tree vars)
3716 /* Mark every variable in VARS to be assigned thread local storage. */
3717 for (t = vars; t; t = TREE_CHAIN (t))
3719 tree v = TREE_PURPOSE (t);
3721 /* If V had already been marked threadprivate, it doesn't matter
3722 whether it had been used prior to this point. */
3724 && (DECL_LANG_SPECIFIC (v) == NULL
3725 || !CP_DECL_THREADPRIVATE_P (v)))
3726 error ("%qE declared %<threadprivate%> after first use", v);
3727 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3728 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3729 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3730 error ("%<threadprivate%> %qE has incomplete type", v);
3731 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v)))
3732 error ("%<threadprivate%> %qE is not file, namespace "
3733 "or block scope variable", v);
3736 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3737 if (DECL_LANG_SPECIFIC (v) == NULL)
3739 retrofit_lang_decl (v);
3741 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3742 after the allocation of the lang_decl structure. */
3743 if (DECL_DISCRIMINATOR_P (v))
3744 DECL_LANG_SPECIFIC (v)->decl_flags.u2sel = 1;
3747 if (! DECL_THREAD_LOCAL_P (v))
3749 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3750 /* If rtl has been already set for this var, call
3751 make_decl_rtl once again, so that encode_section_info
3752 has a chance to look at the new decl flags. */
3753 if (DECL_RTL_SET_P (v))
3756 CP_DECL_THREADPRIVATE_P (v) = 1;
3761 /* Build an OpenMP structured block. */
3764 begin_omp_structured_block (void)
3766 return do_pushlevel (sk_omp);
3770 finish_omp_structured_block (tree block)
3772 return do_poplevel (block);
3775 /* Similarly, except force the retention of the BLOCK. */
3778 begin_omp_parallel (void)
3780 keep_next_level (true);
3781 return begin_omp_structured_block ();
3785 finish_omp_parallel (tree clauses, tree body)
3789 body = finish_omp_structured_block (body);
3791 stmt = make_node (OMP_PARALLEL);
3792 TREE_TYPE (stmt) = void_type_node;
3793 OMP_PARALLEL_CLAUSES (stmt) = clauses;
3794 OMP_PARALLEL_BODY (stmt) = body;
3796 return add_stmt (stmt);
3799 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
3800 are directly for their associated operands in the statement. DECL
3801 and INIT are a combo; if DECL is NULL then INIT ought to be a
3802 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
3803 optional statements that need to go before the loop into its
3807 finish_omp_for (location_t locus, tree decl, tree init, tree cond,
3808 tree incr, tree body, tree pre_body)
3813 switch (TREE_CODE (init))
3816 decl = TREE_OPERAND (init, 0);
3817 init = TREE_OPERAND (init, 1);
3820 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
3822 decl = TREE_OPERAND (init, 0);
3823 init = TREE_OPERAND (init, 2);
3832 error ("expected iteration declaration or initialization");
3837 if (type_dependent_expression_p (decl)
3838 || type_dependent_expression_p (init)
3839 || (cond && type_dependent_expression_p (cond))
3840 || (incr && type_dependent_expression_p (incr)))
3846 error ("%Hmissing controlling predicate", &locus);
3852 error ("%Hmissing increment expression", &locus);
3856 stmt = make_node (OMP_FOR);
3858 /* This is really just a place-holder. We'll be decomposing this
3859 again and going through the build_modify_expr path below when
3860 we instantiate the thing. */
3861 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
3863 TREE_TYPE (stmt) = void_type_node;
3864 OMP_FOR_INIT (stmt) = init;
3865 OMP_FOR_COND (stmt) = cond;
3866 OMP_FOR_INCR (stmt) = incr;
3867 OMP_FOR_BODY (stmt) = body;
3868 OMP_FOR_PRE_BODY (stmt) = pre_body;
3870 SET_EXPR_LOCATION (stmt, locus);
3871 return add_stmt (stmt);
3876 error ("expected iteration declaration or initialization");
3880 if (pre_body == NULL || IS_EMPTY_STMT (pre_body))
3882 else if (! processing_template_decl)
3884 add_stmt (pre_body);
3887 init = build_modify_expr (decl, NOP_EXPR, init);
3888 return c_finish_omp_for (locus, decl, init, cond, incr, body, pre_body);
3892 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
3901 dependent_p = false;
3904 /* Even in a template, we can detect invalid uses of the atomic
3905 pragma if neither LHS nor RHS is type-dependent. */
3906 if (processing_template_decl)
3908 dependent_p = (type_dependent_expression_p (lhs)
3909 || type_dependent_expression_p (rhs));
3912 lhs = build_non_dependent_expr (lhs);
3913 rhs = build_non_dependent_expr (rhs);
3918 stmt = c_finish_omp_atomic (code, lhs, rhs);
3919 if (stmt == error_mark_node)
3922 if (processing_template_decl)
3924 stmt = build2 (OMP_ATOMIC, void_type_node, orig_lhs, orig_rhs);
3925 OMP_ATOMIC_DEPENDENT_P (stmt) = 1;
3926 OMP_ATOMIC_CODE (stmt) = code;
3932 finish_omp_barrier (void)
3934 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
3935 tree stmt = finish_call_expr (fn, NULL, false, false);
3936 finish_expr_stmt (stmt);
3940 finish_omp_flush (void)
3942 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
3943 tree stmt = finish_call_expr (fn, NULL, false, false);
3944 finish_expr_stmt (stmt);
3947 /* True if OpenMP sharing attribute of DECL is predetermined. */
3949 enum omp_clause_default_kind
3950 cxx_omp_predetermined_sharing (tree decl)
3952 enum omp_clause_default_kind kind;
3954 kind = c_omp_predetermined_sharing (decl);
3955 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
3958 /* Static data members are predetermined as shared. */
3959 if (TREE_STATIC (decl))
3961 tree ctx = CP_DECL_CONTEXT (decl);
3962 if (TYPE_P (ctx) && IS_AGGR_TYPE (ctx))
3963 return OMP_CLAUSE_DEFAULT_SHARED;
3966 return OMP_CLAUSE_DEFAULT_UNSPECIFIED;
3970 init_cp_semantics (void)
3974 #include "gt-cp-semantics.h"