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 TREE_LIST 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 TREE_LIST. `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 TREE_LIST 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.
129 The TREE_PURPOSE of each node is the scope used to qualify the
130 name being looked up; the TREE_VALUE is the DECL to which the
131 name was resolved. */
132 tree deferred_access_checks;
134 /* The current mode of access checks. */
135 enum deferring_kind deferring_access_checks_kind;
138 DEF_VEC_O (deferred_access);
139 DEF_VEC_ALLOC_O (deferred_access,gc);
141 /* Data for deferred access checking. */
142 static GTY(()) VEC(deferred_access,gc) *deferred_access_stack;
143 static GTY(()) unsigned deferred_access_no_check;
145 /* Save the current deferred access states and start deferred
146 access checking iff DEFER_P is true. */
149 push_deferring_access_checks (deferring_kind deferring)
151 /* For context like template instantiation, access checking
152 disabling applies to all nested context. */
153 if (deferred_access_no_check || deferring == dk_no_check)
154 deferred_access_no_check++;
157 deferred_access *ptr;
159 ptr = VEC_safe_push (deferred_access, gc, deferred_access_stack, NULL);
160 ptr->deferred_access_checks = NULL_TREE;
161 ptr->deferring_access_checks_kind = deferring;
165 /* Resume deferring access checks again after we stopped doing
169 resume_deferring_access_checks (void)
171 if (!deferred_access_no_check)
172 VEC_last (deferred_access, deferred_access_stack)
173 ->deferring_access_checks_kind = dk_deferred;
176 /* Stop deferring access checks. */
179 stop_deferring_access_checks (void)
181 if (!deferred_access_no_check)
182 VEC_last (deferred_access, deferred_access_stack)
183 ->deferring_access_checks_kind = dk_no_deferred;
186 /* Discard the current deferred access checks and restore the
190 pop_deferring_access_checks (void)
192 if (deferred_access_no_check)
193 deferred_access_no_check--;
195 VEC_pop (deferred_access, deferred_access_stack);
198 /* Returns a TREE_LIST representing the deferred checks.
199 The TREE_PURPOSE of each node is the type through which the
200 access occurred; the TREE_VALUE is the declaration named.
204 get_deferred_access_checks (void)
206 if (deferred_access_no_check)
209 return (VEC_last (deferred_access, deferred_access_stack)
210 ->deferred_access_checks);
213 /* Take current deferred checks and combine with the
214 previous states if we also defer checks previously.
215 Otherwise perform checks now. */
218 pop_to_parent_deferring_access_checks (void)
220 if (deferred_access_no_check)
221 deferred_access_no_check--;
225 deferred_access *ptr;
227 checks = (VEC_last (deferred_access, deferred_access_stack)
228 ->deferred_access_checks);
230 VEC_pop (deferred_access, deferred_access_stack);
231 ptr = VEC_last (deferred_access, deferred_access_stack);
232 if (ptr->deferring_access_checks_kind == dk_no_deferred)
235 for (; checks; checks = TREE_CHAIN (checks))
236 enforce_access (TREE_PURPOSE (checks),
237 TREE_VALUE (checks));
241 /* Merge with parent. */
243 tree original = ptr->deferred_access_checks;
245 for (; checks; checks = next)
249 next = TREE_CHAIN (checks);
251 for (probe = original; probe; probe = TREE_CHAIN (probe))
252 if (TREE_VALUE (probe) == TREE_VALUE (checks)
253 && TREE_PURPOSE (probe) == TREE_PURPOSE (checks))
255 /* Insert into parent's checks. */
256 TREE_CHAIN (checks) = ptr->deferred_access_checks;
257 ptr->deferred_access_checks = checks;
264 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
265 is the BINFO indicating the qualifying scope used to access the
266 DECL node stored in the TREE_VALUE of the node. */
269 perform_access_checks (tree checks)
273 enforce_access (TREE_PURPOSE (checks),
274 TREE_VALUE (checks));
275 checks = TREE_CHAIN (checks);
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
305 perform_or_defer_access_check (tree binfo, tree decl)
308 deferred_access *ptr;
310 /* Exit if we are in a context that no access checking is performed.
312 if (deferred_access_no_check)
315 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
317 ptr = VEC_last (deferred_access, deferred_access_stack);
319 /* If we are not supposed to defer access checks, just check now. */
320 if (ptr->deferring_access_checks_kind == dk_no_deferred)
322 enforce_access (binfo, decl);
326 /* See if we are already going to perform this check. */
327 for (check = ptr->deferred_access_checks;
329 check = TREE_CHAIN (check))
330 if (TREE_VALUE (check) == decl && TREE_PURPOSE (check) == binfo)
332 /* If not, record the check. */
333 ptr->deferred_access_checks
334 = tree_cons (binfo, decl, ptr->deferred_access_checks);
337 /* Returns nonzero if the current statement is a full expression,
338 i.e. temporaries created during that statement should be destroyed
339 at the end of the statement. */
342 stmts_are_full_exprs_p (void)
344 return current_stmt_tree ()->stmts_are_full_exprs_p;
347 /* T is a statement. Add it to the statement-tree. This is the C++
348 version. The C/ObjC frontends have a slightly different version of
354 enum tree_code code = TREE_CODE (t);
356 if (EXPR_P (t) && code != LABEL_EXPR)
358 if (!EXPR_HAS_LOCATION (t))
359 SET_EXPR_LOCATION (t, input_location);
361 /* When we expand a statement-tree, we must know whether or not the
362 statements are full-expressions. We record that fact here. */
363 STMT_IS_FULL_EXPR_P (t) = stmts_are_full_exprs_p ();
366 /* Add T to the statement-tree. Non-side-effect statements need to be
367 recorded during statement expressions. */
368 append_to_statement_list_force (t, &cur_stmt_list);
373 /* Returns the stmt_tree (if any) to which statements are currently
374 being added. If there is no active statement-tree, NULL is
378 current_stmt_tree (void)
381 ? &cfun->language->base.x_stmt_tree
382 : &scope_chain->x_stmt_tree);
385 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
388 maybe_cleanup_point_expr (tree expr)
390 if (!processing_template_decl && stmts_are_full_exprs_p ())
391 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
395 /* Like maybe_cleanup_point_expr except have the type of the new expression be
396 void so we don't need to create a temporary variable to hold the inner
397 expression. The reason why we do this is because the original type might be
398 an aggregate and we cannot create a temporary variable for that type. */
401 maybe_cleanup_point_expr_void (tree expr)
403 if (!processing_template_decl && stmts_are_full_exprs_p ())
404 expr = fold_build_cleanup_point_expr (void_type_node, expr);
410 /* Create a declaration statement for the declaration given by the DECL. */
413 add_decl_expr (tree decl)
415 tree r = build_stmt (DECL_EXPR, decl);
416 if (DECL_INITIAL (decl)
417 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
418 r = maybe_cleanup_point_expr_void (r);
422 /* Nonzero if TYPE is an anonymous union or struct type. We have to use a
423 flag for this because "A union for which objects or pointers are
424 declared is not an anonymous union" [class.union]. */
427 anon_aggr_type_p (tree node)
429 return ANON_AGGR_TYPE_P (node);
432 /* Finish a scope. */
435 do_poplevel (tree stmt_list)
439 if (stmts_are_full_exprs_p ())
440 block = poplevel (kept_level_p (), 1, 0);
442 stmt_list = pop_stmt_list (stmt_list);
444 if (!processing_template_decl)
446 stmt_list = c_build_bind_expr (block, stmt_list);
447 /* ??? See c_end_compound_stmt re statement expressions. */
453 /* Begin a new scope. */
456 do_pushlevel (scope_kind sk)
458 tree ret = push_stmt_list ();
459 if (stmts_are_full_exprs_p ())
460 begin_scope (sk, NULL);
464 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
465 when the current scope is exited. EH_ONLY is true when this is not
466 meant to apply to normal control flow transfer. */
469 push_cleanup (tree decl, tree cleanup, bool eh_only)
471 tree stmt = build_stmt (CLEANUP_STMT, NULL, cleanup, decl);
472 CLEANUP_EH_ONLY (stmt) = eh_only;
474 CLEANUP_BODY (stmt) = push_stmt_list ();
477 /* Begin a conditional that might contain a declaration. When generating
478 normal code, we want the declaration to appear before the statement
479 containing the conditional. When generating template code, we want the
480 conditional to be rendered as the raw DECL_EXPR. */
483 begin_cond (tree *cond_p)
485 if (processing_template_decl)
486 *cond_p = push_stmt_list ();
489 /* Finish such a conditional. */
492 finish_cond (tree *cond_p, tree expr)
494 if (processing_template_decl)
496 tree cond = pop_stmt_list (*cond_p);
497 if (TREE_CODE (cond) == DECL_EXPR)
503 /* If *COND_P specifies a conditional with a declaration, transform the
506 for (; A x = 42;) { }
508 while (true) { A x = 42; if (!x) break; }
509 for (;;) { A x = 42; if (!x) break; }
510 The statement list for BODY will be empty if the conditional did
511 not declare anything. */
514 simplify_loop_decl_cond (tree *cond_p, tree body)
518 if (!TREE_SIDE_EFFECTS (body))
522 *cond_p = boolean_true_node;
524 if_stmt = begin_if_stmt ();
525 cond = build_unary_op (TRUTH_NOT_EXPR, cond, 0);
526 finish_if_stmt_cond (cond, if_stmt);
527 finish_break_stmt ();
528 finish_then_clause (if_stmt);
529 finish_if_stmt (if_stmt);
532 /* Finish a goto-statement. */
535 finish_goto_stmt (tree destination)
537 if (TREE_CODE (destination) == IDENTIFIER_NODE)
538 destination = lookup_label (destination);
540 /* We warn about unused labels with -Wunused. That means we have to
541 mark the used labels as used. */
542 if (TREE_CODE (destination) == LABEL_DECL)
543 TREE_USED (destination) = 1;
546 /* The DESTINATION is being used as an rvalue. */
547 if (!processing_template_decl)
548 destination = decay_conversion (destination);
549 /* We don't inline calls to functions with computed gotos.
550 Those functions are typically up to some funny business,
551 and may be depending on the labels being at particular
552 addresses, or some such. */
553 DECL_UNINLINABLE (current_function_decl) = 1;
556 check_goto (destination);
558 return add_stmt (build_stmt (GOTO_EXPR, destination));
561 /* COND is the condition-expression for an if, while, etc.,
562 statement. Convert it to a boolean value, if appropriate. */
565 maybe_convert_cond (tree cond)
567 /* Empty conditions remain empty. */
571 /* Wait until we instantiate templates before doing conversion. */
572 if (processing_template_decl)
575 /* Do the conversion. */
576 cond = convert_from_reference (cond);
577 return condition_conversion (cond);
580 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
583 finish_expr_stmt (tree expr)
587 if (expr != NULL_TREE)
589 if (!processing_template_decl)
591 if (warn_sequence_point)
592 verify_sequence_points (expr);
593 expr = convert_to_void (expr, "statement");
595 else if (!type_dependent_expression_p (expr))
596 convert_to_void (build_non_dependent_expr (expr), "statement");
598 /* Simplification of inner statement expressions, compound exprs,
599 etc can result in us already having an EXPR_STMT. */
600 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
602 if (TREE_CODE (expr) != EXPR_STMT)
603 expr = build_stmt (EXPR_STMT, expr);
604 expr = maybe_cleanup_point_expr_void (expr);
616 /* Begin an if-statement. Returns a newly created IF_STMT if
623 scope = do_pushlevel (sk_block);
624 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
625 TREE_CHAIN (r) = scope;
626 begin_cond (&IF_COND (r));
630 /* Process the COND of an if-statement, which may be given by
634 finish_if_stmt_cond (tree cond, tree if_stmt)
636 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
638 THEN_CLAUSE (if_stmt) = push_stmt_list ();
641 /* Finish the then-clause of an if-statement, which may be given by
645 finish_then_clause (tree if_stmt)
647 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
651 /* Begin the else-clause of an if-statement. */
654 begin_else_clause (tree if_stmt)
656 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
659 /* Finish the else-clause of an if-statement, which may be given by
663 finish_else_clause (tree if_stmt)
665 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
668 /* Finish an if-statement. */
671 finish_if_stmt (tree if_stmt)
673 tree scope = TREE_CHAIN (if_stmt);
674 TREE_CHAIN (if_stmt) = NULL;
675 add_stmt (do_poplevel (scope));
677 empty_body_warning (THEN_CLAUSE (if_stmt), ELSE_CLAUSE (if_stmt));
680 /* Begin a while-statement. Returns a newly created WHILE_STMT if
684 begin_while_stmt (void)
687 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
689 WHILE_BODY (r) = do_pushlevel (sk_block);
690 begin_cond (&WHILE_COND (r));
694 /* Process the COND of a while-statement, which may be given by
698 finish_while_stmt_cond (tree cond, tree while_stmt)
700 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
701 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
704 /* Finish a while-statement, which may be given by WHILE_STMT. */
707 finish_while_stmt (tree while_stmt)
709 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
713 /* Begin a do-statement. Returns a newly created DO_STMT if
719 tree r = build_stmt (DO_STMT, NULL_TREE, NULL_TREE);
721 DO_BODY (r) = push_stmt_list ();
725 /* Finish the body of a do-statement, which may be given by DO_STMT. */
728 finish_do_body (tree do_stmt)
730 DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
733 /* Finish a do-statement, which may be given by DO_STMT, and whose
734 COND is as indicated. */
737 finish_do_stmt (tree cond, tree do_stmt)
739 cond = maybe_convert_cond (cond);
740 DO_COND (do_stmt) = cond;
744 /* Finish a return-statement. The EXPRESSION returned, if any, is as
748 finish_return_stmt (tree expr)
753 expr = check_return_expr (expr, &no_warning);
755 if (flag_openmp && !check_omp_return ())
756 return error_mark_node;
757 if (!processing_template_decl)
759 if (DECL_DESTRUCTOR_P (current_function_decl)
760 || (DECL_CONSTRUCTOR_P (current_function_decl)
761 && targetm.cxx.cdtor_returns_this ()))
763 /* Similarly, all destructors must run destructors for
764 base-classes before returning. So, all returns in a
765 destructor get sent to the DTOR_LABEL; finish_function emits
766 code to return a value there. */
767 return finish_goto_stmt (cdtor_label);
771 r = build_stmt (RETURN_EXPR, expr);
772 TREE_NO_WARNING (r) |= no_warning;
773 r = maybe_cleanup_point_expr_void (r);
780 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
783 begin_for_stmt (void)
787 r = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE,
788 NULL_TREE, NULL_TREE);
790 if (flag_new_for_scope > 0)
791 TREE_CHAIN (r) = do_pushlevel (sk_for);
793 if (processing_template_decl)
794 FOR_INIT_STMT (r) = push_stmt_list ();
799 /* Finish the for-init-statement of a for-statement, which may be
800 given by FOR_STMT. */
803 finish_for_init_stmt (tree for_stmt)
805 if (processing_template_decl)
806 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
808 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
809 begin_cond (&FOR_COND (for_stmt));
812 /* Finish the COND of a for-statement, which may be given by
816 finish_for_cond (tree cond, tree for_stmt)
818 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
819 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
822 /* Finish the increment-EXPRESSION in a for-statement, which may be
823 given by FOR_STMT. */
826 finish_for_expr (tree expr, tree for_stmt)
830 /* If EXPR is an overloaded function, issue an error; there is no
831 context available to use to perform overload resolution. */
832 if (type_unknown_p (expr))
834 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
835 expr = error_mark_node;
837 if (!processing_template_decl)
839 if (warn_sequence_point)
840 verify_sequence_points (expr);
841 expr = convert_to_void (expr, "3rd expression in for");
843 else if (!type_dependent_expression_p (expr))
844 convert_to_void (build_non_dependent_expr (expr), "3rd expression in for");
845 expr = maybe_cleanup_point_expr_void (expr);
846 FOR_EXPR (for_stmt) = expr;
849 /* Finish the body of a for-statement, which may be given by
850 FOR_STMT. The increment-EXPR for the loop must be
854 finish_for_stmt (tree for_stmt)
856 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
858 /* Pop the scope for the body of the loop. */
859 if (flag_new_for_scope > 0)
861 tree scope = TREE_CHAIN (for_stmt);
862 TREE_CHAIN (for_stmt) = NULL;
863 add_stmt (do_poplevel (scope));
869 /* Finish a break-statement. */
872 finish_break_stmt (void)
874 return add_stmt (build_stmt (BREAK_STMT));
877 /* Finish a continue-statement. */
880 finish_continue_stmt (void)
882 return add_stmt (build_stmt (CONTINUE_STMT));
885 /* Begin a switch-statement. Returns a new SWITCH_STMT if
889 begin_switch_stmt (void)
893 r = build_stmt (SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
895 scope = do_pushlevel (sk_block);
896 TREE_CHAIN (r) = scope;
897 begin_cond (&SWITCH_STMT_COND (r));
902 /* Finish the cond of a switch-statement. */
905 finish_switch_cond (tree cond, tree switch_stmt)
907 tree orig_type = NULL;
908 if (!processing_template_decl)
912 /* Convert the condition to an integer or enumeration type. */
913 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
914 if (cond == NULL_TREE)
916 error ("switch quantity not an integer");
917 cond = error_mark_node;
919 orig_type = TREE_TYPE (cond);
920 if (cond != error_mark_node)
924 Integral promotions are performed. */
925 cond = perform_integral_promotions (cond);
926 cond = maybe_cleanup_point_expr (cond);
929 if (cond != error_mark_node)
931 index = get_unwidened (cond, NULL_TREE);
932 /* We can't strip a conversion from a signed type to an unsigned,
933 because if we did, int_fits_type_p would do the wrong thing
934 when checking case values for being in range,
935 and it's too hard to do the right thing. */
936 if (TYPE_UNSIGNED (TREE_TYPE (cond))
937 == TYPE_UNSIGNED (TREE_TYPE (index)))
941 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
942 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
943 add_stmt (switch_stmt);
944 push_switch (switch_stmt);
945 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
948 /* Finish the body of a switch-statement, which may be given by
949 SWITCH_STMT. The COND to switch on is indicated. */
952 finish_switch_stmt (tree switch_stmt)
956 SWITCH_STMT_BODY (switch_stmt) =
957 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
961 scope = TREE_CHAIN (switch_stmt);
962 TREE_CHAIN (switch_stmt) = NULL;
963 add_stmt (do_poplevel (scope));
966 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
970 begin_try_block (void)
972 tree r = build_stmt (TRY_BLOCK, NULL_TREE, NULL_TREE);
974 TRY_STMTS (r) = push_stmt_list ();
978 /* Likewise, for a function-try-block. */
981 begin_function_try_block (void)
983 tree r = begin_try_block ();
984 FN_TRY_BLOCK_P (r) = 1;
988 /* Finish a try-block, which may be given by TRY_BLOCK. */
991 finish_try_block (tree try_block)
993 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
994 TRY_HANDLERS (try_block) = push_stmt_list ();
997 /* Finish the body of a cleanup try-block, which may be given by
1001 finish_cleanup_try_block (tree try_block)
1003 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1006 /* Finish an implicitly generated try-block, with a cleanup is given
1010 finish_cleanup (tree cleanup, tree try_block)
1012 TRY_HANDLERS (try_block) = cleanup;
1013 CLEANUP_P (try_block) = 1;
1016 /* Likewise, for a function-try-block. */
1019 finish_function_try_block (tree try_block)
1021 finish_try_block (try_block);
1022 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1023 the try block, but moving it inside. */
1024 in_function_try_handler = 1;
1027 /* Finish a handler-sequence for a try-block, which may be given by
1031 finish_handler_sequence (tree try_block)
1033 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1034 check_handlers (TRY_HANDLERS (try_block));
1037 /* Likewise, for a function-try-block. */
1040 finish_function_handler_sequence (tree try_block)
1042 in_function_try_handler = 0;
1043 finish_handler_sequence (try_block);
1046 /* Begin a handler. Returns a HANDLER if appropriate. */
1049 begin_handler (void)
1053 r = build_stmt (HANDLER, NULL_TREE, NULL_TREE);
1056 /* Create a binding level for the eh_info and the exception object
1058 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1063 /* Finish the handler-parameters for a handler, which may be given by
1064 HANDLER. DECL is the declaration for the catch parameter, or NULL
1065 if this is a `catch (...)' clause. */
1068 finish_handler_parms (tree decl, tree handler)
1070 tree type = NULL_TREE;
1071 if (processing_template_decl)
1075 decl = pushdecl (decl);
1076 decl = push_template_decl (decl);
1077 HANDLER_PARMS (handler) = decl;
1078 type = TREE_TYPE (decl);
1082 type = expand_start_catch_block (decl);
1084 HANDLER_TYPE (handler) = type;
1085 if (!processing_template_decl && type)
1086 mark_used (eh_type_info (type));
1089 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1090 the return value from the matching call to finish_handler_parms. */
1093 finish_handler (tree handler)
1095 if (!processing_template_decl)
1096 expand_end_catch_block ();
1097 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1100 /* Begin a compound statement. FLAGS contains some bits that control the
1101 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1102 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1103 block of a function. If BCS_TRY_BLOCK is set, this is the block
1104 created on behalf of a TRY statement. Returns a token to be passed to
1105 finish_compound_stmt. */
1108 begin_compound_stmt (unsigned int flags)
1112 if (flags & BCS_NO_SCOPE)
1114 r = push_stmt_list ();
1115 STATEMENT_LIST_NO_SCOPE (r) = 1;
1117 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1118 But, if it's a statement-expression with a scopeless block, there's
1119 nothing to keep, and we don't want to accidentally keep a block
1120 *inside* the scopeless block. */
1121 keep_next_level (false);
1124 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1126 /* When processing a template, we need to remember where the braces were,
1127 so that we can set up identical scopes when instantiating the template
1128 later. BIND_EXPR is a handy candidate for this.
1129 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1130 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1131 processing templates. */
1132 if (processing_template_decl)
1134 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1135 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1136 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1137 TREE_SIDE_EFFECTS (r) = 1;
1143 /* Finish a compound-statement, which is given by STMT. */
1146 finish_compound_stmt (tree stmt)
1148 if (TREE_CODE (stmt) == BIND_EXPR)
1149 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1150 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1151 stmt = pop_stmt_list (stmt);
1154 /* Destroy any ObjC "super" receivers that may have been
1156 objc_clear_super_receiver ();
1158 stmt = do_poplevel (stmt);
1161 /* ??? See c_end_compound_stmt wrt statement expressions. */
1166 /* Finish an asm-statement, whose components are a STRING, some
1167 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1168 whether the asm-statement should be considered volatile. */
1171 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1172 tree input_operands, tree clobbers)
1176 int ninputs = list_length (input_operands);
1177 int noutputs = list_length (output_operands);
1179 if (!processing_template_decl)
1181 const char *constraint;
1182 const char **oconstraints;
1183 bool allows_mem, allows_reg, is_inout;
1187 oconstraints = (const char **) alloca (noutputs * sizeof (char *));
1189 string = resolve_asm_operand_names (string, output_operands,
1192 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1194 operand = TREE_VALUE (t);
1196 /* ??? Really, this should not be here. Users should be using a
1197 proper lvalue, dammit. But there's a long history of using
1198 casts in the output operands. In cases like longlong.h, this
1199 becomes a primitive form of typechecking -- if the cast can be
1200 removed, then the output operand had a type of the proper width;
1201 otherwise we'll get an error. Gross, but ... */
1202 STRIP_NOPS (operand);
1204 if (!lvalue_or_else (operand, lv_asm))
1205 operand = error_mark_node;
1207 if (operand != error_mark_node
1208 && (TREE_READONLY (operand)
1209 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1210 /* Functions are not modifiable, even though they are
1212 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1213 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1214 /* If it's an aggregate and any field is const, then it is
1215 effectively const. */
1216 || (CLASS_TYPE_P (TREE_TYPE (operand))
1217 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1218 readonly_error (operand, "assignment (via 'asm' output)", 0);
1220 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1221 oconstraints[i] = constraint;
1223 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1224 &allows_mem, &allows_reg, &is_inout))
1226 /* If the operand is going to end up in memory,
1227 mark it addressable. */
1228 if (!allows_reg && !cxx_mark_addressable (operand))
1229 operand = error_mark_node;
1232 operand = error_mark_node;
1234 TREE_VALUE (t) = operand;
1237 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1239 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1240 operand = decay_conversion (TREE_VALUE (t));
1242 /* If the type of the operand hasn't been determined (e.g.,
1243 because it involves an overloaded function), then issue
1244 an error message. There's no context available to
1245 resolve the overloading. */
1246 if (TREE_TYPE (operand) == unknown_type_node)
1248 error ("type of asm operand %qE could not be determined",
1250 operand = error_mark_node;
1253 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1254 oconstraints, &allows_mem, &allows_reg))
1256 /* If the operand is going to end up in memory,
1257 mark it addressable. */
1258 if (!allows_reg && allows_mem)
1260 /* Strip the nops as we allow this case. FIXME, this really
1261 should be rejected or made deprecated. */
1262 STRIP_NOPS (operand);
1263 if (!cxx_mark_addressable (operand))
1264 operand = error_mark_node;
1268 operand = error_mark_node;
1270 TREE_VALUE (t) = operand;
1274 r = build_stmt (ASM_EXPR, string,
1275 output_operands, input_operands,
1277 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1278 r = maybe_cleanup_point_expr_void (r);
1279 return add_stmt (r);
1282 /* Finish a label with the indicated NAME. */
1285 finish_label_stmt (tree name)
1287 tree decl = define_label (input_location, name);
1288 return add_stmt (build_stmt (LABEL_EXPR, decl));
1291 /* Finish a series of declarations for local labels. G++ allows users
1292 to declare "local" labels, i.e., labels with scope. This extension
1293 is useful when writing code involving statement-expressions. */
1296 finish_label_decl (tree name)
1298 tree decl = declare_local_label (name);
1299 add_decl_expr (decl);
1302 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1305 finish_decl_cleanup (tree decl, tree cleanup)
1307 push_cleanup (decl, cleanup, false);
1310 /* If the current scope exits with an exception, run CLEANUP. */
1313 finish_eh_cleanup (tree cleanup)
1315 push_cleanup (NULL, cleanup, true);
1318 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1319 order they were written by the user. Each node is as for
1320 emit_mem_initializers. */
1323 finish_mem_initializers (tree mem_inits)
1325 /* Reorder the MEM_INITS so that they are in the order they appeared
1326 in the source program. */
1327 mem_inits = nreverse (mem_inits);
1329 if (processing_template_decl)
1330 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1332 emit_mem_initializers (mem_inits);
1335 /* Finish a parenthesized expression EXPR. */
1338 finish_parenthesized_expr (tree expr)
1341 /* This inhibits warnings in c_common_truthvalue_conversion. */
1342 TREE_NO_WARNING (expr) = 1;
1344 if (TREE_CODE (expr) == OFFSET_REF)
1345 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1346 enclosed in parentheses. */
1347 PTRMEM_OK_P (expr) = 0;
1349 if (TREE_CODE (expr) == STRING_CST)
1350 PAREN_STRING_LITERAL_P (expr) = 1;
1355 /* Finish a reference to a non-static data member (DECL) that is not
1356 preceded by `.' or `->'. */
1359 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1361 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1365 if (current_function_decl
1366 && DECL_STATIC_FUNCTION_P (current_function_decl))
1367 error ("invalid use of member %q+D in static member function", decl);
1369 error ("invalid use of non-static data member %q+D", decl);
1370 error ("from this location");
1372 return error_mark_node;
1374 TREE_USED (current_class_ptr) = 1;
1375 if (processing_template_decl && !qualifying_scope)
1377 tree type = TREE_TYPE (decl);
1379 if (TREE_CODE (type) == REFERENCE_TYPE)
1380 type = TREE_TYPE (type);
1383 /* Set the cv qualifiers. */
1384 int quals = cp_type_quals (TREE_TYPE (current_class_ref));
1386 if (DECL_MUTABLE_P (decl))
1387 quals &= ~TYPE_QUAL_CONST;
1389 quals |= cp_type_quals (TREE_TYPE (decl));
1390 type = cp_build_qualified_type (type, quals);
1393 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1397 tree access_type = TREE_TYPE (object);
1398 tree lookup_context = context_for_name_lookup (decl);
1400 while (!DERIVED_FROM_P (lookup_context, access_type))
1402 access_type = TYPE_CONTEXT (access_type);
1403 while (access_type && DECL_P (access_type))
1404 access_type = DECL_CONTEXT (access_type);
1408 error ("object missing in reference to %q+D", decl);
1409 error ("from this location");
1410 return error_mark_node;
1414 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1415 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1417 if (processing_template_decl)
1418 return build_qualified_name (TREE_TYPE (decl),
1421 /*template_p=*/false);
1423 perform_or_defer_access_check (TYPE_BINFO (access_type), decl);
1425 /* If the data member was named `C::M', convert `*this' to `C'
1427 if (qualifying_scope)
1429 tree binfo = NULL_TREE;
1430 object = build_scoped_ref (object, qualifying_scope,
1434 return build_class_member_access_expr (object, decl,
1435 /*access_path=*/NULL_TREE,
1436 /*preserve_reference=*/false);
1440 /* DECL was the declaration to which a qualified-id resolved. Issue
1441 an error message if it is not accessible. If OBJECT_TYPE is
1442 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1443 type of `*x', or `x', respectively. If the DECL was named as
1444 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1447 check_accessibility_of_qualified_id (tree decl,
1449 tree nested_name_specifier)
1452 tree qualifying_type = NULL_TREE;
1454 /* If we're not checking, return immediately. */
1455 if (deferred_access_no_check)
1458 /* Determine the SCOPE of DECL. */
1459 scope = context_for_name_lookup (decl);
1460 /* If the SCOPE is not a type, then DECL is not a member. */
1461 if (!TYPE_P (scope))
1463 /* Compute the scope through which DECL is being accessed. */
1465 /* OBJECT_TYPE might not be a class type; consider:
1467 class A { typedef int I; };
1471 In this case, we will have "A::I" as the DECL, but "I" as the
1473 && CLASS_TYPE_P (object_type)
1474 && DERIVED_FROM_P (scope, object_type))
1475 /* If we are processing a `->' or `.' expression, use the type of the
1477 qualifying_type = object_type;
1478 else if (nested_name_specifier)
1480 /* If the reference is to a non-static member of the
1481 current class, treat it as if it were referenced through
1483 if (DECL_NONSTATIC_MEMBER_P (decl)
1484 && current_class_ptr
1485 && DERIVED_FROM_P (scope, current_class_type))
1486 qualifying_type = current_class_type;
1487 /* Otherwise, use the type indicated by the
1488 nested-name-specifier. */
1490 qualifying_type = nested_name_specifier;
1493 /* Otherwise, the name must be from the current class or one of
1495 qualifying_type = currently_open_derived_class (scope);
1497 if (qualifying_type && IS_AGGR_TYPE_CODE (TREE_CODE (qualifying_type)))
1498 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1499 or similar in a default argument value. */
1500 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl);
1503 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1504 class named to the left of the "::" operator. DONE is true if this
1505 expression is a complete postfix-expression; it is false if this
1506 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1507 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1508 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1509 is true iff this qualified name appears as a template argument. */
1512 finish_qualified_id_expr (tree qualifying_class,
1517 bool template_arg_p)
1519 gcc_assert (TYPE_P (qualifying_class));
1521 if (error_operand_p (expr))
1522 return error_mark_node;
1524 if (DECL_P (expr) || BASELINK_P (expr))
1528 check_template_keyword (expr);
1530 /* If EXPR occurs as the operand of '&', use special handling that
1531 permits a pointer-to-member. */
1532 if (address_p && done)
1534 if (TREE_CODE (expr) == SCOPE_REF)
1535 expr = TREE_OPERAND (expr, 1);
1536 expr = build_offset_ref (qualifying_class, expr,
1537 /*address_p=*/true);
1541 /* Within the scope of a class, turn references to non-static
1542 members into expression of the form "this->...". */
1544 /* But, within a template argument, we do not want make the
1545 transformation, as there is no "this" pointer. */
1547 else if (TREE_CODE (expr) == FIELD_DECL)
1548 expr = finish_non_static_data_member (expr, current_class_ref,
1550 else if (BASELINK_P (expr) && !processing_template_decl)
1554 /* See if any of the functions are non-static members. */
1555 fns = BASELINK_FUNCTIONS (expr);
1556 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1557 fns = TREE_OPERAND (fns, 0);
1558 /* If so, the expression may be relative to the current
1560 if (!shared_member_p (fns)
1561 && current_class_type
1562 && DERIVED_FROM_P (qualifying_class, current_class_type))
1563 expr = (build_class_member_access_expr
1564 (maybe_dummy_object (qualifying_class, NULL),
1566 BASELINK_ACCESS_BINFO (expr),
1567 /*preserve_reference=*/false));
1569 /* The expression is a qualified name whose address is not
1571 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1577 /* Begin a statement-expression. The value returned must be passed to
1578 finish_stmt_expr. */
1581 begin_stmt_expr (void)
1583 return push_stmt_list ();
1586 /* Process the final expression of a statement expression. EXPR can be
1587 NULL, if the final expression is empty. Return a STATEMENT_LIST
1588 containing all the statements in the statement-expression, or
1589 ERROR_MARK_NODE if there was an error. */
1592 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1594 if (error_operand_p (expr))
1595 return error_mark_node;
1597 /* If the last statement does not have "void" type, then the value
1598 of the last statement is the value of the entire expression. */
1602 type = TREE_TYPE (expr);
1603 if (!dependent_type_p (type) && !VOID_TYPE_P (type))
1605 expr = decay_conversion (expr);
1606 if (error_operand_p (expr))
1607 return error_mark_node;
1608 type = TREE_TYPE (expr);
1610 /* The type of the statement-expression is the type of the last
1612 TREE_TYPE (stmt_expr) = type;
1613 /* We must take particular care if TYPE is a class type. In
1614 particular if EXPR creates a temporary of class type, then it
1615 must be destroyed at the semicolon terminating the last
1616 statement -- but we must make a copy before that happens.
1618 This problem is solved by using a TARGET_EXPR to initialize a
1619 new temporary variable. The TARGET_EXPR itself is placed
1620 outside the statement-expression. However, the last
1621 statement in the statement-expression is transformed from
1622 EXPR to (approximately) T = EXPR, where T is the new
1623 temporary variable. Thus, the lifetime of the new temporary
1624 extends to the full-expression surrounding the
1625 statement-expression. */
1626 if (!processing_template_decl && !VOID_TYPE_P (type))
1629 if (CLASS_TYPE_P (type)
1630 && !TYPE_HAS_TRIVIAL_INIT_REF (type))
1632 target_expr = build_target_expr_with_type (expr, type);
1633 expr = TARGET_EXPR_INITIAL (target_expr);
1637 /* Normally, build_target_expr will not create a
1638 TARGET_EXPR for scalars. However, we need the
1639 temporary here, in order to solve the scoping
1640 problem described above. */
1641 target_expr = force_target_expr (type, expr);
1642 expr = TARGET_EXPR_INITIAL (target_expr);
1643 expr = build2 (INIT_EXPR,
1645 TARGET_EXPR_SLOT (target_expr),
1648 TARGET_EXPR_INITIAL (target_expr) = NULL_TREE;
1649 /* Save away the TARGET_EXPR in the TREE_TYPE field of the
1650 STATEMENT_EXPR. We will retrieve it in
1651 finish_stmt_expr. */
1652 TREE_TYPE (stmt_expr) = target_expr;
1656 /* Having modified EXPR to reflect the extra initialization, we now
1657 treat it just like an ordinary statement. */
1658 expr = finish_expr_stmt (expr);
1660 /* Mark the last statement so that we can recognize it as such at
1661 template-instantiation time. */
1662 if (expr && processing_template_decl)
1663 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1668 /* Finish a statement-expression. EXPR should be the value returned
1669 by the previous begin_stmt_expr. Returns an expression
1670 representing the statement-expression. */
1673 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1678 if (error_operand_p (stmt_expr))
1679 return error_mark_node;
1681 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1683 type = TREE_TYPE (stmt_expr);
1684 result = pop_stmt_list (stmt_expr);
1686 if (processing_template_decl)
1688 result = build_min (STMT_EXPR, type, result);
1689 TREE_SIDE_EFFECTS (result) = 1;
1690 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1692 else if (!TYPE_P (type))
1694 gcc_assert (TREE_CODE (type) == TARGET_EXPR);
1695 TARGET_EXPR_INITIAL (type) = result;
1696 TREE_TYPE (result) = void_type_node;
1703 /* Perform Koenig lookup. FN is the postfix-expression representing
1704 the function (or functions) to call; ARGS are the arguments to the
1705 call. Returns the functions to be considered by overload
1709 perform_koenig_lookup (tree fn, tree args)
1711 tree identifier = NULL_TREE;
1712 tree functions = NULL_TREE;
1714 /* Find the name of the overloaded function. */
1715 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1717 else if (is_overloaded_fn (fn))
1720 identifier = DECL_NAME (get_first_fn (functions));
1722 else if (DECL_P (fn))
1725 identifier = DECL_NAME (fn);
1728 /* A call to a namespace-scope function using an unqualified name.
1730 Do Koenig lookup -- unless any of the arguments are
1732 if (!any_type_dependent_arguments_p (args))
1734 fn = lookup_arg_dependent (identifier, functions, args);
1736 /* The unqualified name could not be resolved. */
1737 fn = unqualified_fn_lookup_error (identifier);
1743 /* Generate an expression for `FN (ARGS)'.
1745 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1746 as a virtual call, even if FN is virtual. (This flag is set when
1747 encountering an expression where the function name is explicitly
1748 qualified. For example a call to `X::f' never generates a virtual
1751 Returns code for the call. */
1754 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p)
1760 if (fn == error_mark_node || args == error_mark_node)
1761 return error_mark_node;
1763 /* ARGS should be a list of arguments. */
1764 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1769 if (processing_template_decl)
1771 if (type_dependent_expression_p (fn)
1772 || any_type_dependent_arguments_p (args))
1774 result = build_nt (CALL_EXPR, fn, args, NULL_TREE);
1775 KOENIG_LOOKUP_P (result) = koenig_p;
1778 if (!BASELINK_P (fn)
1779 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1780 && TREE_TYPE (fn) != unknown_type_node)
1781 fn = build_non_dependent_expr (fn);
1782 args = build_non_dependent_args (orig_args);
1785 /* A reference to a member function will appear as an overloaded
1786 function (rather than a BASELINK) if an unqualified name was used
1788 if (!BASELINK_P (fn) && is_overloaded_fn (fn))
1792 if (TREE_CODE (f) == TEMPLATE_ID_EXPR)
1793 f = TREE_OPERAND (f, 0);
1794 f = get_first_fn (f);
1795 if (DECL_FUNCTION_MEMBER_P (f))
1797 tree type = currently_open_derived_class (DECL_CONTEXT (f));
1799 type = DECL_CONTEXT (f);
1800 fn = build_baselink (TYPE_BINFO (type),
1802 fn, /*optype=*/NULL_TREE);
1807 if (BASELINK_P (fn))
1811 /* A call to a member function. From [over.call.func]:
1813 If the keyword this is in scope and refers to the class of
1814 that member function, or a derived class thereof, then the
1815 function call is transformed into a qualified function call
1816 using (*this) as the postfix-expression to the left of the
1817 . operator.... [Otherwise] a contrived object of type T
1818 becomes the implied object argument.
1820 This paragraph is unclear about this situation:
1822 struct A { void f(); };
1823 struct B : public A {};
1824 struct C : public A { void g() { B::f(); }};
1826 In particular, for `B::f', this paragraph does not make clear
1827 whether "the class of that member function" refers to `A' or
1828 to `B'. We believe it refers to `B'. */
1829 if (current_class_type
1830 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1832 && current_class_ref)
1833 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1837 tree representative_fn;
1839 representative_fn = BASELINK_FUNCTIONS (fn);
1840 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1841 representative_fn = TREE_OPERAND (representative_fn, 0);
1842 representative_fn = get_first_fn (representative_fn);
1843 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1846 if (processing_template_decl)
1848 if (type_dependent_expression_p (object))
1849 return build_nt (CALL_EXPR, orig_fn, orig_args, NULL_TREE);
1850 object = build_non_dependent_expr (object);
1853 result = build_new_method_call (object, fn, args, NULL_TREE,
1855 ? LOOKUP_NONVIRTUAL : 0),
1858 else if (is_overloaded_fn (fn))
1860 /* If the function is an overloaded builtin, resolve it. */
1861 if (TREE_CODE (fn) == FUNCTION_DECL
1862 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
1863 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
1864 result = resolve_overloaded_builtin (fn, args);
1867 /* A call to a namespace-scope function. */
1868 result = build_new_function_call (fn, args, koenig_p);
1870 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1873 error ("arguments to destructor are not allowed");
1874 /* Mark the pseudo-destructor call as having side-effects so
1875 that we do not issue warnings about its use. */
1876 result = build1 (NOP_EXPR,
1878 TREE_OPERAND (fn, 0));
1879 TREE_SIDE_EFFECTS (result) = 1;
1881 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1882 /* If the "function" is really an object of class type, it might
1883 have an overloaded `operator ()'. */
1884 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1885 /*overloaded_p=*/NULL);
1888 /* A call where the function is unknown. */
1889 result = build_function_call (fn, args);
1891 if (processing_template_decl)
1893 result = build3 (CALL_EXPR, TREE_TYPE (result), orig_fn,
1894 orig_args, NULL_TREE);
1895 KOENIG_LOOKUP_P (result) = koenig_p;
1900 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1901 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1902 POSTDECREMENT_EXPR.) */
1905 finish_increment_expr (tree expr, enum tree_code code)
1907 return build_x_unary_op (code, expr);
1910 /* Finish a use of `this'. Returns an expression for `this'. */
1913 finish_this_expr (void)
1917 if (current_class_ptr)
1919 result = current_class_ptr;
1921 else if (current_function_decl
1922 && DECL_STATIC_FUNCTION_P (current_function_decl))
1924 error ("%<this%> is unavailable for static member functions");
1925 result = error_mark_node;
1929 if (current_function_decl)
1930 error ("invalid use of %<this%> in non-member function");
1932 error ("invalid use of %<this%> at top level");
1933 result = error_mark_node;
1939 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
1940 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
1941 the TYPE for the type given. If SCOPE is non-NULL, the expression
1942 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
1945 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
1947 if (destructor == error_mark_node)
1948 return error_mark_node;
1950 gcc_assert (TYPE_P (destructor));
1952 if (!processing_template_decl)
1954 if (scope == error_mark_node)
1956 error ("invalid qualifying scope in pseudo-destructor name");
1957 return error_mark_node;
1960 /* [expr.pseudo] says both:
1962 The type designated by the pseudo-destructor-name shall be
1963 the same as the object type.
1967 The cv-unqualified versions of the object type and of the
1968 type designated by the pseudo-destructor-name shall be the
1971 We implement the more generous second sentence, since that is
1972 what most other compilers do. */
1973 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
1976 error ("%qE is not of type %qT", object, destructor);
1977 return error_mark_node;
1981 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
1984 /* Finish an expression of the form CODE EXPR. */
1987 finish_unary_op_expr (enum tree_code code, tree expr)
1989 tree result = build_x_unary_op (code, expr);
1990 /* Inside a template, build_x_unary_op does not fold the
1991 expression. So check whether the result is folded before
1992 setting TREE_NEGATED_INT. */
1993 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
1994 && TREE_CODE (result) == INTEGER_CST
1995 && !TYPE_UNSIGNED (TREE_TYPE (result))
1996 && INT_CST_LT (result, integer_zero_node))
1998 /* RESULT may be a cached INTEGER_CST, so we must copy it before
1999 setting TREE_NEGATED_INT. */
2000 result = copy_node (result);
2001 TREE_NEGATED_INT (result) = 1;
2003 overflow_warning (result);
2007 /* Finish a compound-literal expression. TYPE is the type to which
2008 the INITIALIZER_LIST is being cast. */
2011 finish_compound_literal (tree type, VEC(constructor_elt,gc) *initializer_list)
2013 tree compound_literal;
2015 /* Build a CONSTRUCTOR for the INITIALIZER_LIST. */
2016 compound_literal = build_constructor (NULL_TREE, initializer_list);
2017 if (processing_template_decl)
2018 TREE_TYPE (compound_literal) = type;
2021 /* Check the initialization. */
2022 compound_literal = reshape_init (type, compound_literal);
2023 compound_literal = digest_init (type, compound_literal);
2024 /* If the TYPE was an array type with an unknown bound, then we can
2025 figure out the dimension now. For example, something like:
2029 implies that the array has two elements. */
2030 if (TREE_CODE (type) == ARRAY_TYPE && !COMPLETE_TYPE_P (type))
2031 cp_complete_array_type (&TREE_TYPE (compound_literal),
2032 compound_literal, 1);
2035 /* Mark it as a compound-literal. */
2036 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2038 return compound_literal;
2041 /* Return the declaration for the function-name variable indicated by
2045 finish_fname (tree id)
2049 decl = fname_decl (C_RID_CODE (id), id);
2050 if (processing_template_decl)
2051 decl = DECL_NAME (decl);
2055 /* Finish a translation unit. */
2058 finish_translation_unit (void)
2060 /* In case there were missing closebraces,
2061 get us back to the global binding level. */
2063 while (current_namespace != global_namespace)
2066 /* Do file scope __FUNCTION__ et al. */
2067 finish_fname_decls ();
2070 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2071 Returns the parameter. */
2074 finish_template_type_parm (tree aggr, tree identifier)
2076 if (aggr != class_type_node)
2078 pedwarn ("template type parameters must use the keyword %<class%> or %<typename%>");
2079 aggr = class_type_node;
2082 return build_tree_list (aggr, identifier);
2085 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2086 Returns the parameter. */
2089 finish_template_template_parm (tree aggr, tree identifier)
2091 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2092 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2093 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2094 DECL_TEMPLATE_RESULT (tmpl) = decl;
2095 DECL_ARTIFICIAL (decl) = 1;
2096 end_template_decl ();
2098 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2100 return finish_template_type_parm (aggr, tmpl);
2103 /* ARGUMENT is the default-argument value for a template template
2104 parameter. If ARGUMENT is invalid, issue error messages and return
2105 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2108 check_template_template_default_arg (tree argument)
2110 if (TREE_CODE (argument) != TEMPLATE_DECL
2111 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2112 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2114 if (TREE_CODE (argument) == TYPE_DECL)
2116 tree t = TREE_TYPE (argument);
2118 /* Try to emit a slightly smarter error message if we detect
2119 that the user is using a template instantiation. */
2120 if (CLASSTYPE_TEMPLATE_INFO (t)
2121 && CLASSTYPE_TEMPLATE_INSTANTIATION (t))
2122 error ("invalid use of type %qT as a default value for a "
2123 "template template-parameter", t);
2125 error ("invalid use of %qD as a default value for a template "
2126 "template-parameter", argument);
2129 error ("invalid default argument for a template template parameter");
2130 return error_mark_node;
2136 /* Begin a class definition, as indicated by T. */
2139 begin_class_definition (tree t)
2141 if (t == error_mark_node)
2142 return error_mark_node;
2144 if (processing_template_parmlist)
2146 error ("definition of %q#T inside template parameter list", t);
2147 return error_mark_node;
2149 /* A non-implicit typename comes from code like:
2151 template <typename T> struct A {
2152 template <typename U> struct A<T>::B ...
2154 This is erroneous. */
2155 else if (TREE_CODE (t) == TYPENAME_TYPE)
2157 error ("invalid definition of qualified type %qT", t);
2158 t = error_mark_node;
2161 if (t == error_mark_node || ! IS_AGGR_TYPE (t))
2163 t = make_aggr_type (RECORD_TYPE);
2164 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2167 /* Update the location of the decl. */
2168 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2170 if (TYPE_BEING_DEFINED (t))
2172 t = make_aggr_type (TREE_CODE (t));
2173 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2175 maybe_process_partial_specialization (t);
2177 TYPE_BEING_DEFINED (t) = 1;
2178 if (flag_pack_struct)
2181 TYPE_PACKED (t) = 1;
2182 /* Even though the type is being defined for the first time
2183 here, there might have been a forward declaration, so there
2184 might be cv-qualified variants of T. */
2185 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2186 TYPE_PACKED (v) = 1;
2188 /* Reset the interface data, at the earliest possible
2189 moment, as it might have been set via a class foo;
2191 if (! TYPE_ANONYMOUS_P (t))
2193 struct c_fileinfo *finfo = get_fileinfo (lbasename (input_filename));
2194 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2195 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2196 (t, finfo->interface_unknown);
2198 reset_specialization();
2200 /* Make a declaration for this class in its own scope. */
2201 build_self_reference ();
2206 /* Finish the member declaration given by DECL. */
2209 finish_member_declaration (tree decl)
2211 if (decl == error_mark_node || decl == NULL_TREE)
2214 if (decl == void_type_node)
2215 /* The COMPONENT was a friend, not a member, and so there's
2216 nothing for us to do. */
2219 /* We should see only one DECL at a time. */
2220 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2222 /* Set up access control for DECL. */
2224 = (current_access_specifier == access_private_node);
2225 TREE_PROTECTED (decl)
2226 = (current_access_specifier == access_protected_node);
2227 if (TREE_CODE (decl) == TEMPLATE_DECL)
2229 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2230 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2233 /* Mark the DECL as a member of the current class. */
2234 DECL_CONTEXT (decl) = current_class_type;
2238 A C language linkage is ignored for the names of class members
2239 and the member function type of class member functions. */
2240 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2241 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2243 /* Put functions on the TYPE_METHODS list and everything else on the
2244 TYPE_FIELDS list. Note that these are built up in reverse order.
2245 We reverse them (to obtain declaration order) in finish_struct. */
2246 if (TREE_CODE (decl) == FUNCTION_DECL
2247 || DECL_FUNCTION_TEMPLATE_P (decl))
2249 /* We also need to add this function to the
2250 CLASSTYPE_METHOD_VEC. */
2251 if (add_method (current_class_type, decl, NULL_TREE))
2253 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2254 TYPE_METHODS (current_class_type) = decl;
2256 maybe_add_class_template_decl_list (current_class_type, decl,
2260 /* Enter the DECL into the scope of the class. */
2261 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2262 || pushdecl_class_level (decl))
2264 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2265 go at the beginning. The reason is that lookup_field_1
2266 searches the list in order, and we want a field name to
2267 override a type name so that the "struct stat hack" will
2268 work. In particular:
2270 struct S { enum E { }; int E } s;
2273 is valid. In addition, the FIELD_DECLs must be maintained in
2274 declaration order so that class layout works as expected.
2275 However, we don't need that order until class layout, so we
2276 save a little time by putting FIELD_DECLs on in reverse order
2277 here, and then reversing them in finish_struct_1. (We could
2278 also keep a pointer to the correct insertion points in the
2281 if (TREE_CODE (decl) == TYPE_DECL)
2282 TYPE_FIELDS (current_class_type)
2283 = chainon (TYPE_FIELDS (current_class_type), decl);
2286 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2287 TYPE_FIELDS (current_class_type) = decl;
2290 maybe_add_class_template_decl_list (current_class_type, decl,
2295 note_decl_for_pch (decl);
2298 /* DECL has been declared while we are building a PCH file. Perform
2299 actions that we might normally undertake lazily, but which can be
2300 performed now so that they do not have to be performed in
2301 translation units which include the PCH file. */
2304 note_decl_for_pch (tree decl)
2306 gcc_assert (pch_file);
2308 /* There's a good chance that we'll have to mangle names at some
2309 point, even if only for emission in debugging information. */
2310 if (TREE_CODE (decl) == VAR_DECL
2311 || TREE_CODE (decl) == FUNCTION_DECL)
2315 /* Finish processing a complete template declaration. The PARMS are
2316 the template parameters. */
2319 finish_template_decl (tree parms)
2322 end_template_decl ();
2324 end_specialization ();
2327 /* Finish processing a template-id (which names a type) of the form
2328 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2329 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2330 the scope of template-id indicated. */
2333 finish_template_type (tree name, tree args, int entering_scope)
2337 decl = lookup_template_class (name, args,
2338 NULL_TREE, NULL_TREE, entering_scope,
2339 tf_warning_or_error | tf_user);
2340 if (decl != error_mark_node)
2341 decl = TYPE_STUB_DECL (decl);
2346 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2347 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2348 BASE_CLASS, or NULL_TREE if an error occurred. The
2349 ACCESS_SPECIFIER is one of
2350 access_{default,public,protected_private}_node. For a virtual base
2351 we set TREE_TYPE. */
2354 finish_base_specifier (tree base, tree access, bool virtual_p)
2358 if (base == error_mark_node)
2360 error ("invalid base-class specification");
2363 else if (! is_aggr_type (base, 1))
2367 if (cp_type_quals (base) != 0)
2369 error ("base class %qT has cv qualifiers", base);
2370 base = TYPE_MAIN_VARIANT (base);
2372 result = build_tree_list (access, base);
2374 TREE_TYPE (result) = integer_type_node;
2380 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2381 what we found when we tried to do the lookup. */
2384 qualified_name_lookup_error (tree scope, tree name, tree decl)
2386 if (scope == error_mark_node)
2387 ; /* We already complained. */
2388 else if (TYPE_P (scope))
2390 if (!COMPLETE_TYPE_P (scope))
2391 error ("incomplete type %qT used in nested name specifier", scope);
2392 else if (TREE_CODE (decl) == TREE_LIST)
2394 error ("reference to %<%T::%D%> is ambiguous", scope, name);
2395 print_candidates (decl);
2398 error ("%qD is not a member of %qT", name, scope);
2400 else if (scope != global_namespace)
2401 error ("%qD is not a member of %qD", name, scope);
2403 error ("%<::%D%> has not been declared", name);
2406 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2407 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2408 if non-NULL, is the type or namespace used to explicitly qualify
2409 ID_EXPRESSION. DECL is the entity to which that name has been
2412 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2413 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2414 be set to true if this expression isn't permitted in a
2415 constant-expression, but it is otherwise not set by this function.
2416 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2417 constant-expression, but a non-constant expression is also
2420 DONE is true if this expression is a complete postfix-expression;
2421 it is false if this expression is followed by '->', '[', '(', etc.
2422 ADDRESS_P is true iff this expression is the operand of '&'.
2423 TEMPLATE_P is true iff the qualified-id was of the form
2424 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2425 appears as a template argument.
2427 If an error occurs, and it is the kind of error that might cause
2428 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2429 is the caller's responsibility to issue the message. *ERROR_MSG
2430 will be a string with static storage duration, so the caller need
2433 Return an expression for the entity, after issuing appropriate
2434 diagnostics. This function is also responsible for transforming a
2435 reference to a non-static member into a COMPONENT_REF that makes
2436 the use of "this" explicit.
2438 Upon return, *IDK will be filled in appropriately. */
2441 finish_id_expression (tree id_expression,
2445 bool integral_constant_expression_p,
2446 bool allow_non_integral_constant_expression_p,
2447 bool *non_integral_constant_expression_p,
2451 bool template_arg_p,
2452 const char **error_msg)
2454 /* Initialize the output parameters. */
2455 *idk = CP_ID_KIND_NONE;
2458 if (id_expression == error_mark_node)
2459 return error_mark_node;
2460 /* If we have a template-id, then no further lookup is
2461 required. If the template-id was for a template-class, we
2462 will sometimes have a TYPE_DECL at this point. */
2463 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2464 || TREE_CODE (decl) == TYPE_DECL)
2466 /* Look up the name. */
2469 if (decl == error_mark_node)
2471 /* Name lookup failed. */
2474 || (!dependent_type_p (scope)
2475 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2476 && IDENTIFIER_TYPENAME_P (id_expression)
2477 && dependent_type_p (TREE_TYPE (id_expression))))))
2479 /* If the qualifying type is non-dependent (and the name
2480 does not name a conversion operator to a dependent
2481 type), issue an error. */
2482 qualified_name_lookup_error (scope, id_expression, decl);
2483 return error_mark_node;
2487 /* It may be resolved via Koenig lookup. */
2488 *idk = CP_ID_KIND_UNQUALIFIED;
2489 return id_expression;
2492 decl = id_expression;
2494 /* If DECL is a variable that would be out of scope under
2495 ANSI/ISO rules, but in scope in the ARM, name lookup
2496 will succeed. Issue a diagnostic here. */
2498 decl = check_for_out_of_scope_variable (decl);
2500 /* Remember that the name was used in the definition of
2501 the current class so that we can check later to see if
2502 the meaning would have been different after the class
2503 was entirely defined. */
2504 if (!scope && decl != error_mark_node)
2505 maybe_note_name_used_in_class (id_expression, decl);
2507 /* Disallow uses of local variables from containing functions. */
2508 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2510 tree context = decl_function_context (decl);
2511 if (context != NULL_TREE && context != current_function_decl
2512 && ! TREE_STATIC (decl))
2514 error (TREE_CODE (decl) == VAR_DECL
2515 ? "use of %<auto%> variable from containing function"
2516 : "use of parameter from containing function");
2517 error (" %q+#D declared here", decl);
2518 return error_mark_node;
2523 /* If we didn't find anything, or what we found was a type,
2524 then this wasn't really an id-expression. */
2525 if (TREE_CODE (decl) == TEMPLATE_DECL
2526 && !DECL_FUNCTION_TEMPLATE_P (decl))
2528 *error_msg = "missing template arguments";
2529 return error_mark_node;
2531 else if (TREE_CODE (decl) == TYPE_DECL
2532 || TREE_CODE (decl) == NAMESPACE_DECL)
2534 *error_msg = "expected primary-expression";
2535 return error_mark_node;
2538 /* If the name resolved to a template parameter, there is no
2539 need to look it up again later. */
2540 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2541 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2545 *idk = CP_ID_KIND_NONE;
2546 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2547 decl = TEMPLATE_PARM_DECL (decl);
2548 r = convert_from_reference (DECL_INITIAL (decl));
2550 if (integral_constant_expression_p
2551 && !dependent_type_p (TREE_TYPE (decl))
2552 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2554 if (!allow_non_integral_constant_expression_p)
2555 error ("template parameter %qD of type %qT is not allowed in "
2556 "an integral constant expression because it is not of "
2557 "integral or enumeration type", decl, TREE_TYPE (decl));
2558 *non_integral_constant_expression_p = true;
2562 /* Similarly, we resolve enumeration constants to their
2563 underlying values. */
2564 else if (TREE_CODE (decl) == CONST_DECL)
2566 *idk = CP_ID_KIND_NONE;
2567 if (!processing_template_decl)
2568 return DECL_INITIAL (decl);
2575 /* If the declaration was explicitly qualified indicate
2576 that. The semantics of `A::f(3)' are different than
2577 `f(3)' if `f' is virtual. */
2579 ? CP_ID_KIND_QUALIFIED
2580 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2581 ? CP_ID_KIND_TEMPLATE_ID
2582 : CP_ID_KIND_UNQUALIFIED));
2587 An id-expression is type-dependent if it contains an
2588 identifier that was declared with a dependent type.
2590 The standard is not very specific about an id-expression that
2591 names a set of overloaded functions. What if some of them
2592 have dependent types and some of them do not? Presumably,
2593 such a name should be treated as a dependent name. */
2594 /* Assume the name is not dependent. */
2595 dependent_p = false;
2596 if (!processing_template_decl)
2597 /* No names are dependent outside a template. */
2599 /* A template-id where the name of the template was not resolved
2600 is definitely dependent. */
2601 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2602 && (TREE_CODE (TREE_OPERAND (decl, 0))
2603 == IDENTIFIER_NODE))
2605 /* For anything except an overloaded function, just check its
2607 else if (!is_overloaded_fn (decl))
2609 = dependent_type_p (TREE_TYPE (decl));
2610 /* For a set of overloaded functions, check each of the
2616 if (BASELINK_P (fns))
2617 fns = BASELINK_FUNCTIONS (fns);
2619 /* For a template-id, check to see if the template
2620 arguments are dependent. */
2621 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2623 tree args = TREE_OPERAND (fns, 1);
2624 dependent_p = any_dependent_template_arguments_p (args);
2625 /* The functions are those referred to by the
2627 fns = TREE_OPERAND (fns, 0);
2630 /* If there are no dependent template arguments, go through
2631 the overloaded functions. */
2632 while (fns && !dependent_p)
2634 tree fn = OVL_CURRENT (fns);
2636 /* Member functions of dependent classes are
2638 if (TREE_CODE (fn) == FUNCTION_DECL
2639 && type_dependent_expression_p (fn))
2641 else if (TREE_CODE (fn) == TEMPLATE_DECL
2642 && dependent_template_p (fn))
2645 fns = OVL_NEXT (fns);
2649 /* If the name was dependent on a template parameter, we will
2650 resolve the name at instantiation time. */
2653 /* Create a SCOPE_REF for qualified names, if the scope is
2657 /* Since this name was dependent, the expression isn't
2658 constant -- yet. No error is issued because it might
2659 be constant when things are instantiated. */
2660 if (integral_constant_expression_p)
2661 *non_integral_constant_expression_p = true;
2664 if (address_p && done)
2665 decl = finish_qualified_id_expr (scope, decl,
2669 else if (dependent_type_p (scope))
2670 decl = build_qualified_name (/*type=*/NULL_TREE,
2674 else if (DECL_P (decl))
2675 decl = build_qualified_name (TREE_TYPE (decl),
2680 if (TREE_TYPE (decl))
2681 decl = convert_from_reference (decl);
2684 /* A TEMPLATE_ID already contains all the information we
2686 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2687 return id_expression;
2688 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2689 /* If we found a variable, then name lookup during the
2690 instantiation will always resolve to the same VAR_DECL
2691 (or an instantiation thereof). */
2692 if (TREE_CODE (decl) == VAR_DECL
2693 || TREE_CODE (decl) == PARM_DECL)
2694 return convert_from_reference (decl);
2695 /* The same is true for FIELD_DECL, but we also need to
2696 make sure that the syntax is correct. */
2697 else if (TREE_CODE (decl) == FIELD_DECL)
2699 /* Since SCOPE is NULL here, this is an unqualified name.
2700 Access checking has been performed during name lookup
2701 already. Turn off checking to avoid duplicate errors. */
2702 push_deferring_access_checks (dk_no_check);
2703 decl = finish_non_static_data_member
2704 (decl, current_class_ref,
2705 /*qualifying_scope=*/NULL_TREE);
2706 pop_deferring_access_checks ();
2709 return id_expression;
2712 /* Only certain kinds of names are allowed in constant
2713 expression. Enumerators and template parameters have already
2714 been handled above. */
2715 if (integral_constant_expression_p
2716 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2717 && ! builtin_valid_in_constant_expr_p (decl))
2719 if (!allow_non_integral_constant_expression_p)
2721 error ("%qD cannot appear in a constant-expression", decl);
2722 return error_mark_node;
2724 *non_integral_constant_expression_p = true;
2727 if (TREE_CODE (decl) == NAMESPACE_DECL)
2729 error ("use of namespace %qD as expression", decl);
2730 return error_mark_node;
2732 else if (DECL_CLASS_TEMPLATE_P (decl))
2734 error ("use of class template %qT as expression", decl);
2735 return error_mark_node;
2737 else if (TREE_CODE (decl) == TREE_LIST)
2739 /* Ambiguous reference to base members. */
2740 error ("request for member %qD is ambiguous in "
2741 "multiple inheritance lattice", id_expression);
2742 print_candidates (decl);
2743 return error_mark_node;
2746 /* Mark variable-like entities as used. Functions are similarly
2747 marked either below or after overload resolution. */
2748 if (TREE_CODE (decl) == VAR_DECL
2749 || TREE_CODE (decl) == PARM_DECL
2750 || TREE_CODE (decl) == RESULT_DECL)
2755 decl = (adjust_result_of_qualified_name_lookup
2756 (decl, scope, current_class_type));
2758 if (TREE_CODE (decl) == FUNCTION_DECL)
2761 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2762 decl = finish_qualified_id_expr (scope,
2770 tree r = convert_from_reference (decl);
2772 if (processing_template_decl && TYPE_P (scope))
2773 r = build_qualified_name (TREE_TYPE (r),
2779 else if (TREE_CODE (decl) == FIELD_DECL)
2781 /* Since SCOPE is NULL here, this is an unqualified name.
2782 Access checking has been performed during name lookup
2783 already. Turn off checking to avoid duplicate errors. */
2784 push_deferring_access_checks (dk_no_check);
2785 decl = finish_non_static_data_member (decl, current_class_ref,
2786 /*qualifying_scope=*/NULL_TREE);
2787 pop_deferring_access_checks ();
2789 else if (is_overloaded_fn (decl))
2791 tree first_fn = OVL_CURRENT (decl);
2793 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2794 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2796 if (!really_overloaded_fn (decl))
2797 mark_used (first_fn);
2800 && TREE_CODE (first_fn) == FUNCTION_DECL
2801 && DECL_FUNCTION_MEMBER_P (first_fn)
2802 && !shared_member_p (decl))
2804 /* A set of member functions. */
2805 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
2806 return finish_class_member_access_expr (decl, id_expression,
2807 /*template_p=*/false);
2812 if (DECL_P (decl) && DECL_NONLOCAL (decl)
2813 && DECL_CLASS_SCOPE_P (decl)
2814 && DECL_CONTEXT (decl) != current_class_type)
2818 path = currently_open_derived_class (DECL_CONTEXT (decl));
2819 perform_or_defer_access_check (TYPE_BINFO (path), decl);
2822 decl = convert_from_reference (decl);
2826 if (TREE_DEPRECATED (decl))
2827 warn_deprecated_use (decl);
2832 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
2833 use as a type-specifier. */
2836 finish_typeof (tree expr)
2840 if (type_dependent_expression_p (expr))
2842 type = make_aggr_type (TYPEOF_TYPE);
2843 TYPEOF_TYPE_EXPR (type) = expr;
2848 type = TREE_TYPE (expr);
2850 if (!type || type == unknown_type_node)
2852 error ("type of %qE is unknown", expr);
2853 return error_mark_node;
2859 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
2860 with equivalent CALL_EXPRs. */
2863 simplify_aggr_init_exprs_r (tree* tp,
2865 void* data ATTRIBUTE_UNUSED)
2867 /* We don't need to walk into types; there's nothing in a type that
2868 needs simplification. (And, furthermore, there are places we
2869 actively don't want to go. For example, we don't want to wander
2870 into the default arguments for a FUNCTION_DECL that appears in a
2877 /* Only AGGR_INIT_EXPRs are interesting. */
2878 else if (TREE_CODE (*tp) != AGGR_INIT_EXPR)
2881 simplify_aggr_init_expr (tp);
2883 /* Keep iterating. */
2887 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
2888 function is broken out from the above for the benefit of the tree-ssa
2892 simplify_aggr_init_expr (tree *tp)
2894 tree aggr_init_expr = *tp;
2896 /* Form an appropriate CALL_EXPR. */
2897 tree fn = TREE_OPERAND (aggr_init_expr, 0);
2898 tree args = TREE_OPERAND (aggr_init_expr, 1);
2899 tree slot = TREE_OPERAND (aggr_init_expr, 2);
2900 tree type = TREE_TYPE (slot);
2903 enum style_t { ctor, arg, pcc } style;
2905 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
2907 #ifdef PCC_STATIC_STRUCT_RETURN
2913 gcc_assert (TREE_ADDRESSABLE (type));
2919 /* Replace the first argument to the ctor with the address of the
2923 args = TREE_CHAIN (args);
2924 cxx_mark_addressable (slot);
2925 addr = build1 (ADDR_EXPR, build_pointer_type (type), slot);
2926 args = tree_cons (NULL_TREE, addr, args);
2929 call_expr = build3 (CALL_EXPR,
2930 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
2931 fn, args, NULL_TREE);
2935 /* Just mark it addressable here, and leave the rest to
2936 expand_call{,_inline}. */
2937 cxx_mark_addressable (slot);
2938 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
2939 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
2941 else if (style == pcc)
2943 /* If we're using the non-reentrant PCC calling convention, then we
2944 need to copy the returned value out of the static buffer into the
2946 push_deferring_access_checks (dk_no_check);
2947 call_expr = build_aggr_init (slot, call_expr,
2948 DIRECT_BIND | LOOKUP_ONLYCONVERTING);
2949 pop_deferring_access_checks ();
2950 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
2956 /* Emit all thunks to FN that should be emitted when FN is emitted. */
2959 emit_associated_thunks (tree fn)
2961 /* When we use vcall offsets, we emit thunks with the virtual
2962 functions to which they thunk. The whole point of vcall offsets
2963 is so that you can know statically the entire set of thunks that
2964 will ever be needed for a given virtual function, thereby
2965 enabling you to output all the thunks with the function itself. */
2966 if (DECL_VIRTUAL_P (fn))
2970 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
2972 if (!THUNK_ALIAS (thunk))
2974 use_thunk (thunk, /*emit_p=*/1);
2975 if (DECL_RESULT_THUNK_P (thunk))
2979 for (probe = DECL_THUNKS (thunk);
2980 probe; probe = TREE_CHAIN (probe))
2981 use_thunk (probe, /*emit_p=*/1);
2985 gcc_assert (!DECL_THUNKS (thunk));
2990 /* Generate RTL for FN. */
2993 expand_body (tree fn)
2995 tree saved_function;
2997 /* Compute the appropriate object-file linkage for inline
2999 if (DECL_DECLARED_INLINE_P (fn))
3000 import_export_decl (fn);
3002 /* If FN is external, then there's no point in generating RTL for
3003 it. This situation can arise with an inline function under
3004 `-fexternal-templates'; we instantiate the function, even though
3005 we're not planning on emitting it, in case we get a chance to
3007 if (DECL_EXTERNAL (fn))
3010 /* ??? When is this needed? */
3011 saved_function = current_function_decl;
3013 /* Emit any thunks that should be emitted at the same time as FN. */
3014 emit_associated_thunks (fn);
3016 /* This function is only called from cgraph, or recursively from
3017 emit_associated_thunks. In neither case should we be currently
3018 generating trees for a function. */
3019 gcc_assert (function_depth == 0);
3021 tree_rest_of_compilation (fn);
3023 current_function_decl = saved_function;
3025 if (DECL_CLONED_FUNCTION_P (fn))
3027 /* If this is a clone, go through the other clones now and mark
3028 their parameters used. We have to do that here, as we don't
3029 know whether any particular clone will be expanded, and
3030 therefore cannot pick one arbitrarily. */
3033 for (probe = TREE_CHAIN (DECL_CLONED_FUNCTION (fn));
3034 probe && DECL_CLONED_FUNCTION_P (probe);
3035 probe = TREE_CHAIN (probe))
3039 for (parms = DECL_ARGUMENTS (probe);
3040 parms; parms = TREE_CHAIN (parms))
3041 TREE_USED (parms) = 1;
3046 /* Generate RTL for FN. */
3049 expand_or_defer_fn (tree fn)
3051 /* When the parser calls us after finishing the body of a template
3052 function, we don't really want to expand the body. */
3053 if (processing_template_decl)
3055 /* Normally, collection only occurs in rest_of_compilation. So,
3056 if we don't collect here, we never collect junk generated
3057 during the processing of templates until we hit a
3058 non-template function. It's not safe to do this inside a
3059 nested class, though, as the parser may have local state that
3060 is not a GC root. */
3061 if (!function_depth)
3066 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
3067 walk_tree_without_duplicates (&DECL_SAVED_TREE (fn),
3068 simplify_aggr_init_exprs_r,
3071 /* If this is a constructor or destructor body, we have to clone
3073 if (maybe_clone_body (fn))
3075 /* We don't want to process FN again, so pretend we've written
3076 it out, even though we haven't. */
3077 TREE_ASM_WRITTEN (fn) = 1;
3081 /* If this function is marked with the constructor attribute, add it
3082 to the list of functions to be called along with constructors
3083 from static duration objects. */
3084 if (DECL_STATIC_CONSTRUCTOR (fn))
3085 static_ctors = tree_cons (NULL_TREE, fn, static_ctors);
3087 /* If this function is marked with the destructor attribute, add it
3088 to the list of functions to be called along with destructors from
3089 static duration objects. */
3090 if (DECL_STATIC_DESTRUCTOR (fn))
3091 static_dtors = tree_cons (NULL_TREE, fn, static_dtors);
3093 /* We make a decision about linkage for these functions at the end
3094 of the compilation. Until that point, we do not want the back
3095 end to output them -- but we do want it to see the bodies of
3096 these functions so that it can inline them as appropriate. */
3097 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3099 if (DECL_INTERFACE_KNOWN (fn))
3100 /* We've already made a decision as to how this function will
3104 DECL_EXTERNAL (fn) = 1;
3105 DECL_NOT_REALLY_EXTERN (fn) = 1;
3106 note_vague_linkage_fn (fn);
3107 /* A non-template inline function with external linkage will
3108 always be COMDAT. As we must eventually determine the
3109 linkage of all functions, and as that causes writes to
3110 the data mapped in from the PCH file, it's advantageous
3111 to mark the functions at this point. */
3112 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3114 /* This function must have external linkage, as
3115 otherwise DECL_INTERFACE_KNOWN would have been
3117 gcc_assert (TREE_PUBLIC (fn));
3118 comdat_linkage (fn);
3119 DECL_INTERFACE_KNOWN (fn) = 1;
3123 import_export_decl (fn);
3125 /* If the user wants us to keep all inline functions, then mark
3126 this function as needed so that finish_file will make sure to
3128 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3132 /* There's no reason to do any of the work here if we're only doing
3133 semantic analysis; this code just generates RTL. */
3134 if (flag_syntax_only)
3139 /* Expand or defer, at the whim of the compilation unit manager. */
3140 cgraph_finalize_function (fn, function_depth > 1);
3152 /* Helper function for walk_tree, used by finalize_nrv below. */
3155 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3157 struct nrv_data *dp = (struct nrv_data *)data;
3160 /* No need to walk into types. There wouldn't be any need to walk into
3161 non-statements, except that we have to consider STMT_EXPRs. */
3164 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3165 but differs from using NULL_TREE in that it indicates that we care
3166 about the value of the RESULT_DECL. */
3167 else if (TREE_CODE (*tp) == RETURN_EXPR)
3168 TREE_OPERAND (*tp, 0) = dp->result;
3169 /* Change all cleanups for the NRV to only run when an exception is
3171 else if (TREE_CODE (*tp) == CLEANUP_STMT
3172 && CLEANUP_DECL (*tp) == dp->var)
3173 CLEANUP_EH_ONLY (*tp) = 1;
3174 /* Replace the DECL_EXPR for the NRV with an initialization of the
3175 RESULT_DECL, if needed. */
3176 else if (TREE_CODE (*tp) == DECL_EXPR
3177 && DECL_EXPR_DECL (*tp) == dp->var)
3180 if (DECL_INITIAL (dp->var)
3181 && DECL_INITIAL (dp->var) != error_mark_node)
3183 init = build2 (INIT_EXPR, void_type_node, dp->result,
3184 DECL_INITIAL (dp->var));
3185 DECL_INITIAL (dp->var) = error_mark_node;
3188 init = build_empty_stmt ();
3189 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3192 /* And replace all uses of the NRV with the RESULT_DECL. */
3193 else if (*tp == dp->var)
3196 /* Avoid walking into the same tree more than once. Unfortunately, we
3197 can't just use walk_tree_without duplicates because it would only call
3198 us for the first occurrence of dp->var in the function body. */
3199 slot = htab_find_slot (dp->visited, *tp, INSERT);
3205 /* Keep iterating. */
3209 /* Called from finish_function to implement the named return value
3210 optimization by overriding all the RETURN_EXPRs and pertinent
3211 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3212 RESULT_DECL for the function. */
3215 finalize_nrv (tree *tp, tree var, tree result)
3217 struct nrv_data data;
3219 /* Copy debugging information from VAR to RESULT. */
3220 DECL_NAME (result) = DECL_NAME (var);
3221 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3222 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3223 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3224 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3225 /* Don't forget that we take its address. */
3226 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3229 data.result = result;
3230 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3231 walk_tree (tp, finalize_nrv_r, &data, 0);
3232 htab_delete (data.visited);
3235 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3236 Remove any elements from the list that are invalid. */
3239 finish_omp_clauses (tree clauses)
3241 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3242 tree c, t, *pc = &clauses;
3245 bitmap_obstack_initialize (NULL);
3246 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3247 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3248 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3250 for (pc = &clauses, c = clauses; c ; c = *pc)
3252 bool remove = false;
3254 switch (OMP_CLAUSE_CODE (c))
3256 case OMP_CLAUSE_SHARED:
3258 goto check_dup_generic;
3259 case OMP_CLAUSE_PRIVATE:
3261 goto check_dup_generic;
3262 case OMP_CLAUSE_REDUCTION:
3264 goto check_dup_generic;
3265 case OMP_CLAUSE_COPYPRIVATE:
3266 name = "copyprivate";
3267 goto check_dup_generic;
3268 case OMP_CLAUSE_COPYIN:
3270 goto check_dup_generic;
3272 t = OMP_CLAUSE_DECL (c);
3273 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3275 if (processing_template_decl)
3277 error ("%qE is not a variable in clause %qs", t, name);
3280 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3281 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3282 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3284 error ("%qE appears more than once in data clauses", t);
3288 bitmap_set_bit (&generic_head, DECL_UID (t));
3291 case OMP_CLAUSE_FIRSTPRIVATE:
3292 t = OMP_CLAUSE_DECL (c);
3293 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3295 if (processing_template_decl)
3297 error ("%qE is not a variable in clause %<firstprivate%>", t);
3300 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3301 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3303 error ("%qE appears more than once in data clauses", t);
3307 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3310 case OMP_CLAUSE_LASTPRIVATE:
3311 t = OMP_CLAUSE_DECL (c);
3312 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3314 if (processing_template_decl)
3316 error ("%qE is not a variable in clause %<lastprivate%>", t);
3319 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3320 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3322 error ("%qE appears more than once in data clauses", t);
3326 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3330 t = OMP_CLAUSE_IF_EXPR (c);
3331 t = maybe_convert_cond (t);
3332 if (t == error_mark_node)
3334 OMP_CLAUSE_IF_EXPR (c) = t;
3337 case OMP_CLAUSE_NUM_THREADS:
3338 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3339 if (t == error_mark_node)
3341 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
3342 && !type_dependent_expression_p (t))
3344 error ("num_threads expression must be integral");
3349 case OMP_CLAUSE_SCHEDULE:
3350 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3353 else if (t == error_mark_node)
3355 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
3356 && !type_dependent_expression_p (t))
3358 error ("schedule chunk size expression must be integral");
3363 case OMP_CLAUSE_NOWAIT:
3364 case OMP_CLAUSE_ORDERED:
3365 case OMP_CLAUSE_DEFAULT:
3373 *pc = OMP_CLAUSE_CHAIN (c);
3375 pc = &OMP_CLAUSE_CHAIN (c);
3378 for (pc = &clauses, c = clauses; c ; c = *pc)
3380 enum tree_code c_kind = OMP_CLAUSE_CODE (c);
3381 bool remove = false;
3382 bool need_complete_non_reference = false;
3383 bool need_default_ctor = false;
3384 bool need_copy_ctor = false;
3385 bool need_copy_assignment = false;
3386 bool need_implicitly_determined = false;
3387 tree type, inner_type;
3391 case OMP_CLAUSE_SHARED:
3393 need_implicitly_determined = true;
3395 case OMP_CLAUSE_PRIVATE:
3397 need_complete_non_reference = true;
3398 need_default_ctor = true;
3399 need_implicitly_determined = true;
3401 case OMP_CLAUSE_FIRSTPRIVATE:
3402 name = "firstprivate";
3403 need_complete_non_reference = true;
3404 need_copy_ctor = true;
3405 need_implicitly_determined = true;
3407 case OMP_CLAUSE_LASTPRIVATE:
3408 name = "lastprivate";
3409 need_complete_non_reference = true;
3410 need_copy_assignment = true;
3411 need_implicitly_determined = true;
3413 case OMP_CLAUSE_REDUCTION:
3415 need_implicitly_determined = true;
3417 case OMP_CLAUSE_COPYPRIVATE:
3418 name = "copyprivate";
3419 need_copy_assignment = true;
3421 case OMP_CLAUSE_COPYIN:
3423 need_copy_assignment = true;
3426 pc = &OMP_CLAUSE_CHAIN (c);
3430 t = OMP_CLAUSE_DECL (c);
3431 if (processing_template_decl
3432 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3434 pc = &OMP_CLAUSE_CHAIN (c);
3440 case OMP_CLAUSE_LASTPRIVATE:
3441 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3442 need_default_ctor = true;
3445 case OMP_CLAUSE_REDUCTION:
3446 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3447 || POINTER_TYPE_P (TREE_TYPE (t)))
3449 error ("%qE has invalid type for %<reduction%>", t);
3452 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3454 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3462 error ("%qE has invalid type for %<reduction(%s)%>",
3463 t, operator_name_info[r_code].name);
3469 case OMP_CLAUSE_COPYIN:
3470 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3472 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3481 if (need_complete_non_reference)
3483 t = require_complete_type (t);
3484 if (t == error_mark_node)
3486 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3488 error ("%qE has reference type for %qs", t, name);
3492 if (need_implicitly_determined)
3494 const char *share_name = NULL;
3496 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3497 share_name = "threadprivate";
3498 else switch (cxx_omp_predetermined_sharing (t))
3500 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3502 case OMP_CLAUSE_DEFAULT_SHARED:
3503 share_name = "shared";
3505 case OMP_CLAUSE_DEFAULT_PRIVATE:
3506 share_name = "private";
3513 error ("%qE is predetermined %qs for %qs",
3514 t, share_name, name);
3519 /* We're interested in the base element, not arrays. */
3520 inner_type = type = TREE_TYPE (t);
3521 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3522 inner_type = TREE_TYPE (inner_type);
3524 /* Check for special function availability by building a call to one.
3525 Save the results, because later we won't be in the right context
3526 for making these queries. */
3527 if (CLASS_TYPE_P (inner_type)
3528 && (need_default_ctor || need_copy_ctor || need_copy_assignment))
3530 int save_errorcount = errorcount;
3533 /* Always allocate 3 elements for simplicity. These are the
3534 function decls for the ctor, dtor, and assignment op.
3535 This layout is known to the three lang hooks,
3536 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3537 and cxx_omp_clause_assign_op. */
3538 info = make_tree_vec (3);
3539 CP_OMP_CLAUSE_INFO (c) = info;
3541 if (need_default_ctor
3543 && !TYPE_HAS_TRIVIAL_INIT_REF (inner_type)))
3545 if (need_default_ctor)
3549 t = build_int_cst (build_pointer_type (inner_type), 0);
3550 t = build1 (INDIRECT_REF, inner_type, t);
3551 t = build_tree_list (NULL, t);
3553 t = build_special_member_call (NULL_TREE,
3554 complete_ctor_identifier,
3555 t, inner_type, LOOKUP_NORMAL);
3556 t = get_callee_fndecl (t);
3557 TREE_VEC_ELT (info, 0) = t;
3560 if ((need_default_ctor || need_copy_ctor)
3561 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_type))
3563 t = build_int_cst (build_pointer_type (inner_type), 0);
3564 t = build1 (INDIRECT_REF, inner_type, t);
3565 t = build_special_member_call (t, complete_dtor_identifier,
3566 NULL, inner_type, LOOKUP_NORMAL);
3567 t = get_callee_fndecl (t);
3568 TREE_VEC_ELT (info, 1) = t;
3571 if (need_copy_assignment
3572 && !TYPE_HAS_TRIVIAL_ASSIGN_REF (inner_type))
3574 t = build_int_cst (build_pointer_type (inner_type), 0);
3575 t = build1 (INDIRECT_REF, inner_type, t);
3576 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3577 build_tree_list (NULL, t),
3578 inner_type, LOOKUP_NORMAL);
3580 /* We'll have called convert_from_reference on the call, which
3581 may well have added an indirect_ref. It's unneeded here,
3582 and in the way, so kill it. */
3583 if (TREE_CODE (t) == INDIRECT_REF)
3584 t = TREE_OPERAND (t, 0);
3586 t = get_callee_fndecl (t);
3587 TREE_VEC_ELT (info, 2) = t;
3590 if (errorcount != save_errorcount)
3595 *pc = OMP_CLAUSE_CHAIN (c);
3597 pc = &OMP_CLAUSE_CHAIN (c);
3600 bitmap_obstack_release (NULL);
3604 /* For all variables in the tree_list VARS, mark them as thread local. */
3607 finish_omp_threadprivate (tree vars)
3611 /* Mark every variable in VARS to be assigned thread local storage. */
3612 for (t = vars; t; t = TREE_CHAIN (t))
3614 tree v = TREE_PURPOSE (t);
3616 /* If V had already been marked threadprivate, it doesn't matter
3617 whether it had been used prior to this point. */
3619 && (DECL_LANG_SPECIFIC (v) == NULL
3620 || !CP_DECL_THREADPRIVATE_P (v)))
3621 error ("%qE declared %<threadprivate%> after first use", v);
3622 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3623 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3624 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3625 error ("%<threadprivate%> %qE has incomplete type", v);
3626 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v)))
3627 error ("%<threadprivate%> %qE is not file, namespace "
3628 "or block scope variable", v);
3631 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3632 if (DECL_LANG_SPECIFIC (v) == NULL)
3634 retrofit_lang_decl (v);
3636 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3637 after the allocation of the lang_decl structure. */
3638 if (DECL_DISCRIMINATOR_P (v))
3639 DECL_LANG_SPECIFIC (v)->decl_flags.u2sel = 1;
3642 if (! DECL_THREAD_LOCAL_P (v))
3644 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3645 /* If rtl has been already set for this var, call
3646 make_decl_rtl once again, so that encode_section_info
3647 has a chance to look at the new decl flags. */
3648 if (DECL_RTL_SET_P (v))
3651 CP_DECL_THREADPRIVATE_P (v) = 1;
3656 /* Build an OpenMP structured block. */
3659 begin_omp_structured_block (void)
3661 return do_pushlevel (sk_omp);
3665 finish_omp_structured_block (tree block)
3667 return do_poplevel (block);
3670 /* Similarly, except force the retention of the BLOCK. */
3673 begin_omp_parallel (void)
3675 keep_next_level (true);
3676 return begin_omp_structured_block ();
3680 finish_omp_parallel (tree clauses, tree body)
3684 body = finish_omp_structured_block (body);
3686 stmt = make_node (OMP_PARALLEL);
3687 TREE_TYPE (stmt) = void_type_node;
3688 OMP_PARALLEL_CLAUSES (stmt) = clauses;
3689 OMP_PARALLEL_BODY (stmt) = body;
3691 return add_stmt (stmt);
3694 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
3695 are directly for their associated operands in the statement. DECL
3696 and INIT are a combo; if DECL is NULL then INIT ought to be a
3697 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
3698 optional statements that need to go before the loop into its
3702 finish_omp_for (location_t locus, tree decl, tree init, tree cond,
3703 tree incr, tree body, tree pre_body)
3708 switch (TREE_CODE (init))
3711 decl = TREE_OPERAND (init, 0);
3712 init = TREE_OPERAND (init, 1);
3715 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
3717 decl = TREE_OPERAND (init, 0);
3718 init = TREE_OPERAND (init, 2);
3727 error ("expected iteration declaration or initialization");
3732 if (type_dependent_expression_p (decl)
3733 || type_dependent_expression_p (init)
3734 || (cond && type_dependent_expression_p (cond))
3735 || (incr && type_dependent_expression_p (incr)))
3741 error ("%Hmissing controlling predicate", &locus);
3747 error ("%Hmissing increment expression", &locus);
3751 stmt = make_node (OMP_FOR);
3753 /* This is really just a place-holder. We'll be decomposing this
3754 again and going through the build_modify_expr path below when
3755 we instantiate the thing. */
3756 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
3758 TREE_TYPE (stmt) = void_type_node;
3759 OMP_FOR_INIT (stmt) = init;
3760 OMP_FOR_COND (stmt) = cond;
3761 OMP_FOR_INCR (stmt) = incr;
3762 OMP_FOR_BODY (stmt) = body;
3763 OMP_FOR_PRE_BODY (stmt) = pre_body;
3765 SET_EXPR_LOCATION (stmt, locus);
3766 return add_stmt (stmt);
3771 error ("expected iteration declaration or initialization");
3775 if (pre_body == NULL || IS_EMPTY_STMT (pre_body))
3777 else if (! processing_template_decl)
3779 add_stmt (pre_body);
3782 init = build_modify_expr (decl, NOP_EXPR, init);
3783 return c_finish_omp_for (locus, decl, init, cond, incr, body, pre_body);
3787 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
3789 /* If either of the operands are dependent, we can't do semantic
3790 processing yet. Stuff the values away for now. We cheat a bit
3791 and use the same tree code for this, even though the operands
3792 are of totally different form, thus we need to remember which
3793 statements are which, thus the lang_flag bit. */
3794 /* ??? We ought to be using type_dependent_expression_p, but the
3795 invocation of build_modify_expr in c_finish_omp_atomic can result
3796 in the creation of CONVERT_EXPRs, which are not handled by
3797 tsubst_copy_and_build. */
3798 if (uses_template_parms (lhs) || uses_template_parms (rhs))
3800 tree stmt = build2 (OMP_ATOMIC, void_type_node, lhs, rhs);
3801 OMP_ATOMIC_DEPENDENT_P (stmt) = 1;
3802 OMP_ATOMIC_CODE (stmt) = code;
3806 c_finish_omp_atomic (code, lhs, rhs);
3810 finish_omp_barrier (void)
3812 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
3813 tree stmt = finish_call_expr (fn, NULL, false, false);
3814 finish_expr_stmt (stmt);
3818 finish_omp_flush (void)
3820 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
3821 tree stmt = finish_call_expr (fn, NULL, false, false);
3822 finish_expr_stmt (stmt);
3825 /* True if OpenMP sharing attribute of DECL is predetermined. */
3827 enum omp_clause_default_kind
3828 cxx_omp_predetermined_sharing (tree decl)
3830 enum omp_clause_default_kind kind;
3832 kind = c_omp_predetermined_sharing (decl);
3833 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
3836 /* Static data members are predetermined as shared. */
3837 if (TREE_STATIC (decl))
3839 tree ctx = CP_DECL_CONTEXT (decl);
3840 if (TYPE_P (ctx) && IS_AGGR_TYPE (ctx))
3841 return OMP_CLAUSE_DEFAULT_SHARED;
3844 return OMP_CLAUSE_DEFAULT_UNSPECIFIED;
3848 init_cp_semantics (void)
3852 #include "gt-cp-semantics.h"