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
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, 59 Temple Place - Suite 330, 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_GC_O (deferred_access);
144 /* Data for deferred access checking. */
145 static GTY(()) VEC (deferred_access) *deferred_access_stack;
146 static GTY(()) unsigned deferred_access_no_check;
148 /* Save the current deferred access states and start deferred
149 access checking iff DEFER_P is true. */
152 push_deferring_access_checks (deferring_kind deferring)
154 /* For context like template instantiation, access checking
155 disabling applies to all nested context. */
156 if (deferred_access_no_check || deferring == dk_no_check)
157 deferred_access_no_check++;
160 deferred_access *ptr;
162 ptr = VEC_safe_push (deferred_access, deferred_access_stack, NULL);
163 ptr->deferred_access_checks = NULL_TREE;
164 ptr->deferring_access_checks_kind = deferring;
168 /* Resume deferring access checks again after we stopped doing
172 resume_deferring_access_checks (void)
174 if (!deferred_access_no_check)
175 VEC_last (deferred_access, deferred_access_stack)
176 ->deferring_access_checks_kind = dk_deferred;
179 /* Stop deferring access checks. */
182 stop_deferring_access_checks (void)
184 if (!deferred_access_no_check)
185 VEC_last (deferred_access, deferred_access_stack)
186 ->deferring_access_checks_kind = dk_no_deferred;
189 /* Discard the current deferred access checks and restore the
193 pop_deferring_access_checks (void)
195 if (deferred_access_no_check)
196 deferred_access_no_check--;
198 VEC_pop (deferred_access, deferred_access_stack);
201 /* Returns a TREE_LIST representing the deferred checks.
202 The TREE_PURPOSE of each node is the type through which the
203 access occurred; the TREE_VALUE is the declaration named.
207 get_deferred_access_checks (void)
209 if (deferred_access_no_check)
212 return (VEC_last (deferred_access, deferred_access_stack)
213 ->deferred_access_checks);
216 /* Take current deferred checks and combine with the
217 previous states if we also defer checks previously.
218 Otherwise perform checks now. */
221 pop_to_parent_deferring_access_checks (void)
223 if (deferred_access_no_check)
224 deferred_access_no_check--;
228 deferred_access *ptr;
230 checks = (VEC_last (deferred_access, deferred_access_stack)
231 ->deferred_access_checks);
233 VEC_pop (deferred_access, deferred_access_stack);
234 ptr = VEC_last (deferred_access, deferred_access_stack);
235 if (ptr->deferring_access_checks_kind == dk_no_deferred)
238 for (; checks; checks = TREE_CHAIN (checks))
239 enforce_access (TREE_PURPOSE (checks),
240 TREE_VALUE (checks));
244 /* Merge with parent. */
246 tree original = ptr->deferred_access_checks;
248 for (; checks; checks = next)
252 next = TREE_CHAIN (checks);
254 for (probe = original; probe; probe = TREE_CHAIN (probe))
255 if (TREE_VALUE (probe) == TREE_VALUE (checks)
256 && TREE_PURPOSE (probe) == TREE_PURPOSE (checks))
258 /* Insert into parent's checks. */
259 TREE_CHAIN (checks) = ptr->deferred_access_checks;
260 ptr->deferred_access_checks = checks;
267 /* Perform the deferred access checks.
269 After performing the checks, we still have to keep the list
270 `deferred_access_stack->deferred_access_checks' since we may want
271 to check access for them again later in a different context.
278 A::X A::a, x; // No error for `A::a', error for `x'
280 We have to perform deferred access of `A::X', first with `A::a',
284 perform_deferred_access_checks (void)
288 for (deferred_check = (VEC_last (deferred_access, deferred_access_stack)
289 ->deferred_access_checks);
291 deferred_check = TREE_CHAIN (deferred_check))
293 enforce_access (TREE_PURPOSE (deferred_check),
294 TREE_VALUE (deferred_check));
297 /* Defer checking the accessibility of DECL, when looked up in
301 perform_or_defer_access_check (tree binfo, tree decl)
304 deferred_access *ptr;
306 /* Exit if we are in a context that no access checking is performed.
308 if (deferred_access_no_check)
311 gcc_assert (TREE_CODE (binfo) == TREE_BINFO);
313 ptr = VEC_last (deferred_access, deferred_access_stack);
315 /* If we are not supposed to defer access checks, just check now. */
316 if (ptr->deferring_access_checks_kind == dk_no_deferred)
318 enforce_access (binfo, decl);
322 /* See if we are already going to perform this check. */
323 for (check = ptr->deferred_access_checks;
325 check = TREE_CHAIN (check))
326 if (TREE_VALUE (check) == decl && TREE_PURPOSE (check) == binfo)
328 /* If not, record the check. */
329 ptr->deferred_access_checks
330 = tree_cons (binfo, decl, ptr->deferred_access_checks);
333 /* Returns nonzero if the current statement is a full expression,
334 i.e. temporaries created during that statement should be destroyed
335 at the end of the statement. */
338 stmts_are_full_exprs_p (void)
340 return current_stmt_tree ()->stmts_are_full_exprs_p;
343 /* Returns the stmt_tree (if any) to which statements are currently
344 being added. If there is no active statement-tree, NULL is
348 current_stmt_tree (void)
351 ? &cfun->language->base.x_stmt_tree
352 : &scope_chain->x_stmt_tree);
355 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
358 maybe_cleanup_point_expr (tree expr)
360 if (!processing_template_decl && stmts_are_full_exprs_p ())
361 expr = build1 (CLEANUP_POINT_EXPR, TREE_TYPE (expr), expr);
365 /* Create a declaration statement for the declaration given by the DECL. */
368 add_decl_expr (tree decl)
370 tree r = build_stmt (DECL_EXPR, decl);
371 if (DECL_INITIAL (decl))
372 r = maybe_cleanup_point_expr (r);
376 /* Nonzero if TYPE is an anonymous union or struct type. We have to use a
377 flag for this because "A union for which objects or pointers are
378 declared is not an anonymous union" [class.union]. */
381 anon_aggr_type_p (tree node)
383 return ANON_AGGR_TYPE_P (node);
386 /* Finish a scope. */
389 do_poplevel (tree stmt_list)
393 if (stmts_are_full_exprs_p ())
394 block = poplevel (kept_level_p (), 1, 0);
396 stmt_list = pop_stmt_list (stmt_list);
398 if (!processing_template_decl)
400 stmt_list = c_build_bind_expr (block, stmt_list);
401 /* ??? See c_end_compound_stmt re statement expressions. */
407 /* Begin a new scope. */
410 do_pushlevel (scope_kind sk)
412 tree ret = push_stmt_list ();
413 if (stmts_are_full_exprs_p ())
414 begin_scope (sk, NULL);
418 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
419 when the current scope is exited. EH_ONLY is true when this is not
420 meant to apply to normal control flow transfer. */
423 push_cleanup (tree decl, tree cleanup, bool eh_only)
425 tree stmt = build_stmt (CLEANUP_STMT, NULL, cleanup, decl);
426 CLEANUP_EH_ONLY (stmt) = eh_only;
428 CLEANUP_BODY (stmt) = push_stmt_list ();
431 /* Begin a conditional that might contain a declaration. When generating
432 normal code, we want the declaration to appear before the statement
433 containing the conditional. When generating template code, we want the
434 conditional to be rendered as the raw DECL_EXPR. */
437 begin_cond (tree *cond_p)
439 if (processing_template_decl)
440 *cond_p = push_stmt_list ();
443 /* Finish such a conditional. */
446 finish_cond (tree *cond_p, tree expr)
448 if (processing_template_decl)
450 tree cond = pop_stmt_list (*cond_p);
451 if (TREE_CODE (cond) == DECL_EXPR)
457 /* If *COND_P specifies a conditional with a declaration, transform the
460 for (; A x = 42;) { }
462 while (true) { A x = 42; if (!x) break; }
463 for (;;) { A x = 42; if (!x) break; }
464 The statement list for BODY will be empty if the conditional did
465 not declare anything. */
468 simplify_loop_decl_cond (tree *cond_p, tree body)
472 if (!TREE_SIDE_EFFECTS (body))
476 *cond_p = boolean_true_node;
478 if_stmt = begin_if_stmt ();
479 cond = build_unary_op (TRUTH_NOT_EXPR, cond, 0);
480 finish_if_stmt_cond (cond, if_stmt);
481 finish_break_stmt ();
482 finish_then_clause (if_stmt);
483 finish_if_stmt (if_stmt);
486 /* Finish a goto-statement. */
489 finish_goto_stmt (tree destination)
491 if (TREE_CODE (destination) == IDENTIFIER_NODE)
492 destination = lookup_label (destination);
494 /* We warn about unused labels with -Wunused. That means we have to
495 mark the used labels as used. */
496 if (TREE_CODE (destination) == LABEL_DECL)
497 TREE_USED (destination) = 1;
500 /* The DESTINATION is being used as an rvalue. */
501 if (!processing_template_decl)
502 destination = decay_conversion (destination);
503 /* We don't inline calls to functions with computed gotos.
504 Those functions are typically up to some funny business,
505 and may be depending on the labels being at particular
506 addresses, or some such. */
507 DECL_UNINLINABLE (current_function_decl) = 1;
510 check_goto (destination);
512 return add_stmt (build_stmt (GOTO_EXPR, destination));
515 /* COND is the condition-expression for an if, while, etc.,
516 statement. Convert it to a boolean value, if appropriate. */
519 maybe_convert_cond (tree cond)
521 /* Empty conditions remain empty. */
525 /* Wait until we instantiate templates before doing conversion. */
526 if (processing_template_decl)
529 /* Do the conversion. */
530 cond = convert_from_reference (cond);
531 return condition_conversion (cond);
534 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
537 finish_expr_stmt (tree expr)
541 if (expr != NULL_TREE)
543 if (!processing_template_decl)
545 if (warn_sequence_point)
546 verify_sequence_points (expr);
547 expr = convert_to_void (expr, "statement");
549 else if (!type_dependent_expression_p (expr))
550 convert_to_void (build_non_dependent_expr (expr), "statement");
552 /* Simplification of inner statement expressions, compound exprs,
553 etc can result in the us already having an EXPR_STMT. */
554 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
556 if (TREE_CODE (expr) != EXPR_STMT)
557 expr = build_stmt (EXPR_STMT, expr);
558 expr = maybe_cleanup_point_expr (expr);
570 /* Begin an if-statement. Returns a newly created IF_STMT if
577 scope = do_pushlevel (sk_block);
578 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
579 TREE_CHAIN (r) = scope;
580 begin_cond (&IF_COND (r));
584 /* Process the COND of an if-statement, which may be given by
588 finish_if_stmt_cond (tree cond, tree if_stmt)
590 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
592 THEN_CLAUSE (if_stmt) = push_stmt_list ();
595 /* Finish the then-clause of an if-statement, which may be given by
599 finish_then_clause (tree if_stmt)
601 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
605 /* Begin the else-clause of an if-statement. */
608 begin_else_clause (tree if_stmt)
610 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
613 /* Finish the else-clause of an if-statement, which may be given by
617 finish_else_clause (tree if_stmt)
619 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
622 /* Finish an if-statement. */
625 finish_if_stmt (tree if_stmt)
627 tree scope = TREE_CHAIN (if_stmt);
628 TREE_CHAIN (if_stmt) = NULL;
629 add_stmt (do_poplevel (scope));
633 /* Begin a while-statement. Returns a newly created WHILE_STMT if
637 begin_while_stmt (void)
640 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
642 WHILE_BODY (r) = do_pushlevel (sk_block);
643 begin_cond (&WHILE_COND (r));
647 /* Process the COND of a while-statement, which may be given by
651 finish_while_stmt_cond (tree cond, tree while_stmt)
653 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
654 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
657 /* Finish a while-statement, which may be given by WHILE_STMT. */
660 finish_while_stmt (tree while_stmt)
662 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
666 /* Begin a do-statement. Returns a newly created DO_STMT if
672 tree r = build_stmt (DO_STMT, NULL_TREE, NULL_TREE);
674 DO_BODY (r) = push_stmt_list ();
678 /* Finish the body of a do-statement, which may be given by DO_STMT. */
681 finish_do_body (tree do_stmt)
683 DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
686 /* Finish a do-statement, which may be given by DO_STMT, and whose
687 COND is as indicated. */
690 finish_do_stmt (tree cond, tree do_stmt)
692 cond = maybe_convert_cond (cond);
693 DO_COND (do_stmt) = cond;
697 /* Finish a return-statement. The EXPRESSION returned, if any, is as
701 finish_return_stmt (tree expr)
705 expr = check_return_expr (expr);
706 if (!processing_template_decl)
708 if (DECL_DESTRUCTOR_P (current_function_decl)
709 || (DECL_CONSTRUCTOR_P (current_function_decl)
710 && targetm.cxx.cdtor_returns_this ()))
712 /* Similarly, all destructors must run destructors for
713 base-classes before returning. So, all returns in a
714 destructor get sent to the DTOR_LABEL; finish_function emits
715 code to return a value there. */
716 return finish_goto_stmt (cdtor_label);
720 r = build_stmt (RETURN_EXPR, expr);
721 r = maybe_cleanup_point_expr (r);
728 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
731 begin_for_stmt (void)
735 r = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE,
736 NULL_TREE, NULL_TREE);
738 if (flag_new_for_scope > 0)
739 TREE_CHAIN (r) = do_pushlevel (sk_for);
741 if (processing_template_decl)
742 FOR_INIT_STMT (r) = push_stmt_list ();
747 /* Finish the for-init-statement of a for-statement, which may be
748 given by FOR_STMT. */
751 finish_for_init_stmt (tree for_stmt)
753 if (processing_template_decl)
754 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
756 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
757 begin_cond (&FOR_COND (for_stmt));
760 /* Finish the COND of a for-statement, which may be given by
764 finish_for_cond (tree cond, tree for_stmt)
766 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
767 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
770 /* Finish the increment-EXPRESSION in a for-statement, which may be
771 given by FOR_STMT. */
774 finish_for_expr (tree expr, tree for_stmt)
778 /* If EXPR is an overloaded function, issue an error; there is no
779 context available to use to perform overload resolution. */
780 if (type_unknown_p (expr))
782 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
783 expr = error_mark_node;
785 expr = maybe_cleanup_point_expr (expr);
786 FOR_EXPR (for_stmt) = expr;
789 /* Finish the body of a for-statement, which may be given by
790 FOR_STMT. The increment-EXPR for the loop must be
794 finish_for_stmt (tree for_stmt)
796 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
798 /* Pop the scope for the body of the loop. */
799 if (flag_new_for_scope > 0)
801 tree scope = TREE_CHAIN (for_stmt);
802 TREE_CHAIN (for_stmt) = NULL;
803 add_stmt (do_poplevel (scope));
809 /* Finish a break-statement. */
812 finish_break_stmt (void)
814 return add_stmt (build_break_stmt ());
817 /* Finish a continue-statement. */
820 finish_continue_stmt (void)
822 return add_stmt (build_continue_stmt ());
825 /* Begin a switch-statement. Returns a new SWITCH_STMT if
829 begin_switch_stmt (void)
833 r = build_stmt (SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
835 scope = do_pushlevel (sk_block);
836 TREE_CHAIN (r) = scope;
837 begin_cond (&SWITCH_COND (r));
842 /* Finish the cond of a switch-statement. */
845 finish_switch_cond (tree cond, tree switch_stmt)
847 tree orig_type = NULL;
848 if (!processing_template_decl)
852 /* Convert the condition to an integer or enumeration type. */
853 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
854 if (cond == NULL_TREE)
856 error ("switch quantity not an integer");
857 cond = error_mark_node;
859 orig_type = TREE_TYPE (cond);
860 if (cond != error_mark_node)
864 Integral promotions are performed. */
865 cond = perform_integral_promotions (cond);
866 cond = maybe_cleanup_point_expr (cond);
869 if (cond != error_mark_node)
871 index = get_unwidened (cond, NULL_TREE);
872 /* We can't strip a conversion from a signed type to an unsigned,
873 because if we did, int_fits_type_p would do the wrong thing
874 when checking case values for being in range,
875 and it's too hard to do the right thing. */
876 if (TYPE_UNSIGNED (TREE_TYPE (cond))
877 == TYPE_UNSIGNED (TREE_TYPE (index)))
881 finish_cond (&SWITCH_COND (switch_stmt), cond);
882 SWITCH_TYPE (switch_stmt) = orig_type;
883 add_stmt (switch_stmt);
884 push_switch (switch_stmt);
885 SWITCH_BODY (switch_stmt) = push_stmt_list ();
888 /* Finish the body of a switch-statement, which may be given by
889 SWITCH_STMT. The COND to switch on is indicated. */
892 finish_switch_stmt (tree switch_stmt)
896 SWITCH_BODY (switch_stmt) = pop_stmt_list (SWITCH_BODY (switch_stmt));
900 scope = TREE_CHAIN (switch_stmt);
901 TREE_CHAIN (switch_stmt) = NULL;
902 add_stmt (do_poplevel (scope));
905 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
909 begin_try_block (void)
911 tree r = build_stmt (TRY_BLOCK, NULL_TREE, NULL_TREE);
913 TRY_STMTS (r) = push_stmt_list ();
917 /* Likewise, for a function-try-block. */
920 begin_function_try_block (void)
922 tree r = begin_try_block ();
923 FN_TRY_BLOCK_P (r) = 1;
927 /* Finish a try-block, which may be given by TRY_BLOCK. */
930 finish_try_block (tree try_block)
932 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
933 TRY_HANDLERS (try_block) = push_stmt_list ();
936 /* Finish the body of a cleanup try-block, which may be given by
940 finish_cleanup_try_block (tree try_block)
942 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
945 /* Finish an implicitly generated try-block, with a cleanup is given
949 finish_cleanup (tree cleanup, tree try_block)
951 TRY_HANDLERS (try_block) = cleanup;
952 CLEANUP_P (try_block) = 1;
955 /* Likewise, for a function-try-block. */
958 finish_function_try_block (tree try_block)
960 finish_try_block (try_block);
961 /* FIXME : something queer about CTOR_INITIALIZER somehow following
962 the try block, but moving it inside. */
963 in_function_try_handler = 1;
966 /* Finish a handler-sequence for a try-block, which may be given by
970 finish_handler_sequence (tree try_block)
972 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
973 check_handlers (TRY_HANDLERS (try_block));
976 /* Likewise, for a function-try-block. */
979 finish_function_handler_sequence (tree try_block)
981 in_function_try_handler = 0;
982 finish_handler_sequence (try_block);
985 /* Begin a handler. Returns a HANDLER if appropriate. */
992 r = build_stmt (HANDLER, NULL_TREE, NULL_TREE);
995 /* Create a binding level for the eh_info and the exception object
997 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1002 /* Finish the handler-parameters for a handler, which may be given by
1003 HANDLER. DECL is the declaration for the catch parameter, or NULL
1004 if this is a `catch (...)' clause. */
1007 finish_handler_parms (tree decl, tree handler)
1009 tree type = NULL_TREE;
1010 if (processing_template_decl)
1014 decl = pushdecl (decl);
1015 decl = push_template_decl (decl);
1016 HANDLER_PARMS (handler) = decl;
1017 type = TREE_TYPE (decl);
1021 type = expand_start_catch_block (decl);
1023 HANDLER_TYPE (handler) = type;
1024 if (!processing_template_decl && type)
1025 mark_used (eh_type_info (type));
1028 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1029 the return value from the matching call to finish_handler_parms. */
1032 finish_handler (tree handler)
1034 if (!processing_template_decl)
1035 expand_end_catch_block ();
1036 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1039 /* Begin a compound statement. FLAGS contains some bits that control the
1040 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1041 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1042 block of a function. If BCS_TRY_BLOCK is set, this is the block
1043 created on behalf of a TRY statement. Returns a token to be passed to
1044 finish_compound_stmt. */
1047 begin_compound_stmt (unsigned int flags)
1051 if (flags & BCS_NO_SCOPE)
1053 r = push_stmt_list ();
1054 STATEMENT_LIST_NO_SCOPE (r) = 1;
1056 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1057 But, if it's a statement-expression with a scopeless block, there's
1058 nothing to keep, and we don't want to accidentally keep a block
1059 *inside* the scopeless block. */
1060 keep_next_level (false);
1063 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1065 /* When processing a template, we need to remember where the braces were,
1066 so that we can set up identical scopes when instantiating the template
1067 later. BIND_EXPR is a handy candidate for this.
1068 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1069 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1070 processing templates. */
1071 if (processing_template_decl)
1073 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1074 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1075 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1076 TREE_SIDE_EFFECTS (r) = 1;
1082 /* Finish a compound-statement, which is given by STMT. */
1085 finish_compound_stmt (tree stmt)
1087 if (TREE_CODE (stmt) == BIND_EXPR)
1088 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1089 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1090 stmt = pop_stmt_list (stmt);
1093 /* Destroy any ObjC "super" receivers that may have been
1095 objc_clear_super_receiver ();
1097 stmt = do_poplevel (stmt);
1100 /* ??? See c_end_compound_stmt wrt statement expressions. */
1105 /* Finish an asm-statement, whose components are a STRING, some
1106 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1107 whether the asm-statement should be considered volatile. */
1110 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1111 tree input_operands, tree clobbers)
1116 if (!processing_template_decl)
1122 for (t = input_operands; t; t = TREE_CHAIN (t))
1124 tree converted_operand
1125 = decay_conversion (TREE_VALUE (t));
1127 /* If the type of the operand hasn't been determined (e.g.,
1128 because it involves an overloaded function), then issue
1129 an error message. There's no context available to
1130 resolve the overloading. */
1131 if (TREE_TYPE (converted_operand) == unknown_type_node)
1133 error ("type of asm operand %qE could not be determined",
1135 converted_operand = error_mark_node;
1137 TREE_VALUE (t) = converted_operand;
1140 ninputs = list_length (input_operands);
1141 noutputs = list_length (output_operands);
1143 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1148 const char *constraint;
1151 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1152 operand = TREE_VALUE (t);
1154 if (!parse_output_constraint (&constraint,
1155 i, ninputs, noutputs,
1160 /* By marking this operand as erroneous, we will not try
1161 to process this operand again in expand_asm_operands. */
1162 TREE_VALUE (t) = error_mark_node;
1166 /* If the operand is a DECL that is going to end up in
1167 memory, assume it is addressable. This is a bit more
1168 conservative than it would ideally be; the exact test is
1169 buried deep in expand_asm_operands and depends on the
1170 DECL_RTL for the OPERAND -- which we don't have at this
1172 if (!allows_reg && DECL_P (operand))
1173 cxx_mark_addressable (operand);
1177 r = build_stmt (ASM_EXPR, string,
1178 output_operands, input_operands,
1180 ASM_VOLATILE_P (r) = volatile_p;
1181 r = maybe_cleanup_point_expr (r);
1182 return add_stmt (r);
1185 /* Finish a label with the indicated NAME. */
1188 finish_label_stmt (tree name)
1190 tree decl = define_label (input_location, name);
1191 return add_stmt (build_stmt (LABEL_EXPR, decl));
1194 /* Finish a series of declarations for local labels. G++ allows users
1195 to declare "local" labels, i.e., labels with scope. This extension
1196 is useful when writing code involving statement-expressions. */
1199 finish_label_decl (tree name)
1201 tree decl = declare_local_label (name);
1202 add_decl_expr (decl);
1205 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1208 finish_decl_cleanup (tree decl, tree cleanup)
1210 push_cleanup (decl, cleanup, false);
1213 /* If the current scope exits with an exception, run CLEANUP. */
1216 finish_eh_cleanup (tree cleanup)
1218 push_cleanup (NULL, cleanup, true);
1221 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1222 order they were written by the user. Each node is as for
1223 emit_mem_initializers. */
1226 finish_mem_initializers (tree mem_inits)
1228 /* Reorder the MEM_INITS so that they are in the order they appeared
1229 in the source program. */
1230 mem_inits = nreverse (mem_inits);
1232 if (processing_template_decl)
1233 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1235 emit_mem_initializers (mem_inits);
1238 /* Finish a parenthesized expression EXPR. */
1241 finish_parenthesized_expr (tree expr)
1244 /* This inhibits warnings in c_common_truthvalue_conversion. */
1245 TREE_NO_WARNING (expr) = 1;
1247 if (TREE_CODE (expr) == OFFSET_REF)
1248 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1249 enclosed in parentheses. */
1250 PTRMEM_OK_P (expr) = 0;
1254 /* Finish a reference to a non-static data member (DECL) that is not
1255 preceded by `.' or `->'. */
1258 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1260 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1264 if (current_function_decl
1265 && DECL_STATIC_FUNCTION_P (current_function_decl))
1266 cp_error_at ("invalid use of member %qD in static member function",
1269 cp_error_at ("invalid use of non-static data member %qD", decl);
1270 error ("from this location");
1272 return error_mark_node;
1274 TREE_USED (current_class_ptr) = 1;
1275 if (processing_template_decl && !qualifying_scope)
1277 tree type = TREE_TYPE (decl);
1279 if (TREE_CODE (type) == REFERENCE_TYPE)
1280 type = TREE_TYPE (type);
1283 /* Set the cv qualifiers. */
1284 int quals = cp_type_quals (TREE_TYPE (current_class_ref));
1286 if (DECL_MUTABLE_P (decl))
1287 quals &= ~TYPE_QUAL_CONST;
1289 quals |= cp_type_quals (TREE_TYPE (decl));
1290 type = cp_build_qualified_type (type, quals);
1293 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1297 tree access_type = TREE_TYPE (object);
1298 tree lookup_context = context_for_name_lookup (decl);
1300 while (!DERIVED_FROM_P (lookup_context, access_type))
1302 access_type = TYPE_CONTEXT (access_type);
1303 while (access_type && DECL_P (access_type))
1304 access_type = DECL_CONTEXT (access_type);
1308 cp_error_at ("object missing in reference to %qD", decl);
1309 error ("from this location");
1310 return error_mark_node;
1314 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1315 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1317 if (processing_template_decl)
1318 return build_min (SCOPE_REF, TREE_TYPE (decl),
1319 qualifying_scope, DECL_NAME (decl));
1321 perform_or_defer_access_check (TYPE_BINFO (access_type), decl);
1323 /* If the data member was named `C::M', convert `*this' to `C'
1325 if (qualifying_scope)
1327 tree binfo = NULL_TREE;
1328 object = build_scoped_ref (object, qualifying_scope,
1332 return build_class_member_access_expr (object, decl,
1333 /*access_path=*/NULL_TREE,
1334 /*preserve_reference=*/false);
1338 /* DECL was the declaration to which a qualified-id resolved. Issue
1339 an error message if it is not accessible. If OBJECT_TYPE is
1340 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1341 type of `*x', or `x', respectively. If the DECL was named as
1342 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1345 check_accessibility_of_qualified_id (tree decl,
1347 tree nested_name_specifier)
1350 tree qualifying_type = NULL_TREE;
1352 /* If we're not checking, return immediately. */
1353 if (deferred_access_no_check)
1356 /* Determine the SCOPE of DECL. */
1357 scope = context_for_name_lookup (decl);
1358 /* If the SCOPE is not a type, then DECL is not a member. */
1359 if (!TYPE_P (scope))
1361 /* Compute the scope through which DECL is being accessed. */
1363 /* OBJECT_TYPE might not be a class type; consider:
1365 class A { typedef int I; };
1369 In this case, we will have "A::I" as the DECL, but "I" as the
1371 && CLASS_TYPE_P (object_type)
1372 && DERIVED_FROM_P (scope, object_type))
1373 /* If we are processing a `->' or `.' expression, use the type of the
1375 qualifying_type = object_type;
1376 else if (nested_name_specifier)
1378 /* If the reference is to a non-static member of the
1379 current class, treat it as if it were referenced through
1381 if (DECL_NONSTATIC_MEMBER_P (decl)
1382 && current_class_ptr
1383 && DERIVED_FROM_P (scope, current_class_type))
1384 qualifying_type = current_class_type;
1385 /* Otherwise, use the type indicated by the
1386 nested-name-specifier. */
1388 qualifying_type = nested_name_specifier;
1391 /* Otherwise, the name must be from the current class or one of
1393 qualifying_type = currently_open_derived_class (scope);
1395 if (qualifying_type && IS_AGGR_TYPE_CODE (TREE_CODE (qualifying_type)))
1396 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1397 or similar in a default argument value. */
1398 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl);
1401 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1402 class named to the left of the "::" operator. DONE is true if this
1403 expression is a complete postfix-expression; it is false if this
1404 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1405 iff this expression is the operand of '&'. */
1408 finish_qualified_id_expr (tree qualifying_class, tree expr, bool done,
1411 if (error_operand_p (expr))
1412 return error_mark_node;
1414 /* If EXPR occurs as the operand of '&', use special handling that
1415 permits a pointer-to-member. */
1416 if (address_p && done)
1418 if (TREE_CODE (expr) == SCOPE_REF)
1419 expr = TREE_OPERAND (expr, 1);
1420 expr = build_offset_ref (qualifying_class, expr,
1421 /*address_p=*/true);
1425 if (TREE_CODE (expr) == FIELD_DECL)
1426 expr = finish_non_static_data_member (expr, current_class_ref,
1428 else if (BASELINK_P (expr) && !processing_template_decl)
1432 /* See if any of the functions are non-static members. */
1433 fns = BASELINK_FUNCTIONS (expr);
1434 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1435 fns = TREE_OPERAND (fns, 0);
1436 /* If so, the expression may be relative to the current
1438 if (!shared_member_p (fns)
1439 && current_class_type
1440 && DERIVED_FROM_P (qualifying_class, current_class_type))
1441 expr = (build_class_member_access_expr
1442 (maybe_dummy_object (qualifying_class, NULL),
1444 BASELINK_ACCESS_BINFO (expr),
1445 /*preserve_reference=*/false));
1447 /* The expression is a qualified name whose address is not
1449 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1455 /* Begin a statement-expression. The value returned must be passed to
1456 finish_stmt_expr. */
1459 begin_stmt_expr (void)
1461 return push_stmt_list ();
1464 /* Process the final expression of a statement expression. EXPR can be
1465 NULL, if the final expression is empty. Build up a TARGET_EXPR so
1466 that the result value can be safely returned to the enclosing
1470 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1472 tree result = NULL_TREE;
1476 if (!processing_template_decl && !VOID_TYPE_P (TREE_TYPE (expr)))
1478 tree type = TREE_TYPE (expr);
1480 if (TREE_CODE (type) == ARRAY_TYPE
1481 || TREE_CODE (type) == FUNCTION_TYPE)
1482 expr = decay_conversion (expr);
1484 expr = convert_from_reference (expr);
1485 expr = require_complete_type (expr);
1487 type = TREE_TYPE (expr);
1489 /* Build a TARGET_EXPR for this aggregate. finish_stmt_expr
1490 will then pull it apart so the lifetime of the target is
1491 within the scope of the expression containing this statement
1493 if (TREE_CODE (expr) == TARGET_EXPR)
1495 else if (!IS_AGGR_TYPE (type) || TYPE_HAS_TRIVIAL_INIT_REF (type))
1496 expr = build_target_expr_with_type (expr, type);
1499 /* Copy construct. */
1500 expr = build_special_member_call
1501 (NULL_TREE, complete_ctor_identifier,
1502 build_tree_list (NULL_TREE, expr),
1503 type, LOOKUP_NORMAL);
1504 expr = build_cplus_new (type, expr);
1505 gcc_assert (TREE_CODE (expr) == TARGET_EXPR);
1509 if (expr != error_mark_node)
1511 result = build_stmt (EXPR_STMT, expr);
1512 EXPR_STMT_STMT_EXPR_RESULT (result) = 1;
1519 /* Remember the last expression so that finish_stmt_expr
1520 can pull it apart. */
1521 TREE_TYPE (stmt_expr) = result;
1526 /* Finish a statement-expression. EXPR should be the value returned
1527 by the previous begin_stmt_expr. Returns an expression
1528 representing the statement-expression. */
1531 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1533 tree result, result_stmt, type;
1534 tree *result_stmt_p = NULL;
1536 result_stmt = TREE_TYPE (stmt_expr);
1537 TREE_TYPE (stmt_expr) = void_type_node;
1538 result = pop_stmt_list (stmt_expr);
1540 if (!result_stmt || VOID_TYPE_P (result_stmt))
1541 type = void_type_node;
1544 /* We need to search the statement expression for the result_stmt,
1545 since we'll need to replace it entirely. */
1547 result_stmt_p = &result;
1551 if (t == result_stmt)
1554 switch (TREE_CODE (t))
1556 case STATEMENT_LIST:
1558 tree_stmt_iterator i = tsi_last (t);
1559 result_stmt_p = tsi_stmt_ptr (i);
1563 result_stmt_p = &BIND_EXPR_BODY (t);
1565 case TRY_FINALLY_EXPR:
1566 case TRY_CATCH_EXPR:
1568 result_stmt_p = &TREE_OPERAND (t, 0);
1574 type = TREE_TYPE (EXPR_STMT_EXPR (result_stmt));
1577 if (processing_template_decl)
1579 result = build_min (STMT_EXPR, type, result);
1580 TREE_SIDE_EFFECTS (result) = 1;
1581 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1583 else if (!VOID_TYPE_P (type))
1585 /* Pull out the TARGET_EXPR that is the final expression. Put
1586 the target's init_expr as the final expression and then put
1587 the statement expression itself as the target's init
1588 expr. Finally, return the target expression. */
1589 tree init, target_expr = EXPR_STMT_EXPR (result_stmt);
1590 gcc_assert (TREE_CODE (target_expr) == TARGET_EXPR);
1592 /* The initializer will be void if the initialization is done by
1593 AGGR_INIT_EXPR; propagate that out to the statement-expression as
1595 init = TREE_OPERAND (target_expr, 1);
1596 type = TREE_TYPE (init);
1598 init = maybe_cleanup_point_expr (init);
1599 *result_stmt_p = init;
1601 if (VOID_TYPE_P (type))
1602 /* No frobbing needed. */;
1603 else if (TREE_CODE (result) == BIND_EXPR)
1605 /* The BIND_EXPR created in finish_compound_stmt is void; if we're
1606 returning a value directly, give it the appropriate type. */
1607 if (VOID_TYPE_P (TREE_TYPE (result)))
1608 TREE_TYPE (result) = type;
1610 gcc_assert (same_type_p (TREE_TYPE (result), type));
1612 else if (TREE_CODE (result) == STATEMENT_LIST)
1613 /* We need to wrap a STATEMENT_LIST in a BIND_EXPR so it can have a
1614 type other than void. FIXME why can't we just return a value
1615 from STATEMENT_LIST? */
1616 result = build3 (BIND_EXPR, type, NULL, result, NULL);
1618 TREE_OPERAND (target_expr, 1) = result;
1619 result = target_expr;
1625 /* Perform Koenig lookup. FN is the postfix-expression representing
1626 the function (or functions) to call; ARGS are the arguments to the
1627 call. Returns the functions to be considered by overload
1631 perform_koenig_lookup (tree fn, tree args)
1633 tree identifier = NULL_TREE;
1634 tree functions = NULL_TREE;
1636 /* Find the name of the overloaded function. */
1637 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1639 else if (is_overloaded_fn (fn))
1642 identifier = DECL_NAME (get_first_fn (functions));
1644 else if (DECL_P (fn))
1647 identifier = DECL_NAME (fn);
1650 /* A call to a namespace-scope function using an unqualified name.
1652 Do Koenig lookup -- unless any of the arguments are
1654 if (!any_type_dependent_arguments_p (args))
1656 fn = lookup_arg_dependent (identifier, functions, args);
1658 /* The unqualified name could not be resolved. */
1659 fn = unqualified_fn_lookup_error (identifier);
1667 /* Generate an expression for `FN (ARGS)'.
1669 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1670 as a virtual call, even if FN is virtual. (This flag is set when
1671 encountering an expression where the function name is explicitly
1672 qualified. For example a call to `X::f' never generates a virtual
1675 Returns code for the call. */
1678 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p)
1684 if (fn == error_mark_node || args == error_mark_node)
1685 return error_mark_node;
1687 /* ARGS should be a list of arguments. */
1688 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1693 if (processing_template_decl)
1695 if (type_dependent_expression_p (fn)
1696 || any_type_dependent_arguments_p (args))
1698 result = build_nt (CALL_EXPR, fn, args, NULL_TREE);
1699 KOENIG_LOOKUP_P (result) = koenig_p;
1702 if (!BASELINK_P (fn)
1703 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1704 && TREE_TYPE (fn) != unknown_type_node)
1705 fn = build_non_dependent_expr (fn);
1706 args = build_non_dependent_args (orig_args);
1709 /* A reference to a member function will appear as an overloaded
1710 function (rather than a BASELINK) if an unqualified name was used
1712 if (!BASELINK_P (fn) && is_overloaded_fn (fn))
1716 if (TREE_CODE (f) == TEMPLATE_ID_EXPR)
1717 f = TREE_OPERAND (f, 0);
1718 f = get_first_fn (f);
1719 if (DECL_FUNCTION_MEMBER_P (f))
1721 tree type = currently_open_derived_class (DECL_CONTEXT (f));
1723 type = DECL_CONTEXT (f);
1724 fn = build_baselink (TYPE_BINFO (type),
1726 fn, /*optype=*/NULL_TREE);
1731 if (BASELINK_P (fn))
1735 /* A call to a member function. From [over.call.func]:
1737 If the keyword this is in scope and refers to the class of
1738 that member function, or a derived class thereof, then the
1739 function call is transformed into a qualified function call
1740 using (*this) as the postfix-expression to the left of the
1741 . operator.... [Otherwise] a contrived object of type T
1742 becomes the implied object argument.
1744 This paragraph is unclear about this situation:
1746 struct A { void f(); };
1747 struct B : public A {};
1748 struct C : public A { void g() { B::f(); }};
1750 In particular, for `B::f', this paragraph does not make clear
1751 whether "the class of that member function" refers to `A' or
1752 to `B'. We believe it refers to `B'. */
1753 if (current_class_type
1754 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1756 && current_class_ref)
1757 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1761 tree representative_fn;
1763 representative_fn = BASELINK_FUNCTIONS (fn);
1764 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1765 representative_fn = TREE_OPERAND (representative_fn, 0);
1766 representative_fn = get_first_fn (representative_fn);
1767 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1770 if (processing_template_decl)
1772 if (type_dependent_expression_p (object))
1773 return build_nt (CALL_EXPR, orig_fn, orig_args, NULL_TREE);
1774 object = build_non_dependent_expr (object);
1777 result = build_new_method_call (object, fn, args, NULL_TREE,
1779 ? LOOKUP_NONVIRTUAL : 0));
1781 else if (is_overloaded_fn (fn))
1782 /* A call to a namespace-scope function. */
1783 result = build_new_function_call (fn, args);
1784 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1787 error ("arguments to destructor are not allowed");
1788 /* Mark the pseudo-destructor call as having side-effects so
1789 that we do not issue warnings about its use. */
1790 result = build1 (NOP_EXPR,
1792 TREE_OPERAND (fn, 0));
1793 TREE_SIDE_EFFECTS (result) = 1;
1795 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1796 /* If the "function" is really an object of class type, it might
1797 have an overloaded `operator ()'. */
1798 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1799 /*overloaded_p=*/NULL);
1801 /* A call where the function is unknown. */
1802 result = build_function_call (fn, args);
1804 if (processing_template_decl)
1806 result = build3 (CALL_EXPR, TREE_TYPE (result), orig_fn,
1807 orig_args, NULL_TREE);
1808 KOENIG_LOOKUP_P (result) = koenig_p;
1813 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1814 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1815 POSTDECREMENT_EXPR.) */
1818 finish_increment_expr (tree expr, enum tree_code code)
1820 return build_x_unary_op (code, expr);
1823 /* Finish a use of `this'. Returns an expression for `this'. */
1826 finish_this_expr (void)
1830 if (current_class_ptr)
1832 result = current_class_ptr;
1834 else if (current_function_decl
1835 && DECL_STATIC_FUNCTION_P (current_function_decl))
1837 error ("`this' is unavailable for static member functions");
1838 result = error_mark_node;
1842 if (current_function_decl)
1843 error ("invalid use of `this' in non-member function");
1845 error ("invalid use of `this' at top level");
1846 result = error_mark_node;
1852 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
1853 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
1854 the TYPE for the type given. If SCOPE is non-NULL, the expression
1855 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
1858 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
1860 if (destructor == error_mark_node)
1861 return error_mark_node;
1863 gcc_assert (TYPE_P (destructor));
1865 if (!processing_template_decl)
1867 if (scope == error_mark_node)
1869 error ("invalid qualifying scope in pseudo-destructor name");
1870 return error_mark_node;
1873 /* [expr.pseudo] says both:
1875 The type designated by the pseudo-destructor-name shall be
1876 the same as the object type.
1880 The cv-unqualified versions of the object type and of the
1881 type designated by the pseudo-destructor-name shall be the
1884 We implement the more generous second sentence, since that is
1885 what most other compilers do. */
1886 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
1889 error ("%qE is not of type %qT", object, destructor);
1890 return error_mark_node;
1894 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
1897 /* Finish an expression of the form CODE EXPR. */
1900 finish_unary_op_expr (enum tree_code code, tree expr)
1902 tree result = build_x_unary_op (code, expr);
1903 /* Inside a template, build_x_unary_op does not fold the
1904 expression. So check whether the result is folded before
1905 setting TREE_NEGATED_INT. */
1906 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
1907 && TREE_CODE (result) == INTEGER_CST
1908 && !TYPE_UNSIGNED (TREE_TYPE (result))
1909 && INT_CST_LT (result, integer_zero_node))
1910 TREE_NEGATED_INT (result) = 1;
1911 overflow_warning (result);
1915 /* Finish a compound-literal expression. TYPE is the type to which
1916 the INITIALIZER_LIST is being cast. */
1919 finish_compound_literal (tree type, tree initializer_list)
1921 tree compound_literal;
1923 /* Build a CONSTRUCTOR for the INITIALIZER_LIST. */
1924 compound_literal = build_constructor (NULL_TREE, initializer_list);
1925 /* Mark it as a compound-literal. */
1926 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
1927 if (processing_template_decl)
1928 TREE_TYPE (compound_literal) = type;
1931 /* Check the initialization. */
1932 compound_literal = digest_init (type, compound_literal, NULL);
1933 /* If the TYPE was an array type with an unknown bound, then we can
1934 figure out the dimension now. For example, something like:
1938 implies that the array has two elements. */
1939 if (TREE_CODE (type) == ARRAY_TYPE && !COMPLETE_TYPE_P (type))
1940 complete_array_type (type, compound_literal, 1);
1943 return compound_literal;
1946 /* Return the declaration for the function-name variable indicated by
1950 finish_fname (tree id)
1954 decl = fname_decl (C_RID_CODE (id), id);
1955 if (processing_template_decl)
1956 decl = DECL_NAME (decl);
1960 /* Finish a translation unit. */
1963 finish_translation_unit (void)
1965 /* In case there were missing closebraces,
1966 get us back to the global binding level. */
1968 while (current_namespace != global_namespace)
1971 /* Do file scope __FUNCTION__ et al. */
1972 finish_fname_decls ();
1975 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
1976 Returns the parameter. */
1979 finish_template_type_parm (tree aggr, tree identifier)
1981 if (aggr != class_type_node)
1983 pedwarn ("template type parameters must use the keyword `class' or `typename'");
1984 aggr = class_type_node;
1987 return build_tree_list (aggr, identifier);
1990 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
1991 Returns the parameter. */
1994 finish_template_template_parm (tree aggr, tree identifier)
1996 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
1997 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
1998 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
1999 DECL_TEMPLATE_RESULT (tmpl) = decl;
2000 DECL_ARTIFICIAL (decl) = 1;
2001 end_template_decl ();
2003 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2005 return finish_template_type_parm (aggr, tmpl);
2008 /* ARGUMENT is the default-argument value for a template template
2009 parameter. If ARGUMENT is invalid, issue error messages and return
2010 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2013 check_template_template_default_arg (tree argument)
2015 if (TREE_CODE (argument) != TEMPLATE_DECL
2016 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2017 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2019 if (TREE_CODE (argument) == TYPE_DECL)
2021 tree t = TREE_TYPE (argument);
2023 /* Try to emit a slightly smarter error message if we detect
2024 that the user is using a template instantiation. */
2025 if (CLASSTYPE_TEMPLATE_INFO (t)
2026 && CLASSTYPE_TEMPLATE_INSTANTIATION (t))
2027 error ("invalid use of type %qT as a default value for a "
2028 "template template-parameter", t);
2030 error ("invalid use of %qD as a default value for a template "
2031 "template-parameter", argument);
2034 error ("invalid default argument for a template template parameter");
2035 return error_mark_node;
2041 /* Begin a class definition, as indicated by T. */
2044 begin_class_definition (tree t)
2046 if (t == error_mark_node)
2047 return error_mark_node;
2049 if (processing_template_parmlist)
2051 error ("definition of %q#T inside template parameter list", t);
2052 return error_mark_node;
2054 /* A non-implicit typename comes from code like:
2056 template <typename T> struct A {
2057 template <typename U> struct A<T>::B ...
2059 This is erroneous. */
2060 else if (TREE_CODE (t) == TYPENAME_TYPE)
2062 error ("invalid definition of qualified type %qT", t);
2063 t = error_mark_node;
2066 if (t == error_mark_node || ! IS_AGGR_TYPE (t))
2068 t = make_aggr_type (RECORD_TYPE);
2069 pushtag (make_anon_name (), t, 0);
2072 /* If this type was already complete, and we see another definition,
2074 if (COMPLETE_TYPE_P (t))
2076 error ("redefinition of %q#T", t);
2077 cp_error_at ("previous definition of %q#T", t);
2078 return error_mark_node;
2081 /* Update the location of the decl. */
2082 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2084 if (TYPE_BEING_DEFINED (t))
2086 t = make_aggr_type (TREE_CODE (t));
2087 pushtag (TYPE_IDENTIFIER (t), t, 0);
2089 maybe_process_partial_specialization (t);
2091 TYPE_BEING_DEFINED (t) = 1;
2092 if (flag_pack_struct)
2095 TYPE_PACKED (t) = 1;
2096 /* Even though the type is being defined for the first time
2097 here, there might have been a forward declaration, so there
2098 might be cv-qualified variants of T. */
2099 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2100 TYPE_PACKED (v) = 1;
2102 /* Reset the interface data, at the earliest possible
2103 moment, as it might have been set via a class foo;
2105 if (! TYPE_ANONYMOUS_P (t))
2107 struct c_fileinfo *finfo = get_fileinfo (lbasename (input_filename));
2108 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2109 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2110 (t, finfo->interface_unknown);
2112 reset_specialization();
2114 /* Make a declaration for this class in its own scope. */
2115 build_self_reference ();
2120 /* Finish the member declaration given by DECL. */
2123 finish_member_declaration (tree decl)
2125 if (decl == error_mark_node || decl == NULL_TREE)
2128 if (decl == void_type_node)
2129 /* The COMPONENT was a friend, not a member, and so there's
2130 nothing for us to do. */
2133 /* We should see only one DECL at a time. */
2134 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2136 /* Set up access control for DECL. */
2138 = (current_access_specifier == access_private_node);
2139 TREE_PROTECTED (decl)
2140 = (current_access_specifier == access_protected_node);
2141 if (TREE_CODE (decl) == TEMPLATE_DECL)
2143 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2144 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2147 /* Mark the DECL as a member of the current class. */
2148 DECL_CONTEXT (decl) = current_class_type;
2152 A C language linkage is ignored for the names of class members
2153 and the member function type of class member functions. */
2154 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2155 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2157 /* Put functions on the TYPE_METHODS list and everything else on the
2158 TYPE_FIELDS list. Note that these are built up in reverse order.
2159 We reverse them (to obtain declaration order) in finish_struct. */
2160 if (TREE_CODE (decl) == FUNCTION_DECL
2161 || DECL_FUNCTION_TEMPLATE_P (decl))
2163 /* We also need to add this function to the
2164 CLASSTYPE_METHOD_VEC. */
2165 add_method (current_class_type, decl);
2167 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2168 TYPE_METHODS (current_class_type) = decl;
2170 maybe_add_class_template_decl_list (current_class_type, decl,
2173 /* Enter the DECL into the scope of the class. */
2174 else if ((TREE_CODE (decl) == USING_DECL && TREE_TYPE (decl))
2175 || pushdecl_class_level (decl))
2177 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2178 go at the beginning. The reason is that lookup_field_1
2179 searches the list in order, and we want a field name to
2180 override a type name so that the "struct stat hack" will
2181 work. In particular:
2183 struct S { enum E { }; int E } s;
2186 is valid. In addition, the FIELD_DECLs must be maintained in
2187 declaration order so that class layout works as expected.
2188 However, we don't need that order until class layout, so we
2189 save a little time by putting FIELD_DECLs on in reverse order
2190 here, and then reversing them in finish_struct_1. (We could
2191 also keep a pointer to the correct insertion points in the
2194 if (TREE_CODE (decl) == TYPE_DECL)
2195 TYPE_FIELDS (current_class_type)
2196 = chainon (TYPE_FIELDS (current_class_type), decl);
2199 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2200 TYPE_FIELDS (current_class_type) = decl;
2203 maybe_add_class_template_decl_list (current_class_type, decl,
2208 /* Finish processing a complete template declaration. The PARMS are
2209 the template parameters. */
2212 finish_template_decl (tree parms)
2215 end_template_decl ();
2217 end_specialization ();
2220 /* Finish processing a template-id (which names a type) of the form
2221 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2222 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2223 the scope of template-id indicated. */
2226 finish_template_type (tree name, tree args, int entering_scope)
2230 decl = lookup_template_class (name, args,
2231 NULL_TREE, NULL_TREE, entering_scope,
2232 tf_error | tf_warning | tf_user);
2233 if (decl != error_mark_node)
2234 decl = TYPE_STUB_DECL (decl);
2239 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2240 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2241 BASE_CLASS, or NULL_TREE if an error occurred. The
2242 ACCESS_SPECIFIER is one of
2243 access_{default,public,protected_private}_node. For a virtual base
2244 we set TREE_TYPE. */
2247 finish_base_specifier (tree base, tree access, bool virtual_p)
2251 if (base == error_mark_node)
2253 error ("invalid base-class specification");
2256 else if (! is_aggr_type (base, 1))
2260 if (cp_type_quals (base) != 0)
2262 error ("base class %qT has cv qualifiers", base);
2263 base = TYPE_MAIN_VARIANT (base);
2265 result = build_tree_list (access, base);
2267 TREE_TYPE (result) = integer_type_node;
2273 /* Called when multiple declarators are processed. If that is not
2274 permitted in this context, an error is issued. */
2277 check_multiple_declarators (void)
2281 In a template-declaration, explicit specialization, or explicit
2282 instantiation the init-declarator-list in the declaration shall
2283 contain at most one declarator.
2285 We don't just use PROCESSING_TEMPLATE_DECL for the first
2286 condition since that would disallow the perfectly valid code,
2287 like `template <class T> struct S { int i, j; };'. */
2288 if (at_function_scope_p ())
2289 /* It's OK to write `template <class T> void f() { int i, j;}'. */
2292 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
2293 || processing_explicit_instantiation
2294 || processing_specialization)
2295 error ("multiple declarators in template declaration");
2298 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2299 what we found when we tried to do the lookup. */
2302 qualified_name_lookup_error (tree scope, tree name, tree decl)
2306 if (!COMPLETE_TYPE_P (scope))
2307 error ("incomplete type %qT used in nested name specifier", scope);
2308 else if (TREE_CODE (decl) == TREE_LIST)
2310 error ("reference to %<%T::%D%> is ambiguous", scope, name);
2311 print_candidates (decl);
2314 error ("%qD is not a member of %qT", name, scope);
2316 else if (scope != global_namespace)
2317 error ("%qD is not a member of %qD", name, scope);
2319 error ("%<::%D%> has not been declared", name);
2322 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2323 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2324 if non-NULL, is the type or namespace used to explicitly qualify
2325 ID_EXPRESSION. DECL is the entity to which that name has been
2328 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2329 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2330 be set to true if this expression isn't permitted in a
2331 constant-expression, but it is otherwise not set by this function.
2332 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2333 constant-expression, but a non-constant expression is also
2336 If an error occurs, and it is the kind of error that might cause
2337 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2338 is the caller's responsibility to issue the message. *ERROR_MSG
2339 will be a string with static storage duration, so the caller need
2342 Return an expression for the entity, after issuing appropriate
2343 diagnostics. This function is also responsible for transforming a
2344 reference to a non-static member into a COMPONENT_REF that makes
2345 the use of "this" explicit.
2347 Upon return, *IDK will be filled in appropriately. */
2350 finish_id_expression (tree id_expression,
2354 tree *qualifying_class,
2355 bool integral_constant_expression_p,
2356 bool allow_non_integral_constant_expression_p,
2357 bool *non_integral_constant_expression_p,
2358 const char **error_msg)
2360 /* Initialize the output parameters. */
2361 *idk = CP_ID_KIND_NONE;
2364 if (id_expression == error_mark_node)
2365 return error_mark_node;
2366 /* If we have a template-id, then no further lookup is
2367 required. If the template-id was for a template-class, we
2368 will sometimes have a TYPE_DECL at this point. */
2369 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2370 || TREE_CODE (decl) == TYPE_DECL)
2372 /* Look up the name. */
2375 if (decl == error_mark_node)
2377 /* Name lookup failed. */
2380 || (!dependent_type_p (scope)
2381 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2382 && IDENTIFIER_TYPENAME_P (id_expression)
2383 && dependent_type_p (TREE_TYPE (id_expression))))))
2385 /* If the qualifying type is non-dependent (and the name
2386 does not name a conversion operator to a dependent
2387 type), issue an error. */
2388 qualified_name_lookup_error (scope, id_expression, decl);
2389 return error_mark_node;
2393 /* It may be resolved via Koenig lookup. */
2394 *idk = CP_ID_KIND_UNQUALIFIED;
2395 return id_expression;
2398 decl = id_expression;
2400 /* If DECL is a variable that would be out of scope under
2401 ANSI/ISO rules, but in scope in the ARM, name lookup
2402 will succeed. Issue a diagnostic here. */
2404 decl = check_for_out_of_scope_variable (decl);
2406 /* Remember that the name was used in the definition of
2407 the current class so that we can check later to see if
2408 the meaning would have been different after the class
2409 was entirely defined. */
2410 if (!scope && decl != error_mark_node)
2411 maybe_note_name_used_in_class (id_expression, decl);
2414 /* If we didn't find anything, or what we found was a type,
2415 then this wasn't really an id-expression. */
2416 if (TREE_CODE (decl) == TEMPLATE_DECL
2417 && !DECL_FUNCTION_TEMPLATE_P (decl))
2419 *error_msg = "missing template arguments";
2420 return error_mark_node;
2422 else if (TREE_CODE (decl) == TYPE_DECL
2423 || TREE_CODE (decl) == NAMESPACE_DECL)
2425 *error_msg = "expected primary-expression";
2426 return error_mark_node;
2429 /* If the name resolved to a template parameter, there is no
2430 need to look it up again later. */
2431 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2432 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2434 *idk = CP_ID_KIND_NONE;
2435 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2436 decl = TEMPLATE_PARM_DECL (decl);
2437 if (integral_constant_expression_p
2438 && !dependent_type_p (TREE_TYPE (decl))
2439 && !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (decl)))
2441 if (!allow_non_integral_constant_expression_p)
2442 error ("template parameter %qD of type %qT is not allowed in "
2443 "an integral constant expression because it is not of "
2444 "integral or enumeration type", decl, TREE_TYPE (decl));
2445 *non_integral_constant_expression_p = true;
2447 return DECL_INITIAL (decl);
2449 /* Similarly, we resolve enumeration constants to their
2450 underlying values. */
2451 else if (TREE_CODE (decl) == CONST_DECL)
2453 *idk = CP_ID_KIND_NONE;
2454 if (!processing_template_decl)
2455 return DECL_INITIAL (decl);
2462 /* If the declaration was explicitly qualified indicate
2463 that. The semantics of `A::f(3)' are different than
2464 `f(3)' if `f' is virtual. */
2466 ? CP_ID_KIND_QUALIFIED
2467 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2468 ? CP_ID_KIND_TEMPLATE_ID
2469 : CP_ID_KIND_UNQUALIFIED));
2474 An id-expression is type-dependent if it contains an
2475 identifier that was declared with a dependent type.
2477 The standard is not very specific about an id-expression that
2478 names a set of overloaded functions. What if some of them
2479 have dependent types and some of them do not? Presumably,
2480 such a name should be treated as a dependent name. */
2481 /* Assume the name is not dependent. */
2482 dependent_p = false;
2483 if (!processing_template_decl)
2484 /* No names are dependent outside a template. */
2486 /* A template-id where the name of the template was not resolved
2487 is definitely dependent. */
2488 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2489 && (TREE_CODE (TREE_OPERAND (decl, 0))
2490 == IDENTIFIER_NODE))
2492 /* For anything except an overloaded function, just check its
2494 else if (!is_overloaded_fn (decl))
2496 = dependent_type_p (TREE_TYPE (decl));
2497 /* For a set of overloaded functions, check each of the
2503 if (BASELINK_P (fns))
2504 fns = BASELINK_FUNCTIONS (fns);
2506 /* For a template-id, check to see if the template
2507 arguments are dependent. */
2508 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2510 tree args = TREE_OPERAND (fns, 1);
2511 dependent_p = any_dependent_template_arguments_p (args);
2512 /* The functions are those referred to by the
2514 fns = TREE_OPERAND (fns, 0);
2517 /* If there are no dependent template arguments, go through
2518 the overloaded functions. */
2519 while (fns && !dependent_p)
2521 tree fn = OVL_CURRENT (fns);
2523 /* Member functions of dependent classes are
2525 if (TREE_CODE (fn) == FUNCTION_DECL
2526 && type_dependent_expression_p (fn))
2528 else if (TREE_CODE (fn) == TEMPLATE_DECL
2529 && dependent_template_p (fn))
2532 fns = OVL_NEXT (fns);
2536 /* If the name was dependent on a template parameter, we will
2537 resolve the name at instantiation time. */
2540 /* Create a SCOPE_REF for qualified names, if the scope is
2545 *qualifying_class = scope;
2546 /* Since this name was dependent, the expression isn't
2547 constant -- yet. No error is issued because it might
2548 be constant when things are instantiated. */
2549 if (integral_constant_expression_p)
2550 *non_integral_constant_expression_p = true;
2551 if (TYPE_P (scope) && dependent_type_p (scope))
2552 return build_nt (SCOPE_REF, scope, id_expression);
2553 else if (TYPE_P (scope) && DECL_P (decl))
2554 return build2 (SCOPE_REF, TREE_TYPE (decl), scope,
2559 /* A TEMPLATE_ID already contains all the information we
2561 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2562 return id_expression;
2563 /* Since this name was dependent, the expression isn't
2564 constant -- yet. No error is issued because it might be
2565 constant when things are instantiated. */
2566 if (integral_constant_expression_p)
2567 *non_integral_constant_expression_p = true;
2568 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2569 /* If we found a variable, then name lookup during the
2570 instantiation will always resolve to the same VAR_DECL
2571 (or an instantiation thereof). */
2572 if (TREE_CODE (decl) == VAR_DECL
2573 || TREE_CODE (decl) == PARM_DECL)
2575 return id_expression;
2578 /* Only certain kinds of names are allowed in constant
2579 expression. Enumerators and template parameters
2580 have already been handled above. */
2581 if (integral_constant_expression_p
2582 && !DECL_INTEGRAL_CONSTANT_VAR_P (decl))
2584 if (!allow_non_integral_constant_expression_p)
2586 error ("%qD cannot appear in a constant-expression", decl);
2587 return error_mark_node;
2589 *non_integral_constant_expression_p = true;
2592 if (TREE_CODE (decl) == NAMESPACE_DECL)
2594 error ("use of namespace %qD as expression", decl);
2595 return error_mark_node;
2597 else if (DECL_CLASS_TEMPLATE_P (decl))
2599 error ("use of class template %qT as expression", decl);
2600 return error_mark_node;
2602 else if (TREE_CODE (decl) == TREE_LIST)
2604 /* Ambiguous reference to base members. */
2605 error ("request for member %qD is ambiguous in "
2606 "multiple inheritance lattice", id_expression);
2607 print_candidates (decl);
2608 return error_mark_node;
2611 /* Mark variable-like entities as used. Functions are similarly
2612 marked either below or after overload resolution. */
2613 if (TREE_CODE (decl) == VAR_DECL
2614 || TREE_CODE (decl) == PARM_DECL
2615 || TREE_CODE (decl) == RESULT_DECL)
2620 decl = (adjust_result_of_qualified_name_lookup
2621 (decl, scope, current_class_type));
2623 if (TREE_CODE (decl) == FUNCTION_DECL)
2626 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2627 *qualifying_class = scope;
2628 else if (!processing_template_decl)
2629 decl = convert_from_reference (decl);
2630 else if (TYPE_P (scope))
2631 decl = build2 (SCOPE_REF, TREE_TYPE (decl), scope, decl);
2633 else if (TREE_CODE (decl) == FIELD_DECL)
2634 decl = finish_non_static_data_member (decl, current_class_ref,
2635 /*qualifying_scope=*/NULL_TREE);
2636 else if (is_overloaded_fn (decl))
2638 tree first_fn = OVL_CURRENT (decl);
2640 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2641 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2643 if (!really_overloaded_fn (decl))
2644 mark_used (first_fn);
2646 if (TREE_CODE (first_fn) == FUNCTION_DECL
2647 && DECL_FUNCTION_MEMBER_P (first_fn)
2648 && !shared_member_p (decl))
2650 /* A set of member functions. */
2651 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
2652 return finish_class_member_access_expr (decl, id_expression);
2657 if (TREE_CODE (decl) == VAR_DECL
2658 || TREE_CODE (decl) == PARM_DECL
2659 || TREE_CODE (decl) == RESULT_DECL)
2661 tree context = decl_function_context (decl);
2663 if (context != NULL_TREE && context != current_function_decl
2664 && ! TREE_STATIC (decl))
2666 error ("use of %s from containing function",
2667 (TREE_CODE (decl) == VAR_DECL
2668 ? "%<auto%> variable" : "parameter"));
2669 cp_error_at (" %q#D declared here", decl);
2670 return error_mark_node;
2674 if (DECL_P (decl) && DECL_NONLOCAL (decl)
2675 && DECL_CLASS_SCOPE_P (decl)
2676 && DECL_CONTEXT (decl) != current_class_type)
2680 path = currently_open_derived_class (DECL_CONTEXT (decl));
2681 perform_or_defer_access_check (TYPE_BINFO (path), decl);
2684 if (! processing_template_decl)
2685 decl = convert_from_reference (decl);
2688 /* Resolve references to variables of anonymous unions
2689 into COMPONENT_REFs. */
2690 if (TREE_CODE (decl) == ALIAS_DECL)
2691 decl = unshare_expr (DECL_INITIAL (decl));
2694 if (TREE_DEPRECATED (decl))
2695 warn_deprecated_use (decl);
2700 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
2701 use as a type-specifier. */
2704 finish_typeof (tree expr)
2708 if (type_dependent_expression_p (expr))
2710 type = make_aggr_type (TYPEOF_TYPE);
2711 TYPEOF_TYPE_EXPR (type) = expr;
2716 type = TREE_TYPE (expr);
2718 if (!type || type == unknown_type_node)
2720 error ("type of %qE is unknown", expr);
2721 return error_mark_node;
2727 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
2728 with equivalent CALL_EXPRs. */
2731 simplify_aggr_init_exprs_r (tree* tp,
2733 void* data ATTRIBUTE_UNUSED)
2735 /* We don't need to walk into types; there's nothing in a type that
2736 needs simplification. (And, furthermore, there are places we
2737 actively don't want to go. For example, we don't want to wander
2738 into the default arguments for a FUNCTION_DECL that appears in a
2745 /* Only AGGR_INIT_EXPRs are interesting. */
2746 else if (TREE_CODE (*tp) != AGGR_INIT_EXPR)
2749 simplify_aggr_init_expr (tp);
2751 /* Keep iterating. */
2755 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
2756 function is broken out from the above for the benefit of the tree-ssa
2760 simplify_aggr_init_expr (tree *tp)
2762 tree aggr_init_expr = *tp;
2764 /* Form an appropriate CALL_EXPR. */
2765 tree fn = TREE_OPERAND (aggr_init_expr, 0);
2766 tree args = TREE_OPERAND (aggr_init_expr, 1);
2767 tree slot = TREE_OPERAND (aggr_init_expr, 2);
2768 tree type = TREE_TYPE (slot);
2771 enum style_t { ctor, arg, pcc } style;
2773 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
2775 #ifdef PCC_STATIC_STRUCT_RETURN
2781 gcc_assert (TREE_ADDRESSABLE (type));
2785 if (style == ctor || style == arg)
2787 /* Pass the address of the slot. If this is a constructor, we
2788 replace the first argument; otherwise, we tack on a new one. */
2792 args = TREE_CHAIN (args);
2794 cxx_mark_addressable (slot);
2795 addr = build1 (ADDR_EXPR, build_pointer_type (type), slot);
2798 /* The return type might have different cv-quals from the slot. */
2799 tree fntype = TREE_TYPE (TREE_TYPE (fn));
2801 gcc_assert (TREE_CODE (fntype) == FUNCTION_TYPE
2802 || TREE_CODE (fntype) == METHOD_TYPE);
2803 addr = convert (build_pointer_type (TREE_TYPE (fntype)), addr);
2806 args = tree_cons (NULL_TREE, addr, args);
2809 call_expr = build3 (CALL_EXPR,
2810 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
2811 fn, args, NULL_TREE);
2814 /* Tell the backend that we've added our return slot to the argument
2816 CALL_EXPR_HAS_RETURN_SLOT_ADDR (call_expr) = 1;
2817 else if (style == pcc)
2819 /* If we're using the non-reentrant PCC calling convention, then we
2820 need to copy the returned value out of the static buffer into the
2822 push_deferring_access_checks (dk_no_check);
2823 call_expr = build_aggr_init (slot, call_expr,
2824 DIRECT_BIND | LOOKUP_ONLYCONVERTING);
2825 pop_deferring_access_checks ();
2831 /* Emit all thunks to FN that should be emitted when FN is emitted. */
2834 emit_associated_thunks (tree fn)
2836 /* When we use vcall offsets, we emit thunks with the virtual
2837 functions to which they thunk. The whole point of vcall offsets
2838 is so that you can know statically the entire set of thunks that
2839 will ever be needed for a given virtual function, thereby
2840 enabling you to output all the thunks with the function itself. */
2841 if (DECL_VIRTUAL_P (fn))
2845 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
2847 if (!THUNK_ALIAS (thunk))
2849 use_thunk (thunk, /*emit_p=*/1);
2850 if (DECL_RESULT_THUNK_P (thunk))
2854 for (probe = DECL_THUNKS (thunk);
2855 probe; probe = TREE_CHAIN (probe))
2856 use_thunk (probe, /*emit_p=*/1);
2860 gcc_assert (!DECL_THUNKS (thunk));
2865 /* Generate RTL for FN. */
2868 expand_body (tree fn)
2870 tree saved_function;
2872 /* Compute the appropriate object-file linkage for inline
2874 if (DECL_DECLARED_INLINE_P (fn))
2875 import_export_decl (fn);
2877 /* If FN is external, then there's no point in generating RTL for
2878 it. This situation can arise with an inline function under
2879 `-fexternal-templates'; we instantiate the function, even though
2880 we're not planning on emitting it, in case we get a chance to
2882 if (DECL_EXTERNAL (fn))
2885 /* ??? When is this needed? */
2886 saved_function = current_function_decl;
2888 /* Emit any thunks that should be emitted at the same time as FN. */
2889 emit_associated_thunks (fn);
2891 /* This function is only called from cgraph, or recursively from
2892 emit_associated_thunks. In neither case should we be currently
2893 generating trees for a function. */
2894 gcc_assert (function_depth == 0);
2896 tree_rest_of_compilation (fn);
2898 current_function_decl = saved_function;
2900 if (DECL_CLONED_FUNCTION_P (fn))
2902 /* If this is a clone, go through the other clones now and mark
2903 their parameters used. We have to do that here, as we don't
2904 know whether any particular clone will be expanded, and
2905 therefore cannot pick one arbitrarily. */
2908 for (probe = TREE_CHAIN (DECL_CLONED_FUNCTION (fn));
2909 probe && DECL_CLONED_FUNCTION_P (probe);
2910 probe = TREE_CHAIN (probe))
2914 for (parms = DECL_ARGUMENTS (probe);
2915 parms; parms = TREE_CHAIN (parms))
2916 TREE_USED (parms) = 1;
2921 /* Generate RTL for FN. */
2924 expand_or_defer_fn (tree fn)
2926 /* When the parser calls us after finishing the body of a template
2927 function, we don't really want to expand the body. */
2928 if (processing_template_decl)
2930 /* Normally, collection only occurs in rest_of_compilation. So,
2931 if we don't collect here, we never collect junk generated
2932 during the processing of templates until we hit a
2933 non-template function. */
2938 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
2939 walk_tree_without_duplicates (&DECL_SAVED_TREE (fn),
2940 simplify_aggr_init_exprs_r,
2943 /* If this is a constructor or destructor body, we have to clone
2945 if (maybe_clone_body (fn))
2947 /* We don't want to process FN again, so pretend we've written
2948 it out, even though we haven't. */
2949 TREE_ASM_WRITTEN (fn) = 1;
2953 /* If this function is marked with the constructor attribute, add it
2954 to the list of functions to be called along with constructors
2955 from static duration objects. */
2956 if (DECL_STATIC_CONSTRUCTOR (fn))
2957 static_ctors = tree_cons (NULL_TREE, fn, static_ctors);
2959 /* If this function is marked with the destructor attribute, add it
2960 to the list of functions to be called along with destructors from
2961 static duration objects. */
2962 if (DECL_STATIC_DESTRUCTOR (fn))
2963 static_dtors = tree_cons (NULL_TREE, fn, static_dtors);
2965 /* We make a decision about linkage for these functions at the end
2966 of the compilation. Until that point, we do not want the back
2967 end to output them -- but we do want it to see the bodies of
2968 these functions so that it can inline them as appropriate. */
2969 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
2973 DECL_EXTERNAL (fn) = 1;
2974 DECL_NOT_REALLY_EXTERN (fn) = 1;
2975 note_vague_linkage_fn (fn);
2978 import_export_decl (fn);
2980 /* If the user wants us to keep all inline functions, then mark
2981 this function as needed so that finish_file will make sure to
2983 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
2987 /* There's no reason to do any of the work here if we're only doing
2988 semantic analysis; this code just generates RTL. */
2989 if (flag_syntax_only)
2994 /* Expand or defer, at the whim of the compilation unit manager. */
2995 cgraph_finalize_function (fn, function_depth > 1);
3007 /* Helper function for walk_tree, used by finalize_nrv below. */
3010 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3012 struct nrv_data *dp = (struct nrv_data *)data;
3015 /* No need to walk into types. There wouldn't be any need to walk into
3016 non-statements, except that we have to consider STMT_EXPRs. */
3019 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3020 but differs from using NULL_TREE in that it indicates that we care
3021 about the value of the RESULT_DECL. */
3022 else if (TREE_CODE (*tp) == RETURN_EXPR)
3023 TREE_OPERAND (*tp, 0) = dp->result;
3024 /* Change all cleanups for the NRV to only run when an exception is
3026 else if (TREE_CODE (*tp) == CLEANUP_STMT
3027 && CLEANUP_DECL (*tp) == dp->var)
3028 CLEANUP_EH_ONLY (*tp) = 1;
3029 /* Replace the DECL_EXPR for the NRV with an initialization of the
3030 RESULT_DECL, if needed. */
3031 else if (TREE_CODE (*tp) == DECL_EXPR
3032 && DECL_EXPR_DECL (*tp) == dp->var)
3035 if (DECL_INITIAL (dp->var)
3036 && DECL_INITIAL (dp->var) != error_mark_node)
3038 init = build2 (INIT_EXPR, void_type_node, dp->result,
3039 DECL_INITIAL (dp->var));
3040 DECL_INITIAL (dp->var) = error_mark_node;
3043 init = build_empty_stmt ();
3044 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3047 /* And replace all uses of the NRV with the RESULT_DECL. */
3048 else if (*tp == dp->var)
3051 /* Avoid walking into the same tree more than once. Unfortunately, we
3052 can't just use walk_tree_without duplicates because it would only call
3053 us for the first occurrence of dp->var in the function body. */
3054 slot = htab_find_slot (dp->visited, *tp, INSERT);
3060 /* Keep iterating. */
3064 /* Called from finish_function to implement the named return value
3065 optimization by overriding all the RETURN_EXPRs and pertinent
3066 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3067 RESULT_DECL for the function. */
3070 finalize_nrv (tree *tp, tree var, tree result)
3072 struct nrv_data data;
3074 /* Copy debugging information from VAR to RESULT. */
3075 DECL_NAME (result) = DECL_NAME (var);
3076 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3077 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3078 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3079 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3080 /* Don't forget that we take its address. */
3081 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3084 data.result = result;
3085 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3086 walk_tree (tp, finalize_nrv_r, &data, 0);
3087 htab_delete (data.visited);
3090 /* Perform initialization related to this module. */
3093 init_cp_semantics (void)
3097 #include "gt-cp-semantics.h"