1 /* Perform the semantic phase of parsing, i.e., the process of
2 building tree structure, checking semantic consistency, and
3 building RTL. These routines are used both during actual parsing
4 and during the instantiation of template functions.
6 Copyright (C) 1998, 1999, 2000, 2001, 2002, 2003, 2004, 2005
7 Free Software Foundation, Inc.
8 Written by Mark Mitchell (mmitchell@usa.net) based on code found
9 formerly in parse.y and pt.c.
11 This file is part of GCC.
13 GCC is free software; you can redistribute it and/or modify it
14 under the terms of the GNU General Public License as published by
15 the Free Software Foundation; either version 2, or (at your option)
18 GCC is distributed in the hope that it will be useful, but
19 WITHOUT ANY WARRANTY; without even the implied warranty of
20 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
21 General Public License for more details.
23 You should have received a copy of the GNU General Public License
24 along with GCC; see the file COPYING. If not, write to the Free
25 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
30 #include "coretypes.h"
35 #include "tree-inline.h"
36 #include "tree-mudflap.h"
45 #include "diagnostic.h"
47 #include "tree-iterator.h"
51 /* There routines provide a modular interface to perform many parsing
52 operations. They may therefore be used during actual parsing, or
53 during template instantiation, which may be regarded as a
54 degenerate form of parsing. Since the current g++ parser is
55 lacking in several respects, and will be reimplemented, we are
56 attempting to move most code that is not directly related to
57 parsing into this file; that will make implementing the new parser
58 much easier since it will be able to make use of these routines. */
60 static tree
maybe_convert_cond (tree
);
61 static tree
simplify_aggr_init_exprs_r (tree
*, int *, void *);
62 static void emit_associated_thunks (tree
);
63 static tree
finalize_nrv_r (tree
*, int *, void *);
66 /* Deferred Access Checking Overview
67 ---------------------------------
69 Most C++ expressions and declarations require access checking
70 to be performed during parsing. However, in several cases,
71 this has to be treated differently.
73 For member declarations, access checking has to be deferred
74 until more information about the declaration is known. For
86 When we are parsing the function return type `A::X', we don't
87 really know if this is allowed until we parse the function name.
89 Furthermore, some contexts require that access checking is
90 never performed at all. These include class heads, and template
93 Typical use of access checking functions is described here:
95 1. When we enter a context that requires certain access checking
96 mode, the function `push_deferring_access_checks' is called with
97 DEFERRING argument specifying the desired mode. Access checking
98 may be performed immediately (dk_no_deferred), deferred
99 (dk_deferred), or not performed (dk_no_check).
101 2. When a declaration such as a type, or a variable, is encountered,
102 the function `perform_or_defer_access_check' is called. It
103 maintains a TREE_LIST of all deferred checks.
105 3. The global `current_class_type' or `current_function_decl' is then
106 setup by the parser. `enforce_access' relies on these information
109 4. Upon exiting the context mentioned in step 1,
110 `perform_deferred_access_checks' is called to check all declaration
111 stored in the TREE_LIST. `pop_deferring_access_checks' is then
112 called to restore the previous access checking mode.
114 In case of parsing error, we simply call `pop_deferring_access_checks'
115 without `perform_deferred_access_checks'. */
117 typedef struct deferred_access
GTY(())
119 /* A TREE_LIST representing name-lookups for which we have deferred
120 checking access controls. We cannot check the accessibility of
121 names used in a decl-specifier-seq until we know what is being
122 declared because code like:
129 A::B* A::f() { return 0; }
131 is valid, even though `A::B' is not generally accessible.
133 The TREE_PURPOSE of each node is the scope used to qualify the
134 name being looked up; the TREE_VALUE is the DECL to which the
135 name was resolved. */
136 tree deferred_access_checks
;
138 /* The current mode of access checks. */
139 enum deferring_kind deferring_access_checks_kind
;
142 DEF_VEC_O (deferred_access
);
143 DEF_VEC_ALLOC_O (deferred_access
,gc
);
145 /* Data for deferred access checking. */
146 static GTY(()) VEC(deferred_access
,gc
) *deferred_access_stack
;
147 static GTY(()) unsigned deferred_access_no_check
;
149 /* Save the current deferred access states and start deferred
150 access checking iff DEFER_P is true. */
153 push_deferring_access_checks (deferring_kind deferring
)
155 /* For context like template instantiation, access checking
156 disabling applies to all nested context. */
157 if (deferred_access_no_check
|| deferring
== dk_no_check
)
158 deferred_access_no_check
++;
161 deferred_access
*ptr
;
163 ptr
= VEC_safe_push (deferred_access
, gc
, deferred_access_stack
, NULL
);
164 ptr
->deferred_access_checks
= NULL_TREE
;
165 ptr
->deferring_access_checks_kind
= deferring
;
169 /* Resume deferring access checks again after we stopped doing
173 resume_deferring_access_checks (void)
175 if (!deferred_access_no_check
)
176 VEC_last (deferred_access
, deferred_access_stack
)
177 ->deferring_access_checks_kind
= dk_deferred
;
180 /* Stop deferring access checks. */
183 stop_deferring_access_checks (void)
185 if (!deferred_access_no_check
)
186 VEC_last (deferred_access
, deferred_access_stack
)
187 ->deferring_access_checks_kind
= dk_no_deferred
;
190 /* Discard the current deferred access checks and restore the
194 pop_deferring_access_checks (void)
196 if (deferred_access_no_check
)
197 deferred_access_no_check
--;
199 VEC_pop (deferred_access
, deferred_access_stack
);
202 /* Returns a TREE_LIST representing the deferred checks.
203 The TREE_PURPOSE of each node is the type through which the
204 access occurred; the TREE_VALUE is the declaration named.
208 get_deferred_access_checks (void)
210 if (deferred_access_no_check
)
213 return (VEC_last (deferred_access
, deferred_access_stack
)
214 ->deferred_access_checks
);
217 /* Take current deferred checks and combine with the
218 previous states if we also defer checks previously.
219 Otherwise perform checks now. */
222 pop_to_parent_deferring_access_checks (void)
224 if (deferred_access_no_check
)
225 deferred_access_no_check
--;
229 deferred_access
*ptr
;
231 checks
= (VEC_last (deferred_access
, deferred_access_stack
)
232 ->deferred_access_checks
);
234 VEC_pop (deferred_access
, deferred_access_stack
);
235 ptr
= VEC_last (deferred_access
, deferred_access_stack
);
236 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
239 for (; checks
; checks
= TREE_CHAIN (checks
))
240 enforce_access (TREE_PURPOSE (checks
),
241 TREE_VALUE (checks
));
245 /* Merge with parent. */
247 tree original
= ptr
->deferred_access_checks
;
249 for (; checks
; checks
= next
)
253 next
= TREE_CHAIN (checks
);
255 for (probe
= original
; probe
; probe
= TREE_CHAIN (probe
))
256 if (TREE_VALUE (probe
) == TREE_VALUE (checks
)
257 && TREE_PURPOSE (probe
) == TREE_PURPOSE (checks
))
259 /* Insert into parent's checks. */
260 TREE_CHAIN (checks
) = ptr
->deferred_access_checks
;
261 ptr
->deferred_access_checks
= checks
;
268 /* Perform the deferred access checks.
270 After performing the checks, we still have to keep the list
271 `deferred_access_stack->deferred_access_checks' since we may want
272 to check access for them again later in a different context.
279 A::X A::a, x; // No error for `A::a', error for `x'
281 We have to perform deferred access of `A::X', first with `A::a',
285 perform_deferred_access_checks (void)
289 for (deferred_check
= get_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 /* T is a statement. Add it to the statement-tree. This is the C++
344 version. The C/ObjC frontends have a slightly different version of
350 enum tree_code code
= TREE_CODE (t
);
352 if (EXPR_P (t
) && code
!= LABEL_EXPR
)
354 if (!EXPR_HAS_LOCATION (t
))
355 SET_EXPR_LOCATION (t
, input_location
);
357 /* When we expand a statement-tree, we must know whether or not the
358 statements are full-expressions. We record that fact here. */
359 STMT_IS_FULL_EXPR_P (t
) = stmts_are_full_exprs_p ();
362 /* Add T to the statement-tree. Non-side-effect statements need to be
363 recorded during statement expressions. */
364 append_to_statement_list_force (t
, &cur_stmt_list
);
369 /* Returns the stmt_tree (if any) to which statements are currently
370 being added. If there is no active statement-tree, NULL is
374 current_stmt_tree (void)
377 ? &cfun
->language
->base
.x_stmt_tree
378 : &scope_chain
->x_stmt_tree
);
381 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
384 maybe_cleanup_point_expr (tree expr
)
386 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
387 expr
= fold_build_cleanup_point_expr (TREE_TYPE (expr
), expr
);
391 /* Like maybe_cleanup_point_expr except have the type of the new expression be
392 void so we don't need to create a temporary variable to hold the inner
393 expression. The reason why we do this is because the original type might be
394 an aggregate and we cannot create a temporary variable for that type. */
397 maybe_cleanup_point_expr_void (tree expr
)
399 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
400 expr
= fold_build_cleanup_point_expr (void_type_node
, expr
);
406 /* Create a declaration statement for the declaration given by the DECL. */
409 add_decl_expr (tree decl
)
411 tree r
= build_stmt (DECL_EXPR
, decl
);
412 if (DECL_INITIAL (decl
)
413 || (DECL_SIZE (decl
) && TREE_SIDE_EFFECTS (DECL_SIZE (decl
))))
414 r
= maybe_cleanup_point_expr_void (r
);
418 /* Nonzero if TYPE is an anonymous union or struct type. We have to use a
419 flag for this because "A union for which objects or pointers are
420 declared is not an anonymous union" [class.union]. */
423 anon_aggr_type_p (tree node
)
425 return ANON_AGGR_TYPE_P (node
);
428 /* Finish a scope. */
431 do_poplevel (tree stmt_list
)
435 if (stmts_are_full_exprs_p ())
436 block
= poplevel (kept_level_p (), 1, 0);
438 stmt_list
= pop_stmt_list (stmt_list
);
440 if (!processing_template_decl
)
442 stmt_list
= c_build_bind_expr (block
, stmt_list
);
443 /* ??? See c_end_compound_stmt re statement expressions. */
449 /* Begin a new scope. */
452 do_pushlevel (scope_kind sk
)
454 tree ret
= push_stmt_list ();
455 if (stmts_are_full_exprs_p ())
456 begin_scope (sk
, NULL
);
460 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
461 when the current scope is exited. EH_ONLY is true when this is not
462 meant to apply to normal control flow transfer. */
465 push_cleanup (tree decl
, tree cleanup
, bool eh_only
)
467 tree stmt
= build_stmt (CLEANUP_STMT
, NULL
, cleanup
, decl
);
468 CLEANUP_EH_ONLY (stmt
) = eh_only
;
470 CLEANUP_BODY (stmt
) = push_stmt_list ();
473 /* Begin a conditional that might contain a declaration. When generating
474 normal code, we want the declaration to appear before the statement
475 containing the conditional. When generating template code, we want the
476 conditional to be rendered as the raw DECL_EXPR. */
479 begin_cond (tree
*cond_p
)
481 if (processing_template_decl
)
482 *cond_p
= push_stmt_list ();
485 /* Finish such a conditional. */
488 finish_cond (tree
*cond_p
, tree expr
)
490 if (processing_template_decl
)
492 tree cond
= pop_stmt_list (*cond_p
);
493 if (TREE_CODE (cond
) == DECL_EXPR
)
499 /* If *COND_P specifies a conditional with a declaration, transform the
502 for (; A x = 42;) { }
504 while (true) { A x = 42; if (!x) break; }
505 for (;;) { A x = 42; if (!x) break; }
506 The statement list for BODY will be empty if the conditional did
507 not declare anything. */
510 simplify_loop_decl_cond (tree
*cond_p
, tree body
)
514 if (!TREE_SIDE_EFFECTS (body
))
518 *cond_p
= boolean_true_node
;
520 if_stmt
= begin_if_stmt ();
521 cond
= build_unary_op (TRUTH_NOT_EXPR
, cond
, 0);
522 finish_if_stmt_cond (cond
, if_stmt
);
523 finish_break_stmt ();
524 finish_then_clause (if_stmt
);
525 finish_if_stmt (if_stmt
);
528 /* Finish a goto-statement. */
531 finish_goto_stmt (tree destination
)
533 if (TREE_CODE (destination
) == IDENTIFIER_NODE
)
534 destination
= lookup_label (destination
);
536 /* We warn about unused labels with -Wunused. That means we have to
537 mark the used labels as used. */
538 if (TREE_CODE (destination
) == LABEL_DECL
)
539 TREE_USED (destination
) = 1;
542 /* The DESTINATION is being used as an rvalue. */
543 if (!processing_template_decl
)
544 destination
= decay_conversion (destination
);
545 /* We don't inline calls to functions with computed gotos.
546 Those functions are typically up to some funny business,
547 and may be depending on the labels being at particular
548 addresses, or some such. */
549 DECL_UNINLINABLE (current_function_decl
) = 1;
552 check_goto (destination
);
554 return add_stmt (build_stmt (GOTO_EXPR
, destination
));
557 /* COND is the condition-expression for an if, while, etc.,
558 statement. Convert it to a boolean value, if appropriate. */
561 maybe_convert_cond (tree cond
)
563 /* Empty conditions remain empty. */
567 /* Wait until we instantiate templates before doing conversion. */
568 if (processing_template_decl
)
571 /* Do the conversion. */
572 cond
= convert_from_reference (cond
);
573 return condition_conversion (cond
);
576 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
579 finish_expr_stmt (tree expr
)
583 if (expr
!= NULL_TREE
)
585 if (!processing_template_decl
)
587 if (warn_sequence_point
)
588 verify_sequence_points (expr
);
589 expr
= convert_to_void (expr
, "statement");
591 else if (!type_dependent_expression_p (expr
))
592 convert_to_void (build_non_dependent_expr (expr
), "statement");
594 /* Simplification of inner statement expressions, compound exprs,
595 etc can result in us already having an EXPR_STMT. */
596 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
598 if (TREE_CODE (expr
) != EXPR_STMT
)
599 expr
= build_stmt (EXPR_STMT
, expr
);
600 expr
= maybe_cleanup_point_expr_void (expr
);
612 /* Begin an if-statement. Returns a newly created IF_STMT if
619 scope
= do_pushlevel (sk_block
);
620 r
= build_stmt (IF_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
621 TREE_CHAIN (r
) = scope
;
622 begin_cond (&IF_COND (r
));
626 /* Process the COND of an if-statement, which may be given by
630 finish_if_stmt_cond (tree cond
, tree if_stmt
)
632 finish_cond (&IF_COND (if_stmt
), maybe_convert_cond (cond
));
634 THEN_CLAUSE (if_stmt
) = push_stmt_list ();
637 /* Finish the then-clause of an if-statement, which may be given by
641 finish_then_clause (tree if_stmt
)
643 THEN_CLAUSE (if_stmt
) = pop_stmt_list (THEN_CLAUSE (if_stmt
));
647 /* Begin the else-clause of an if-statement. */
650 begin_else_clause (tree if_stmt
)
652 ELSE_CLAUSE (if_stmt
) = push_stmt_list ();
655 /* Finish the else-clause of an if-statement, which may be given by
659 finish_else_clause (tree if_stmt
)
661 ELSE_CLAUSE (if_stmt
) = pop_stmt_list (ELSE_CLAUSE (if_stmt
));
664 /* Finish an if-statement. */
667 finish_if_stmt (tree if_stmt
)
669 tree scope
= TREE_CHAIN (if_stmt
);
670 TREE_CHAIN (if_stmt
) = NULL
;
671 add_stmt (do_poplevel (scope
));
675 /* Begin a while-statement. Returns a newly created WHILE_STMT if
679 begin_while_stmt (void)
682 r
= build_stmt (WHILE_STMT
, NULL_TREE
, NULL_TREE
);
684 WHILE_BODY (r
) = do_pushlevel (sk_block
);
685 begin_cond (&WHILE_COND (r
));
689 /* Process the COND of a while-statement, which may be given by
693 finish_while_stmt_cond (tree cond
, tree while_stmt
)
695 finish_cond (&WHILE_COND (while_stmt
), maybe_convert_cond (cond
));
696 simplify_loop_decl_cond (&WHILE_COND (while_stmt
), WHILE_BODY (while_stmt
));
699 /* Finish a while-statement, which may be given by WHILE_STMT. */
702 finish_while_stmt (tree while_stmt
)
704 WHILE_BODY (while_stmt
) = do_poplevel (WHILE_BODY (while_stmt
));
708 /* Begin a do-statement. Returns a newly created DO_STMT if
714 tree r
= build_stmt (DO_STMT
, NULL_TREE
, NULL_TREE
);
716 DO_BODY (r
) = push_stmt_list ();
720 /* Finish the body of a do-statement, which may be given by DO_STMT. */
723 finish_do_body (tree do_stmt
)
725 DO_BODY (do_stmt
) = pop_stmt_list (DO_BODY (do_stmt
));
728 /* Finish a do-statement, which may be given by DO_STMT, and whose
729 COND is as indicated. */
732 finish_do_stmt (tree cond
, tree do_stmt
)
734 cond
= maybe_convert_cond (cond
);
735 DO_COND (do_stmt
) = cond
;
739 /* Finish a return-statement. The EXPRESSION returned, if any, is as
743 finish_return_stmt (tree expr
)
747 expr
= check_return_expr (expr
);
748 if (!processing_template_decl
)
750 if (DECL_DESTRUCTOR_P (current_function_decl
)
751 || (DECL_CONSTRUCTOR_P (current_function_decl
)
752 && targetm
.cxx
.cdtor_returns_this ()))
754 /* Similarly, all destructors must run destructors for
755 base-classes before returning. So, all returns in a
756 destructor get sent to the DTOR_LABEL; finish_function emits
757 code to return a value there. */
758 return finish_goto_stmt (cdtor_label
);
762 r
= build_stmt (RETURN_EXPR
, expr
);
763 r
= maybe_cleanup_point_expr_void (r
);
770 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
773 begin_for_stmt (void)
777 r
= build_stmt (FOR_STMT
, NULL_TREE
, NULL_TREE
,
778 NULL_TREE
, NULL_TREE
);
780 if (flag_new_for_scope
> 0)
781 TREE_CHAIN (r
) = do_pushlevel (sk_for
);
783 if (processing_template_decl
)
784 FOR_INIT_STMT (r
) = push_stmt_list ();
789 /* Finish the for-init-statement of a for-statement, which may be
790 given by FOR_STMT. */
793 finish_for_init_stmt (tree for_stmt
)
795 if (processing_template_decl
)
796 FOR_INIT_STMT (for_stmt
) = pop_stmt_list (FOR_INIT_STMT (for_stmt
));
798 FOR_BODY (for_stmt
) = do_pushlevel (sk_block
);
799 begin_cond (&FOR_COND (for_stmt
));
802 /* Finish the COND of a for-statement, which may be given by
806 finish_for_cond (tree cond
, tree for_stmt
)
808 finish_cond (&FOR_COND (for_stmt
), maybe_convert_cond (cond
));
809 simplify_loop_decl_cond (&FOR_COND (for_stmt
), FOR_BODY (for_stmt
));
812 /* Finish the increment-EXPRESSION in a for-statement, which may be
813 given by FOR_STMT. */
816 finish_for_expr (tree expr
, tree for_stmt
)
820 /* If EXPR is an overloaded function, issue an error; there is no
821 context available to use to perform overload resolution. */
822 if (type_unknown_p (expr
))
824 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
825 expr
= error_mark_node
;
827 if (!processing_template_decl
)
829 if (warn_sequence_point
)
830 verify_sequence_points (expr
);
831 expr
= convert_to_void (expr
, "3rd expression in for");
833 else if (!type_dependent_expression_p (expr
))
834 convert_to_void (build_non_dependent_expr (expr
), "3rd expression in for");
835 expr
= maybe_cleanup_point_expr_void (expr
);
836 FOR_EXPR (for_stmt
) = expr
;
839 /* Finish the body of a for-statement, which may be given by
840 FOR_STMT. The increment-EXPR for the loop must be
844 finish_for_stmt (tree for_stmt
)
846 FOR_BODY (for_stmt
) = do_poplevel (FOR_BODY (for_stmt
));
848 /* Pop the scope for the body of the loop. */
849 if (flag_new_for_scope
> 0)
851 tree scope
= TREE_CHAIN (for_stmt
);
852 TREE_CHAIN (for_stmt
) = NULL
;
853 add_stmt (do_poplevel (scope
));
859 /* Finish a break-statement. */
862 finish_break_stmt (void)
864 return add_stmt (build_stmt (BREAK_STMT
));
867 /* Finish a continue-statement. */
870 finish_continue_stmt (void)
872 return add_stmt (build_stmt (CONTINUE_STMT
));
875 /* Begin a switch-statement. Returns a new SWITCH_STMT if
879 begin_switch_stmt (void)
883 r
= build_stmt (SWITCH_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
885 scope
= do_pushlevel (sk_block
);
886 TREE_CHAIN (r
) = scope
;
887 begin_cond (&SWITCH_STMT_COND (r
));
892 /* Finish the cond of a switch-statement. */
895 finish_switch_cond (tree cond
, tree switch_stmt
)
897 tree orig_type
= NULL
;
898 if (!processing_template_decl
)
902 /* Convert the condition to an integer or enumeration type. */
903 cond
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, cond
, true);
904 if (cond
== NULL_TREE
)
906 error ("switch quantity not an integer");
907 cond
= error_mark_node
;
909 orig_type
= TREE_TYPE (cond
);
910 if (cond
!= error_mark_node
)
914 Integral promotions are performed. */
915 cond
= perform_integral_promotions (cond
);
916 cond
= maybe_cleanup_point_expr (cond
);
919 if (cond
!= error_mark_node
)
921 index
= get_unwidened (cond
, NULL_TREE
);
922 /* We can't strip a conversion from a signed type to an unsigned,
923 because if we did, int_fits_type_p would do the wrong thing
924 when checking case values for being in range,
925 and it's too hard to do the right thing. */
926 if (TYPE_UNSIGNED (TREE_TYPE (cond
))
927 == TYPE_UNSIGNED (TREE_TYPE (index
)))
931 finish_cond (&SWITCH_STMT_COND (switch_stmt
), cond
);
932 SWITCH_STMT_TYPE (switch_stmt
) = orig_type
;
933 add_stmt (switch_stmt
);
934 push_switch (switch_stmt
);
935 SWITCH_STMT_BODY (switch_stmt
) = push_stmt_list ();
938 /* Finish the body of a switch-statement, which may be given by
939 SWITCH_STMT. The COND to switch on is indicated. */
942 finish_switch_stmt (tree switch_stmt
)
946 SWITCH_STMT_BODY (switch_stmt
) =
947 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt
));
951 scope
= TREE_CHAIN (switch_stmt
);
952 TREE_CHAIN (switch_stmt
) = NULL
;
953 add_stmt (do_poplevel (scope
));
956 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
960 begin_try_block (void)
962 tree r
= build_stmt (TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
964 TRY_STMTS (r
) = push_stmt_list ();
968 /* Likewise, for a function-try-block. */
971 begin_function_try_block (void)
973 tree r
= begin_try_block ();
974 FN_TRY_BLOCK_P (r
) = 1;
978 /* Finish a try-block, which may be given by TRY_BLOCK. */
981 finish_try_block (tree try_block
)
983 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
984 TRY_HANDLERS (try_block
) = push_stmt_list ();
987 /* Finish the body of a cleanup try-block, which may be given by
991 finish_cleanup_try_block (tree try_block
)
993 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
996 /* Finish an implicitly generated try-block, with a cleanup is given
1000 finish_cleanup (tree cleanup
, tree try_block
)
1002 TRY_HANDLERS (try_block
) = cleanup
;
1003 CLEANUP_P (try_block
) = 1;
1006 /* Likewise, for a function-try-block. */
1009 finish_function_try_block (tree try_block
)
1011 finish_try_block (try_block
);
1012 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1013 the try block, but moving it inside. */
1014 in_function_try_handler
= 1;
1017 /* Finish a handler-sequence for a try-block, which may be given by
1021 finish_handler_sequence (tree try_block
)
1023 TRY_HANDLERS (try_block
) = pop_stmt_list (TRY_HANDLERS (try_block
));
1024 check_handlers (TRY_HANDLERS (try_block
));
1027 /* Likewise, for a function-try-block. */
1030 finish_function_handler_sequence (tree try_block
)
1032 in_function_try_handler
= 0;
1033 finish_handler_sequence (try_block
);
1036 /* Begin a handler. Returns a HANDLER if appropriate. */
1039 begin_handler (void)
1043 r
= build_stmt (HANDLER
, NULL_TREE
, NULL_TREE
);
1046 /* Create a binding level for the eh_info and the exception object
1048 HANDLER_BODY (r
) = do_pushlevel (sk_catch
);
1053 /* Finish the handler-parameters for a handler, which may be given by
1054 HANDLER. DECL is the declaration for the catch parameter, or NULL
1055 if this is a `catch (...)' clause. */
1058 finish_handler_parms (tree decl
, tree handler
)
1060 tree type
= NULL_TREE
;
1061 if (processing_template_decl
)
1065 decl
= pushdecl (decl
);
1066 decl
= push_template_decl (decl
);
1067 HANDLER_PARMS (handler
) = decl
;
1068 type
= TREE_TYPE (decl
);
1072 type
= expand_start_catch_block (decl
);
1074 HANDLER_TYPE (handler
) = type
;
1075 if (!processing_template_decl
&& type
)
1076 mark_used (eh_type_info (type
));
1079 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1080 the return value from the matching call to finish_handler_parms. */
1083 finish_handler (tree handler
)
1085 if (!processing_template_decl
)
1086 expand_end_catch_block ();
1087 HANDLER_BODY (handler
) = do_poplevel (HANDLER_BODY (handler
));
1090 /* Begin a compound statement. FLAGS contains some bits that control the
1091 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1092 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1093 block of a function. If BCS_TRY_BLOCK is set, this is the block
1094 created on behalf of a TRY statement. Returns a token to be passed to
1095 finish_compound_stmt. */
1098 begin_compound_stmt (unsigned int flags
)
1102 if (flags
& BCS_NO_SCOPE
)
1104 r
= push_stmt_list ();
1105 STATEMENT_LIST_NO_SCOPE (r
) = 1;
1107 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1108 But, if it's a statement-expression with a scopeless block, there's
1109 nothing to keep, and we don't want to accidentally keep a block
1110 *inside* the scopeless block. */
1111 keep_next_level (false);
1114 r
= do_pushlevel (flags
& BCS_TRY_BLOCK
? sk_try
: sk_block
);
1116 /* When processing a template, we need to remember where the braces were,
1117 so that we can set up identical scopes when instantiating the template
1118 later. BIND_EXPR is a handy candidate for this.
1119 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1120 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1121 processing templates. */
1122 if (processing_template_decl
)
1124 r
= build3 (BIND_EXPR
, NULL
, NULL
, r
, NULL
);
1125 BIND_EXPR_TRY_BLOCK (r
) = (flags
& BCS_TRY_BLOCK
) != 0;
1126 BIND_EXPR_BODY_BLOCK (r
) = (flags
& BCS_FN_BODY
) != 0;
1127 TREE_SIDE_EFFECTS (r
) = 1;
1133 /* Finish a compound-statement, which is given by STMT. */
1136 finish_compound_stmt (tree stmt
)
1138 if (TREE_CODE (stmt
) == BIND_EXPR
)
1139 BIND_EXPR_BODY (stmt
) = do_poplevel (BIND_EXPR_BODY (stmt
));
1140 else if (STATEMENT_LIST_NO_SCOPE (stmt
))
1141 stmt
= pop_stmt_list (stmt
);
1144 /* Destroy any ObjC "super" receivers that may have been
1146 objc_clear_super_receiver ();
1148 stmt
= do_poplevel (stmt
);
1151 /* ??? See c_end_compound_stmt wrt statement expressions. */
1156 /* Finish an asm-statement, whose components are a STRING, some
1157 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1158 whether the asm-statement should be considered volatile. */
1161 finish_asm_stmt (int volatile_p
, tree string
, tree output_operands
,
1162 tree input_operands
, tree clobbers
)
1167 if (!processing_template_decl
)
1169 int ninputs
, noutputs
;
1170 const char *constraint
;
1171 const char **oconstraints
;
1172 bool allows_mem
, allows_reg
, is_inout
;
1176 ninputs
= list_length (input_operands
);
1177 noutputs
= list_length (output_operands
);
1178 oconstraints
= (const char **) alloca (noutputs
* sizeof (char *));
1180 string
= resolve_asm_operand_names (string
, output_operands
,
1183 for (i
= 0, t
= output_operands
; t
; t
= TREE_CHAIN (t
), ++i
)
1185 operand
= TREE_VALUE (t
);
1187 /* ??? Really, this should not be here. Users should be using a
1188 proper lvalue, dammit. But there's a long history of using
1189 casts in the output operands. In cases like longlong.h, this
1190 becomes a primitive form of typechecking -- if the cast can be
1191 removed, then the output operand had a type of the proper width;
1192 otherwise we'll get an error. Gross, but ... */
1193 STRIP_NOPS (operand
);
1195 if (!lvalue_or_else (operand
, lv_asm
))
1196 operand
= error_mark_node
;
1198 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1199 oconstraints
[i
] = constraint
;
1201 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
1202 &allows_mem
, &allows_reg
, &is_inout
))
1204 /* If the operand is going to end up in memory,
1205 mark it addressable. */
1206 if (!allows_reg
&& !cxx_mark_addressable (operand
))
1207 operand
= error_mark_node
;
1210 operand
= error_mark_node
;
1212 TREE_VALUE (t
) = operand
;
1215 for (i
= 0, t
= input_operands
; t
; ++i
, t
= TREE_CHAIN (t
))
1217 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1218 operand
= decay_conversion (TREE_VALUE (t
));
1220 /* If the type of the operand hasn't been determined (e.g.,
1221 because it involves an overloaded function), then issue
1222 an error message. There's no context available to
1223 resolve the overloading. */
1224 if (TREE_TYPE (operand
) == unknown_type_node
)
1226 error ("type of asm operand %qE could not be determined",
1228 operand
= error_mark_node
;
1231 if (parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
1232 oconstraints
, &allows_mem
, &allows_reg
))
1234 /* If the operand is going to end up in memory,
1235 mark it addressable. */
1236 if (!allows_reg
&& allows_mem
)
1238 /* Strip the nops as we allow this case. FIXME, this really
1239 should be rejected or made deprecated. */
1240 STRIP_NOPS (operand
);
1241 if (!cxx_mark_addressable (operand
))
1242 operand
= error_mark_node
;
1246 operand
= error_mark_node
;
1248 TREE_VALUE (t
) = operand
;
1252 r
= build_stmt (ASM_EXPR
, string
,
1253 output_operands
, input_operands
,
1255 ASM_VOLATILE_P (r
) = volatile_p
;
1256 r
= maybe_cleanup_point_expr_void (r
);
1257 return add_stmt (r
);
1260 /* Finish a label with the indicated NAME. */
1263 finish_label_stmt (tree name
)
1265 tree decl
= define_label (input_location
, name
);
1266 return add_stmt (build_stmt (LABEL_EXPR
, decl
));
1269 /* Finish a series of declarations for local labels. G++ allows users
1270 to declare "local" labels, i.e., labels with scope. This extension
1271 is useful when writing code involving statement-expressions. */
1274 finish_label_decl (tree name
)
1276 tree decl
= declare_local_label (name
);
1277 add_decl_expr (decl
);
1280 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1283 finish_decl_cleanup (tree decl
, tree cleanup
)
1285 push_cleanup (decl
, cleanup
, false);
1288 /* If the current scope exits with an exception, run CLEANUP. */
1291 finish_eh_cleanup (tree cleanup
)
1293 push_cleanup (NULL
, cleanup
, true);
1296 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1297 order they were written by the user. Each node is as for
1298 emit_mem_initializers. */
1301 finish_mem_initializers (tree mem_inits
)
1303 /* Reorder the MEM_INITS so that they are in the order they appeared
1304 in the source program. */
1305 mem_inits
= nreverse (mem_inits
);
1307 if (processing_template_decl
)
1308 add_stmt (build_min_nt (CTOR_INITIALIZER
, mem_inits
));
1310 emit_mem_initializers (mem_inits
);
1313 /* Finish a parenthesized expression EXPR. */
1316 finish_parenthesized_expr (tree expr
)
1319 /* This inhibits warnings in c_common_truthvalue_conversion. */
1320 TREE_NO_WARNING (expr
) = 1;
1322 if (TREE_CODE (expr
) == OFFSET_REF
)
1323 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1324 enclosed in parentheses. */
1325 PTRMEM_OK_P (expr
) = 0;
1327 if (TREE_CODE (expr
) == STRING_CST
)
1328 PAREN_STRING_LITERAL_P (expr
) = 1;
1333 /* Finish a reference to a non-static data member (DECL) that is not
1334 preceded by `.' or `->'. */
1337 finish_non_static_data_member (tree decl
, tree object
, tree qualifying_scope
)
1339 gcc_assert (TREE_CODE (decl
) == FIELD_DECL
);
1343 if (current_function_decl
1344 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1345 error ("invalid use of member %q+D in static member function", decl
);
1347 error ("invalid use of non-static data member %q+D", decl
);
1348 error ("from this location");
1350 return error_mark_node
;
1352 TREE_USED (current_class_ptr
) = 1;
1353 if (processing_template_decl
&& !qualifying_scope
)
1355 tree type
= TREE_TYPE (decl
);
1357 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1358 type
= TREE_TYPE (type
);
1361 /* Set the cv qualifiers. */
1362 int quals
= cp_type_quals (TREE_TYPE (current_class_ref
));
1364 if (DECL_MUTABLE_P (decl
))
1365 quals
&= ~TYPE_QUAL_CONST
;
1367 quals
|= cp_type_quals (TREE_TYPE (decl
));
1368 type
= cp_build_qualified_type (type
, quals
);
1371 return build_min (COMPONENT_REF
, type
, object
, decl
, NULL_TREE
);
1375 tree access_type
= TREE_TYPE (object
);
1376 tree lookup_context
= context_for_name_lookup (decl
);
1378 while (!DERIVED_FROM_P (lookup_context
, access_type
))
1380 access_type
= TYPE_CONTEXT (access_type
);
1381 while (access_type
&& DECL_P (access_type
))
1382 access_type
= DECL_CONTEXT (access_type
);
1386 error ("object missing in reference to %q+D", decl
);
1387 error ("from this location");
1388 return error_mark_node
;
1392 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1393 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1395 if (processing_template_decl
)
1396 return build_min (SCOPE_REF
, TREE_TYPE (decl
),
1397 qualifying_scope
, DECL_NAME (decl
));
1399 perform_or_defer_access_check (TYPE_BINFO (access_type
), decl
);
1401 /* If the data member was named `C::M', convert `*this' to `C'
1403 if (qualifying_scope
)
1405 tree binfo
= NULL_TREE
;
1406 object
= build_scoped_ref (object
, qualifying_scope
,
1410 return build_class_member_access_expr (object
, decl
,
1411 /*access_path=*/NULL_TREE
,
1412 /*preserve_reference=*/false);
1416 /* DECL was the declaration to which a qualified-id resolved. Issue
1417 an error message if it is not accessible. If OBJECT_TYPE is
1418 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1419 type of `*x', or `x', respectively. If the DECL was named as
1420 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1423 check_accessibility_of_qualified_id (tree decl
,
1425 tree nested_name_specifier
)
1428 tree qualifying_type
= NULL_TREE
;
1430 /* If we're not checking, return immediately. */
1431 if (deferred_access_no_check
)
1434 /* Determine the SCOPE of DECL. */
1435 scope
= context_for_name_lookup (decl
);
1436 /* If the SCOPE is not a type, then DECL is not a member. */
1437 if (!TYPE_P (scope
))
1439 /* Compute the scope through which DECL is being accessed. */
1441 /* OBJECT_TYPE might not be a class type; consider:
1443 class A { typedef int I; };
1447 In this case, we will have "A::I" as the DECL, but "I" as the
1449 && CLASS_TYPE_P (object_type
)
1450 && DERIVED_FROM_P (scope
, object_type
))
1451 /* If we are processing a `->' or `.' expression, use the type of the
1453 qualifying_type
= object_type
;
1454 else if (nested_name_specifier
)
1456 /* If the reference is to a non-static member of the
1457 current class, treat it as if it were referenced through
1459 if (DECL_NONSTATIC_MEMBER_P (decl
)
1460 && current_class_ptr
1461 && DERIVED_FROM_P (scope
, current_class_type
))
1462 qualifying_type
= current_class_type
;
1463 /* Otherwise, use the type indicated by the
1464 nested-name-specifier. */
1466 qualifying_type
= nested_name_specifier
;
1469 /* Otherwise, the name must be from the current class or one of
1471 qualifying_type
= currently_open_derived_class (scope
);
1473 if (qualifying_type
&& IS_AGGR_TYPE_CODE (TREE_CODE (qualifying_type
)))
1474 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1475 or similar in a default argument value. */
1476 perform_or_defer_access_check (TYPE_BINFO (qualifying_type
), decl
);
1479 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1480 class named to the left of the "::" operator. DONE is true if this
1481 expression is a complete postfix-expression; it is false if this
1482 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1483 iff this expression is the operand of '&'. */
1486 finish_qualified_id_expr (tree qualifying_class
, tree expr
, bool done
,
1489 if (error_operand_p (expr
))
1490 return error_mark_node
;
1492 /* If EXPR occurs as the operand of '&', use special handling that
1493 permits a pointer-to-member. */
1494 if (address_p
&& done
)
1496 if (TREE_CODE (expr
) == SCOPE_REF
)
1497 expr
= TREE_OPERAND (expr
, 1);
1498 expr
= build_offset_ref (qualifying_class
, expr
,
1499 /*address_p=*/true);
1503 if (TREE_CODE (expr
) == FIELD_DECL
)
1504 expr
= finish_non_static_data_member (expr
, current_class_ref
,
1506 else if (BASELINK_P (expr
) && !processing_template_decl
)
1510 /* See if any of the functions are non-static members. */
1511 fns
= BASELINK_FUNCTIONS (expr
);
1512 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
1513 fns
= TREE_OPERAND (fns
, 0);
1514 /* If so, the expression may be relative to the current
1516 if (!shared_member_p (fns
)
1517 && current_class_type
1518 && DERIVED_FROM_P (qualifying_class
, current_class_type
))
1519 expr
= (build_class_member_access_expr
1520 (maybe_dummy_object (qualifying_class
, NULL
),
1522 BASELINK_ACCESS_BINFO (expr
),
1523 /*preserve_reference=*/false));
1525 /* The expression is a qualified name whose address is not
1527 expr
= build_offset_ref (qualifying_class
, expr
, /*address_p=*/false);
1533 /* Begin a statement-expression. The value returned must be passed to
1534 finish_stmt_expr. */
1537 begin_stmt_expr (void)
1539 return push_stmt_list ();
1542 /* Process the final expression of a statement expression. EXPR can be
1543 NULL, if the final expression is empty. Build up a TARGET_EXPR so
1544 that the result value can be safely returned to the enclosing
1548 finish_stmt_expr_expr (tree expr
, tree stmt_expr
)
1550 tree result
= NULL_TREE
;
1552 if (error_operand_p (expr
))
1553 return error_mark_node
;
1557 if (!processing_template_decl
&& !VOID_TYPE_P (TREE_TYPE (expr
)))
1559 tree type
= TREE_TYPE (expr
);
1561 if (TREE_CODE (type
) == ARRAY_TYPE
1562 || TREE_CODE (type
) == FUNCTION_TYPE
)
1563 expr
= decay_conversion (expr
);
1565 expr
= require_complete_type (expr
);
1567 type
= TREE_TYPE (expr
);
1569 /* Build a TARGET_EXPR for this aggregate. finish_stmt_expr
1570 will then pull it apart so the lifetime of the target is
1571 within the scope of the expression containing this statement
1573 if (TREE_CODE (expr
) == TARGET_EXPR
)
1575 else if (!IS_AGGR_TYPE (type
) || TYPE_HAS_TRIVIAL_INIT_REF (type
))
1576 expr
= build_target_expr_with_type (expr
, type
);
1579 /* Copy construct. */
1580 expr
= build_special_member_call
1581 (NULL_TREE
, complete_ctor_identifier
,
1582 build_tree_list (NULL_TREE
, expr
),
1583 type
, LOOKUP_NORMAL
);
1584 expr
= build_cplus_new (type
, expr
);
1585 gcc_assert (TREE_CODE (expr
) == TARGET_EXPR
);
1589 if (expr
!= error_mark_node
)
1591 result
= build_stmt (EXPR_STMT
, expr
);
1592 EXPR_STMT_STMT_EXPR_RESULT (result
) = 1;
1599 /* Remember the last expression so that finish_stmt_expr
1600 can pull it apart. */
1601 TREE_TYPE (stmt_expr
) = result
;
1606 /* Finish a statement-expression. EXPR should be the value returned
1607 by the previous begin_stmt_expr. Returns an expression
1608 representing the statement-expression. */
1611 finish_stmt_expr (tree stmt_expr
, bool has_no_scope
)
1613 tree result
, result_stmt
, type
;
1614 tree
*result_stmt_p
= NULL
;
1616 result_stmt
= TREE_TYPE (stmt_expr
);
1617 TREE_TYPE (stmt_expr
) = void_type_node
;
1618 result
= pop_stmt_list (stmt_expr
);
1620 if (!result_stmt
|| VOID_TYPE_P (result_stmt
))
1621 type
= void_type_node
;
1624 /* We need to search the statement expression for the result_stmt,
1625 since we'll need to replace it entirely. */
1627 result_stmt_p
= &result
;
1631 if (t
== result_stmt
)
1634 switch (TREE_CODE (t
))
1636 case STATEMENT_LIST
:
1638 tree_stmt_iterator i
= tsi_last (t
);
1639 result_stmt_p
= tsi_stmt_ptr (i
);
1643 result_stmt_p
= &BIND_EXPR_BODY (t
);
1645 case TRY_FINALLY_EXPR
:
1646 case TRY_CATCH_EXPR
:
1648 result_stmt_p
= &TREE_OPERAND (t
, 0);
1654 type
= TREE_TYPE (EXPR_STMT_EXPR (result_stmt
));
1657 if (processing_template_decl
)
1659 result
= build_min (STMT_EXPR
, type
, result
);
1660 TREE_SIDE_EFFECTS (result
) = 1;
1661 STMT_EXPR_NO_SCOPE (result
) = has_no_scope
;
1663 else if (!VOID_TYPE_P (type
))
1665 /* Pull out the TARGET_EXPR that is the final expression. Put
1666 the target's init_expr as the final expression and then put
1667 the statement expression itself as the target's init
1668 expr. Finally, return the target expression. */
1669 tree init
, target_expr
= EXPR_STMT_EXPR (result_stmt
);
1670 gcc_assert (TREE_CODE (target_expr
) == TARGET_EXPR
);
1672 /* The initializer will be void if the initialization is done by
1673 AGGR_INIT_EXPR; propagate that out to the statement-expression as
1675 init
= TREE_OPERAND (target_expr
, 1);
1676 type
= TREE_TYPE (init
);
1678 init
= maybe_cleanup_point_expr (init
);
1679 *result_stmt_p
= init
;
1681 if (VOID_TYPE_P (type
))
1682 /* No frobbing needed. */;
1683 else if (TREE_CODE (result
) == BIND_EXPR
)
1685 /* The BIND_EXPR created in finish_compound_stmt is void; if we're
1686 returning a value directly, give it the appropriate type. */
1687 if (VOID_TYPE_P (TREE_TYPE (result
)))
1688 TREE_TYPE (result
) = type
;
1690 gcc_assert (same_type_p (TREE_TYPE (result
), type
));
1692 else if (TREE_CODE (result
) == STATEMENT_LIST
)
1693 /* We need to wrap a STATEMENT_LIST in a BIND_EXPR so it can have a
1694 type other than void. FIXME why can't we just return a value
1695 from STATEMENT_LIST? */
1696 result
= build3 (BIND_EXPR
, type
, NULL
, result
, NULL
);
1698 TREE_OPERAND (target_expr
, 1) = result
;
1699 result
= target_expr
;
1705 /* Perform Koenig lookup. FN is the postfix-expression representing
1706 the function (or functions) to call; ARGS are the arguments to the
1707 call. Returns the functions to be considered by overload
1711 perform_koenig_lookup (tree fn
, tree args
)
1713 tree identifier
= NULL_TREE
;
1714 tree functions
= NULL_TREE
;
1716 /* Find the name of the overloaded function. */
1717 if (TREE_CODE (fn
) == IDENTIFIER_NODE
)
1719 else if (is_overloaded_fn (fn
))
1722 identifier
= DECL_NAME (get_first_fn (functions
));
1724 else if (DECL_P (fn
))
1727 identifier
= DECL_NAME (fn
);
1730 /* A call to a namespace-scope function using an unqualified name.
1732 Do Koenig lookup -- unless any of the arguments are
1734 if (!any_type_dependent_arguments_p (args
))
1736 fn
= lookup_arg_dependent (identifier
, functions
, args
);
1738 /* The unqualified name could not be resolved. */
1739 fn
= unqualified_fn_lookup_error (identifier
);
1747 /* Generate an expression for `FN (ARGS)'.
1749 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1750 as a virtual call, even if FN is virtual. (This flag is set when
1751 encountering an expression where the function name is explicitly
1752 qualified. For example a call to `X::f' never generates a virtual
1755 Returns code for the call. */
1758 finish_call_expr (tree fn
, tree args
, bool disallow_virtual
, bool koenig_p
)
1764 if (fn
== error_mark_node
|| args
== error_mark_node
)
1765 return error_mark_node
;
1767 /* ARGS should be a list of arguments. */
1768 gcc_assert (!args
|| TREE_CODE (args
) == TREE_LIST
);
1773 if (processing_template_decl
)
1775 if (type_dependent_expression_p (fn
)
1776 || any_type_dependent_arguments_p (args
))
1778 result
= build_nt (CALL_EXPR
, fn
, args
, NULL_TREE
);
1779 KOENIG_LOOKUP_P (result
) = koenig_p
;
1782 if (!BASELINK_P (fn
)
1783 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
1784 && TREE_TYPE (fn
) != unknown_type_node
)
1785 fn
= build_non_dependent_expr (fn
);
1786 args
= build_non_dependent_args (orig_args
);
1789 /* A reference to a member function will appear as an overloaded
1790 function (rather than a BASELINK) if an unqualified name was used
1792 if (!BASELINK_P (fn
) && is_overloaded_fn (fn
))
1796 if (TREE_CODE (f
) == TEMPLATE_ID_EXPR
)
1797 f
= TREE_OPERAND (f
, 0);
1798 f
= get_first_fn (f
);
1799 if (DECL_FUNCTION_MEMBER_P (f
))
1801 tree type
= currently_open_derived_class (DECL_CONTEXT (f
));
1803 type
= DECL_CONTEXT (f
);
1804 fn
= build_baselink (TYPE_BINFO (type
),
1806 fn
, /*optype=*/NULL_TREE
);
1811 if (BASELINK_P (fn
))
1815 /* A call to a member function. From [over.call.func]:
1817 If the keyword this is in scope and refers to the class of
1818 that member function, or a derived class thereof, then the
1819 function call is transformed into a qualified function call
1820 using (*this) as the postfix-expression to the left of the
1821 . operator.... [Otherwise] a contrived object of type T
1822 becomes the implied object argument.
1824 This paragraph is unclear about this situation:
1826 struct A { void f(); };
1827 struct B : public A {};
1828 struct C : public A { void g() { B::f(); }};
1830 In particular, for `B::f', this paragraph does not make clear
1831 whether "the class of that member function" refers to `A' or
1832 to `B'. We believe it refers to `B'. */
1833 if (current_class_type
1834 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
1836 && current_class_ref
)
1837 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
1841 tree representative_fn
;
1843 representative_fn
= BASELINK_FUNCTIONS (fn
);
1844 if (TREE_CODE (representative_fn
) == TEMPLATE_ID_EXPR
)
1845 representative_fn
= TREE_OPERAND (representative_fn
, 0);
1846 representative_fn
= get_first_fn (representative_fn
);
1847 object
= build_dummy_object (DECL_CONTEXT (representative_fn
));
1850 if (processing_template_decl
)
1852 if (type_dependent_expression_p (object
))
1853 return build_nt (CALL_EXPR
, orig_fn
, orig_args
, NULL_TREE
);
1854 object
= build_non_dependent_expr (object
);
1857 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
1859 ? LOOKUP_NONVIRTUAL
: 0));
1861 else if (is_overloaded_fn (fn
))
1863 /* If the function is an overloaded builtin, resolve it. */
1864 if (TREE_CODE (fn
) == FUNCTION_DECL
1865 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
1866 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
1867 result
= resolve_overloaded_builtin (fn
, args
);
1870 /* A call to a namespace-scope function. */
1871 result
= build_new_function_call (fn
, args
);
1873 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
1876 error ("arguments to destructor are not allowed");
1877 /* Mark the pseudo-destructor call as having side-effects so
1878 that we do not issue warnings about its use. */
1879 result
= build1 (NOP_EXPR
,
1881 TREE_OPERAND (fn
, 0));
1882 TREE_SIDE_EFFECTS (result
) = 1;
1884 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
1885 /* If the "function" is really an object of class type, it might
1886 have an overloaded `operator ()'. */
1887 result
= build_new_op (CALL_EXPR
, LOOKUP_NORMAL
, fn
, args
, NULL_TREE
,
1888 /*overloaded_p=*/NULL
);
1891 /* A call where the function is unknown. */
1892 result
= build_function_call (fn
, args
);
1894 if (processing_template_decl
)
1896 result
= build3 (CALL_EXPR
, TREE_TYPE (result
), orig_fn
,
1897 orig_args
, NULL_TREE
);
1898 KOENIG_LOOKUP_P (result
) = koenig_p
;
1903 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1904 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1905 POSTDECREMENT_EXPR.) */
1908 finish_increment_expr (tree expr
, enum tree_code code
)
1910 return build_x_unary_op (code
, expr
);
1913 /* Finish a use of `this'. Returns an expression for `this'. */
1916 finish_this_expr (void)
1920 if (current_class_ptr
)
1922 result
= current_class_ptr
;
1924 else if (current_function_decl
1925 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1927 error ("%<this%> is unavailable for static member functions");
1928 result
= error_mark_node
;
1932 if (current_function_decl
)
1933 error ("invalid use of %<this%> in non-member function");
1935 error ("invalid use of %<this%> at top level");
1936 result
= error_mark_node
;
1942 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
1943 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
1944 the TYPE for the type given. If SCOPE is non-NULL, the expression
1945 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
1948 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
)
1950 if (destructor
== error_mark_node
)
1951 return error_mark_node
;
1953 gcc_assert (TYPE_P (destructor
));
1955 if (!processing_template_decl
)
1957 if (scope
== error_mark_node
)
1959 error ("invalid qualifying scope in pseudo-destructor name");
1960 return error_mark_node
;
1963 /* [expr.pseudo] says both:
1965 The type designated by the pseudo-destructor-name shall be
1966 the same as the object type.
1970 The cv-unqualified versions of the object type and of the
1971 type designated by the pseudo-destructor-name shall be the
1974 We implement the more generous second sentence, since that is
1975 what most other compilers do. */
1976 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
1979 error ("%qE is not of type %qT", object
, destructor
);
1980 return error_mark_node
;
1984 return build3 (PSEUDO_DTOR_EXPR
, void_type_node
, object
, scope
, destructor
);
1987 /* Finish an expression of the form CODE EXPR. */
1990 finish_unary_op_expr (enum tree_code code
, tree expr
)
1992 tree result
= build_x_unary_op (code
, expr
);
1993 /* Inside a template, build_x_unary_op does not fold the
1994 expression. So check whether the result is folded before
1995 setting TREE_NEGATED_INT. */
1996 if (code
== NEGATE_EXPR
&& TREE_CODE (expr
) == INTEGER_CST
1997 && TREE_CODE (result
) == INTEGER_CST
1998 && !TYPE_UNSIGNED (TREE_TYPE (result
))
1999 && INT_CST_LT (result
, integer_zero_node
))
2001 /* RESULT may be a cached INTEGER_CST, so we must copy it before
2002 setting TREE_NEGATED_INT. */
2003 result
= copy_node (result
);
2004 TREE_NEGATED_INT (result
) = 1;
2006 overflow_warning (result
);
2010 /* Finish a compound-literal expression. TYPE is the type to which
2011 the INITIALIZER_LIST is being cast. */
2014 finish_compound_literal (tree type
, tree initializer_list
)
2016 tree compound_literal
;
2018 /* Build a CONSTRUCTOR for the INITIALIZER_LIST. */
2019 compound_literal
= build_constructor (NULL_TREE
, initializer_list
);
2020 /* Mark it as a compound-literal. */
2021 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2022 if (processing_template_decl
)
2023 TREE_TYPE (compound_literal
) = type
;
2026 /* Check the initialization. */
2027 compound_literal
= digest_init (type
, compound_literal
, NULL
);
2028 /* If the TYPE was an array type with an unknown bound, then we can
2029 figure out the dimension now. For example, something like:
2033 implies that the array has two elements. */
2034 if (TREE_CODE (type
) == ARRAY_TYPE
&& !COMPLETE_TYPE_P (type
))
2035 cp_complete_array_type (&TREE_TYPE (compound_literal
),
2036 compound_literal
, 1);
2039 return compound_literal
;
2042 /* Return the declaration for the function-name variable indicated by
2046 finish_fname (tree id
)
2050 decl
= fname_decl (C_RID_CODE (id
), id
);
2051 if (processing_template_decl
)
2052 decl
= DECL_NAME (decl
);
2056 /* Finish a translation unit. */
2059 finish_translation_unit (void)
2061 /* In case there were missing closebraces,
2062 get us back to the global binding level. */
2064 while (current_namespace
!= global_namespace
)
2067 /* Do file scope __FUNCTION__ et al. */
2068 finish_fname_decls ();
2071 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2072 Returns the parameter. */
2075 finish_template_type_parm (tree aggr
, tree identifier
)
2077 if (aggr
!= class_type_node
)
2079 pedwarn ("template type parameters must use the keyword %<class%> or %<typename%>");
2080 aggr
= class_type_node
;
2083 return build_tree_list (aggr
, identifier
);
2086 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2087 Returns the parameter. */
2090 finish_template_template_parm (tree aggr
, tree identifier
)
2092 tree decl
= build_decl (TYPE_DECL
, identifier
, NULL_TREE
);
2093 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2094 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2095 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2096 DECL_ARTIFICIAL (decl
) = 1;
2097 end_template_decl ();
2099 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2101 return finish_template_type_parm (aggr
, tmpl
);
2104 /* ARGUMENT is the default-argument value for a template template
2105 parameter. If ARGUMENT is invalid, issue error messages and return
2106 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2109 check_template_template_default_arg (tree argument
)
2111 if (TREE_CODE (argument
) != TEMPLATE_DECL
2112 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2113 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2115 if (TREE_CODE (argument
) == TYPE_DECL
)
2117 tree t
= TREE_TYPE (argument
);
2119 /* Try to emit a slightly smarter error message if we detect
2120 that the user is using a template instantiation. */
2121 if (CLASSTYPE_TEMPLATE_INFO (t
)
2122 && CLASSTYPE_TEMPLATE_INSTANTIATION (t
))
2123 error ("invalid use of type %qT as a default value for a "
2124 "template template-parameter", t
);
2126 error ("invalid use of %qD as a default value for a template "
2127 "template-parameter", argument
);
2130 error ("invalid default argument for a template template parameter");
2131 return error_mark_node
;
2137 /* Begin a class definition, as indicated by T. */
2140 begin_class_definition (tree t
)
2142 if (t
== error_mark_node
)
2143 return error_mark_node
;
2145 if (processing_template_parmlist
)
2147 error ("definition of %q#T inside template parameter list", t
);
2148 return error_mark_node
;
2150 /* A non-implicit typename comes from code like:
2152 template <typename T> struct A {
2153 template <typename U> struct A<T>::B ...
2155 This is erroneous. */
2156 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2158 error ("invalid definition of qualified type %qT", t
);
2159 t
= error_mark_node
;
2162 if (t
== error_mark_node
|| ! IS_AGGR_TYPE (t
))
2164 t
= make_aggr_type (RECORD_TYPE
);
2165 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
2168 /* Update the location of the decl. */
2169 DECL_SOURCE_LOCATION (TYPE_NAME (t
)) = input_location
;
2171 if (TYPE_BEING_DEFINED (t
))
2173 t
= make_aggr_type (TREE_CODE (t
));
2174 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
2176 maybe_process_partial_specialization (t
);
2178 TYPE_BEING_DEFINED (t
) = 1;
2179 if (flag_pack_struct
)
2182 TYPE_PACKED (t
) = 1;
2183 /* Even though the type is being defined for the first time
2184 here, there might have been a forward declaration, so there
2185 might be cv-qualified variants of T. */
2186 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
2187 TYPE_PACKED (v
) = 1;
2189 /* Reset the interface data, at the earliest possible
2190 moment, as it might have been set via a class foo;
2192 if (! TYPE_ANONYMOUS_P (t
))
2194 struct c_fileinfo
*finfo
= get_fileinfo (lbasename (input_filename
));
2195 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
2196 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2197 (t
, finfo
->interface_unknown
);
2199 reset_specialization();
2201 /* Make a declaration for this class in its own scope. */
2202 build_self_reference ();
2207 /* Finish the member declaration given by DECL. */
2210 finish_member_declaration (tree decl
)
2212 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
2215 if (decl
== void_type_node
)
2216 /* The COMPONENT was a friend, not a member, and so there's
2217 nothing for us to do. */
2220 /* We should see only one DECL at a time. */
2221 gcc_assert (TREE_CHAIN (decl
) == NULL_TREE
);
2223 /* Set up access control for DECL. */
2225 = (current_access_specifier
== access_private_node
);
2226 TREE_PROTECTED (decl
)
2227 = (current_access_specifier
== access_protected_node
);
2228 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2230 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
2231 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
2234 /* Mark the DECL as a member of the current class. */
2235 DECL_CONTEXT (decl
) = current_class_type
;
2239 A C language linkage is ignored for the names of class members
2240 and the member function type of class member functions. */
2241 if (DECL_LANG_SPECIFIC (decl
) && DECL_LANGUAGE (decl
) == lang_c
)
2242 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
2244 /* Put functions on the TYPE_METHODS list and everything else on the
2245 TYPE_FIELDS list. Note that these are built up in reverse order.
2246 We reverse them (to obtain declaration order) in finish_struct. */
2247 if (TREE_CODE (decl
) == FUNCTION_DECL
2248 || DECL_FUNCTION_TEMPLATE_P (decl
))
2250 /* We also need to add this function to the
2251 CLASSTYPE_METHOD_VEC. */
2252 add_method (current_class_type
, decl
, NULL_TREE
);
2254 TREE_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
2255 TYPE_METHODS (current_class_type
) = decl
;
2257 maybe_add_class_template_decl_list (current_class_type
, decl
,
2260 /* Enter the DECL into the scope of the class. */
2261 else if ((TREE_CODE (decl
) == USING_DECL
&& !DECL_DEPENDENT_P (decl
))
2262 || pushdecl_class_level (decl
))
2264 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2265 go at the beginning. The reason is that lookup_field_1
2266 searches the list in order, and we want a field name to
2267 override a type name so that the "struct stat hack" will
2268 work. In particular:
2270 struct S { enum E { }; int E } s;
2273 is valid. In addition, the FIELD_DECLs must be maintained in
2274 declaration order so that class layout works as expected.
2275 However, we don't need that order until class layout, so we
2276 save a little time by putting FIELD_DECLs on in reverse order
2277 here, and then reversing them in finish_struct_1. (We could
2278 also keep a pointer to the correct insertion points in the
2281 if (TREE_CODE (decl
) == TYPE_DECL
)
2282 TYPE_FIELDS (current_class_type
)
2283 = chainon (TYPE_FIELDS (current_class_type
), decl
);
2286 TREE_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
2287 TYPE_FIELDS (current_class_type
) = decl
;
2290 maybe_add_class_template_decl_list (current_class_type
, decl
,
2295 note_decl_for_pch (decl
);
2298 /* DECL has been declared while we are building a PCH file. Perform
2299 actions that we might normally undertake lazily, but which can be
2300 performed now so that they do not have to be performed in
2301 translation units which include the PCH file. */
2304 note_decl_for_pch (tree decl
)
2306 gcc_assert (pch_file
);
2308 /* A non-template inline function with external linkage will always
2309 be COMDAT. As we must eventually determine the linkage of all
2310 functions, and as that causes writes to the data mapped in from
2311 the PCH file, it's advantageous to mark the functions at this
2313 if (TREE_CODE (decl
) == FUNCTION_DECL
2314 && TREE_PUBLIC (decl
)
2315 && DECL_DECLARED_INLINE_P (decl
)
2316 && !DECL_IMPLICIT_INSTANTIATION (decl
))
2318 comdat_linkage (decl
);
2319 DECL_INTERFACE_KNOWN (decl
) = 1;
2322 /* There's a good chance that we'll have to mangle names at some
2323 point, even if only for emission in debugging information. */
2324 if (TREE_CODE (decl
) == VAR_DECL
2325 || TREE_CODE (decl
) == FUNCTION_DECL
)
2329 /* Finish processing a complete template declaration. The PARMS are
2330 the template parameters. */
2333 finish_template_decl (tree parms
)
2336 end_template_decl ();
2338 end_specialization ();
2341 /* Finish processing a template-id (which names a type) of the form
2342 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2343 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2344 the scope of template-id indicated. */
2347 finish_template_type (tree name
, tree args
, int entering_scope
)
2351 decl
= lookup_template_class (name
, args
,
2352 NULL_TREE
, NULL_TREE
, entering_scope
,
2353 tf_error
| tf_warning
| tf_user
);
2354 if (decl
!= error_mark_node
)
2355 decl
= TYPE_STUB_DECL (decl
);
2360 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2361 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2362 BASE_CLASS, or NULL_TREE if an error occurred. The
2363 ACCESS_SPECIFIER is one of
2364 access_{default,public,protected_private}_node. For a virtual base
2365 we set TREE_TYPE. */
2368 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
2372 if (base
== error_mark_node
)
2374 error ("invalid base-class specification");
2377 else if (! is_aggr_type (base
, 1))
2381 if (cp_type_quals (base
) != 0)
2383 error ("base class %qT has cv qualifiers", base
);
2384 base
= TYPE_MAIN_VARIANT (base
);
2386 result
= build_tree_list (access
, base
);
2388 TREE_TYPE (result
) = integer_type_node
;
2394 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2395 what we found when we tried to do the lookup. */
2398 qualified_name_lookup_error (tree scope
, tree name
, tree decl
)
2402 if (!COMPLETE_TYPE_P (scope
))
2403 error ("incomplete type %qT used in nested name specifier", scope
);
2404 else if (TREE_CODE (decl
) == TREE_LIST
)
2406 error ("reference to %<%T::%D%> is ambiguous", scope
, name
);
2407 print_candidates (decl
);
2410 error ("%qD is not a member of %qT", name
, scope
);
2412 else if (scope
!= global_namespace
)
2413 error ("%qD is not a member of %qD", name
, scope
);
2415 error ("%<::%D%> has not been declared", name
);
2418 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2419 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2420 if non-NULL, is the type or namespace used to explicitly qualify
2421 ID_EXPRESSION. DECL is the entity to which that name has been
2424 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2425 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2426 be set to true if this expression isn't permitted in a
2427 constant-expression, but it is otherwise not set by this function.
2428 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2429 constant-expression, but a non-constant expression is also
2432 If an error occurs, and it is the kind of error that might cause
2433 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2434 is the caller's responsibility to issue the message. *ERROR_MSG
2435 will be a string with static storage duration, so the caller need
2438 Return an expression for the entity, after issuing appropriate
2439 diagnostics. This function is also responsible for transforming a
2440 reference to a non-static member into a COMPONENT_REF that makes
2441 the use of "this" explicit.
2443 Upon return, *IDK will be filled in appropriately. */
2446 finish_id_expression (tree id_expression
,
2450 tree
*qualifying_class
,
2451 bool integral_constant_expression_p
,
2452 bool allow_non_integral_constant_expression_p
,
2453 bool *non_integral_constant_expression_p
,
2454 const char **error_msg
)
2456 /* Initialize the output parameters. */
2457 *idk
= CP_ID_KIND_NONE
;
2460 if (id_expression
== error_mark_node
)
2461 return error_mark_node
;
2462 /* If we have a template-id, then no further lookup is
2463 required. If the template-id was for a template-class, we
2464 will sometimes have a TYPE_DECL at this point. */
2465 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2466 || TREE_CODE (decl
) == TYPE_DECL
)
2468 /* Look up the name. */
2471 if (decl
== error_mark_node
)
2473 /* Name lookup failed. */
2476 || (!dependent_type_p (scope
)
2477 && !(TREE_CODE (id_expression
) == IDENTIFIER_NODE
2478 && IDENTIFIER_TYPENAME_P (id_expression
)
2479 && dependent_type_p (TREE_TYPE (id_expression
))))))
2481 /* If the qualifying type is non-dependent (and the name
2482 does not name a conversion operator to a dependent
2483 type), issue an error. */
2484 qualified_name_lookup_error (scope
, id_expression
, decl
);
2485 return error_mark_node
;
2489 /* It may be resolved via Koenig lookup. */
2490 *idk
= CP_ID_KIND_UNQUALIFIED
;
2491 return id_expression
;
2494 decl
= id_expression
;
2496 /* If DECL is a variable that would be out of scope under
2497 ANSI/ISO rules, but in scope in the ARM, name lookup
2498 will succeed. Issue a diagnostic here. */
2500 decl
= check_for_out_of_scope_variable (decl
);
2502 /* Remember that the name was used in the definition of
2503 the current class so that we can check later to see if
2504 the meaning would have been different after the class
2505 was entirely defined. */
2506 if (!scope
&& decl
!= error_mark_node
)
2507 maybe_note_name_used_in_class (id_expression
, decl
);
2510 /* If we didn't find anything, or what we found was a type,
2511 then this wasn't really an id-expression. */
2512 if (TREE_CODE (decl
) == TEMPLATE_DECL
2513 && !DECL_FUNCTION_TEMPLATE_P (decl
))
2515 *error_msg
= "missing template arguments";
2516 return error_mark_node
;
2518 else if (TREE_CODE (decl
) == TYPE_DECL
2519 || TREE_CODE (decl
) == NAMESPACE_DECL
)
2521 *error_msg
= "expected primary-expression";
2522 return error_mark_node
;
2525 /* If the name resolved to a template parameter, there is no
2526 need to look it up again later. */
2527 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
2528 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
2532 *idk
= CP_ID_KIND_NONE
;
2533 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
2534 decl
= TEMPLATE_PARM_DECL (decl
);
2535 r
= convert_from_reference (DECL_INITIAL (decl
));
2537 if (integral_constant_expression_p
2538 && !dependent_type_p (TREE_TYPE (decl
))
2539 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
2541 if (!allow_non_integral_constant_expression_p
)
2542 error ("template parameter %qD of type %qT is not allowed in "
2543 "an integral constant expression because it is not of "
2544 "integral or enumeration type", decl
, TREE_TYPE (decl
));
2545 *non_integral_constant_expression_p
= true;
2549 /* Similarly, we resolve enumeration constants to their
2550 underlying values. */
2551 else if (TREE_CODE (decl
) == CONST_DECL
)
2553 *idk
= CP_ID_KIND_NONE
;
2554 if (!processing_template_decl
)
2555 return DECL_INITIAL (decl
);
2562 /* If the declaration was explicitly qualified indicate
2563 that. The semantics of `A::f(3)' are different than
2564 `f(3)' if `f' is virtual. */
2566 ? CP_ID_KIND_QUALIFIED
2567 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2568 ? CP_ID_KIND_TEMPLATE_ID
2569 : CP_ID_KIND_UNQUALIFIED
));
2574 An id-expression is type-dependent if it contains an
2575 identifier that was declared with a dependent type.
2577 The standard is not very specific about an id-expression that
2578 names a set of overloaded functions. What if some of them
2579 have dependent types and some of them do not? Presumably,
2580 such a name should be treated as a dependent name. */
2581 /* Assume the name is not dependent. */
2582 dependent_p
= false;
2583 if (!processing_template_decl
)
2584 /* No names are dependent outside a template. */
2586 /* A template-id where the name of the template was not resolved
2587 is definitely dependent. */
2588 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2589 && (TREE_CODE (TREE_OPERAND (decl
, 0))
2590 == IDENTIFIER_NODE
))
2592 /* For anything except an overloaded function, just check its
2594 else if (!is_overloaded_fn (decl
))
2596 = dependent_type_p (TREE_TYPE (decl
));
2597 /* For a set of overloaded functions, check each of the
2603 if (BASELINK_P (fns
))
2604 fns
= BASELINK_FUNCTIONS (fns
);
2606 /* For a template-id, check to see if the template
2607 arguments are dependent. */
2608 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
2610 tree args
= TREE_OPERAND (fns
, 1);
2611 dependent_p
= any_dependent_template_arguments_p (args
);
2612 /* The functions are those referred to by the
2614 fns
= TREE_OPERAND (fns
, 0);
2617 /* If there are no dependent template arguments, go through
2618 the overloaded functions. */
2619 while (fns
&& !dependent_p
)
2621 tree fn
= OVL_CURRENT (fns
);
2623 /* Member functions of dependent classes are
2625 if (TREE_CODE (fn
) == FUNCTION_DECL
2626 && type_dependent_expression_p (fn
))
2628 else if (TREE_CODE (fn
) == TEMPLATE_DECL
2629 && dependent_template_p (fn
))
2632 fns
= OVL_NEXT (fns
);
2636 /* If the name was dependent on a template parameter, we will
2637 resolve the name at instantiation time. */
2640 /* Create a SCOPE_REF for qualified names, if the scope is
2645 *qualifying_class
= scope
;
2646 /* Since this name was dependent, the expression isn't
2647 constant -- yet. No error is issued because it might
2648 be constant when things are instantiated. */
2649 if (integral_constant_expression_p
)
2650 *non_integral_constant_expression_p
= true;
2651 if (TYPE_P (scope
) && dependent_type_p (scope
))
2652 return build_nt (SCOPE_REF
, scope
, id_expression
);
2653 else if (TYPE_P (scope
) && DECL_P (decl
))
2654 return convert_from_reference
2655 (build2 (SCOPE_REF
, TREE_TYPE (decl
), scope
, id_expression
));
2657 return convert_from_reference (decl
);
2659 /* A TEMPLATE_ID already contains all the information we
2661 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
)
2662 return id_expression
;
2663 *idk
= CP_ID_KIND_UNQUALIFIED_DEPENDENT
;
2664 /* If we found a variable, then name lookup during the
2665 instantiation will always resolve to the same VAR_DECL
2666 (or an instantiation thereof). */
2667 if (TREE_CODE (decl
) == VAR_DECL
2668 || TREE_CODE (decl
) == PARM_DECL
)
2669 return convert_from_reference (decl
);
2670 /* The same is true for FIELD_DECL, but we also need to
2671 make sure that the syntax is correct. */
2672 else if (TREE_CODE (decl
) == FIELD_DECL
)
2674 /* Since SCOPE is NULL here, this is an unqualified name.
2675 Access checking has been performed during name lookup
2676 already. Turn off checking to avoid duplicate errors. */
2677 push_deferring_access_checks (dk_no_check
);
2678 decl
= finish_non_static_data_member
2679 (decl
, current_class_ref
,
2680 /*qualifying_scope=*/NULL_TREE
);
2681 pop_deferring_access_checks ();
2684 return id_expression
;
2687 /* Only certain kinds of names are allowed in constant
2688 expression. Enumerators and template parameters have already
2689 been handled above. */
2690 if (integral_constant_expression_p
2691 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl
)
2692 && ! builtin_valid_in_constant_expr_p (decl
))
2694 if (!allow_non_integral_constant_expression_p
)
2696 error ("%qD cannot appear in a constant-expression", decl
);
2697 return error_mark_node
;
2699 *non_integral_constant_expression_p
= true;
2702 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
2704 error ("use of namespace %qD as expression", decl
);
2705 return error_mark_node
;
2707 else if (DECL_CLASS_TEMPLATE_P (decl
))
2709 error ("use of class template %qT as expression", decl
);
2710 return error_mark_node
;
2712 else if (TREE_CODE (decl
) == TREE_LIST
)
2714 /* Ambiguous reference to base members. */
2715 error ("request for member %qD is ambiguous in "
2716 "multiple inheritance lattice", id_expression
);
2717 print_candidates (decl
);
2718 return error_mark_node
;
2721 /* Mark variable-like entities as used. Functions are similarly
2722 marked either below or after overload resolution. */
2723 if (TREE_CODE (decl
) == VAR_DECL
2724 || TREE_CODE (decl
) == PARM_DECL
2725 || TREE_CODE (decl
) == RESULT_DECL
)
2730 decl
= (adjust_result_of_qualified_name_lookup
2731 (decl
, scope
, current_class_type
));
2733 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2736 if (TREE_CODE (decl
) == FIELD_DECL
|| BASELINK_P (decl
))
2737 *qualifying_class
= scope
;
2740 tree r
= convert_from_reference (decl
);
2742 if (processing_template_decl
2744 r
= build2 (SCOPE_REF
, TREE_TYPE (r
), scope
, decl
);
2748 else if (TREE_CODE (decl
) == FIELD_DECL
)
2750 /* Since SCOPE is NULL here, this is an unqualified name.
2751 Access checking has been performed during name lookup
2752 already. Turn off checking to avoid duplicate errors. */
2753 push_deferring_access_checks (dk_no_check
);
2754 decl
= finish_non_static_data_member (decl
, current_class_ref
,
2755 /*qualifying_scope=*/NULL_TREE
);
2756 pop_deferring_access_checks ();
2758 else if (is_overloaded_fn (decl
))
2760 tree first_fn
= OVL_CURRENT (decl
);
2762 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
2763 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
2765 if (!really_overloaded_fn (decl
))
2766 mark_used (first_fn
);
2768 if (TREE_CODE (first_fn
) == FUNCTION_DECL
2769 && DECL_FUNCTION_MEMBER_P (first_fn
)
2770 && !shared_member_p (decl
))
2772 /* A set of member functions. */
2773 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
2774 return finish_class_member_access_expr (decl
, id_expression
);
2779 if (TREE_CODE (decl
) == VAR_DECL
2780 || TREE_CODE (decl
) == PARM_DECL
2781 || TREE_CODE (decl
) == RESULT_DECL
)
2783 tree context
= decl_function_context (decl
);
2785 if (context
!= NULL_TREE
&& context
!= current_function_decl
2786 && ! TREE_STATIC (decl
))
2788 error (TREE_CODE (decl
) == VAR_DECL
2789 ? "use of %<auto%> variable from containing function"
2790 : "use of parameter from containing function");
2791 error (" %q+#D declared here", decl
);
2792 return error_mark_node
;
2796 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
2797 && DECL_CLASS_SCOPE_P (decl
)
2798 && DECL_CONTEXT (decl
) != current_class_type
)
2802 path
= currently_open_derived_class (DECL_CONTEXT (decl
));
2803 perform_or_defer_access_check (TYPE_BINFO (path
), decl
);
2806 decl
= convert_from_reference (decl
);
2809 /* Resolve references to variables of anonymous unions
2810 into COMPONENT_REFs. */
2811 if (TREE_CODE (decl
) == ALIAS_DECL
)
2812 decl
= unshare_expr (DECL_INITIAL (decl
));
2815 if (TREE_DEPRECATED (decl
))
2816 warn_deprecated_use (decl
);
2821 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
2822 use as a type-specifier. */
2825 finish_typeof (tree expr
)
2829 if (type_dependent_expression_p (expr
))
2831 type
= make_aggr_type (TYPEOF_TYPE
);
2832 TYPEOF_TYPE_EXPR (type
) = expr
;
2837 type
= TREE_TYPE (expr
);
2839 if (!type
|| type
== unknown_type_node
)
2841 error ("type of %qE is unknown", expr
);
2842 return error_mark_node
;
2848 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
2849 with equivalent CALL_EXPRs. */
2852 simplify_aggr_init_exprs_r (tree
* tp
,
2854 void* data ATTRIBUTE_UNUSED
)
2856 /* We don't need to walk into types; there's nothing in a type that
2857 needs simplification. (And, furthermore, there are places we
2858 actively don't want to go. For example, we don't want to wander
2859 into the default arguments for a FUNCTION_DECL that appears in a
2866 /* Only AGGR_INIT_EXPRs are interesting. */
2867 else if (TREE_CODE (*tp
) != AGGR_INIT_EXPR
)
2870 simplify_aggr_init_expr (tp
);
2872 /* Keep iterating. */
2876 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
2877 function is broken out from the above for the benefit of the tree-ssa
2881 simplify_aggr_init_expr (tree
*tp
)
2883 tree aggr_init_expr
= *tp
;
2885 /* Form an appropriate CALL_EXPR. */
2886 tree fn
= TREE_OPERAND (aggr_init_expr
, 0);
2887 tree args
= TREE_OPERAND (aggr_init_expr
, 1);
2888 tree slot
= TREE_OPERAND (aggr_init_expr
, 2);
2889 tree type
= TREE_TYPE (slot
);
2892 enum style_t
{ ctor
, arg
, pcc
} style
;
2894 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
2896 #ifdef PCC_STATIC_STRUCT_RETURN
2902 gcc_assert (TREE_ADDRESSABLE (type
));
2908 /* Replace the first argument to the ctor with the address of the
2912 args
= TREE_CHAIN (args
);
2913 cxx_mark_addressable (slot
);
2914 addr
= build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
2915 args
= tree_cons (NULL_TREE
, addr
, args
);
2918 call_expr
= build3 (CALL_EXPR
,
2919 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
2920 fn
, args
, NULL_TREE
);
2924 /* Just mark it addressable here, and leave the rest to
2925 expand_call{,_inline}. */
2926 cxx_mark_addressable (slot
);
2927 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
2928 call_expr
= build2 (MODIFY_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
2930 else if (style
== pcc
)
2932 /* If we're using the non-reentrant PCC calling convention, then we
2933 need to copy the returned value out of the static buffer into the
2935 push_deferring_access_checks (dk_no_check
);
2936 call_expr
= build_aggr_init (slot
, call_expr
,
2937 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
);
2938 pop_deferring_access_checks ();
2939 call_expr
= build (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
2945 /* Emit all thunks to FN that should be emitted when FN is emitted. */
2948 emit_associated_thunks (tree fn
)
2950 /* When we use vcall offsets, we emit thunks with the virtual
2951 functions to which they thunk. The whole point of vcall offsets
2952 is so that you can know statically the entire set of thunks that
2953 will ever be needed for a given virtual function, thereby
2954 enabling you to output all the thunks with the function itself. */
2955 if (DECL_VIRTUAL_P (fn
))
2959 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= TREE_CHAIN (thunk
))
2961 if (!THUNK_ALIAS (thunk
))
2963 use_thunk (thunk
, /*emit_p=*/1);
2964 if (DECL_RESULT_THUNK_P (thunk
))
2968 for (probe
= DECL_THUNKS (thunk
);
2969 probe
; probe
= TREE_CHAIN (probe
))
2970 use_thunk (probe
, /*emit_p=*/1);
2974 gcc_assert (!DECL_THUNKS (thunk
));
2979 /* Generate RTL for FN. */
2982 expand_body (tree fn
)
2984 tree saved_function
;
2986 /* Compute the appropriate object-file linkage for inline
2988 if (DECL_DECLARED_INLINE_P (fn
))
2989 import_export_decl (fn
);
2991 /* If FN is external, then there's no point in generating RTL for
2992 it. This situation can arise with an inline function under
2993 `-fexternal-templates'; we instantiate the function, even though
2994 we're not planning on emitting it, in case we get a chance to
2996 if (DECL_EXTERNAL (fn
))
2999 /* ??? When is this needed? */
3000 saved_function
= current_function_decl
;
3002 /* Emit any thunks that should be emitted at the same time as FN. */
3003 emit_associated_thunks (fn
);
3005 /* This function is only called from cgraph, or recursively from
3006 emit_associated_thunks. In neither case should we be currently
3007 generating trees for a function. */
3008 gcc_assert (function_depth
== 0);
3010 tree_rest_of_compilation (fn
);
3012 current_function_decl
= saved_function
;
3014 if (DECL_CLONED_FUNCTION_P (fn
))
3016 /* If this is a clone, go through the other clones now and mark
3017 their parameters used. We have to do that here, as we don't
3018 know whether any particular clone will be expanded, and
3019 therefore cannot pick one arbitrarily. */
3022 for (probe
= TREE_CHAIN (DECL_CLONED_FUNCTION (fn
));
3023 probe
&& DECL_CLONED_FUNCTION_P (probe
);
3024 probe
= TREE_CHAIN (probe
))
3028 for (parms
= DECL_ARGUMENTS (probe
);
3029 parms
; parms
= TREE_CHAIN (parms
))
3030 TREE_USED (parms
) = 1;
3035 /* Generate RTL for FN. */
3038 expand_or_defer_fn (tree fn
)
3040 /* When the parser calls us after finishing the body of a template
3041 function, we don't really want to expand the body. */
3042 if (processing_template_decl
)
3044 /* Normally, collection only occurs in rest_of_compilation. So,
3045 if we don't collect here, we never collect junk generated
3046 during the processing of templates until we hit a
3047 non-template function. */
3052 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
3053 walk_tree_without_duplicates (&DECL_SAVED_TREE (fn
),
3054 simplify_aggr_init_exprs_r
,
3057 /* If this is a constructor or destructor body, we have to clone
3059 if (maybe_clone_body (fn
))
3061 /* We don't want to process FN again, so pretend we've written
3062 it out, even though we haven't. */
3063 TREE_ASM_WRITTEN (fn
) = 1;
3067 /* If this function is marked with the constructor attribute, add it
3068 to the list of functions to be called along with constructors
3069 from static duration objects. */
3070 if (DECL_STATIC_CONSTRUCTOR (fn
))
3071 static_ctors
= tree_cons (NULL_TREE
, fn
, static_ctors
);
3073 /* If this function is marked with the destructor attribute, add it
3074 to the list of functions to be called along with destructors from
3075 static duration objects. */
3076 if (DECL_STATIC_DESTRUCTOR (fn
))
3077 static_dtors
= tree_cons (NULL_TREE
, fn
, static_dtors
);
3079 /* We make a decision about linkage for these functions at the end
3080 of the compilation. Until that point, we do not want the back
3081 end to output them -- but we do want it to see the bodies of
3082 these functions so that it can inline them as appropriate. */
3083 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
3087 DECL_EXTERNAL (fn
) = 1;
3088 DECL_NOT_REALLY_EXTERN (fn
) = 1;
3089 note_vague_linkage_fn (fn
);
3092 import_export_decl (fn
);
3094 /* If the user wants us to keep all inline functions, then mark
3095 this function as needed so that finish_file will make sure to
3097 if (flag_keep_inline_functions
&& DECL_DECLARED_INLINE_P (fn
))
3101 /* There's no reason to do any of the work here if we're only doing
3102 semantic analysis; this code just generates RTL. */
3103 if (flag_syntax_only
)
3108 /* Expand or defer, at the whim of the compilation unit manager. */
3109 cgraph_finalize_function (fn
, function_depth
> 1);
3121 /* Helper function for walk_tree, used by finalize_nrv below. */
3124 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
3126 struct nrv_data
*dp
= (struct nrv_data
*)data
;
3129 /* No need to walk into types. There wouldn't be any need to walk into
3130 non-statements, except that we have to consider STMT_EXPRs. */
3133 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3134 but differs from using NULL_TREE in that it indicates that we care
3135 about the value of the RESULT_DECL. */
3136 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
3137 TREE_OPERAND (*tp
, 0) = dp
->result
;
3138 /* Change all cleanups for the NRV to only run when an exception is
3140 else if (TREE_CODE (*tp
) == CLEANUP_STMT
3141 && CLEANUP_DECL (*tp
) == dp
->var
)
3142 CLEANUP_EH_ONLY (*tp
) = 1;
3143 /* Replace the DECL_EXPR for the NRV with an initialization of the
3144 RESULT_DECL, if needed. */
3145 else if (TREE_CODE (*tp
) == DECL_EXPR
3146 && DECL_EXPR_DECL (*tp
) == dp
->var
)
3149 if (DECL_INITIAL (dp
->var
)
3150 && DECL_INITIAL (dp
->var
) != error_mark_node
)
3152 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
3153 DECL_INITIAL (dp
->var
));
3154 DECL_INITIAL (dp
->var
) = error_mark_node
;
3157 init
= build_empty_stmt ();
3158 SET_EXPR_LOCUS (init
, EXPR_LOCUS (*tp
));
3161 /* And replace all uses of the NRV with the RESULT_DECL. */
3162 else if (*tp
== dp
->var
)
3165 /* Avoid walking into the same tree more than once. Unfortunately, we
3166 can't just use walk_tree_without duplicates because it would only call
3167 us for the first occurrence of dp->var in the function body. */
3168 slot
= htab_find_slot (dp
->visited
, *tp
, INSERT
);
3174 /* Keep iterating. */
3178 /* Called from finish_function to implement the named return value
3179 optimization by overriding all the RETURN_EXPRs and pertinent
3180 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3181 RESULT_DECL for the function. */
3184 finalize_nrv (tree
*tp
, tree var
, tree result
)
3186 struct nrv_data data
;
3188 /* Copy debugging information from VAR to RESULT. */
3189 DECL_NAME (result
) = DECL_NAME (var
);
3190 DECL_ARTIFICIAL (result
) = DECL_ARTIFICIAL (var
);
3191 DECL_IGNORED_P (result
) = DECL_IGNORED_P (var
);
3192 DECL_SOURCE_LOCATION (result
) = DECL_SOURCE_LOCATION (var
);
3193 DECL_ABSTRACT_ORIGIN (result
) = DECL_ABSTRACT_ORIGIN (var
);
3194 /* Don't forget that we take its address. */
3195 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
3198 data
.result
= result
;
3199 data
.visited
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
3200 walk_tree (tp
, finalize_nrv_r
, &data
, 0);
3201 htab_delete (data
.visited
);
3204 /* Perform initialization related to this module. */
3207 init_cp_semantics (void)
3211 #include "gt-cp-semantics.h"