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. Since the current g++ parser is
55 lacking in several respects, and will be reimplemented, we are
56 attempting to move most code that is not directly related to
57 parsing into this file; that will make implementing the new parser
58 much easier since it will be able to make use of these routines. */
60 static tree maybe_convert_cond (tree);
61 static tree simplify_aggr_init_exprs_r (tree *, int *, void *);
62 static void emit_associated_thunks (tree);
63 static tree finalize_nrv_r (tree *, int *, void *);
66 /* Deferred Access Checking Overview
67 ---------------------------------
69 Most C++ expressions and declarations require access checking
70 to be performed during parsing. However, in several cases,
71 this has to be treated differently.
73 For member declarations, access checking has to be deferred
74 until more information about the declaration is known. For
86 When we are parsing the function return type `A::X', we don't
87 really know if this is allowed until we parse the function name.
89 Furthermore, some contexts require that access checking is
90 never performed at all. These include class heads, and template
93 Typical use of access checking functions is described here:
95 1. When we enter a context that requires certain access checking
96 mode, the function `push_deferring_access_checks' is called with
97 DEFERRING argument specifying the desired mode. Access checking
98 may be performed immediately (dk_no_deferred), deferred
99 (dk_deferred), or not performed (dk_no_check).
101 2. When a declaration such as a type, or a variable, is encountered,
102 the function `perform_or_defer_access_check' is called. It
103 maintains a TREE_LIST of all deferred checks.
105 3. The global `current_class_type' or `current_function_decl' is then
106 setup by the parser. `enforce_access' relies on these information
109 4. Upon exiting the context mentioned in step 1,
110 `perform_deferred_access_checks' is called to check all declaration
111 stored in the TREE_LIST. `pop_deferring_access_checks' is then
112 called to restore the previous access checking mode.
114 In case of parsing error, we simply call `pop_deferring_access_checks'
115 without `perform_deferred_access_checks'. */
117 typedef struct deferred_access GTY(())
119 /* A TREE_LIST representing name-lookups for which we have deferred
120 checking access controls. We cannot check the accessibility of
121 names used in a decl-specifier-seq until we know what is being
122 declared because code like:
129 A::B* A::f() { return 0; }
131 is valid, even though `A::B' is not generally accessible.
133 The TREE_PURPOSE of each node is the scope used to qualify the
134 name being looked up; the TREE_VALUE is the DECL to which the
135 name was resolved. */
136 tree deferred_access_checks;
138 /* The current mode of access checks. */
139 enum deferring_kind deferring_access_checks_kind;
142 DEF_VEC_O (deferred_access);
143 DEF_VEC_ALLOC_O (deferred_access,gc);
145 /* Data for deferred access checking. */
146 static GTY(()) VEC(deferred_access,gc) *deferred_access_stack;
147 static GTY(()) unsigned deferred_access_no_check;
149 /* Save the current deferred access states and start deferred
150 access checking iff DEFER_P is true. */
153 push_deferring_access_checks (deferring_kind deferring)
155 /* For context like template instantiation, access checking
156 disabling applies to all nested context. */
157 if (deferred_access_no_check || deferring == dk_no_check)
158 deferred_access_no_check++;
161 deferred_access *ptr;
163 ptr = VEC_safe_push (deferred_access, gc, deferred_access_stack, NULL);
164 ptr->deferred_access_checks = NULL_TREE;
165 ptr->deferring_access_checks_kind = deferring;
169 /* Resume deferring access checks again after we stopped doing
173 resume_deferring_access_checks (void)
175 if (!deferred_access_no_check)
176 VEC_last (deferred_access, deferred_access_stack)
177 ->deferring_access_checks_kind = dk_deferred;
180 /* Stop deferring access checks. */
183 stop_deferring_access_checks (void)
185 if (!deferred_access_no_check)
186 VEC_last (deferred_access, deferred_access_stack)
187 ->deferring_access_checks_kind = dk_no_deferred;
190 /* Discard the current deferred access checks and restore the
194 pop_deferring_access_checks (void)
196 if (deferred_access_no_check)
197 deferred_access_no_check--;
199 VEC_pop (deferred_access, deferred_access_stack);
202 /* Returns a TREE_LIST representing the deferred checks.
203 The TREE_PURPOSE of each node is the type through which the
204 access occurred; the TREE_VALUE is the declaration named.
208 get_deferred_access_checks (void)
210 if (deferred_access_no_check)
213 return (VEC_last (deferred_access, deferred_access_stack)
214 ->deferred_access_checks);
217 /* Take current deferred checks and combine with the
218 previous states if we also defer checks previously.
219 Otherwise perform checks now. */
222 pop_to_parent_deferring_access_checks (void)
224 if (deferred_access_no_check)
225 deferred_access_no_check--;
229 deferred_access *ptr;
231 checks = (VEC_last (deferred_access, deferred_access_stack)
232 ->deferred_access_checks);
234 VEC_pop (deferred_access, deferred_access_stack);
235 ptr = VEC_last (deferred_access, deferred_access_stack);
236 if (ptr->deferring_access_checks_kind == dk_no_deferred)
239 for (; checks; checks = TREE_CHAIN (checks))
240 enforce_access (TREE_PURPOSE (checks),
241 TREE_VALUE (checks));
245 /* Merge with parent. */
247 tree original = ptr->deferred_access_checks;
249 for (; checks; checks = next)
253 next = TREE_CHAIN (checks);
255 for (probe = original; probe; probe = TREE_CHAIN (probe))
256 if (TREE_VALUE (probe) == TREE_VALUE (checks)
257 && TREE_PURPOSE (probe) == TREE_PURPOSE (checks))
259 /* Insert into parent's checks. */
260 TREE_CHAIN (checks) = ptr->deferred_access_checks;
261 ptr->deferred_access_checks = checks;
268 /* Perform the access checks in CHECKS. The TREE_PURPOSE of each node
269 is the BINFO indicating the qualifying scope used to access the
270 DECL node stored in the TREE_VALUE of the node. */
273 perform_access_checks (tree checks)
277 enforce_access (TREE_PURPOSE (checks),
278 TREE_VALUE (checks));
279 checks = TREE_CHAIN (checks);
283 /* Perform the deferred access checks.
285 After performing the checks, we still have to keep the list
286 `deferred_access_stack->deferred_access_checks' since we may want
287 to check access for them again later in a different context.
294 A::X A::a, x; // No error for `A::a', error for `x'
296 We have to perform deferred access of `A::X', first with `A::a',
300 perform_deferred_access_checks (void)
302 perform_access_checks (get_deferred_access_checks ());
305 /* Defer checking the accessibility of DECL, when looked up in
309 perform_or_defer_access_check (tree binfo, tree decl)
312 deferred_access *ptr;
314 /* Exit if we are in a context that no access checking is performed.
316 if (deferred_access_no_check)
319 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
321 ptr = VEC_last (deferred_access, deferred_access_stack);
323 /* If we are not supposed to defer access checks, just check now. */
324 if (ptr->deferring_access_checks_kind == dk_no_deferred)
326 enforce_access (binfo, decl);
330 /* See if we are already going to perform this check. */
331 for (check = ptr->deferred_access_checks;
333 check = TREE_CHAIN (check))
334 if (TREE_VALUE (check) == decl && TREE_PURPOSE (check) == binfo)
336 /* If not, record the check. */
337 ptr->deferred_access_checks
338 = tree_cons (binfo, decl, ptr->deferred_access_checks);
341 /* Returns nonzero if the current statement is a full expression,
342 i.e. temporaries created during that statement should be destroyed
343 at the end of the statement. */
346 stmts_are_full_exprs_p (void)
348 return current_stmt_tree ()->stmts_are_full_exprs_p;
351 /* T is a statement. Add it to the statement-tree. This is the C++
352 version. The C/ObjC frontends have a slightly different version of
358 enum tree_code code = TREE_CODE (t);
360 if (EXPR_P (t) && code != LABEL_EXPR)
362 if (!EXPR_HAS_LOCATION (t))
363 SET_EXPR_LOCATION (t, input_location);
365 /* When we expand a statement-tree, we must know whether or not the
366 statements are full-expressions. We record that fact here. */
367 STMT_IS_FULL_EXPR_P (t) = stmts_are_full_exprs_p ();
370 /* Add T to the statement-tree. Non-side-effect statements need to be
371 recorded during statement expressions. */
372 append_to_statement_list_force (t, &cur_stmt_list);
377 /* Returns the stmt_tree (if any) to which statements are currently
378 being added. If there is no active statement-tree, NULL is
382 current_stmt_tree (void)
385 ? &cfun->language->base.x_stmt_tree
386 : &scope_chain->x_stmt_tree);
389 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
392 maybe_cleanup_point_expr (tree expr)
394 if (!processing_template_decl && stmts_are_full_exprs_p ())
395 expr = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
399 /* Like maybe_cleanup_point_expr except have the type of the new expression be
400 void so we don't need to create a temporary variable to hold the inner
401 expression. The reason why we do this is because the original type might be
402 an aggregate and we cannot create a temporary variable for that type. */
405 maybe_cleanup_point_expr_void (tree expr)
407 if (!processing_template_decl && stmts_are_full_exprs_p ())
408 expr = fold_build_cleanup_point_expr (void_type_node, expr);
414 /* Create a declaration statement for the declaration given by the DECL. */
417 add_decl_expr (tree decl)
419 tree r = build_stmt (DECL_EXPR, decl);
420 if (DECL_INITIAL (decl)
421 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
422 r = maybe_cleanup_point_expr_void (r);
426 /* Nonzero if TYPE is an anonymous union or struct type. We have to use a
427 flag for this because "A union for which objects or pointers are
428 declared is not an anonymous union" [class.union]. */
431 anon_aggr_type_p (tree node)
433 return ANON_AGGR_TYPE_P (node);
436 /* Finish a scope. */
439 do_poplevel (tree stmt_list)
443 if (stmts_are_full_exprs_p ())
444 block = poplevel (kept_level_p (), 1, 0);
446 stmt_list = pop_stmt_list (stmt_list);
448 if (!processing_template_decl)
450 stmt_list = c_build_bind_expr (block, stmt_list);
451 /* ??? See c_end_compound_stmt re statement expressions. */
457 /* Begin a new scope. */
460 do_pushlevel (scope_kind sk)
462 tree ret = push_stmt_list ();
463 if (stmts_are_full_exprs_p ())
464 begin_scope (sk, NULL);
468 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
469 when the current scope is exited. EH_ONLY is true when this is not
470 meant to apply to normal control flow transfer. */
473 push_cleanup (tree decl, tree cleanup, bool eh_only)
475 tree stmt = build_stmt (CLEANUP_STMT, NULL, cleanup, decl);
476 CLEANUP_EH_ONLY (stmt) = eh_only;
478 CLEANUP_BODY (stmt) = push_stmt_list ();
481 /* Begin a conditional that might contain a declaration. When generating
482 normal code, we want the declaration to appear before the statement
483 containing the conditional. When generating template code, we want the
484 conditional to be rendered as the raw DECL_EXPR. */
487 begin_cond (tree *cond_p)
489 if (processing_template_decl)
490 *cond_p = push_stmt_list ();
493 /* Finish such a conditional. */
496 finish_cond (tree *cond_p, tree expr)
498 if (processing_template_decl)
500 tree cond = pop_stmt_list (*cond_p);
501 if (TREE_CODE (cond) == DECL_EXPR)
507 /* If *COND_P specifies a conditional with a declaration, transform the
510 for (; A x = 42;) { }
512 while (true) { A x = 42; if (!x) break; }
513 for (;;) { A x = 42; if (!x) break; }
514 The statement list for BODY will be empty if the conditional did
515 not declare anything. */
518 simplify_loop_decl_cond (tree *cond_p, tree body)
522 if (!TREE_SIDE_EFFECTS (body))
526 *cond_p = boolean_true_node;
528 if_stmt = begin_if_stmt ();
529 cond = build_unary_op (TRUTH_NOT_EXPR, cond, 0);
530 finish_if_stmt_cond (cond, if_stmt);
531 finish_break_stmt ();
532 finish_then_clause (if_stmt);
533 finish_if_stmt (if_stmt);
536 /* Finish a goto-statement. */
539 finish_goto_stmt (tree destination)
541 if (TREE_CODE (destination) == IDENTIFIER_NODE)
542 destination = lookup_label (destination);
544 /* We warn about unused labels with -Wunused. That means we have to
545 mark the used labels as used. */
546 if (TREE_CODE (destination) == LABEL_DECL)
547 TREE_USED (destination) = 1;
550 /* The DESTINATION is being used as an rvalue. */
551 if (!processing_template_decl)
552 destination = decay_conversion (destination);
553 /* We don't inline calls to functions with computed gotos.
554 Those functions are typically up to some funny business,
555 and may be depending on the labels being at particular
556 addresses, or some such. */
557 DECL_UNINLINABLE (current_function_decl) = 1;
560 check_goto (destination);
562 return add_stmt (build_stmt (GOTO_EXPR, destination));
565 /* COND is the condition-expression for an if, while, etc.,
566 statement. Convert it to a boolean value, if appropriate. */
569 maybe_convert_cond (tree cond)
571 /* Empty conditions remain empty. */
575 /* Wait until we instantiate templates before doing conversion. */
576 if (processing_template_decl)
579 /* Do the conversion. */
580 cond = convert_from_reference (cond);
581 return condition_conversion (cond);
584 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
587 finish_expr_stmt (tree expr)
591 if (expr != NULL_TREE)
593 if (!processing_template_decl)
595 if (warn_sequence_point)
596 verify_sequence_points (expr);
597 expr = convert_to_void (expr, "statement");
599 else if (!type_dependent_expression_p (expr))
600 convert_to_void (build_non_dependent_expr (expr), "statement");
602 /* Simplification of inner statement expressions, compound exprs,
603 etc can result in us already having an EXPR_STMT. */
604 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
606 if (TREE_CODE (expr) != EXPR_STMT)
607 expr = build_stmt (EXPR_STMT, expr);
608 expr = maybe_cleanup_point_expr_void (expr);
620 /* Begin an if-statement. Returns a newly created IF_STMT if
627 scope = do_pushlevel (sk_block);
628 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
629 TREE_CHAIN (r) = scope;
630 begin_cond (&IF_COND (r));
634 /* Process the COND of an if-statement, which may be given by
638 finish_if_stmt_cond (tree cond, tree if_stmt)
640 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
642 THEN_CLAUSE (if_stmt) = push_stmt_list ();
645 /* Finish the then-clause of an if-statement, which may be given by
649 finish_then_clause (tree if_stmt)
651 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
655 /* Begin the else-clause of an if-statement. */
658 begin_else_clause (tree if_stmt)
660 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
663 /* Finish the else-clause of an if-statement, which may be given by
667 finish_else_clause (tree if_stmt)
669 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
672 /* Finish an if-statement. */
675 finish_if_stmt (tree if_stmt)
677 tree scope = TREE_CHAIN (if_stmt);
678 TREE_CHAIN (if_stmt) = NULL;
679 add_stmt (do_poplevel (scope));
683 /* Begin a while-statement. Returns a newly created WHILE_STMT if
687 begin_while_stmt (void)
690 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
692 WHILE_BODY (r) = do_pushlevel (sk_block);
693 begin_cond (&WHILE_COND (r));
697 /* Process the COND of a while-statement, which may be given by
701 finish_while_stmt_cond (tree cond, tree while_stmt)
703 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
704 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
707 /* Finish a while-statement, which may be given by WHILE_STMT. */
710 finish_while_stmt (tree while_stmt)
712 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
716 /* Begin a do-statement. Returns a newly created DO_STMT if
722 tree r = build_stmt (DO_STMT, NULL_TREE, NULL_TREE);
724 DO_BODY (r) = push_stmt_list ();
728 /* Finish the body of a do-statement, which may be given by DO_STMT. */
731 finish_do_body (tree do_stmt)
733 DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
736 /* Finish a do-statement, which may be given by DO_STMT, and whose
737 COND is as indicated. */
740 finish_do_stmt (tree cond, tree do_stmt)
742 cond = maybe_convert_cond (cond);
743 DO_COND (do_stmt) = cond;
747 /* Finish a return-statement. The EXPRESSION returned, if any, is as
751 finish_return_stmt (tree expr)
756 expr = check_return_expr (expr, &no_warning);
757 if (!processing_template_decl)
759 if (DECL_DESTRUCTOR_P (current_function_decl)
760 || (DECL_CONSTRUCTOR_P (current_function_decl)
761 && targetm.cxx.cdtor_returns_this ()))
763 /* Similarly, all destructors must run destructors for
764 base-classes before returning. So, all returns in a
765 destructor get sent to the DTOR_LABEL; finish_function emits
766 code to return a value there. */
767 return finish_goto_stmt (cdtor_label);
771 r = build_stmt (RETURN_EXPR, expr);
772 TREE_NO_WARNING (r) |= no_warning;
773 r = maybe_cleanup_point_expr_void (r);
780 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
783 begin_for_stmt (void)
787 r = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE,
788 NULL_TREE, NULL_TREE);
790 if (flag_new_for_scope > 0)
791 TREE_CHAIN (r) = do_pushlevel (sk_for);
793 if (processing_template_decl)
794 FOR_INIT_STMT (r) = push_stmt_list ();
799 /* Finish the for-init-statement of a for-statement, which may be
800 given by FOR_STMT. */
803 finish_for_init_stmt (tree for_stmt)
805 if (processing_template_decl)
806 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
808 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
809 begin_cond (&FOR_COND (for_stmt));
812 /* Finish the COND of a for-statement, which may be given by
816 finish_for_cond (tree cond, tree for_stmt)
818 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
819 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
822 /* Finish the increment-EXPRESSION in a for-statement, which may be
823 given by FOR_STMT. */
826 finish_for_expr (tree expr, tree for_stmt)
830 /* If EXPR is an overloaded function, issue an error; there is no
831 context available to use to perform overload resolution. */
832 if (type_unknown_p (expr))
834 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
835 expr = error_mark_node;
837 if (!processing_template_decl)
839 if (warn_sequence_point)
840 verify_sequence_points (expr);
841 expr = convert_to_void (expr, "3rd expression in for");
843 else if (!type_dependent_expression_p (expr))
844 convert_to_void (build_non_dependent_expr (expr), "3rd expression in for");
845 expr = maybe_cleanup_point_expr_void (expr);
846 FOR_EXPR (for_stmt) = expr;
849 /* Finish the body of a for-statement, which may be given by
850 FOR_STMT. The increment-EXPR for the loop must be
854 finish_for_stmt (tree for_stmt)
856 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
858 /* Pop the scope for the body of the loop. */
859 if (flag_new_for_scope > 0)
861 tree scope = TREE_CHAIN (for_stmt);
862 TREE_CHAIN (for_stmt) = NULL;
863 add_stmt (do_poplevel (scope));
869 /* Finish a break-statement. */
872 finish_break_stmt (void)
874 return add_stmt (build_stmt (BREAK_STMT));
877 /* Finish a continue-statement. */
880 finish_continue_stmt (void)
882 return add_stmt (build_stmt (CONTINUE_STMT));
885 /* Begin a switch-statement. Returns a new SWITCH_STMT if
889 begin_switch_stmt (void)
893 r = build_stmt (SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
895 scope = do_pushlevel (sk_block);
896 TREE_CHAIN (r) = scope;
897 begin_cond (&SWITCH_STMT_COND (r));
902 /* Finish the cond of a switch-statement. */
905 finish_switch_cond (tree cond, tree switch_stmt)
907 tree orig_type = NULL;
908 if (!processing_template_decl)
912 /* Convert the condition to an integer or enumeration type. */
913 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
914 if (cond == NULL_TREE)
916 error ("switch quantity not an integer");
917 cond = error_mark_node;
919 orig_type = TREE_TYPE (cond);
920 if (cond != error_mark_node)
924 Integral promotions are performed. */
925 cond = perform_integral_promotions (cond);
926 cond = maybe_cleanup_point_expr (cond);
929 if (cond != error_mark_node)
931 index = get_unwidened (cond, NULL_TREE);
932 /* We can't strip a conversion from a signed type to an unsigned,
933 because if we did, int_fits_type_p would do the wrong thing
934 when checking case values for being in range,
935 and it's too hard to do the right thing. */
936 if (TYPE_UNSIGNED (TREE_TYPE (cond))
937 == TYPE_UNSIGNED (TREE_TYPE (index)))
941 finish_cond (&SWITCH_STMT_COND (switch_stmt), cond);
942 SWITCH_STMT_TYPE (switch_stmt) = orig_type;
943 add_stmt (switch_stmt);
944 push_switch (switch_stmt);
945 SWITCH_STMT_BODY (switch_stmt) = push_stmt_list ();
948 /* Finish the body of a switch-statement, which may be given by
949 SWITCH_STMT. The COND to switch on is indicated. */
952 finish_switch_stmt (tree switch_stmt)
956 SWITCH_STMT_BODY (switch_stmt) =
957 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt));
961 scope = TREE_CHAIN (switch_stmt);
962 TREE_CHAIN (switch_stmt) = NULL;
963 add_stmt (do_poplevel (scope));
966 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
970 begin_try_block (void)
972 tree r = build_stmt (TRY_BLOCK, NULL_TREE, NULL_TREE);
974 TRY_STMTS (r) = push_stmt_list ();
978 /* Likewise, for a function-try-block. */
981 begin_function_try_block (void)
983 tree r = begin_try_block ();
984 FN_TRY_BLOCK_P (r) = 1;
988 /* Finish a try-block, which may be given by TRY_BLOCK. */
991 finish_try_block (tree try_block)
993 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
994 TRY_HANDLERS (try_block) = push_stmt_list ();
997 /* Finish the body of a cleanup try-block, which may be given by
1001 finish_cleanup_try_block (tree try_block)
1003 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
1006 /* Finish an implicitly generated try-block, with a cleanup is given
1010 finish_cleanup (tree cleanup, tree try_block)
1012 TRY_HANDLERS (try_block) = cleanup;
1013 CLEANUP_P (try_block) = 1;
1016 /* Likewise, for a function-try-block. */
1019 finish_function_try_block (tree try_block)
1021 finish_try_block (try_block);
1022 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1023 the try block, but moving it inside. */
1024 in_function_try_handler = 1;
1027 /* Finish a handler-sequence for a try-block, which may be given by
1031 finish_handler_sequence (tree try_block)
1033 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
1034 check_handlers (TRY_HANDLERS (try_block));
1037 /* Likewise, for a function-try-block. */
1040 finish_function_handler_sequence (tree try_block)
1042 in_function_try_handler = 0;
1043 finish_handler_sequence (try_block);
1046 /* Begin a handler. Returns a HANDLER if appropriate. */
1049 begin_handler (void)
1053 r = build_stmt (HANDLER, NULL_TREE, NULL_TREE);
1056 /* Create a binding level for the eh_info and the exception object
1058 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1063 /* Finish the handler-parameters for a handler, which may be given by
1064 HANDLER. DECL is the declaration for the catch parameter, or NULL
1065 if this is a `catch (...)' clause. */
1068 finish_handler_parms (tree decl, tree handler)
1070 tree type = NULL_TREE;
1071 if (processing_template_decl)
1075 decl = pushdecl (decl);
1076 decl = push_template_decl (decl);
1077 HANDLER_PARMS (handler) = decl;
1078 type = TREE_TYPE (decl);
1082 type = expand_start_catch_block (decl);
1084 HANDLER_TYPE (handler) = type;
1085 if (!processing_template_decl && type)
1086 mark_used (eh_type_info (type));
1089 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1090 the return value from the matching call to finish_handler_parms. */
1093 finish_handler (tree handler)
1095 if (!processing_template_decl)
1096 expand_end_catch_block ();
1097 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1100 /* Begin a compound statement. FLAGS contains some bits that control the
1101 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1102 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1103 block of a function. If BCS_TRY_BLOCK is set, this is the block
1104 created on behalf of a TRY statement. Returns a token to be passed to
1105 finish_compound_stmt. */
1108 begin_compound_stmt (unsigned int flags)
1112 if (flags & BCS_NO_SCOPE)
1114 r = push_stmt_list ();
1115 STATEMENT_LIST_NO_SCOPE (r) = 1;
1117 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1118 But, if it's a statement-expression with a scopeless block, there's
1119 nothing to keep, and we don't want to accidentally keep a block
1120 *inside* the scopeless block. */
1121 keep_next_level (false);
1124 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1126 /* When processing a template, we need to remember where the braces were,
1127 so that we can set up identical scopes when instantiating the template
1128 later. BIND_EXPR is a handy candidate for this.
1129 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1130 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1131 processing templates. */
1132 if (processing_template_decl)
1134 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1135 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1136 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1137 TREE_SIDE_EFFECTS (r) = 1;
1143 /* Finish a compound-statement, which is given by STMT. */
1146 finish_compound_stmt (tree stmt)
1148 if (TREE_CODE (stmt) == BIND_EXPR)
1149 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1150 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1151 stmt = pop_stmt_list (stmt);
1154 /* Destroy any ObjC "super" receivers that may have been
1156 objc_clear_super_receiver ();
1158 stmt = do_poplevel (stmt);
1161 /* ??? See c_end_compound_stmt wrt statement expressions. */
1166 /* Finish an asm-statement, whose components are a STRING, some
1167 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1168 whether the asm-statement should be considered volatile. */
1171 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1172 tree input_operands, tree clobbers)
1176 int ninputs = list_length (input_operands);
1177 int noutputs = list_length (output_operands);
1179 if (!processing_template_decl)
1181 const char *constraint;
1182 const char **oconstraints;
1183 bool allows_mem, allows_reg, is_inout;
1187 oconstraints = (const char **) alloca (noutputs * sizeof (char *));
1189 string = resolve_asm_operand_names (string, output_operands,
1192 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1194 operand = TREE_VALUE (t);
1196 /* ??? Really, this should not be here. Users should be using a
1197 proper lvalue, dammit. But there's a long history of using
1198 casts in the output operands. In cases like longlong.h, this
1199 becomes a primitive form of typechecking -- if the cast can be
1200 removed, then the output operand had a type of the proper width;
1201 otherwise we'll get an error. Gross, but ... */
1202 STRIP_NOPS (operand);
1204 if (!lvalue_or_else (operand, lv_asm))
1205 operand = error_mark_node;
1207 if (operand != error_mark_node
1208 && (TREE_READONLY (operand)
1209 || CP_TYPE_CONST_P (TREE_TYPE (operand))
1210 /* Functions are not modifiable, even though they are
1212 || TREE_CODE (TREE_TYPE (operand)) == FUNCTION_TYPE
1213 || TREE_CODE (TREE_TYPE (operand)) == METHOD_TYPE
1214 /* If it's an aggregate and any field is const, then it is
1215 effectively const. */
1216 || (CLASS_TYPE_P (TREE_TYPE (operand))
1217 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand)))))
1218 readonly_error (operand, "assignment (via 'asm' output)", 0);
1220 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1221 oconstraints[i] = constraint;
1223 if (parse_output_constraint (&constraint, i, ninputs, noutputs,
1224 &allows_mem, &allows_reg, &is_inout))
1226 /* If the operand is going to end up in memory,
1227 mark it addressable. */
1228 if (!allows_reg && !cxx_mark_addressable (operand))
1229 operand = error_mark_node;
1232 operand = error_mark_node;
1234 TREE_VALUE (t) = operand;
1237 for (i = 0, t = input_operands; t; ++i, t = TREE_CHAIN (t))
1239 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1240 operand = decay_conversion (TREE_VALUE (t));
1242 /* If the type of the operand hasn't been determined (e.g.,
1243 because it involves an overloaded function), then issue
1244 an error message. There's no context available to
1245 resolve the overloading. */
1246 if (TREE_TYPE (operand) == unknown_type_node)
1248 error ("type of asm operand %qE could not be determined",
1250 operand = error_mark_node;
1253 if (parse_input_constraint (&constraint, i, ninputs, noutputs, 0,
1254 oconstraints, &allows_mem, &allows_reg))
1256 /* If the operand is going to end up in memory,
1257 mark it addressable. */
1258 if (!allows_reg && allows_mem)
1260 /* Strip the nops as we allow this case. FIXME, this really
1261 should be rejected or made deprecated. */
1262 STRIP_NOPS (operand);
1263 if (!cxx_mark_addressable (operand))
1264 operand = error_mark_node;
1268 operand = error_mark_node;
1270 TREE_VALUE (t) = operand;
1274 r = build_stmt (ASM_EXPR, string,
1275 output_operands, input_operands,
1277 ASM_VOLATILE_P (r) = volatile_p || noutputs == 0;
1278 r = maybe_cleanup_point_expr_void (r);
1279 return add_stmt (r);
1282 /* Finish a label with the indicated NAME. */
1285 finish_label_stmt (tree name)
1287 tree decl = define_label (input_location, name);
1288 return add_stmt (build_stmt (LABEL_EXPR, decl));
1291 /* Finish a series of declarations for local labels. G++ allows users
1292 to declare "local" labels, i.e., labels with scope. This extension
1293 is useful when writing code involving statement-expressions. */
1296 finish_label_decl (tree name)
1298 tree decl = declare_local_label (name);
1299 add_decl_expr (decl);
1302 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1305 finish_decl_cleanup (tree decl, tree cleanup)
1307 push_cleanup (decl, cleanup, false);
1310 /* If the current scope exits with an exception, run CLEANUP. */
1313 finish_eh_cleanup (tree cleanup)
1315 push_cleanup (NULL, cleanup, true);
1318 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1319 order they were written by the user. Each node is as for
1320 emit_mem_initializers. */
1323 finish_mem_initializers (tree mem_inits)
1325 /* Reorder the MEM_INITS so that they are in the order they appeared
1326 in the source program. */
1327 mem_inits = nreverse (mem_inits);
1329 if (processing_template_decl)
1330 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1332 emit_mem_initializers (mem_inits);
1335 /* Finish a parenthesized expression EXPR. */
1338 finish_parenthesized_expr (tree expr)
1341 /* This inhibits warnings in c_common_truthvalue_conversion. */
1342 TREE_NO_WARNING (expr) = 1;
1344 if (TREE_CODE (expr) == OFFSET_REF)
1345 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1346 enclosed in parentheses. */
1347 PTRMEM_OK_P (expr) = 0;
1349 if (TREE_CODE (expr) == STRING_CST)
1350 PAREN_STRING_LITERAL_P (expr) = 1;
1355 /* Finish a reference to a non-static data member (DECL) that is not
1356 preceded by `.' or `->'. */
1359 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1361 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1365 if (current_function_decl
1366 && DECL_STATIC_FUNCTION_P (current_function_decl))
1367 error ("invalid use of member %q+D in static member function", decl);
1369 error ("invalid use of non-static data member %q+D", decl);
1370 error ("from this location");
1372 return error_mark_node;
1374 TREE_USED (current_class_ptr) = 1;
1375 if (processing_template_decl && !qualifying_scope)
1377 tree type = TREE_TYPE (decl);
1379 if (TREE_CODE (type) == REFERENCE_TYPE)
1380 type = TREE_TYPE (type);
1383 /* Set the cv qualifiers. */
1384 int quals = cp_type_quals (TREE_TYPE (current_class_ref));
1386 if (DECL_MUTABLE_P (decl))
1387 quals &= ~TYPE_QUAL_CONST;
1389 quals |= cp_type_quals (TREE_TYPE (decl));
1390 type = cp_build_qualified_type (type, quals);
1393 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1397 tree access_type = TREE_TYPE (object);
1398 tree lookup_context = context_for_name_lookup (decl);
1400 while (!DERIVED_FROM_P (lookup_context, access_type))
1402 access_type = TYPE_CONTEXT (access_type);
1403 while (access_type && DECL_P (access_type))
1404 access_type = DECL_CONTEXT (access_type);
1408 error ("object missing in reference to %q+D", decl);
1409 error ("from this location");
1410 return error_mark_node;
1414 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1415 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1417 if (processing_template_decl)
1418 return build_qualified_name (TREE_TYPE (decl),
1421 /*template_p=*/false);
1423 perform_or_defer_access_check (TYPE_BINFO (access_type), decl);
1425 /* If the data member was named `C::M', convert `*this' to `C'
1427 if (qualifying_scope)
1429 tree binfo = NULL_TREE;
1430 object = build_scoped_ref (object, qualifying_scope,
1434 return build_class_member_access_expr (object, decl,
1435 /*access_path=*/NULL_TREE,
1436 /*preserve_reference=*/false);
1440 /* DECL was the declaration to which a qualified-id resolved. Issue
1441 an error message if it is not accessible. If OBJECT_TYPE is
1442 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1443 type of `*x', or `x', respectively. If the DECL was named as
1444 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1447 check_accessibility_of_qualified_id (tree decl,
1449 tree nested_name_specifier)
1452 tree qualifying_type = NULL_TREE;
1454 /* If we're not checking, return immediately. */
1455 if (deferred_access_no_check)
1458 /* Determine the SCOPE of DECL. */
1459 scope = context_for_name_lookup (decl);
1460 /* If the SCOPE is not a type, then DECL is not a member. */
1461 if (!TYPE_P (scope))
1463 /* Compute the scope through which DECL is being accessed. */
1465 /* OBJECT_TYPE might not be a class type; consider:
1467 class A { typedef int I; };
1471 In this case, we will have "A::I" as the DECL, but "I" as the
1473 && CLASS_TYPE_P (object_type)
1474 && DERIVED_FROM_P (scope, object_type))
1475 /* If we are processing a `->' or `.' expression, use the type of the
1477 qualifying_type = object_type;
1478 else if (nested_name_specifier)
1480 /* If the reference is to a non-static member of the
1481 current class, treat it as if it were referenced through
1483 if (DECL_NONSTATIC_MEMBER_P (decl)
1484 && current_class_ptr
1485 && DERIVED_FROM_P (scope, current_class_type))
1486 qualifying_type = current_class_type;
1487 /* Otherwise, use the type indicated by the
1488 nested-name-specifier. */
1490 qualifying_type = nested_name_specifier;
1493 /* Otherwise, the name must be from the current class or one of
1495 qualifying_type = currently_open_derived_class (scope);
1497 if (qualifying_type && IS_AGGR_TYPE_CODE (TREE_CODE (qualifying_type)))
1498 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1499 or similar in a default argument value. */
1500 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl);
1503 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1504 class named to the left of the "::" operator. DONE is true if this
1505 expression is a complete postfix-expression; it is false if this
1506 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1507 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1508 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1509 is true iff this qualified name appears as a template argument. */
1512 finish_qualified_id_expr (tree qualifying_class,
1517 bool template_arg_p)
1519 if (error_operand_p (expr))
1520 return error_mark_node;
1523 check_template_keyword (expr);
1527 else if (BASELINK_P (expr)
1528 && TREE_CODE (BASELINK_FUNCTIONS (expr)) != TEMPLATE_ID_EXPR
1529 && !really_overloaded_fn (BASELINK_FUNCTIONS (expr)))
1530 mark_used (OVL_CURRENT (BASELINK_FUNCTIONS (expr)));
1532 /* If EXPR occurs as the operand of '&', use special handling that
1533 permits a pointer-to-member. */
1534 if (address_p && done)
1536 if (TREE_CODE (expr) == SCOPE_REF)
1537 expr = TREE_OPERAND (expr, 1);
1538 expr = build_offset_ref (qualifying_class, expr,
1539 /*address_p=*/true);
1543 /* Within the scope of a class, turn references to non-static
1544 members into expression of the form "this->...". */
1546 /* But, within a template argument, we do not want make the
1547 transformation, as there is no "this" pointer. */
1549 else if (TREE_CODE (expr) == FIELD_DECL)
1550 expr = finish_non_static_data_member (expr, current_class_ref,
1552 else if (BASELINK_P (expr) && !processing_template_decl)
1556 /* See if any of the functions are non-static members. */
1557 fns = BASELINK_FUNCTIONS (expr);
1558 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1559 fns = TREE_OPERAND (fns, 0);
1560 /* If so, the expression may be relative to the current
1562 if (!shared_member_p (fns)
1563 && current_class_type
1564 && DERIVED_FROM_P (qualifying_class, current_class_type))
1565 expr = (build_class_member_access_expr
1566 (maybe_dummy_object (qualifying_class, NULL),
1568 BASELINK_ACCESS_BINFO (expr),
1569 /*preserve_reference=*/false));
1571 /* The expression is a qualified name whose address is not
1573 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1579 /* Begin a statement-expression. The value returned must be passed to
1580 finish_stmt_expr. */
1583 begin_stmt_expr (void)
1585 return push_stmt_list ();
1588 /* Process the final expression of a statement expression. EXPR can be
1589 NULL, if the final expression is empty. Return a STATEMENT_LIST
1590 containing all the statements in the statement-expression, or
1591 ERROR_MARK_NODE if there was an error. */
1594 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1596 if (error_operand_p (expr))
1597 return error_mark_node;
1599 /* If the last statement does not have "void" type, then the value
1600 of the last statement is the value of the entire expression. */
1604 type = TREE_TYPE (expr);
1605 if (!dependent_type_p (type) && !VOID_TYPE_P (type))
1607 expr = decay_conversion (expr);
1608 if (error_operand_p (expr))
1609 return error_mark_node;
1610 type = TREE_TYPE (expr);
1612 /* The type of the statement-expression is the type of the last
1614 TREE_TYPE (stmt_expr) = type;
1615 /* We must take particular care if TYPE is a class type. In
1616 particular if EXPR creates a temporary of class type, then it
1617 must be destroyed at the semicolon terminating the last
1618 statement -- but we must make a copy before that happens.
1620 This problem is solved by using a TARGET_EXPR to initialize a
1621 new temporary variable. The TARGET_EXPR itself is placed
1622 outside the statement-expression. However, the last
1623 statement in the statement-expression is transformed from
1624 EXPR to (approximately) T = EXPR, where T is the new
1625 temporary variable. Thus, the lifetime of the new temporary
1626 extends to the full-expression surrounding the
1627 statement-expression. */
1628 if (!processing_template_decl && !VOID_TYPE_P (type))
1631 if (CLASS_TYPE_P (type)
1632 && !TYPE_HAS_TRIVIAL_INIT_REF (type))
1634 target_expr = build_target_expr_with_type (expr, type);
1635 expr = TARGET_EXPR_INITIAL (target_expr);
1639 /* Normally, build_target_expr will not create a
1640 TARGET_EXPR for scalars. However, we need the
1641 temporary here, in order to solve the scoping
1642 problem described above. */
1643 target_expr = force_target_expr (type, expr);
1644 expr = TARGET_EXPR_INITIAL (target_expr);
1645 expr = build2 (INIT_EXPR,
1647 TARGET_EXPR_SLOT (target_expr),
1650 TARGET_EXPR_INITIAL (target_expr) = NULL_TREE;
1651 /* Save away the TARGET_EXPR in the TREE_TYPE field of the
1652 STATEMENT_EXPR. We will retrieve it in
1653 finish_stmt_expr. */
1654 TREE_TYPE (stmt_expr) = target_expr;
1658 /* Having modified EXPR to reflect the extra initialization, we now
1659 treat it just like an ordinary statement. */
1660 expr = finish_expr_stmt (expr);
1662 /* Mark the last statement so that we can recognize it as such at
1663 template-instantiation time. */
1664 if (expr && processing_template_decl)
1665 EXPR_STMT_STMT_EXPR_RESULT (expr) = 1;
1670 /* Finish a statement-expression. EXPR should be the value returned
1671 by the previous begin_stmt_expr. Returns an expression
1672 representing the statement-expression. */
1675 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1680 if (error_operand_p (stmt_expr))
1681 return error_mark_node;
1683 gcc_assert (TREE_CODE (stmt_expr) == STATEMENT_LIST);
1685 type = TREE_TYPE (stmt_expr);
1686 result = pop_stmt_list (stmt_expr);
1688 if (processing_template_decl)
1690 result = build_min (STMT_EXPR, type, result);
1691 TREE_SIDE_EFFECTS (result) = 1;
1692 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1694 else if (!TYPE_P (type))
1696 gcc_assert (TREE_CODE (type) == TARGET_EXPR);
1697 TARGET_EXPR_INITIAL (type) = result;
1698 TREE_TYPE (result) = void_type_node;
1705 /* Perform Koenig lookup. FN is the postfix-expression representing
1706 the function (or functions) to call; ARGS are the arguments to the
1707 call. Returns the functions to be considered by overload
1711 perform_koenig_lookup (tree fn, tree args)
1713 tree identifier = NULL_TREE;
1714 tree functions = NULL_TREE;
1716 /* Find the name of the overloaded function. */
1717 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1719 else if (is_overloaded_fn (fn))
1722 identifier = DECL_NAME (get_first_fn (functions));
1724 else if (DECL_P (fn))
1727 identifier = DECL_NAME (fn);
1730 /* A call to a namespace-scope function using an unqualified name.
1732 Do Koenig lookup -- unless any of the arguments are
1734 if (!any_type_dependent_arguments_p (args))
1736 fn = lookup_arg_dependent (identifier, functions, args);
1738 /* The unqualified name could not be resolved. */
1739 fn = unqualified_fn_lookup_error (identifier);
1745 /* Generate an expression for `FN (ARGS)'.
1747 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1748 as a virtual call, even if FN is virtual. (This flag is set when
1749 encountering an expression where the function name is explicitly
1750 qualified. For example a call to `X::f' never generates a virtual
1753 Returns code for the call. */
1756 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p)
1762 if (fn == error_mark_node || args == error_mark_node)
1763 return error_mark_node;
1765 /* ARGS should be a list of arguments. */
1766 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1771 if (processing_template_decl)
1773 if (type_dependent_expression_p (fn)
1774 || any_type_dependent_arguments_p (args))
1776 result = build_nt (CALL_EXPR, fn, args, NULL_TREE);
1777 KOENIG_LOOKUP_P (result) = koenig_p;
1780 if (!BASELINK_P (fn)
1781 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1782 && TREE_TYPE (fn) != unknown_type_node)
1783 fn = build_non_dependent_expr (fn);
1784 args = build_non_dependent_args (orig_args);
1787 /* A reference to a member function will appear as an overloaded
1788 function (rather than a BASELINK) if an unqualified name was used
1790 if (!BASELINK_P (fn) && is_overloaded_fn (fn))
1794 if (TREE_CODE (f) == TEMPLATE_ID_EXPR)
1795 f = TREE_OPERAND (f, 0);
1796 f = get_first_fn (f);
1797 if (DECL_FUNCTION_MEMBER_P (f))
1799 tree type = currently_open_derived_class (DECL_CONTEXT (f));
1801 type = DECL_CONTEXT (f);
1802 fn = build_baselink (TYPE_BINFO (type),
1804 fn, /*optype=*/NULL_TREE);
1809 if (BASELINK_P (fn))
1813 /* A call to a member function. From [over.call.func]:
1815 If the keyword this is in scope and refers to the class of
1816 that member function, or a derived class thereof, then the
1817 function call is transformed into a qualified function call
1818 using (*this) as the postfix-expression to the left of the
1819 . operator.... [Otherwise] a contrived object of type T
1820 becomes the implied object argument.
1822 This paragraph is unclear about this situation:
1824 struct A { void f(); };
1825 struct B : public A {};
1826 struct C : public A { void g() { B::f(); }};
1828 In particular, for `B::f', this paragraph does not make clear
1829 whether "the class of that member function" refers to `A' or
1830 to `B'. We believe it refers to `B'. */
1831 if (current_class_type
1832 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1834 && current_class_ref)
1835 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1839 tree representative_fn;
1841 representative_fn = BASELINK_FUNCTIONS (fn);
1842 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1843 representative_fn = TREE_OPERAND (representative_fn, 0);
1844 representative_fn = get_first_fn (representative_fn);
1845 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1848 if (processing_template_decl)
1850 if (type_dependent_expression_p (object))
1851 return build_nt (CALL_EXPR, orig_fn, orig_args, NULL_TREE);
1852 object = build_non_dependent_expr (object);
1855 result = build_new_method_call (object, fn, args, NULL_TREE,
1857 ? LOOKUP_NONVIRTUAL : 0));
1859 else if (is_overloaded_fn (fn))
1861 /* If the function is an overloaded builtin, resolve it. */
1862 if (TREE_CODE (fn) == FUNCTION_DECL
1863 && (DECL_BUILT_IN_CLASS (fn) == BUILT_IN_NORMAL
1864 || DECL_BUILT_IN_CLASS (fn) == BUILT_IN_MD))
1865 result = resolve_overloaded_builtin (fn, args);
1868 /* A call to a namespace-scope function. */
1869 result = build_new_function_call (fn, args, koenig_p);
1871 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1874 error ("arguments to destructor are not allowed");
1875 /* Mark the pseudo-destructor call as having side-effects so
1876 that we do not issue warnings about its use. */
1877 result = build1 (NOP_EXPR,
1879 TREE_OPERAND (fn, 0));
1880 TREE_SIDE_EFFECTS (result) = 1;
1882 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1883 /* If the "function" is really an object of class type, it might
1884 have an overloaded `operator ()'. */
1885 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1886 /*overloaded_p=*/NULL);
1889 /* A call where the function is unknown. */
1890 result = build_function_call (fn, args);
1892 if (processing_template_decl)
1894 result = build3 (CALL_EXPR, TREE_TYPE (result), orig_fn,
1895 orig_args, NULL_TREE);
1896 KOENIG_LOOKUP_P (result) = koenig_p;
1901 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1902 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1903 POSTDECREMENT_EXPR.) */
1906 finish_increment_expr (tree expr, enum tree_code code)
1908 return build_x_unary_op (code, expr);
1911 /* Finish a use of `this'. Returns an expression for `this'. */
1914 finish_this_expr (void)
1918 if (current_class_ptr)
1920 result = current_class_ptr;
1922 else if (current_function_decl
1923 && DECL_STATIC_FUNCTION_P (current_function_decl))
1925 error ("%<this%> is unavailable for static member functions");
1926 result = error_mark_node;
1930 if (current_function_decl)
1931 error ("invalid use of %<this%> in non-member function");
1933 error ("invalid use of %<this%> at top level");
1934 result = error_mark_node;
1940 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
1941 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
1942 the TYPE for the type given. If SCOPE is non-NULL, the expression
1943 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
1946 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
1948 if (destructor == error_mark_node)
1949 return error_mark_node;
1951 gcc_assert (TYPE_P (destructor));
1953 if (!processing_template_decl)
1955 if (scope == error_mark_node)
1957 error ("invalid qualifying scope in pseudo-destructor name");
1958 return error_mark_node;
1961 /* [expr.pseudo] says both:
1963 The type designated by the pseudo-destructor-name shall be
1964 the same as the object type.
1968 The cv-unqualified versions of the object type and of the
1969 type designated by the pseudo-destructor-name shall be the
1972 We implement the more generous second sentence, since that is
1973 what most other compilers do. */
1974 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
1977 error ("%qE is not of type %qT", object, destructor);
1978 return error_mark_node;
1982 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
1985 /* Finish an expression of the form CODE EXPR. */
1988 finish_unary_op_expr (enum tree_code code, tree expr)
1990 tree result = build_x_unary_op (code, expr);
1991 /* Inside a template, build_x_unary_op does not fold the
1992 expression. So check whether the result is folded before
1993 setting TREE_NEGATED_INT. */
1994 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
1995 && TREE_CODE (result) == INTEGER_CST
1996 && !TYPE_UNSIGNED (TREE_TYPE (result))
1997 && INT_CST_LT (result, integer_zero_node))
1999 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2000 setting TREE_NEGATED_INT. */
2001 result = copy_node (result);
2002 TREE_NEGATED_INT (result) = 1;
2004 overflow_warning (result);
2008 /* Finish a compound-literal expression. TYPE is the type to which
2009 the INITIALIZER_LIST is being cast. */
2012 finish_compound_literal (tree type, VEC(constructor_elt,gc) *initializer_list)
2014 tree compound_literal;
2016 /* Build a CONSTRUCTOR for the INITIALIZER_LIST. */
2017 compound_literal = build_constructor (NULL_TREE, initializer_list);
2018 if (processing_template_decl)
2019 TREE_TYPE (compound_literal) = type;
2022 /* Check the initialization. */
2023 compound_literal = reshape_init (type, compound_literal);
2024 compound_literal = digest_init (type, compound_literal);
2025 /* If the TYPE was an array type with an unknown bound, then we can
2026 figure out the dimension now. For example, something like:
2030 implies that the array has two elements. */
2031 if (TREE_CODE (type) == ARRAY_TYPE && !COMPLETE_TYPE_P (type))
2032 cp_complete_array_type (&TREE_TYPE (compound_literal),
2033 compound_literal, 1);
2036 /* Mark it as a compound-literal. */
2037 if (TREE_CODE (compound_literal) == CONSTRUCTOR)
2038 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
2040 return compound_literal;
2043 /* Return the declaration for the function-name variable indicated by
2047 finish_fname (tree id)
2051 decl = fname_decl (C_RID_CODE (id), id);
2052 if (processing_template_decl)
2053 decl = DECL_NAME (decl);
2057 /* Finish a translation unit. */
2060 finish_translation_unit (void)
2062 /* In case there were missing closebraces,
2063 get us back to the global binding level. */
2065 while (current_namespace != global_namespace)
2068 /* Do file scope __FUNCTION__ et al. */
2069 finish_fname_decls ();
2072 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2073 Returns the parameter. */
2076 finish_template_type_parm (tree aggr, tree identifier)
2078 if (aggr != class_type_node)
2080 pedwarn ("template type parameters must use the keyword %<class%> or %<typename%>");
2081 aggr = class_type_node;
2084 return build_tree_list (aggr, identifier);
2087 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2088 Returns the parameter. */
2091 finish_template_template_parm (tree aggr, tree identifier)
2093 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2094 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2095 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2096 DECL_TEMPLATE_RESULT (tmpl) = decl;
2097 DECL_ARTIFICIAL (decl) = 1;
2098 end_template_decl ();
2100 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2102 return finish_template_type_parm (aggr, tmpl);
2105 /* ARGUMENT is the default-argument value for a template template
2106 parameter. If ARGUMENT is invalid, issue error messages and return
2107 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2110 check_template_template_default_arg (tree argument)
2112 if (TREE_CODE (argument) != TEMPLATE_DECL
2113 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2114 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2116 if (TREE_CODE (argument) == TYPE_DECL)
2118 tree t = TREE_TYPE (argument);
2120 /* Try to emit a slightly smarter error message if we detect
2121 that the user is using a template instantiation. */
2122 if (CLASSTYPE_TEMPLATE_INFO (t)
2123 && CLASSTYPE_TEMPLATE_INSTANTIATION (t))
2124 error ("invalid use of type %qT as a default value for a "
2125 "template template-parameter", t);
2127 error ("invalid use of %qD as a default value for a template "
2128 "template-parameter", argument);
2131 error ("invalid default argument for a template template parameter");
2132 return error_mark_node;
2138 /* Begin a class definition, as indicated by T. */
2141 begin_class_definition (tree t)
2143 if (t == error_mark_node)
2144 return error_mark_node;
2146 if (processing_template_parmlist)
2148 error ("definition of %q#T inside template parameter list", t);
2149 return error_mark_node;
2151 /* A non-implicit typename comes from code like:
2153 template <typename T> struct A {
2154 template <typename U> struct A<T>::B ...
2156 This is erroneous. */
2157 else if (TREE_CODE (t) == TYPENAME_TYPE)
2159 error ("invalid definition of qualified type %qT", t);
2160 t = error_mark_node;
2163 if (t == error_mark_node || ! IS_AGGR_TYPE (t))
2165 t = make_aggr_type (RECORD_TYPE);
2166 pushtag (make_anon_name (), t, /*tag_scope=*/ts_current);
2169 /* Update the location of the decl. */
2170 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2172 if (TYPE_BEING_DEFINED (t))
2174 t = make_aggr_type (TREE_CODE (t));
2175 pushtag (TYPE_IDENTIFIER (t), t, /*tag_scope=*/ts_current);
2177 maybe_process_partial_specialization (t);
2179 TYPE_BEING_DEFINED (t) = 1;
2180 if (flag_pack_struct)
2183 TYPE_PACKED (t) = 1;
2184 /* Even though the type is being defined for the first time
2185 here, there might have been a forward declaration, so there
2186 might be cv-qualified variants of T. */
2187 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2188 TYPE_PACKED (v) = 1;
2190 /* Reset the interface data, at the earliest possible
2191 moment, as it might have been set via a class foo;
2193 if (! TYPE_ANONYMOUS_P (t))
2195 struct c_fileinfo *finfo = get_fileinfo (lbasename (input_filename));
2196 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2197 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2198 (t, finfo->interface_unknown);
2200 reset_specialization();
2202 /* Make a declaration for this class in its own scope. */
2203 build_self_reference ();
2208 /* Finish the member declaration given by DECL. */
2211 finish_member_declaration (tree decl)
2213 if (decl == error_mark_node || decl == NULL_TREE)
2216 if (decl == void_type_node)
2217 /* The COMPONENT was a friend, not a member, and so there's
2218 nothing for us to do. */
2221 /* We should see only one DECL at a time. */
2222 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2224 /* Set up access control for DECL. */
2226 = (current_access_specifier == access_private_node);
2227 TREE_PROTECTED (decl)
2228 = (current_access_specifier == access_protected_node);
2229 if (TREE_CODE (decl) == TEMPLATE_DECL)
2231 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2232 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2235 /* Mark the DECL as a member of the current class. */
2236 DECL_CONTEXT (decl) = current_class_type;
2240 A C language linkage is ignored for the names of class members
2241 and the member function type of class member functions. */
2242 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2243 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2245 /* Put functions on the TYPE_METHODS list and everything else on the
2246 TYPE_FIELDS list. Note that these are built up in reverse order.
2247 We reverse them (to obtain declaration order) in finish_struct. */
2248 if (TREE_CODE (decl) == FUNCTION_DECL
2249 || DECL_FUNCTION_TEMPLATE_P (decl))
2251 /* We also need to add this function to the
2252 CLASSTYPE_METHOD_VEC. */
2253 if (add_method (current_class_type, decl, NULL_TREE))
2255 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2256 TYPE_METHODS (current_class_type) = decl;
2258 maybe_add_class_template_decl_list (current_class_type, decl,
2262 /* Enter the DECL into the scope of the class. */
2263 else if ((TREE_CODE (decl) == USING_DECL && !DECL_DEPENDENT_P (decl))
2264 || pushdecl_class_level (decl))
2266 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2267 go at the beginning. The reason is that lookup_field_1
2268 searches the list in order, and we want a field name to
2269 override a type name so that the "struct stat hack" will
2270 work. In particular:
2272 struct S { enum E { }; int E } s;
2275 is valid. In addition, the FIELD_DECLs must be maintained in
2276 declaration order so that class layout works as expected.
2277 However, we don't need that order until class layout, so we
2278 save a little time by putting FIELD_DECLs on in reverse order
2279 here, and then reversing them in finish_struct_1. (We could
2280 also keep a pointer to the correct insertion points in the
2283 if (TREE_CODE (decl) == TYPE_DECL)
2284 TYPE_FIELDS (current_class_type)
2285 = chainon (TYPE_FIELDS (current_class_type), decl);
2288 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2289 TYPE_FIELDS (current_class_type) = decl;
2292 maybe_add_class_template_decl_list (current_class_type, decl,
2297 note_decl_for_pch (decl);
2300 /* DECL has been declared while we are building a PCH file. Perform
2301 actions that we might normally undertake lazily, but which can be
2302 performed now so that they do not have to be performed in
2303 translation units which include the PCH file. */
2306 note_decl_for_pch (tree decl)
2308 gcc_assert (pch_file);
2310 /* There's a good chance that we'll have to mangle names at some
2311 point, even if only for emission in debugging information. */
2312 if (TREE_CODE (decl) == VAR_DECL
2313 || TREE_CODE (decl) == FUNCTION_DECL)
2317 /* Finish processing a complete template declaration. The PARMS are
2318 the template parameters. */
2321 finish_template_decl (tree parms)
2324 end_template_decl ();
2326 end_specialization ();
2329 /* Finish processing a template-id (which names a type) of the form
2330 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2331 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2332 the scope of template-id indicated. */
2335 finish_template_type (tree name, tree args, int entering_scope)
2339 decl = lookup_template_class (name, args,
2340 NULL_TREE, NULL_TREE, entering_scope,
2341 tf_error | tf_warning | tf_user);
2342 if (decl != error_mark_node)
2343 decl = TYPE_STUB_DECL (decl);
2348 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2349 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2350 BASE_CLASS, or NULL_TREE if an error occurred. The
2351 ACCESS_SPECIFIER is one of
2352 access_{default,public,protected_private}_node. For a virtual base
2353 we set TREE_TYPE. */
2356 finish_base_specifier (tree base, tree access, bool virtual_p)
2360 if (base == error_mark_node)
2362 error ("invalid base-class specification");
2365 else if (! is_aggr_type (base, 1))
2369 if (cp_type_quals (base) != 0)
2371 error ("base class %qT has cv qualifiers", base);
2372 base = TYPE_MAIN_VARIANT (base);
2374 result = build_tree_list (access, base);
2376 TREE_TYPE (result) = integer_type_node;
2382 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2383 what we found when we tried to do the lookup. */
2386 qualified_name_lookup_error (tree scope, tree name, tree decl)
2388 if (scope == error_mark_node)
2389 ; /* We already complained. */
2390 else if (TYPE_P (scope))
2392 if (!COMPLETE_TYPE_P (scope))
2393 error ("incomplete type %qT used in nested name specifier", scope);
2394 else if (TREE_CODE (decl) == TREE_LIST)
2396 error ("reference to %<%T::%D%> is ambiguous", scope, name);
2397 print_candidates (decl);
2400 error ("%qD is not a member of %qT", name, scope);
2402 else if (scope != global_namespace)
2403 error ("%qD is not a member of %qD", name, scope);
2405 error ("%<::%D%> has not been declared", name);
2408 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2409 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2410 if non-NULL, is the type or namespace used to explicitly qualify
2411 ID_EXPRESSION. DECL is the entity to which that name has been
2414 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2415 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2416 be set to true if this expression isn't permitted in a
2417 constant-expression, but it is otherwise not set by this function.
2418 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2419 constant-expression, but a non-constant expression is also
2422 DONE is true if this expression is a complete postfix-expression;
2423 it is false if this expression is followed by '->', '[', '(', etc.
2424 ADDRESS_P is true iff this expression is the operand of '&'.
2425 TEMPLATE_P is true iff the qualified-id was of the form
2426 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2427 appears as a template argument.
2429 If an error occurs, and it is the kind of error that might cause
2430 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2431 is the caller's responsibility to issue the message. *ERROR_MSG
2432 will be a string with static storage duration, so the caller need
2435 Return an expression for the entity, after issuing appropriate
2436 diagnostics. This function is also responsible for transforming a
2437 reference to a non-static member into a COMPONENT_REF that makes
2438 the use of "this" explicit.
2440 Upon return, *IDK will be filled in appropriately. */
2443 finish_id_expression (tree id_expression,
2447 bool integral_constant_expression_p,
2448 bool allow_non_integral_constant_expression_p,
2449 bool *non_integral_constant_expression_p,
2453 bool template_arg_p,
2454 const char **error_msg)
2456 /* Initialize the output parameters. */
2457 *idk = CP_ID_KIND_NONE;
2460 if (id_expression == error_mark_node)
2461 return error_mark_node;
2462 /* If we have a template-id, then no further lookup is
2463 required. If the template-id was for a template-class, we
2464 will sometimes have a TYPE_DECL at this point. */
2465 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2466 || TREE_CODE (decl) == TYPE_DECL)
2468 /* Look up the name. */
2471 if (decl == error_mark_node)
2473 /* Name lookup failed. */
2476 || (!dependent_type_p (scope)
2477 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2478 && IDENTIFIER_TYPENAME_P (id_expression)
2479 && dependent_type_p (TREE_TYPE (id_expression))))))
2481 /* If the qualifying type is non-dependent (and the name
2482 does not name a conversion operator to a dependent
2483 type), issue an error. */
2484 qualified_name_lookup_error (scope, id_expression, decl);
2485 return error_mark_node;
2489 /* It may be resolved via Koenig lookup. */
2490 *idk = CP_ID_KIND_UNQUALIFIED;
2491 return id_expression;
2494 decl = id_expression;
2496 /* If DECL is a variable that would be out of scope under
2497 ANSI/ISO rules, but in scope in the ARM, name lookup
2498 will succeed. Issue a diagnostic here. */
2500 decl = check_for_out_of_scope_variable (decl);
2502 /* Remember that the name was used in the definition of
2503 the current class so that we can check later to see if
2504 the meaning would have been different after the class
2505 was entirely defined. */
2506 if (!scope && decl != error_mark_node)
2507 maybe_note_name_used_in_class (id_expression, decl);
2509 /* Disallow uses of local variables from containing functions. */
2510 if (TREE_CODE (decl) == VAR_DECL || TREE_CODE (decl) == PARM_DECL)
2512 tree context = decl_function_context (decl);
2513 if (context != NULL_TREE && context != current_function_decl
2514 && ! TREE_STATIC (decl))
2516 error (TREE_CODE (decl) == VAR_DECL
2517 ? "use of %<auto%> variable from containing function"
2518 : "use of parameter from containing function");
2519 error (" %q+#D declared here", decl);
2520 return error_mark_node;
2525 /* If we didn't find anything, or what we found was a type,
2526 then this wasn't really an id-expression. */
2527 if (TREE_CODE (decl) == TEMPLATE_DECL
2528 && !DECL_FUNCTION_TEMPLATE_P (decl))
2530 *error_msg = "missing template arguments";
2531 return error_mark_node;
2533 else if (TREE_CODE (decl) == TYPE_DECL
2534 || TREE_CODE (decl) == NAMESPACE_DECL)
2536 *error_msg = "expected primary-expression";
2537 return error_mark_node;
2540 /* If the name resolved to a template parameter, there is no
2541 need to look it up again later. */
2542 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2543 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2547 *idk = CP_ID_KIND_NONE;
2548 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2549 decl = TEMPLATE_PARM_DECL (decl);
2550 r = convert_from_reference (DECL_INITIAL (decl));
2552 if (integral_constant_expression_p
2553 && !dependent_type_p (TREE_TYPE (decl))
2554 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r))))
2556 if (!allow_non_integral_constant_expression_p)
2557 error ("template parameter %qD of type %qT is not allowed in "
2558 "an integral constant expression because it is not of "
2559 "integral or enumeration type", decl, TREE_TYPE (decl));
2560 *non_integral_constant_expression_p = true;
2564 /* Similarly, we resolve enumeration constants to their
2565 underlying values. */
2566 else if (TREE_CODE (decl) == CONST_DECL)
2568 *idk = CP_ID_KIND_NONE;
2569 if (!processing_template_decl)
2570 return DECL_INITIAL (decl);
2577 /* If the declaration was explicitly qualified indicate
2578 that. The semantics of `A::f(3)' are different than
2579 `f(3)' if `f' is virtual. */
2581 ? CP_ID_KIND_QUALIFIED
2582 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2583 ? CP_ID_KIND_TEMPLATE_ID
2584 : CP_ID_KIND_UNQUALIFIED));
2589 An id-expression is type-dependent if it contains an
2590 identifier that was declared with a dependent type.
2592 The standard is not very specific about an id-expression that
2593 names a set of overloaded functions. What if some of them
2594 have dependent types and some of them do not? Presumably,
2595 such a name should be treated as a dependent name. */
2596 /* Assume the name is not dependent. */
2597 dependent_p = false;
2598 if (!processing_template_decl)
2599 /* No names are dependent outside a template. */
2601 /* A template-id where the name of the template was not resolved
2602 is definitely dependent. */
2603 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2604 && (TREE_CODE (TREE_OPERAND (decl, 0))
2605 == IDENTIFIER_NODE))
2607 /* For anything except an overloaded function, just check its
2609 else if (!is_overloaded_fn (decl))
2611 = dependent_type_p (TREE_TYPE (decl));
2612 /* For a set of overloaded functions, check each of the
2618 if (BASELINK_P (fns))
2619 fns = BASELINK_FUNCTIONS (fns);
2621 /* For a template-id, check to see if the template
2622 arguments are dependent. */
2623 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2625 tree args = TREE_OPERAND (fns, 1);
2626 dependent_p = any_dependent_template_arguments_p (args);
2627 /* The functions are those referred to by the
2629 fns = TREE_OPERAND (fns, 0);
2632 /* If there are no dependent template arguments, go through
2633 the overloaded functions. */
2634 while (fns && !dependent_p)
2636 tree fn = OVL_CURRENT (fns);
2638 /* Member functions of dependent classes are
2640 if (TREE_CODE (fn) == FUNCTION_DECL
2641 && type_dependent_expression_p (fn))
2643 else if (TREE_CODE (fn) == TEMPLATE_DECL
2644 && dependent_template_p (fn))
2647 fns = OVL_NEXT (fns);
2651 /* If the name was dependent on a template parameter, we will
2652 resolve the name at instantiation time. */
2655 /* Create a SCOPE_REF for qualified names, if the scope is
2659 /* Since this name was dependent, the expression isn't
2660 constant -- yet. No error is issued because it might
2661 be constant when things are instantiated. */
2662 if (integral_constant_expression_p)
2663 *non_integral_constant_expression_p = true;
2666 if (address_p && done)
2667 decl = finish_qualified_id_expr (scope, decl,
2671 else if (dependent_type_p (scope))
2672 decl = build_qualified_name (/*type=*/NULL_TREE,
2676 else if (DECL_P (decl))
2677 decl = build_qualified_name (TREE_TYPE (decl),
2682 if (TREE_TYPE (decl))
2683 decl = convert_from_reference (decl);
2686 /* A TEMPLATE_ID already contains all the information we
2688 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2689 return id_expression;
2690 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2691 /* If we found a variable, then name lookup during the
2692 instantiation will always resolve to the same VAR_DECL
2693 (or an instantiation thereof). */
2694 if (TREE_CODE (decl) == VAR_DECL
2695 || TREE_CODE (decl) == PARM_DECL)
2696 return convert_from_reference (decl);
2697 /* The same is true for FIELD_DECL, but we also need to
2698 make sure that the syntax is correct. */
2699 else if (TREE_CODE (decl) == FIELD_DECL)
2701 /* Since SCOPE is NULL here, this is an unqualified name.
2702 Access checking has been performed during name lookup
2703 already. Turn off checking to avoid duplicate errors. */
2704 push_deferring_access_checks (dk_no_check);
2705 decl = finish_non_static_data_member
2706 (decl, current_class_ref,
2707 /*qualifying_scope=*/NULL_TREE);
2708 pop_deferring_access_checks ();
2711 return id_expression;
2714 /* Only certain kinds of names are allowed in constant
2715 expression. Enumerators and template parameters have already
2716 been handled above. */
2717 if (integral_constant_expression_p
2718 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl)
2719 && ! builtin_valid_in_constant_expr_p (decl))
2721 if (!allow_non_integral_constant_expression_p)
2723 error ("%qD cannot appear in a constant-expression", decl);
2724 return error_mark_node;
2726 *non_integral_constant_expression_p = true;
2729 if (TREE_CODE (decl) == NAMESPACE_DECL)
2731 error ("use of namespace %qD as expression", decl);
2732 return error_mark_node;
2734 else if (DECL_CLASS_TEMPLATE_P (decl))
2736 error ("use of class template %qT as expression", decl);
2737 return error_mark_node;
2739 else if (TREE_CODE (decl) == TREE_LIST)
2741 /* Ambiguous reference to base members. */
2742 error ("request for member %qD is ambiguous in "
2743 "multiple inheritance lattice", id_expression);
2744 print_candidates (decl);
2745 return error_mark_node;
2748 /* Mark variable-like entities as used. Functions are similarly
2749 marked either below or after overload resolution. */
2750 if (TREE_CODE (decl) == VAR_DECL
2751 || TREE_CODE (decl) == PARM_DECL
2752 || TREE_CODE (decl) == RESULT_DECL)
2757 decl = (adjust_result_of_qualified_name_lookup
2758 (decl, scope, current_class_type));
2760 if (TREE_CODE (decl) == FUNCTION_DECL)
2763 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2764 decl = finish_qualified_id_expr (scope,
2772 tree r = convert_from_reference (decl);
2774 if (processing_template_decl && TYPE_P (scope))
2775 r = build_qualified_name (TREE_TYPE (r),
2781 else if (TREE_CODE (decl) == FIELD_DECL)
2783 /* Since SCOPE is NULL here, this is an unqualified name.
2784 Access checking has been performed during name lookup
2785 already. Turn off checking to avoid duplicate errors. */
2786 push_deferring_access_checks (dk_no_check);
2787 decl = finish_non_static_data_member (decl, current_class_ref,
2788 /*qualifying_scope=*/NULL_TREE);
2789 pop_deferring_access_checks ();
2791 else if (is_overloaded_fn (decl))
2793 tree first_fn = OVL_CURRENT (decl);
2795 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2796 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2798 if (!really_overloaded_fn (decl))
2799 mark_used (first_fn);
2802 && TREE_CODE (first_fn) == FUNCTION_DECL
2803 && DECL_FUNCTION_MEMBER_P (first_fn)
2804 && !shared_member_p (decl))
2806 /* A set of member functions. */
2807 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
2808 return finish_class_member_access_expr (decl, id_expression,
2809 /*template_p=*/false);
2814 if (DECL_P (decl) && DECL_NONLOCAL (decl)
2815 && DECL_CLASS_SCOPE_P (decl)
2816 && DECL_CONTEXT (decl) != current_class_type)
2820 path = currently_open_derived_class (DECL_CONTEXT (decl));
2821 perform_or_defer_access_check (TYPE_BINFO (path), decl);
2824 decl = convert_from_reference (decl);
2828 if (TREE_DEPRECATED (decl))
2829 warn_deprecated_use (decl);
2834 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
2835 use as a type-specifier. */
2838 finish_typeof (tree expr)
2842 if (type_dependent_expression_p (expr))
2844 type = make_aggr_type (TYPEOF_TYPE);
2845 TYPEOF_TYPE_EXPR (type) = expr;
2850 type = TREE_TYPE (expr);
2852 if (!type || type == unknown_type_node)
2854 error ("type of %qE is unknown", expr);
2855 return error_mark_node;
2861 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
2862 with equivalent CALL_EXPRs. */
2865 simplify_aggr_init_exprs_r (tree* tp,
2867 void* data ATTRIBUTE_UNUSED)
2869 /* We don't need to walk into types; there's nothing in a type that
2870 needs simplification. (And, furthermore, there are places we
2871 actively don't want to go. For example, we don't want to wander
2872 into the default arguments for a FUNCTION_DECL that appears in a
2879 /* Only AGGR_INIT_EXPRs are interesting. */
2880 else if (TREE_CODE (*tp) != AGGR_INIT_EXPR)
2883 simplify_aggr_init_expr (tp);
2885 /* Keep iterating. */
2889 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
2890 function is broken out from the above for the benefit of the tree-ssa
2894 simplify_aggr_init_expr (tree *tp)
2896 tree aggr_init_expr = *tp;
2898 /* Form an appropriate CALL_EXPR. */
2899 tree fn = TREE_OPERAND (aggr_init_expr, 0);
2900 tree args = TREE_OPERAND (aggr_init_expr, 1);
2901 tree slot = TREE_OPERAND (aggr_init_expr, 2);
2902 tree type = TREE_TYPE (slot);
2905 enum style_t { ctor, arg, pcc } style;
2907 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
2909 #ifdef PCC_STATIC_STRUCT_RETURN
2915 gcc_assert (TREE_ADDRESSABLE (type));
2921 /* Replace the first argument to the ctor with the address of the
2925 args = TREE_CHAIN (args);
2926 cxx_mark_addressable (slot);
2927 addr = build1 (ADDR_EXPR, build_pointer_type (type), slot);
2928 args = tree_cons (NULL_TREE, addr, args);
2931 call_expr = build3 (CALL_EXPR,
2932 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
2933 fn, args, NULL_TREE);
2937 /* Just mark it addressable here, and leave the rest to
2938 expand_call{,_inline}. */
2939 cxx_mark_addressable (slot);
2940 CALL_EXPR_RETURN_SLOT_OPT (call_expr) = true;
2941 call_expr = build2 (MODIFY_EXPR, TREE_TYPE (call_expr), slot, call_expr);
2943 else if (style == pcc)
2945 /* If we're using the non-reentrant PCC calling convention, then we
2946 need to copy the returned value out of the static buffer into the
2948 push_deferring_access_checks (dk_no_check);
2949 call_expr = build_aggr_init (slot, call_expr,
2950 DIRECT_BIND | LOOKUP_ONLYCONVERTING);
2951 pop_deferring_access_checks ();
2952 call_expr = build (COMPOUND_EXPR, TREE_TYPE (slot), call_expr, slot);
2958 /* Emit all thunks to FN that should be emitted when FN is emitted. */
2961 emit_associated_thunks (tree fn)
2963 /* When we use vcall offsets, we emit thunks with the virtual
2964 functions to which they thunk. The whole point of vcall offsets
2965 is so that you can know statically the entire set of thunks that
2966 will ever be needed for a given virtual function, thereby
2967 enabling you to output all the thunks with the function itself. */
2968 if (DECL_VIRTUAL_P (fn))
2972 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
2974 if (!THUNK_ALIAS (thunk))
2976 use_thunk (thunk, /*emit_p=*/1);
2977 if (DECL_RESULT_THUNK_P (thunk))
2981 for (probe = DECL_THUNKS (thunk);
2982 probe; probe = TREE_CHAIN (probe))
2983 use_thunk (probe, /*emit_p=*/1);
2987 gcc_assert (!DECL_THUNKS (thunk));
2992 /* Generate RTL for FN. */
2995 expand_body (tree fn)
2997 tree saved_function;
2999 /* Compute the appropriate object-file linkage for inline
3001 if (DECL_DECLARED_INLINE_P (fn))
3002 import_export_decl (fn);
3004 /* If FN is external, then there's no point in generating RTL for
3005 it. This situation can arise with an inline function under
3006 `-fexternal-templates'; we instantiate the function, even though
3007 we're not planning on emitting it, in case we get a chance to
3009 if (DECL_EXTERNAL (fn))
3012 /* ??? When is this needed? */
3013 saved_function = current_function_decl;
3015 /* Emit any thunks that should be emitted at the same time as FN. */
3016 emit_associated_thunks (fn);
3018 /* This function is only called from cgraph, or recursively from
3019 emit_associated_thunks. In neither case should we be currently
3020 generating trees for a function. */
3021 gcc_assert (function_depth == 0);
3023 tree_rest_of_compilation (fn);
3025 current_function_decl = saved_function;
3027 if (DECL_CLONED_FUNCTION_P (fn))
3029 /* If this is a clone, go through the other clones now and mark
3030 their parameters used. We have to do that here, as we don't
3031 know whether any particular clone will be expanded, and
3032 therefore cannot pick one arbitrarily. */
3035 for (probe = TREE_CHAIN (DECL_CLONED_FUNCTION (fn));
3036 probe && DECL_CLONED_FUNCTION_P (probe);
3037 probe = TREE_CHAIN (probe))
3041 for (parms = DECL_ARGUMENTS (probe);
3042 parms; parms = TREE_CHAIN (parms))
3043 TREE_USED (parms) = 1;
3048 /* Generate RTL for FN. */
3051 expand_or_defer_fn (tree fn)
3053 /* When the parser calls us after finishing the body of a template
3054 function, we don't really want to expand the body. */
3055 if (processing_template_decl)
3057 /* Normally, collection only occurs in rest_of_compilation. So,
3058 if we don't collect here, we never collect junk generated
3059 during the processing of templates until we hit a
3060 non-template function. It's not safe to do this inside a
3061 nested class, though, as the parser may have local state that
3062 is not a GC root. */
3063 if (!function_depth)
3068 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
3069 walk_tree_without_duplicates (&DECL_SAVED_TREE (fn),
3070 simplify_aggr_init_exprs_r,
3073 /* If this is a constructor or destructor body, we have to clone
3075 if (maybe_clone_body (fn))
3077 /* We don't want to process FN again, so pretend we've written
3078 it out, even though we haven't. */
3079 TREE_ASM_WRITTEN (fn) = 1;
3083 /* If this function is marked with the constructor attribute, add it
3084 to the list of functions to be called along with constructors
3085 from static duration objects. */
3086 if (DECL_STATIC_CONSTRUCTOR (fn))
3087 static_ctors = tree_cons (NULL_TREE, fn, static_ctors);
3089 /* If this function is marked with the destructor attribute, add it
3090 to the list of functions to be called along with destructors from
3091 static duration objects. */
3092 if (DECL_STATIC_DESTRUCTOR (fn))
3093 static_dtors = tree_cons (NULL_TREE, fn, static_dtors);
3095 /* We make a decision about linkage for these functions at the end
3096 of the compilation. Until that point, we do not want the back
3097 end to output them -- but we do want it to see the bodies of
3098 these functions so that it can inline them as appropriate. */
3099 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
3101 if (DECL_INTERFACE_KNOWN (fn))
3102 /* We've already made a decision as to how this function will
3106 DECL_EXTERNAL (fn) = 1;
3107 DECL_NOT_REALLY_EXTERN (fn) = 1;
3108 note_vague_linkage_fn (fn);
3109 /* A non-template inline function with external linkage will
3110 always be COMDAT. As we must eventually determine the
3111 linkage of all functions, and as that causes writes to
3112 the data mapped in from the PCH file, it's advantageous
3113 to mark the functions at this point. */
3114 if (!DECL_IMPLICIT_INSTANTIATION (fn))
3116 /* This function must have external linkage, as
3117 otherwise DECL_INTERFACE_KNOWN would have been
3119 gcc_assert (TREE_PUBLIC (fn));
3120 comdat_linkage (fn);
3121 DECL_INTERFACE_KNOWN (fn) = 1;
3125 import_export_decl (fn);
3127 /* If the user wants us to keep all inline functions, then mark
3128 this function as needed so that finish_file will make sure to
3130 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3134 /* There's no reason to do any of the work here if we're only doing
3135 semantic analysis; this code just generates RTL. */
3136 if (flag_syntax_only)
3141 /* Expand or defer, at the whim of the compilation unit manager. */
3142 cgraph_finalize_function (fn, function_depth > 1);
3154 /* Helper function for walk_tree, used by finalize_nrv below. */
3157 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3159 struct nrv_data *dp = (struct nrv_data *)data;
3162 /* No need to walk into types. There wouldn't be any need to walk into
3163 non-statements, except that we have to consider STMT_EXPRs. */
3166 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3167 but differs from using NULL_TREE in that it indicates that we care
3168 about the value of the RESULT_DECL. */
3169 else if (TREE_CODE (*tp) == RETURN_EXPR)
3170 TREE_OPERAND (*tp, 0) = dp->result;
3171 /* Change all cleanups for the NRV to only run when an exception is
3173 else if (TREE_CODE (*tp) == CLEANUP_STMT
3174 && CLEANUP_DECL (*tp) == dp->var)
3175 CLEANUP_EH_ONLY (*tp) = 1;
3176 /* Replace the DECL_EXPR for the NRV with an initialization of the
3177 RESULT_DECL, if needed. */
3178 else if (TREE_CODE (*tp) == DECL_EXPR
3179 && DECL_EXPR_DECL (*tp) == dp->var)
3182 if (DECL_INITIAL (dp->var)
3183 && DECL_INITIAL (dp->var) != error_mark_node)
3185 init = build2 (INIT_EXPR, void_type_node, dp->result,
3186 DECL_INITIAL (dp->var));
3187 DECL_INITIAL (dp->var) = error_mark_node;
3190 init = build_empty_stmt ();
3191 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3194 /* And replace all uses of the NRV with the RESULT_DECL. */
3195 else if (*tp == dp->var)
3198 /* Avoid walking into the same tree more than once. Unfortunately, we
3199 can't just use walk_tree_without duplicates because it would only call
3200 us for the first occurrence of dp->var in the function body. */
3201 slot = htab_find_slot (dp->visited, *tp, INSERT);
3207 /* Keep iterating. */
3211 /* Called from finish_function to implement the named return value
3212 optimization by overriding all the RETURN_EXPRs and pertinent
3213 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3214 RESULT_DECL for the function. */
3217 finalize_nrv (tree *tp, tree var, tree result)
3219 struct nrv_data data;
3221 /* Copy debugging information from VAR to RESULT. */
3222 DECL_NAME (result) = DECL_NAME (var);
3223 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3224 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3225 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3226 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3227 /* Don't forget that we take its address. */
3228 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3231 data.result = result;
3232 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3233 walk_tree (tp, finalize_nrv_r, &data, 0);
3234 htab_delete (data.visited);
3237 /* Perform initialization related to this module. */
3240 init_cp_semantics (void)
3244 #include "gt-cp-semantics.h"