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 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
373 r = maybe_cleanup_point_expr (r);
377 /* Nonzero if TYPE is an anonymous union or struct type. We have to use a
378 flag for this because "A union for which objects or pointers are
379 declared is not an anonymous union" [class.union]. */
382 anon_aggr_type_p (tree node)
384 return ANON_AGGR_TYPE_P (node);
387 /* Finish a scope. */
390 do_poplevel (tree stmt_list)
394 if (stmts_are_full_exprs_p ())
395 block = poplevel (kept_level_p (), 1, 0);
397 stmt_list = pop_stmt_list (stmt_list);
399 if (!processing_template_decl)
401 stmt_list = c_build_bind_expr (block, stmt_list);
402 /* ??? See c_end_compound_stmt re statement expressions. */
408 /* Begin a new scope. */
411 do_pushlevel (scope_kind sk)
413 tree ret = push_stmt_list ();
414 if (stmts_are_full_exprs_p ())
415 begin_scope (sk, NULL);
419 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
420 when the current scope is exited. EH_ONLY is true when this is not
421 meant to apply to normal control flow transfer. */
424 push_cleanup (tree decl, tree cleanup, bool eh_only)
426 tree stmt = build_stmt (CLEANUP_STMT, NULL, cleanup, decl);
427 CLEANUP_EH_ONLY (stmt) = eh_only;
429 CLEANUP_BODY (stmt) = push_stmt_list ();
432 /* Begin a conditional that might contain a declaration. When generating
433 normal code, we want the declaration to appear before the statement
434 containing the conditional. When generating template code, we want the
435 conditional to be rendered as the raw DECL_EXPR. */
438 begin_cond (tree *cond_p)
440 if (processing_template_decl)
441 *cond_p = push_stmt_list ();
444 /* Finish such a conditional. */
447 finish_cond (tree *cond_p, tree expr)
449 if (processing_template_decl)
451 tree cond = pop_stmt_list (*cond_p);
452 if (TREE_CODE (cond) == DECL_EXPR)
458 /* If *COND_P specifies a conditional with a declaration, transform the
461 for (; A x = 42;) { }
463 while (true) { A x = 42; if (!x) break; }
464 for (;;) { A x = 42; if (!x) break; }
465 The statement list for BODY will be empty if the conditional did
466 not declare anything. */
469 simplify_loop_decl_cond (tree *cond_p, tree body)
473 if (!TREE_SIDE_EFFECTS (body))
477 *cond_p = boolean_true_node;
479 if_stmt = begin_if_stmt ();
480 cond = build_unary_op (TRUTH_NOT_EXPR, cond, 0);
481 finish_if_stmt_cond (cond, if_stmt);
482 finish_break_stmt ();
483 finish_then_clause (if_stmt);
484 finish_if_stmt (if_stmt);
487 /* Finish a goto-statement. */
490 finish_goto_stmt (tree destination)
492 if (TREE_CODE (destination) == IDENTIFIER_NODE)
493 destination = lookup_label (destination);
495 /* We warn about unused labels with -Wunused. That means we have to
496 mark the used labels as used. */
497 if (TREE_CODE (destination) == LABEL_DECL)
498 TREE_USED (destination) = 1;
501 /* The DESTINATION is being used as an rvalue. */
502 if (!processing_template_decl)
503 destination = decay_conversion (destination);
504 /* We don't inline calls to functions with computed gotos.
505 Those functions are typically up to some funny business,
506 and may be depending on the labels being at particular
507 addresses, or some such. */
508 DECL_UNINLINABLE (current_function_decl) = 1;
511 check_goto (destination);
513 return add_stmt (build_stmt (GOTO_EXPR, destination));
516 /* COND is the condition-expression for an if, while, etc.,
517 statement. Convert it to a boolean value, if appropriate. */
520 maybe_convert_cond (tree cond)
522 /* Empty conditions remain empty. */
526 /* Wait until we instantiate templates before doing conversion. */
527 if (processing_template_decl)
530 /* Do the conversion. */
531 cond = convert_from_reference (cond);
532 return condition_conversion (cond);
535 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
538 finish_expr_stmt (tree expr)
542 if (expr != NULL_TREE)
544 if (!processing_template_decl)
546 if (warn_sequence_point)
547 verify_sequence_points (expr);
548 expr = convert_to_void (expr, "statement");
550 else if (!type_dependent_expression_p (expr))
551 convert_to_void (build_non_dependent_expr (expr), "statement");
553 /* Simplification of inner statement expressions, compound exprs,
554 etc can result in the us already having an EXPR_STMT. */
555 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
557 if (TREE_CODE (expr) != EXPR_STMT)
558 expr = build_stmt (EXPR_STMT, expr);
559 expr = maybe_cleanup_point_expr (expr);
571 /* Begin an if-statement. Returns a newly created IF_STMT if
578 scope = do_pushlevel (sk_block);
579 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
580 TREE_CHAIN (r) = scope;
581 begin_cond (&IF_COND (r));
585 /* Process the COND of an if-statement, which may be given by
589 finish_if_stmt_cond (tree cond, tree if_stmt)
591 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
593 THEN_CLAUSE (if_stmt) = push_stmt_list ();
596 /* Finish the then-clause of an if-statement, which may be given by
600 finish_then_clause (tree if_stmt)
602 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
606 /* Begin the else-clause of an if-statement. */
609 begin_else_clause (tree if_stmt)
611 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
614 /* Finish the else-clause of an if-statement, which may be given by
618 finish_else_clause (tree if_stmt)
620 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
623 /* Finish an if-statement. */
626 finish_if_stmt (tree if_stmt)
628 tree scope = TREE_CHAIN (if_stmt);
629 TREE_CHAIN (if_stmt) = NULL;
630 add_stmt (do_poplevel (scope));
634 /* Begin a while-statement. Returns a newly created WHILE_STMT if
638 begin_while_stmt (void)
641 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
643 WHILE_BODY (r) = do_pushlevel (sk_block);
644 begin_cond (&WHILE_COND (r));
648 /* Process the COND of a while-statement, which may be given by
652 finish_while_stmt_cond (tree cond, tree while_stmt)
654 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
655 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
658 /* Finish a while-statement, which may be given by WHILE_STMT. */
661 finish_while_stmt (tree while_stmt)
663 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
667 /* Begin a do-statement. Returns a newly created DO_STMT if
673 tree r = build_stmt (DO_STMT, NULL_TREE, NULL_TREE);
675 DO_BODY (r) = push_stmt_list ();
679 /* Finish the body of a do-statement, which may be given by DO_STMT. */
682 finish_do_body (tree do_stmt)
684 DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
687 /* Finish a do-statement, which may be given by DO_STMT, and whose
688 COND is as indicated. */
691 finish_do_stmt (tree cond, tree do_stmt)
693 cond = maybe_convert_cond (cond);
694 DO_COND (do_stmt) = cond;
698 /* Finish a return-statement. The EXPRESSION returned, if any, is as
702 finish_return_stmt (tree expr)
706 expr = check_return_expr (expr);
707 if (!processing_template_decl)
709 if (DECL_DESTRUCTOR_P (current_function_decl)
710 || (DECL_CONSTRUCTOR_P (current_function_decl)
711 && targetm.cxx.cdtor_returns_this ()))
713 /* Similarly, all destructors must run destructors for
714 base-classes before returning. So, all returns in a
715 destructor get sent to the DTOR_LABEL; finish_function emits
716 code to return a value there. */
717 return finish_goto_stmt (cdtor_label);
721 r = build_stmt (RETURN_EXPR, expr);
722 r = maybe_cleanup_point_expr (r);
729 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
732 begin_for_stmt (void)
736 r = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE,
737 NULL_TREE, NULL_TREE);
739 if (flag_new_for_scope > 0)
740 TREE_CHAIN (r) = do_pushlevel (sk_for);
742 if (processing_template_decl)
743 FOR_INIT_STMT (r) = push_stmt_list ();
748 /* Finish the for-init-statement of a for-statement, which may be
749 given by FOR_STMT. */
752 finish_for_init_stmt (tree for_stmt)
754 if (processing_template_decl)
755 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
757 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
758 begin_cond (&FOR_COND (for_stmt));
761 /* Finish the COND of a for-statement, which may be given by
765 finish_for_cond (tree cond, tree for_stmt)
767 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
768 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
771 /* Finish the increment-EXPRESSION in a for-statement, which may be
772 given by FOR_STMT. */
775 finish_for_expr (tree expr, tree for_stmt)
779 /* If EXPR is an overloaded function, issue an error; there is no
780 context available to use to perform overload resolution. */
781 if (type_unknown_p (expr))
783 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
784 expr = error_mark_node;
786 expr = maybe_cleanup_point_expr (expr);
787 FOR_EXPR (for_stmt) = expr;
790 /* Finish the body of a for-statement, which may be given by
791 FOR_STMT. The increment-EXPR for the loop must be
795 finish_for_stmt (tree for_stmt)
797 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
799 /* Pop the scope for the body of the loop. */
800 if (flag_new_for_scope > 0)
802 tree scope = TREE_CHAIN (for_stmt);
803 TREE_CHAIN (for_stmt) = NULL;
804 add_stmt (do_poplevel (scope));
810 /* Finish a break-statement. */
813 finish_break_stmt (void)
815 return add_stmt (build_break_stmt ());
818 /* Finish a continue-statement. */
821 finish_continue_stmt (void)
823 return add_stmt (build_continue_stmt ());
826 /* Begin a switch-statement. Returns a new SWITCH_STMT if
830 begin_switch_stmt (void)
834 r = build_stmt (SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
836 scope = do_pushlevel (sk_block);
837 TREE_CHAIN (r) = scope;
838 begin_cond (&SWITCH_COND (r));
843 /* Finish the cond of a switch-statement. */
846 finish_switch_cond (tree cond, tree switch_stmt)
848 tree orig_type = NULL;
849 if (!processing_template_decl)
853 /* Convert the condition to an integer or enumeration type. */
854 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
855 if (cond == NULL_TREE)
857 error ("switch quantity not an integer");
858 cond = error_mark_node;
860 orig_type = TREE_TYPE (cond);
861 if (cond != error_mark_node)
865 Integral promotions are performed. */
866 cond = perform_integral_promotions (cond);
867 cond = maybe_cleanup_point_expr (cond);
870 if (cond != error_mark_node)
872 index = get_unwidened (cond, NULL_TREE);
873 /* We can't strip a conversion from a signed type to an unsigned,
874 because if we did, int_fits_type_p would do the wrong thing
875 when checking case values for being in range,
876 and it's too hard to do the right thing. */
877 if (TYPE_UNSIGNED (TREE_TYPE (cond))
878 == TYPE_UNSIGNED (TREE_TYPE (index)))
882 finish_cond (&SWITCH_COND (switch_stmt), cond);
883 SWITCH_TYPE (switch_stmt) = orig_type;
884 add_stmt (switch_stmt);
885 push_switch (switch_stmt);
886 SWITCH_BODY (switch_stmt) = push_stmt_list ();
889 /* Finish the body of a switch-statement, which may be given by
890 SWITCH_STMT. The COND to switch on is indicated. */
893 finish_switch_stmt (tree switch_stmt)
897 SWITCH_BODY (switch_stmt) = pop_stmt_list (SWITCH_BODY (switch_stmt));
901 scope = TREE_CHAIN (switch_stmt);
902 TREE_CHAIN (switch_stmt) = NULL;
903 add_stmt (do_poplevel (scope));
906 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
910 begin_try_block (void)
912 tree r = build_stmt (TRY_BLOCK, NULL_TREE, NULL_TREE);
914 TRY_STMTS (r) = push_stmt_list ();
918 /* Likewise, for a function-try-block. */
921 begin_function_try_block (void)
923 tree r = begin_try_block ();
924 FN_TRY_BLOCK_P (r) = 1;
928 /* Finish a try-block, which may be given by TRY_BLOCK. */
931 finish_try_block (tree try_block)
933 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
934 TRY_HANDLERS (try_block) = push_stmt_list ();
937 /* Finish the body of a cleanup try-block, which may be given by
941 finish_cleanup_try_block (tree try_block)
943 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
946 /* Finish an implicitly generated try-block, with a cleanup is given
950 finish_cleanup (tree cleanup, tree try_block)
952 TRY_HANDLERS (try_block) = cleanup;
953 CLEANUP_P (try_block) = 1;
956 /* Likewise, for a function-try-block. */
959 finish_function_try_block (tree try_block)
961 finish_try_block (try_block);
962 /* FIXME : something queer about CTOR_INITIALIZER somehow following
963 the try block, but moving it inside. */
964 in_function_try_handler = 1;
967 /* Finish a handler-sequence for a try-block, which may be given by
971 finish_handler_sequence (tree try_block)
973 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
974 check_handlers (TRY_HANDLERS (try_block));
977 /* Likewise, for a function-try-block. */
980 finish_function_handler_sequence (tree try_block)
982 in_function_try_handler = 0;
983 finish_handler_sequence (try_block);
986 /* Begin a handler. Returns a HANDLER if appropriate. */
993 r = build_stmt (HANDLER, NULL_TREE, NULL_TREE);
996 /* Create a binding level for the eh_info and the exception object
998 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1003 /* Finish the handler-parameters for a handler, which may be given by
1004 HANDLER. DECL is the declaration for the catch parameter, or NULL
1005 if this is a `catch (...)' clause. */
1008 finish_handler_parms (tree decl, tree handler)
1010 tree type = NULL_TREE;
1011 if (processing_template_decl)
1015 decl = pushdecl (decl);
1016 decl = push_template_decl (decl);
1017 HANDLER_PARMS (handler) = decl;
1018 type = TREE_TYPE (decl);
1022 type = expand_start_catch_block (decl);
1024 HANDLER_TYPE (handler) = type;
1025 if (!processing_template_decl && type)
1026 mark_used (eh_type_info (type));
1029 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1030 the return value from the matching call to finish_handler_parms. */
1033 finish_handler (tree handler)
1035 if (!processing_template_decl)
1036 expand_end_catch_block ();
1037 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1040 /* Begin a compound statement. FLAGS contains some bits that control the
1041 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1042 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1043 block of a function. If BCS_TRY_BLOCK is set, this is the block
1044 created on behalf of a TRY statement. Returns a token to be passed to
1045 finish_compound_stmt. */
1048 begin_compound_stmt (unsigned int flags)
1052 if (flags & BCS_NO_SCOPE)
1054 r = push_stmt_list ();
1055 STATEMENT_LIST_NO_SCOPE (r) = 1;
1057 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1058 But, if it's a statement-expression with a scopeless block, there's
1059 nothing to keep, and we don't want to accidentally keep a block
1060 *inside* the scopeless block. */
1061 keep_next_level (false);
1064 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1066 /* When processing a template, we need to remember where the braces were,
1067 so that we can set up identical scopes when instantiating the template
1068 later. BIND_EXPR is a handy candidate for this.
1069 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1070 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1071 processing templates. */
1072 if (processing_template_decl)
1074 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1075 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1076 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1077 TREE_SIDE_EFFECTS (r) = 1;
1083 /* Finish a compound-statement, which is given by STMT. */
1086 finish_compound_stmt (tree stmt)
1088 if (TREE_CODE (stmt) == BIND_EXPR)
1089 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1090 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1091 stmt = pop_stmt_list (stmt);
1094 /* Destroy any ObjC "super" receivers that may have been
1096 objc_clear_super_receiver ();
1098 stmt = do_poplevel (stmt);
1101 /* ??? See c_end_compound_stmt wrt statement expressions. */
1106 /* Finish an asm-statement, whose components are a STRING, some
1107 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1108 whether the asm-statement should be considered volatile. */
1111 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1112 tree input_operands, tree clobbers)
1117 if (!processing_template_decl)
1123 for (t = input_operands; t; t = TREE_CHAIN (t))
1125 tree converted_operand
1126 = decay_conversion (TREE_VALUE (t));
1128 /* If the type of the operand hasn't been determined (e.g.,
1129 because it involves an overloaded function), then issue
1130 an error message. There's no context available to
1131 resolve the overloading. */
1132 if (TREE_TYPE (converted_operand) == unknown_type_node)
1134 error ("type of asm operand %qE could not be determined",
1136 converted_operand = error_mark_node;
1138 TREE_VALUE (t) = converted_operand;
1141 ninputs = list_length (input_operands);
1142 noutputs = list_length (output_operands);
1144 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1149 const char *constraint;
1152 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1153 operand = TREE_VALUE (t);
1155 if (!parse_output_constraint (&constraint,
1156 i, ninputs, noutputs,
1161 /* By marking this operand as erroneous, we will not try
1162 to process this operand again in expand_asm_operands. */
1163 TREE_VALUE (t) = error_mark_node;
1167 /* If the operand is a DECL that is going to end up in
1168 memory, assume it is addressable. This is a bit more
1169 conservative than it would ideally be; the exact test is
1170 buried deep in expand_asm_operands and depends on the
1171 DECL_RTL for the OPERAND -- which we don't have at this
1173 if (!allows_reg && DECL_P (operand))
1174 cxx_mark_addressable (operand);
1178 r = build_stmt (ASM_EXPR, string,
1179 output_operands, input_operands,
1181 ASM_VOLATILE_P (r) = volatile_p;
1182 r = maybe_cleanup_point_expr (r);
1183 return add_stmt (r);
1186 /* Finish a label with the indicated NAME. */
1189 finish_label_stmt (tree name)
1191 tree decl = define_label (input_location, name);
1192 return add_stmt (build_stmt (LABEL_EXPR, decl));
1195 /* Finish a series of declarations for local labels. G++ allows users
1196 to declare "local" labels, i.e., labels with scope. This extension
1197 is useful when writing code involving statement-expressions. */
1200 finish_label_decl (tree name)
1202 tree decl = declare_local_label (name);
1203 add_decl_expr (decl);
1206 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1209 finish_decl_cleanup (tree decl, tree cleanup)
1211 push_cleanup (decl, cleanup, false);
1214 /* If the current scope exits with an exception, run CLEANUP. */
1217 finish_eh_cleanup (tree cleanup)
1219 push_cleanup (NULL, cleanup, true);
1222 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1223 order they were written by the user. Each node is as for
1224 emit_mem_initializers. */
1227 finish_mem_initializers (tree mem_inits)
1229 /* Reorder the MEM_INITS so that they are in the order they appeared
1230 in the source program. */
1231 mem_inits = nreverse (mem_inits);
1233 if (processing_template_decl)
1234 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1236 emit_mem_initializers (mem_inits);
1239 /* Finish a parenthesized expression EXPR. */
1242 finish_parenthesized_expr (tree expr)
1245 /* This inhibits warnings in c_common_truthvalue_conversion. */
1246 TREE_NO_WARNING (expr) = 1;
1248 if (TREE_CODE (expr) == OFFSET_REF)
1249 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1250 enclosed in parentheses. */
1251 PTRMEM_OK_P (expr) = 0;
1255 /* Finish a reference to a non-static data member (DECL) that is not
1256 preceded by `.' or `->'. */
1259 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1261 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1265 if (current_function_decl
1266 && DECL_STATIC_FUNCTION_P (current_function_decl))
1267 cp_error_at ("invalid use of member %qD in static member function",
1270 cp_error_at ("invalid use of non-static data member %qD", decl);
1271 error ("from this location");
1273 return error_mark_node;
1275 TREE_USED (current_class_ptr) = 1;
1276 if (processing_template_decl && !qualifying_scope)
1278 tree type = TREE_TYPE (decl);
1280 if (TREE_CODE (type) == REFERENCE_TYPE)
1281 type = TREE_TYPE (type);
1284 /* Set the cv qualifiers. */
1285 int quals = cp_type_quals (TREE_TYPE (current_class_ref));
1287 if (DECL_MUTABLE_P (decl))
1288 quals &= ~TYPE_QUAL_CONST;
1290 quals |= cp_type_quals (TREE_TYPE (decl));
1291 type = cp_build_qualified_type (type, quals);
1294 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1298 tree access_type = TREE_TYPE (object);
1299 tree lookup_context = context_for_name_lookup (decl);
1301 while (!DERIVED_FROM_P (lookup_context, access_type))
1303 access_type = TYPE_CONTEXT (access_type);
1304 while (access_type && DECL_P (access_type))
1305 access_type = DECL_CONTEXT (access_type);
1309 cp_error_at ("object missing in reference to %qD", decl);
1310 error ("from this location");
1311 return error_mark_node;
1315 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1316 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1318 if (processing_template_decl)
1319 return build_min (SCOPE_REF, TREE_TYPE (decl),
1320 qualifying_scope, DECL_NAME (decl));
1322 perform_or_defer_access_check (TYPE_BINFO (access_type), decl);
1324 /* If the data member was named `C::M', convert `*this' to `C'
1326 if (qualifying_scope)
1328 tree binfo = NULL_TREE;
1329 object = build_scoped_ref (object, qualifying_scope,
1333 return build_class_member_access_expr (object, decl,
1334 /*access_path=*/NULL_TREE,
1335 /*preserve_reference=*/false);
1339 /* DECL was the declaration to which a qualified-id resolved. Issue
1340 an error message if it is not accessible. If OBJECT_TYPE is
1341 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1342 type of `*x', or `x', respectively. If the DECL was named as
1343 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1346 check_accessibility_of_qualified_id (tree decl,
1348 tree nested_name_specifier)
1351 tree qualifying_type = NULL_TREE;
1353 /* If we're not checking, return immediately. */
1354 if (deferred_access_no_check)
1357 /* Determine the SCOPE of DECL. */
1358 scope = context_for_name_lookup (decl);
1359 /* If the SCOPE is not a type, then DECL is not a member. */
1360 if (!TYPE_P (scope))
1362 /* Compute the scope through which DECL is being accessed. */
1364 /* OBJECT_TYPE might not be a class type; consider:
1366 class A { typedef int I; };
1370 In this case, we will have "A::I" as the DECL, but "I" as the
1372 && CLASS_TYPE_P (object_type)
1373 && DERIVED_FROM_P (scope, object_type))
1374 /* If we are processing a `->' or `.' expression, use the type of the
1376 qualifying_type = object_type;
1377 else if (nested_name_specifier)
1379 /* If the reference is to a non-static member of the
1380 current class, treat it as if it were referenced through
1382 if (DECL_NONSTATIC_MEMBER_P (decl)
1383 && current_class_ptr
1384 && DERIVED_FROM_P (scope, current_class_type))
1385 qualifying_type = current_class_type;
1386 /* Otherwise, use the type indicated by the
1387 nested-name-specifier. */
1389 qualifying_type = nested_name_specifier;
1392 /* Otherwise, the name must be from the current class or one of
1394 qualifying_type = currently_open_derived_class (scope);
1396 if (qualifying_type && IS_AGGR_TYPE_CODE (TREE_CODE (qualifying_type)))
1397 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1398 or similar in a default argument value. */
1399 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl);
1402 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1403 class named to the left of the "::" operator. DONE is true if this
1404 expression is a complete postfix-expression; it is false if this
1405 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1406 iff this expression is the operand of '&'. */
1409 finish_qualified_id_expr (tree qualifying_class, tree expr, bool done,
1412 if (error_operand_p (expr))
1413 return error_mark_node;
1415 /* If EXPR occurs as the operand of '&', use special handling that
1416 permits a pointer-to-member. */
1417 if (address_p && done)
1419 if (TREE_CODE (expr) == SCOPE_REF)
1420 expr = TREE_OPERAND (expr, 1);
1421 expr = build_offset_ref (qualifying_class, expr,
1422 /*address_p=*/true);
1426 if (TREE_CODE (expr) == FIELD_DECL)
1427 expr = finish_non_static_data_member (expr, current_class_ref,
1429 else if (BASELINK_P (expr) && !processing_template_decl)
1433 /* See if any of the functions are non-static members. */
1434 fns = BASELINK_FUNCTIONS (expr);
1435 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1436 fns = TREE_OPERAND (fns, 0);
1437 /* If so, the expression may be relative to the current
1439 if (!shared_member_p (fns)
1440 && current_class_type
1441 && DERIVED_FROM_P (qualifying_class, current_class_type))
1442 expr = (build_class_member_access_expr
1443 (maybe_dummy_object (qualifying_class, NULL),
1445 BASELINK_ACCESS_BINFO (expr),
1446 /*preserve_reference=*/false));
1448 /* The expression is a qualified name whose address is not
1450 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1456 /* Begin a statement-expression. The value returned must be passed to
1457 finish_stmt_expr. */
1460 begin_stmt_expr (void)
1462 return push_stmt_list ();
1465 /* Process the final expression of a statement expression. EXPR can be
1466 NULL, if the final expression is empty. Build up a TARGET_EXPR so
1467 that the result value can be safely returned to the enclosing
1471 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1473 tree result = NULL_TREE;
1477 if (!processing_template_decl && !VOID_TYPE_P (TREE_TYPE (expr)))
1479 tree type = TREE_TYPE (expr);
1481 if (TREE_CODE (type) == ARRAY_TYPE
1482 || TREE_CODE (type) == FUNCTION_TYPE)
1483 expr = decay_conversion (expr);
1485 expr = convert_from_reference (expr);
1486 expr = require_complete_type (expr);
1488 type = TREE_TYPE (expr);
1490 /* Build a TARGET_EXPR for this aggregate. finish_stmt_expr
1491 will then pull it apart so the lifetime of the target is
1492 within the scope of the expression containing this statement
1494 if (TREE_CODE (expr) == TARGET_EXPR)
1496 else if (!IS_AGGR_TYPE (type) || TYPE_HAS_TRIVIAL_INIT_REF (type))
1497 expr = build_target_expr_with_type (expr, type);
1500 /* Copy construct. */
1501 expr = build_special_member_call
1502 (NULL_TREE, complete_ctor_identifier,
1503 build_tree_list (NULL_TREE, expr),
1504 type, LOOKUP_NORMAL);
1505 expr = build_cplus_new (type, expr);
1506 gcc_assert (TREE_CODE (expr) == TARGET_EXPR);
1510 if (expr != error_mark_node)
1512 result = build_stmt (EXPR_STMT, expr);
1513 EXPR_STMT_STMT_EXPR_RESULT (result) = 1;
1520 /* Remember the last expression so that finish_stmt_expr
1521 can pull it apart. */
1522 TREE_TYPE (stmt_expr) = result;
1527 /* Finish a statement-expression. EXPR should be the value returned
1528 by the previous begin_stmt_expr. Returns an expression
1529 representing the statement-expression. */
1532 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1534 tree result, result_stmt, type;
1535 tree *result_stmt_p = NULL;
1537 result_stmt = TREE_TYPE (stmt_expr);
1538 TREE_TYPE (stmt_expr) = void_type_node;
1539 result = pop_stmt_list (stmt_expr);
1541 if (!result_stmt || VOID_TYPE_P (result_stmt))
1542 type = void_type_node;
1545 /* We need to search the statement expression for the result_stmt,
1546 since we'll need to replace it entirely. */
1548 result_stmt_p = &result;
1552 if (t == result_stmt)
1555 switch (TREE_CODE (t))
1557 case STATEMENT_LIST:
1559 tree_stmt_iterator i = tsi_last (t);
1560 result_stmt_p = tsi_stmt_ptr (i);
1564 result_stmt_p = &BIND_EXPR_BODY (t);
1566 case TRY_FINALLY_EXPR:
1567 case TRY_CATCH_EXPR:
1569 result_stmt_p = &TREE_OPERAND (t, 0);
1575 type = TREE_TYPE (EXPR_STMT_EXPR (result_stmt));
1578 if (processing_template_decl)
1580 result = build_min (STMT_EXPR, type, result);
1581 TREE_SIDE_EFFECTS (result) = 1;
1582 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1584 else if (!VOID_TYPE_P (type))
1586 /* Pull out the TARGET_EXPR that is the final expression. Put
1587 the target's init_expr as the final expression and then put
1588 the statement expression itself as the target's init
1589 expr. Finally, return the target expression. */
1590 tree init, target_expr = EXPR_STMT_EXPR (result_stmt);
1591 gcc_assert (TREE_CODE (target_expr) == TARGET_EXPR);
1593 /* The initializer will be void if the initialization is done by
1594 AGGR_INIT_EXPR; propagate that out to the statement-expression as
1596 init = TREE_OPERAND (target_expr, 1);
1597 type = TREE_TYPE (init);
1599 init = maybe_cleanup_point_expr (init);
1600 *result_stmt_p = init;
1602 if (VOID_TYPE_P (type))
1603 /* No frobbing needed. */;
1604 else if (TREE_CODE (result) == BIND_EXPR)
1606 /* The BIND_EXPR created in finish_compound_stmt is void; if we're
1607 returning a value directly, give it the appropriate type. */
1608 if (VOID_TYPE_P (TREE_TYPE (result)))
1609 TREE_TYPE (result) = type;
1611 gcc_assert (same_type_p (TREE_TYPE (result), type));
1613 else if (TREE_CODE (result) == STATEMENT_LIST)
1614 /* We need to wrap a STATEMENT_LIST in a BIND_EXPR so it can have a
1615 type other than void. FIXME why can't we just return a value
1616 from STATEMENT_LIST? */
1617 result = build3 (BIND_EXPR, type, NULL, result, NULL);
1619 TREE_OPERAND (target_expr, 1) = result;
1620 result = target_expr;
1626 /* Perform Koenig lookup. FN is the postfix-expression representing
1627 the function (or functions) to call; ARGS are the arguments to the
1628 call. Returns the functions to be considered by overload
1632 perform_koenig_lookup (tree fn, tree args)
1634 tree identifier = NULL_TREE;
1635 tree functions = NULL_TREE;
1637 /* Find the name of the overloaded function. */
1638 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1640 else if (is_overloaded_fn (fn))
1643 identifier = DECL_NAME (get_first_fn (functions));
1645 else if (DECL_P (fn))
1648 identifier = DECL_NAME (fn);
1651 /* A call to a namespace-scope function using an unqualified name.
1653 Do Koenig lookup -- unless any of the arguments are
1655 if (!any_type_dependent_arguments_p (args))
1657 fn = lookup_arg_dependent (identifier, functions, args);
1659 /* The unqualified name could not be resolved. */
1660 fn = unqualified_fn_lookup_error (identifier);
1668 /* Generate an expression for `FN (ARGS)'.
1670 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1671 as a virtual call, even if FN is virtual. (This flag is set when
1672 encountering an expression where the function name is explicitly
1673 qualified. For example a call to `X::f' never generates a virtual
1676 Returns code for the call. */
1679 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p)
1685 if (fn == error_mark_node || args == error_mark_node)
1686 return error_mark_node;
1688 /* ARGS should be a list of arguments. */
1689 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1694 if (processing_template_decl)
1696 if (type_dependent_expression_p (fn)
1697 || any_type_dependent_arguments_p (args))
1699 result = build_nt (CALL_EXPR, fn, args, NULL_TREE);
1700 KOENIG_LOOKUP_P (result) = koenig_p;
1703 if (!BASELINK_P (fn)
1704 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1705 && TREE_TYPE (fn) != unknown_type_node)
1706 fn = build_non_dependent_expr (fn);
1707 args = build_non_dependent_args (orig_args);
1710 /* A reference to a member function will appear as an overloaded
1711 function (rather than a BASELINK) if an unqualified name was used
1713 if (!BASELINK_P (fn) && is_overloaded_fn (fn))
1717 if (TREE_CODE (f) == TEMPLATE_ID_EXPR)
1718 f = TREE_OPERAND (f, 0);
1719 f = get_first_fn (f);
1720 if (DECL_FUNCTION_MEMBER_P (f))
1722 tree type = currently_open_derived_class (DECL_CONTEXT (f));
1724 type = DECL_CONTEXT (f);
1725 fn = build_baselink (TYPE_BINFO (type),
1727 fn, /*optype=*/NULL_TREE);
1732 if (BASELINK_P (fn))
1736 /* A call to a member function. From [over.call.func]:
1738 If the keyword this is in scope and refers to the class of
1739 that member function, or a derived class thereof, then the
1740 function call is transformed into a qualified function call
1741 using (*this) as the postfix-expression to the left of the
1742 . operator.... [Otherwise] a contrived object of type T
1743 becomes the implied object argument.
1745 This paragraph is unclear about this situation:
1747 struct A { void f(); };
1748 struct B : public A {};
1749 struct C : public A { void g() { B::f(); }};
1751 In particular, for `B::f', this paragraph does not make clear
1752 whether "the class of that member function" refers to `A' or
1753 to `B'. We believe it refers to `B'. */
1754 if (current_class_type
1755 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1757 && current_class_ref)
1758 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1762 tree representative_fn;
1764 representative_fn = BASELINK_FUNCTIONS (fn);
1765 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1766 representative_fn = TREE_OPERAND (representative_fn, 0);
1767 representative_fn = get_first_fn (representative_fn);
1768 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1771 if (processing_template_decl)
1773 if (type_dependent_expression_p (object))
1774 return build_nt (CALL_EXPR, orig_fn, orig_args, NULL_TREE);
1775 object = build_non_dependent_expr (object);
1778 result = build_new_method_call (object, fn, args, NULL_TREE,
1780 ? LOOKUP_NONVIRTUAL : 0));
1782 else if (is_overloaded_fn (fn))
1783 /* A call to a namespace-scope function. */
1784 result = build_new_function_call (fn, args);
1785 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1788 error ("arguments to destructor are not allowed");
1789 /* Mark the pseudo-destructor call as having side-effects so
1790 that we do not issue warnings about its use. */
1791 result = build1 (NOP_EXPR,
1793 TREE_OPERAND (fn, 0));
1794 TREE_SIDE_EFFECTS (result) = 1;
1796 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1797 /* If the "function" is really an object of class type, it might
1798 have an overloaded `operator ()'. */
1799 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1800 /*overloaded_p=*/NULL);
1802 /* A call where the function is unknown. */
1803 result = build_function_call (fn, args);
1805 if (processing_template_decl)
1807 result = build3 (CALL_EXPR, TREE_TYPE (result), orig_fn,
1808 orig_args, NULL_TREE);
1809 KOENIG_LOOKUP_P (result) = koenig_p;
1814 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1815 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1816 POSTDECREMENT_EXPR.) */
1819 finish_increment_expr (tree expr, enum tree_code code)
1821 return build_x_unary_op (code, expr);
1824 /* Finish a use of `this'. Returns an expression for `this'. */
1827 finish_this_expr (void)
1831 if (current_class_ptr)
1833 result = current_class_ptr;
1835 else if (current_function_decl
1836 && DECL_STATIC_FUNCTION_P (current_function_decl))
1838 error ("`this' is unavailable for static member functions");
1839 result = error_mark_node;
1843 if (current_function_decl)
1844 error ("invalid use of `this' in non-member function");
1846 error ("invalid use of `this' at top level");
1847 result = error_mark_node;
1853 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
1854 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
1855 the TYPE for the type given. If SCOPE is non-NULL, the expression
1856 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
1859 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
1861 if (destructor == error_mark_node)
1862 return error_mark_node;
1864 gcc_assert (TYPE_P (destructor));
1866 if (!processing_template_decl)
1868 if (scope == error_mark_node)
1870 error ("invalid qualifying scope in pseudo-destructor name");
1871 return error_mark_node;
1874 /* [expr.pseudo] says both:
1876 The type designated by the pseudo-destructor-name shall be
1877 the same as the object type.
1881 The cv-unqualified versions of the object type and of the
1882 type designated by the pseudo-destructor-name shall be the
1885 We implement the more generous second sentence, since that is
1886 what most other compilers do. */
1887 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
1890 error ("%qE is not of type %qT", object, destructor);
1891 return error_mark_node;
1895 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
1898 /* Finish an expression of the form CODE EXPR. */
1901 finish_unary_op_expr (enum tree_code code, tree expr)
1903 tree result = build_x_unary_op (code, expr);
1904 /* Inside a template, build_x_unary_op does not fold the
1905 expression. So check whether the result is folded before
1906 setting TREE_NEGATED_INT. */
1907 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
1908 && TREE_CODE (result) == INTEGER_CST
1909 && !TYPE_UNSIGNED (TREE_TYPE (result))
1910 && INT_CST_LT (result, integer_zero_node))
1911 TREE_NEGATED_INT (result) = 1;
1912 overflow_warning (result);
1916 /* Finish a compound-literal expression. TYPE is the type to which
1917 the INITIALIZER_LIST is being cast. */
1920 finish_compound_literal (tree type, tree initializer_list)
1922 tree compound_literal;
1924 /* Build a CONSTRUCTOR for the INITIALIZER_LIST. */
1925 compound_literal = build_constructor (NULL_TREE, initializer_list);
1926 /* Mark it as a compound-literal. */
1927 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
1928 if (processing_template_decl)
1929 TREE_TYPE (compound_literal) = type;
1932 /* Check the initialization. */
1933 compound_literal = digest_init (type, compound_literal, NULL);
1934 /* If the TYPE was an array type with an unknown bound, then we can
1935 figure out the dimension now. For example, something like:
1939 implies that the array has two elements. */
1940 if (TREE_CODE (type) == ARRAY_TYPE && !COMPLETE_TYPE_P (type))
1941 complete_array_type (type, compound_literal, 1);
1944 return compound_literal;
1947 /* Return the declaration for the function-name variable indicated by
1951 finish_fname (tree id)
1955 decl = fname_decl (C_RID_CODE (id), id);
1956 if (processing_template_decl)
1957 decl = DECL_NAME (decl);
1961 /* Finish a translation unit. */
1964 finish_translation_unit (void)
1966 /* In case there were missing closebraces,
1967 get us back to the global binding level. */
1969 while (current_namespace != global_namespace)
1972 /* Do file scope __FUNCTION__ et al. */
1973 finish_fname_decls ();
1976 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
1977 Returns the parameter. */
1980 finish_template_type_parm (tree aggr, tree identifier)
1982 if (aggr != class_type_node)
1984 pedwarn ("template type parameters must use the keyword `class' or `typename'");
1985 aggr = class_type_node;
1988 return build_tree_list (aggr, identifier);
1991 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
1992 Returns the parameter. */
1995 finish_template_template_parm (tree aggr, tree identifier)
1997 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
1998 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
1999 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2000 DECL_TEMPLATE_RESULT (tmpl) = decl;
2001 DECL_ARTIFICIAL (decl) = 1;
2002 end_template_decl ();
2004 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2006 return finish_template_type_parm (aggr, tmpl);
2009 /* ARGUMENT is the default-argument value for a template template
2010 parameter. If ARGUMENT is invalid, issue error messages and return
2011 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2014 check_template_template_default_arg (tree argument)
2016 if (TREE_CODE (argument) != TEMPLATE_DECL
2017 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2018 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2020 if (TREE_CODE (argument) == TYPE_DECL)
2022 tree t = TREE_TYPE (argument);
2024 /* Try to emit a slightly smarter error message if we detect
2025 that the user is using a template instantiation. */
2026 if (CLASSTYPE_TEMPLATE_INFO (t)
2027 && CLASSTYPE_TEMPLATE_INSTANTIATION (t))
2028 error ("invalid use of type %qT as a default value for a "
2029 "template template-parameter", t);
2031 error ("invalid use of %qD as a default value for a template "
2032 "template-parameter", argument);
2035 error ("invalid default argument for a template template parameter");
2036 return error_mark_node;
2042 /* Begin a class definition, as indicated by T. */
2045 begin_class_definition (tree t)
2047 if (t == error_mark_node)
2048 return error_mark_node;
2050 if (processing_template_parmlist)
2052 error ("definition of %q#T inside template parameter list", t);
2053 return error_mark_node;
2055 /* A non-implicit typename comes from code like:
2057 template <typename T> struct A {
2058 template <typename U> struct A<T>::B ...
2060 This is erroneous. */
2061 else if (TREE_CODE (t) == TYPENAME_TYPE)
2063 error ("invalid definition of qualified type %qT", t);
2064 t = error_mark_node;
2067 if (t == error_mark_node || ! IS_AGGR_TYPE (t))
2069 t = make_aggr_type (RECORD_TYPE);
2070 pushtag (make_anon_name (), t, 0);
2073 /* If this type was already complete, and we see another definition,
2075 if (COMPLETE_TYPE_P (t))
2077 error ("redefinition of %q#T", t);
2078 cp_error_at ("previous definition of %q#T", t);
2079 return error_mark_node;
2082 /* Update the location of the decl. */
2083 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2085 if (TYPE_BEING_DEFINED (t))
2087 t = make_aggr_type (TREE_CODE (t));
2088 pushtag (TYPE_IDENTIFIER (t), t, 0);
2090 maybe_process_partial_specialization (t);
2092 TYPE_BEING_DEFINED (t) = 1;
2093 if (flag_pack_struct)
2096 TYPE_PACKED (t) = 1;
2097 /* Even though the type is being defined for the first time
2098 here, there might have been a forward declaration, so there
2099 might be cv-qualified variants of T. */
2100 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2101 TYPE_PACKED (v) = 1;
2103 /* Reset the interface data, at the earliest possible
2104 moment, as it might have been set via a class foo;
2106 if (! TYPE_ANONYMOUS_P (t))
2108 struct c_fileinfo *finfo = get_fileinfo (lbasename (input_filename));
2109 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2110 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2111 (t, finfo->interface_unknown);
2113 reset_specialization();
2115 /* Make a declaration for this class in its own scope. */
2116 build_self_reference ();
2121 /* Finish the member declaration given by DECL. */
2124 finish_member_declaration (tree decl)
2126 if (decl == error_mark_node || decl == NULL_TREE)
2129 if (decl == void_type_node)
2130 /* The COMPONENT was a friend, not a member, and so there's
2131 nothing for us to do. */
2134 /* We should see only one DECL at a time. */
2135 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2137 /* Set up access control for DECL. */
2139 = (current_access_specifier == access_private_node);
2140 TREE_PROTECTED (decl)
2141 = (current_access_specifier == access_protected_node);
2142 if (TREE_CODE (decl) == TEMPLATE_DECL)
2144 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2145 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2148 /* Mark the DECL as a member of the current class. */
2149 DECL_CONTEXT (decl) = current_class_type;
2153 A C language linkage is ignored for the names of class members
2154 and the member function type of class member functions. */
2155 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2156 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2158 /* Put functions on the TYPE_METHODS list and everything else on the
2159 TYPE_FIELDS list. Note that these are built up in reverse order.
2160 We reverse them (to obtain declaration order) in finish_struct. */
2161 if (TREE_CODE (decl) == FUNCTION_DECL
2162 || DECL_FUNCTION_TEMPLATE_P (decl))
2164 /* We also need to add this function to the
2165 CLASSTYPE_METHOD_VEC. */
2166 add_method (current_class_type, decl);
2168 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2169 TYPE_METHODS (current_class_type) = decl;
2171 maybe_add_class_template_decl_list (current_class_type, decl,
2174 /* Enter the DECL into the scope of the class. */
2175 else if ((TREE_CODE (decl) == USING_DECL && TREE_TYPE (decl))
2176 || pushdecl_class_level (decl))
2178 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2179 go at the beginning. The reason is that lookup_field_1
2180 searches the list in order, and we want a field name to
2181 override a type name so that the "struct stat hack" will
2182 work. In particular:
2184 struct S { enum E { }; int E } s;
2187 is valid. In addition, the FIELD_DECLs must be maintained in
2188 declaration order so that class layout works as expected.
2189 However, we don't need that order until class layout, so we
2190 save a little time by putting FIELD_DECLs on in reverse order
2191 here, and then reversing them in finish_struct_1. (We could
2192 also keep a pointer to the correct insertion points in the
2195 if (TREE_CODE (decl) == TYPE_DECL)
2196 TYPE_FIELDS (current_class_type)
2197 = chainon (TYPE_FIELDS (current_class_type), decl);
2200 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2201 TYPE_FIELDS (current_class_type) = decl;
2204 maybe_add_class_template_decl_list (current_class_type, decl,
2209 /* Finish processing a complete template declaration. The PARMS are
2210 the template parameters. */
2213 finish_template_decl (tree parms)
2216 end_template_decl ();
2218 end_specialization ();
2221 /* Finish processing a template-id (which names a type) of the form
2222 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2223 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2224 the scope of template-id indicated. */
2227 finish_template_type (tree name, tree args, int entering_scope)
2231 decl = lookup_template_class (name, args,
2232 NULL_TREE, NULL_TREE, entering_scope,
2233 tf_error | tf_warning | tf_user);
2234 if (decl != error_mark_node)
2235 decl = TYPE_STUB_DECL (decl);
2240 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2241 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2242 BASE_CLASS, or NULL_TREE if an error occurred. The
2243 ACCESS_SPECIFIER is one of
2244 access_{default,public,protected_private}_node. For a virtual base
2245 we set TREE_TYPE. */
2248 finish_base_specifier (tree base, tree access, bool virtual_p)
2252 if (base == error_mark_node)
2254 error ("invalid base-class specification");
2257 else if (! is_aggr_type (base, 1))
2261 if (cp_type_quals (base) != 0)
2263 error ("base class %qT has cv qualifiers", base);
2264 base = TYPE_MAIN_VARIANT (base);
2266 result = build_tree_list (access, base);
2268 TREE_TYPE (result) = integer_type_node;
2274 /* Called when multiple declarators are processed. If that is not
2275 permitted in this context, an error is issued. */
2278 check_multiple_declarators (void)
2282 In a template-declaration, explicit specialization, or explicit
2283 instantiation the init-declarator-list in the declaration shall
2284 contain at most one declarator.
2286 We don't just use PROCESSING_TEMPLATE_DECL for the first
2287 condition since that would disallow the perfectly valid code,
2288 like `template <class T> struct S { int i, j; };'. */
2289 if (at_function_scope_p ())
2290 /* It's OK to write `template <class T> void f() { int i, j;}'. */
2293 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
2294 || processing_explicit_instantiation
2295 || processing_specialization)
2296 error ("multiple declarators in template declaration");
2299 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2300 what we found when we tried to do the lookup. */
2303 qualified_name_lookup_error (tree scope, tree name, tree decl)
2307 if (!COMPLETE_TYPE_P (scope))
2308 error ("incomplete type %qT used in nested name specifier", scope);
2309 else if (TREE_CODE (decl) == TREE_LIST)
2311 error ("reference to %<%T::%D%> is ambiguous", scope, name);
2312 print_candidates (decl);
2315 error ("%qD is not a member of %qT", name, scope);
2317 else if (scope != global_namespace)
2318 error ("%qD is not a member of %qD", name, scope);
2320 error ("%<::%D%> has not been declared", name);
2323 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2324 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2325 if non-NULL, is the type or namespace used to explicitly qualify
2326 ID_EXPRESSION. DECL is the entity to which that name has been
2329 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2330 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2331 be set to true if this expression isn't permitted in a
2332 constant-expression, but it is otherwise not set by this function.
2333 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2334 constant-expression, but a non-constant expression is also
2337 If an error occurs, and it is the kind of error that might cause
2338 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2339 is the caller's responsibility to issue the message. *ERROR_MSG
2340 will be a string with static storage duration, so the caller need
2343 Return an expression for the entity, after issuing appropriate
2344 diagnostics. This function is also responsible for transforming a
2345 reference to a non-static member into a COMPONENT_REF that makes
2346 the use of "this" explicit.
2348 Upon return, *IDK will be filled in appropriately. */
2351 finish_id_expression (tree id_expression,
2355 tree *qualifying_class,
2356 bool integral_constant_expression_p,
2357 bool allow_non_integral_constant_expression_p,
2358 bool *non_integral_constant_expression_p,
2359 const char **error_msg)
2361 /* Initialize the output parameters. */
2362 *idk = CP_ID_KIND_NONE;
2365 if (id_expression == error_mark_node)
2366 return error_mark_node;
2367 /* If we have a template-id, then no further lookup is
2368 required. If the template-id was for a template-class, we
2369 will sometimes have a TYPE_DECL at this point. */
2370 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2371 || TREE_CODE (decl) == TYPE_DECL)
2373 /* Look up the name. */
2376 if (decl == error_mark_node)
2378 /* Name lookup failed. */
2381 || (!dependent_type_p (scope)
2382 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2383 && IDENTIFIER_TYPENAME_P (id_expression)
2384 && dependent_type_p (TREE_TYPE (id_expression))))))
2386 /* If the qualifying type is non-dependent (and the name
2387 does not name a conversion operator to a dependent
2388 type), issue an error. */
2389 qualified_name_lookup_error (scope, id_expression, decl);
2390 return error_mark_node;
2394 /* It may be resolved via Koenig lookup. */
2395 *idk = CP_ID_KIND_UNQUALIFIED;
2396 return id_expression;
2399 decl = id_expression;
2401 /* If DECL is a variable that would be out of scope under
2402 ANSI/ISO rules, but in scope in the ARM, name lookup
2403 will succeed. Issue a diagnostic here. */
2405 decl = check_for_out_of_scope_variable (decl);
2407 /* Remember that the name was used in the definition of
2408 the current class so that we can check later to see if
2409 the meaning would have been different after the class
2410 was entirely defined. */
2411 if (!scope && decl != error_mark_node)
2412 maybe_note_name_used_in_class (id_expression, decl);
2415 /* If we didn't find anything, or what we found was a type,
2416 then this wasn't really an id-expression. */
2417 if (TREE_CODE (decl) == TEMPLATE_DECL
2418 && !DECL_FUNCTION_TEMPLATE_P (decl))
2420 *error_msg = "missing template arguments";
2421 return error_mark_node;
2423 else if (TREE_CODE (decl) == TYPE_DECL
2424 || TREE_CODE (decl) == NAMESPACE_DECL)
2426 *error_msg = "expected primary-expression";
2427 return error_mark_node;
2430 /* If the name resolved to a template parameter, there is no
2431 need to look it up again later. */
2432 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2433 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2435 *idk = CP_ID_KIND_NONE;
2436 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2437 decl = TEMPLATE_PARM_DECL (decl);
2438 if (integral_constant_expression_p
2439 && !dependent_type_p (TREE_TYPE (decl))
2440 && !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (decl)))
2442 if (!allow_non_integral_constant_expression_p)
2443 error ("template parameter %qD of type %qT is not allowed in "
2444 "an integral constant expression because it is not of "
2445 "integral or enumeration type", decl, TREE_TYPE (decl));
2446 *non_integral_constant_expression_p = true;
2448 return DECL_INITIAL (decl);
2450 /* Similarly, we resolve enumeration constants to their
2451 underlying values. */
2452 else if (TREE_CODE (decl) == CONST_DECL)
2454 *idk = CP_ID_KIND_NONE;
2455 if (!processing_template_decl)
2456 return DECL_INITIAL (decl);
2463 /* If the declaration was explicitly qualified indicate
2464 that. The semantics of `A::f(3)' are different than
2465 `f(3)' if `f' is virtual. */
2467 ? CP_ID_KIND_QUALIFIED
2468 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2469 ? CP_ID_KIND_TEMPLATE_ID
2470 : CP_ID_KIND_UNQUALIFIED));
2475 An id-expression is type-dependent if it contains an
2476 identifier that was declared with a dependent type.
2478 The standard is not very specific about an id-expression that
2479 names a set of overloaded functions. What if some of them
2480 have dependent types and some of them do not? Presumably,
2481 such a name should be treated as a dependent name. */
2482 /* Assume the name is not dependent. */
2483 dependent_p = false;
2484 if (!processing_template_decl)
2485 /* No names are dependent outside a template. */
2487 /* A template-id where the name of the template was not resolved
2488 is definitely dependent. */
2489 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2490 && (TREE_CODE (TREE_OPERAND (decl, 0))
2491 == IDENTIFIER_NODE))
2493 /* For anything except an overloaded function, just check its
2495 else if (!is_overloaded_fn (decl))
2497 = dependent_type_p (TREE_TYPE (decl));
2498 /* For a set of overloaded functions, check each of the
2504 if (BASELINK_P (fns))
2505 fns = BASELINK_FUNCTIONS (fns);
2507 /* For a template-id, check to see if the template
2508 arguments are dependent. */
2509 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2511 tree args = TREE_OPERAND (fns, 1);
2512 dependent_p = any_dependent_template_arguments_p (args);
2513 /* The functions are those referred to by the
2515 fns = TREE_OPERAND (fns, 0);
2518 /* If there are no dependent template arguments, go through
2519 the overloaded functions. */
2520 while (fns && !dependent_p)
2522 tree fn = OVL_CURRENT (fns);
2524 /* Member functions of dependent classes are
2526 if (TREE_CODE (fn) == FUNCTION_DECL
2527 && type_dependent_expression_p (fn))
2529 else if (TREE_CODE (fn) == TEMPLATE_DECL
2530 && dependent_template_p (fn))
2533 fns = OVL_NEXT (fns);
2537 /* If the name was dependent on a template parameter, we will
2538 resolve the name at instantiation time. */
2541 /* Create a SCOPE_REF for qualified names, if the scope is
2546 *qualifying_class = scope;
2547 /* Since this name was dependent, the expression isn't
2548 constant -- yet. No error is issued because it might
2549 be constant when things are instantiated. */
2550 if (integral_constant_expression_p)
2551 *non_integral_constant_expression_p = true;
2552 if (TYPE_P (scope) && dependent_type_p (scope))
2553 return build_nt (SCOPE_REF, scope, id_expression);
2554 else if (TYPE_P (scope) && DECL_P (decl))
2555 return build2 (SCOPE_REF, TREE_TYPE (decl), scope,
2560 /* A TEMPLATE_ID already contains all the information we
2562 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2563 return id_expression;
2564 /* Since this name was dependent, the expression isn't
2565 constant -- yet. No error is issued because it might be
2566 constant when things are instantiated. */
2567 if (integral_constant_expression_p)
2568 *non_integral_constant_expression_p = true;
2569 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2570 /* If we found a variable, then name lookup during the
2571 instantiation will always resolve to the same VAR_DECL
2572 (or an instantiation thereof). */
2573 if (TREE_CODE (decl) == VAR_DECL
2574 || TREE_CODE (decl) == PARM_DECL)
2576 return id_expression;
2579 /* Only certain kinds of names are allowed in constant
2580 expression. Enumerators and template parameters
2581 have already been handled above. */
2582 if (integral_constant_expression_p
2583 && !DECL_INTEGRAL_CONSTANT_VAR_P (decl))
2585 if (!allow_non_integral_constant_expression_p)
2587 error ("%qD cannot appear in a constant-expression", decl);
2588 return error_mark_node;
2590 *non_integral_constant_expression_p = true;
2593 if (TREE_CODE (decl) == NAMESPACE_DECL)
2595 error ("use of namespace %qD as expression", decl);
2596 return error_mark_node;
2598 else if (DECL_CLASS_TEMPLATE_P (decl))
2600 error ("use of class template %qT as expression", decl);
2601 return error_mark_node;
2603 else if (TREE_CODE (decl) == TREE_LIST)
2605 /* Ambiguous reference to base members. */
2606 error ("request for member %qD is ambiguous in "
2607 "multiple inheritance lattice", id_expression);
2608 print_candidates (decl);
2609 return error_mark_node;
2612 /* Mark variable-like entities as used. Functions are similarly
2613 marked either below or after overload resolution. */
2614 if (TREE_CODE (decl) == VAR_DECL
2615 || TREE_CODE (decl) == PARM_DECL
2616 || TREE_CODE (decl) == RESULT_DECL)
2621 decl = (adjust_result_of_qualified_name_lookup
2622 (decl, scope, current_class_type));
2624 if (TREE_CODE (decl) == FUNCTION_DECL)
2627 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2628 *qualifying_class = scope;
2629 else if (!processing_template_decl)
2630 decl = convert_from_reference (decl);
2631 else if (TYPE_P (scope))
2632 decl = build2 (SCOPE_REF, TREE_TYPE (decl), scope, decl);
2634 else if (TREE_CODE (decl) == FIELD_DECL)
2635 decl = finish_non_static_data_member (decl, current_class_ref,
2636 /*qualifying_scope=*/NULL_TREE);
2637 else if (is_overloaded_fn (decl))
2639 tree first_fn = OVL_CURRENT (decl);
2641 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2642 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2644 if (!really_overloaded_fn (decl))
2645 mark_used (first_fn);
2647 if (TREE_CODE (first_fn) == FUNCTION_DECL
2648 && DECL_FUNCTION_MEMBER_P (first_fn)
2649 && !shared_member_p (decl))
2651 /* A set of member functions. */
2652 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
2653 return finish_class_member_access_expr (decl, id_expression);
2658 if (TREE_CODE (decl) == VAR_DECL
2659 || TREE_CODE (decl) == PARM_DECL
2660 || TREE_CODE (decl) == RESULT_DECL)
2662 tree context = decl_function_context (decl);
2664 if (context != NULL_TREE && context != current_function_decl
2665 && ! TREE_STATIC (decl))
2667 error ("use of %s from containing function",
2668 (TREE_CODE (decl) == VAR_DECL
2669 ? "%<auto%> variable" : "parameter"));
2670 cp_error_at (" %q#D declared here", decl);
2671 return error_mark_node;
2675 if (DECL_P (decl) && DECL_NONLOCAL (decl)
2676 && DECL_CLASS_SCOPE_P (decl)
2677 && DECL_CONTEXT (decl) != current_class_type)
2681 path = currently_open_derived_class (DECL_CONTEXT (decl));
2682 perform_or_defer_access_check (TYPE_BINFO (path), decl);
2685 if (! processing_template_decl)
2686 decl = convert_from_reference (decl);
2689 /* Resolve references to variables of anonymous unions
2690 into COMPONENT_REFs. */
2691 if (TREE_CODE (decl) == ALIAS_DECL)
2692 decl = unshare_expr (DECL_INITIAL (decl));
2695 if (TREE_DEPRECATED (decl))
2696 warn_deprecated_use (decl);
2701 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
2702 use as a type-specifier. */
2705 finish_typeof (tree expr)
2709 if (type_dependent_expression_p (expr))
2711 type = make_aggr_type (TYPEOF_TYPE);
2712 TYPEOF_TYPE_EXPR (type) = expr;
2717 type = TREE_TYPE (expr);
2719 if (!type || type == unknown_type_node)
2721 error ("type of %qE is unknown", expr);
2722 return error_mark_node;
2728 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
2729 with equivalent CALL_EXPRs. */
2732 simplify_aggr_init_exprs_r (tree* tp,
2734 void* data ATTRIBUTE_UNUSED)
2736 /* We don't need to walk into types; there's nothing in a type that
2737 needs simplification. (And, furthermore, there are places we
2738 actively don't want to go. For example, we don't want to wander
2739 into the default arguments for a FUNCTION_DECL that appears in a
2746 /* Only AGGR_INIT_EXPRs are interesting. */
2747 else if (TREE_CODE (*tp) != AGGR_INIT_EXPR)
2750 simplify_aggr_init_expr (tp);
2752 /* Keep iterating. */
2756 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
2757 function is broken out from the above for the benefit of the tree-ssa
2761 simplify_aggr_init_expr (tree *tp)
2763 tree aggr_init_expr = *tp;
2765 /* Form an appropriate CALL_EXPR. */
2766 tree fn = TREE_OPERAND (aggr_init_expr, 0);
2767 tree args = TREE_OPERAND (aggr_init_expr, 1);
2768 tree slot = TREE_OPERAND (aggr_init_expr, 2);
2769 tree type = TREE_TYPE (slot);
2772 enum style_t { ctor, arg, pcc } style;
2774 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
2776 #ifdef PCC_STATIC_STRUCT_RETURN
2782 gcc_assert (TREE_ADDRESSABLE (type));
2786 if (style == ctor || style == arg)
2788 /* Pass the address of the slot. If this is a constructor, we
2789 replace the first argument; otherwise, we tack on a new one. */
2793 args = TREE_CHAIN (args);
2795 cxx_mark_addressable (slot);
2796 addr = build1 (ADDR_EXPR, build_pointer_type (type), slot);
2799 /* The return type might have different cv-quals from the slot. */
2800 tree fntype = TREE_TYPE (TREE_TYPE (fn));
2802 gcc_assert (TREE_CODE (fntype) == FUNCTION_TYPE
2803 || TREE_CODE (fntype) == METHOD_TYPE);
2804 addr = convert (build_pointer_type (TREE_TYPE (fntype)), addr);
2807 args = tree_cons (NULL_TREE, addr, args);
2810 call_expr = build3 (CALL_EXPR,
2811 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
2812 fn, args, NULL_TREE);
2815 /* Tell the backend that we've added our return slot to the argument
2817 CALL_EXPR_HAS_RETURN_SLOT_ADDR (call_expr) = 1;
2818 else if (style == pcc)
2820 /* If we're using the non-reentrant PCC calling convention, then we
2821 need to copy the returned value out of the static buffer into the
2823 push_deferring_access_checks (dk_no_check);
2824 call_expr = build_aggr_init (slot, call_expr,
2825 DIRECT_BIND | LOOKUP_ONLYCONVERTING);
2826 pop_deferring_access_checks ();
2832 /* Emit all thunks to FN that should be emitted when FN is emitted. */
2835 emit_associated_thunks (tree fn)
2837 /* When we use vcall offsets, we emit thunks with the virtual
2838 functions to which they thunk. The whole point of vcall offsets
2839 is so that you can know statically the entire set of thunks that
2840 will ever be needed for a given virtual function, thereby
2841 enabling you to output all the thunks with the function itself. */
2842 if (DECL_VIRTUAL_P (fn))
2846 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
2848 if (!THUNK_ALIAS (thunk))
2850 use_thunk (thunk, /*emit_p=*/1);
2851 if (DECL_RESULT_THUNK_P (thunk))
2855 for (probe = DECL_THUNKS (thunk);
2856 probe; probe = TREE_CHAIN (probe))
2857 use_thunk (probe, /*emit_p=*/1);
2861 gcc_assert (!DECL_THUNKS (thunk));
2866 /* Generate RTL for FN. */
2869 expand_body (tree fn)
2871 tree saved_function;
2873 /* Compute the appropriate object-file linkage for inline
2875 if (DECL_DECLARED_INLINE_P (fn))
2876 import_export_decl (fn);
2878 /* If FN is external, then there's no point in generating RTL for
2879 it. This situation can arise with an inline function under
2880 `-fexternal-templates'; we instantiate the function, even though
2881 we're not planning on emitting it, in case we get a chance to
2883 if (DECL_EXTERNAL (fn))
2886 /* ??? When is this needed? */
2887 saved_function = current_function_decl;
2889 /* Emit any thunks that should be emitted at the same time as FN. */
2890 emit_associated_thunks (fn);
2892 /* This function is only called from cgraph, or recursively from
2893 emit_associated_thunks. In neither case should we be currently
2894 generating trees for a function. */
2895 gcc_assert (function_depth == 0);
2897 tree_rest_of_compilation (fn);
2899 current_function_decl = saved_function;
2901 if (DECL_CLONED_FUNCTION_P (fn))
2903 /* If this is a clone, go through the other clones now and mark
2904 their parameters used. We have to do that here, as we don't
2905 know whether any particular clone will be expanded, and
2906 therefore cannot pick one arbitrarily. */
2909 for (probe = TREE_CHAIN (DECL_CLONED_FUNCTION (fn));
2910 probe && DECL_CLONED_FUNCTION_P (probe);
2911 probe = TREE_CHAIN (probe))
2915 for (parms = DECL_ARGUMENTS (probe);
2916 parms; parms = TREE_CHAIN (parms))
2917 TREE_USED (parms) = 1;
2922 /* Generate RTL for FN. */
2925 expand_or_defer_fn (tree fn)
2927 /* When the parser calls us after finishing the body of a template
2928 function, we don't really want to expand the body. */
2929 if (processing_template_decl)
2931 /* Normally, collection only occurs in rest_of_compilation. So,
2932 if we don't collect here, we never collect junk generated
2933 during the processing of templates until we hit a
2934 non-template function. */
2939 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
2940 walk_tree_without_duplicates (&DECL_SAVED_TREE (fn),
2941 simplify_aggr_init_exprs_r,
2944 /* If this is a constructor or destructor body, we have to clone
2946 if (maybe_clone_body (fn))
2948 /* We don't want to process FN again, so pretend we've written
2949 it out, even though we haven't. */
2950 TREE_ASM_WRITTEN (fn) = 1;
2954 /* If this function is marked with the constructor attribute, add it
2955 to the list of functions to be called along with constructors
2956 from static duration objects. */
2957 if (DECL_STATIC_CONSTRUCTOR (fn))
2958 static_ctors = tree_cons (NULL_TREE, fn, static_ctors);
2960 /* If this function is marked with the destructor attribute, add it
2961 to the list of functions to be called along with destructors from
2962 static duration objects. */
2963 if (DECL_STATIC_DESTRUCTOR (fn))
2964 static_dtors = tree_cons (NULL_TREE, fn, static_dtors);
2966 /* We make a decision about linkage for these functions at the end
2967 of the compilation. Until that point, we do not want the back
2968 end to output them -- but we do want it to see the bodies of
2969 these functions so that it can inline them as appropriate. */
2970 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
2974 DECL_EXTERNAL (fn) = 1;
2975 DECL_NOT_REALLY_EXTERN (fn) = 1;
2976 note_vague_linkage_fn (fn);
2979 import_export_decl (fn);
2981 /* If the user wants us to keep all inline functions, then mark
2982 this function as needed so that finish_file will make sure to
2984 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
2988 /* There's no reason to do any of the work here if we're only doing
2989 semantic analysis; this code just generates RTL. */
2990 if (flag_syntax_only)
2995 /* Expand or defer, at the whim of the compilation unit manager. */
2996 cgraph_finalize_function (fn, function_depth > 1);
3008 /* Helper function for walk_tree, used by finalize_nrv below. */
3011 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3013 struct nrv_data *dp = (struct nrv_data *)data;
3016 /* No need to walk into types. There wouldn't be any need to walk into
3017 non-statements, except that we have to consider STMT_EXPRs. */
3020 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3021 but differs from using NULL_TREE in that it indicates that we care
3022 about the value of the RESULT_DECL. */
3023 else if (TREE_CODE (*tp) == RETURN_EXPR)
3024 TREE_OPERAND (*tp, 0) = dp->result;
3025 /* Change all cleanups for the NRV to only run when an exception is
3027 else if (TREE_CODE (*tp) == CLEANUP_STMT
3028 && CLEANUP_DECL (*tp) == dp->var)
3029 CLEANUP_EH_ONLY (*tp) = 1;
3030 /* Replace the DECL_EXPR for the NRV with an initialization of the
3031 RESULT_DECL, if needed. */
3032 else if (TREE_CODE (*tp) == DECL_EXPR
3033 && DECL_EXPR_DECL (*tp) == dp->var)
3036 if (DECL_INITIAL (dp->var)
3037 && DECL_INITIAL (dp->var) != error_mark_node)
3039 init = build2 (INIT_EXPR, void_type_node, dp->result,
3040 DECL_INITIAL (dp->var));
3041 DECL_INITIAL (dp->var) = error_mark_node;
3044 init = build_empty_stmt ();
3045 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3048 /* And replace all uses of the NRV with the RESULT_DECL. */
3049 else if (*tp == dp->var)
3052 /* Avoid walking into the same tree more than once. Unfortunately, we
3053 can't just use walk_tree_without duplicates because it would only call
3054 us for the first occurrence of dp->var in the function body. */
3055 slot = htab_find_slot (dp->visited, *tp, INSERT);
3061 /* Keep iterating. */
3065 /* Called from finish_function to implement the named return value
3066 optimization by overriding all the RETURN_EXPRs and pertinent
3067 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3068 RESULT_DECL for the function. */
3071 finalize_nrv (tree *tp, tree var, tree result)
3073 struct nrv_data data;
3075 /* Copy debugging information from VAR to RESULT. */
3076 DECL_NAME (result) = DECL_NAME (var);
3077 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3078 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3079 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3080 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3081 /* Don't forget that we take its address. */
3082 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3085 data.result = result;
3086 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3087 walk_tree (tp, finalize_nrv_r, &data, 0);
3088 htab_delete (data.visited);
3091 /* Perform initialization related to this module. */
3094 init_cp_semantics (void)
3098 #include "gt-cp-semantics.h"