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);
1297 if (decl == error_mark_node)
1298 return error_mark_node;
1300 return add_stmt (build_stmt (LABEL_EXPR, decl));
1303 /* Finish a series of declarations for local labels. G++ allows users
1304 to declare "local" labels, i.e., labels with scope. This extension
1305 is useful when writing code involving statement-expressions. */
1308 finish_label_decl (tree name)
1310 tree decl = declare_local_label (name);
1311 add_decl_expr (decl);
1314 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1317 finish_decl_cleanup (tree decl, tree cleanup)
1319 push_cleanup (decl, cleanup, false);
1322 /* If the current scope exits with an exception, run CLEANUP. */
1325 finish_eh_cleanup (tree cleanup)
1327 push_cleanup (NULL, cleanup, true);
1330 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1331 order they were written by the user. Each node is as for
1332 emit_mem_initializers. */
1335 finish_mem_initializers (tree mem_inits)
1337 /* Reorder the MEM_INITS so that they are in the order they appeared
1338 in the source program. */
1339 mem_inits = nreverse (mem_inits);
1341 if (processing_template_decl)
1342 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1344 emit_mem_initializers (mem_inits);
1347 /* Finish a parenthesized expression EXPR. */
1350 finish_parenthesized_expr (tree expr)
1353 /* This inhibits warnings in c_common_truthvalue_conversion. */
1354 TREE_NO_WARNING (expr) = 1;
1356 if (TREE_CODE (expr) == OFFSET_REF)
1357 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1358 enclosed in parentheses. */
1359 PTRMEM_OK_P (expr) = 0;
1361 if (TREE_CODE (expr) == STRING_CST)
1362 PAREN_STRING_LITERAL_P (expr) = 1;
1367 /* Finish a reference to a non-static data member (DECL) that is not
1368 preceded by `.' or `->'. */
1371 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1373 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1377 if (current_function_decl
1378 && DECL_STATIC_FUNCTION_P (current_function_decl))
1379 error ("invalid use of member %q+D in static member function", decl);
1381 error ("invalid use of non-static data member %q+D", decl);
1382 error ("from this location");
1384 return error_mark_node;
1386 TREE_USED (current_class_ptr) = 1;
1387 if (processing_template_decl && !qualifying_scope)
1389 tree type = TREE_TYPE (decl);
1391 if (TREE_CODE (type) == REFERENCE_TYPE)
1392 type = TREE_TYPE (type);
1395 /* Set the cv qualifiers. */
1396 int quals = cp_type_quals (TREE_TYPE (current_class_ref));
1398 if (DECL_MUTABLE_P (decl))
1399 quals &= ~TYPE_QUAL_CONST;
1401 quals |= cp_type_quals (TREE_TYPE (decl));
1402 type = cp_build_qualified_type (type, quals);
1405 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1409 tree access_type = TREE_TYPE (object);
1410 tree lookup_context = context_for_name_lookup (decl);
1412 while (!DERIVED_FROM_P (lookup_context, access_type))
1414 access_type = TYPE_CONTEXT (access_type);
1415 while (access_type && DECL_P (access_type))
1416 access_type = DECL_CONTEXT (access_type);
1420 error ("object missing in reference to %q+D", decl);
1421 error ("from this location");
1422 return error_mark_node;
1426 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1427 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1429 if (processing_template_decl)
1430 return build_qualified_name (TREE_TYPE (decl),
1433 /*template_p=*/false);
1435 perform_or_defer_access_check (TYPE_BINFO (access_type), decl);
1437 /* If the data member was named `C::M', convert `*this' to `C'
1439 if (qualifying_scope)
1441 tree binfo = NULL_TREE;
1442 object = build_scoped_ref (object, qualifying_scope,
1446 return build_class_member_access_expr (object, decl,
1447 /*access_path=*/NULL_TREE,
1448 /*preserve_reference=*/false);
1452 /* DECL was the declaration to which a qualified-id resolved. Issue
1453 an error message if it is not accessible. If OBJECT_TYPE is
1454 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1455 type of `*x', or `x', respectively. If the DECL was named as
1456 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1459 check_accessibility_of_qualified_id (tree decl,
1461 tree nested_name_specifier)
1464 tree qualifying_type = NULL_TREE;
1466 /* If we're not checking, return immediately. */
1467 if (deferred_access_no_check)
1470 /* Determine the SCOPE of DECL. */
1471 scope = context_for_name_lookup (decl);
1472 /* If the SCOPE is not a type, then DECL is not a member. */
1473 if (!TYPE_P (scope))
1475 /* Compute the scope through which DECL is being accessed. */
1477 /* OBJECT_TYPE might not be a class type; consider:
1479 class A { typedef int I; };
1483 In this case, we will have "A::I" as the DECL, but "I" as the
1485 && CLASS_TYPE_P (object_type)
1486 && DERIVED_FROM_P (scope, object_type))
1487 /* If we are processing a `->' or `.' expression, use the type of the
1489 qualifying_type = object_type;
1490 else if (nested_name_specifier)
1492 /* If the reference is to a non-static member of the
1493 current class, treat it as if it were referenced through
1495 if (DECL_NONSTATIC_MEMBER_P (decl)
1496 && current_class_ptr
1497 && DERIVED_FROM_P (scope, current_class_type))
1498 qualifying_type = current_class_type;
1499 /* Otherwise, use the type indicated by the
1500 nested-name-specifier. */
1502 qualifying_type = nested_name_specifier;
1505 /* Otherwise, the name must be from the current class or one of
1507 qualifying_type = currently_open_derived_class (scope);
1510 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1511 or similar in a default argument value. */
1512 && CLASS_TYPE_P (qualifying_type)
1513 && !dependent_type_p (qualifying_type))
1514 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl);
1517 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1518 class named to the left of the "::" operator. DONE is true if this
1519 expression is a complete postfix-expression; it is false if this
1520 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1521 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1522 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1523 is true iff this qualified name appears as a template argument. */
1526 finish_qualified_id_expr (tree qualifying_class,
1531 bool template_arg_p)
1533 gcc_assert (TYPE_P (qualifying_class));
1535 if (error_operand_p (expr))
1536 return error_mark_node;
1538 if (DECL_P (expr) || BASELINK_P (expr))
1542 check_template_keyword (expr);
1544 /* If EXPR occurs as the operand of '&', use special handling that
1545 permits a pointer-to-member. */
1546 if (address_p && done)
1548 if (TREE_CODE (expr) == SCOPE_REF)
1549 expr = TREE_OPERAND (expr, 1);
1550 expr = build_offset_ref (qualifying_class, expr,
1551 /*address_p=*/true);
1555 /* Within the scope of a class, turn references to non-static
1556 members into expression of the form "this->...". */
1558 /* But, within a template argument, we do not want make the
1559 transformation, as there is no "this" pointer. */
1561 else if (TREE_CODE (expr) == FIELD_DECL)
1562 expr = finish_non_static_data_member (expr, current_class_ref,
1564 else if (BASELINK_P (expr) && !processing_template_decl)
1568 /* See if any of the functions are non-static members. */
1569 fns = BASELINK_FUNCTIONS (expr);
1570 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1571 fns = TREE_OPERAND (fns, 0);
1572 /* If so, the expression may be relative to the current
1574 if (!shared_member_p (fns)
1575 && current_class_type
1576 && DERIVED_FROM_P (qualifying_class, current_class_type))
1577 expr = (build_class_member_access_expr
1578 (maybe_dummy_object (qualifying_class, NULL),
1580 BASELINK_ACCESS_BINFO (expr),
1581 /*preserve_reference=*/false));
1583 /* The expression is a qualified name whose address is not
1585 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1591 /* Begin a statement-expression. The value returned must be passed to
1592 finish_stmt_expr. */
1595 begin_stmt_expr (void)
1597 return push_stmt_list ();
1600 /* Process the final expression of a statement expression. EXPR can be
1601 NULL, if the final expression is empty. Return a STATEMENT_LIST
1602 containing all the statements in the statement-expression, or
1603 ERROR_MARK_NODE if there was an error. */
1606 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1608 if (error_operand_p (expr))
1609 return error_mark_node;
1611 /* If the last statement does not have "void" type, then the value
1612 of the last statement is the value of the entire expression. */
1615 tree type = TREE_TYPE (expr);
1617 if (processing_template_decl)
1619 expr = build_stmt (EXPR_STMT, expr);
1620 expr = add_stmt (expr);
1621 /* Mark the last statement so that we can recognize it as such at
1622 template-instantiation time. */
1623 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1625 else if (VOID_TYPE_P (type))
1627 /* Just treat this like an ordinary statement. */
1628 expr = finish_expr_stmt (expr);
1632 /* It actually has a value we need to deal with. First, force it
1633 to be an rvalue so that we won't need to build up a copy
1634 constructor call later when we try to assign it to something. */
1635 expr = force_rvalue (expr);
1636 if (error_operand_p (expr))
1637 return error_mark_node;
1639 /* Update for array-to-pointer decay. */
1640 type = TREE_TYPE (expr);
1642 /* Wrap it in a CLEANUP_POINT_EXPR and add it to the list like a
1643 normal statement, but don't convert to void or actually add
1645 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
1646 expr = maybe_cleanup_point_expr (expr);
1650 /* The type of the statement-expression is the type of the last
1652 TREE_TYPE (stmt_expr) = type;
1658 /* Finish a statement-expression. EXPR should be the value returned
1659 by the previous begin_stmt_expr. Returns an expression
1660 representing the statement-expression. */
1663 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1668 if (error_operand_p (stmt_expr))
1669 return error_mark_node;
1671 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1673 type = TREE_TYPE (stmt_expr);
1674 result = pop_stmt_list (stmt_expr);
1675 TREE_TYPE (result) = type;
1677 if (processing_template_decl)
1679 result = build_min (STMT_EXPR, type, result);
1680 TREE_SIDE_EFFECTS (result) = 1;
1681 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1683 else if (CLASS_TYPE_P (type))
1685 /* Wrap the statement-expression in a TARGET_EXPR so that the
1686 temporary object created by the final expression is destroyed at
1687 the end of the full-expression containing the
1688 statement-expression. */
1689 result = force_target_expr (type, result);
1695 /* Perform Koenig lookup. FN is the postfix-expression representing
1696 the function (or functions) to call; ARGS are the arguments to the
1697 call. Returns the functions to be considered by overload
1701 perform_koenig_lookup (tree fn, tree args)
1703 tree identifier = NULL_TREE;
1704 tree functions = NULL_TREE;
1706 /* Find the name of the overloaded function. */
1707 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1709 else if (is_overloaded_fn (fn))
1712 identifier = DECL_NAME (get_first_fn (functions));
1714 else if (DECL_P (fn))
1717 identifier = DECL_NAME (fn);
1720 /* A call to a namespace-scope function using an unqualified name.
1722 Do Koenig lookup -- unless any of the arguments are
1724 if (!any_type_dependent_arguments_p (args))
1726 fn = lookup_arg_dependent (identifier, functions, args);
1728 /* The unqualified name could not be resolved. */
1729 fn = unqualified_fn_lookup_error (identifier);
1735 /* Generate an expression for `FN (ARGS)'.
1737 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1738 as a virtual call, even if FN is virtual. (This flag is set when
1739 encountering an expression where the function name is explicitly
1740 qualified. For example a call to `X::f' never generates a virtual
1743 Returns code for the call. */
1746 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p)
1752 if (fn == error_mark_node || args == error_mark_node)
1753 return error_mark_node;
1755 /* ARGS should be a list of arguments. */
1756 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1757 gcc_assert (!TYPE_P (fn));
1762 if (processing_template_decl)
1764 if (type_dependent_expression_p (fn)
1765 || any_type_dependent_arguments_p (args))
1767 result = build_nt (CALL_EXPR, fn, args, NULL_TREE);
1768 KOENIG_LOOKUP_P (result) = koenig_p;
1771 if (!BASELINK_P (fn)
1772 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1773 && TREE_TYPE (fn) != unknown_type_node)
1774 fn = build_non_dependent_expr (fn);
1775 args = build_non_dependent_args (orig_args);
1778 if (is_overloaded_fn (fn))
1779 fn = baselink_for_fns (fn);
1782 if (BASELINK_P (fn))
1786 /* A call to a member function. From [over.call.func]:
1788 If the keyword this is in scope and refers to the class of
1789 that member function, or a derived class thereof, then the
1790 function call is transformed into a qualified function call
1791 using (*this) as the postfix-expression to the left of the
1792 . operator.... [Otherwise] a contrived object of type T
1793 becomes the implied object argument.
1795 This paragraph is unclear about this situation:
1797 struct A { void f(); };
1798 struct B : public A {};
1799 struct C : public A { void g() { B::f(); }};
1801 In particular, for `B::f', this paragraph does not make clear
1802 whether "the class of that member function" refers to `A' or
1803 to `B'. We believe it refers to `B'. */
1804 if (current_class_type
1805 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1807 && current_class_ref)
1808 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1812 tree representative_fn;
1814 representative_fn = BASELINK_FUNCTIONS (fn);
1815 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1816 representative_fn = TREE_OPERAND (representative_fn, 0);
1817 representative_fn = get_first_fn (representative_fn);
1818 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1821 if (processing_template_decl)
1823 if (type_dependent_expression_p (object))
1824 return build_nt (CALL_EXPR, orig_fn, orig_args, NULL_TREE);
1825 object = build_non_dependent_expr (object);
1828 result = build_new_method_call (object, fn, args, NULL_TREE,
1830 ? LOOKUP_NONVIRTUAL : 0),
1833 else if (is_overloaded_fn (fn))
1835 /* If the function is an overloaded builtin, resolve it. */
1836 if (TREE_CODE (fn) == FUNCTION_DECL
1837 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
1838 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
1839 result = resolve_overloaded_builtin (fn, args);
1842 /* A call to a namespace-scope function. */
1843 result = build_new_function_call (fn, args, koenig_p);
1845 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1848 error ("arguments to destructor are not allowed");
1849 /* Mark the pseudo-destructor call as having side-effects so
1850 that we do not issue warnings about its use. */
1851 result = build1 (NOP_EXPR,
1853 TREE_OPERAND (fn, 0));
1854 TREE_SIDE_EFFECTS (result) = 1;
1856 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1857 /* If the "function" is really an object of class type, it might
1858 have an overloaded `operator ()'. */
1859 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1860 /*overloaded_p=*/NULL);
1863 /* A call where the function is unknown. */
1864 result = build_function_call (fn, args);
1866 if (processing_template_decl)
1868 result = build3 (CALL_EXPR, TREE_TYPE (result), orig_fn,
1869 orig_args, NULL_TREE);
1870 KOENIG_LOOKUP_P (result) = koenig_p;
1875 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1876 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1877 POSTDECREMENT_EXPR.) */
1880 finish_increment_expr (tree expr, enum tree_code code)
1882 return build_x_unary_op (code, expr);
1885 /* Finish a use of `this'. Returns an expression for `this'. */
1888 finish_this_expr (void)
1892 if (current_class_ptr)
1894 result = current_class_ptr;
1896 else if (current_function_decl
1897 && DECL_STATIC_FUNCTION_P (current_function_decl))
1899 error ("%<this%> is unavailable for static member functions");
1900 result = error_mark_node;
1904 if (current_function_decl)
1905 error ("invalid use of %<this%> in non-member function");
1907 error ("invalid use of %<this%> at top level");
1908 result = error_mark_node;
1914 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
1915 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
1916 the TYPE for the type given. If SCOPE is non-NULL, the expression
1917 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
1920 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
1922 if (destructor == error_mark_node)
1923 return error_mark_node;
1925 gcc_assert (TYPE_P (destructor));
1927 if (!processing_template_decl)
1929 if (scope == error_mark_node)
1931 error ("invalid qualifying scope in pseudo-destructor name");
1932 return error_mark_node;
1935 /* [expr.pseudo] says both:
1937 The type designated by the pseudo-destructor-name shall be
1938 the same as the object type.
1942 The cv-unqualified versions of the object type and of the
1943 type designated by the pseudo-destructor-name shall be the
1946 We implement the more generous second sentence, since that is
1947 what most other compilers do. */
1948 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
1951 error ("%qE is not of type %qT", object, destructor);
1952 return error_mark_node;
1956 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
1959 /* Finish an expression of the form CODE EXPR. */
1962 finish_unary_op_expr (enum tree_code code, tree expr)
1964 tree result = build_x_unary_op (code, expr);
1965 /* Inside a template, build_x_unary_op does not fold the
1966 expression. So check whether the result is folded before
1967 setting TREE_NEGATED_INT. */
1968 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
1969 && TREE_CODE (result) == INTEGER_CST
1970 && !TYPE_UNSIGNED (TREE_TYPE (result))
1971 && INT_CST_LT (result, integer_zero_node))
1973 /* RESULT may be a cached INTEGER_CST, so we must copy it before
1974 setting TREE_NEGATED_INT. */
1975 result = copy_node (result);
1976 TREE_NEGATED_INT (result) = 1;
1978 overflow_warning (result);
1982 /* Finish a compound-literal expression. TYPE is the type to which
1983 the INITIALIZER_LIST is being cast. */
1986 finish_compound_literal (tree type, VEC(constructor_elt,gc) *initializer_list)
1989 tree compound_literal;
1991 if (!TYPE_OBJ_P (type))
1993 error ("compound literal of non-object type %qT", type);
1994 return error_mark_node;
1997 /* Build a CONSTRUCTOR for the INITIALIZER_LIST. */
1998 compound_literal = build_constructor (NULL_TREE, initializer_list);
1999 if (processing_template_decl)
2001 TREE_TYPE (compound_literal) = type;
2002 /* Mark the expression as a compound literal. */
2003 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2004 return compound_literal;
2007 /* Create a temporary variable to represent the compound literal. */
2008 var = create_temporary_var (type);
2009 if (!current_function_decl)
2011 /* If this compound-literal appears outside of a function, then
2012 the corresponding variable has static storage duration, just
2013 like the variable in whose initializer it appears. */
2014 TREE_STATIC (var) = 1;
2015 /* The variable has internal linkage, since there is no need to
2016 reference it from another translation unit. */
2017 TREE_PUBLIC (var) = 0;
2018 /* It must have a name, so that the name mangler can mangle it. */
2019 DECL_NAME (var) = make_anon_name ();
2021 /* We must call pushdecl, since the gimplifier complains if the
2022 variable has not been declared via a BIND_EXPR. */
2024 /* Initialize the variable as we would any other variable with a
2025 brace-enclosed initializer. */
2026 cp_finish_decl (var, compound_literal,
2027 /*init_const_expr_p=*/false,
2028 /*asmspec_tree=*/NULL_TREE,
2029 LOOKUP_ONLYCONVERTING);
2033 /* Return the declaration for the function-name variable indicated by
2037 finish_fname (tree id)
2041 decl = fname_decl (C_RID_CODE (id), id);
2042 if (processing_template_decl)
2043 decl = DECL_NAME (decl);
2047 /* Finish a translation unit. */
2050 finish_translation_unit (void)
2052 /* In case there were missing closebraces,
2053 get us back to the global binding level. */
2055 while (current_namespace != global_namespace)
2058 /* Do file scope __FUNCTION__ et al. */
2059 finish_fname_decls ();
2062 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2063 Returns the parameter. */
2066 finish_template_type_parm (tree aggr, tree identifier)
2068 if (aggr != class_type_node)
2070 pedwarn ("template type parameters must use the keyword %<class%> or %<typename%>");
2071 aggr = class_type_node;
2074 return build_tree_list (aggr, identifier);
2077 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2078 Returns the parameter. */
2081 finish_template_template_parm (tree aggr, tree identifier)
2083 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2084 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2085 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2086 DECL_TEMPLATE_RESULT (tmpl) = decl;
2087 DECL_ARTIFICIAL (decl) = 1;
2088 end_template_decl ();
2090 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2092 return finish_template_type_parm (aggr, tmpl);
2095 /* ARGUMENT is the default-argument value for a template template
2096 parameter. If ARGUMENT is invalid, issue error messages and return
2097 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2100 check_template_template_default_arg (tree argument)
2102 if (TREE_CODE (argument) != TEMPLATE_DECL
2103 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2104 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2106 if (TREE_CODE (argument) == TYPE_DECL)
2107 error ("invalid use of type %qT as a default value for a template "
2108 "template-parameter", TREE_TYPE (argument));
2110 error ("invalid default argument for a template template parameter");
2111 return error_mark_node;
2117 /* Begin a class definition, as indicated by T. */
2120 begin_class_definition (tree t, tree attributes)
2122 if (t == error_mark_node)
2123 return error_mark_node;
2125 if (processing_template_parmlist)
2127 error ("definition of %q#T inside template parameter list", t);
2128 return error_mark_node;
2130 /* A non-implicit typename comes from code like:
2132 template <typename T> struct A {
2133 template <typename U> struct A<T>::B ...
2135 This is erroneous. */
2136 else if (TREE_CODE (t) == TYPENAME_TYPE)
2138 error ("invalid definition of qualified type %qT", t);
2139 t = error_mark_node;
2142 if (t == error_mark_node || ! IS_AGGR_TYPE (t))
2144 t = make_aggr_type (RECORD_TYPE);
2145 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2148 /* Update the location of the decl. */
2149 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2151 if (TYPE_BEING_DEFINED (t))
2153 t = make_aggr_type (TREE_CODE (t));
2154 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2156 maybe_process_partial_specialization (t);
2158 TYPE_BEING_DEFINED (t) = 1;
2160 cplus_decl_attributes (&t, attributes, (int) ATTR_FLAG_TYPE_IN_PLACE);
2162 if (flag_pack_struct)
2165 TYPE_PACKED (t) = 1;
2166 /* Even though the type is being defined for the first time
2167 here, there might have been a forward declaration, so there
2168 might be cv-qualified variants of T. */
2169 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2170 TYPE_PACKED (v) = 1;
2172 /* Reset the interface data, at the earliest possible
2173 moment, as it might have been set via a class foo;
2175 if (! TYPE_ANONYMOUS_P (t))
2177 struct c_fileinfo *finfo = get_fileinfo (input_filename);
2178 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2179 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2180 (t, finfo->interface_unknown);
2182 reset_specialization();
2184 /* Make a declaration for this class in its own scope. */
2185 build_self_reference ();
2190 /* Finish the member declaration given by DECL. */
2193 finish_member_declaration (tree decl)
2195 if (decl == error_mark_node || decl == NULL_TREE)
2198 if (decl == void_type_node)
2199 /* The COMPONENT was a friend, not a member, and so there's
2200 nothing for us to do. */
2203 /* We should see only one DECL at a time. */
2204 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2206 /* Set up access control for DECL. */
2208 = (current_access_specifier == access_private_node);
2209 TREE_PROTECTED (decl)
2210 = (current_access_specifier == access_protected_node);
2211 if (TREE_CODE (decl) == TEMPLATE_DECL)
2213 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2214 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2217 /* Mark the DECL as a member of the current class. */
2218 DECL_CONTEXT (decl) = current_class_type;
2222 A C language linkage is ignored for the names of class members
2223 and the member function type of class member functions. */
2224 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2225 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2227 /* Put functions on the TYPE_METHODS list and everything else on the
2228 TYPE_FIELDS list. Note that these are built up in reverse order.
2229 We reverse them (to obtain declaration order) in finish_struct. */
2230 if (TREE_CODE (decl) == FUNCTION_DECL
2231 || DECL_FUNCTION_TEMPLATE_P (decl))
2233 /* We also need to add this function to the
2234 CLASSTYPE_METHOD_VEC. */
2235 if (add_method (current_class_type, decl, NULL_TREE))
2237 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2238 TYPE_METHODS (current_class_type) = decl;
2240 maybe_add_class_template_decl_list (current_class_type, decl,
2244 /* Enter the DECL into the scope of the class. */
2245 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2246 || pushdecl_class_level (decl))
2248 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2249 go at the beginning. The reason is that lookup_field_1
2250 searches the list in order, and we want a field name to
2251 override a type name so that the "struct stat hack" will
2252 work. In particular:
2254 struct S { enum E { }; int E } s;
2257 is valid. In addition, the FIELD_DECLs must be maintained in
2258 declaration order so that class layout works as expected.
2259 However, we don't need that order until class layout, so we
2260 save a little time by putting FIELD_DECLs on in reverse order
2261 here, and then reversing them in finish_struct_1. (We could
2262 also keep a pointer to the correct insertion points in the
2265 if (TREE_CODE (decl) == TYPE_DECL)
2266 TYPE_FIELDS (current_class_type)
2267 = chainon (TYPE_FIELDS (current_class_type), decl);
2270 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2271 TYPE_FIELDS (current_class_type) = decl;
2274 maybe_add_class_template_decl_list (current_class_type, decl,
2279 note_decl_for_pch (decl);
2282 /* DECL has been declared while we are building a PCH file. Perform
2283 actions that we might normally undertake lazily, but which can be
2284 performed now so that they do not have to be performed in
2285 translation units which include the PCH file. */
2288 note_decl_for_pch (tree decl)
2290 gcc_assert (pch_file);
2292 /* There's a good chance that we'll have to mangle names at some
2293 point, even if only for emission in debugging information. */
2294 if ((TREE_CODE (decl) == VAR_DECL
2295 || TREE_CODE (decl) == FUNCTION_DECL)
2296 && !processing_template_decl)
2300 /* Finish processing a complete template declaration. The PARMS are
2301 the template parameters. */
2304 finish_template_decl (tree parms)
2307 end_template_decl ();
2309 end_specialization ();
2312 /* Finish processing a template-id (which names a type) of the form
2313 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2314 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2315 the scope of template-id indicated. */
2318 finish_template_type (tree name, tree args, int entering_scope)
2322 decl = lookup_template_class (name, args,
2323 NULL_TREE, NULL_TREE, entering_scope,
2324 tf_warning_or_error | tf_user);
2325 if (decl != error_mark_node)
2326 decl = TYPE_STUB_DECL (decl);
2331 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2332 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2333 BASE_CLASS, or NULL_TREE if an error occurred. The
2334 ACCESS_SPECIFIER is one of
2335 access_{default,public,protected_private}_node. For a virtual base
2336 we set TREE_TYPE. */
2339 finish_base_specifier (tree base, tree access, bool virtual_p)
2343 if (base == error_mark_node)
2345 error ("invalid base-class specification");
2348 else if (! is_aggr_type (base, 1))
2352 if (cp_type_quals (base) != 0)
2354 error ("base class %qT has cv qualifiers", base);
2355 base = TYPE_MAIN_VARIANT (base);
2357 result = build_tree_list (access, base);
2359 TREE_TYPE (result) = integer_type_node;
2365 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2366 what we found when we tried to do the lookup. */
2369 qualified_name_lookup_error (tree scope, tree name, tree decl)
2371 if (scope == error_mark_node)
2372 ; /* We already complained. */
2373 else if (TYPE_P (scope))
2375 if (!COMPLETE_TYPE_P (scope))
2376 error ("incomplete type %qT used in nested name specifier", scope);
2377 else if (TREE_CODE (decl) == TREE_LIST)
2379 error ("reference to %<%T::%D%> is ambiguous", scope, name);
2380 print_candidates (decl);
2383 error ("%qD is not a member of %qT", name, scope);
2385 else if (scope != global_namespace)
2386 error ("%qD is not a member of %qD", name, scope);
2388 error ("%<::%D%> has not been declared", name);
2391 /* If FNS is a member function, a set of member functions, or a
2392 template-id referring to one or more member functions, return a
2393 BASELINK for FNS, incorporating the current access context.
2394 Otherwise, return FNS unchanged. */
2397 baselink_for_fns (tree fns)
2402 if (BASELINK_P (fns)
2403 || processing_template_decl
2404 || error_operand_p (fns))
2408 if (TREE_CODE (fn) == TEMPLATE_ID_EXPR)
2409 fn = TREE_OPERAND (fn, 0);
2410 fn = get_first_fn (fn);
2411 if (!DECL_FUNCTION_MEMBER_P (fn))
2414 cl = currently_open_derived_class (DECL_CONTEXT (fn));
2416 cl = DECL_CONTEXT (fn);
2417 cl = TYPE_BINFO (cl);
2418 return build_baselink (cl, cl, fns, /*optype=*/NULL_TREE);
2421 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2422 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2423 if non-NULL, is the type or namespace used to explicitly qualify
2424 ID_EXPRESSION. DECL is the entity to which that name has been
2427 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2428 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2429 be set to true if this expression isn't permitted in a
2430 constant-expression, but it is otherwise not set by this function.
2431 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2432 constant-expression, but a non-constant expression is also
2435 DONE is true if this expression is a complete postfix-expression;
2436 it is false if this expression is followed by '->', '[', '(', etc.
2437 ADDRESS_P is true iff this expression is the operand of '&'.
2438 TEMPLATE_P is true iff the qualified-id was of the form
2439 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2440 appears as a template argument.
2442 If an error occurs, and it is the kind of error that might cause
2443 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2444 is the caller's responsibility to issue the message. *ERROR_MSG
2445 will be a string with static storage duration, so the caller need
2448 Return an expression for the entity, after issuing appropriate
2449 diagnostics. This function is also responsible for transforming a
2450 reference to a non-static member into a COMPONENT_REF that makes
2451 the use of "this" explicit.
2453 Upon return, *IDK will be filled in appropriately. */
2456 finish_id_expression (tree id_expression,
2460 bool integral_constant_expression_p,
2461 bool allow_non_integral_constant_expression_p,
2462 bool *non_integral_constant_expression_p,
2466 bool template_arg_p,
2467 const char **error_msg)
2469 /* Initialize the output parameters. */
2470 *idk = CP_ID_KIND_NONE;
2473 if (id_expression == error_mark_node)
2474 return error_mark_node;
2475 /* If we have a template-id, then no further lookup is
2476 required. If the template-id was for a template-class, we
2477 will sometimes have a TYPE_DECL at this point. */
2478 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2479 || TREE_CODE (decl) == TYPE_DECL)
2481 /* Look up the name. */
2484 if (decl == error_mark_node)
2486 /* Name lookup failed. */
2489 || (!dependent_type_p (scope)
2490 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2491 && IDENTIFIER_TYPENAME_P (id_expression)
2492 && dependent_type_p (TREE_TYPE (id_expression))))))
2494 /* If the qualifying type is non-dependent (and the name
2495 does not name a conversion operator to a dependent
2496 type), issue an error. */
2497 qualified_name_lookup_error (scope, id_expression, decl);
2498 return error_mark_node;
2502 /* It may be resolved via Koenig lookup. */
2503 *idk = CP_ID_KIND_UNQUALIFIED;
2504 return id_expression;
2507 decl = id_expression;
2509 /* If DECL is a variable that would be out of scope under
2510 ANSI/ISO rules, but in scope in the ARM, name lookup
2511 will succeed. Issue a diagnostic here. */
2513 decl = check_for_out_of_scope_variable (decl);
2515 /* Remember that the name was used in the definition of
2516 the current class so that we can check later to see if
2517 the meaning would have been different after the class
2518 was entirely defined. */
2519 if (!scope && decl != error_mark_node)
2520 maybe_note_name_used_in_class (id_expression, decl);
2522 /* Disallow uses of local variables from containing functions. */
2523 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2525 tree context = decl_function_context (decl);
2526 if (context != NULL_TREE && context != current_function_decl
2527 && ! TREE_STATIC (decl))
2529 error (TREE_CODE (decl) == VAR_DECL
2530 ? "use of %<auto%> variable from containing function"
2531 : "use of parameter from containing function");
2532 error (" %q+#D declared here", decl);
2533 return error_mark_node;
2538 /* If we didn't find anything, or what we found was a type,
2539 then this wasn't really an id-expression. */
2540 if (TREE_CODE (decl) == TEMPLATE_DECL
2541 && !DECL_FUNCTION_TEMPLATE_P (decl))
2543 *error_msg = "missing template arguments";
2544 return error_mark_node;
2546 else if (TREE_CODE (decl) == TYPE_DECL
2547 || TREE_CODE (decl) == NAMESPACE_DECL)
2549 *error_msg = "expected primary-expression";
2550 return error_mark_node;
2553 /* If the name resolved to a template parameter, there is no
2554 need to look it up again later. */
2555 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2556 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2560 *idk = CP_ID_KIND_NONE;
2561 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2562 decl = TEMPLATE_PARM_DECL (decl);
2563 r = convert_from_reference (DECL_INITIAL (decl));
2565 if (integral_constant_expression_p
2566 && !dependent_type_p (TREE_TYPE (decl))
2567 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2569 if (!allow_non_integral_constant_expression_p)
2570 error ("template parameter %qD of type %qT is not allowed in "
2571 "an integral constant expression because it is not of "
2572 "integral or enumeration type", decl, TREE_TYPE (decl));
2573 *non_integral_constant_expression_p = true;
2577 /* Similarly, we resolve enumeration constants to their
2578 underlying values. */
2579 else if (TREE_CODE (decl) == CONST_DECL)
2581 *idk = CP_ID_KIND_NONE;
2582 if (!processing_template_decl)
2584 used_types_insert (TREE_TYPE (decl));
2585 return DECL_INITIAL (decl);
2593 /* If the declaration was explicitly qualified indicate
2594 that. The semantics of `A::f(3)' are different than
2595 `f(3)' if `f' is virtual. */
2597 ? CP_ID_KIND_QUALIFIED
2598 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2599 ? CP_ID_KIND_TEMPLATE_ID
2600 : CP_ID_KIND_UNQUALIFIED));
2605 An id-expression is type-dependent if it contains an
2606 identifier that was declared with a dependent type.
2608 The standard is not very specific about an id-expression that
2609 names a set of overloaded functions. What if some of them
2610 have dependent types and some of them do not? Presumably,
2611 such a name should be treated as a dependent name. */
2612 /* Assume the name is not dependent. */
2613 dependent_p = false;
2614 if (!processing_template_decl)
2615 /* No names are dependent outside a template. */
2617 /* A template-id where the name of the template was not resolved
2618 is definitely dependent. */
2619 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2620 && (TREE_CODE (TREE_OPERAND (decl, 0))
2621 == IDENTIFIER_NODE))
2623 /* For anything except an overloaded function, just check its
2625 else if (!is_overloaded_fn (decl))
2627 = dependent_type_p (TREE_TYPE (decl));
2628 /* For a set of overloaded functions, check each of the
2634 if (BASELINK_P (fns))
2635 fns = BASELINK_FUNCTIONS (fns);
2637 /* For a template-id, check to see if the template
2638 arguments are dependent. */
2639 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2641 tree args = TREE_OPERAND (fns, 1);
2642 dependent_p = any_dependent_template_arguments_p (args);
2643 /* The functions are those referred to by the
2645 fns = TREE_OPERAND (fns, 0);
2648 /* If there are no dependent template arguments, go through
2649 the overloaded functions. */
2650 while (fns && !dependent_p)
2652 tree fn = OVL_CURRENT (fns);
2654 /* Member functions of dependent classes are
2656 if (TREE_CODE (fn) == FUNCTION_DECL
2657 && type_dependent_expression_p (fn))
2659 else if (TREE_CODE (fn) == TEMPLATE_DECL
2660 && dependent_template_p (fn))
2663 fns = OVL_NEXT (fns);
2667 /* If the name was dependent on a template parameter, we will
2668 resolve the name at instantiation time. */
2671 /* Create a SCOPE_REF for qualified names, if the scope is
2675 /* Since this name was dependent, the expression isn't
2676 constant -- yet. No error is issued because it might
2677 be constant when things are instantiated. */
2678 if (integral_constant_expression_p)
2679 *non_integral_constant_expression_p = true;
2682 if (address_p && done)
2683 decl = finish_qualified_id_expr (scope, decl,
2687 else if (dependent_type_p (scope))
2688 decl = build_qualified_name (/*type=*/NULL_TREE,
2692 else if (DECL_P (decl))
2693 decl = build_qualified_name (TREE_TYPE (decl),
2698 if (TREE_TYPE (decl))
2699 decl = convert_from_reference (decl);
2702 /* A TEMPLATE_ID already contains all the information we
2704 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2705 return id_expression;
2706 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2707 /* If we found a variable, then name lookup during the
2708 instantiation will always resolve to the same VAR_DECL
2709 (or an instantiation thereof). */
2710 if (TREE_CODE (decl) == VAR_DECL
2711 || TREE_CODE (decl) == PARM_DECL)
2712 return convert_from_reference (decl);
2713 /* The same is true for FIELD_DECL, but we also need to
2714 make sure that the syntax is correct. */
2715 else if (TREE_CODE (decl) == FIELD_DECL)
2717 /* Since SCOPE is NULL here, this is an unqualified name.
2718 Access checking has been performed during name lookup
2719 already. Turn off checking to avoid duplicate errors. */
2720 push_deferring_access_checks (dk_no_check);
2721 decl = finish_non_static_data_member
2722 (decl, current_class_ref,
2723 /*qualifying_scope=*/NULL_TREE);
2724 pop_deferring_access_checks ();
2727 return id_expression;
2730 /* Only certain kinds of names are allowed in constant
2731 expression. Enumerators and template parameters have already
2732 been handled above. */
2733 if (integral_constant_expression_p
2734 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2735 && ! builtin_valid_in_constant_expr_p (decl))
2737 if (!allow_non_integral_constant_expression_p)
2739 error ("%qD cannot appear in a constant-expression", decl);
2740 return error_mark_node;
2742 *non_integral_constant_expression_p = true;
2745 if (TREE_CODE (decl) == NAMESPACE_DECL)
2747 error ("use of namespace %qD as expression", decl);
2748 return error_mark_node;
2750 else if (DECL_CLASS_TEMPLATE_P (decl))
2752 error ("use of class template %qT as expression", decl);
2753 return error_mark_node;
2755 else if (TREE_CODE (decl) == TREE_LIST)
2757 /* Ambiguous reference to base members. */
2758 error ("request for member %qD is ambiguous in "
2759 "multiple inheritance lattice", id_expression);
2760 print_candidates (decl);
2761 return error_mark_node;
2764 /* Mark variable-like entities as used. Functions are similarly
2765 marked either below or after overload resolution. */
2766 if (TREE_CODE (decl) == VAR_DECL
2767 || TREE_CODE (decl) == PARM_DECL
2768 || TREE_CODE (decl) == RESULT_DECL)
2773 decl = (adjust_result_of_qualified_name_lookup
2774 (decl, scope, current_class_type));
2776 if (TREE_CODE (decl) == FUNCTION_DECL)
2779 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2780 decl = finish_qualified_id_expr (scope,
2788 tree r = convert_from_reference (decl);
2790 if (processing_template_decl && TYPE_P (scope))
2791 r = build_qualified_name (TREE_TYPE (r),
2797 else if (TREE_CODE (decl) == FIELD_DECL)
2799 /* Since SCOPE is NULL here, this is an unqualified name.
2800 Access checking has been performed during name lookup
2801 already. Turn off checking to avoid duplicate errors. */
2802 push_deferring_access_checks (dk_no_check);
2803 decl = finish_non_static_data_member (decl, current_class_ref,
2804 /*qualifying_scope=*/NULL_TREE);
2805 pop_deferring_access_checks ();
2807 else if (is_overloaded_fn (decl))
2812 if (TREE_CODE (first_fn) == TEMPLATE_ID_EXPR)
2813 first_fn = TREE_OPERAND (first_fn, 0);
2814 first_fn = get_first_fn (first_fn);
2815 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2816 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2818 if (!really_overloaded_fn (decl))
2819 mark_used (first_fn);
2822 && TREE_CODE (first_fn) == FUNCTION_DECL
2823 && DECL_FUNCTION_MEMBER_P (first_fn)
2824 && !shared_member_p (decl))
2826 /* A set of member functions. */
2827 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
2828 return finish_class_member_access_expr (decl, id_expression,
2829 /*template_p=*/false);
2832 decl = baselink_for_fns (decl);
2836 if (DECL_P (decl) && DECL_NONLOCAL (decl)
2837 && DECL_CLASS_SCOPE_P (decl)
2838 && DECL_CONTEXT (decl) != current_class_type)
2842 path = currently_open_derived_class (DECL_CONTEXT (decl));
2843 perform_or_defer_access_check (TYPE_BINFO (path), decl);
2846 decl = convert_from_reference (decl);
2850 if (TREE_DEPRECATED (decl))
2851 warn_deprecated_use (decl);
2856 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
2857 use as a type-specifier. */
2860 finish_typeof (tree expr)
2864 if (type_dependent_expression_p (expr))
2866 type = make_aggr_type (TYPEOF_TYPE);
2867 TYPEOF_TYPE_EXPR (type) = expr;
2872 type = TREE_TYPE (expr);
2874 if (!type || type == unknown_type_node)
2876 error ("type of %qE is unknown", expr);
2877 return error_mark_node;
2883 /* Perform C++-specific checks for __builtin_offsetof before calling
2887 finish_offsetof (tree expr)
2889 if (TREE_CODE (expr) == PSEUDO_DTOR_EXPR)
2891 error ("cannot apply %<offsetof%> to destructor %<~%T%>",
2892 TREE_OPERAND (expr, 2));
2893 return error_mark_node;
2895 if (TREE_CODE (TREE_TYPE (expr)) == FUNCTION_TYPE
2896 || TREE_CODE (TREE_TYPE (expr)) == METHOD_TYPE
2897 || TREE_CODE (TREE_TYPE (expr)) == UNKNOWN_TYPE)
2899 if (TREE_CODE (expr) == COMPONENT_REF)
2900 expr = TREE_OPERAND (expr, 1);
2901 error ("cannot apply %<offsetof%> to member function %qD", expr);
2902 return error_mark_node;
2904 return fold_offsetof (expr, NULL_TREE);
2907 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
2908 with equivalent CALL_EXPRs. */
2911 simplify_aggr_init_exprs_r (tree* tp,
2913 void* data ATTRIBUTE_UNUSED)
2915 /* We don't need to walk into types; there's nothing in a type that
2916 needs simplification. (And, furthermore, there are places we
2917 actively don't want to go. For example, we don't want to wander
2918 into the default arguments for a FUNCTION_DECL that appears in a
2925 /* Only AGGR_INIT_EXPRs are interesting. */
2926 else if (TREE_CODE (*tp) != AGGR_INIT_EXPR)
2929 simplify_aggr_init_expr (tp);
2931 /* Keep iterating. */
2935 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
2936 function is broken out from the above for the benefit of the tree-ssa
2940 simplify_aggr_init_expr (tree *tp)
2942 tree aggr_init_expr = *tp;
2944 /* Form an appropriate CALL_EXPR. */
2945 tree fn = TREE_OPERAND (aggr_init_expr, 0);
2946 tree args = TREE_OPERAND (aggr_init_expr, 1);
2947 tree slot = TREE_OPERAND (aggr_init_expr, 2);
2948 tree type = TREE_TYPE (slot);
2951 enum style_t { ctor, arg, pcc } style;
2953 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
2955 #ifdef PCC_STATIC_STRUCT_RETURN
2961 gcc_assert (TREE_ADDRESSABLE (type));
2967 /* Replace the first argument to the ctor with the address of the
2971 args = TREE_CHAIN (args);
2972 cxx_mark_addressable (slot);
2973 addr = build1 (ADDR_EXPR, build_pointer_type (type), slot);
2974 args = tree_cons (NULL_TREE, addr, args);
2977 call_expr = build3 (CALL_EXPR,
2978 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
2979 fn, args, NULL_TREE);
2983 /* Just mark it addressable here, and leave the rest to
2984 expand_call{,_inline}. */
2985 cxx_mark_addressable (slot);
2986 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
2987 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
2989 else if (style == pcc)
2991 /* If we're using the non-reentrant PCC calling convention, then we
2992 need to copy the returned value out of the static buffer into the
2994 push_deferring_access_checks (dk_no_check);
2995 call_expr = build_aggr_init (slot, call_expr,
2996 DIRECT_BIND | LOOKUP_ONLYCONVERTING);
2997 pop_deferring_access_checks ();
2998 call_expr = build2 (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
3004 /* Emit all thunks to FN that should be emitted when FN is emitted. */
3007 emit_associated_thunks (tree fn)
3009 /* When we use vcall offsets, we emit thunks with the virtual
3010 functions to which they thunk. The whole point of vcall offsets
3011 is so that you can know statically the entire set of thunks that
3012 will ever be needed for a given virtual function, thereby
3013 enabling you to output all the thunks with the function itself. */
3014 if (DECL_VIRTUAL_P (fn))
3018 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
3020 if (!THUNK_ALIAS (thunk))
3022 use_thunk (thunk, /*emit_p=*/1);
3023 if (DECL_RESULT_THUNK_P (thunk))
3027 for (probe = DECL_THUNKS (thunk);
3028 probe; probe = TREE_CHAIN (probe))
3029 use_thunk (probe, /*emit_p=*/1);
3033 gcc_assert (!DECL_THUNKS (thunk));
3038 /* Generate RTL for FN. */
3041 expand_body (tree fn)
3043 tree saved_function;
3045 /* Compute the appropriate object-file linkage for inline
3047 if (DECL_DECLARED_INLINE_P (fn))
3048 import_export_decl (fn);
3050 /* If FN is external, then there's no point in generating RTL for
3051 it. This situation can arise with an inline function under
3052 `-fexternal-templates'; we instantiate the function, even though
3053 we're not planning on emitting it, in case we get a chance to
3055 if (DECL_EXTERNAL (fn))
3058 /* ??? When is this needed? */
3059 saved_function = current_function_decl;
3061 /* Emit any thunks that should be emitted at the same time as FN. */
3062 emit_associated_thunks (fn);
3064 /* This function is only called from cgraph, or recursively from
3065 emit_associated_thunks. In neither case should we be currently
3066 generating trees for a function. */
3067 gcc_assert (function_depth == 0);
3069 tree_rest_of_compilation (fn);
3071 current_function_decl = saved_function;
3073 if (DECL_CLONED_FUNCTION_P (fn))
3075 /* If this is a clone, go through the other clones now and mark
3076 their parameters used. We have to do that here, as we don't
3077 know whether any particular clone will be expanded, and
3078 therefore cannot pick one arbitrarily. */
3081 for (probe = TREE_CHAIN (DECL_CLONED_FUNCTION (fn));
3082 probe && DECL_CLONED_FUNCTION_P (probe);
3083 probe = TREE_CHAIN (probe))
3087 for (parms = DECL_ARGUMENTS (probe);
3088 parms; parms = TREE_CHAIN (parms))
3089 TREE_USED (parms) = 1;
3094 /* Generate RTL for FN. */
3097 expand_or_defer_fn (tree fn)
3099 /* When the parser calls us after finishing the body of a template
3100 function, we don't really want to expand the body. */
3101 if (processing_template_decl)
3103 /* Normally, collection only occurs in rest_of_compilation. So,
3104 if we don't collect here, we never collect junk generated
3105 during the processing of templates until we hit a
3106 non-template function. It's not safe to do this inside a
3107 nested class, though, as the parser may have local state that
3108 is not a GC root. */
3109 if (!function_depth)
3114 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
3115 walk_tree_without_duplicates (&DECL_SAVED_TREE (fn),
3116 simplify_aggr_init_exprs_r,
3119 /* If this is a constructor or destructor body, we have to clone
3121 if (maybe_clone_body (fn))
3123 /* We don't want to process FN again, so pretend we've written
3124 it out, even though we haven't. */
3125 TREE_ASM_WRITTEN (fn) = 1;
3129 /* If this function is marked with the constructor attribute, add it
3130 to the list of functions to be called along with constructors
3131 from static duration objects. */
3132 if (DECL_STATIC_CONSTRUCTOR (fn))
3133 static_ctors = tree_cons (NULL_TREE, fn, static_ctors);
3135 /* If this function is marked with the destructor attribute, add it
3136 to the list of functions to be called along with destructors from
3137 static duration objects. */
3138 if (DECL_STATIC_DESTRUCTOR (fn))
3139 static_dtors = tree_cons (NULL_TREE, fn, static_dtors);
3141 /* We make a decision about linkage for these functions at the end
3142 of the compilation. Until that point, we do not want the back
3143 end to output them -- but we do want it to see the bodies of
3144 these functions so that it can inline them as appropriate. */
3145 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3147 if (DECL_INTERFACE_KNOWN (fn))
3148 /* We've already made a decision as to how this function will
3152 DECL_EXTERNAL (fn) = 1;
3153 DECL_NOT_REALLY_EXTERN (fn) = 1;
3154 note_vague_linkage_fn (fn);
3155 /* A non-template inline function with external linkage will
3156 always be COMDAT. As we must eventually determine the
3157 linkage of all functions, and as that causes writes to
3158 the data mapped in from the PCH file, it's advantageous
3159 to mark the functions at this point. */
3160 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3162 /* This function must have external linkage, as
3163 otherwise DECL_INTERFACE_KNOWN would have been
3165 gcc_assert (TREE_PUBLIC (fn));
3166 comdat_linkage (fn);
3167 DECL_INTERFACE_KNOWN (fn) = 1;
3171 import_export_decl (fn);
3173 /* If the user wants us to keep all inline functions, then mark
3174 this function as needed so that finish_file will make sure to
3176 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3180 /* There's no reason to do any of the work here if we're only doing
3181 semantic analysis; this code just generates RTL. */
3182 if (flag_syntax_only)
3187 /* Expand or defer, at the whim of the compilation unit manager. */
3188 cgraph_finalize_function (fn, function_depth > 1);
3200 /* Helper function for walk_tree, used by finalize_nrv below. */
3203 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3205 struct nrv_data *dp = (struct nrv_data *)data;
3208 /* No need to walk into types. There wouldn't be any need to walk into
3209 non-statements, except that we have to consider STMT_EXPRs. */
3212 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3213 but differs from using NULL_TREE in that it indicates that we care
3214 about the value of the RESULT_DECL. */
3215 else if (TREE_CODE (*tp) == RETURN_EXPR)
3216 TREE_OPERAND (*tp, 0) = dp->result;
3217 /* Change all cleanups for the NRV to only run when an exception is
3219 else if (TREE_CODE (*tp) == CLEANUP_STMT
3220 && CLEANUP_DECL (*tp) == dp->var)
3221 CLEANUP_EH_ONLY (*tp) = 1;
3222 /* Replace the DECL_EXPR for the NRV with an initialization of the
3223 RESULT_DECL, if needed. */
3224 else if (TREE_CODE (*tp) == DECL_EXPR
3225 && DECL_EXPR_DECL (*tp) == dp->var)
3228 if (DECL_INITIAL (dp->var)
3229 && DECL_INITIAL (dp->var) != error_mark_node)
3231 init = build2 (INIT_EXPR, void_type_node, dp->result,
3232 DECL_INITIAL (dp->var));
3233 DECL_INITIAL (dp->var) = error_mark_node;
3236 init = build_empty_stmt ();
3237 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3240 /* And replace all uses of the NRV with the RESULT_DECL. */
3241 else if (*tp == dp->var)
3244 /* Avoid walking into the same tree more than once. Unfortunately, we
3245 can't just use walk_tree_without duplicates because it would only call
3246 us for the first occurrence of dp->var in the function body. */
3247 slot = htab_find_slot (dp->visited, *tp, INSERT);
3253 /* Keep iterating. */
3257 /* Called from finish_function to implement the named return value
3258 optimization by overriding all the RETURN_EXPRs and pertinent
3259 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3260 RESULT_DECL for the function. */
3263 finalize_nrv (tree *tp, tree var, tree result)
3265 struct nrv_data data;
3267 /* Copy debugging information from VAR to RESULT. */
3268 DECL_NAME (result) = DECL_NAME (var);
3269 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3270 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3271 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3272 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3273 /* Don't forget that we take its address. */
3274 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3277 data.result = result;
3278 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3279 walk_tree (tp, finalize_nrv_r, &data, 0);
3280 htab_delete (data.visited);
3283 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3284 Remove any elements from the list that are invalid. */
3287 finish_omp_clauses (tree clauses)
3289 bitmap_head generic_head, firstprivate_head, lastprivate_head;
3290 tree c, t, *pc = &clauses;
3293 bitmap_obstack_initialize (NULL);
3294 bitmap_initialize (&generic_head, &bitmap_default_obstack);
3295 bitmap_initialize (&firstprivate_head, &bitmap_default_obstack);
3296 bitmap_initialize (&lastprivate_head, &bitmap_default_obstack);
3298 for (pc = &clauses, c = clauses; c ; c = *pc)
3300 bool remove = false;
3302 switch (OMP_CLAUSE_CODE (c))
3304 case OMP_CLAUSE_SHARED:
3306 goto check_dup_generic;
3307 case OMP_CLAUSE_PRIVATE:
3309 goto check_dup_generic;
3310 case OMP_CLAUSE_REDUCTION:
3312 goto check_dup_generic;
3313 case OMP_CLAUSE_COPYPRIVATE:
3314 name = "copyprivate";
3315 goto check_dup_generic;
3316 case OMP_CLAUSE_COPYIN:
3318 goto check_dup_generic;
3320 t = OMP_CLAUSE_DECL (c);
3321 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3323 if (processing_template_decl)
3325 error ("%qE is not a variable in clause %qs", t, name);
3328 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3329 || bitmap_bit_p (&firstprivate_head, DECL_UID (t))
3330 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3332 error ("%qE appears more than once in data clauses", t);
3336 bitmap_set_bit (&generic_head, DECL_UID (t));
3339 case OMP_CLAUSE_FIRSTPRIVATE:
3340 t = OMP_CLAUSE_DECL (c);
3341 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3343 if (processing_template_decl)
3345 error ("%qE is not a variable in clause %<firstprivate%>", t);
3348 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3349 || bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3351 error ("%qE appears more than once in data clauses", t);
3355 bitmap_set_bit (&firstprivate_head, DECL_UID (t));
3358 case OMP_CLAUSE_LASTPRIVATE:
3359 t = OMP_CLAUSE_DECL (c);
3360 if (TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3362 if (processing_template_decl)
3364 error ("%qE is not a variable in clause %<lastprivate%>", t);
3367 else if (bitmap_bit_p (&generic_head, DECL_UID (t))
3368 || bitmap_bit_p (&lastprivate_head, DECL_UID (t)))
3370 error ("%qE appears more than once in data clauses", t);
3374 bitmap_set_bit (&lastprivate_head, DECL_UID (t));
3378 t = OMP_CLAUSE_IF_EXPR (c);
3379 t = maybe_convert_cond (t);
3380 if (t == error_mark_node)
3382 OMP_CLAUSE_IF_EXPR (c) = t;
3385 case OMP_CLAUSE_NUM_THREADS:
3386 t = OMP_CLAUSE_NUM_THREADS_EXPR (c);
3387 if (t == error_mark_node)
3389 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
3390 && !type_dependent_expression_p (t))
3392 error ("num_threads expression must be integral");
3397 case OMP_CLAUSE_SCHEDULE:
3398 t = OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c);
3401 else if (t == error_mark_node)
3403 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t))
3404 && !type_dependent_expression_p (t))
3406 error ("schedule chunk size expression must be integral");
3411 case OMP_CLAUSE_NOWAIT:
3412 case OMP_CLAUSE_ORDERED:
3413 case OMP_CLAUSE_DEFAULT:
3421 *pc = OMP_CLAUSE_CHAIN (c);
3423 pc = &OMP_CLAUSE_CHAIN (c);
3426 for (pc = &clauses, c = clauses; c ; c = *pc)
3428 enum tree_code c_kind = OMP_CLAUSE_CODE (c);
3429 bool remove = false;
3430 bool need_complete_non_reference = false;
3431 bool need_default_ctor = false;
3432 bool need_copy_ctor = false;
3433 bool need_copy_assignment = false;
3434 bool need_implicitly_determined = false;
3435 tree type, inner_type;
3439 case OMP_CLAUSE_SHARED:
3441 need_implicitly_determined = true;
3443 case OMP_CLAUSE_PRIVATE:
3445 need_complete_non_reference = true;
3446 need_default_ctor = true;
3447 need_implicitly_determined = true;
3449 case OMP_CLAUSE_FIRSTPRIVATE:
3450 name = "firstprivate";
3451 need_complete_non_reference = true;
3452 need_copy_ctor = true;
3453 need_implicitly_determined = true;
3455 case OMP_CLAUSE_LASTPRIVATE:
3456 name = "lastprivate";
3457 need_complete_non_reference = true;
3458 need_copy_assignment = true;
3459 need_implicitly_determined = true;
3461 case OMP_CLAUSE_REDUCTION:
3463 need_implicitly_determined = true;
3465 case OMP_CLAUSE_COPYPRIVATE:
3466 name = "copyprivate";
3467 need_copy_assignment = true;
3469 case OMP_CLAUSE_COPYIN:
3471 need_copy_assignment = true;
3474 pc = &OMP_CLAUSE_CHAIN (c);
3478 t = OMP_CLAUSE_DECL (c);
3479 if (processing_template_decl
3480 && TREE_CODE (t) != VAR_DECL && TREE_CODE (t) != PARM_DECL)
3482 pc = &OMP_CLAUSE_CHAIN (c);
3488 case OMP_CLAUSE_LASTPRIVATE:
3489 if (!bitmap_bit_p (&firstprivate_head, DECL_UID (t)))
3490 need_default_ctor = true;
3493 case OMP_CLAUSE_REDUCTION:
3494 if (AGGREGATE_TYPE_P (TREE_TYPE (t))
3495 || POINTER_TYPE_P (TREE_TYPE (t)))
3497 error ("%qE has invalid type for %<reduction%>", t);
3500 else if (FLOAT_TYPE_P (TREE_TYPE (t)))
3502 enum tree_code r_code = OMP_CLAUSE_REDUCTION_CODE (c);
3510 error ("%qE has invalid type for %<reduction(%s)%>",
3511 t, operator_name_info[r_code].name);
3517 case OMP_CLAUSE_COPYIN:
3518 if (TREE_CODE (t) != VAR_DECL || !DECL_THREAD_LOCAL_P (t))
3520 error ("%qE must be %<threadprivate%> for %<copyin%>", t);
3529 if (need_complete_non_reference)
3531 t = require_complete_type (t);
3532 if (t == error_mark_node)
3534 else if (TREE_CODE (TREE_TYPE (t)) == REFERENCE_TYPE)
3536 error ("%qE has reference type for %qs", t, name);
3540 if (need_implicitly_determined)
3542 const char *share_name = NULL;
3544 if (TREE_CODE (t) == VAR_DECL && DECL_THREAD_LOCAL_P (t))
3545 share_name = "threadprivate";
3546 else switch (cxx_omp_predetermined_sharing (t))
3548 case OMP_CLAUSE_DEFAULT_UNSPECIFIED:
3550 case OMP_CLAUSE_DEFAULT_SHARED:
3551 share_name = "shared";
3553 case OMP_CLAUSE_DEFAULT_PRIVATE:
3554 share_name = "private";
3561 error ("%qE is predetermined %qs for %qs",
3562 t, share_name, name);
3567 /* We're interested in the base element, not arrays. */
3568 inner_type = type = TREE_TYPE (t);
3569 while (TREE_CODE (inner_type) == ARRAY_TYPE)
3570 inner_type = TREE_TYPE (inner_type);
3572 /* Check for special function availability by building a call to one.
3573 Save the results, because later we won't be in the right context
3574 for making these queries. */
3575 if (CLASS_TYPE_P (inner_type)
3576 && (need_default_ctor || need_copy_ctor || need_copy_assignment))
3578 int save_errorcount = errorcount;
3581 /* Always allocate 3 elements for simplicity. These are the
3582 function decls for the ctor, dtor, and assignment op.
3583 This layout is known to the three lang hooks,
3584 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3585 and cxx_omp_clause_assign_op. */
3586 info = make_tree_vec (3);
3587 CP_OMP_CLAUSE_INFO (c) = info;
3589 if (need_default_ctor
3591 && !TYPE_HAS_TRIVIAL_INIT_REF (inner_type)))
3593 if (need_default_ctor)
3597 t = build_int_cst (build_pointer_type (inner_type), 0);
3598 t = build1 (INDIRECT_REF, inner_type, t);
3599 t = build_tree_list (NULL, t);
3601 t = build_special_member_call (NULL_TREE,
3602 complete_ctor_identifier,
3603 t, inner_type, LOOKUP_NORMAL);
3604 t = get_callee_fndecl (t);
3605 TREE_VEC_ELT (info, 0) = t;
3608 if ((need_default_ctor || need_copy_ctor)
3609 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_type))
3611 t = build_int_cst (build_pointer_type (inner_type), 0);
3612 t = build1 (INDIRECT_REF, inner_type, t);
3613 t = build_special_member_call (t, complete_dtor_identifier,
3614 NULL, inner_type, LOOKUP_NORMAL);
3615 t = get_callee_fndecl (t);
3616 TREE_VEC_ELT (info, 1) = t;
3619 if (need_copy_assignment
3620 && !TYPE_HAS_TRIVIAL_ASSIGN_REF (inner_type))
3622 t = build_int_cst (build_pointer_type (inner_type), 0);
3623 t = build1 (INDIRECT_REF, inner_type, t);
3624 t = build_special_member_call (t, ansi_assopname (NOP_EXPR),
3625 build_tree_list (NULL, t),
3626 inner_type, LOOKUP_NORMAL);
3628 /* We'll have called convert_from_reference on the call, which
3629 may well have added an indirect_ref. It's unneeded here,
3630 and in the way, so kill it. */
3631 if (TREE_CODE (t) == INDIRECT_REF)
3632 t = TREE_OPERAND (t, 0);
3634 t = get_callee_fndecl (t);
3635 TREE_VEC_ELT (info, 2) = t;
3638 if (errorcount != save_errorcount)
3643 *pc = OMP_CLAUSE_CHAIN (c);
3645 pc = &OMP_CLAUSE_CHAIN (c);
3648 bitmap_obstack_release (NULL);
3652 /* For all variables in the tree_list VARS, mark them as thread local. */
3655 finish_omp_threadprivate (tree vars)
3659 /* Mark every variable in VARS to be assigned thread local storage. */
3660 for (t = vars; t; t = TREE_CHAIN (t))
3662 tree v = TREE_PURPOSE (t);
3664 /* If V had already been marked threadprivate, it doesn't matter
3665 whether it had been used prior to this point. */
3667 && (DECL_LANG_SPECIFIC (v) == NULL
3668 || !CP_DECL_THREADPRIVATE_P (v)))
3669 error ("%qE declared %<threadprivate%> after first use", v);
3670 else if (! TREE_STATIC (v) && ! DECL_EXTERNAL (v))
3671 error ("automatic variable %qE cannot be %<threadprivate%>", v);
3672 else if (! COMPLETE_TYPE_P (TREE_TYPE (v)))
3673 error ("%<threadprivate%> %qE has incomplete type", v);
3674 else if (TREE_STATIC (v) && TYPE_P (CP_DECL_CONTEXT (v)))
3675 error ("%<threadprivate%> %qE is not file, namespace "
3676 "or block scope variable", v);
3679 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3680 if (DECL_LANG_SPECIFIC (v) == NULL)
3682 retrofit_lang_decl (v);
3684 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3685 after the allocation of the lang_decl structure. */
3686 if (DECL_DISCRIMINATOR_P (v))
3687 DECL_LANG_SPECIFIC (v)->decl_flags.u2sel = 1;
3690 if (! DECL_THREAD_LOCAL_P (v))
3692 DECL_TLS_MODEL (v) = decl_default_tls_model (v);
3693 /* If rtl has been already set for this var, call
3694 make_decl_rtl once again, so that encode_section_info
3695 has a chance to look at the new decl flags. */
3696 if (DECL_RTL_SET_P (v))
3699 CP_DECL_THREADPRIVATE_P (v) = 1;
3704 /* Build an OpenMP structured block. */
3707 begin_omp_structured_block (void)
3709 return do_pushlevel (sk_omp);
3713 finish_omp_structured_block (tree block)
3715 return do_poplevel (block);
3718 /* Similarly, except force the retention of the BLOCK. */
3721 begin_omp_parallel (void)
3723 keep_next_level (true);
3724 return begin_omp_structured_block ();
3728 finish_omp_parallel (tree clauses, tree body)
3732 body = finish_omp_structured_block (body);
3734 stmt = make_node (OMP_PARALLEL);
3735 TREE_TYPE (stmt) = void_type_node;
3736 OMP_PARALLEL_CLAUSES (stmt) = clauses;
3737 OMP_PARALLEL_BODY (stmt) = body;
3739 return add_stmt (stmt);
3742 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
3743 are directly for their associated operands in the statement. DECL
3744 and INIT are a combo; if DECL is NULL then INIT ought to be a
3745 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
3746 optional statements that need to go before the loop into its
3750 finish_omp_for (location_t locus, tree decl, tree init, tree cond,
3751 tree incr, tree body, tree pre_body)
3756 switch (TREE_CODE (init))
3759 decl = TREE_OPERAND (init, 0);
3760 init = TREE_OPERAND (init, 1);
3763 if (TREE_CODE (TREE_OPERAND (init, 1)) == NOP_EXPR)
3765 decl = TREE_OPERAND (init, 0);
3766 init = TREE_OPERAND (init, 2);
3775 error ("expected iteration declaration or initialization");
3780 if (type_dependent_expression_p (decl)
3781 || type_dependent_expression_p (init)
3782 || (cond && type_dependent_expression_p (cond))
3783 || (incr && type_dependent_expression_p (incr)))
3789 error ("%Hmissing controlling predicate", &locus);
3795 error ("%Hmissing increment expression", &locus);
3799 stmt = make_node (OMP_FOR);
3801 /* This is really just a place-holder. We'll be decomposing this
3802 again and going through the build_modify_expr path below when
3803 we instantiate the thing. */
3804 init = build2 (MODIFY_EXPR, void_type_node, decl, init);
3806 TREE_TYPE (stmt) = void_type_node;
3807 OMP_FOR_INIT (stmt) = init;
3808 OMP_FOR_COND (stmt) = cond;
3809 OMP_FOR_INCR (stmt) = incr;
3810 OMP_FOR_BODY (stmt) = body;
3811 OMP_FOR_PRE_BODY (stmt) = pre_body;
3813 SET_EXPR_LOCATION (stmt, locus);
3814 return add_stmt (stmt);
3819 error ("expected iteration declaration or initialization");
3823 if (pre_body == NULL || IS_EMPTY_STMT (pre_body))
3825 else if (! processing_template_decl)
3827 add_stmt (pre_body);
3830 init = build_modify_expr (decl, NOP_EXPR, init);
3831 return c_finish_omp_for (locus, decl, init, cond, incr, body, pre_body);
3835 finish_omp_atomic (enum tree_code code, tree lhs, tree rhs)
3844 dependent_p = false;
3847 /* Even in a template, we can detect invalid uses of the atomic
3848 pragma if neither LHS nor RHS is type-dependent. */
3849 if (processing_template_decl)
3851 dependent_p = (type_dependent_expression_p (lhs)
3852 || type_dependent_expression_p (rhs));
3855 lhs = build_non_dependent_expr (lhs);
3856 rhs = build_non_dependent_expr (rhs);
3861 stmt = c_finish_omp_atomic (code, lhs, rhs);
3862 if (stmt == error_mark_node)
3865 if (processing_template_decl)
3867 stmt = build2 (OMP_ATOMIC, void_type_node, orig_lhs, orig_rhs);
3868 OMP_ATOMIC_DEPENDENT_P (stmt) = 1;
3869 OMP_ATOMIC_CODE (stmt) = code;
3875 finish_omp_barrier (void)
3877 tree fn = built_in_decls[BUILT_IN_GOMP_BARRIER];
3878 tree stmt = finish_call_expr (fn, NULL, false, false);
3879 finish_expr_stmt (stmt);
3883 finish_omp_flush (void)
3885 tree fn = built_in_decls[BUILT_IN_SYNCHRONIZE];
3886 tree stmt = finish_call_expr (fn, NULL, false, false);
3887 finish_expr_stmt (stmt);
3890 /* True if OpenMP sharing attribute of DECL is predetermined. */
3892 enum omp_clause_default_kind
3893 cxx_omp_predetermined_sharing (tree decl)
3895 enum omp_clause_default_kind kind;
3897 kind = c_omp_predetermined_sharing (decl);
3898 if (kind != OMP_CLAUSE_DEFAULT_UNSPECIFIED)
3901 /* Static data members are predetermined as shared. */
3902 if (TREE_STATIC (decl))
3904 tree ctx = CP_DECL_CONTEXT (decl);
3905 if (TYPE_P (ctx) && IS_AGGR_TYPE (ctx))
3906 return OMP_CLAUSE_DEFAULT_SHARED;
3909 return OMP_CLAUSE_DEFAULT_UNSPECIFIED;
3913 init_cp_semantics (void)
3917 #include "gt-cp-semantics.h"