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 = fold_build_cleanup_point_expr (TREE_TYPE (expr), expr);
365 /* Like maybe_cleanup_point_expr except have the type of the new expression be
366 void so we don't need to create a temprary variable to hold the inner
367 expression. The reason why we do this is because the orginal type might be
368 an aggregate and we cannot create a temprary variable for that type. */
371 maybe_cleanup_point_expr_void (tree expr)
373 if (!processing_template_decl && stmts_are_full_exprs_p ())
374 expr = fold_build_cleanup_point_expr (void_type_node, expr);
380 /* Create a declaration statement for the declaration given by the DECL. */
383 add_decl_expr (tree decl)
385 tree r = build_stmt (DECL_EXPR, decl);
386 if (DECL_INITIAL (decl)
387 || (DECL_SIZE (decl) && TREE_SIDE_EFFECTS (DECL_SIZE (decl))))
388 r = maybe_cleanup_point_expr_void (r);
392 /* Nonzero if TYPE is an anonymous union or struct type. We have to use a
393 flag for this because "A union for which objects or pointers are
394 declared is not an anonymous union" [class.union]. */
397 anon_aggr_type_p (tree node)
399 return ANON_AGGR_TYPE_P (node);
402 /* Finish a scope. */
405 do_poplevel (tree stmt_list)
409 if (stmts_are_full_exprs_p ())
410 block = poplevel (kept_level_p (), 1, 0);
412 stmt_list = pop_stmt_list (stmt_list);
414 if (!processing_template_decl)
416 stmt_list = c_build_bind_expr (block, stmt_list);
417 /* ??? See c_end_compound_stmt re statement expressions. */
423 /* Begin a new scope. */
426 do_pushlevel (scope_kind sk)
428 tree ret = push_stmt_list ();
429 if (stmts_are_full_exprs_p ())
430 begin_scope (sk, NULL);
434 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
435 when the current scope is exited. EH_ONLY is true when this is not
436 meant to apply to normal control flow transfer. */
439 push_cleanup (tree decl, tree cleanup, bool eh_only)
441 tree stmt = build_stmt (CLEANUP_STMT, NULL, cleanup, decl);
442 CLEANUP_EH_ONLY (stmt) = eh_only;
444 CLEANUP_BODY (stmt) = push_stmt_list ();
447 /* Begin a conditional that might contain a declaration. When generating
448 normal code, we want the declaration to appear before the statement
449 containing the conditional. When generating template code, we want the
450 conditional to be rendered as the raw DECL_EXPR. */
453 begin_cond (tree *cond_p)
455 if (processing_template_decl)
456 *cond_p = push_stmt_list ();
459 /* Finish such a conditional. */
462 finish_cond (tree *cond_p, tree expr)
464 if (processing_template_decl)
466 tree cond = pop_stmt_list (*cond_p);
467 if (TREE_CODE (cond) == DECL_EXPR)
473 /* If *COND_P specifies a conditional with a declaration, transform the
476 for (; A x = 42;) { }
478 while (true) { A x = 42; if (!x) break; }
479 for (;;) { A x = 42; if (!x) break; }
480 The statement list for BODY will be empty if the conditional did
481 not declare anything. */
484 simplify_loop_decl_cond (tree *cond_p, tree body)
488 if (!TREE_SIDE_EFFECTS (body))
492 *cond_p = boolean_true_node;
494 if_stmt = begin_if_stmt ();
495 cond = build_unary_op (TRUTH_NOT_EXPR, cond, 0);
496 finish_if_stmt_cond (cond, if_stmt);
497 finish_break_stmt ();
498 finish_then_clause (if_stmt);
499 finish_if_stmt (if_stmt);
502 /* Finish a goto-statement. */
505 finish_goto_stmt (tree destination)
507 if (TREE_CODE (destination) == IDENTIFIER_NODE)
508 destination = lookup_label (destination);
510 /* We warn about unused labels with -Wunused. That means we have to
511 mark the used labels as used. */
512 if (TREE_CODE (destination) == LABEL_DECL)
513 TREE_USED (destination) = 1;
516 /* The DESTINATION is being used as an rvalue. */
517 if (!processing_template_decl)
518 destination = decay_conversion (destination);
519 /* We don't inline calls to functions with computed gotos.
520 Those functions are typically up to some funny business,
521 and may be depending on the labels being at particular
522 addresses, or some such. */
523 DECL_UNINLINABLE (current_function_decl) = 1;
526 check_goto (destination);
528 return add_stmt (build_stmt (GOTO_EXPR, destination));
531 /* COND is the condition-expression for an if, while, etc.,
532 statement. Convert it to a boolean value, if appropriate. */
535 maybe_convert_cond (tree cond)
537 /* Empty conditions remain empty. */
541 /* Wait until we instantiate templates before doing conversion. */
542 if (processing_template_decl)
545 /* Do the conversion. */
546 cond = convert_from_reference (cond);
547 return condition_conversion (cond);
550 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
553 finish_expr_stmt (tree expr)
557 if (expr != NULL_TREE)
559 if (!processing_template_decl)
561 if (warn_sequence_point)
562 verify_sequence_points (expr);
563 expr = convert_to_void (expr, "statement");
565 else if (!type_dependent_expression_p (expr))
566 convert_to_void (build_non_dependent_expr (expr), "statement");
568 /* Simplification of inner statement expressions, compound exprs,
569 etc can result in the us already having an EXPR_STMT. */
570 if (TREE_CODE (expr) != CLEANUP_POINT_EXPR)
572 if (TREE_CODE (expr) != EXPR_STMT)
573 expr = build_stmt (EXPR_STMT, expr);
574 expr = maybe_cleanup_point_expr_void (expr);
586 /* Begin an if-statement. Returns a newly created IF_STMT if
593 scope = do_pushlevel (sk_block);
594 r = build_stmt (IF_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
595 TREE_CHAIN (r) = scope;
596 begin_cond (&IF_COND (r));
600 /* Process the COND of an if-statement, which may be given by
604 finish_if_stmt_cond (tree cond, tree if_stmt)
606 finish_cond (&IF_COND (if_stmt), maybe_convert_cond (cond));
608 THEN_CLAUSE (if_stmt) = push_stmt_list ();
611 /* Finish the then-clause of an if-statement, which may be given by
615 finish_then_clause (tree if_stmt)
617 THEN_CLAUSE (if_stmt) = pop_stmt_list (THEN_CLAUSE (if_stmt));
621 /* Begin the else-clause of an if-statement. */
624 begin_else_clause (tree if_stmt)
626 ELSE_CLAUSE (if_stmt) = push_stmt_list ();
629 /* Finish the else-clause of an if-statement, which may be given by
633 finish_else_clause (tree if_stmt)
635 ELSE_CLAUSE (if_stmt) = pop_stmt_list (ELSE_CLAUSE (if_stmt));
638 /* Finish an if-statement. */
641 finish_if_stmt (tree if_stmt)
643 tree scope = TREE_CHAIN (if_stmt);
644 TREE_CHAIN (if_stmt) = NULL;
645 add_stmt (do_poplevel (scope));
649 /* Begin a while-statement. Returns a newly created WHILE_STMT if
653 begin_while_stmt (void)
656 r = build_stmt (WHILE_STMT, NULL_TREE, NULL_TREE);
658 WHILE_BODY (r) = do_pushlevel (sk_block);
659 begin_cond (&WHILE_COND (r));
663 /* Process the COND of a while-statement, which may be given by
667 finish_while_stmt_cond (tree cond, tree while_stmt)
669 finish_cond (&WHILE_COND (while_stmt), maybe_convert_cond (cond));
670 simplify_loop_decl_cond (&WHILE_COND (while_stmt), WHILE_BODY (while_stmt));
673 /* Finish a while-statement, which may be given by WHILE_STMT. */
676 finish_while_stmt (tree while_stmt)
678 WHILE_BODY (while_stmt) = do_poplevel (WHILE_BODY (while_stmt));
682 /* Begin a do-statement. Returns a newly created DO_STMT if
688 tree r = build_stmt (DO_STMT, NULL_TREE, NULL_TREE);
690 DO_BODY (r) = push_stmt_list ();
694 /* Finish the body of a do-statement, which may be given by DO_STMT. */
697 finish_do_body (tree do_stmt)
699 DO_BODY (do_stmt) = pop_stmt_list (DO_BODY (do_stmt));
702 /* Finish a do-statement, which may be given by DO_STMT, and whose
703 COND is as indicated. */
706 finish_do_stmt (tree cond, tree do_stmt)
708 cond = maybe_convert_cond (cond);
709 DO_COND (do_stmt) = cond;
713 /* Finish a return-statement. The EXPRESSION returned, if any, is as
717 finish_return_stmt (tree expr)
721 expr = check_return_expr (expr);
722 if (!processing_template_decl)
724 if (DECL_DESTRUCTOR_P (current_function_decl)
725 || (DECL_CONSTRUCTOR_P (current_function_decl)
726 && targetm.cxx.cdtor_returns_this ()))
728 /* Similarly, all destructors must run destructors for
729 base-classes before returning. So, all returns in a
730 destructor get sent to the DTOR_LABEL; finish_function emits
731 code to return a value there. */
732 return finish_goto_stmt (cdtor_label);
736 r = build_stmt (RETURN_EXPR, expr);
737 r = maybe_cleanup_point_expr_void (r);
744 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
747 begin_for_stmt (void)
751 r = build_stmt (FOR_STMT, NULL_TREE, NULL_TREE,
752 NULL_TREE, NULL_TREE);
754 if (flag_new_for_scope > 0)
755 TREE_CHAIN (r) = do_pushlevel (sk_for);
757 if (processing_template_decl)
758 FOR_INIT_STMT (r) = push_stmt_list ();
763 /* Finish the for-init-statement of a for-statement, which may be
764 given by FOR_STMT. */
767 finish_for_init_stmt (tree for_stmt)
769 if (processing_template_decl)
770 FOR_INIT_STMT (for_stmt) = pop_stmt_list (FOR_INIT_STMT (for_stmt));
772 FOR_BODY (for_stmt) = do_pushlevel (sk_block);
773 begin_cond (&FOR_COND (for_stmt));
776 /* Finish the COND of a for-statement, which may be given by
780 finish_for_cond (tree cond, tree for_stmt)
782 finish_cond (&FOR_COND (for_stmt), maybe_convert_cond (cond));
783 simplify_loop_decl_cond (&FOR_COND (for_stmt), FOR_BODY (for_stmt));
786 /* Finish the increment-EXPRESSION in a for-statement, which may be
787 given by FOR_STMT. */
790 finish_for_expr (tree expr, tree for_stmt)
794 /* If EXPR is an overloaded function, issue an error; there is no
795 context available to use to perform overload resolution. */
796 if (type_unknown_p (expr))
798 cxx_incomplete_type_error (expr, TREE_TYPE (expr));
799 expr = error_mark_node;
801 expr = maybe_cleanup_point_expr_void (expr);
802 FOR_EXPR (for_stmt) = expr;
805 /* Finish the body of a for-statement, which may be given by
806 FOR_STMT. The increment-EXPR for the loop must be
810 finish_for_stmt (tree for_stmt)
812 FOR_BODY (for_stmt) = do_poplevel (FOR_BODY (for_stmt));
814 /* Pop the scope for the body of the loop. */
815 if (flag_new_for_scope > 0)
817 tree scope = TREE_CHAIN (for_stmt);
818 TREE_CHAIN (for_stmt) = NULL;
819 add_stmt (do_poplevel (scope));
825 /* Finish a break-statement. */
828 finish_break_stmt (void)
830 return add_stmt (build_break_stmt ());
833 /* Finish a continue-statement. */
836 finish_continue_stmt (void)
838 return add_stmt (build_continue_stmt ());
841 /* Begin a switch-statement. Returns a new SWITCH_STMT if
845 begin_switch_stmt (void)
849 r = build_stmt (SWITCH_STMT, NULL_TREE, NULL_TREE, NULL_TREE);
851 scope = do_pushlevel (sk_block);
852 TREE_CHAIN (r) = scope;
853 begin_cond (&SWITCH_COND (r));
858 /* Finish the cond of a switch-statement. */
861 finish_switch_cond (tree cond, tree switch_stmt)
863 tree orig_type = NULL;
864 if (!processing_template_decl)
868 /* Convert the condition to an integer or enumeration type. */
869 cond = build_expr_type_conversion (WANT_INT | WANT_ENUM, cond, true);
870 if (cond == NULL_TREE)
872 error ("switch quantity not an integer");
873 cond = error_mark_node;
875 orig_type = TREE_TYPE (cond);
876 if (cond != error_mark_node)
880 Integral promotions are performed. */
881 cond = perform_integral_promotions (cond);
882 cond = maybe_cleanup_point_expr (cond);
885 if (cond != error_mark_node)
887 index = get_unwidened (cond, NULL_TREE);
888 /* We can't strip a conversion from a signed type to an unsigned,
889 because if we did, int_fits_type_p would do the wrong thing
890 when checking case values for being in range,
891 and it's too hard to do the right thing. */
892 if (TYPE_UNSIGNED (TREE_TYPE (cond))
893 == TYPE_UNSIGNED (TREE_TYPE (index)))
897 finish_cond (&SWITCH_COND (switch_stmt), cond);
898 SWITCH_TYPE (switch_stmt) = orig_type;
899 add_stmt (switch_stmt);
900 push_switch (switch_stmt);
901 SWITCH_BODY (switch_stmt) = push_stmt_list ();
904 /* Finish the body of a switch-statement, which may be given by
905 SWITCH_STMT. The COND to switch on is indicated. */
908 finish_switch_stmt (tree switch_stmt)
912 SWITCH_BODY (switch_stmt) = pop_stmt_list (SWITCH_BODY (switch_stmt));
916 scope = TREE_CHAIN (switch_stmt);
917 TREE_CHAIN (switch_stmt) = NULL;
918 add_stmt (do_poplevel (scope));
921 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
925 begin_try_block (void)
927 tree r = build_stmt (TRY_BLOCK, NULL_TREE, NULL_TREE);
929 TRY_STMTS (r) = push_stmt_list ();
933 /* Likewise, for a function-try-block. */
936 begin_function_try_block (void)
938 tree r = begin_try_block ();
939 FN_TRY_BLOCK_P (r) = 1;
943 /* Finish a try-block, which may be given by TRY_BLOCK. */
946 finish_try_block (tree try_block)
948 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
949 TRY_HANDLERS (try_block) = push_stmt_list ();
952 /* Finish the body of a cleanup try-block, which may be given by
956 finish_cleanup_try_block (tree try_block)
958 TRY_STMTS (try_block) = pop_stmt_list (TRY_STMTS (try_block));
961 /* Finish an implicitly generated try-block, with a cleanup is given
965 finish_cleanup (tree cleanup, tree try_block)
967 TRY_HANDLERS (try_block) = cleanup;
968 CLEANUP_P (try_block) = 1;
971 /* Likewise, for a function-try-block. */
974 finish_function_try_block (tree try_block)
976 finish_try_block (try_block);
977 /* FIXME : something queer about CTOR_INITIALIZER somehow following
978 the try block, but moving it inside. */
979 in_function_try_handler = 1;
982 /* Finish a handler-sequence for a try-block, which may be given by
986 finish_handler_sequence (tree try_block)
988 TRY_HANDLERS (try_block) = pop_stmt_list (TRY_HANDLERS (try_block));
989 check_handlers (TRY_HANDLERS (try_block));
992 /* Likewise, for a function-try-block. */
995 finish_function_handler_sequence (tree try_block)
997 in_function_try_handler = 0;
998 finish_handler_sequence (try_block);
1001 /* Begin a handler. Returns a HANDLER if appropriate. */
1004 begin_handler (void)
1008 r = build_stmt (HANDLER, NULL_TREE, NULL_TREE);
1011 /* Create a binding level for the eh_info and the exception object
1013 HANDLER_BODY (r) = do_pushlevel (sk_catch);
1018 /* Finish the handler-parameters for a handler, which may be given by
1019 HANDLER. DECL is the declaration for the catch parameter, or NULL
1020 if this is a `catch (...)' clause. */
1023 finish_handler_parms (tree decl, tree handler)
1025 tree type = NULL_TREE;
1026 if (processing_template_decl)
1030 decl = pushdecl (decl);
1031 decl = push_template_decl (decl);
1032 HANDLER_PARMS (handler) = decl;
1033 type = TREE_TYPE (decl);
1037 type = expand_start_catch_block (decl);
1039 HANDLER_TYPE (handler) = type;
1040 if (!processing_template_decl && type)
1041 mark_used (eh_type_info (type));
1044 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1045 the return value from the matching call to finish_handler_parms. */
1048 finish_handler (tree handler)
1050 if (!processing_template_decl)
1051 expand_end_catch_block ();
1052 HANDLER_BODY (handler) = do_poplevel (HANDLER_BODY (handler));
1055 /* Begin a compound statement. FLAGS contains some bits that control the
1056 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1057 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1058 block of a function. If BCS_TRY_BLOCK is set, this is the block
1059 created on behalf of a TRY statement. Returns a token to be passed to
1060 finish_compound_stmt. */
1063 begin_compound_stmt (unsigned int flags)
1067 if (flags & BCS_NO_SCOPE)
1069 r = push_stmt_list ();
1070 STATEMENT_LIST_NO_SCOPE (r) = 1;
1072 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1073 But, if it's a statement-expression with a scopeless block, there's
1074 nothing to keep, and we don't want to accidentally keep a block
1075 *inside* the scopeless block. */
1076 keep_next_level (false);
1079 r = do_pushlevel (flags & BCS_TRY_BLOCK ? sk_try : sk_block);
1081 /* When processing a template, we need to remember where the braces were,
1082 so that we can set up identical scopes when instantiating the template
1083 later. BIND_EXPR is a handy candidate for this.
1084 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1085 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1086 processing templates. */
1087 if (processing_template_decl)
1089 r = build3 (BIND_EXPR, NULL, NULL, r, NULL);
1090 BIND_EXPR_TRY_BLOCK (r) = (flags & BCS_TRY_BLOCK) != 0;
1091 BIND_EXPR_BODY_BLOCK (r) = (flags & BCS_FN_BODY) != 0;
1092 TREE_SIDE_EFFECTS (r) = 1;
1098 /* Finish a compound-statement, which is given by STMT. */
1101 finish_compound_stmt (tree stmt)
1103 if (TREE_CODE (stmt) == BIND_EXPR)
1104 BIND_EXPR_BODY (stmt) = do_poplevel (BIND_EXPR_BODY (stmt));
1105 else if (STATEMENT_LIST_NO_SCOPE (stmt))
1106 stmt = pop_stmt_list (stmt);
1109 /* Destroy any ObjC "super" receivers that may have been
1111 objc_clear_super_receiver ();
1113 stmt = do_poplevel (stmt);
1116 /* ??? See c_end_compound_stmt wrt statement expressions. */
1121 /* Finish an asm-statement, whose components are a STRING, some
1122 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1123 whether the asm-statement should be considered volatile. */
1126 finish_asm_stmt (int volatile_p, tree string, tree output_operands,
1127 tree input_operands, tree clobbers)
1132 if (!processing_template_decl)
1138 for (t = input_operands; t; t = TREE_CHAIN (t))
1140 tree converted_operand
1141 = decay_conversion (TREE_VALUE (t));
1143 /* If the type of the operand hasn't been determined (e.g.,
1144 because it involves an overloaded function), then issue
1145 an error message. There's no context available to
1146 resolve the overloading. */
1147 if (TREE_TYPE (converted_operand) == unknown_type_node)
1149 error ("type of asm operand %qE could not be determined",
1151 converted_operand = error_mark_node;
1153 TREE_VALUE (t) = converted_operand;
1156 ninputs = list_length (input_operands);
1157 noutputs = list_length (output_operands);
1159 for (i = 0, t = output_operands; t; t = TREE_CHAIN (t), ++i)
1164 const char *constraint;
1167 constraint = TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t)));
1168 operand = TREE_VALUE (t);
1170 if (!parse_output_constraint (&constraint,
1171 i, ninputs, noutputs,
1176 /* By marking this operand as erroneous, we will not try
1177 to process this operand again in expand_asm_operands. */
1178 TREE_VALUE (t) = error_mark_node;
1182 /* If the operand is a DECL that is going to end up in
1183 memory, assume it is addressable. This is a bit more
1184 conservative than it would ideally be; the exact test is
1185 buried deep in expand_asm_operands and depends on the
1186 DECL_RTL for the OPERAND -- which we don't have at this
1188 if (!allows_reg && DECL_P (operand))
1189 cxx_mark_addressable (operand);
1193 r = build_stmt (ASM_EXPR, string,
1194 output_operands, input_operands,
1196 ASM_VOLATILE_P (r) = volatile_p;
1197 r = maybe_cleanup_point_expr_void (r);
1198 return add_stmt (r);
1201 /* Finish a label with the indicated NAME. */
1204 finish_label_stmt (tree name)
1206 tree decl = define_label (input_location, name);
1207 return add_stmt (build_stmt (LABEL_EXPR, decl));
1210 /* Finish a series of declarations for local labels. G++ allows users
1211 to declare "local" labels, i.e., labels with scope. This extension
1212 is useful when writing code involving statement-expressions. */
1215 finish_label_decl (tree name)
1217 tree decl = declare_local_label (name);
1218 add_decl_expr (decl);
1221 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1224 finish_decl_cleanup (tree decl, tree cleanup)
1226 push_cleanup (decl, cleanup, false);
1229 /* If the current scope exits with an exception, run CLEANUP. */
1232 finish_eh_cleanup (tree cleanup)
1234 push_cleanup (NULL, cleanup, true);
1237 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1238 order they were written by the user. Each node is as for
1239 emit_mem_initializers. */
1242 finish_mem_initializers (tree mem_inits)
1244 /* Reorder the MEM_INITS so that they are in the order they appeared
1245 in the source program. */
1246 mem_inits = nreverse (mem_inits);
1248 if (processing_template_decl)
1249 add_stmt (build_min_nt (CTOR_INITIALIZER, mem_inits));
1251 emit_mem_initializers (mem_inits);
1254 /* Finish a parenthesized expression EXPR. */
1257 finish_parenthesized_expr (tree expr)
1260 /* This inhibits warnings in c_common_truthvalue_conversion. */
1261 TREE_NO_WARNING (expr) = 1;
1263 if (TREE_CODE (expr) == OFFSET_REF)
1264 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1265 enclosed in parentheses. */
1266 PTRMEM_OK_P (expr) = 0;
1270 /* Finish a reference to a non-static data member (DECL) that is not
1271 preceded by `.' or `->'. */
1274 finish_non_static_data_member (tree decl, tree object, tree qualifying_scope)
1276 gcc_assert (TREE_CODE (decl) == FIELD_DECL);
1280 if (current_function_decl
1281 && DECL_STATIC_FUNCTION_P (current_function_decl))
1282 cp_error_at ("invalid use of member %qD in static member function",
1285 cp_error_at ("invalid use of non-static data member %qD", decl);
1286 error ("from this location");
1288 return error_mark_node;
1290 TREE_USED (current_class_ptr) = 1;
1291 if (processing_template_decl && !qualifying_scope)
1293 tree type = TREE_TYPE (decl);
1295 if (TREE_CODE (type) == REFERENCE_TYPE)
1296 type = TREE_TYPE (type);
1299 /* Set the cv qualifiers. */
1300 int quals = cp_type_quals (TREE_TYPE (current_class_ref));
1302 if (DECL_MUTABLE_P (decl))
1303 quals &= ~TYPE_QUAL_CONST;
1305 quals |= cp_type_quals (TREE_TYPE (decl));
1306 type = cp_build_qualified_type (type, quals);
1309 return build_min (COMPONENT_REF, type, object, decl, NULL_TREE);
1313 tree access_type = TREE_TYPE (object);
1314 tree lookup_context = context_for_name_lookup (decl);
1316 while (!DERIVED_FROM_P (lookup_context, access_type))
1318 access_type = TYPE_CONTEXT (access_type);
1319 while (access_type && DECL_P (access_type))
1320 access_type = DECL_CONTEXT (access_type);
1324 cp_error_at ("object missing in reference to %qD", decl);
1325 error ("from this location");
1326 return error_mark_node;
1330 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1331 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1333 if (processing_template_decl)
1334 return build_min (SCOPE_REF, TREE_TYPE (decl),
1335 qualifying_scope, DECL_NAME (decl));
1337 perform_or_defer_access_check (TYPE_BINFO (access_type), decl);
1339 /* If the data member was named `C::M', convert `*this' to `C'
1341 if (qualifying_scope)
1343 tree binfo = NULL_TREE;
1344 object = build_scoped_ref (object, qualifying_scope,
1348 return build_class_member_access_expr (object, decl,
1349 /*access_path=*/NULL_TREE,
1350 /*preserve_reference=*/false);
1354 /* DECL was the declaration to which a qualified-id resolved. Issue
1355 an error message if it is not accessible. If OBJECT_TYPE is
1356 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1357 type of `*x', or `x', respectively. If the DECL was named as
1358 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1361 check_accessibility_of_qualified_id (tree decl,
1363 tree nested_name_specifier)
1366 tree qualifying_type = NULL_TREE;
1368 /* If we're not checking, return immediately. */
1369 if (deferred_access_no_check)
1372 /* Determine the SCOPE of DECL. */
1373 scope = context_for_name_lookup (decl);
1374 /* If the SCOPE is not a type, then DECL is not a member. */
1375 if (!TYPE_P (scope))
1377 /* Compute the scope through which DECL is being accessed. */
1379 /* OBJECT_TYPE might not be a class type; consider:
1381 class A { typedef int I; };
1385 In this case, we will have "A::I" as the DECL, but "I" as the
1387 && CLASS_TYPE_P (object_type)
1388 && DERIVED_FROM_P (scope, object_type))
1389 /* If we are processing a `->' or `.' expression, use the type of the
1391 qualifying_type = object_type;
1392 else if (nested_name_specifier)
1394 /* If the reference is to a non-static member of the
1395 current class, treat it as if it were referenced through
1397 if (DECL_NONSTATIC_MEMBER_P (decl)
1398 && current_class_ptr
1399 && DERIVED_FROM_P (scope, current_class_type))
1400 qualifying_type = current_class_type;
1401 /* Otherwise, use the type indicated by the
1402 nested-name-specifier. */
1404 qualifying_type = nested_name_specifier;
1407 /* Otherwise, the name must be from the current class or one of
1409 qualifying_type = currently_open_derived_class (scope);
1411 if (qualifying_type && IS_AGGR_TYPE_CODE (TREE_CODE (qualifying_type)))
1412 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1413 or similar in a default argument value. */
1414 perform_or_defer_access_check (TYPE_BINFO (qualifying_type), decl);
1417 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1418 class named to the left of the "::" operator. DONE is true if this
1419 expression is a complete postfix-expression; it is false if this
1420 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1421 iff this expression is the operand of '&'. */
1424 finish_qualified_id_expr (tree qualifying_class, tree expr, bool done,
1427 if (error_operand_p (expr))
1428 return error_mark_node;
1430 /* If EXPR occurs as the operand of '&', use special handling that
1431 permits a pointer-to-member. */
1432 if (address_p && done)
1434 if (TREE_CODE (expr) == SCOPE_REF)
1435 expr = TREE_OPERAND (expr, 1);
1436 expr = build_offset_ref (qualifying_class, expr,
1437 /*address_p=*/true);
1441 if (TREE_CODE (expr) == FIELD_DECL)
1442 expr = finish_non_static_data_member (expr, current_class_ref,
1444 else if (BASELINK_P (expr) && !processing_template_decl)
1448 /* See if any of the functions are non-static members. */
1449 fns = BASELINK_FUNCTIONS (expr);
1450 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
1451 fns = TREE_OPERAND (fns, 0);
1452 /* If so, the expression may be relative to the current
1454 if (!shared_member_p (fns)
1455 && current_class_type
1456 && DERIVED_FROM_P (qualifying_class, current_class_type))
1457 expr = (build_class_member_access_expr
1458 (maybe_dummy_object (qualifying_class, NULL),
1460 BASELINK_ACCESS_BINFO (expr),
1461 /*preserve_reference=*/false));
1463 /* The expression is a qualified name whose address is not
1465 expr = build_offset_ref (qualifying_class, expr, /*address_p=*/false);
1471 /* Begin a statement-expression. The value returned must be passed to
1472 finish_stmt_expr. */
1475 begin_stmt_expr (void)
1477 return push_stmt_list ();
1480 /* Process the final expression of a statement expression. EXPR can be
1481 NULL, if the final expression is empty. Build up a TARGET_EXPR so
1482 that the result value can be safely returned to the enclosing
1486 finish_stmt_expr_expr (tree expr, tree stmt_expr)
1488 tree result = NULL_TREE;
1492 if (!processing_template_decl && !VOID_TYPE_P (TREE_TYPE (expr)))
1494 tree type = TREE_TYPE (expr);
1496 if (TREE_CODE (type) == ARRAY_TYPE
1497 || TREE_CODE (type) == FUNCTION_TYPE)
1498 expr = decay_conversion (expr);
1500 expr = convert_from_reference (expr);
1501 expr = require_complete_type (expr);
1503 type = TREE_TYPE (expr);
1505 /* Build a TARGET_EXPR for this aggregate. finish_stmt_expr
1506 will then pull it apart so the lifetime of the target is
1507 within the scope of the expression containing this statement
1509 if (TREE_CODE (expr) == TARGET_EXPR)
1511 else if (!IS_AGGR_TYPE (type) || TYPE_HAS_TRIVIAL_INIT_REF (type))
1512 expr = build_target_expr_with_type (expr, type);
1515 /* Copy construct. */
1516 expr = build_special_member_call
1517 (NULL_TREE, complete_ctor_identifier,
1518 build_tree_list (NULL_TREE, expr),
1519 type, LOOKUP_NORMAL);
1520 expr = build_cplus_new (type, expr);
1521 gcc_assert (TREE_CODE (expr) == TARGET_EXPR);
1525 if (expr != error_mark_node)
1527 result = build_stmt (EXPR_STMT, expr);
1528 EXPR_STMT_STMT_EXPR_RESULT (result) = 1;
1535 /* Remember the last expression so that finish_stmt_expr
1536 can pull it apart. */
1537 TREE_TYPE (stmt_expr) = result;
1542 /* Finish a statement-expression. EXPR should be the value returned
1543 by the previous begin_stmt_expr. Returns an expression
1544 representing the statement-expression. */
1547 finish_stmt_expr (tree stmt_expr, bool has_no_scope)
1549 tree result, result_stmt, type;
1550 tree *result_stmt_p = NULL;
1552 result_stmt = TREE_TYPE (stmt_expr);
1553 TREE_TYPE (stmt_expr) = void_type_node;
1554 result = pop_stmt_list (stmt_expr);
1556 if (!result_stmt || VOID_TYPE_P (result_stmt))
1557 type = void_type_node;
1560 /* We need to search the statement expression for the result_stmt,
1561 since we'll need to replace it entirely. */
1563 result_stmt_p = &result;
1567 if (t == result_stmt)
1570 switch (TREE_CODE (t))
1572 case STATEMENT_LIST:
1574 tree_stmt_iterator i = tsi_last (t);
1575 result_stmt_p = tsi_stmt_ptr (i);
1579 result_stmt_p = &BIND_EXPR_BODY (t);
1581 case TRY_FINALLY_EXPR:
1582 case TRY_CATCH_EXPR:
1584 result_stmt_p = &TREE_OPERAND (t, 0);
1590 type = TREE_TYPE (EXPR_STMT_EXPR (result_stmt));
1593 if (processing_template_decl)
1595 result = build_min (STMT_EXPR, type, result);
1596 TREE_SIDE_EFFECTS (result) = 1;
1597 STMT_EXPR_NO_SCOPE (result) = has_no_scope;
1599 else if (!VOID_TYPE_P (type))
1601 /* Pull out the TARGET_EXPR that is the final expression. Put
1602 the target's init_expr as the final expression and then put
1603 the statement expression itself as the target's init
1604 expr. Finally, return the target expression. */
1605 tree init, target_expr = EXPR_STMT_EXPR (result_stmt);
1606 gcc_assert (TREE_CODE (target_expr) == TARGET_EXPR);
1608 /* The initializer will be void if the initialization is done by
1609 AGGR_INIT_EXPR; propagate that out to the statement-expression as
1611 init = TREE_OPERAND (target_expr, 1);
1612 type = TREE_TYPE (init);
1614 init = maybe_cleanup_point_expr (init);
1615 *result_stmt_p = init;
1617 if (VOID_TYPE_P (type))
1618 /* No frobbing needed. */;
1619 else if (TREE_CODE (result) == BIND_EXPR)
1621 /* The BIND_EXPR created in finish_compound_stmt is void; if we're
1622 returning a value directly, give it the appropriate type. */
1623 if (VOID_TYPE_P (TREE_TYPE (result)))
1624 TREE_TYPE (result) = type;
1626 gcc_assert (same_type_p (TREE_TYPE (result), type));
1628 else if (TREE_CODE (result) == STATEMENT_LIST)
1629 /* We need to wrap a STATEMENT_LIST in a BIND_EXPR so it can have a
1630 type other than void. FIXME why can't we just return a value
1631 from STATEMENT_LIST? */
1632 result = build3 (BIND_EXPR, type, NULL, result, NULL);
1634 TREE_OPERAND (target_expr, 1) = result;
1635 result = target_expr;
1641 /* Perform Koenig lookup. FN is the postfix-expression representing
1642 the function (or functions) to call; ARGS are the arguments to the
1643 call. Returns the functions to be considered by overload
1647 perform_koenig_lookup (tree fn, tree args)
1649 tree identifier = NULL_TREE;
1650 tree functions = NULL_TREE;
1652 /* Find the name of the overloaded function. */
1653 if (TREE_CODE (fn) == IDENTIFIER_NODE)
1655 else if (is_overloaded_fn (fn))
1658 identifier = DECL_NAME (get_first_fn (functions));
1660 else if (DECL_P (fn))
1663 identifier = DECL_NAME (fn);
1666 /* A call to a namespace-scope function using an unqualified name.
1668 Do Koenig lookup -- unless any of the arguments are
1670 if (!any_type_dependent_arguments_p (args))
1672 fn = lookup_arg_dependent (identifier, functions, args);
1674 /* The unqualified name could not be resolved. */
1675 fn = unqualified_fn_lookup_error (identifier);
1683 /* Generate an expression for `FN (ARGS)'.
1685 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1686 as a virtual call, even if FN is virtual. (This flag is set when
1687 encountering an expression where the function name is explicitly
1688 qualified. For example a call to `X::f' never generates a virtual
1691 Returns code for the call. */
1694 finish_call_expr (tree fn, tree args, bool disallow_virtual, bool koenig_p)
1700 if (fn == error_mark_node || args == error_mark_node)
1701 return error_mark_node;
1703 /* ARGS should be a list of arguments. */
1704 gcc_assert (!args || TREE_CODE (args) == TREE_LIST);
1709 if (processing_template_decl)
1711 if (type_dependent_expression_p (fn)
1712 || any_type_dependent_arguments_p (args))
1714 result = build_nt (CALL_EXPR, fn, args, NULL_TREE);
1715 KOENIG_LOOKUP_P (result) = koenig_p;
1718 if (!BASELINK_P (fn)
1719 && TREE_CODE (fn) != PSEUDO_DTOR_EXPR
1720 && TREE_TYPE (fn) != unknown_type_node)
1721 fn = build_non_dependent_expr (fn);
1722 args = build_non_dependent_args (orig_args);
1725 /* A reference to a member function will appear as an overloaded
1726 function (rather than a BASELINK) if an unqualified name was used
1728 if (!BASELINK_P (fn) && is_overloaded_fn (fn))
1732 if (TREE_CODE (f) == TEMPLATE_ID_EXPR)
1733 f = TREE_OPERAND (f, 0);
1734 f = get_first_fn (f);
1735 if (DECL_FUNCTION_MEMBER_P (f))
1737 tree type = currently_open_derived_class (DECL_CONTEXT (f));
1739 type = DECL_CONTEXT (f);
1740 fn = build_baselink (TYPE_BINFO (type),
1742 fn, /*optype=*/NULL_TREE);
1747 if (BASELINK_P (fn))
1751 /* A call to a member function. From [over.call.func]:
1753 If the keyword this is in scope and refers to the class of
1754 that member function, or a derived class thereof, then the
1755 function call is transformed into a qualified function call
1756 using (*this) as the postfix-expression to the left of the
1757 . operator.... [Otherwise] a contrived object of type T
1758 becomes the implied object argument.
1760 This paragraph is unclear about this situation:
1762 struct A { void f(); };
1763 struct B : public A {};
1764 struct C : public A { void g() { B::f(); }};
1766 In particular, for `B::f', this paragraph does not make clear
1767 whether "the class of that member function" refers to `A' or
1768 to `B'. We believe it refers to `B'. */
1769 if (current_class_type
1770 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1772 && current_class_ref)
1773 object = maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn)),
1777 tree representative_fn;
1779 representative_fn = BASELINK_FUNCTIONS (fn);
1780 if (TREE_CODE (representative_fn) == TEMPLATE_ID_EXPR)
1781 representative_fn = TREE_OPERAND (representative_fn, 0);
1782 representative_fn = get_first_fn (representative_fn);
1783 object = build_dummy_object (DECL_CONTEXT (representative_fn));
1786 if (processing_template_decl)
1788 if (type_dependent_expression_p (object))
1789 return build_nt (CALL_EXPR, orig_fn, orig_args, NULL_TREE);
1790 object = build_non_dependent_expr (object);
1793 result = build_new_method_call (object, fn, args, NULL_TREE,
1795 ? LOOKUP_NONVIRTUAL : 0));
1797 else if (is_overloaded_fn (fn))
1798 /* A call to a namespace-scope function. */
1799 result = build_new_function_call (fn, args);
1800 else if (TREE_CODE (fn) == PSEUDO_DTOR_EXPR)
1803 error ("arguments to destructor are not allowed");
1804 /* Mark the pseudo-destructor call as having side-effects so
1805 that we do not issue warnings about its use. */
1806 result = build1 (NOP_EXPR,
1808 TREE_OPERAND (fn, 0));
1809 TREE_SIDE_EFFECTS (result) = 1;
1811 else if (CLASS_TYPE_P (TREE_TYPE (fn)))
1812 /* If the "function" is really an object of class type, it might
1813 have an overloaded `operator ()'. */
1814 result = build_new_op (CALL_EXPR, LOOKUP_NORMAL, fn, args, NULL_TREE,
1815 /*overloaded_p=*/NULL);
1817 /* A call where the function is unknown. */
1818 result = build_function_call (fn, args);
1820 if (processing_template_decl)
1822 result = build3 (CALL_EXPR, TREE_TYPE (result), orig_fn,
1823 orig_args, NULL_TREE);
1824 KOENIG_LOOKUP_P (result) = koenig_p;
1829 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1830 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1831 POSTDECREMENT_EXPR.) */
1834 finish_increment_expr (tree expr, enum tree_code code)
1836 return build_x_unary_op (code, expr);
1839 /* Finish a use of `this'. Returns an expression for `this'. */
1842 finish_this_expr (void)
1846 if (current_class_ptr)
1848 result = current_class_ptr;
1850 else if (current_function_decl
1851 && DECL_STATIC_FUNCTION_P (current_function_decl))
1853 error ("`this' is unavailable for static member functions");
1854 result = error_mark_node;
1858 if (current_function_decl)
1859 error ("invalid use of `this' in non-member function");
1861 error ("invalid use of `this' at top level");
1862 result = error_mark_node;
1868 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
1869 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
1870 the TYPE for the type given. If SCOPE is non-NULL, the expression
1871 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
1874 finish_pseudo_destructor_expr (tree object, tree scope, tree destructor)
1876 if (destructor == error_mark_node)
1877 return error_mark_node;
1879 gcc_assert (TYPE_P (destructor));
1881 if (!processing_template_decl)
1883 if (scope == error_mark_node)
1885 error ("invalid qualifying scope in pseudo-destructor name");
1886 return error_mark_node;
1889 /* [expr.pseudo] says both:
1891 The type designated by the pseudo-destructor-name shall be
1892 the same as the object type.
1896 The cv-unqualified versions of the object type and of the
1897 type designated by the pseudo-destructor-name shall be the
1900 We implement the more generous second sentence, since that is
1901 what most other compilers do. */
1902 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object),
1905 error ("%qE is not of type %qT", object, destructor);
1906 return error_mark_node;
1910 return build3 (PSEUDO_DTOR_EXPR, void_type_node, object, scope, destructor);
1913 /* Finish an expression of the form CODE EXPR. */
1916 finish_unary_op_expr (enum tree_code code, tree expr)
1918 tree result = build_x_unary_op (code, expr);
1919 /* Inside a template, build_x_unary_op does not fold the
1920 expression. So check whether the result is folded before
1921 setting TREE_NEGATED_INT. */
1922 if (code == NEGATE_EXPR && TREE_CODE (expr) == INTEGER_CST
1923 && TREE_CODE (result) == INTEGER_CST
1924 && !TYPE_UNSIGNED (TREE_TYPE (result))
1925 && INT_CST_LT (result, integer_zero_node))
1926 TREE_NEGATED_INT (result) = 1;
1927 overflow_warning (result);
1931 /* Finish a compound-literal expression. TYPE is the type to which
1932 the INITIALIZER_LIST is being cast. */
1935 finish_compound_literal (tree type, tree initializer_list)
1937 tree compound_literal;
1939 /* Build a CONSTRUCTOR for the INITIALIZER_LIST. */
1940 compound_literal = build_constructor (NULL_TREE, initializer_list);
1941 /* Mark it as a compound-literal. */
1942 TREE_HAS_CONSTRUCTOR (compound_literal) = 1;
1943 if (processing_template_decl)
1944 TREE_TYPE (compound_literal) = type;
1947 /* Check the initialization. */
1948 compound_literal = digest_init (type, compound_literal, NULL);
1949 /* If the TYPE was an array type with an unknown bound, then we can
1950 figure out the dimension now. For example, something like:
1954 implies that the array has two elements. */
1955 if (TREE_CODE (type) == ARRAY_TYPE && !COMPLETE_TYPE_P (type))
1956 complete_array_type (type, compound_literal, 1);
1959 return compound_literal;
1962 /* Return the declaration for the function-name variable indicated by
1966 finish_fname (tree id)
1970 decl = fname_decl (C_RID_CODE (id), id);
1971 if (processing_template_decl)
1972 decl = DECL_NAME (decl);
1976 /* Finish a translation unit. */
1979 finish_translation_unit (void)
1981 /* In case there were missing closebraces,
1982 get us back to the global binding level. */
1984 while (current_namespace != global_namespace)
1987 /* Do file scope __FUNCTION__ et al. */
1988 finish_fname_decls ();
1991 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
1992 Returns the parameter. */
1995 finish_template_type_parm (tree aggr, tree identifier)
1997 if (aggr != class_type_node)
1999 pedwarn ("template type parameters must use the keyword `class' or `typename'");
2000 aggr = class_type_node;
2003 return build_tree_list (aggr, identifier);
2006 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2007 Returns the parameter. */
2010 finish_template_template_parm (tree aggr, tree identifier)
2012 tree decl = build_decl (TYPE_DECL, identifier, NULL_TREE);
2013 tree tmpl = build_lang_decl (TEMPLATE_DECL, identifier, NULL_TREE);
2014 DECL_TEMPLATE_PARMS (tmpl) = current_template_parms;
2015 DECL_TEMPLATE_RESULT (tmpl) = decl;
2016 DECL_ARTIFICIAL (decl) = 1;
2017 end_template_decl ();
2019 gcc_assert (DECL_TEMPLATE_PARMS (tmpl));
2021 return finish_template_type_parm (aggr, tmpl);
2024 /* ARGUMENT is the default-argument value for a template template
2025 parameter. If ARGUMENT is invalid, issue error messages and return
2026 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2029 check_template_template_default_arg (tree argument)
2031 if (TREE_CODE (argument) != TEMPLATE_DECL
2032 && TREE_CODE (argument) != TEMPLATE_TEMPLATE_PARM
2033 && TREE_CODE (argument) != UNBOUND_CLASS_TEMPLATE)
2035 if (TREE_CODE (argument) == TYPE_DECL)
2037 tree t = TREE_TYPE (argument);
2039 /* Try to emit a slightly smarter error message if we detect
2040 that the user is using a template instantiation. */
2041 if (CLASSTYPE_TEMPLATE_INFO (t)
2042 && CLASSTYPE_TEMPLATE_INSTANTIATION (t))
2043 error ("invalid use of type %qT as a default value for a "
2044 "template template-parameter", t);
2046 error ("invalid use of %qD as a default value for a template "
2047 "template-parameter", argument);
2050 error ("invalid default argument for a template template parameter");
2051 return error_mark_node;
2057 /* Begin a class definition, as indicated by T. */
2060 begin_class_definition (tree t)
2062 if (t == error_mark_node)
2063 return error_mark_node;
2065 if (processing_template_parmlist)
2067 error ("definition of %q#T inside template parameter list", t);
2068 return error_mark_node;
2070 /* A non-implicit typename comes from code like:
2072 template <typename T> struct A {
2073 template <typename U> struct A<T>::B ...
2075 This is erroneous. */
2076 else if (TREE_CODE (t) == TYPENAME_TYPE)
2078 error ("invalid definition of qualified type %qT", t);
2079 t = error_mark_node;
2082 if (t == error_mark_node || ! IS_AGGR_TYPE (t))
2084 t = make_aggr_type (RECORD_TYPE);
2085 pushtag (make_anon_name (), t, 0);
2088 /* If this type was already complete, and we see another definition,
2090 if (COMPLETE_TYPE_P (t))
2092 error ("redefinition of %q#T", t);
2093 cp_error_at ("previous definition of %q#T", t);
2094 return error_mark_node;
2097 /* Update the location of the decl. */
2098 DECL_SOURCE_LOCATION (TYPE_NAME (t)) = input_location;
2100 if (TYPE_BEING_DEFINED (t))
2102 t = make_aggr_type (TREE_CODE (t));
2103 pushtag (TYPE_IDENTIFIER (t), t, 0);
2105 maybe_process_partial_specialization (t);
2107 TYPE_BEING_DEFINED (t) = 1;
2108 if (flag_pack_struct)
2111 TYPE_PACKED (t) = 1;
2112 /* Even though the type is being defined for the first time
2113 here, there might have been a forward declaration, so there
2114 might be cv-qualified variants of T. */
2115 for (v = TYPE_NEXT_VARIANT (t); v; v = TYPE_NEXT_VARIANT (v))
2116 TYPE_PACKED (v) = 1;
2118 /* Reset the interface data, at the earliest possible
2119 moment, as it might have been set via a class foo;
2121 if (! TYPE_ANONYMOUS_P (t))
2123 struct c_fileinfo *finfo = get_fileinfo (lbasename (input_filename));
2124 CLASSTYPE_INTERFACE_ONLY (t) = finfo->interface_only;
2125 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2126 (t, finfo->interface_unknown);
2128 reset_specialization();
2130 /* Make a declaration for this class in its own scope. */
2131 build_self_reference ();
2136 /* Finish the member declaration given by DECL. */
2139 finish_member_declaration (tree decl)
2141 if (decl == error_mark_node || decl == NULL_TREE)
2144 if (decl == void_type_node)
2145 /* The COMPONENT was a friend, not a member, and so there's
2146 nothing for us to do. */
2149 /* We should see only one DECL at a time. */
2150 gcc_assert (TREE_CHAIN (decl) == NULL_TREE);
2152 /* Set up access control for DECL. */
2154 = (current_access_specifier == access_private_node);
2155 TREE_PROTECTED (decl)
2156 = (current_access_specifier == access_protected_node);
2157 if (TREE_CODE (decl) == TEMPLATE_DECL)
2159 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl)) = TREE_PRIVATE (decl);
2160 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl)) = TREE_PROTECTED (decl);
2163 /* Mark the DECL as a member of the current class. */
2164 DECL_CONTEXT (decl) = current_class_type;
2168 A C language linkage is ignored for the names of class members
2169 and the member function type of class member functions. */
2170 if (DECL_LANG_SPECIFIC (decl) && DECL_LANGUAGE (decl) == lang_c)
2171 SET_DECL_LANGUAGE (decl, lang_cplusplus);
2173 /* Put functions on the TYPE_METHODS list and everything else on the
2174 TYPE_FIELDS list. Note that these are built up in reverse order.
2175 We reverse them (to obtain declaration order) in finish_struct. */
2176 if (TREE_CODE (decl) == FUNCTION_DECL
2177 || DECL_FUNCTION_TEMPLATE_P (decl))
2179 /* We also need to add this function to the
2180 CLASSTYPE_METHOD_VEC. */
2181 add_method (current_class_type, decl);
2183 TREE_CHAIN (decl) = TYPE_METHODS (current_class_type);
2184 TYPE_METHODS (current_class_type) = decl;
2186 maybe_add_class_template_decl_list (current_class_type, decl,
2189 /* Enter the DECL into the scope of the class. */
2190 else if ((TREE_CODE (decl) == USING_DECL && TREE_TYPE (decl))
2191 || pushdecl_class_level (decl))
2193 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2194 go at the beginning. The reason is that lookup_field_1
2195 searches the list in order, and we want a field name to
2196 override a type name so that the "struct stat hack" will
2197 work. In particular:
2199 struct S { enum E { }; int E } s;
2202 is valid. In addition, the FIELD_DECLs must be maintained in
2203 declaration order so that class layout works as expected.
2204 However, we don't need that order until class layout, so we
2205 save a little time by putting FIELD_DECLs on in reverse order
2206 here, and then reversing them in finish_struct_1. (We could
2207 also keep a pointer to the correct insertion points in the
2210 if (TREE_CODE (decl) == TYPE_DECL)
2211 TYPE_FIELDS (current_class_type)
2212 = chainon (TYPE_FIELDS (current_class_type), decl);
2215 TREE_CHAIN (decl) = TYPE_FIELDS (current_class_type);
2216 TYPE_FIELDS (current_class_type) = decl;
2219 maybe_add_class_template_decl_list (current_class_type, decl,
2224 /* Finish processing a complete template declaration. The PARMS are
2225 the template parameters. */
2228 finish_template_decl (tree parms)
2231 end_template_decl ();
2233 end_specialization ();
2236 /* Finish processing a template-id (which names a type) of the form
2237 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2238 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2239 the scope of template-id indicated. */
2242 finish_template_type (tree name, tree args, int entering_scope)
2246 decl = lookup_template_class (name, args,
2247 NULL_TREE, NULL_TREE, entering_scope,
2248 tf_error | tf_warning | tf_user);
2249 if (decl != error_mark_node)
2250 decl = TYPE_STUB_DECL (decl);
2255 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2256 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2257 BASE_CLASS, or NULL_TREE if an error occurred. The
2258 ACCESS_SPECIFIER is one of
2259 access_{default,public,protected_private}_node. For a virtual base
2260 we set TREE_TYPE. */
2263 finish_base_specifier (tree base, tree access, bool virtual_p)
2267 if (base == error_mark_node)
2269 error ("invalid base-class specification");
2272 else if (! is_aggr_type (base, 1))
2276 if (cp_type_quals (base) != 0)
2278 error ("base class %qT has cv qualifiers", base);
2279 base = TYPE_MAIN_VARIANT (base);
2281 result = build_tree_list (access, base);
2283 TREE_TYPE (result) = integer_type_node;
2289 /* Called when multiple declarators are processed. If that is not
2290 permitted in this context, an error is issued. */
2293 check_multiple_declarators (void)
2297 In a template-declaration, explicit specialization, or explicit
2298 instantiation the init-declarator-list in the declaration shall
2299 contain at most one declarator.
2301 We don't just use PROCESSING_TEMPLATE_DECL for the first
2302 condition since that would disallow the perfectly valid code,
2303 like `template <class T> struct S { int i, j; };'. */
2304 if (at_function_scope_p ())
2305 /* It's OK to write `template <class T> void f() { int i, j;}'. */
2308 if (PROCESSING_REAL_TEMPLATE_DECL_P ()
2309 || processing_explicit_instantiation
2310 || processing_specialization)
2311 error ("multiple declarators in template declaration");
2314 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2315 what we found when we tried to do the lookup. */
2318 qualified_name_lookup_error (tree scope, tree name, tree decl)
2322 if (!COMPLETE_TYPE_P (scope))
2323 error ("incomplete type %qT used in nested name specifier", scope);
2324 else if (TREE_CODE (decl) == TREE_LIST)
2326 error ("reference to %<%T::%D%> is ambiguous", scope, name);
2327 print_candidates (decl);
2330 error ("%qD is not a member of %qT", name, scope);
2332 else if (scope != global_namespace)
2333 error ("%qD is not a member of %qD", name, scope);
2335 error ("%<::%D%> has not been declared", name);
2338 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2339 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2340 if non-NULL, is the type or namespace used to explicitly qualify
2341 ID_EXPRESSION. DECL is the entity to which that name has been
2344 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2345 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2346 be set to true if this expression isn't permitted in a
2347 constant-expression, but it is otherwise not set by this function.
2348 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2349 constant-expression, but a non-constant expression is also
2352 If an error occurs, and it is the kind of error that might cause
2353 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2354 is the caller's responsibility to issue the message. *ERROR_MSG
2355 will be a string with static storage duration, so the caller need
2358 Return an expression for the entity, after issuing appropriate
2359 diagnostics. This function is also responsible for transforming a
2360 reference to a non-static member into a COMPONENT_REF that makes
2361 the use of "this" explicit.
2363 Upon return, *IDK will be filled in appropriately. */
2366 finish_id_expression (tree id_expression,
2370 tree *qualifying_class,
2371 bool integral_constant_expression_p,
2372 bool allow_non_integral_constant_expression_p,
2373 bool *non_integral_constant_expression_p,
2374 const char **error_msg)
2376 /* Initialize the output parameters. */
2377 *idk = CP_ID_KIND_NONE;
2380 if (id_expression == error_mark_node)
2381 return error_mark_node;
2382 /* If we have a template-id, then no further lookup is
2383 required. If the template-id was for a template-class, we
2384 will sometimes have a TYPE_DECL at this point. */
2385 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2386 || TREE_CODE (decl) == TYPE_DECL)
2388 /* Look up the name. */
2391 if (decl == error_mark_node)
2393 /* Name lookup failed. */
2396 || (!dependent_type_p (scope)
2397 && !(TREE_CODE (id_expression) == IDENTIFIER_NODE
2398 && IDENTIFIER_TYPENAME_P (id_expression)
2399 && dependent_type_p (TREE_TYPE (id_expression))))))
2401 /* If the qualifying type is non-dependent (and the name
2402 does not name a conversion operator to a dependent
2403 type), issue an error. */
2404 qualified_name_lookup_error (scope, id_expression, decl);
2405 return error_mark_node;
2409 /* It may be resolved via Koenig lookup. */
2410 *idk = CP_ID_KIND_UNQUALIFIED;
2411 return id_expression;
2414 decl = id_expression;
2416 /* If DECL is a variable that would be out of scope under
2417 ANSI/ISO rules, but in scope in the ARM, name lookup
2418 will succeed. Issue a diagnostic here. */
2420 decl = check_for_out_of_scope_variable (decl);
2422 /* Remember that the name was used in the definition of
2423 the current class so that we can check later to see if
2424 the meaning would have been different after the class
2425 was entirely defined. */
2426 if (!scope && decl != error_mark_node)
2427 maybe_note_name_used_in_class (id_expression, decl);
2430 /* If we didn't find anything, or what we found was a type,
2431 then this wasn't really an id-expression. */
2432 if (TREE_CODE (decl) == TEMPLATE_DECL
2433 && !DECL_FUNCTION_TEMPLATE_P (decl))
2435 *error_msg = "missing template arguments";
2436 return error_mark_node;
2438 else if (TREE_CODE (decl) == TYPE_DECL
2439 || TREE_CODE (decl) == NAMESPACE_DECL)
2441 *error_msg = "expected primary-expression";
2442 return error_mark_node;
2445 /* If the name resolved to a template parameter, there is no
2446 need to look it up again later. */
2447 if ((TREE_CODE (decl) == CONST_DECL && DECL_TEMPLATE_PARM_P (decl))
2448 || TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2450 *idk = CP_ID_KIND_NONE;
2451 if (TREE_CODE (decl) == TEMPLATE_PARM_INDEX)
2452 decl = TEMPLATE_PARM_DECL (decl);
2453 if (integral_constant_expression_p
2454 && !dependent_type_p (TREE_TYPE (decl))
2455 && !INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (decl)))
2457 if (!allow_non_integral_constant_expression_p)
2458 error ("template parameter %qD of type %qT is not allowed in "
2459 "an integral constant expression because it is not of "
2460 "integral or enumeration type", decl, TREE_TYPE (decl));
2461 *non_integral_constant_expression_p = true;
2463 return DECL_INITIAL (decl);
2465 /* Similarly, we resolve enumeration constants to their
2466 underlying values. */
2467 else if (TREE_CODE (decl) == CONST_DECL)
2469 *idk = CP_ID_KIND_NONE;
2470 if (!processing_template_decl)
2471 return DECL_INITIAL (decl);
2478 /* If the declaration was explicitly qualified indicate
2479 that. The semantics of `A::f(3)' are different than
2480 `f(3)' if `f' is virtual. */
2482 ? CP_ID_KIND_QUALIFIED
2483 : (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2484 ? CP_ID_KIND_TEMPLATE_ID
2485 : CP_ID_KIND_UNQUALIFIED));
2490 An id-expression is type-dependent if it contains an
2491 identifier that was declared with a dependent type.
2493 The standard is not very specific about an id-expression that
2494 names a set of overloaded functions. What if some of them
2495 have dependent types and some of them do not? Presumably,
2496 such a name should be treated as a dependent name. */
2497 /* Assume the name is not dependent. */
2498 dependent_p = false;
2499 if (!processing_template_decl)
2500 /* No names are dependent outside a template. */
2502 /* A template-id where the name of the template was not resolved
2503 is definitely dependent. */
2504 else if (TREE_CODE (decl) == TEMPLATE_ID_EXPR
2505 && (TREE_CODE (TREE_OPERAND (decl, 0))
2506 == IDENTIFIER_NODE))
2508 /* For anything except an overloaded function, just check its
2510 else if (!is_overloaded_fn (decl))
2512 = dependent_type_p (TREE_TYPE (decl));
2513 /* For a set of overloaded functions, check each of the
2519 if (BASELINK_P (fns))
2520 fns = BASELINK_FUNCTIONS (fns);
2522 /* For a template-id, check to see if the template
2523 arguments are dependent. */
2524 if (TREE_CODE (fns) == TEMPLATE_ID_EXPR)
2526 tree args = TREE_OPERAND (fns, 1);
2527 dependent_p = any_dependent_template_arguments_p (args);
2528 /* The functions are those referred to by the
2530 fns = TREE_OPERAND (fns, 0);
2533 /* If there are no dependent template arguments, go through
2534 the overloaded functions. */
2535 while (fns && !dependent_p)
2537 tree fn = OVL_CURRENT (fns);
2539 /* Member functions of dependent classes are
2541 if (TREE_CODE (fn) == FUNCTION_DECL
2542 && type_dependent_expression_p (fn))
2544 else if (TREE_CODE (fn) == TEMPLATE_DECL
2545 && dependent_template_p (fn))
2548 fns = OVL_NEXT (fns);
2552 /* If the name was dependent on a template parameter, we will
2553 resolve the name at instantiation time. */
2556 /* Create a SCOPE_REF for qualified names, if the scope is
2561 *qualifying_class = scope;
2562 /* Since this name was dependent, the expression isn't
2563 constant -- yet. No error is issued because it might
2564 be constant when things are instantiated. */
2565 if (integral_constant_expression_p)
2566 *non_integral_constant_expression_p = true;
2567 if (TYPE_P (scope) && dependent_type_p (scope))
2568 return build_nt (SCOPE_REF, scope, id_expression);
2569 else if (TYPE_P (scope) && DECL_P (decl))
2570 return build2 (SCOPE_REF, TREE_TYPE (decl), scope,
2575 /* A TEMPLATE_ID already contains all the information we
2577 if (TREE_CODE (id_expression) == TEMPLATE_ID_EXPR)
2578 return id_expression;
2579 /* Since this name was dependent, the expression isn't
2580 constant -- yet. No error is issued because it might be
2581 constant when things are instantiated. */
2582 if (integral_constant_expression_p)
2583 *non_integral_constant_expression_p = true;
2584 *idk = CP_ID_KIND_UNQUALIFIED_DEPENDENT;
2585 /* If we found a variable, then name lookup during the
2586 instantiation will always resolve to the same VAR_DECL
2587 (or an instantiation thereof). */
2588 if (TREE_CODE (decl) == VAR_DECL
2589 || TREE_CODE (decl) == PARM_DECL)
2591 return id_expression;
2594 /* Only certain kinds of names are allowed in constant
2595 expression. Enumerators and template parameters
2596 have already been handled above. */
2597 if (integral_constant_expression_p
2598 && !DECL_INTEGRAL_CONSTANT_VAR_P (decl))
2600 if (!allow_non_integral_constant_expression_p)
2602 error ("%qD cannot appear in a constant-expression", decl);
2603 return error_mark_node;
2605 *non_integral_constant_expression_p = true;
2608 if (TREE_CODE (decl) == NAMESPACE_DECL)
2610 error ("use of namespace %qD as expression", decl);
2611 return error_mark_node;
2613 else if (DECL_CLASS_TEMPLATE_P (decl))
2615 error ("use of class template %qT as expression", decl);
2616 return error_mark_node;
2618 else if (TREE_CODE (decl) == TREE_LIST)
2620 /* Ambiguous reference to base members. */
2621 error ("request for member %qD is ambiguous in "
2622 "multiple inheritance lattice", id_expression);
2623 print_candidates (decl);
2624 return error_mark_node;
2627 /* Mark variable-like entities as used. Functions are similarly
2628 marked either below or after overload resolution. */
2629 if (TREE_CODE (decl) == VAR_DECL
2630 || TREE_CODE (decl) == PARM_DECL
2631 || TREE_CODE (decl) == RESULT_DECL)
2636 decl = (adjust_result_of_qualified_name_lookup
2637 (decl, scope, current_class_type));
2639 if (TREE_CODE (decl) == FUNCTION_DECL)
2642 if (TREE_CODE (decl) == FIELD_DECL || BASELINK_P (decl))
2643 *qualifying_class = scope;
2644 else if (!processing_template_decl)
2645 decl = convert_from_reference (decl);
2646 else if (TYPE_P (scope))
2647 decl = build2 (SCOPE_REF, TREE_TYPE (decl), scope, decl);
2649 else if (TREE_CODE (decl) == FIELD_DECL)
2650 decl = finish_non_static_data_member (decl, current_class_ref,
2651 /*qualifying_scope=*/NULL_TREE);
2652 else if (is_overloaded_fn (decl))
2654 tree first_fn = OVL_CURRENT (decl);
2656 if (TREE_CODE (first_fn) == TEMPLATE_DECL)
2657 first_fn = DECL_TEMPLATE_RESULT (first_fn);
2659 if (!really_overloaded_fn (decl))
2660 mark_used (first_fn);
2662 if (TREE_CODE (first_fn) == FUNCTION_DECL
2663 && DECL_FUNCTION_MEMBER_P (first_fn)
2664 && !shared_member_p (decl))
2666 /* A set of member functions. */
2667 decl = maybe_dummy_object (DECL_CONTEXT (first_fn), 0);
2668 return finish_class_member_access_expr (decl, id_expression);
2673 if (TREE_CODE (decl) == VAR_DECL
2674 || TREE_CODE (decl) == PARM_DECL
2675 || TREE_CODE (decl) == RESULT_DECL)
2677 tree context = decl_function_context (decl);
2679 if (context != NULL_TREE && context != current_function_decl
2680 && ! TREE_STATIC (decl))
2682 error ("use of %s from containing function",
2683 (TREE_CODE (decl) == VAR_DECL
2684 ? "%<auto%> variable" : "parameter"));
2685 cp_error_at (" %q#D declared here", decl);
2686 return error_mark_node;
2690 if (DECL_P (decl) && DECL_NONLOCAL (decl)
2691 && DECL_CLASS_SCOPE_P (decl)
2692 && DECL_CONTEXT (decl) != current_class_type)
2696 path = currently_open_derived_class (DECL_CONTEXT (decl));
2697 perform_or_defer_access_check (TYPE_BINFO (path), decl);
2700 if (! processing_template_decl)
2701 decl = convert_from_reference (decl);
2704 /* Resolve references to variables of anonymous unions
2705 into COMPONENT_REFs. */
2706 if (TREE_CODE (decl) == ALIAS_DECL)
2707 decl = unshare_expr (DECL_INITIAL (decl));
2710 if (TREE_DEPRECATED (decl))
2711 warn_deprecated_use (decl);
2716 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
2717 use as a type-specifier. */
2720 finish_typeof (tree expr)
2724 if (type_dependent_expression_p (expr))
2726 type = make_aggr_type (TYPEOF_TYPE);
2727 TYPEOF_TYPE_EXPR (type) = expr;
2732 type = TREE_TYPE (expr);
2734 if (!type || type == unknown_type_node)
2736 error ("type of %qE is unknown", expr);
2737 return error_mark_node;
2743 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
2744 with equivalent CALL_EXPRs. */
2747 simplify_aggr_init_exprs_r (tree* tp,
2749 void* data ATTRIBUTE_UNUSED)
2751 /* We don't need to walk into types; there's nothing in a type that
2752 needs simplification. (And, furthermore, there are places we
2753 actively don't want to go. For example, we don't want to wander
2754 into the default arguments for a FUNCTION_DECL that appears in a
2761 /* Only AGGR_INIT_EXPRs are interesting. */
2762 else if (TREE_CODE (*tp) != AGGR_INIT_EXPR)
2765 simplify_aggr_init_expr (tp);
2767 /* Keep iterating. */
2771 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
2772 function is broken out from the above for the benefit of the tree-ssa
2776 simplify_aggr_init_expr (tree *tp)
2778 tree aggr_init_expr = *tp;
2780 /* Form an appropriate CALL_EXPR. */
2781 tree fn = TREE_OPERAND (aggr_init_expr, 0);
2782 tree args = TREE_OPERAND (aggr_init_expr, 1);
2783 tree slot = TREE_OPERAND (aggr_init_expr, 2);
2784 tree type = TREE_TYPE (slot);
2787 enum style_t { ctor, arg, pcc } style;
2789 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr))
2791 #ifdef PCC_STATIC_STRUCT_RETURN
2797 gcc_assert (TREE_ADDRESSABLE (type));
2801 if (style == ctor || style == arg)
2803 /* Pass the address of the slot. If this is a constructor, we
2804 replace the first argument; otherwise, we tack on a new one. */
2808 args = TREE_CHAIN (args);
2810 cxx_mark_addressable (slot);
2811 addr = build1 (ADDR_EXPR, build_pointer_type (type), slot);
2814 /* The return type might have different cv-quals from the slot. */
2815 tree fntype = TREE_TYPE (TREE_TYPE (fn));
2817 gcc_assert (TREE_CODE (fntype) == FUNCTION_TYPE
2818 || TREE_CODE (fntype) == METHOD_TYPE);
2819 addr = convert (build_pointer_type (TREE_TYPE (fntype)), addr);
2822 args = tree_cons (NULL_TREE, addr, args);
2825 call_expr = build3 (CALL_EXPR,
2826 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn))),
2827 fn, args, NULL_TREE);
2830 /* Tell the backend that we've added our return slot to the argument
2832 CALL_EXPR_HAS_RETURN_SLOT_ADDR (call_expr) = 1;
2833 else if (style == pcc)
2835 /* If we're using the non-reentrant PCC calling convention, then we
2836 need to copy the returned value out of the static buffer into the
2838 push_deferring_access_checks (dk_no_check);
2839 call_expr = build_aggr_init (slot, call_expr,
2840 DIRECT_BIND | LOOKUP_ONLYCONVERTING);
2841 pop_deferring_access_checks ();
2847 /* Emit all thunks to FN that should be emitted when FN is emitted. */
2850 emit_associated_thunks (tree fn)
2852 /* When we use vcall offsets, we emit thunks with the virtual
2853 functions to which they thunk. The whole point of vcall offsets
2854 is so that you can know statically the entire set of thunks that
2855 will ever be needed for a given virtual function, thereby
2856 enabling you to output all the thunks with the function itself. */
2857 if (DECL_VIRTUAL_P (fn))
2861 for (thunk = DECL_THUNKS (fn); thunk; thunk = TREE_CHAIN (thunk))
2863 if (!THUNK_ALIAS (thunk))
2865 use_thunk (thunk, /*emit_p=*/1);
2866 if (DECL_RESULT_THUNK_P (thunk))
2870 for (probe = DECL_THUNKS (thunk);
2871 probe; probe = TREE_CHAIN (probe))
2872 use_thunk (probe, /*emit_p=*/1);
2876 gcc_assert (!DECL_THUNKS (thunk));
2881 /* Generate RTL for FN. */
2884 expand_body (tree fn)
2886 tree saved_function;
2888 /* Compute the appropriate object-file linkage for inline
2890 if (DECL_DECLARED_INLINE_P (fn))
2891 import_export_decl (fn);
2893 /* If FN is external, then there's no point in generating RTL for
2894 it. This situation can arise with an inline function under
2895 `-fexternal-templates'; we instantiate the function, even though
2896 we're not planning on emitting it, in case we get a chance to
2898 if (DECL_EXTERNAL (fn))
2901 /* ??? When is this needed? */
2902 saved_function = current_function_decl;
2904 /* Emit any thunks that should be emitted at the same time as FN. */
2905 emit_associated_thunks (fn);
2907 /* This function is only called from cgraph, or recursively from
2908 emit_associated_thunks. In neither case should we be currently
2909 generating trees for a function. */
2910 gcc_assert (function_depth == 0);
2912 tree_rest_of_compilation (fn);
2914 current_function_decl = saved_function;
2916 if (DECL_CLONED_FUNCTION_P (fn))
2918 /* If this is a clone, go through the other clones now and mark
2919 their parameters used. We have to do that here, as we don't
2920 know whether any particular clone will be expanded, and
2921 therefore cannot pick one arbitrarily. */
2924 for (probe = TREE_CHAIN (DECL_CLONED_FUNCTION (fn));
2925 probe && DECL_CLONED_FUNCTION_P (probe);
2926 probe = TREE_CHAIN (probe))
2930 for (parms = DECL_ARGUMENTS (probe);
2931 parms; parms = TREE_CHAIN (parms))
2932 TREE_USED (parms) = 1;
2937 /* Generate RTL for FN. */
2940 expand_or_defer_fn (tree fn)
2942 /* When the parser calls us after finishing the body of a template
2943 function, we don't really want to expand the body. */
2944 if (processing_template_decl)
2946 /* Normally, collection only occurs in rest_of_compilation. So,
2947 if we don't collect here, we never collect junk generated
2948 during the processing of templates until we hit a
2949 non-template function. */
2954 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
2955 walk_tree_without_duplicates (&DECL_SAVED_TREE (fn),
2956 simplify_aggr_init_exprs_r,
2959 /* If this is a constructor or destructor body, we have to clone
2961 if (maybe_clone_body (fn))
2963 /* We don't want to process FN again, so pretend we've written
2964 it out, even though we haven't. */
2965 TREE_ASM_WRITTEN (fn) = 1;
2969 /* If this function is marked with the constructor attribute, add it
2970 to the list of functions to be called along with constructors
2971 from static duration objects. */
2972 if (DECL_STATIC_CONSTRUCTOR (fn))
2973 static_ctors = tree_cons (NULL_TREE, fn, static_ctors);
2975 /* If this function is marked with the destructor attribute, add it
2976 to the list of functions to be called along with destructors from
2977 static duration objects. */
2978 if (DECL_STATIC_DESTRUCTOR (fn))
2979 static_dtors = tree_cons (NULL_TREE, fn, static_dtors);
2981 /* We make a decision about linkage for these functions at the end
2982 of the compilation. Until that point, we do not want the back
2983 end to output them -- but we do want it to see the bodies of
2984 these functions so that it can inline them as appropriate. */
2985 if (DECL_DECLARED_INLINE_P (fn) || DECL_IMPLICIT_INSTANTIATION (fn))
2989 DECL_EXTERNAL (fn) = 1;
2990 DECL_NOT_REALLY_EXTERN (fn) = 1;
2991 note_vague_linkage_fn (fn);
2994 import_export_decl (fn);
2996 /* If the user wants us to keep all inline functions, then mark
2997 this function as needed so that finish_file will make sure to
2999 if (flag_keep_inline_functions && DECL_DECLARED_INLINE_P (fn))
3003 /* There's no reason to do any of the work here if we're only doing
3004 semantic analysis; this code just generates RTL. */
3005 if (flag_syntax_only)
3010 /* Expand or defer, at the whim of the compilation unit manager. */
3011 cgraph_finalize_function (fn, function_depth > 1);
3023 /* Helper function for walk_tree, used by finalize_nrv below. */
3026 finalize_nrv_r (tree* tp, int* walk_subtrees, void* data)
3028 struct nrv_data *dp = (struct nrv_data *)data;
3031 /* No need to walk into types. There wouldn't be any need to walk into
3032 non-statements, except that we have to consider STMT_EXPRs. */
3035 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3036 but differs from using NULL_TREE in that it indicates that we care
3037 about the value of the RESULT_DECL. */
3038 else if (TREE_CODE (*tp) == RETURN_EXPR)
3039 TREE_OPERAND (*tp, 0) = dp->result;
3040 /* Change all cleanups for the NRV to only run when an exception is
3042 else if (TREE_CODE (*tp) == CLEANUP_STMT
3043 && CLEANUP_DECL (*tp) == dp->var)
3044 CLEANUP_EH_ONLY (*tp) = 1;
3045 /* Replace the DECL_EXPR for the NRV with an initialization of the
3046 RESULT_DECL, if needed. */
3047 else if (TREE_CODE (*tp) == DECL_EXPR
3048 && DECL_EXPR_DECL (*tp) == dp->var)
3051 if (DECL_INITIAL (dp->var)
3052 && DECL_INITIAL (dp->var) != error_mark_node)
3054 init = build2 (INIT_EXPR, void_type_node, dp->result,
3055 DECL_INITIAL (dp->var));
3056 DECL_INITIAL (dp->var) = error_mark_node;
3059 init = build_empty_stmt ();
3060 SET_EXPR_LOCUS (init, EXPR_LOCUS (*tp));
3063 /* And replace all uses of the NRV with the RESULT_DECL. */
3064 else if (*tp == dp->var)
3067 /* Avoid walking into the same tree more than once. Unfortunately, we
3068 can't just use walk_tree_without duplicates because it would only call
3069 us for the first occurrence of dp->var in the function body. */
3070 slot = htab_find_slot (dp->visited, *tp, INSERT);
3076 /* Keep iterating. */
3080 /* Called from finish_function to implement the named return value
3081 optimization by overriding all the RETURN_EXPRs and pertinent
3082 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3083 RESULT_DECL for the function. */
3086 finalize_nrv (tree *tp, tree var, tree result)
3088 struct nrv_data data;
3090 /* Copy debugging information from VAR to RESULT. */
3091 DECL_NAME (result) = DECL_NAME (var);
3092 DECL_ARTIFICIAL (result) = DECL_ARTIFICIAL (var);
3093 DECL_IGNORED_P (result) = DECL_IGNORED_P (var);
3094 DECL_SOURCE_LOCATION (result) = DECL_SOURCE_LOCATION (var);
3095 DECL_ABSTRACT_ORIGIN (result) = DECL_ABSTRACT_ORIGIN (var);
3096 /* Don't forget that we take its address. */
3097 TREE_ADDRESSABLE (result) = TREE_ADDRESSABLE (var);
3100 data.result = result;
3101 data.visited = htab_create (37, htab_hash_pointer, htab_eq_pointer, NULL);
3102 walk_tree (tp, finalize_nrv_r, &data, 0);
3103 htab_delete (data.visited);
3106 /* Perform initialization related to this module. */
3109 init_cp_semantics (void)
3113 #include "gt-cp-semantics.h"