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. The block returned in
979 *COMPOUND_STMT is an artificial outer scope, containing the
980 function-try-block. */
983 begin_function_try_block (tree *compound_stmt)
986 /* This outer scope does not exist in the C++ standard, but we need
987 a place to put __FUNCTION__ and similar variables. */
988 *compound_stmt = begin_compound_stmt (0);
989 r = begin_try_block ();
990 FN_TRY_BLOCK_P (r) = 1;
994 /* Finish a try-block, which may be given by TRY_BLOCK. */
997 finish_try_block (tree try_block)
999 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1000 TRY_HANDLERS (try_block) = push_stmt_list ();
1003 /* Finish the body of a cleanup try-block, which may be given by
1007 finish_cleanup_try_block (tree try_block)
1009 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1012 /* Finish an implicitly generated try-block, with a cleanup is given
1016 finish_cleanup (tree cleanup, tree try_block)
1018 TRY_HANDLERS (try_block) = cleanup;
1019 CLEANUP_P (try_block) = 1;
1022 /* Likewise, for a function-try-block. */
1025 finish_function_try_block (tree try_block)
1027 finish_try_block (try_block);
1028 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1029 the try block, but moving it inside. */
1030 in_function_try_handler = 1;
1033 /* Finish a handler-sequence for a try-block, which may be given by
1037 finish_handler_sequence (tree try_block)
1039 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1040 check_handlers (TRY_HANDLERS (try_block));
1043 /* Finish the handler-seq for a function-try-block, given by
1044 TRY_BLOCK. COMPOUND_STMT is the outer block created by
1045 begin_function_try_block. */
1048 finish_function_handler_sequence (tree try_block, tree compound_stmt)
1050 in_function_try_handler = 0;
1051 finish_handler_sequence (try_block);
1052 finish_compound_stmt (compound_stmt);
1055 /* Begin a handler. Returns a HANDLER if appropriate. */
1058 begin_handler (void)
1062 r = build_stmt (HANDLER, NULL_TREE, NULL_TREE);
1065 /* Create a binding level for the eh_info and the exception object
1067 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1072 /* Finish the handler-parameters for a handler, which may be given by
1073 HANDLER. DECL is the declaration for the catch parameter, or NULL
1074 if this is a `catch (...)' clause. */
1077 finish_handler_parms (tree decl, tree handler)
1079 tree type = NULL_TREE;
1080 if (processing_template_decl)
1084 decl = pushdecl (decl);
1085 decl = push_template_decl (decl);
1086 HANDLER_PARMS (handler) = decl;
1087 type = TREE_TYPE (decl);
1091 type = expand_start_catch_block (decl);
1092 HANDLER_TYPE (handler) = type;
1093 if (!processing_template_decl && type)
1094 mark_used (eh_type_info (type));
1097 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1098 the return value from the matching call to finish_handler_parms. */
1101 finish_handler (tree handler)
1103 if (!processing_template_decl)
1104 expand_end_catch_block ();
1105 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1108 /* Begin a compound statement. FLAGS contains some bits that control the
1109 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1110 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1111 block of a function. If BCS_TRY_BLOCK is set, this is the block
1112 created on behalf of a TRY statement. Returns a token to be passed to
1113 finish_compound_stmt. */
1116 begin_compound_stmt (unsigned int flags)
1120 if (flags & BCS_NO_SCOPE)
1122 r = push_stmt_list ();
1123 STATEMENT_LIST_NO_SCOPE (r) = 1;
1125 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1126 But, if it's a statement-expression with a scopeless block, there's
1127 nothing to keep, and we don't want to accidentally keep a block
1128 *inside* the scopeless block. */
1129 keep_next_level (false);
1132 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1134 /* When processing a template, we need to remember where the braces were,
1135 so that we can set up identical scopes when instantiating the template
1136 later. BIND_EXPR is a handy candidate for this.
1137 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1138 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1139 processing templates. */
1140 if (processing_template_decl)
1142 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1143 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1144 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1145 TREE_SIDE_EFFECTS (r) = 1;
1151 /* Finish a compound-statement, which is given by STMT. */
1154 finish_compound_stmt (tree stmt)
1156 if (TREE_CODE (stmt) == BIND_EXPR)
1157 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1158 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1159 stmt = pop_stmt_list (stmt);
1162 /* Destroy any ObjC "super" receivers that may have been
1164 objc_clear_super_receiver ();
1166 stmt = do_poplevel (stmt);
1169 /* ??? See c_end_compound_stmt wrt statement expressions. */
1174 /* Finish an asm-statement, whose components are a STRING, some
1175 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1176 whether the asm-statement should be considered volatile. */
1179 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1180 tree input_operands, tree clobbers)
1184 int ninputs = list_length (input_operands);
1185 int noutputs = list_length (output_operands);
1187 if (!processing_template_decl)
1189 const char *constraint;
1190 const char **oconstraints;
1191 bool allows_mem, allows_reg, is_inout;
1195 oconstraints = (const char **) alloca (noutputs * sizeof (char *));
1197 string = resolve_asm_operand_names (string, output_operands,
1200 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1202 operand = TREE_VALUE (t);
1204 /* ??? Really, this should not be here. Users should be using a
1205 proper lvalue, dammit. But there's a long history of using
1206 casts in the output operands. In cases like longlong.h, this
1207 becomes a primitive form of typechecking -- if the cast can be
1208 removed, then the output operand had a type of the proper width;
1209 otherwise we'll get an error. Gross, but ... */
1210 STRIP_NOPS (operand);
1212 if (!lvalue_or_else (operand, lv_asm))
1213 operand = error_mark_node;
1215 if (operand != error_mark_node
1216 && (TREE_READONLY (operand)
1217 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1218 /* Functions are not modifiable, even though they are
1220 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1221 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1222 /* If it's an aggregate and any field is const, then it is
1223 effectively const. */
1224 || (CLASS_TYPE_P (TREE_TYPE (operand))
1225 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1226 readonly_error (operand, "assignment (via 'asm' output)", 0);
1228 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1229 oconstraints[i] = constraint;
1231 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1232 &allows_mem, &allows_reg, &is_inout))
1234 /* If the operand is going to end up in memory,
1235 mark it addressable. */
1236 if (!allows_reg && !cxx_mark_addressable (operand))
1237 operand = error_mark_node;
1240 operand = error_mark_node;
1242 TREE_VALUE (t) = operand;
1245 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1247 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1248 operand = decay_conversion (TREE_VALUE (t));
1250 /* If the type of the operand hasn't been determined (e.g.,
1251 because it involves an overloaded function), then issue
1252 an error message. There's no context available to
1253 resolve the overloading. */
1254 if (TREE_TYPE (operand) == unknown_type_node)
1256 error ("type of asm operand %qE could not be determined",
1258 operand = error_mark_node;
1261 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1262 oconstraints, &allows_mem, &allows_reg))
1264 /* If the operand is going to end up in memory,
1265 mark it addressable. */
1266 if (!allows_reg && allows_mem)
1268 /* Strip the nops as we allow this case. FIXME, this really
1269 should be rejected or made deprecated. */
1270 STRIP_NOPS (operand);
1271 if (!cxx_mark_addressable (operand))
1272 operand = error_mark_node;
1276 operand = error_mark_node;
1278 TREE_VALUE (t) = operand;
1282 r = build_stmt (ASM_EXPR, string,
1283 output_operands, input_operands,
1285 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1286 r = maybe_cleanup_point_expr_void (r);
1287 return add_stmt (r);
1290 /* Finish a label with the indicated NAME. */
1293 finish_label_stmt (tree name)
1295 tree decl = define_label (input_location, name);
1296 return add_stmt (build_stmt (LABEL_EXPR, decl));
1299 /* Finish a series of declarations for local labels. G++ allows users
1300 to declare "local" labels, i.e., labels with scope. This extension
1301 is useful when writing code involving statement-expressions. */
1304 finish_label_decl (tree name)
1306 tree decl = declare_local_label (name);
1307 add_decl_expr (decl);
1310 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1313 finish_decl_cleanup (tree decl, tree cleanup)
1315 push_cleanup (decl, cleanup, false);
1318 /* If the current scope exits with an exception, run CLEANUP. */
1321 finish_eh_cleanup (tree cleanup)
1323 push_cleanup (NULL, cleanup, true);
1326 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1327 order they were written by the user. Each node is as for
1328 emit_mem_initializers. */
1331 finish_mem_initializers (tree mem_inits)
1333 /* Reorder the MEM_INITS so that they are in the order they appeared
1334 in the source program. */
1335 mem_inits = nreverse (mem_inits);
1337 if (processing_template_decl)
1338 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1340 emit_mem_initializers (mem_inits);
1343 /* Finish a parenthesized expression EXPR. */
1346 finish_parenthesized_expr (tree expr)
1349 /* This inhibits warnings in c_common_truthvalue_conversion. */
1350 TREE_NO_WARNING (expr) = 1;
1352 if (TREE_CODE (expr) == OFFSET_REF)
1353 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1354 enclosed in parentheses. */
1355 PTRMEM_OK_P (expr) = 0;
1357 if (TREE_CODE (expr) == STRING_CST)
1358 PAREN_STRING_LITERAL_P (expr) = 1;
1363 /* Finish a reference to a non-static data member (DECL) that is not
1364 preceded by `.' or `->'. */
1367 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1369 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1373 if (current_function_decl
1374 && DECL_STATIC_FUNCTION_P (current_function_decl))
1375 error ("invalid use of member %q+D in static member function", decl);
1377 error ("invalid use of non-static data member %q+D", decl);
1378 error ("from this location");
1380 return error_mark_node;
1382 TREE_USED (current_class_ptr) = 1;
1383 if (processing_template_decl && !qualifying_scope)
1385 tree type = TREE_TYPE (decl);
1387 if (TREE_CODE (type) == REFERENCE_TYPE)
1388 type = TREE_TYPE (type);
1391 /* Set the cv qualifiers. */
1392 int quals = cp_type_quals (TREE_TYPE (current_class_ref));
1394 if (DECL_MUTABLE_P (decl))
1395 quals &= ~TYPE_QUAL_CONST;
1397 quals |= cp_type_quals (TREE_TYPE (decl));
1398 type = cp_build_qualified_type (type, quals);
1401 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1405 tree access_type = TREE_TYPE (object);
1406 tree lookup_context = context_for_name_lookup (decl);
1408 while (!DERIVED_FROM_P (lookup_context, access_type))
1410 access_type = TYPE_CONTEXT (access_type);
1411 while (access_type && DECL_P (access_type))
1412 access_type = DECL_CONTEXT (access_type);
1416 error ("object missing in reference to %q+D", decl);
1417 error ("from this location");
1418 return error_mark_node;
1422 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1423 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1425 if (processing_template_decl)
1426 return build_qualified_name (TREE_TYPE (decl),
1429 /*template_p=*/false);
1431 perform_or_defer_access_check (TYPE_BINFO (access_type), decl);
1433 /* If the data member was named `C::M', convert `*this' to `C'
1435 if (qualifying_scope)
1437 tree binfo = NULL_TREE;
1438 object = build_scoped_ref (object, qualifying_scope,
1442 return build_class_member_access_expr (object, decl,
1443 /*access_path=*/NULL_TREE,
1444 /*preserve_reference=*/false);
1448 /* DECL was the declaration to which a qualified-id resolved. Issue
1449 an error message if it is not accessible. If OBJECT_TYPE is
1450 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1451 type of `*x', or `x', respectively. If the DECL was named as
1452 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1455 check_accessibility_of_qualified_id (tree decl,
1457 tree nested_name_specifier)
1460 tree qualifying_type = NULL_TREE;
1462 /* If we're not checking, return immediately. */
1463 if (deferred_access_no_check)
1466 /* Determine the SCOPE of DECL. */
1467 scope = context_for_name_lookup (decl);
1468 /* If the SCOPE is not a type, then DECL is not a member. */
1469 if (!TYPE_P (scope))
1471 /* Compute the scope through which DECL is being accessed. */
1473 /* OBJECT_TYPE might not be a class type; consider:
1475 class A { typedef int I; };
1479 In this case, we will have "A::I" as the DECL, but "I" as the
1481 && CLASS_TYPE_P (object_type)
1482 && DERIVED_FROM_P (scope, object_type))
1483 /* If we are processing a `->' or `.' expression, use the type of the
1485 qualifying_type = object_type;
1486 else if (nested_name_specifier)
1488 /* If the reference is to a non-static member of the
1489 current class, treat it as if it were referenced through
1491 if (DECL_NONSTATIC_MEMBER_P (decl)
1492 && current_class_ptr
1493 && DERIVED_FROM_P (scope, current_class_type))
1494 qualifying_type = current_class_type;
1495 /* Otherwise, use the type indicated by the
1496 nested-name-specifier. */
1498 qualifying_type = nested_name_specifier;
1501 /* Otherwise, the name must be from the current class or one of
1503 qualifying_type = currently_open_derived_class (scope);
1505 if (qualifying_type && IS_AGGR_TYPE_CODE (TREE_CODE (qualifying_type)))
1506 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1507 or similar in a default argument value. */
1508 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl);
1511 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1512 class named to the left of the "::" operator. DONE is true if this
1513 expression is a complete postfix-expression; it is false if this
1514 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1515 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1516 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1517 is true iff this qualified name appears as a template argument. */
1520 finish_qualified_id_expr (tree qualifying_class,
1525 bool template_arg_p)
1527 gcc_assert (TYPE_P (qualifying_class));
1529 if (error_operand_p (expr))
1530 return error_mark_node;
1532 if (DECL_P (expr) || BASELINK_P (expr))
1536 check_template_keyword (expr);
1538 /* If EXPR occurs as the operand of '&', use special handling that
1539 permits a pointer-to-member. */
1540 if (address_p && done)
1542 if (TREE_CODE (expr) == SCOPE_REF)
1543 expr = TREE_OPERAND (expr, 1);
1544 expr = build_offset_ref (qualifying_class, expr,
1545 /*address_p=*/true);
1549 /* Within the scope of a class, turn references to non-static
1550 members into expression of the form "this->...". */
1552 /* But, within a template argument, we do not want make the
1553 transformation, as there is no "this" pointer. */
1555 else if (TREE_CODE (expr) == FIELD_DECL)
1556 expr = finish_non_static_data_member (expr, current_class_ref,
1558 else if (BASELINK_P (expr) && !processing_template_decl)
1562 /* See if any of the functions are non-static members. */
1563 fns = BASELINK_FUNCTIONS (expr);
1564 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1565 fns = TREE_OPERAND (fns, 0);
1566 /* If so, the expression may be relative to the current
1568 if (!shared_member_p (fns)
1569 && current_class_type
1570 && DERIVED_FROM_P (qualifying_class, current_class_type))
1571 expr = (build_class_member_access_expr
1572 (maybe_dummy_object (qualifying_class, NULL),
1574 BASELINK_ACCESS_BINFO (expr),
1575 /*preserve_reference=*/false));
1577 /* The expression is a qualified name whose address is not
1579 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1585 /* Begin a statement-expression. The value returned must be passed to
1586 finish_stmt_expr. */
1589 begin_stmt_expr (void)
1591 return push_stmt_list ();
1594 /* Process the final expression of a statement expression. EXPR can be
1595 NULL, if the final expression is empty. Return a STATEMENT_LIST
1596 containing all the statements in the statement-expression, or
1597 ERROR_MARK_NODE if there was an error. */
1600 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1602 if (error_operand_p (expr))
1603 return error_mark_node;
1605 /* If the last statement does not have "void" type, then the value
1606 of the last statement is the value of the entire expression. */
1610 type = TREE_TYPE (expr);
1611 if (!dependent_type_p (type) && !VOID_TYPE_P (type))
1613 expr = decay_conversion (expr);
1614 if (error_operand_p (expr))
1615 return error_mark_node;
1616 type = TREE_TYPE (expr);
1618 /* The type of the statement-expression is the type of the last
1620 TREE_TYPE (stmt_expr) = type;
1621 /* We must take particular care if TYPE is a class type. In
1622 particular if EXPR creates a temporary of class type, then it
1623 must be destroyed at the semicolon terminating the last
1624 statement -- but we must make a copy before that happens.
1626 This problem is solved by using a TARGET_EXPR to initialize a
1627 new temporary variable. The TARGET_EXPR itself is placed
1628 outside the statement-expression. However, the last
1629 statement in the statement-expression is transformed from
1630 EXPR to (approximately) T = EXPR, where T is the new
1631 temporary variable. Thus, the lifetime of the new temporary
1632 extends to the full-expression surrounding the
1633 statement-expression. */
1634 if (!processing_template_decl && !VOID_TYPE_P (type))
1637 if (CLASS_TYPE_P (type)
1638 && !TYPE_HAS_TRIVIAL_INIT_REF (type))
1640 target_expr = build_target_expr_with_type (expr, type);
1641 expr = TARGET_EXPR_INITIAL (target_expr);
1645 /* Normally, build_target_expr will not create a
1646 TARGET_EXPR for scalars. However, we need the
1647 temporary here, in order to solve the scoping
1648 problem described above. */
1649 target_expr = force_target_expr (type, expr);
1650 expr = TARGET_EXPR_INITIAL (target_expr);
1651 expr = build2 (INIT_EXPR,
1653 TARGET_EXPR_SLOT (target_expr),
1656 TARGET_EXPR_INITIAL (target_expr) = NULL_TREE;
1657 /* Save away the TARGET_EXPR in the TREE_TYPE field of the
1658 STATEMENT_EXPR. We will retrieve it in
1659 finish_stmt_expr. */
1660 TREE_TYPE (stmt_expr) = target_expr;
1664 /* Having modified EXPR to reflect the extra initialization, we now
1665 treat it just like an ordinary statement. */
1666 expr = finish_expr_stmt (expr);
1668 /* Mark the last statement so that we can recognize it as such at
1669 template-instantiation time. */
1670 if (expr && processing_template_decl)
1671 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1676 /* Finish a statement-expression. EXPR should be the value returned
1677 by the previous begin_stmt_expr. Returns an expression
1678 representing the statement-expression. */
1681 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1686 if (error_operand_p (stmt_expr))
1687 return error_mark_node;
1689 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1691 type = TREE_TYPE (stmt_expr);
1692 result = pop_stmt_list (stmt_expr);
1694 if (processing_template_decl)
1696 result = build_min (STMT_EXPR, type, result);
1697 TREE_SIDE_EFFECTS (result) = 1;
1698 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1700 else if (!TYPE_P (type))
1702 gcc_assert (TREE_CODE (type) == TARGET_EXPR);
1703 TARGET_EXPR_INITIAL (type) = result;
1704 TREE_TYPE (result) = void_type_node;
1711 /* Perform Koenig lookup. FN is the postfix-expression representing
1712 the function (or functions) to call; ARGS are the arguments to the
1713 call. Returns the functions to be considered by overload
1717 perform_koenig_lookup (tree fn, tree args)
1719 tree identifier = NULL_TREE;
1720 tree functions = NULL_TREE;
1722 /* Find the name of the overloaded function. */
1723 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1725 else if (is_overloaded_fn (fn))
1728 identifier = DECL_NAME (get_first_fn (functions));
1730 else if (DECL_P (fn))
1733 identifier = DECL_NAME (fn);
1736 /* A call to a namespace-scope function using an unqualified name.
1738 Do Koenig lookup -- unless any of the arguments are
1740 if (!any_type_dependent_arguments_p (args))
1742 fn = lookup_arg_dependent (identifier, functions, args);
1744 /* The unqualified name could not be resolved. */
1745 fn = unqualified_fn_lookup_error (identifier);
1751 /* Generate an expression for `FN (ARGS)'.
1753 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1754 as a virtual call, even if FN is virtual. (This flag is set when
1755 encountering an expression where the function name is explicitly
1756 qualified. For example a call to `X::f' never generates a virtual
1759 Returns code for the call. */
1762 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p)
1768 if (fn == error_mark_node || args == error_mark_node)
1769 return error_mark_node;
1771 /* ARGS should be a list of arguments. */
1772 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1777 if (processing_template_decl)
1779 if (type_dependent_expression_p (fn)
1780 || any_type_dependent_arguments_p (args))
1782 result = build_nt (CALL_EXPR, fn, args, NULL_TREE);
1783 KOENIG_LOOKUP_P (result) = koenig_p;
1786 if (!BASELINK_P (fn)
1787 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1788 && TREE_TYPE (fn) != unknown_type_node)
1789 fn = build_non_dependent_expr (fn);
1790 args = build_non_dependent_args (orig_args);
1793 /* A reference to a member function will appear as an overloaded
1794 function (rather than a BASELINK) if an unqualified name was used
1796 if (!BASELINK_P (fn) && is_overloaded_fn (fn))
1800 if (TREE_CODE (f) == TEMPLATE_ID_EXPR)
1801 f = TREE_OPERAND (f, 0);
1802 f = get_first_fn (f);
1803 if (DECL_FUNCTION_MEMBER_P (f))
1805 tree type = currently_open_derived_class (DECL_CONTEXT (f));
1807 type = DECL_CONTEXT (f);
1808 fn = build_baselink (TYPE_BINFO (type),
1810 fn, /*optype=*/NULL_TREE);
1815 if (BASELINK_P (fn))
1819 /* A call to a member function. From [over.call.func]:
1821 If the keyword this is in scope and refers to the class of
1822 that member function, or a derived class thereof, then the
1823 function call is transformed into a qualified function call
1824 using (*this) as the postfix-expression to the left of the
1825 . operator.... [Otherwise] a contrived object of type T
1826 becomes the implied object argument.
1828 This paragraph is unclear about this situation:
1830 struct A { void f(); };
1831 struct B : public A {};
1832 struct C : public A { void g() { B::f(); }};
1834 In particular, for `B::f', this paragraph does not make clear
1835 whether "the class of that member function" refers to `A' or
1836 to `B'. We believe it refers to `B'. */
1837 if (current_class_type
1838 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1840 && current_class_ref)
1841 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1845 tree representative_fn;
1847 representative_fn = BASELINK_FUNCTIONS (fn);
1848 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1849 representative_fn = TREE_OPERAND (representative_fn, 0);
1850 representative_fn = get_first_fn (representative_fn);
1851 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1854 if (processing_template_decl)
1856 if (type_dependent_expression_p (object))
1857 return build_nt (CALL_EXPR, orig_fn, orig_args, NULL_TREE);
1858 object = build_non_dependent_expr (object);
1861 result = build_new_method_call (object, fn, args, NULL_TREE,
1863 ? LOOKUP_NONVIRTUAL : 0),
1866 else if (is_overloaded_fn (fn))
1868 /* If the function is an overloaded builtin, resolve it. */
1869 if (TREE_CODE (fn) == FUNCTION_DECL
1870 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
1871 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
1872 result = resolve_overloaded_builtin (fn, args);
1875 /* A call to a namespace-scope function. */
1876 result = build_new_function_call (fn, args, koenig_p);
1878 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1881 error ("arguments to destructor are not allowed");
1882 /* Mark the pseudo-destructor call as having side-effects so
1883 that we do not issue warnings about its use. */
1884 result = build1 (NOP_EXPR,
1886 TREE_OPERAND (fn, 0));
1887 TREE_SIDE_EFFECTS (result) = 1;
1889 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1890 /* If the "function" is really an object of class type, it might
1891 have an overloaded `operator ()'. */
1892 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1893 /*overloaded_p=*/NULL);
1896 /* A call where the function is unknown. */
1897 result = build_function_call (fn, args);
1899 if (processing_template_decl)
1901 result = build3 (CALL_EXPR, TREE_TYPE (result), orig_fn,
1902 orig_args, NULL_TREE);
1903 KOENIG_LOOKUP_P (result) = koenig_p;
1908 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1909 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1910 POSTDECREMENT_EXPR.) */
1913 finish_increment_expr (tree expr, enum tree_code code)
1915 return build_x_unary_op (code, expr);
1918 /* Finish a use of `this'. Returns an expression for `this'. */
1921 finish_this_expr (void)
1925 if (current_class_ptr)
1927 result = current_class_ptr;
1929 else if (current_function_decl
1930 && DECL_STATIC_FUNCTION_P (current_function_decl))
1932 error ("%<this%> is unavailable for static member functions");
1933 result = error_mark_node;
1937 if (current_function_decl)
1938 error ("invalid use of %<this%> in non-member function");
1940 error ("invalid use of %<this%> at top level");
1941 result = error_mark_node;
1947 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
1948 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
1949 the TYPE for the type given. If SCOPE is non-NULL, the expression
1950 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
1953 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
1955 if (destructor == error_mark_node)
1956 return error_mark_node;
1958 gcc_assert (TYPE_P (destructor));
1960 if (!processing_template_decl)
1962 if (scope == error_mark_node)
1964 error ("invalid qualifying scope in pseudo-destructor name");
1965 return error_mark_node;
1968 /* [expr.pseudo] says both:
1970 The type designated by the pseudo-destructor-name shall be
1971 the same as the object type.
1975 The cv-unqualified versions of the object type and of the
1976 type designated by the pseudo-destructor-name shall be the
1979 We implement the more generous second sentence, since that is
1980 what most other compilers do. */
1981 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
1984 error ("%qE is not of type %qT", object, destructor);
1985 return error_mark_node;
1989 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
1992 /* Finish an expression of the form CODE EXPR. */
1995 finish_unary_op_expr (enum tree_code code, tree expr)
1997 tree result = build_x_unary_op (code, expr);
1998 /* Inside a template, build_x_unary_op does not fold the
1999 expression. So check whether the result is folded before
2000 setting TREE_NEGATED_INT. */
2001 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
2002 && TREE_CODE (result) == INTEGER_CST
2003 && !TYPE_UNSIGNED (TREE_TYPE (result))
2004 && INT_CST_LT (result, integer_zero_node))
2006 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2007 setting TREE_NEGATED_INT. */
2008 result = copy_node (result);
2009 TREE_NEGATED_INT (result) = 1;
2011 overflow_warning (result);
2015 /* Finish a compound-literal expression. TYPE is the type to which
2016 the INITIALIZER_LIST is being cast. */
2019 finish_compound_literal (tree type, VEC(constructor_elt,gc) *initializer_list)
2022 tree compound_literal;
2024 if (!TYPE_OBJ_P (type))
2026 error ("compound literal of non-object type %qT", type);
2027 return error_mark_node;
2030 /* Build a CONSTRUCTOR for the INITIALIZER_LIST. */
2031 compound_literal = build_constructor (NULL_TREE, initializer_list);
2032 if (processing_template_decl)
2034 TREE_TYPE (compound_literal) = type;
2035 /* Mark the expression as a compound literal. */
2036 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2037 return compound_literal;
2040 /* Create a temporary variable to represent the compound literal. */
2041 var = create_temporary_var (type);
2042 if (!current_function_decl)
2044 /* If this compound-literal appears outside of a function, then
2045 the corresponding variable has static storage duration, just
2046 like the variable in whose initializer it appears. */
2047 TREE_STATIC (var) = 1;
2048 /* The variable has internal linkage, since there is no need to
2049 reference it from another translation unit. */
2050 TREE_PUBLIC (var) = 0;
2051 /* It must have a name, so that the name mangler can mangle it. */
2052 DECL_NAME (var) = make_anon_name ();
2054 /* We must call pushdecl, since the gimplifier complains if the
2055 variable hase been declared via a BIND_EXPR. */
2057 /* Initialize the variable as we would any other variable with a
2058 brace-enclosed initializer. */
2059 cp_finish_decl (var, compound_literal,
2060 /*init_const_expr_p=*/false,
2061 /*asmspec_tree=*/NULL_TREE,
2062 LOOKUP_ONLYCONVERTING);
2066 /* Return the declaration for the function-name variable indicated by
2070 finish_fname (tree id)
2074 decl = fname_decl (C_RID_CODE (id), id);
2075 if (processing_template_decl)
2076 decl = DECL_NAME (decl);
2080 /* Finish a translation unit. */
2083 finish_translation_unit (void)
2085 /* In case there were missing closebraces,
2086 get us back to the global binding level. */
2088 while (current_namespace != global_namespace)
2091 /* Do file scope __FUNCTION__ et al. */
2092 finish_fname_decls ();
2095 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2096 Returns the parameter. */
2099 finish_template_type_parm (tree aggr, tree identifier)
2101 if (aggr != class_type_node)
2103 pedwarn ("template type parameters must use the keyword %<class%> or %<typename%>");
2104 aggr = class_type_node;
2107 return build_tree_list (aggr, identifier);
2110 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2111 Returns the parameter. */
2114 finish_template_template_parm (tree aggr, tree identifier)
2116 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2117 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2118 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2119 DECL_TEMPLATE_RESULT (tmpl) = decl;
2120 DECL_ARTIFICIAL (decl) = 1;
2121 end_template_decl ();
2123 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2125 return finish_template_type_parm (aggr, tmpl);
2128 /* ARGUMENT is the default-argument value for a template template
2129 parameter. If ARGUMENT is invalid, issue error messages and return
2130 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2133 check_template_template_default_arg (tree argument)
2135 if (TREE_CODE (argument) != TEMPLATE_DECL
2136 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2137 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2139 if (TREE_CODE (argument) == TYPE_DECL)
2141 tree t = TREE_TYPE (argument);
2143 /* Try to emit a slightly smarter error message if we detect
2144 that the user is using a template instantiation. */
2145 if (CLASSTYPE_TEMPLATE_INFO (t)
2146 && CLASSTYPE_TEMPLATE_INSTANTIATION (t))
2147 error ("invalid use of type %qT as a default value for a "
2148 "template template-parameter", t);
2150 error ("invalid use of %qD as a default value for a template "
2151 "template-parameter", argument);
2154 error ("invalid default argument for a template template parameter");
2155 return error_mark_node;
2161 /* Begin a class definition, as indicated by T. */
2164 begin_class_definition (tree t)
2166 if (t == error_mark_node)
2167 return error_mark_node;
2169 if (processing_template_parmlist)
2171 error ("definition of %q#T inside template parameter list", t);
2172 return error_mark_node;
2174 /* A non-implicit typename comes from code like:
2176 template <typename T> struct A {
2177 template <typename U> struct A<T>::B ...
2179 This is erroneous. */
2180 else if (TREE_CODE (t) == TYPENAME_TYPE)
2182 error ("invalid definition of qualified type %qT", t);
2183 t = error_mark_node;
2186 if (t == error_mark_node || ! IS_AGGR_TYPE (t))
2188 t = make_aggr_type (RECORD_TYPE);
2189 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2192 /* Update the location of the decl. */
2193 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2195 if (TYPE_BEING_DEFINED (t))
2197 t = make_aggr_type (TREE_CODE (t));
2198 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2200 maybe_process_partial_specialization (t);
2202 TYPE_BEING_DEFINED (t) = 1;
2203 if (flag_pack_struct)
2206 TYPE_PACKED (t) = 1;
2207 /* Even though the type is being defined for the first time
2208 here, there might have been a forward declaration, so there
2209 might be cv-qualified variants of T. */
2210 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2211 TYPE_PACKED (v) = 1;
2213 /* Reset the interface data, at the earliest possible
2214 moment, as it might have been set via a class foo;
2216 if (! TYPE_ANONYMOUS_P (t))
2218 struct c_fileinfo *finfo = get_fileinfo (lbasename (input_filename));
2219 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2220 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2221 (t, finfo->interface_unknown);
2223 reset_specialization();
2225 /* Make a declaration for this class in its own scope. */
2226 build_self_reference ();
2231 /* Finish the member declaration given by DECL. */
2234 finish_member_declaration (tree decl)
2236 if (decl == error_mark_node || decl == NULL_TREE)
2239 if (decl == void_type_node)
2240 /* The COMPONENT was a friend, not a member, and so there's
2241 nothing for us to do. */
2244 /* We should see only one DECL at a time. */
2245 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2247 /* Set up access control for DECL. */
2249 = (current_access_specifier == access_private_node);
2250 TREE_PROTECTED (decl)
2251 = (current_access_specifier == access_protected_node);
2252 if (TREE_CODE (decl) == TEMPLATE_DECL)
2254 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2255 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2258 /* Mark the DECL as a member of the current class. */
2259 DECL_CONTEXT (decl) = current_class_type;
2263 A C language linkage is ignored for the names of class members
2264 and the member function type of class member functions. */
2265 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2266 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2268 /* Put functions on the TYPE_METHODS list and everything else on the
2269 TYPE_FIELDS list. Note that these are built up in reverse order.
2270 We reverse them (to obtain declaration order) in finish_struct. */
2271 if (TREE_CODE (decl) == FUNCTION_DECL
2272 || DECL_FUNCTION_TEMPLATE_P (decl))
2274 /* We also need to add this function to the
2275 CLASSTYPE_METHOD_VEC. */
2276 if (add_method (current_class_type, decl, NULL_TREE))
2278 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2279 TYPE_METHODS (current_class_type) = decl;
2281 maybe_add_class_template_decl_list (current_class_type, decl,
2285 /* Enter the DECL into the scope of the class. */
2286 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2287 || pushdecl_class_level (decl))
2289 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2290 go at the beginning. The reason is that lookup_field_1
2291 searches the list in order, and we want a field name to
2292 override a type name so that the "struct stat hack" will
2293 work. In particular:
2295 struct S { enum E { }; int E } s;
2298 is valid. In addition, the FIELD_DECLs must be maintained in
2299 declaration order so that class layout works as expected.
2300 However, we don't need that order until class layout, so we
2301 save a little time by putting FIELD_DECLs on in reverse order
2302 here, and then reversing them in finish_struct_1. (We could
2303 also keep a pointer to the correct insertion points in the
2306 if (TREE_CODE (decl) == TYPE_DECL)
2307 TYPE_FIELDS (current_class_type)
2308 = chainon (TYPE_FIELDS (current_class_type), decl);
2311 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2312 TYPE_FIELDS (current_class_type) = decl;
2315 maybe_add_class_template_decl_list (current_class_type, decl,
2320 note_decl_for_pch (decl);
2323 /* DECL has been declared while we are building a PCH file. Perform
2324 actions that we might normally undertake lazily, but which can be
2325 performed now so that they do not have to be performed in
2326 translation units which include the PCH file. */
2329 note_decl_for_pch (tree decl)
2331 gcc_assert (pch_file);
2333 /* There's a good chance that we'll have to mangle names at some
2334 point, even if only for emission in debugging information. */
2335 if (TREE_CODE (decl) == VAR_DECL
2336 || TREE_CODE (decl) == FUNCTION_DECL)
2340 /* Finish processing a complete template declaration. The PARMS are
2341 the template parameters. */
2344 finish_template_decl (tree parms)
2347 end_template_decl ();
2349 end_specialization ();
2352 /* Finish processing a template-id (which names a type) of the form
2353 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2354 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2355 the scope of template-id indicated. */
2358 finish_template_type (tree name, tree args, int entering_scope)
2362 decl = lookup_template_class (name, args,
2363 NULL_TREE, NULL_TREE, entering_scope,
2364 tf_warning_or_error | tf_user);
2365 if (decl != error_mark_node)
2366 decl = TYPE_STUB_DECL (decl);
2371 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2372 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2373 BASE_CLASS, or NULL_TREE if an error occurred. The
2374 ACCESS_SPECIFIER is one of
2375 access_{default,public,protected_private}_node. For a virtual base
2376 we set TREE_TYPE. */
2379 finish_base_specifier (tree base, tree access, bool virtual_p)
2383 if (base == error_mark_node)
2385 error ("invalid base-class specification");
2388 else if (! is_aggr_type (base, 1))
2392 if (cp_type_quals (base) != 0)
2394 error ("base class %qT has cv qualifiers", base);
2395 base = TYPE_MAIN_VARIANT (base);
2397 result = build_tree_list (access, base);
2399 TREE_TYPE (result) = integer_type_node;
2405 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2406 what we found when we tried to do the lookup. */
2409 qualified_name_lookup_error (tree scope, tree name, tree decl)
2411 if (scope == error_mark_node)
2412 ; /* We already complained. */
2413 else if (TYPE_P (scope))
2415 if (!COMPLETE_TYPE_P (scope))
2416 error ("incomplete type %qT used in nested name specifier", scope);
2417 else if (TREE_CODE (decl) == TREE_LIST)
2419 error ("reference to %<%T::%D%> is ambiguous", scope, name);
2420 print_candidates (decl);
2423 error ("%qD is not a member of %qT", name, scope);
2425 else if (scope != global_namespace)
2426 error ("%qD is not a member of %qD", name, scope);
2428 error ("%<::%D%> has not been declared", name);
2431 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2432 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2433 if non-NULL, is the type or namespace used to explicitly qualify
2434 ID_EXPRESSION. DECL is the entity to which that name has been
2437 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2438 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2439 be set to true if this expression isn't permitted in a
2440 constant-expression, but it is otherwise not set by this function.
2441 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2442 constant-expression, but a non-constant expression is also
2445 DONE is true if this expression is a complete postfix-expression;
2446 it is false if this expression is followed by '->', '[', '(', etc.
2447 ADDRESS_P is true iff this expression is the operand of '&'.
2448 TEMPLATE_P is true iff the qualified-id was of the form
2449 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2450 appears as a template argument.
2452 If an error occurs, and it is the kind of error that might cause
2453 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2454 is the caller's responsibility to issue the message. *ERROR_MSG
2455 will be a string with static storage duration, so the caller need
2458 Return an expression for the entity, after issuing appropriate
2459 diagnostics. This function is also responsible for transforming a
2460 reference to a non-static member into a COMPONENT_REF that makes
2461 the use of "this" explicit.
2463 Upon return, *IDK will be filled in appropriately. */
2466 finish_id_expression (tree id_expression,
2470 bool integral_constant_expression_p,
2471 bool allow_non_integral_constant_expression_p,
2472 bool *non_integral_constant_expression_p,
2476 bool template_arg_p,
2477 const char **error_msg)
2479 /* Initialize the output parameters. */
2480 *idk = CP_ID_KIND_NONE;
2483 if (id_expression == error_mark_node)
2484 return error_mark_node;
2485 /* If we have a template-id, then no further lookup is
2486 required. If the template-id was for a template-class, we
2487 will sometimes have a TYPE_DECL at this point. */
2488 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2489 || TREE_CODE (decl) == TYPE_DECL)
2491 /* Look up the name. */
2494 if (decl == error_mark_node)
2496 /* Name lookup failed. */
2499 || (!dependent_type_p (scope)
2500 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2501 && IDENTIFIER_TYPENAME_P (id_expression)
2502 && dependent_type_p (TREE_TYPE (id_expression))))))
2504 /* If the qualifying type is non-dependent (and the name
2505 does not name a conversion operator to a dependent
2506 type), issue an error. */
2507 qualified_name_lookup_error (scope, id_expression, decl);
2508 return error_mark_node;
2512 /* It may be resolved via Koenig lookup. */
2513 *idk = CP_ID_KIND_UNQUALIFIED;
2514 return id_expression;
2517 decl = id_expression;
2519 /* If DECL is a variable that would be out of scope under
2520 ANSI/ISO rules, but in scope in the ARM, name lookup
2521 will succeed. Issue a diagnostic here. */
2523 decl = check_for_out_of_scope_variable (decl);
2525 /* Remember that the name was used in the definition of
2526 the current class so that we can check later to see if
2527 the meaning would have been different after the class
2528 was entirely defined. */
2529 if (!scope && decl != error_mark_node)
2530 maybe_note_name_used_in_class (id_expression, decl);
2532 /* Disallow uses of local variables from containing functions. */
2533 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2535 tree context = decl_function_context (decl);
2536 if (context != NULL_TREE && context != current_function_decl
2537 && ! TREE_STATIC (decl))
2539 error (TREE_CODE (decl) == VAR_DECL
2540 ? "use of %<auto%> variable from containing function"
2541 : "use of parameter from containing function");
2542 error (" %q+#D declared here", decl);
2543 return error_mark_node;
2548 /* If we didn't find anything, or what we found was a type,
2549 then this wasn't really an id-expression. */
2550 if (TREE_CODE (decl) == TEMPLATE_DECL
2551 && !DECL_FUNCTION_TEMPLATE_P (decl))
2553 *error_msg = "missing template arguments";
2554 return error_mark_node;
2556 else if (TREE_CODE (decl) == TYPE_DECL
2557 || TREE_CODE (decl) == NAMESPACE_DECL)
2559 *error_msg = "expected primary-expression";
2560 return error_mark_node;
2563 /* If the name resolved to a template parameter, there is no
2564 need to look it up again later. */
2565 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2566 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2570 *idk = CP_ID_KIND_NONE;
2571 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2572 decl = TEMPLATE_PARM_DECL (decl);
2573 r = convert_from_reference (DECL_INITIAL (decl));
2575 if (integral_constant_expression_p
2576 && !dependent_type_p (TREE_TYPE (decl))
2577 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2579 if (!allow_non_integral_constant_expression_p)
2580 error ("template parameter %qD of type %qT is not allowed in "
2581 "an integral constant expression because it is not of "
2582 "integral or enumeration type", decl, TREE_TYPE (decl));
2583 *non_integral_constant_expression_p = true;
2587 /* Similarly, we resolve enumeration constants to their
2588 underlying values. */
2589 else if (TREE_CODE (decl) == CONST_DECL)
2591 *idk = CP_ID_KIND_NONE;
2592 if (!processing_template_decl)
2593 return DECL_INITIAL (decl);
2600 /* If the declaration was explicitly qualified indicate
2601 that. The semantics of `A::f(3)' are different than
2602 `f(3)' if `f' is virtual. */
2604 ? CP_ID_KIND_QUALIFIED
2605 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2606 ? CP_ID_KIND_TEMPLATE_ID
2607 : CP_ID_KIND_UNQUALIFIED));
2612 An id-expression is type-dependent if it contains an
2613 identifier that was declared with a dependent type.
2615 The standard is not very specific about an id-expression that
2616 names a set of overloaded functions. What if some of them
2617 have dependent types and some of them do not? Presumably,
2618 such a name should be treated as a dependent name. */
2619 /* Assume the name is not dependent. */
2620 dependent_p = false;
2621 if (!processing_template_decl)
2622 /* No names are dependent outside a template. */
2624 /* A template-id where the name of the template was not resolved
2625 is definitely dependent. */
2626 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2627 && (TREE_CODE (TREE_OPERAND (decl, 0))
2628 == IDENTIFIER_NODE))
2630 /* For anything except an overloaded function, just check its
2632 else if (!is_overloaded_fn (decl))
2634 = dependent_type_p (TREE_TYPE (decl));
2635 /* For a set of overloaded functions, check each of the
2641 if (BASELINK_P (fns))
2642 fns = BASELINK_FUNCTIONS (fns);
2644 /* For a template-id, check to see if the template
2645 arguments are dependent. */
2646 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2648 tree args = TREE_OPERAND (fns, 1);
2649 dependent_p = any_dependent_template_arguments_p (args);
2650 /* The functions are those referred to by the
2652 fns = TREE_OPERAND (fns, 0);
2655 /* If there are no dependent template arguments, go through
2656 the overloaded functions. */
2657 while (fns && !dependent_p)
2659 tree fn = OVL_CURRENT (fns);
2661 /* Member functions of dependent classes are
2663 if (TREE_CODE (fn) == FUNCTION_DECL
2664 && type_dependent_expression_p (fn))
2666 else if (TREE_CODE (fn) == TEMPLATE_DECL
2667 && dependent_template_p (fn))
2670 fns = OVL_NEXT (fns);
2674 /* If the name was dependent on a template parameter, we will
2675 resolve the name at instantiation time. */
2678 /* Create a SCOPE_REF for qualified names, if the scope is
2682 /* Since this name was dependent, the expression isn't
2683 constant -- yet. No error is issued because it might
2684 be constant when things are instantiated. */
2685 if (integral_constant_expression_p)
2686 *non_integral_constant_expression_p = true;
2689 if (address_p && done)
2690 decl = finish_qualified_id_expr (scope, decl,
2694 else if (dependent_type_p (scope))
2695 decl = build_qualified_name (/*type=*/NULL_TREE,
2699 else if (DECL_P (decl))
2700 decl = build_qualified_name (TREE_TYPE (decl),
2705 if (TREE_TYPE (decl))
2706 decl = convert_from_reference (decl);
2709 /* A TEMPLATE_ID already contains all the information we
2711 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2712 return id_expression;
2713 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2714 /* If we found a variable, then name lookup during the
2715 instantiation will always resolve to the same VAR_DECL
2716 (or an instantiation thereof). */
2717 if (TREE_CODE (decl) == VAR_DECL
2718 || TREE_CODE (decl) == PARM_DECL)
2719 return convert_from_reference (decl);
2720 /* The same is true for FIELD_DECL, but we also need to
2721 make sure that the syntax is correct. */
2722 else if (TREE_CODE (decl) == FIELD_DECL)
2724 /* Since SCOPE is NULL here, this is an unqualified name.
2725 Access checking has been performed during name lookup
2726 already. Turn off checking to avoid duplicate errors. */
2727 push_deferring_access_checks (dk_no_check);
2728 decl = finish_non_static_data_member
2729 (decl, current_class_ref,
2730 /*qualifying_scope=*/NULL_TREE);
2731 pop_deferring_access_checks ();
2734 return id_expression;
2737 /* Only certain kinds of names are allowed in constant
2738 expression. Enumerators and template parameters have already
2739 been handled above. */
2740 if (integral_constant_expression_p
2741 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2742 && ! builtin_valid_in_constant_expr_p (decl))
2744 if (!allow_non_integral_constant_expression_p)
2746 error ("%qD cannot appear in a constant-expression", decl);
2747 return error_mark_node;
2749 *non_integral_constant_expression_p = true;
2752 if (TREE_CODE (decl) == NAMESPACE_DECL)
2754 error ("use of namespace %qD as expression", decl);
2755 return error_mark_node;
2757 else if (DECL_CLASS_TEMPLATE_P (decl))
2759 error ("use of class template %qT as expression", decl);
2760 return error_mark_node;
2762 else if (TREE_CODE (decl) == TREE_LIST)
2764 /* Ambiguous reference to base members. */
2765 error ("request for member %qD is ambiguous in "
2766 "multiple inheritance lattice", id_expression);
2767 print_candidates (decl);
2768 return error_mark_node;
2771 /* Mark variable-like entities as used. Functions are similarly
2772 marked either below or after overload resolution. */
2773 if (TREE_CODE (decl) == VAR_DECL
2774 || TREE_CODE (decl) == PARM_DECL
2775 || TREE_CODE (decl) == RESULT_DECL)
2780 decl = (adjust_result_of_qualified_name_lookup
2781 (decl, scope, current_class_type));
2783 if (TREE_CODE (decl) == FUNCTION_DECL)
2786 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2787 decl = finish_qualified_id_expr (scope,
2795 tree r = convert_from_reference (decl);
2797 if (processing_template_decl && TYPE_P (scope))
2798 r = build_qualified_name (TREE_TYPE (r),
2804 else if (TREE_CODE (decl) == FIELD_DECL)
2806 /* Since SCOPE is NULL here, this is an unqualified name.
2807 Access checking has been performed during name lookup
2808 already. Turn off checking to avoid duplicate errors. */
2809 push_deferring_access_checks (dk_no_check);
2810 decl = finish_non_static_data_member (decl, current_class_ref,
2811 /*qualifying_scope=*/NULL_TREE);
2812 pop_deferring_access_checks ();
2814 else if (is_overloaded_fn (decl))
2816 tree first_fn = OVL_CURRENT (decl);
2818 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2819 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2821 if (!really_overloaded_fn (decl))
2822 mark_used (first_fn);
2825 && TREE_CODE (first_fn) == FUNCTION_DECL
2826 && DECL_FUNCTION_MEMBER_P (first_fn)
2827 && !shared_member_p (decl))
2829 /* A set of member functions. */
2830 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
2831 return finish_class_member_access_expr (decl, id_expression,
2832 /*template_p=*/false);
2837 if (DECL_P (decl) && DECL_NONLOCAL (decl)
2838 && DECL_CLASS_SCOPE_P (decl)
2839 && DECL_CONTEXT (decl) != current_class_type)
2843 path = currently_open_derived_class (DECL_CONTEXT (decl));
2844 perform_or_defer_access_check (TYPE_BINFO (path), decl);
2847 decl = convert_from_reference (decl);
2851 if (TREE_DEPRECATED (decl))
2852 warn_deprecated_use (decl);
2857 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
2858 use as a type-specifier. */
2861 finish_typeof (tree expr)
2865 if (type_dependent_expression_p (expr))
2867 type = make_aggr_type (TYPEOF_TYPE);
2868 TYPEOF_TYPE_EXPR (type) = expr;
2873 type = TREE_TYPE (expr);
2875 if (!type || type == unknown_type_node)
2877 error ("type of %qE is unknown", expr);
2878 return error_mark_node;
2884 /* Perform C++-specific checks for __builtin_offsetof before calling
2888 finish_offsetof (tree expr)
2890 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
2891 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
2892 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
2894 error ("cannot apply %<offsetof%> to member function %qD",
2895 TREE_OPERAND (expr, 1));
2896 return error_mark_node;
2898 return fold_offsetof (expr);
2901 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
2902 with equivalent CALL_EXPRs. */
2905 simplify_aggr_init_exprs_r (tree* tp,
2907 void* data ATTRIBUTE_UNUSED)
2909 /* We don't need to walk into types; there's nothing in a type that
2910 needs simplification. (And, furthermore, there are places we
2911 actively don't want to go. For example, we don't want to wander
2912 into the default arguments for a FUNCTION_DECL that appears in a
2919 /* Only AGGR_INIT_EXPRs are interesting. */
2920 else if (TREE_CODE (*tp) != AGGR_INIT_EXPR)
2923 simplify_aggr_init_expr (tp);
2925 /* Keep iterating. */
2929 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
2930 function is broken out from the above for the benefit of the tree-ssa
2934 simplify_aggr_init_expr (tree *tp)
2936 tree aggr_init_expr = *tp;
2938 /* Form an appropriate CALL_EXPR. */
2939 tree fn = TREE_OPERAND (aggr_init_expr, 0);
2940 tree args = TREE_OPERAND (aggr_init_expr, 1);
2941 tree slot = TREE_OPERAND (aggr_init_expr, 2);
2942 tree type = TREE_TYPE (slot);
2945 enum style_t { ctor, arg, pcc } style;
2947 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
2949 #ifdef PCC_STATIC_STRUCT_RETURN
2955 gcc_assert (TREE_ADDRESSABLE (type));
2961 /* Replace the first argument to the ctor with the address of the
2965 args = TREE_CHAIN (args);
2966 cxx_mark_addressable (slot);
2967 addr = build1 (ADDR_EXPR, build_pointer_type (type), slot);
2968 args = tree_cons (NULL_TREE, addr, args);
2971 call_expr = build3 (CALL_EXPR,
2972 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
2973 fn, args, NULL_TREE);
2977 /* Just mark it addressable here, and leave the rest to
2978 expand_call{,_inline}. */
2979 cxx_mark_addressable (slot);
2980 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
2981 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
2983 else if (style == pcc)
2985 /* If we're using the non-reentrant PCC calling convention, then we
2986 need to copy the returned value out of the static buffer into the
2988 push_deferring_access_checks (dk_no_check);
2989 call_expr = build_aggr_init (slot, call_expr,
2990 DIRECT_BIND | LOOKUP_ONLYCONVERTING);
2991 pop_deferring_access_checks ();
2992 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
2998 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3001 emit_associated_thunks (tree fn)
3003 /* When we use vcall offsets, we emit thunks with the virtual
3004 functions to which they thunk. The whole point of vcall offsets
3005 is so that you can know statically the entire set of thunks that
3006 will ever be needed for a given virtual function, thereby
3007 enabling you to output all the thunks with the function itself. */
3008 if (DECL_VIRTUAL_P (fn))
3012 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3014 if (!THUNK_ALIAS (thunk))
3016 use_thunk (thunk, /*emit_p=*/1);
3017 if (DECL_RESULT_THUNK_P (thunk))
3021 for (probe = DECL_THUNKS (thunk);
3022 probe; probe = TREE_CHAIN (probe))
3023 use_thunk (probe, /*emit_p=*/1);
3027 gcc_assert (!DECL_THUNKS (thunk));
3032 /* Generate RTL for FN. */
3035 expand_body (tree fn)
3037 tree saved_function;
3039 /* Compute the appropriate object-file linkage for inline
3041 if (DECL_DECLARED_INLINE_P (fn))
3042 import_export_decl (fn);
3044 /* If FN is external, then there's no point in generating RTL for
3045 it. This situation can arise with an inline function under
3046 `-fexternal-templates'; we instantiate the function, even though
3047 we're not planning on emitting it, in case we get a chance to
3049 if (DECL_EXTERNAL (fn))
3052 /* ??? When is this needed? */
3053 saved_function = current_function_decl;
3055 /* Emit any thunks that should be emitted at the same time as FN. */
3056 emit_associated_thunks (fn);
3058 /* This function is only called from cgraph, or recursively from
3059 emit_associated_thunks. In neither case should we be currently
3060 generating trees for a function. */
3061 gcc_assert (function_depth == 0);
3063 tree_rest_of_compilation (fn);
3065 current_function_decl = saved_function;
3067 if (DECL_CLONED_FUNCTION_P (fn))
3069 /* If this is a clone, go through the other clones now and mark
3070 their parameters used. We have to do that here, as we don't
3071 know whether any particular clone will be expanded, and
3072 therefore cannot pick one arbitrarily. */
3075 for (probe = TREE_CHAIN (DECL_CLONED_FUNCTION (fn));
3076 probe && DECL_CLONED_FUNCTION_P (probe);
3077 probe = TREE_CHAIN (probe))
3081 for (parms = DECL_ARGUMENTS (probe);
3082 parms; parms = TREE_CHAIN (parms))
3083 TREE_USED (parms) = 1;
3088 /* Generate RTL for FN. */
3091 expand_or_defer_fn (tree fn)
3093 /* When the parser calls us after finishing the body of a template
3094 function, we don't really want to expand the body. */
3095 if (processing_template_decl)
3097 /* Normally, collection only occurs in rest_of_compilation. So,
3098 if we don't collect here, we never collect junk generated
3099 during the processing of templates until we hit a
3100 non-template function. It's not safe to do this inside a
3101 nested class, though, as the parser may have local state that
3102 is not a GC root. */
3103 if (!function_depth)
3108 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
3109 walk_tree_without_duplicates (&DECL_SAVED_TREE (fn),
3110 simplify_aggr_init_exprs_r,
3113 /* If this is a constructor or destructor body, we have to clone
3115 if (maybe_clone_body (fn))
3117 /* We don't want to process FN again, so pretend we've written
3118 it out, even though we haven't. */
3119 TREE_ASM_WRITTEN (fn) = 1;
3123 /* If this function is marked with the constructor attribute, add it
3124 to the list of functions to be called along with constructors
3125 from static duration objects. */
3126 if (DECL_STATIC_CONSTRUCTOR (fn))
3127 static_ctors = tree_cons (NULL_TREE, fn, static_ctors);
3129 /* If this function is marked with the destructor attribute, add it
3130 to the list of functions to be called along with destructors from
3131 static duration objects. */
3132 if (DECL_STATIC_DESTRUCTOR (fn))
3133 static_dtors = tree_cons (NULL_TREE, fn, static_dtors);
3135 /* We make a decision about linkage for these functions at the end
3136 of the compilation. Until that point, we do not want the back
3137 end to output them -- but we do want it to see the bodies of
3138 these functions so that it can inline them as appropriate. */
3139 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3141 if (DECL_INTERFACE_KNOWN (fn))
3142 /* We've already made a decision as to how this function will
3146 DECL_EXTERNAL (fn) = 1;
3147 DECL_NOT_REALLY_EXTERN (fn) = 1;
3148 note_vague_linkage_fn (fn);
3149 /* A non-template inline function with external linkage will
3150 always be COMDAT. As we must eventually determine the
3151 linkage of all functions, and as that causes writes to
3152 the data mapped in from the PCH file, it's advantageous
3153 to mark the functions at this point. */
3154 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3156 /* This function must have external linkage, as
3157 otherwise DECL_INTERFACE_KNOWN would have been
3159 gcc_assert (TREE_PUBLIC (fn));
3160 comdat_linkage (fn);
3161 DECL_INTERFACE_KNOWN (fn) = 1;
3165 import_export_decl (fn);
3167 /* If the user wants us to keep all inline functions, then mark
3168 this function as needed so that finish_file will make sure to
3170 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3174 /* There's no reason to do any of the work here if we're only doing
3175 semantic analysis; this code just generates RTL. */
3176 if (flag_syntax_only)
3181 /* Expand or defer, at the whim of the compilation unit manager. */
3182 cgraph_finalize_function (fn, function_depth > 1);
3194 /* Helper function for walk_tree, used by finalize_nrv below. */
3197 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3199 struct nrv_data *dp = (struct nrv_data *)data;
3202 /* No need to walk into types. There wouldn't be any need to walk into
3203 non-statements, except that we have to consider STMT_EXPRs. */
3206 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3207 but differs from using NULL_TREE in that it indicates that we care
3208 about the value of the RESULT_DECL. */
3209 else if (TREE_CODE (*tp) == RETURN_EXPR)
3210 TREE_OPERAND (*tp, 0) = dp->result;
3211 /* Change all cleanups for the NRV to only run when an exception is
3213 else if (TREE_CODE (*tp) == CLEANUP_STMT
3214 && CLEANUP_DECL (*tp) == dp->var)
3215 CLEANUP_EH_ONLY (*tp) = 1;
3216 /* Replace the DECL_EXPR for the NRV with an initialization of the
3217 RESULT_DECL, if needed. */
3218 else if (TREE_CODE (*tp) == DECL_EXPR
3219 && DECL_EXPR_DECL (*tp) == dp->var)
3222 if (DECL_INITIAL (dp->var)
3223 && DECL_INITIAL (dp->var) != error_mark_node)
3225 init = build2 (INIT_EXPR, void_type_node, dp->result,
3226 DECL_INITIAL (dp->var));
3227 DECL_INITIAL (dp->var) = error_mark_node;
3230 init = build_empty_stmt ();
3231 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3234 /* And replace all uses of the NRV with the RESULT_DECL. */
3235 else if (*tp == dp->var)
3238 /* Avoid walking into the same tree more than once. Unfortunately, we
3239 can't just use walk_tree_without duplicates because it would only call
3240 us for the first occurrence of dp->var in the function body. */
3241 slot = htab_find_slot (dp->visited, *tp, INSERT);
3247 /* Keep iterating. */
3251 /* Called from finish_function to implement the named return value
3252 optimization by overriding all the RETURN_EXPRs and pertinent
3253 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3254 RESULT_DECL for the function. */
3257 finalize_nrv (tree *tp, tree var, tree result)
3259 struct nrv_data data;
3261 /* Copy debugging information from VAR to RESULT. */
3262 DECL_NAME (result) = DECL_NAME (var);
3263 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3264 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3265 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3266 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3267 /* Don't forget that we take its address. */
3268 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3271 data.result = result;
3272 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3273 walk_tree (tp, finalize_nrv_r, &data, 0);
3274 htab_delete (data.visited);
3277 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3278 Remove any elements from the list that are invalid. */
3281 finish_omp_clauses (tree clauses)
3283 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3284 tree c, t, *pc = &clauses;
3287 bitmap_obstack_initialize (NULL);
3288 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3289 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3290 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3292 for (pc = &clauses, c = clauses; c ; c = *pc)
3294 bool remove = false;
3296 switch (OMP_CLAUSE_CODE (c))
3298 case OMP_CLAUSE_SHARED:
3300 goto check_dup_generic;
3301 case OMP_CLAUSE_PRIVATE:
3303 goto check_dup_generic;
3304 case OMP_CLAUSE_REDUCTION:
3306 goto check_dup_generic;
3307 case OMP_CLAUSE_COPYPRIVATE:
3308 name = "copyprivate";
3309 goto check_dup_generic;
3310 case OMP_CLAUSE_COPYIN:
3312 goto check_dup_generic;
3314 t = OMP_CLAUSE_DECL (c);
3315 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3317 if (processing_template_decl)
3319 error ("%qE is not a variable in clause %qs", t, name);
3322 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3323 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3324 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3326 error ("%qE appears more than once in data clauses", t);
3330 bitmap_set_bit (&generic_head, DECL_UID (t));
3333 case OMP_CLAUSE_FIRSTPRIVATE:
3334 t = OMP_CLAUSE_DECL (c);
3335 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3337 if (processing_template_decl)
3339 error ("%qE is not a variable in clause %<firstprivate%>", t);
3342 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3343 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3345 error ("%qE appears more than once in data clauses", t);
3349 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3352 case OMP_CLAUSE_LASTPRIVATE:
3353 t = OMP_CLAUSE_DECL (c);
3354 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3356 if (processing_template_decl)
3358 error ("%qE is not a variable in clause %<lastprivate%>", t);
3361 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3362 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3364 error ("%qE appears more than once in data clauses", t);
3368 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3372 t = OMP_CLAUSE_IF_EXPR (c);
3373 t = maybe_convert_cond (t);
3374 if (t == error_mark_node)
3376 OMP_CLAUSE_IF_EXPR (c) = t;
3379 case OMP_CLAUSE_NUM_THREADS:
3380 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3381 if (t == error_mark_node)
3383 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
3384 && !type_dependent_expression_p (t))
3386 error ("num_threads expression must be integral");
3391 case OMP_CLAUSE_SCHEDULE:
3392 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3395 else if (t == error_mark_node)
3397 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
3398 && !type_dependent_expression_p (t))
3400 error ("schedule chunk size expression must be integral");
3405 case OMP_CLAUSE_NOWAIT:
3406 case OMP_CLAUSE_ORDERED:
3407 case OMP_CLAUSE_DEFAULT:
3415 *pc = OMP_CLAUSE_CHAIN (c);
3417 pc = &OMP_CLAUSE_CHAIN (c);
3420 for (pc = &clauses, c = clauses; c ; c = *pc)
3422 enum tree_code c_kind = OMP_CLAUSE_CODE (c);
3423 bool remove = false;
3424 bool need_complete_non_reference = false;
3425 bool need_default_ctor = false;
3426 bool need_copy_ctor = false;
3427 bool need_copy_assignment = false;
3428 bool need_implicitly_determined = false;
3429 tree type, inner_type;
3433 case OMP_CLAUSE_SHARED:
3435 need_implicitly_determined = true;
3437 case OMP_CLAUSE_PRIVATE:
3439 need_complete_non_reference = true;
3440 need_default_ctor = true;
3441 need_implicitly_determined = true;
3443 case OMP_CLAUSE_FIRSTPRIVATE:
3444 name = "firstprivate";
3445 need_complete_non_reference = true;
3446 need_copy_ctor = true;
3447 need_implicitly_determined = true;
3449 case OMP_CLAUSE_LASTPRIVATE:
3450 name = "lastprivate";
3451 need_complete_non_reference = true;
3452 need_copy_assignment = true;
3453 need_implicitly_determined = true;
3455 case OMP_CLAUSE_REDUCTION:
3457 need_implicitly_determined = true;
3459 case OMP_CLAUSE_COPYPRIVATE:
3460 name = "copyprivate";
3461 need_copy_assignment = true;
3463 case OMP_CLAUSE_COPYIN:
3465 need_copy_assignment = true;
3468 pc = &OMP_CLAUSE_CHAIN (c);
3472 t = OMP_CLAUSE_DECL (c);
3473 if (processing_template_decl
3474 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3476 pc = &OMP_CLAUSE_CHAIN (c);
3482 case OMP_CLAUSE_LASTPRIVATE:
3483 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3484 need_default_ctor = true;
3487 case OMP_CLAUSE_REDUCTION:
3488 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3489 || POINTER_TYPE_P (TREE_TYPE (t)))
3491 error ("%qE has invalid type for %<reduction%>", t);
3494 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3496 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3504 error ("%qE has invalid type for %<reduction(%s)%>",
3505 t, operator_name_info[r_code].name);
3511 case OMP_CLAUSE_COPYIN:
3512 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3514 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3523 if (need_complete_non_reference)
3525 t = require_complete_type (t);
3526 if (t == error_mark_node)
3528 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3530 error ("%qE has reference type for %qs", t, name);
3534 if (need_implicitly_determined)
3536 const char *share_name = NULL;
3538 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3539 share_name = "threadprivate";
3540 else switch (cxx_omp_predetermined_sharing (t))
3542 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3544 case OMP_CLAUSE_DEFAULT_SHARED:
3545 share_name = "shared";
3547 case OMP_CLAUSE_DEFAULT_PRIVATE:
3548 share_name = "private";
3555 error ("%qE is predetermined %qs for %qs",
3556 t, share_name, name);
3561 /* We're interested in the base element, not arrays. */
3562 inner_type = type = TREE_TYPE (t);
3563 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3564 inner_type = TREE_TYPE (inner_type);
3566 /* Check for special function availability by building a call to one.
3567 Save the results, because later we won't be in the right context
3568 for making these queries. */
3569 if (CLASS_TYPE_P (inner_type)
3570 && (need_default_ctor || need_copy_ctor || need_copy_assignment))
3572 int save_errorcount = errorcount;
3575 /* Always allocate 3 elements for simplicity. These are the
3576 function decls for the ctor, dtor, and assignment op.
3577 This layout is known to the three lang hooks,
3578 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3579 and cxx_omp_clause_assign_op. */
3580 info = make_tree_vec (3);
3581 CP_OMP_CLAUSE_INFO (c) = info;
3583 if (need_default_ctor
3585 && !TYPE_HAS_TRIVIAL_INIT_REF (inner_type)))
3587 if (need_default_ctor)
3591 t = build_int_cst (build_pointer_type (inner_type), 0);
3592 t = build1 (INDIRECT_REF, inner_type, t);
3593 t = build_tree_list (NULL, t);
3595 t = build_special_member_call (NULL_TREE,
3596 complete_ctor_identifier,
3597 t, inner_type, LOOKUP_NORMAL);
3598 t = get_callee_fndecl (t);
3599 TREE_VEC_ELT (info, 0) = t;
3602 if ((need_default_ctor || need_copy_ctor)
3603 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_type))
3605 t = build_int_cst (build_pointer_type (inner_type), 0);
3606 t = build1 (INDIRECT_REF, inner_type, t);
3607 t = build_special_member_call (t, complete_dtor_identifier,
3608 NULL, inner_type, LOOKUP_NORMAL);
3609 t = get_callee_fndecl (t);
3610 TREE_VEC_ELT (info, 1) = t;
3613 if (need_copy_assignment
3614 && !TYPE_HAS_TRIVIAL_ASSIGN_REF (inner_type))
3616 t = build_int_cst (build_pointer_type (inner_type), 0);
3617 t = build1 (INDIRECT_REF, inner_type, t);
3618 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3619 build_tree_list (NULL, t),
3620 inner_type, LOOKUP_NORMAL);
3622 /* We'll have called convert_from_reference on the call, which
3623 may well have added an indirect_ref. It's unneeded here,
3624 and in the way, so kill it. */
3625 if (TREE_CODE (t) == INDIRECT_REF)
3626 t = TREE_OPERAND (t, 0);
3628 t = get_callee_fndecl (t);
3629 TREE_VEC_ELT (info, 2) = t;
3632 if (errorcount != save_errorcount)
3637 *pc = OMP_CLAUSE_CHAIN (c);
3639 pc = &OMP_CLAUSE_CHAIN (c);
3642 bitmap_obstack_release (NULL);
3646 /* For all variables in the tree_list VARS, mark them as thread local. */
3649 finish_omp_threadprivate (tree vars)
3653 /* Mark every variable in VARS to be assigned thread local storage. */
3654 for (t = vars; t; t = TREE_CHAIN (t))
3656 tree v = TREE_PURPOSE (t);
3658 /* If V had already been marked threadprivate, it doesn't matter
3659 whether it had been used prior to this point. */
3661 && (DECL_LANG_SPECIFIC (v) == NULL
3662 || !CP_DECL_THREADPRIVATE_P (v)))
3663 error ("%qE declared %<threadprivate%> after first use", v);
3664 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3665 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3666 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3667 error ("%<threadprivate%> %qE has incomplete type", v);
3668 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v)))
3669 error ("%<threadprivate%> %qE is not file, namespace "
3670 "or block scope variable", v);
3673 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3674 if (DECL_LANG_SPECIFIC (v) == NULL)
3676 retrofit_lang_decl (v);
3678 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3679 after the allocation of the lang_decl structure. */
3680 if (DECL_DISCRIMINATOR_P (v))
3681 DECL_LANG_SPECIFIC (v)->decl_flags.u2sel = 1;
3684 if (! DECL_THREAD_LOCAL_P (v))
3686 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3687 /* If rtl has been already set for this var, call
3688 make_decl_rtl once again, so that encode_section_info
3689 has a chance to look at the new decl flags. */
3690 if (DECL_RTL_SET_P (v))
3693 CP_DECL_THREADPRIVATE_P (v) = 1;
3698 /* Build an OpenMP structured block. */
3701 begin_omp_structured_block (void)
3703 return do_pushlevel (sk_omp);
3707 finish_omp_structured_block (tree block)
3709 return do_poplevel (block);
3712 /* Similarly, except force the retention of the BLOCK. */
3715 begin_omp_parallel (void)
3717 keep_next_level (true);
3718 return begin_omp_structured_block ();
3722 finish_omp_parallel (tree clauses, tree body)
3726 body = finish_omp_structured_block (body);
3728 stmt = make_node (OMP_PARALLEL);
3729 TREE_TYPE (stmt) = void_type_node;
3730 OMP_PARALLEL_CLAUSES (stmt) = clauses;
3731 OMP_PARALLEL_BODY (stmt) = body;
3733 return add_stmt (stmt);
3736 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
3737 are directly for their associated operands in the statement. DECL
3738 and INIT are a combo; if DECL is NULL then INIT ought to be a
3739 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
3740 optional statements that need to go before the loop into its
3744 finish_omp_for (location_t locus, tree decl, tree init, tree cond,
3745 tree incr, tree body, tree pre_body)
3750 switch (TREE_CODE (init))
3753 decl = TREE_OPERAND (init, 0);
3754 init = TREE_OPERAND (init, 1);
3757 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
3759 decl = TREE_OPERAND (init, 0);
3760 init = TREE_OPERAND (init, 2);
3769 error ("expected iteration declaration or initialization");
3774 if (type_dependent_expression_p (decl)
3775 || type_dependent_expression_p (init)
3776 || (cond && type_dependent_expression_p (cond))
3777 || (incr && type_dependent_expression_p (incr)))
3783 error ("%Hmissing controlling predicate", &locus);
3789 error ("%Hmissing increment expression", &locus);
3793 stmt = make_node (OMP_FOR);
3795 /* This is really just a place-holder. We'll be decomposing this
3796 again and going through the build_modify_expr path below when
3797 we instantiate the thing. */
3798 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
3800 TREE_TYPE (stmt) = void_type_node;
3801 OMP_FOR_INIT (stmt) = init;
3802 OMP_FOR_COND (stmt) = cond;
3803 OMP_FOR_INCR (stmt) = incr;
3804 OMP_FOR_BODY (stmt) = body;
3805 OMP_FOR_PRE_BODY (stmt) = pre_body;
3807 SET_EXPR_LOCATION (stmt, locus);
3808 return add_stmt (stmt);
3813 error ("expected iteration declaration or initialization");
3817 if (pre_body == NULL || IS_EMPTY_STMT (pre_body))
3819 else if (! processing_template_decl)
3821 add_stmt (pre_body);
3824 init = build_modify_expr (decl, NOP_EXPR, init);
3825 return c_finish_omp_for (locus, decl, init, cond, incr, body, pre_body);
3829 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
3831 /* If either of the operands are dependent, we can't do semantic
3832 processing yet. Stuff the values away for now. We cheat a bit
3833 and use the same tree code for this, even though the operands
3834 are of totally different form, thus we need to remember which
3835 statements are which, thus the lang_flag bit. */
3836 /* ??? We ought to be using type_dependent_expression_p, but the
3837 invocation of build_modify_expr in c_finish_omp_atomic can result
3838 in the creation of CONVERT_EXPRs, which are not handled by
3839 tsubst_copy_and_build. */
3840 if (uses_template_parms (lhs) || uses_template_parms (rhs))
3842 tree stmt = build2 (OMP_ATOMIC, void_type_node, lhs, rhs);
3843 OMP_ATOMIC_DEPENDENT_P (stmt) = 1;
3844 OMP_ATOMIC_CODE (stmt) = code;
3848 c_finish_omp_atomic (code, lhs, rhs);
3852 finish_omp_barrier (void)
3854 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
3855 tree stmt = finish_call_expr (fn, NULL, false, false);
3856 finish_expr_stmt (stmt);
3860 finish_omp_flush (void)
3862 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
3863 tree stmt = finish_call_expr (fn, NULL, false, false);
3864 finish_expr_stmt (stmt);
3867 /* True if OpenMP sharing attribute of DECL is predetermined. */
3869 enum omp_clause_default_kind
3870 cxx_omp_predetermined_sharing (tree decl)
3872 enum omp_clause_default_kind kind;
3874 kind = c_omp_predetermined_sharing (decl);
3875 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
3878 /* Static data members are predetermined as shared. */
3879 if (TREE_STATIC (decl))
3881 tree ctx = CP_DECL_CONTEXT (decl);
3882 if (TYPE_P (ctx) && IS_AGGR_TYPE (ctx))
3883 return OMP_CLAUSE_DEFAULT_SHARED;
3886 return OMP_CLAUSE_DEFAULT_UNSPECIFIED;
3890 init_cp_semantics (void)
3894 #include "gt-cp-semantics.h"