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. */
56 static tree
maybe_convert_cond (tree
);
57 static tree
simplify_aggr_init_exprs_r (tree
*, int *, void *);
58 static void emit_associated_thunks (tree
);
59 static tree
finalize_nrv_r (tree
*, int *, void *);
62 /* Deferred Access Checking Overview
63 ---------------------------------
65 Most C++ expressions and declarations require access checking
66 to be performed during parsing. However, in several cases,
67 this has to be treated differently.
69 For member declarations, access checking has to be deferred
70 until more information about the declaration is known. For
82 When we are parsing the function return type `A::X', we don't
83 really know if this is allowed until we parse the function name.
85 Furthermore, some contexts require that access checking is
86 never performed at all. These include class heads, and template
89 Typical use of access checking functions is described here:
91 1. When we enter a context that requires certain access checking
92 mode, the function `push_deferring_access_checks' is called with
93 DEFERRING argument specifying the desired mode. Access checking
94 may be performed immediately (dk_no_deferred), deferred
95 (dk_deferred), or not performed (dk_no_check).
97 2. When a declaration such as a type, or a variable, is encountered,
98 the function `perform_or_defer_access_check' is called. It
99 maintains a TREE_LIST of all deferred checks.
101 3. The global `current_class_type' or `current_function_decl' is then
102 setup by the parser. `enforce_access' relies on these information
105 4. Upon exiting the context mentioned in step 1,
106 `perform_deferred_access_checks' is called to check all declaration
107 stored in the TREE_LIST. `pop_deferring_access_checks' is then
108 called to restore the previous access checking mode.
110 In case of parsing error, we simply call `pop_deferring_access_checks'
111 without `perform_deferred_access_checks'. */
113 typedef struct deferred_access
GTY(())
115 /* A TREE_LIST representing name-lookups for which we have deferred
116 checking access controls. We cannot check the accessibility of
117 names used in a decl-specifier-seq until we know what is being
118 declared because code like:
125 A::B* A::f() { return 0; }
127 is valid, even though `A::B' is not generally accessible.
129 The TREE_PURPOSE of each node is the scope used to qualify the
130 name being looked up; the TREE_VALUE is the DECL to which the
131 name was resolved. */
132 tree deferred_access_checks
;
134 /* The current mode of access checks. */
135 enum deferring_kind deferring_access_checks_kind
;
138 DEF_VEC_O (deferred_access
);
139 DEF_VEC_ALLOC_O (deferred_access
,gc
);
141 /* Data for deferred access checking. */
142 static GTY(()) VEC(deferred_access
,gc
) *deferred_access_stack
;
143 static GTY(()) unsigned deferred_access_no_check
;
145 /* Save the current deferred access states and start deferred
146 access checking iff DEFER_P is true. */
149 push_deferring_access_checks (deferring_kind deferring
)
151 /* For context like template instantiation, access checking
152 disabling applies to all nested context. */
153 if (deferred_access_no_check
|| deferring
== dk_no_check
)
154 deferred_access_no_check
++;
157 deferred_access
*ptr
;
159 ptr
= VEC_safe_push (deferred_access
, gc
, deferred_access_stack
, NULL
);
160 ptr
->deferred_access_checks
= NULL_TREE
;
161 ptr
->deferring_access_checks_kind
= deferring
;
165 /* Resume deferring access checks again after we stopped doing
169 resume_deferring_access_checks (void)
171 if (!deferred_access_no_check
)
172 VEC_last (deferred_access
, deferred_access_stack
)
173 ->deferring_access_checks_kind
= dk_deferred
;
176 /* Stop deferring access checks. */
179 stop_deferring_access_checks (void)
181 if (!deferred_access_no_check
)
182 VEC_last (deferred_access
, deferred_access_stack
)
183 ->deferring_access_checks_kind
= dk_no_deferred
;
186 /* Discard the current deferred access checks and restore the
190 pop_deferring_access_checks (void)
192 if (deferred_access_no_check
)
193 deferred_access_no_check
--;
195 VEC_pop (deferred_access
, deferred_access_stack
);
198 /* Returns a TREE_LIST representing the deferred checks.
199 The TREE_PURPOSE of each node is the type through which the
200 access occurred; the TREE_VALUE is the declaration named.
204 get_deferred_access_checks (void)
206 if (deferred_access_no_check
)
209 return (VEC_last (deferred_access
, deferred_access_stack
)
210 ->deferred_access_checks
);
213 /* Take current deferred checks and combine with the
214 previous states if we also defer checks previously.
215 Otherwise perform checks now. */
218 pop_to_parent_deferring_access_checks (void)
220 if (deferred_access_no_check
)
221 deferred_access_no_check
--;
225 deferred_access
*ptr
;
227 checks
= (VEC_last (deferred_access
, deferred_access_stack
)
228 ->deferred_access_checks
);
230 VEC_pop (deferred_access
, deferred_access_stack
);
231 ptr
= VEC_last (deferred_access
, deferred_access_stack
);
232 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
235 for (; checks
; checks
= TREE_CHAIN (checks
))
236 enforce_access (TREE_PURPOSE (checks
),
237 TREE_VALUE (checks
));
241 /* Merge with parent. */
243 tree original
= ptr
->deferred_access_checks
;
245 for (; checks
; checks
= next
)
249 next
= TREE_CHAIN (checks
);
251 for (probe
= original
; probe
; probe
= TREE_CHAIN (probe
))
252 if (TREE_VALUE (probe
) == TREE_VALUE (checks
)
253 && TREE_PURPOSE (probe
) == TREE_PURPOSE (checks
))
255 /* Insert into parent's checks. */
256 TREE_CHAIN (checks
) = ptr
->deferred_access_checks
;
257 ptr
->deferred_access_checks
= checks
;
264 /* Perform the deferred access checks.
266 After performing the checks, we still have to keep the list
267 `deferred_access_stack->deferred_access_checks' since we may want
268 to check access for them again later in a different context.
275 A::X A::a, x; // No error for `A::a', error for `x'
277 We have to perform deferred access of `A::X', first with `A::a',
281 perform_deferred_access_checks (void)
285 for (deferred_check
= get_deferred_access_checks ();
287 deferred_check
= TREE_CHAIN (deferred_check
))
289 enforce_access (TREE_PURPOSE (deferred_check
),
290 TREE_VALUE (deferred_check
));
293 /* Defer checking the accessibility of DECL, when looked up in
297 perform_or_defer_access_check (tree binfo
, tree decl
)
300 deferred_access
*ptr
;
302 /* Exit if we are in a context that no access checking is performed.
304 if (deferred_access_no_check
)
307 gcc_assert (TREE_CODE (binfo
) == TREE_BINFO
);
309 ptr
= VEC_last (deferred_access
, deferred_access_stack
);
311 /* If we are not supposed to defer access checks, just check now. */
312 if (ptr
->deferring_access_checks_kind
== dk_no_deferred
)
314 enforce_access (binfo
, decl
);
318 /* See if we are already going to perform this check. */
319 for (check
= ptr
->deferred_access_checks
;
321 check
= TREE_CHAIN (check
))
322 if (TREE_VALUE (check
) == decl
&& TREE_PURPOSE (check
) == binfo
)
324 /* If not, record the check. */
325 ptr
->deferred_access_checks
326 = tree_cons (binfo
, decl
, ptr
->deferred_access_checks
);
329 /* Returns nonzero if the current statement is a full expression,
330 i.e. temporaries created during that statement should be destroyed
331 at the end of the statement. */
334 stmts_are_full_exprs_p (void)
336 return current_stmt_tree ()->stmts_are_full_exprs_p
;
339 /* T is a statement. Add it to the statement-tree. This is the C++
340 version. The C/ObjC frontends have a slightly different version of
346 enum tree_code code
= TREE_CODE (t
);
348 if (EXPR_P (t
) && code
!= LABEL_EXPR
)
350 if (!EXPR_HAS_LOCATION (t
))
351 SET_EXPR_LOCATION (t
, input_location
);
353 /* When we expand a statement-tree, we must know whether or not the
354 statements are full-expressions. We record that fact here. */
355 STMT_IS_FULL_EXPR_P (t
) = stmts_are_full_exprs_p ();
358 /* Add T to the statement-tree. Non-side-effect statements need to be
359 recorded during statement expressions. */
360 append_to_statement_list_force (t
, &cur_stmt_list
);
365 /* Returns the stmt_tree (if any) to which statements are currently
366 being added. If there is no active statement-tree, NULL is
370 current_stmt_tree (void)
373 ? &cfun
->language
->base
.x_stmt_tree
374 : &scope_chain
->x_stmt_tree
);
377 /* If statements are full expressions, wrap STMT in a CLEANUP_POINT_EXPR. */
380 maybe_cleanup_point_expr (tree expr
)
382 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
383 expr
= fold_build_cleanup_point_expr (TREE_TYPE (expr
), expr
);
387 /* Like maybe_cleanup_point_expr except have the type of the new expression be
388 void so we don't need to create a temporary variable to hold the inner
389 expression. The reason why we do this is because the original type might be
390 an aggregate and we cannot create a temporary variable for that type. */
393 maybe_cleanup_point_expr_void (tree expr
)
395 if (!processing_template_decl
&& stmts_are_full_exprs_p ())
396 expr
= fold_build_cleanup_point_expr (void_type_node
, expr
);
402 /* Create a declaration statement for the declaration given by the DECL. */
405 add_decl_expr (tree decl
)
407 tree r
= build_stmt (DECL_EXPR
, decl
);
408 if (DECL_INITIAL (decl
)
409 || (DECL_SIZE (decl
) && TREE_SIDE_EFFECTS (DECL_SIZE (decl
))))
410 r
= maybe_cleanup_point_expr_void (r
);
414 /* Nonzero if TYPE is an anonymous union or struct type. We have to use a
415 flag for this because "A union for which objects or pointers are
416 declared is not an anonymous union" [class.union]. */
419 anon_aggr_type_p (tree node
)
421 return ANON_AGGR_TYPE_P (node
);
424 /* Finish a scope. */
427 do_poplevel (tree stmt_list
)
431 if (stmts_are_full_exprs_p ())
432 block
= poplevel (kept_level_p (), 1, 0);
434 stmt_list
= pop_stmt_list (stmt_list
);
436 if (!processing_template_decl
)
438 stmt_list
= c_build_bind_expr (block
, stmt_list
);
439 /* ??? See c_end_compound_stmt re statement expressions. */
445 /* Begin a new scope. */
448 do_pushlevel (scope_kind sk
)
450 tree ret
= push_stmt_list ();
451 if (stmts_are_full_exprs_p ())
452 begin_scope (sk
, NULL
);
456 /* Queue a cleanup. CLEANUP is an expression/statement to be executed
457 when the current scope is exited. EH_ONLY is true when this is not
458 meant to apply to normal control flow transfer. */
461 push_cleanup (tree decl
, tree cleanup
, bool eh_only
)
463 tree stmt
= build_stmt (CLEANUP_STMT
, NULL
, cleanup
, decl
);
464 CLEANUP_EH_ONLY (stmt
) = eh_only
;
466 CLEANUP_BODY (stmt
) = push_stmt_list ();
469 /* Begin a conditional that might contain a declaration. When generating
470 normal code, we want the declaration to appear before the statement
471 containing the conditional. When generating template code, we want the
472 conditional to be rendered as the raw DECL_EXPR. */
475 begin_cond (tree
*cond_p
)
477 if (processing_template_decl
)
478 *cond_p
= push_stmt_list ();
481 /* Finish such a conditional. */
484 finish_cond (tree
*cond_p
, tree expr
)
486 if (processing_template_decl
)
488 tree cond
= pop_stmt_list (*cond_p
);
489 if (TREE_CODE (cond
) == DECL_EXPR
)
495 /* If *COND_P specifies a conditional with a declaration, transform the
498 for (; A x = 42;) { }
500 while (true) { A x = 42; if (!x) break; }
501 for (;;) { A x = 42; if (!x) break; }
502 The statement list for BODY will be empty if the conditional did
503 not declare anything. */
506 simplify_loop_decl_cond (tree
*cond_p
, tree body
)
510 if (!TREE_SIDE_EFFECTS (body
))
514 *cond_p
= boolean_true_node
;
516 if_stmt
= begin_if_stmt ();
517 cond
= build_unary_op (TRUTH_NOT_EXPR
, cond
, 0);
518 finish_if_stmt_cond (cond
, if_stmt
);
519 finish_break_stmt ();
520 finish_then_clause (if_stmt
);
521 finish_if_stmt (if_stmt
);
524 /* Finish a goto-statement. */
527 finish_goto_stmt (tree destination
)
529 if (TREE_CODE (destination
) == IDENTIFIER_NODE
)
530 destination
= lookup_label (destination
);
532 /* We warn about unused labels with -Wunused. That means we have to
533 mark the used labels as used. */
534 if (TREE_CODE (destination
) == LABEL_DECL
)
535 TREE_USED (destination
) = 1;
538 /* The DESTINATION is being used as an rvalue. */
539 if (!processing_template_decl
)
540 destination
= decay_conversion (destination
);
541 /* We don't inline calls to functions with computed gotos.
542 Those functions are typically up to some funny business,
543 and may be depending on the labels being at particular
544 addresses, or some such. */
545 DECL_UNINLINABLE (current_function_decl
) = 1;
548 check_goto (destination
);
550 return add_stmt (build_stmt (GOTO_EXPR
, destination
));
553 /* COND is the condition-expression for an if, while, etc.,
554 statement. Convert it to a boolean value, if appropriate. */
557 maybe_convert_cond (tree cond
)
559 /* Empty conditions remain empty. */
563 /* Wait until we instantiate templates before doing conversion. */
564 if (processing_template_decl
)
567 /* Do the conversion. */
568 cond
= convert_from_reference (cond
);
569 return condition_conversion (cond
);
572 /* Finish an expression-statement, whose EXPRESSION is as indicated. */
575 finish_expr_stmt (tree expr
)
579 if (expr
!= NULL_TREE
)
581 if (!processing_template_decl
)
583 if (warn_sequence_point
)
584 verify_sequence_points (expr
);
585 expr
= convert_to_void (expr
, "statement");
587 else if (!type_dependent_expression_p (expr
))
588 convert_to_void (build_non_dependent_expr (expr
), "statement");
590 /* Simplification of inner statement expressions, compound exprs,
591 etc can result in us already having an EXPR_STMT. */
592 if (TREE_CODE (expr
) != CLEANUP_POINT_EXPR
)
594 if (TREE_CODE (expr
) != EXPR_STMT
)
595 expr
= build_stmt (EXPR_STMT
, expr
);
596 expr
= maybe_cleanup_point_expr_void (expr
);
608 /* Begin an if-statement. Returns a newly created IF_STMT if
615 scope
= do_pushlevel (sk_block
);
616 r
= build_stmt (IF_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
617 TREE_CHAIN (r
) = scope
;
618 begin_cond (&IF_COND (r
));
622 /* Process the COND of an if-statement, which may be given by
626 finish_if_stmt_cond (tree cond
, tree if_stmt
)
628 finish_cond (&IF_COND (if_stmt
), maybe_convert_cond (cond
));
630 THEN_CLAUSE (if_stmt
) = push_stmt_list ();
633 /* Finish the then-clause of an if-statement, which may be given by
637 finish_then_clause (tree if_stmt
)
639 THEN_CLAUSE (if_stmt
) = pop_stmt_list (THEN_CLAUSE (if_stmt
));
643 /* Begin the else-clause of an if-statement. */
646 begin_else_clause (tree if_stmt
)
648 ELSE_CLAUSE (if_stmt
) = push_stmt_list ();
651 /* Finish the else-clause of an if-statement, which may be given by
655 finish_else_clause (tree if_stmt
)
657 ELSE_CLAUSE (if_stmt
) = pop_stmt_list (ELSE_CLAUSE (if_stmt
));
660 /* Finish an if-statement. */
663 finish_if_stmt (tree if_stmt
)
665 tree scope
= TREE_CHAIN (if_stmt
);
666 TREE_CHAIN (if_stmt
) = NULL
;
667 add_stmt (do_poplevel (scope
));
669 empty_body_warning (THEN_CLAUSE (if_stmt
), ELSE_CLAUSE (if_stmt
));
672 /* Begin a while-statement. Returns a newly created WHILE_STMT if
676 begin_while_stmt (void)
679 r
= build_stmt (WHILE_STMT
, NULL_TREE
, NULL_TREE
);
681 WHILE_BODY (r
) = do_pushlevel (sk_block
);
682 begin_cond (&WHILE_COND (r
));
686 /* Process the COND of a while-statement, which may be given by
690 finish_while_stmt_cond (tree cond
, tree while_stmt
)
692 finish_cond (&WHILE_COND (while_stmt
), maybe_convert_cond (cond
));
693 simplify_loop_decl_cond (&WHILE_COND (while_stmt
), WHILE_BODY (while_stmt
));
696 /* Finish a while-statement, which may be given by WHILE_STMT. */
699 finish_while_stmt (tree while_stmt
)
701 WHILE_BODY (while_stmt
) = do_poplevel (WHILE_BODY (while_stmt
));
705 /* Begin a do-statement. Returns a newly created DO_STMT if
711 tree r
= build_stmt (DO_STMT
, NULL_TREE
, NULL_TREE
);
713 DO_BODY (r
) = push_stmt_list ();
717 /* Finish the body of a do-statement, which may be given by DO_STMT. */
720 finish_do_body (tree do_stmt
)
722 DO_BODY (do_stmt
) = pop_stmt_list (DO_BODY (do_stmt
));
725 /* Finish a do-statement, which may be given by DO_STMT, and whose
726 COND is as indicated. */
729 finish_do_stmt (tree cond
, tree do_stmt
)
731 cond
= maybe_convert_cond (cond
);
732 DO_COND (do_stmt
) = cond
;
736 /* Finish a return-statement. The EXPRESSION returned, if any, is as
740 finish_return_stmt (tree expr
)
745 expr
= check_return_expr (expr
, &no_warning
);
747 if (flag_openmp
&& !check_omp_return ())
748 return error_mark_node
;
749 if (!processing_template_decl
)
751 if (DECL_DESTRUCTOR_P (current_function_decl
)
752 || (DECL_CONSTRUCTOR_P (current_function_decl
)
753 && targetm
.cxx
.cdtor_returns_this ()))
755 /* Similarly, all destructors must run destructors for
756 base-classes before returning. So, all returns in a
757 destructor get sent to the DTOR_LABEL; finish_function emits
758 code to return a value there. */
759 return finish_goto_stmt (cdtor_label
);
763 r
= build_stmt (RETURN_EXPR
, expr
);
764 TREE_NO_WARNING (r
) |= no_warning
;
765 r
= maybe_cleanup_point_expr_void (r
);
772 /* Begin a for-statement. Returns a new FOR_STMT if appropriate. */
775 begin_for_stmt (void)
779 r
= build_stmt (FOR_STMT
, NULL_TREE
, NULL_TREE
,
780 NULL_TREE
, NULL_TREE
);
782 if (flag_new_for_scope
> 0)
783 TREE_CHAIN (r
) = do_pushlevel (sk_for
);
785 if (processing_template_decl
)
786 FOR_INIT_STMT (r
) = push_stmt_list ();
791 /* Finish the for-init-statement of a for-statement, which may be
792 given by FOR_STMT. */
795 finish_for_init_stmt (tree for_stmt
)
797 if (processing_template_decl
)
798 FOR_INIT_STMT (for_stmt
) = pop_stmt_list (FOR_INIT_STMT (for_stmt
));
800 FOR_BODY (for_stmt
) = do_pushlevel (sk_block
);
801 begin_cond (&FOR_COND (for_stmt
));
804 /* Finish the COND of a for-statement, which may be given by
808 finish_for_cond (tree cond
, tree for_stmt
)
810 finish_cond (&FOR_COND (for_stmt
), maybe_convert_cond (cond
));
811 simplify_loop_decl_cond (&FOR_COND (for_stmt
), FOR_BODY (for_stmt
));
814 /* Finish the increment-EXPRESSION in a for-statement, which may be
815 given by FOR_STMT. */
818 finish_for_expr (tree expr
, tree for_stmt
)
822 /* If EXPR is an overloaded function, issue an error; there is no
823 context available to use to perform overload resolution. */
824 if (type_unknown_p (expr
))
826 cxx_incomplete_type_error (expr
, TREE_TYPE (expr
));
827 expr
= error_mark_node
;
829 if (!processing_template_decl
)
831 if (warn_sequence_point
)
832 verify_sequence_points (expr
);
833 expr
= convert_to_void (expr
, "3rd expression in for");
835 else if (!type_dependent_expression_p (expr
))
836 convert_to_void (build_non_dependent_expr (expr
), "3rd expression in for");
837 expr
= maybe_cleanup_point_expr_void (expr
);
838 FOR_EXPR (for_stmt
) = expr
;
841 /* Finish the body of a for-statement, which may be given by
842 FOR_STMT. The increment-EXPR for the loop must be
846 finish_for_stmt (tree for_stmt
)
848 FOR_BODY (for_stmt
) = do_poplevel (FOR_BODY (for_stmt
));
850 /* Pop the scope for the body of the loop. */
851 if (flag_new_for_scope
> 0)
853 tree scope
= TREE_CHAIN (for_stmt
);
854 TREE_CHAIN (for_stmt
) = NULL
;
855 add_stmt (do_poplevel (scope
));
861 /* Finish a break-statement. */
864 finish_break_stmt (void)
866 return add_stmt (build_stmt (BREAK_STMT
));
869 /* Finish a continue-statement. */
872 finish_continue_stmt (void)
874 return add_stmt (build_stmt (CONTINUE_STMT
));
877 /* Begin a switch-statement. Returns a new SWITCH_STMT if
881 begin_switch_stmt (void)
885 r
= build_stmt (SWITCH_STMT
, NULL_TREE
, NULL_TREE
, NULL_TREE
);
887 scope
= do_pushlevel (sk_block
);
888 TREE_CHAIN (r
) = scope
;
889 begin_cond (&SWITCH_STMT_COND (r
));
894 /* Finish the cond of a switch-statement. */
897 finish_switch_cond (tree cond
, tree switch_stmt
)
899 tree orig_type
= NULL
;
900 if (!processing_template_decl
)
904 /* Convert the condition to an integer or enumeration type. */
905 cond
= build_expr_type_conversion (WANT_INT
| WANT_ENUM
, cond
, true);
906 if (cond
== NULL_TREE
)
908 error ("switch quantity not an integer");
909 cond
= error_mark_node
;
911 orig_type
= TREE_TYPE (cond
);
912 if (cond
!= error_mark_node
)
916 Integral promotions are performed. */
917 cond
= perform_integral_promotions (cond
);
918 cond
= maybe_cleanup_point_expr (cond
);
921 if (cond
!= error_mark_node
)
923 index
= get_unwidened (cond
, NULL_TREE
);
924 /* We can't strip a conversion from a signed type to an unsigned,
925 because if we did, int_fits_type_p would do the wrong thing
926 when checking case values for being in range,
927 and it's too hard to do the right thing. */
928 if (TYPE_UNSIGNED (TREE_TYPE (cond
))
929 == TYPE_UNSIGNED (TREE_TYPE (index
)))
933 finish_cond (&SWITCH_STMT_COND (switch_stmt
), cond
);
934 SWITCH_STMT_TYPE (switch_stmt
) = orig_type
;
935 add_stmt (switch_stmt
);
936 push_switch (switch_stmt
);
937 SWITCH_STMT_BODY (switch_stmt
) = push_stmt_list ();
940 /* Finish the body of a switch-statement, which may be given by
941 SWITCH_STMT. The COND to switch on is indicated. */
944 finish_switch_stmt (tree switch_stmt
)
948 SWITCH_STMT_BODY (switch_stmt
) =
949 pop_stmt_list (SWITCH_STMT_BODY (switch_stmt
));
953 scope
= TREE_CHAIN (switch_stmt
);
954 TREE_CHAIN (switch_stmt
) = NULL
;
955 add_stmt (do_poplevel (scope
));
958 /* Begin a try-block. Returns a newly-created TRY_BLOCK if
962 begin_try_block (void)
964 tree r
= build_stmt (TRY_BLOCK
, NULL_TREE
, NULL_TREE
);
966 TRY_STMTS (r
) = push_stmt_list ();
970 /* Likewise, for a function-try-block. */
973 begin_function_try_block (void)
975 tree r
= begin_try_block ();
976 FN_TRY_BLOCK_P (r
) = 1;
980 /* Finish a try-block, which may be given by TRY_BLOCK. */
983 finish_try_block (tree try_block
)
985 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
986 TRY_HANDLERS (try_block
) = push_stmt_list ();
989 /* Finish the body of a cleanup try-block, which may be given by
993 finish_cleanup_try_block (tree try_block
)
995 TRY_STMTS (try_block
) = pop_stmt_list (TRY_STMTS (try_block
));
998 /* Finish an implicitly generated try-block, with a cleanup is given
1002 finish_cleanup (tree cleanup
, tree try_block
)
1004 TRY_HANDLERS (try_block
) = cleanup
;
1005 CLEANUP_P (try_block
) = 1;
1008 /* Likewise, for a function-try-block. */
1011 finish_function_try_block (tree try_block
)
1013 finish_try_block (try_block
);
1014 /* FIXME : something queer about CTOR_INITIALIZER somehow following
1015 the try block, but moving it inside. */
1016 in_function_try_handler
= 1;
1019 /* Finish a handler-sequence for a try-block, which may be given by
1023 finish_handler_sequence (tree try_block
)
1025 TRY_HANDLERS (try_block
) = pop_stmt_list (TRY_HANDLERS (try_block
));
1026 check_handlers (TRY_HANDLERS (try_block
));
1029 /* Likewise, for a function-try-block. */
1032 finish_function_handler_sequence (tree try_block
)
1034 in_function_try_handler
= 0;
1035 finish_handler_sequence (try_block
);
1038 /* Begin a handler. Returns a HANDLER if appropriate. */
1041 begin_handler (void)
1045 r
= build_stmt (HANDLER
, NULL_TREE
, NULL_TREE
);
1048 /* Create a binding level for the eh_info and the exception object
1050 HANDLER_BODY (r
) = do_pushlevel (sk_catch
);
1055 /* Finish the handler-parameters for a handler, which may be given by
1056 HANDLER. DECL is the declaration for the catch parameter, or NULL
1057 if this is a `catch (...)' clause. */
1060 finish_handler_parms (tree decl
, tree handler
)
1062 tree type
= NULL_TREE
;
1063 if (processing_template_decl
)
1067 decl
= pushdecl (decl
);
1068 decl
= push_template_decl (decl
);
1069 HANDLER_PARMS (handler
) = decl
;
1070 type
= TREE_TYPE (decl
);
1074 type
= expand_start_catch_block (decl
);
1076 HANDLER_TYPE (handler
) = type
;
1077 if (!processing_template_decl
&& type
)
1078 mark_used (eh_type_info (type
));
1081 /* Finish a handler, which may be given by HANDLER. The BLOCKs are
1082 the return value from the matching call to finish_handler_parms. */
1085 finish_handler (tree handler
)
1087 if (!processing_template_decl
)
1088 expand_end_catch_block ();
1089 HANDLER_BODY (handler
) = do_poplevel (HANDLER_BODY (handler
));
1092 /* Begin a compound statement. FLAGS contains some bits that control the
1093 behavior and context. If BCS_NO_SCOPE is set, the compound statement
1094 does not define a scope. If BCS_FN_BODY is set, this is the outermost
1095 block of a function. If BCS_TRY_BLOCK is set, this is the block
1096 created on behalf of a TRY statement. Returns a token to be passed to
1097 finish_compound_stmt. */
1100 begin_compound_stmt (unsigned int flags
)
1104 if (flags
& BCS_NO_SCOPE
)
1106 r
= push_stmt_list ();
1107 STATEMENT_LIST_NO_SCOPE (r
) = 1;
1109 /* Normally, we try hard to keep the BLOCK for a statement-expression.
1110 But, if it's a statement-expression with a scopeless block, there's
1111 nothing to keep, and we don't want to accidentally keep a block
1112 *inside* the scopeless block. */
1113 keep_next_level (false);
1116 r
= do_pushlevel (flags
& BCS_TRY_BLOCK
? sk_try
: sk_block
);
1118 /* When processing a template, we need to remember where the braces were,
1119 so that we can set up identical scopes when instantiating the template
1120 later. BIND_EXPR is a handy candidate for this.
1121 Note that do_poplevel won't create a BIND_EXPR itself here (and thus
1122 result in nested BIND_EXPRs), since we don't build BLOCK nodes when
1123 processing templates. */
1124 if (processing_template_decl
)
1126 r
= build3 (BIND_EXPR
, NULL
, NULL
, r
, NULL
);
1127 BIND_EXPR_TRY_BLOCK (r
) = (flags
& BCS_TRY_BLOCK
) != 0;
1128 BIND_EXPR_BODY_BLOCK (r
) = (flags
& BCS_FN_BODY
) != 0;
1129 TREE_SIDE_EFFECTS (r
) = 1;
1135 /* Finish a compound-statement, which is given by STMT. */
1138 finish_compound_stmt (tree stmt
)
1140 if (TREE_CODE (stmt
) == BIND_EXPR
)
1141 BIND_EXPR_BODY (stmt
) = do_poplevel (BIND_EXPR_BODY (stmt
));
1142 else if (STATEMENT_LIST_NO_SCOPE (stmt
))
1143 stmt
= pop_stmt_list (stmt
);
1146 /* Destroy any ObjC "super" receivers that may have been
1148 objc_clear_super_receiver ();
1150 stmt
= do_poplevel (stmt
);
1153 /* ??? See c_end_compound_stmt wrt statement expressions. */
1158 /* Finish an asm-statement, whose components are a STRING, some
1159 OUTPUT_OPERANDS, some INPUT_OPERANDS, and some CLOBBERS. Also note
1160 whether the asm-statement should be considered volatile. */
1163 finish_asm_stmt (int volatile_p
, tree string
, tree output_operands
,
1164 tree input_operands
, tree clobbers
)
1168 int ninputs
= list_length (input_operands
);
1169 int noutputs
= list_length (output_operands
);
1171 if (!processing_template_decl
)
1173 const char *constraint
;
1174 const char **oconstraints
;
1175 bool allows_mem
, allows_reg
, is_inout
;
1179 oconstraints
= (const char **) alloca (noutputs
* sizeof (char *));
1181 string
= resolve_asm_operand_names (string
, output_operands
,
1184 for (i
= 0, t
= output_operands
; t
; t
= TREE_CHAIN (t
), ++i
)
1186 operand
= TREE_VALUE (t
);
1188 /* ??? Really, this should not be here. Users should be using a
1189 proper lvalue, dammit. But there's a long history of using
1190 casts in the output operands. In cases like longlong.h, this
1191 becomes a primitive form of typechecking -- if the cast can be
1192 removed, then the output operand had a type of the proper width;
1193 otherwise we'll get an error. Gross, but ... */
1194 STRIP_NOPS (operand
);
1196 if (!lvalue_or_else (operand
, lv_asm
))
1197 operand
= error_mark_node
;
1199 if (operand
!= error_mark_node
1200 && (TREE_READONLY (operand
)
1201 || CP_TYPE_CONST_P (TREE_TYPE (operand
))
1202 /* Functions are not modifiable, even though they are
1204 || TREE_CODE (TREE_TYPE (operand
)) == FUNCTION_TYPE
1205 || TREE_CODE (TREE_TYPE (operand
)) == METHOD_TYPE
1206 /* If it's an aggregate and any field is const, then it is
1207 effectively const. */
1208 || (CLASS_TYPE_P (TREE_TYPE (operand
))
1209 && C_TYPE_FIELDS_READONLY (TREE_TYPE (operand
)))))
1210 readonly_error (operand
, "assignment (via 'asm' output)", 0);
1212 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1213 oconstraints
[i
] = constraint
;
1215 if (parse_output_constraint (&constraint
, i
, ninputs
, noutputs
,
1216 &allows_mem
, &allows_reg
, &is_inout
))
1218 /* If the operand is going to end up in memory,
1219 mark it addressable. */
1220 if (!allows_reg
&& !cxx_mark_addressable (operand
))
1221 operand
= error_mark_node
;
1224 operand
= error_mark_node
;
1226 TREE_VALUE (t
) = operand
;
1229 for (i
= 0, t
= input_operands
; t
; ++i
, t
= TREE_CHAIN (t
))
1231 constraint
= TREE_STRING_POINTER (TREE_VALUE (TREE_PURPOSE (t
)));
1232 operand
= decay_conversion (TREE_VALUE (t
));
1234 /* If the type of the operand hasn't been determined (e.g.,
1235 because it involves an overloaded function), then issue
1236 an error message. There's no context available to
1237 resolve the overloading. */
1238 if (TREE_TYPE (operand
) == unknown_type_node
)
1240 error ("type of asm operand %qE could not be determined",
1242 operand
= error_mark_node
;
1245 if (parse_input_constraint (&constraint
, i
, ninputs
, noutputs
, 0,
1246 oconstraints
, &allows_mem
, &allows_reg
))
1248 /* If the operand is going to end up in memory,
1249 mark it addressable. */
1250 if (!allows_reg
&& allows_mem
)
1252 /* Strip the nops as we allow this case. FIXME, this really
1253 should be rejected or made deprecated. */
1254 STRIP_NOPS (operand
);
1255 if (!cxx_mark_addressable (operand
))
1256 operand
= error_mark_node
;
1260 operand
= error_mark_node
;
1262 TREE_VALUE (t
) = operand
;
1266 r
= build_stmt (ASM_EXPR
, string
,
1267 output_operands
, input_operands
,
1269 ASM_VOLATILE_P (r
) = volatile_p
|| noutputs
== 0;
1270 r
= maybe_cleanup_point_expr_void (r
);
1271 return add_stmt (r
);
1274 /* Finish a label with the indicated NAME. */
1277 finish_label_stmt (tree name
)
1279 tree decl
= define_label (input_location
, name
);
1280 return add_stmt (build_stmt (LABEL_EXPR
, decl
));
1283 /* Finish a series of declarations for local labels. G++ allows users
1284 to declare "local" labels, i.e., labels with scope. This extension
1285 is useful when writing code involving statement-expressions. */
1288 finish_label_decl (tree name
)
1290 tree decl
= declare_local_label (name
);
1291 add_decl_expr (decl
);
1294 /* When DECL goes out of scope, make sure that CLEANUP is executed. */
1297 finish_decl_cleanup (tree decl
, tree cleanup
)
1299 push_cleanup (decl
, cleanup
, false);
1302 /* If the current scope exits with an exception, run CLEANUP. */
1305 finish_eh_cleanup (tree cleanup
)
1307 push_cleanup (NULL
, cleanup
, true);
1310 /* The MEM_INITS is a list of mem-initializers, in reverse of the
1311 order they were written by the user. Each node is as for
1312 emit_mem_initializers. */
1315 finish_mem_initializers (tree mem_inits
)
1317 /* Reorder the MEM_INITS so that they are in the order they appeared
1318 in the source program. */
1319 mem_inits
= nreverse (mem_inits
);
1321 if (processing_template_decl
)
1322 add_stmt (build_min_nt (CTOR_INITIALIZER
, mem_inits
));
1324 emit_mem_initializers (mem_inits
);
1327 /* Finish a parenthesized expression EXPR. */
1330 finish_parenthesized_expr (tree expr
)
1333 /* This inhibits warnings in c_common_truthvalue_conversion. */
1334 TREE_NO_WARNING (expr
) = 1;
1336 if (TREE_CODE (expr
) == OFFSET_REF
)
1337 /* [expr.unary.op]/3 The qualified id of a pointer-to-member must not be
1338 enclosed in parentheses. */
1339 PTRMEM_OK_P (expr
) = 0;
1341 if (TREE_CODE (expr
) == STRING_CST
)
1342 PAREN_STRING_LITERAL_P (expr
) = 1;
1347 /* Finish a reference to a non-static data member (DECL) that is not
1348 preceded by `.' or `->'. */
1351 finish_non_static_data_member (tree decl
, tree object
, tree qualifying_scope
)
1353 gcc_assert (TREE_CODE (decl
) == FIELD_DECL
);
1357 if (current_function_decl
1358 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1359 error ("invalid use of member %q+D in static member function", decl
);
1361 error ("invalid use of non-static data member %q+D", decl
);
1362 error ("from this location");
1364 return error_mark_node
;
1366 TREE_USED (current_class_ptr
) = 1;
1367 if (processing_template_decl
&& !qualifying_scope
)
1369 tree type
= TREE_TYPE (decl
);
1371 if (TREE_CODE (type
) == REFERENCE_TYPE
)
1372 type
= TREE_TYPE (type
);
1375 /* Set the cv qualifiers. */
1376 int quals
= cp_type_quals (TREE_TYPE (current_class_ref
));
1378 if (DECL_MUTABLE_P (decl
))
1379 quals
&= ~TYPE_QUAL_CONST
;
1381 quals
|= cp_type_quals (TREE_TYPE (decl
));
1382 type
= cp_build_qualified_type (type
, quals
);
1385 return build_min (COMPONENT_REF
, type
, object
, decl
, NULL_TREE
);
1389 tree access_type
= TREE_TYPE (object
);
1390 tree lookup_context
= context_for_name_lookup (decl
);
1392 while (!DERIVED_FROM_P (lookup_context
, access_type
))
1394 access_type
= TYPE_CONTEXT (access_type
);
1395 while (access_type
&& DECL_P (access_type
))
1396 access_type
= DECL_CONTEXT (access_type
);
1400 error ("object missing in reference to %q+D", decl
);
1401 error ("from this location");
1402 return error_mark_node
;
1406 /* If PROCESSING_TEMPLATE_DECL is nonzero here, then
1407 QUALIFYING_SCOPE is also non-null. Wrap this in a SCOPE_REF
1409 if (processing_template_decl
)
1410 return build_qualified_name (TREE_TYPE (decl
),
1413 /*template_p=*/false);
1415 perform_or_defer_access_check (TYPE_BINFO (access_type
), decl
);
1417 /* If the data member was named `C::M', convert `*this' to `C'
1419 if (qualifying_scope
)
1421 tree binfo
= NULL_TREE
;
1422 object
= build_scoped_ref (object
, qualifying_scope
,
1426 return build_class_member_access_expr (object
, decl
,
1427 /*access_path=*/NULL_TREE
,
1428 /*preserve_reference=*/false);
1432 /* DECL was the declaration to which a qualified-id resolved. Issue
1433 an error message if it is not accessible. If OBJECT_TYPE is
1434 non-NULL, we have just seen `x->' or `x.' and OBJECT_TYPE is the
1435 type of `*x', or `x', respectively. If the DECL was named as
1436 `A::B' then NESTED_NAME_SPECIFIER is `A'. */
1439 check_accessibility_of_qualified_id (tree decl
,
1441 tree nested_name_specifier
)
1444 tree qualifying_type
= NULL_TREE
;
1446 /* If we're not checking, return immediately. */
1447 if (deferred_access_no_check
)
1450 /* Determine the SCOPE of DECL. */
1451 scope
= context_for_name_lookup (decl
);
1452 /* If the SCOPE is not a type, then DECL is not a member. */
1453 if (!TYPE_P (scope
))
1455 /* Compute the scope through which DECL is being accessed. */
1457 /* OBJECT_TYPE might not be a class type; consider:
1459 class A { typedef int I; };
1463 In this case, we will have "A::I" as the DECL, but "I" as the
1465 && CLASS_TYPE_P (object_type
)
1466 && DERIVED_FROM_P (scope
, object_type
))
1467 /* If we are processing a `->' or `.' expression, use the type of the
1469 qualifying_type
= object_type
;
1470 else if (nested_name_specifier
)
1472 /* If the reference is to a non-static member of the
1473 current class, treat it as if it were referenced through
1475 if (DECL_NONSTATIC_MEMBER_P (decl
)
1476 && current_class_ptr
1477 && DERIVED_FROM_P (scope
, current_class_type
))
1478 qualifying_type
= current_class_type
;
1479 /* Otherwise, use the type indicated by the
1480 nested-name-specifier. */
1482 qualifying_type
= nested_name_specifier
;
1485 /* Otherwise, the name must be from the current class or one of
1487 qualifying_type
= currently_open_derived_class (scope
);
1489 if (qualifying_type
&& IS_AGGR_TYPE_CODE (TREE_CODE (qualifying_type
)))
1490 /* It is possible for qualifying type to be a TEMPLATE_TYPE_PARM
1491 or similar in a default argument value. */
1492 perform_or_defer_access_check (TYPE_BINFO (qualifying_type
), decl
);
1495 /* EXPR is the result of a qualified-id. The QUALIFYING_CLASS was the
1496 class named to the left of the "::" operator. DONE is true if this
1497 expression is a complete postfix-expression; it is false if this
1498 expression is followed by '->', '[', '(', etc. ADDRESS_P is true
1499 iff this expression is the operand of '&'. TEMPLATE_P is true iff
1500 the qualified-id was of the form "A::template B". TEMPLATE_ARG_P
1501 is true iff this qualified name appears as a template argument. */
1504 finish_qualified_id_expr (tree qualifying_class
,
1509 bool template_arg_p
)
1511 gcc_assert (TYPE_P (qualifying_class
));
1513 if (error_operand_p (expr
))
1514 return error_mark_node
;
1516 if (DECL_P (expr
) || BASELINK_P (expr
))
1520 check_template_keyword (expr
);
1522 /* If EXPR occurs as the operand of '&', use special handling that
1523 permits a pointer-to-member. */
1524 if (address_p
&& done
)
1526 if (TREE_CODE (expr
) == SCOPE_REF
)
1527 expr
= TREE_OPERAND (expr
, 1);
1528 expr
= build_offset_ref (qualifying_class
, expr
,
1529 /*address_p=*/true);
1533 /* Within the scope of a class, turn references to non-static
1534 members into expression of the form "this->...". */
1536 /* But, within a template argument, we do not want make the
1537 transformation, as there is no "this" pointer. */
1539 else if (TREE_CODE (expr
) == FIELD_DECL
)
1540 expr
= finish_non_static_data_member (expr
, current_class_ref
,
1542 else if (BASELINK_P (expr
) && !processing_template_decl
)
1546 /* See if any of the functions are non-static members. */
1547 fns
= BASELINK_FUNCTIONS (expr
);
1548 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
1549 fns
= TREE_OPERAND (fns
, 0);
1550 /* If so, the expression may be relative to the current
1552 if (!shared_member_p (fns
)
1553 && current_class_type
1554 && DERIVED_FROM_P (qualifying_class
, current_class_type
))
1555 expr
= (build_class_member_access_expr
1556 (maybe_dummy_object (qualifying_class
, NULL
),
1558 BASELINK_ACCESS_BINFO (expr
),
1559 /*preserve_reference=*/false));
1561 /* The expression is a qualified name whose address is not
1563 expr
= build_offset_ref (qualifying_class
, expr
, /*address_p=*/false);
1569 /* Begin a statement-expression. The value returned must be passed to
1570 finish_stmt_expr. */
1573 begin_stmt_expr (void)
1575 return push_stmt_list ();
1578 /* Process the final expression of a statement expression. EXPR can be
1579 NULL, if the final expression is empty. Return a STATEMENT_LIST
1580 containing all the statements in the statement-expression, or
1581 ERROR_MARK_NODE if there was an error. */
1584 finish_stmt_expr_expr (tree expr
, tree stmt_expr
)
1586 if (error_operand_p (expr
))
1587 return error_mark_node
;
1589 /* If the last statement does not have "void" type, then the value
1590 of the last statement is the value of the entire expression. */
1594 type
= TREE_TYPE (expr
);
1595 if (!dependent_type_p (type
) && !VOID_TYPE_P (type
))
1597 expr
= decay_conversion (expr
);
1598 if (error_operand_p (expr
))
1599 return error_mark_node
;
1600 type
= TREE_TYPE (expr
);
1602 /* The type of the statement-expression is the type of the last
1604 TREE_TYPE (stmt_expr
) = type
;
1605 /* We must take particular care if TYPE is a class type. In
1606 particular if EXPR creates a temporary of class type, then it
1607 must be destroyed at the semicolon terminating the last
1608 statement -- but we must make a copy before that happens.
1610 This problem is solved by using a TARGET_EXPR to initialize a
1611 new temporary variable. The TARGET_EXPR itself is placed
1612 outside the statement-expression. However, the last
1613 statement in the statement-expression is transformed from
1614 EXPR to (approximately) T = EXPR, where T is the new
1615 temporary variable. Thus, the lifetime of the new temporary
1616 extends to the full-expression surrounding the
1617 statement-expression. */
1618 if (!processing_template_decl
&& !VOID_TYPE_P (type
))
1621 if (CLASS_TYPE_P (type
)
1622 && !TYPE_HAS_TRIVIAL_INIT_REF (type
))
1624 target_expr
= build_target_expr_with_type (expr
, type
);
1625 expr
= TARGET_EXPR_INITIAL (target_expr
);
1629 /* Normally, build_target_expr will not create a
1630 TARGET_EXPR for scalars. However, we need the
1631 temporary here, in order to solve the scoping
1632 problem described above. */
1633 target_expr
= force_target_expr (type
, expr
);
1634 expr
= TARGET_EXPR_INITIAL (target_expr
);
1635 expr
= build2 (INIT_EXPR
,
1637 TARGET_EXPR_SLOT (target_expr
),
1640 TARGET_EXPR_INITIAL (target_expr
) = NULL_TREE
;
1641 /* Save away the TARGET_EXPR in the TREE_TYPE field of the
1642 STATEMENT_EXPR. We will retrieve it in
1643 finish_stmt_expr. */
1644 TREE_TYPE (stmt_expr
) = target_expr
;
1648 /* Having modified EXPR to reflect the extra initialization, we now
1649 treat it just like an ordinary statement. */
1650 expr
= finish_expr_stmt (expr
);
1652 /* Mark the last statement so that we can recognize it as such at
1653 template-instantiation time. */
1654 if (expr
&& processing_template_decl
)
1655 EXPR_STMT_STMT_EXPR_RESULT (expr
) = 1;
1660 /* Finish a statement-expression. EXPR should be the value returned
1661 by the previous begin_stmt_expr. Returns an expression
1662 representing the statement-expression. */
1665 finish_stmt_expr (tree stmt_expr
, bool has_no_scope
)
1670 if (error_operand_p (stmt_expr
))
1671 return error_mark_node
;
1673 gcc_assert (TREE_CODE (stmt_expr
) == STATEMENT_LIST
);
1675 type
= TREE_TYPE (stmt_expr
);
1676 result
= pop_stmt_list (stmt_expr
);
1678 if (processing_template_decl
)
1680 result
= build_min (STMT_EXPR
, type
, result
);
1681 TREE_SIDE_EFFECTS (result
) = 1;
1682 STMT_EXPR_NO_SCOPE (result
) = has_no_scope
;
1684 else if (!TYPE_P (type
))
1686 gcc_assert (TREE_CODE (type
) == TARGET_EXPR
);
1687 TARGET_EXPR_INITIAL (type
) = result
;
1688 TREE_TYPE (result
) = void_type_node
;
1695 /* Perform Koenig lookup. FN is the postfix-expression representing
1696 the function (or functions) to call; ARGS are the arguments to the
1697 call. Returns the functions to be considered by overload
1701 perform_koenig_lookup (tree fn
, tree args
)
1703 tree identifier
= NULL_TREE
;
1704 tree functions
= NULL_TREE
;
1706 /* Find the name of the overloaded function. */
1707 if (TREE_CODE (fn
) == IDENTIFIER_NODE
)
1709 else if (is_overloaded_fn (fn
))
1712 identifier
= DECL_NAME (get_first_fn (functions
));
1714 else if (DECL_P (fn
))
1717 identifier
= DECL_NAME (fn
);
1720 /* A call to a namespace-scope function using an unqualified name.
1722 Do Koenig lookup -- unless any of the arguments are
1724 if (!any_type_dependent_arguments_p (args
))
1726 fn
= lookup_arg_dependent (identifier
, functions
, args
);
1728 /* The unqualified name could not be resolved. */
1729 fn
= unqualified_fn_lookup_error (identifier
);
1735 /* Generate an expression for `FN (ARGS)'.
1737 If DISALLOW_VIRTUAL is true, the call to FN will be not generated
1738 as a virtual call, even if FN is virtual. (This flag is set when
1739 encountering an expression where the function name is explicitly
1740 qualified. For example a call to `X::f' never generates a virtual
1743 Returns code for the call. */
1746 finish_call_expr (tree fn
, tree args
, bool disallow_virtual
, bool koenig_p
)
1752 if (fn
== error_mark_node
|| args
== error_mark_node
)
1753 return error_mark_node
;
1755 /* ARGS should be a list of arguments. */
1756 gcc_assert (!args
|| TREE_CODE (args
) == TREE_LIST
);
1761 if (processing_template_decl
)
1763 if (type_dependent_expression_p (fn
)
1764 || any_type_dependent_arguments_p (args
))
1766 result
= build_nt (CALL_EXPR
, fn
, args
, NULL_TREE
);
1767 KOENIG_LOOKUP_P (result
) = koenig_p
;
1770 if (!BASELINK_P (fn
)
1771 && TREE_CODE (fn
) != PSEUDO_DTOR_EXPR
1772 && TREE_TYPE (fn
) != unknown_type_node
)
1773 fn
= build_non_dependent_expr (fn
);
1774 args
= build_non_dependent_args (orig_args
);
1777 /* A reference to a member function will appear as an overloaded
1778 function (rather than a BASELINK) if an unqualified name was used
1780 if (!BASELINK_P (fn
) && is_overloaded_fn (fn
))
1784 if (TREE_CODE (f
) == TEMPLATE_ID_EXPR
)
1785 f
= TREE_OPERAND (f
, 0);
1786 f
= get_first_fn (f
);
1787 if (DECL_FUNCTION_MEMBER_P (f
))
1789 tree type
= currently_open_derived_class (DECL_CONTEXT (f
));
1791 type
= DECL_CONTEXT (f
);
1792 fn
= build_baselink (TYPE_BINFO (type
),
1794 fn
, /*optype=*/NULL_TREE
);
1799 if (BASELINK_P (fn
))
1803 /* A call to a member function. From [over.call.func]:
1805 If the keyword this is in scope and refers to the class of
1806 that member function, or a derived class thereof, then the
1807 function call is transformed into a qualified function call
1808 using (*this) as the postfix-expression to the left of the
1809 . operator.... [Otherwise] a contrived object of type T
1810 becomes the implied object argument.
1812 This paragraph is unclear about this situation:
1814 struct A { void f(); };
1815 struct B : public A {};
1816 struct C : public A { void g() { B::f(); }};
1818 In particular, for `B::f', this paragraph does not make clear
1819 whether "the class of that member function" refers to `A' or
1820 to `B'. We believe it refers to `B'. */
1821 if (current_class_type
1822 && DERIVED_FROM_P (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
1824 && current_class_ref
)
1825 object
= maybe_dummy_object (BINFO_TYPE (BASELINK_ACCESS_BINFO (fn
)),
1829 tree representative_fn
;
1831 representative_fn
= BASELINK_FUNCTIONS (fn
);
1832 if (TREE_CODE (representative_fn
) == TEMPLATE_ID_EXPR
)
1833 representative_fn
= TREE_OPERAND (representative_fn
, 0);
1834 representative_fn
= get_first_fn (representative_fn
);
1835 object
= build_dummy_object (DECL_CONTEXT (representative_fn
));
1838 if (processing_template_decl
)
1840 if (type_dependent_expression_p (object
))
1841 return build_nt (CALL_EXPR
, orig_fn
, orig_args
, NULL_TREE
);
1842 object
= build_non_dependent_expr (object
);
1845 result
= build_new_method_call (object
, fn
, args
, NULL_TREE
,
1847 ? LOOKUP_NONVIRTUAL
: 0),
1850 else if (is_overloaded_fn (fn
))
1852 /* If the function is an overloaded builtin, resolve it. */
1853 if (TREE_CODE (fn
) == FUNCTION_DECL
1854 && (DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_NORMAL
1855 || DECL_BUILT_IN_CLASS (fn
) == BUILT_IN_MD
))
1856 result
= resolve_overloaded_builtin (fn
, args
);
1859 /* A call to a namespace-scope function. */
1860 result
= build_new_function_call (fn
, args
, koenig_p
);
1862 else if (TREE_CODE (fn
) == PSEUDO_DTOR_EXPR
)
1865 error ("arguments to destructor are not allowed");
1866 /* Mark the pseudo-destructor call as having side-effects so
1867 that we do not issue warnings about its use. */
1868 result
= build1 (NOP_EXPR
,
1870 TREE_OPERAND (fn
, 0));
1871 TREE_SIDE_EFFECTS (result
) = 1;
1873 else if (CLASS_TYPE_P (TREE_TYPE (fn
)))
1874 /* If the "function" is really an object of class type, it might
1875 have an overloaded `operator ()'. */
1876 result
= build_new_op (CALL_EXPR
, LOOKUP_NORMAL
, fn
, args
, NULL_TREE
,
1877 /*overloaded_p=*/NULL
);
1880 /* A call where the function is unknown. */
1881 result
= build_function_call (fn
, args
);
1883 if (processing_template_decl
)
1885 result
= build3 (CALL_EXPR
, TREE_TYPE (result
), orig_fn
,
1886 orig_args
, NULL_TREE
);
1887 KOENIG_LOOKUP_P (result
) = koenig_p
;
1892 /* Finish a call to a postfix increment or decrement or EXPR. (Which
1893 is indicated by CODE, which should be POSTINCREMENT_EXPR or
1894 POSTDECREMENT_EXPR.) */
1897 finish_increment_expr (tree expr
, enum tree_code code
)
1899 return build_x_unary_op (code
, expr
);
1902 /* Finish a use of `this'. Returns an expression for `this'. */
1905 finish_this_expr (void)
1909 if (current_class_ptr
)
1911 result
= current_class_ptr
;
1913 else if (current_function_decl
1914 && DECL_STATIC_FUNCTION_P (current_function_decl
))
1916 error ("%<this%> is unavailable for static member functions");
1917 result
= error_mark_node
;
1921 if (current_function_decl
)
1922 error ("invalid use of %<this%> in non-member function");
1924 error ("invalid use of %<this%> at top level");
1925 result
= error_mark_node
;
1931 /* Finish a pseudo-destructor expression. If SCOPE is NULL, the
1932 expression was of the form `OBJECT.~DESTRUCTOR' where DESTRUCTOR is
1933 the TYPE for the type given. If SCOPE is non-NULL, the expression
1934 was of the form `OBJECT.SCOPE::~DESTRUCTOR'. */
1937 finish_pseudo_destructor_expr (tree object
, tree scope
, tree destructor
)
1939 if (destructor
== error_mark_node
)
1940 return error_mark_node
;
1942 gcc_assert (TYPE_P (destructor
));
1944 if (!processing_template_decl
)
1946 if (scope
== error_mark_node
)
1948 error ("invalid qualifying scope in pseudo-destructor name");
1949 return error_mark_node
;
1952 /* [expr.pseudo] says both:
1954 The type designated by the pseudo-destructor-name shall be
1955 the same as the object type.
1959 The cv-unqualified versions of the object type and of the
1960 type designated by the pseudo-destructor-name shall be the
1963 We implement the more generous second sentence, since that is
1964 what most other compilers do. */
1965 if (!same_type_ignoring_top_level_qualifiers_p (TREE_TYPE (object
),
1968 error ("%qE is not of type %qT", object
, destructor
);
1969 return error_mark_node
;
1973 return build3 (PSEUDO_DTOR_EXPR
, void_type_node
, object
, scope
, destructor
);
1976 /* Finish an expression of the form CODE EXPR. */
1979 finish_unary_op_expr (enum tree_code code
, tree expr
)
1981 tree result
= build_x_unary_op (code
, expr
);
1982 /* Inside a template, build_x_unary_op does not fold the
1983 expression. So check whether the result is folded before
1984 setting TREE_NEGATED_INT. */
1985 if (code
== NEGATE_EXPR
&& TREE_CODE (expr
) == INTEGER_CST
1986 && TREE_CODE (result
) == INTEGER_CST
1987 && !TYPE_UNSIGNED (TREE_TYPE (result
))
1988 && INT_CST_LT (result
, integer_zero_node
))
1990 /* RESULT may be a cached INTEGER_CST, so we must copy it before
1991 setting TREE_NEGATED_INT. */
1992 result
= copy_node (result
);
1993 TREE_NEGATED_INT (result
) = 1;
1995 overflow_warning (result
);
1999 /* Finish a compound-literal expression. TYPE is the type to which
2000 the INITIALIZER_LIST is being cast. */
2003 finish_compound_literal (tree type
, VEC(constructor_elt
,gc
) *initializer_list
)
2005 tree compound_literal
;
2007 /* Build a CONSTRUCTOR for the INITIALIZER_LIST. */
2008 compound_literal
= build_constructor (NULL_TREE
, initializer_list
);
2009 if (processing_template_decl
)
2010 TREE_TYPE (compound_literal
) = type
;
2013 /* Check the initialization. */
2014 compound_literal
= reshape_init (type
, compound_literal
);
2015 compound_literal
= digest_init (type
, compound_literal
);
2016 /* If the TYPE was an array type with an unknown bound, then we can
2017 figure out the dimension now. For example, something like:
2021 implies that the array has two elements. */
2022 if (TREE_CODE (type
) == ARRAY_TYPE
&& !COMPLETE_TYPE_P (type
))
2023 cp_complete_array_type (&TREE_TYPE (compound_literal
),
2024 compound_literal
, 1);
2027 /* Mark it as a compound-literal. */
2028 TREE_HAS_CONSTRUCTOR (compound_literal
) = 1;
2030 return compound_literal
;
2033 /* Return the declaration for the function-name variable indicated by
2037 finish_fname (tree id
)
2041 decl
= fname_decl (C_RID_CODE (id
), id
);
2042 if (processing_template_decl
)
2043 decl
= DECL_NAME (decl
);
2047 /* Finish a translation unit. */
2050 finish_translation_unit (void)
2052 /* In case there were missing closebraces,
2053 get us back to the global binding level. */
2055 while (current_namespace
!= global_namespace
)
2058 /* Do file scope __FUNCTION__ et al. */
2059 finish_fname_decls ();
2062 /* Finish a template type parameter, specified as AGGR IDENTIFIER.
2063 Returns the parameter. */
2066 finish_template_type_parm (tree aggr
, tree identifier
)
2068 if (aggr
!= class_type_node
)
2070 pedwarn ("template type parameters must use the keyword %<class%> or %<typename%>");
2071 aggr
= class_type_node
;
2074 return build_tree_list (aggr
, identifier
);
2077 /* Finish a template template parameter, specified as AGGR IDENTIFIER.
2078 Returns the parameter. */
2081 finish_template_template_parm (tree aggr
, tree identifier
)
2083 tree decl
= build_decl (TYPE_DECL
, identifier
, NULL_TREE
);
2084 tree tmpl
= build_lang_decl (TEMPLATE_DECL
, identifier
, NULL_TREE
);
2085 DECL_TEMPLATE_PARMS (tmpl
) = current_template_parms
;
2086 DECL_TEMPLATE_RESULT (tmpl
) = decl
;
2087 DECL_ARTIFICIAL (decl
) = 1;
2088 end_template_decl ();
2090 gcc_assert (DECL_TEMPLATE_PARMS (tmpl
));
2092 return finish_template_type_parm (aggr
, tmpl
);
2095 /* ARGUMENT is the default-argument value for a template template
2096 parameter. If ARGUMENT is invalid, issue error messages and return
2097 the ERROR_MARK_NODE. Otherwise, ARGUMENT itself is returned. */
2100 check_template_template_default_arg (tree argument
)
2102 if (TREE_CODE (argument
) != TEMPLATE_DECL
2103 && TREE_CODE (argument
) != TEMPLATE_TEMPLATE_PARM
2104 && TREE_CODE (argument
) != UNBOUND_CLASS_TEMPLATE
)
2106 if (TREE_CODE (argument
) == TYPE_DECL
)
2108 tree t
= TREE_TYPE (argument
);
2110 /* Try to emit a slightly smarter error message if we detect
2111 that the user is using a template instantiation. */
2112 if (CLASSTYPE_TEMPLATE_INFO (t
)
2113 && CLASSTYPE_TEMPLATE_INSTANTIATION (t
))
2114 error ("invalid use of type %qT as a default value for a "
2115 "template template-parameter", t
);
2117 error ("invalid use of %qD as a default value for a template "
2118 "template-parameter", argument
);
2121 error ("invalid default argument for a template template parameter");
2122 return error_mark_node
;
2128 /* Begin a class definition, as indicated by T. */
2131 begin_class_definition (tree t
)
2133 if (t
== error_mark_node
)
2134 return error_mark_node
;
2136 if (processing_template_parmlist
)
2138 error ("definition of %q#T inside template parameter list", t
);
2139 return error_mark_node
;
2141 /* A non-implicit typename comes from code like:
2143 template <typename T> struct A {
2144 template <typename U> struct A<T>::B ...
2146 This is erroneous. */
2147 else if (TREE_CODE (t
) == TYPENAME_TYPE
)
2149 error ("invalid definition of qualified type %qT", t
);
2150 t
= error_mark_node
;
2153 if (t
== error_mark_node
|| ! IS_AGGR_TYPE (t
))
2155 t
= make_aggr_type (RECORD_TYPE
);
2156 pushtag (make_anon_name (), t
, /*tag_scope=*/ts_current
);
2159 /* Update the location of the decl. */
2160 DECL_SOURCE_LOCATION (TYPE_NAME (t
)) = input_location
;
2162 if (TYPE_BEING_DEFINED (t
))
2164 t
= make_aggr_type (TREE_CODE (t
));
2165 pushtag (TYPE_IDENTIFIER (t
), t
, /*tag_scope=*/ts_current
);
2167 maybe_process_partial_specialization (t
);
2169 TYPE_BEING_DEFINED (t
) = 1;
2170 if (flag_pack_struct
)
2173 TYPE_PACKED (t
) = 1;
2174 /* Even though the type is being defined for the first time
2175 here, there might have been a forward declaration, so there
2176 might be cv-qualified variants of T. */
2177 for (v
= TYPE_NEXT_VARIANT (t
); v
; v
= TYPE_NEXT_VARIANT (v
))
2178 TYPE_PACKED (v
) = 1;
2180 /* Reset the interface data, at the earliest possible
2181 moment, as it might have been set via a class foo;
2183 if (! TYPE_ANONYMOUS_P (t
))
2185 struct c_fileinfo
*finfo
= get_fileinfo (lbasename (input_filename
));
2186 CLASSTYPE_INTERFACE_ONLY (t
) = finfo
->interface_only
;
2187 SET_CLASSTYPE_INTERFACE_UNKNOWN_X
2188 (t
, finfo
->interface_unknown
);
2190 reset_specialization();
2192 /* Make a declaration for this class in its own scope. */
2193 build_self_reference ();
2198 /* Finish the member declaration given by DECL. */
2201 finish_member_declaration (tree decl
)
2203 if (decl
== error_mark_node
|| decl
== NULL_TREE
)
2206 if (decl
== void_type_node
)
2207 /* The COMPONENT was a friend, not a member, and so there's
2208 nothing for us to do. */
2211 /* We should see only one DECL at a time. */
2212 gcc_assert (TREE_CHAIN (decl
) == NULL_TREE
);
2214 /* Set up access control for DECL. */
2216 = (current_access_specifier
== access_private_node
);
2217 TREE_PROTECTED (decl
)
2218 = (current_access_specifier
== access_protected_node
);
2219 if (TREE_CODE (decl
) == TEMPLATE_DECL
)
2221 TREE_PRIVATE (DECL_TEMPLATE_RESULT (decl
)) = TREE_PRIVATE (decl
);
2222 TREE_PROTECTED (DECL_TEMPLATE_RESULT (decl
)) = TREE_PROTECTED (decl
);
2225 /* Mark the DECL as a member of the current class. */
2226 DECL_CONTEXT (decl
) = current_class_type
;
2230 A C language linkage is ignored for the names of class members
2231 and the member function type of class member functions. */
2232 if (DECL_LANG_SPECIFIC (decl
) && DECL_LANGUAGE (decl
) == lang_c
)
2233 SET_DECL_LANGUAGE (decl
, lang_cplusplus
);
2235 /* Put functions on the TYPE_METHODS list and everything else on the
2236 TYPE_FIELDS list. Note that these are built up in reverse order.
2237 We reverse them (to obtain declaration order) in finish_struct. */
2238 if (TREE_CODE (decl
) == FUNCTION_DECL
2239 || DECL_FUNCTION_TEMPLATE_P (decl
))
2241 /* We also need to add this function to the
2242 CLASSTYPE_METHOD_VEC. */
2243 if (add_method (current_class_type
, decl
, NULL_TREE
))
2245 TREE_CHAIN (decl
) = TYPE_METHODS (current_class_type
);
2246 TYPE_METHODS (current_class_type
) = decl
;
2248 maybe_add_class_template_decl_list (current_class_type
, decl
,
2252 /* Enter the DECL into the scope of the class. */
2253 else if ((TREE_CODE (decl
) == USING_DECL
&& !DECL_DEPENDENT_P (decl
))
2254 || pushdecl_class_level (decl
))
2256 /* All TYPE_DECLs go at the end of TYPE_FIELDS. Ordinary fields
2257 go at the beginning. The reason is that lookup_field_1
2258 searches the list in order, and we want a field name to
2259 override a type name so that the "struct stat hack" will
2260 work. In particular:
2262 struct S { enum E { }; int E } s;
2265 is valid. In addition, the FIELD_DECLs must be maintained in
2266 declaration order so that class layout works as expected.
2267 However, we don't need that order until class layout, so we
2268 save a little time by putting FIELD_DECLs on in reverse order
2269 here, and then reversing them in finish_struct_1. (We could
2270 also keep a pointer to the correct insertion points in the
2273 if (TREE_CODE (decl
) == TYPE_DECL
)
2274 TYPE_FIELDS (current_class_type
)
2275 = chainon (TYPE_FIELDS (current_class_type
), decl
);
2278 TREE_CHAIN (decl
) = TYPE_FIELDS (current_class_type
);
2279 TYPE_FIELDS (current_class_type
) = decl
;
2282 maybe_add_class_template_decl_list (current_class_type
, decl
,
2287 note_decl_for_pch (decl
);
2290 /* DECL has been declared while we are building a PCH file. Perform
2291 actions that we might normally undertake lazily, but which can be
2292 performed now so that they do not have to be performed in
2293 translation units which include the PCH file. */
2296 note_decl_for_pch (tree decl
)
2298 gcc_assert (pch_file
);
2300 /* There's a good chance that we'll have to mangle names at some
2301 point, even if only for emission in debugging information. */
2302 if (TREE_CODE (decl
) == VAR_DECL
2303 || TREE_CODE (decl
) == FUNCTION_DECL
)
2307 /* Finish processing a complete template declaration. The PARMS are
2308 the template parameters. */
2311 finish_template_decl (tree parms
)
2314 end_template_decl ();
2316 end_specialization ();
2319 /* Finish processing a template-id (which names a type) of the form
2320 NAME < ARGS >. Return the TYPE_DECL for the type named by the
2321 template-id. If ENTERING_SCOPE is nonzero we are about to enter
2322 the scope of template-id indicated. */
2325 finish_template_type (tree name
, tree args
, int entering_scope
)
2329 decl
= lookup_template_class (name
, args
,
2330 NULL_TREE
, NULL_TREE
, entering_scope
,
2331 tf_warning_or_error
| tf_user
);
2332 if (decl
!= error_mark_node
)
2333 decl
= TYPE_STUB_DECL (decl
);
2338 /* Finish processing a BASE_CLASS with the indicated ACCESS_SPECIFIER.
2339 Return a TREE_LIST containing the ACCESS_SPECIFIER and the
2340 BASE_CLASS, or NULL_TREE if an error occurred. The
2341 ACCESS_SPECIFIER is one of
2342 access_{default,public,protected_private}_node. For a virtual base
2343 we set TREE_TYPE. */
2346 finish_base_specifier (tree base
, tree access
, bool virtual_p
)
2350 if (base
== error_mark_node
)
2352 error ("invalid base-class specification");
2355 else if (! is_aggr_type (base
, 1))
2359 if (cp_type_quals (base
) != 0)
2361 error ("base class %qT has cv qualifiers", base
);
2362 base
= TYPE_MAIN_VARIANT (base
);
2364 result
= build_tree_list (access
, base
);
2366 TREE_TYPE (result
) = integer_type_node
;
2372 /* Issue a diagnostic that NAME cannot be found in SCOPE. DECL is
2373 what we found when we tried to do the lookup. */
2376 qualified_name_lookup_error (tree scope
, tree name
, tree decl
)
2378 if (scope
== error_mark_node
)
2379 ; /* We already complained. */
2380 else if (TYPE_P (scope
))
2382 if (!COMPLETE_TYPE_P (scope
))
2383 error ("incomplete type %qT used in nested name specifier", scope
);
2384 else if (TREE_CODE (decl
) == TREE_LIST
)
2386 error ("reference to %<%T::%D%> is ambiguous", scope
, name
);
2387 print_candidates (decl
);
2390 error ("%qD is not a member of %qT", name
, scope
);
2392 else if (scope
!= global_namespace
)
2393 error ("%qD is not a member of %qD", name
, scope
);
2395 error ("%<::%D%> has not been declared", name
);
2398 /* ID_EXPRESSION is a representation of parsed, but unprocessed,
2399 id-expression. (See cp_parser_id_expression for details.) SCOPE,
2400 if non-NULL, is the type or namespace used to explicitly qualify
2401 ID_EXPRESSION. DECL is the entity to which that name has been
2404 *CONSTANT_EXPRESSION_P is true if we are presently parsing a
2405 constant-expression. In that case, *NON_CONSTANT_EXPRESSION_P will
2406 be set to true if this expression isn't permitted in a
2407 constant-expression, but it is otherwise not set by this function.
2408 *ALLOW_NON_CONSTANT_EXPRESSION_P is true if we are parsing a
2409 constant-expression, but a non-constant expression is also
2412 DONE is true if this expression is a complete postfix-expression;
2413 it is false if this expression is followed by '->', '[', '(', etc.
2414 ADDRESS_P is true iff this expression is the operand of '&'.
2415 TEMPLATE_P is true iff the qualified-id was of the form
2416 "A::template B". TEMPLATE_ARG_P is true iff this qualified name
2417 appears as a template argument.
2419 If an error occurs, and it is the kind of error that might cause
2420 the parser to abort a tentative parse, *ERROR_MSG is filled in. It
2421 is the caller's responsibility to issue the message. *ERROR_MSG
2422 will be a string with static storage duration, so the caller need
2425 Return an expression for the entity, after issuing appropriate
2426 diagnostics. This function is also responsible for transforming a
2427 reference to a non-static member into a COMPONENT_REF that makes
2428 the use of "this" explicit.
2430 Upon return, *IDK will be filled in appropriately. */
2433 finish_id_expression (tree id_expression
,
2437 bool integral_constant_expression_p
,
2438 bool allow_non_integral_constant_expression_p
,
2439 bool *non_integral_constant_expression_p
,
2443 bool template_arg_p
,
2444 const char **error_msg
)
2446 /* Initialize the output parameters. */
2447 *idk
= CP_ID_KIND_NONE
;
2450 if (id_expression
== error_mark_node
)
2451 return error_mark_node
;
2452 /* If we have a template-id, then no further lookup is
2453 required. If the template-id was for a template-class, we
2454 will sometimes have a TYPE_DECL at this point. */
2455 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2456 || TREE_CODE (decl
) == TYPE_DECL
)
2458 /* Look up the name. */
2461 if (decl
== error_mark_node
)
2463 /* Name lookup failed. */
2466 || (!dependent_type_p (scope
)
2467 && !(TREE_CODE (id_expression
) == IDENTIFIER_NODE
2468 && IDENTIFIER_TYPENAME_P (id_expression
)
2469 && dependent_type_p (TREE_TYPE (id_expression
))))))
2471 /* If the qualifying type is non-dependent (and the name
2472 does not name a conversion operator to a dependent
2473 type), issue an error. */
2474 qualified_name_lookup_error (scope
, id_expression
, decl
);
2475 return error_mark_node
;
2479 /* It may be resolved via Koenig lookup. */
2480 *idk
= CP_ID_KIND_UNQUALIFIED
;
2481 return id_expression
;
2484 decl
= id_expression
;
2486 /* If DECL is a variable that would be out of scope under
2487 ANSI/ISO rules, but in scope in the ARM, name lookup
2488 will succeed. Issue a diagnostic here. */
2490 decl
= check_for_out_of_scope_variable (decl
);
2492 /* Remember that the name was used in the definition of
2493 the current class so that we can check later to see if
2494 the meaning would have been different after the class
2495 was entirely defined. */
2496 if (!scope
&& decl
!= error_mark_node
)
2497 maybe_note_name_used_in_class (id_expression
, decl
);
2499 /* Disallow uses of local variables from containing functions. */
2500 if (TREE_CODE (decl
) == VAR_DECL
|| TREE_CODE (decl
) == PARM_DECL
)
2502 tree context
= decl_function_context (decl
);
2503 if (context
!= NULL_TREE
&& context
!= current_function_decl
2504 && ! TREE_STATIC (decl
))
2506 error (TREE_CODE (decl
) == VAR_DECL
2507 ? "use of %<auto%> variable from containing function"
2508 : "use of parameter from containing function");
2509 error (" %q+#D declared here", decl
);
2510 return error_mark_node
;
2515 /* If we didn't find anything, or what we found was a type,
2516 then this wasn't really an id-expression. */
2517 if (TREE_CODE (decl
) == TEMPLATE_DECL
2518 && !DECL_FUNCTION_TEMPLATE_P (decl
))
2520 *error_msg
= "missing template arguments";
2521 return error_mark_node
;
2523 else if (TREE_CODE (decl
) == TYPE_DECL
2524 || TREE_CODE (decl
) == NAMESPACE_DECL
)
2526 *error_msg
= "expected primary-expression";
2527 return error_mark_node
;
2530 /* If the name resolved to a template parameter, there is no
2531 need to look it up again later. */
2532 if ((TREE_CODE (decl
) == CONST_DECL
&& DECL_TEMPLATE_PARM_P (decl
))
2533 || TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
2537 *idk
= CP_ID_KIND_NONE
;
2538 if (TREE_CODE (decl
) == TEMPLATE_PARM_INDEX
)
2539 decl
= TEMPLATE_PARM_DECL (decl
);
2540 r
= convert_from_reference (DECL_INITIAL (decl
));
2542 if (integral_constant_expression_p
2543 && !dependent_type_p (TREE_TYPE (decl
))
2544 && !(INTEGRAL_OR_ENUMERATION_TYPE_P (TREE_TYPE (r
))))
2546 if (!allow_non_integral_constant_expression_p
)
2547 error ("template parameter %qD of type %qT is not allowed in "
2548 "an integral constant expression because it is not of "
2549 "integral or enumeration type", decl
, TREE_TYPE (decl
));
2550 *non_integral_constant_expression_p
= true;
2554 /* Similarly, we resolve enumeration constants to their
2555 underlying values. */
2556 else if (TREE_CODE (decl
) == CONST_DECL
)
2558 *idk
= CP_ID_KIND_NONE
;
2559 if (!processing_template_decl
)
2560 return DECL_INITIAL (decl
);
2567 /* If the declaration was explicitly qualified indicate
2568 that. The semantics of `A::f(3)' are different than
2569 `f(3)' if `f' is virtual. */
2571 ? CP_ID_KIND_QUALIFIED
2572 : (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2573 ? CP_ID_KIND_TEMPLATE_ID
2574 : CP_ID_KIND_UNQUALIFIED
));
2579 An id-expression is type-dependent if it contains an
2580 identifier that was declared with a dependent type.
2582 The standard is not very specific about an id-expression that
2583 names a set of overloaded functions. What if some of them
2584 have dependent types and some of them do not? Presumably,
2585 such a name should be treated as a dependent name. */
2586 /* Assume the name is not dependent. */
2587 dependent_p
= false;
2588 if (!processing_template_decl
)
2589 /* No names are dependent outside a template. */
2591 /* A template-id where the name of the template was not resolved
2592 is definitely dependent. */
2593 else if (TREE_CODE (decl
) == TEMPLATE_ID_EXPR
2594 && (TREE_CODE (TREE_OPERAND (decl
, 0))
2595 == IDENTIFIER_NODE
))
2597 /* For anything except an overloaded function, just check its
2599 else if (!is_overloaded_fn (decl
))
2601 = dependent_type_p (TREE_TYPE (decl
));
2602 /* For a set of overloaded functions, check each of the
2608 if (BASELINK_P (fns
))
2609 fns
= BASELINK_FUNCTIONS (fns
);
2611 /* For a template-id, check to see if the template
2612 arguments are dependent. */
2613 if (TREE_CODE (fns
) == TEMPLATE_ID_EXPR
)
2615 tree args
= TREE_OPERAND (fns
, 1);
2616 dependent_p
= any_dependent_template_arguments_p (args
);
2617 /* The functions are those referred to by the
2619 fns
= TREE_OPERAND (fns
, 0);
2622 /* If there are no dependent template arguments, go through
2623 the overloaded functions. */
2624 while (fns
&& !dependent_p
)
2626 tree fn
= OVL_CURRENT (fns
);
2628 /* Member functions of dependent classes are
2630 if (TREE_CODE (fn
) == FUNCTION_DECL
2631 && type_dependent_expression_p (fn
))
2633 else if (TREE_CODE (fn
) == TEMPLATE_DECL
2634 && dependent_template_p (fn
))
2637 fns
= OVL_NEXT (fns
);
2641 /* If the name was dependent on a template parameter, we will
2642 resolve the name at instantiation time. */
2645 /* Create a SCOPE_REF for qualified names, if the scope is
2649 /* Since this name was dependent, the expression isn't
2650 constant -- yet. No error is issued because it might
2651 be constant when things are instantiated. */
2652 if (integral_constant_expression_p
)
2653 *non_integral_constant_expression_p
= true;
2656 if (address_p
&& done
)
2657 decl
= finish_qualified_id_expr (scope
, decl
,
2661 else if (dependent_type_p (scope
))
2662 decl
= build_qualified_name (/*type=*/NULL_TREE
,
2666 else if (DECL_P (decl
))
2667 decl
= build_qualified_name (TREE_TYPE (decl
),
2672 if (TREE_TYPE (decl
))
2673 decl
= convert_from_reference (decl
);
2676 /* A TEMPLATE_ID already contains all the information we
2678 if (TREE_CODE (id_expression
) == TEMPLATE_ID_EXPR
)
2679 return id_expression
;
2680 *idk
= CP_ID_KIND_UNQUALIFIED_DEPENDENT
;
2681 /* If we found a variable, then name lookup during the
2682 instantiation will always resolve to the same VAR_DECL
2683 (or an instantiation thereof). */
2684 if (TREE_CODE (decl
) == VAR_DECL
2685 || TREE_CODE (decl
) == PARM_DECL
)
2686 return convert_from_reference (decl
);
2687 /* The same is true for FIELD_DECL, but we also need to
2688 make sure that the syntax is correct. */
2689 else if (TREE_CODE (decl
) == FIELD_DECL
)
2691 /* Since SCOPE is NULL here, this is an unqualified name.
2692 Access checking has been performed during name lookup
2693 already. Turn off checking to avoid duplicate errors. */
2694 push_deferring_access_checks (dk_no_check
);
2695 decl
= finish_non_static_data_member
2696 (decl
, current_class_ref
,
2697 /*qualifying_scope=*/NULL_TREE
);
2698 pop_deferring_access_checks ();
2701 return id_expression
;
2704 /* Only certain kinds of names are allowed in constant
2705 expression. Enumerators and template parameters have already
2706 been handled above. */
2707 if (integral_constant_expression_p
2708 && ! DECL_INTEGRAL_CONSTANT_VAR_P (decl
)
2709 && ! builtin_valid_in_constant_expr_p (decl
))
2711 if (!allow_non_integral_constant_expression_p
)
2713 error ("%qD cannot appear in a constant-expression", decl
);
2714 return error_mark_node
;
2716 *non_integral_constant_expression_p
= true;
2719 if (TREE_CODE (decl
) == NAMESPACE_DECL
)
2721 error ("use of namespace %qD as expression", decl
);
2722 return error_mark_node
;
2724 else if (DECL_CLASS_TEMPLATE_P (decl
))
2726 error ("use of class template %qT as expression", decl
);
2727 return error_mark_node
;
2729 else if (TREE_CODE (decl
) == TREE_LIST
)
2731 /* Ambiguous reference to base members. */
2732 error ("request for member %qD is ambiguous in "
2733 "multiple inheritance lattice", id_expression
);
2734 print_candidates (decl
);
2735 return error_mark_node
;
2738 /* Mark variable-like entities as used. Functions are similarly
2739 marked either below or after overload resolution. */
2740 if (TREE_CODE (decl
) == VAR_DECL
2741 || TREE_CODE (decl
) == PARM_DECL
2742 || TREE_CODE (decl
) == RESULT_DECL
)
2747 decl
= (adjust_result_of_qualified_name_lookup
2748 (decl
, scope
, current_class_type
));
2750 if (TREE_CODE (decl
) == FUNCTION_DECL
)
2753 if (TREE_CODE (decl
) == FIELD_DECL
|| BASELINK_P (decl
))
2754 decl
= finish_qualified_id_expr (scope
,
2762 tree r
= convert_from_reference (decl
);
2764 if (processing_template_decl
&& TYPE_P (scope
))
2765 r
= build_qualified_name (TREE_TYPE (r
),
2771 else if (TREE_CODE (decl
) == FIELD_DECL
)
2773 /* Since SCOPE is NULL here, this is an unqualified name.
2774 Access checking has been performed during name lookup
2775 already. Turn off checking to avoid duplicate errors. */
2776 push_deferring_access_checks (dk_no_check
);
2777 decl
= finish_non_static_data_member (decl
, current_class_ref
,
2778 /*qualifying_scope=*/NULL_TREE
);
2779 pop_deferring_access_checks ();
2781 else if (is_overloaded_fn (decl
))
2783 tree first_fn
= OVL_CURRENT (decl
);
2785 if (TREE_CODE (first_fn
) == TEMPLATE_DECL
)
2786 first_fn
= DECL_TEMPLATE_RESULT (first_fn
);
2788 if (!really_overloaded_fn (decl
))
2789 mark_used (first_fn
);
2792 && TREE_CODE (first_fn
) == FUNCTION_DECL
2793 && DECL_FUNCTION_MEMBER_P (first_fn
)
2794 && !shared_member_p (decl
))
2796 /* A set of member functions. */
2797 decl
= maybe_dummy_object (DECL_CONTEXT (first_fn
), 0);
2798 return finish_class_member_access_expr (decl
, id_expression
,
2799 /*template_p=*/false);
2804 if (DECL_P (decl
) && DECL_NONLOCAL (decl
)
2805 && DECL_CLASS_SCOPE_P (decl
)
2806 && DECL_CONTEXT (decl
) != current_class_type
)
2810 path
= currently_open_derived_class (DECL_CONTEXT (decl
));
2811 perform_or_defer_access_check (TYPE_BINFO (path
), decl
);
2814 decl
= convert_from_reference (decl
);
2818 if (TREE_DEPRECATED (decl
))
2819 warn_deprecated_use (decl
);
2824 /* Implement the __typeof keyword: Return the type of EXPR, suitable for
2825 use as a type-specifier. */
2828 finish_typeof (tree expr
)
2832 if (type_dependent_expression_p (expr
))
2834 type
= make_aggr_type (TYPEOF_TYPE
);
2835 TYPEOF_TYPE_EXPR (type
) = expr
;
2840 type
= TREE_TYPE (expr
);
2842 if (!type
|| type
== unknown_type_node
)
2844 error ("type of %qE is unknown", expr
);
2845 return error_mark_node
;
2851 /* Called from expand_body via walk_tree. Replace all AGGR_INIT_EXPRs
2852 with equivalent CALL_EXPRs. */
2855 simplify_aggr_init_exprs_r (tree
* tp
,
2857 void* data ATTRIBUTE_UNUSED
)
2859 /* We don't need to walk into types; there's nothing in a type that
2860 needs simplification. (And, furthermore, there are places we
2861 actively don't want to go. For example, we don't want to wander
2862 into the default arguments for a FUNCTION_DECL that appears in a
2869 /* Only AGGR_INIT_EXPRs are interesting. */
2870 else if (TREE_CODE (*tp
) != AGGR_INIT_EXPR
)
2873 simplify_aggr_init_expr (tp
);
2875 /* Keep iterating. */
2879 /* Replace the AGGR_INIT_EXPR at *TP with an equivalent CALL_EXPR. This
2880 function is broken out from the above for the benefit of the tree-ssa
2884 simplify_aggr_init_expr (tree
*tp
)
2886 tree aggr_init_expr
= *tp
;
2888 /* Form an appropriate CALL_EXPR. */
2889 tree fn
= TREE_OPERAND (aggr_init_expr
, 0);
2890 tree args
= TREE_OPERAND (aggr_init_expr
, 1);
2891 tree slot
= TREE_OPERAND (aggr_init_expr
, 2);
2892 tree type
= TREE_TYPE (slot
);
2895 enum style_t
{ ctor
, arg
, pcc
} style
;
2897 if (AGGR_INIT_VIA_CTOR_P (aggr_init_expr
))
2899 #ifdef PCC_STATIC_STRUCT_RETURN
2905 gcc_assert (TREE_ADDRESSABLE (type
));
2911 /* Replace the first argument to the ctor with the address of the
2915 args
= TREE_CHAIN (args
);
2916 cxx_mark_addressable (slot
);
2917 addr
= build1 (ADDR_EXPR
, build_pointer_type (type
), slot
);
2918 args
= tree_cons (NULL_TREE
, addr
, args
);
2921 call_expr
= build3 (CALL_EXPR
,
2922 TREE_TYPE (TREE_TYPE (TREE_TYPE (fn
))),
2923 fn
, args
, NULL_TREE
);
2927 /* Just mark it addressable here, and leave the rest to
2928 expand_call{,_inline}. */
2929 cxx_mark_addressable (slot
);
2930 CALL_EXPR_RETURN_SLOT_OPT (call_expr
) = true;
2931 call_expr
= build2 (MODIFY_EXPR
, TREE_TYPE (call_expr
), slot
, call_expr
);
2933 else if (style
== pcc
)
2935 /* If we're using the non-reentrant PCC calling convention, then we
2936 need to copy the returned value out of the static buffer into the
2938 push_deferring_access_checks (dk_no_check
);
2939 call_expr
= build_aggr_init (slot
, call_expr
,
2940 DIRECT_BIND
| LOOKUP_ONLYCONVERTING
);
2941 pop_deferring_access_checks ();
2942 call_expr
= build2 (COMPOUND_EXPR
, TREE_TYPE (slot
), call_expr
, slot
);
2948 /* Emit all thunks to FN that should be emitted when FN is emitted. */
2951 emit_associated_thunks (tree fn
)
2953 /* When we use vcall offsets, we emit thunks with the virtual
2954 functions to which they thunk. The whole point of vcall offsets
2955 is so that you can know statically the entire set of thunks that
2956 will ever be needed for a given virtual function, thereby
2957 enabling you to output all the thunks with the function itself. */
2958 if (DECL_VIRTUAL_P (fn
))
2962 for (thunk
= DECL_THUNKS (fn
); thunk
; thunk
= TREE_CHAIN (thunk
))
2964 if (!THUNK_ALIAS (thunk
))
2966 use_thunk (thunk
, /*emit_p=*/1);
2967 if (DECL_RESULT_THUNK_P (thunk
))
2971 for (probe
= DECL_THUNKS (thunk
);
2972 probe
; probe
= TREE_CHAIN (probe
))
2973 use_thunk (probe
, /*emit_p=*/1);
2977 gcc_assert (!DECL_THUNKS (thunk
));
2982 /* Generate RTL for FN. */
2985 expand_body (tree fn
)
2987 tree saved_function
;
2989 /* Compute the appropriate object-file linkage for inline
2991 if (DECL_DECLARED_INLINE_P (fn
))
2992 import_export_decl (fn
);
2994 /* If FN is external, then there's no point in generating RTL for
2995 it. This situation can arise with an inline function under
2996 `-fexternal-templates'; we instantiate the function, even though
2997 we're not planning on emitting it, in case we get a chance to
2999 if (DECL_EXTERNAL (fn
))
3002 /* ??? When is this needed? */
3003 saved_function
= current_function_decl
;
3005 /* Emit any thunks that should be emitted at the same time as FN. */
3006 emit_associated_thunks (fn
);
3008 /* This function is only called from cgraph, or recursively from
3009 emit_associated_thunks. In neither case should we be currently
3010 generating trees for a function. */
3011 gcc_assert (function_depth
== 0);
3013 tree_rest_of_compilation (fn
);
3015 current_function_decl
= saved_function
;
3017 if (DECL_CLONED_FUNCTION_P (fn
))
3019 /* If this is a clone, go through the other clones now and mark
3020 their parameters used. We have to do that here, as we don't
3021 know whether any particular clone will be expanded, and
3022 therefore cannot pick one arbitrarily. */
3025 for (probe
= TREE_CHAIN (DECL_CLONED_FUNCTION (fn
));
3026 probe
&& DECL_CLONED_FUNCTION_P (probe
);
3027 probe
= TREE_CHAIN (probe
))
3031 for (parms
= DECL_ARGUMENTS (probe
);
3032 parms
; parms
= TREE_CHAIN (parms
))
3033 TREE_USED (parms
) = 1;
3038 /* Generate RTL for FN. */
3041 expand_or_defer_fn (tree fn
)
3043 /* When the parser calls us after finishing the body of a template
3044 function, we don't really want to expand the body. */
3045 if (processing_template_decl
)
3047 /* Normally, collection only occurs in rest_of_compilation. So,
3048 if we don't collect here, we never collect junk generated
3049 during the processing of templates until we hit a
3050 non-template function. It's not safe to do this inside a
3051 nested class, though, as the parser may have local state that
3052 is not a GC root. */
3053 if (!function_depth
)
3058 /* Replace AGGR_INIT_EXPRs with appropriate CALL_EXPRs. */
3059 walk_tree_without_duplicates (&DECL_SAVED_TREE (fn
),
3060 simplify_aggr_init_exprs_r
,
3063 /* If this is a constructor or destructor body, we have to clone
3065 if (maybe_clone_body (fn
))
3067 /* We don't want to process FN again, so pretend we've written
3068 it out, even though we haven't. */
3069 TREE_ASM_WRITTEN (fn
) = 1;
3073 /* If this function is marked with the constructor attribute, add it
3074 to the list of functions to be called along with constructors
3075 from static duration objects. */
3076 if (DECL_STATIC_CONSTRUCTOR (fn
))
3077 static_ctors
= tree_cons (NULL_TREE
, fn
, static_ctors
);
3079 /* If this function is marked with the destructor attribute, add it
3080 to the list of functions to be called along with destructors from
3081 static duration objects. */
3082 if (DECL_STATIC_DESTRUCTOR (fn
))
3083 static_dtors
= tree_cons (NULL_TREE
, fn
, static_dtors
);
3085 /* We make a decision about linkage for these functions at the end
3086 of the compilation. Until that point, we do not want the back
3087 end to output them -- but we do want it to see the bodies of
3088 these functions so that it can inline them as appropriate. */
3089 if (DECL_DECLARED_INLINE_P (fn
) || DECL_IMPLICIT_INSTANTIATION (fn
))
3091 if (DECL_INTERFACE_KNOWN (fn
))
3092 /* We've already made a decision as to how this function will
3096 DECL_EXTERNAL (fn
) = 1;
3097 DECL_NOT_REALLY_EXTERN (fn
) = 1;
3098 note_vague_linkage_fn (fn
);
3099 /* A non-template inline function with external linkage will
3100 always be COMDAT. As we must eventually determine the
3101 linkage of all functions, and as that causes writes to
3102 the data mapped in from the PCH file, it's advantageous
3103 to mark the functions at this point. */
3104 if (!DECL_IMPLICIT_INSTANTIATION (fn
))
3106 /* This function must have external linkage, as
3107 otherwise DECL_INTERFACE_KNOWN would have been
3109 gcc_assert (TREE_PUBLIC (fn
));
3110 comdat_linkage (fn
);
3111 DECL_INTERFACE_KNOWN (fn
) = 1;
3115 import_export_decl (fn
);
3117 /* If the user wants us to keep all inline functions, then mark
3118 this function as needed so that finish_file will make sure to
3120 if (flag_keep_inline_functions
&& DECL_DECLARED_INLINE_P (fn
))
3124 /* There's no reason to do any of the work here if we're only doing
3125 semantic analysis; this code just generates RTL. */
3126 if (flag_syntax_only
)
3131 /* Expand or defer, at the whim of the compilation unit manager. */
3132 cgraph_finalize_function (fn
, function_depth
> 1);
3144 /* Helper function for walk_tree, used by finalize_nrv below. */
3147 finalize_nrv_r (tree
* tp
, int* walk_subtrees
, void* data
)
3149 struct nrv_data
*dp
= (struct nrv_data
*)data
;
3152 /* No need to walk into types. There wouldn't be any need to walk into
3153 non-statements, except that we have to consider STMT_EXPRs. */
3156 /* Change all returns to just refer to the RESULT_DECL; this is a nop,
3157 but differs from using NULL_TREE in that it indicates that we care
3158 about the value of the RESULT_DECL. */
3159 else if (TREE_CODE (*tp
) == RETURN_EXPR
)
3160 TREE_OPERAND (*tp
, 0) = dp
->result
;
3161 /* Change all cleanups for the NRV to only run when an exception is
3163 else if (TREE_CODE (*tp
) == CLEANUP_STMT
3164 && CLEANUP_DECL (*tp
) == dp
->var
)
3165 CLEANUP_EH_ONLY (*tp
) = 1;
3166 /* Replace the DECL_EXPR for the NRV with an initialization of the
3167 RESULT_DECL, if needed. */
3168 else if (TREE_CODE (*tp
) == DECL_EXPR
3169 && DECL_EXPR_DECL (*tp
) == dp
->var
)
3172 if (DECL_INITIAL (dp
->var
)
3173 && DECL_INITIAL (dp
->var
) != error_mark_node
)
3175 init
= build2 (INIT_EXPR
, void_type_node
, dp
->result
,
3176 DECL_INITIAL (dp
->var
));
3177 DECL_INITIAL (dp
->var
) = error_mark_node
;
3180 init
= build_empty_stmt ();
3181 SET_EXPR_LOCUS (init
, EXPR_LOCUS (*tp
));
3184 /* And replace all uses of the NRV with the RESULT_DECL. */
3185 else if (*tp
== dp
->var
)
3188 /* Avoid walking into the same tree more than once. Unfortunately, we
3189 can't just use walk_tree_without duplicates because it would only call
3190 us for the first occurrence of dp->var in the function body. */
3191 slot
= htab_find_slot (dp
->visited
, *tp
, INSERT
);
3197 /* Keep iterating. */
3201 /* Called from finish_function to implement the named return value
3202 optimization by overriding all the RETURN_EXPRs and pertinent
3203 CLEANUP_STMTs and replacing all occurrences of VAR with RESULT, the
3204 RESULT_DECL for the function. */
3207 finalize_nrv (tree
*tp
, tree var
, tree result
)
3209 struct nrv_data data
;
3211 /* Copy debugging information from VAR to RESULT. */
3212 DECL_NAME (result
) = DECL_NAME (var
);
3213 DECL_ARTIFICIAL (result
) = DECL_ARTIFICIAL (var
);
3214 DECL_IGNORED_P (result
) = DECL_IGNORED_P (var
);
3215 DECL_SOURCE_LOCATION (result
) = DECL_SOURCE_LOCATION (var
);
3216 DECL_ABSTRACT_ORIGIN (result
) = DECL_ABSTRACT_ORIGIN (var
);
3217 /* Don't forget that we take its address. */
3218 TREE_ADDRESSABLE (result
) = TREE_ADDRESSABLE (var
);
3221 data
.result
= result
;
3222 data
.visited
= htab_create (37, htab_hash_pointer
, htab_eq_pointer
, NULL
);
3223 walk_tree (tp
, finalize_nrv_r
, &data
, 0);
3224 htab_delete (data
.visited
);
3227 /* For all elements of CLAUSES, validate them vs OpenMP constraints.
3228 Remove any elements from the list that are invalid. */
3231 finish_omp_clauses (tree clauses
)
3233 bitmap_head generic_head
, firstprivate_head
, lastprivate_head
;
3234 tree c
, t
, *pc
= &clauses
;
3237 bitmap_obstack_initialize (NULL
);
3238 bitmap_initialize (&generic_head
, &bitmap_default_obstack
);
3239 bitmap_initialize (&firstprivate_head
, &bitmap_default_obstack
);
3240 bitmap_initialize (&lastprivate_head
, &bitmap_default_obstack
);
3242 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3244 bool remove
= false;
3246 switch (OMP_CLAUSE_CODE (c
))
3248 case OMP_CLAUSE_SHARED
:
3250 goto check_dup_generic
;
3251 case OMP_CLAUSE_PRIVATE
:
3253 goto check_dup_generic
;
3254 case OMP_CLAUSE_REDUCTION
:
3256 goto check_dup_generic
;
3257 case OMP_CLAUSE_COPYPRIVATE
:
3258 name
= "copyprivate";
3259 goto check_dup_generic
;
3260 case OMP_CLAUSE_COPYIN
:
3262 goto check_dup_generic
;
3264 t
= OMP_CLAUSE_DECL (c
);
3265 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3267 if (processing_template_decl
)
3269 error ("%qE is not a variable in clause %qs", t
, name
);
3272 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3273 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
))
3274 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
3276 error ("%qE appears more than once in data clauses", t
);
3280 bitmap_set_bit (&generic_head
, DECL_UID (t
));
3283 case OMP_CLAUSE_FIRSTPRIVATE
:
3284 t
= OMP_CLAUSE_DECL (c
);
3285 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3287 if (processing_template_decl
)
3289 error ("%qE is not a variable in clause %<firstprivate%>", t
);
3292 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3293 || bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
3295 error ("%qE appears more than once in data clauses", t
);
3299 bitmap_set_bit (&firstprivate_head
, DECL_UID (t
));
3302 case OMP_CLAUSE_LASTPRIVATE
:
3303 t
= OMP_CLAUSE_DECL (c
);
3304 if (TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3306 if (processing_template_decl
)
3308 error ("%qE is not a variable in clause %<lastprivate%>", t
);
3311 else if (bitmap_bit_p (&generic_head
, DECL_UID (t
))
3312 || bitmap_bit_p (&lastprivate_head
, DECL_UID (t
)))
3314 error ("%qE appears more than once in data clauses", t
);
3318 bitmap_set_bit (&lastprivate_head
, DECL_UID (t
));
3322 t
= OMP_CLAUSE_IF_EXPR (c
);
3323 t
= maybe_convert_cond (t
);
3324 if (t
== error_mark_node
)
3326 OMP_CLAUSE_IF_EXPR (c
) = t
;
3329 case OMP_CLAUSE_NUM_THREADS
:
3330 t
= OMP_CLAUSE_NUM_THREADS_EXPR (c
);
3331 if (t
== error_mark_node
)
3333 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t
))
3334 && !type_dependent_expression_p (t
))
3336 error ("num_threads expression must be integral");
3341 case OMP_CLAUSE_SCHEDULE
:
3342 t
= OMP_CLAUSE_SCHEDULE_CHUNK_EXPR (c
);
3345 else if (t
== error_mark_node
)
3347 else if (!INTEGRAL_TYPE_P (TREE_TYPE (t
))
3348 && !type_dependent_expression_p (t
))
3350 error ("schedule chunk size expression must be integral");
3355 case OMP_CLAUSE_NOWAIT
:
3356 case OMP_CLAUSE_ORDERED
:
3357 case OMP_CLAUSE_DEFAULT
:
3365 *pc
= OMP_CLAUSE_CHAIN (c
);
3367 pc
= &OMP_CLAUSE_CHAIN (c
);
3370 for (pc
= &clauses
, c
= clauses
; c
; c
= *pc
)
3372 enum tree_code c_kind
= OMP_CLAUSE_CODE (c
);
3373 bool remove
= false;
3374 bool need_complete_non_reference
= false;
3375 bool need_default_ctor
= false;
3376 bool need_copy_ctor
= false;
3377 bool need_copy_assignment
= false;
3378 bool need_implicitly_determined
= false;
3379 tree type
, inner_type
;
3383 case OMP_CLAUSE_SHARED
:
3385 need_implicitly_determined
= true;
3387 case OMP_CLAUSE_PRIVATE
:
3389 need_complete_non_reference
= true;
3390 need_default_ctor
= true;
3391 need_implicitly_determined
= true;
3393 case OMP_CLAUSE_FIRSTPRIVATE
:
3394 name
= "firstprivate";
3395 need_complete_non_reference
= true;
3396 need_copy_ctor
= true;
3397 need_implicitly_determined
= true;
3399 case OMP_CLAUSE_LASTPRIVATE
:
3400 name
= "lastprivate";
3401 need_complete_non_reference
= true;
3402 need_copy_assignment
= true;
3403 need_implicitly_determined
= true;
3405 case OMP_CLAUSE_REDUCTION
:
3407 need_implicitly_determined
= true;
3409 case OMP_CLAUSE_COPYPRIVATE
:
3410 name
= "copyprivate";
3411 need_copy_assignment
= true;
3413 case OMP_CLAUSE_COPYIN
:
3415 need_copy_assignment
= true;
3418 pc
= &OMP_CLAUSE_CHAIN (c
);
3422 t
= OMP_CLAUSE_DECL (c
);
3423 if (processing_template_decl
3424 && TREE_CODE (t
) != VAR_DECL
&& TREE_CODE (t
) != PARM_DECL
)
3426 pc
= &OMP_CLAUSE_CHAIN (c
);
3432 case OMP_CLAUSE_LASTPRIVATE
:
3433 if (!bitmap_bit_p (&firstprivate_head
, DECL_UID (t
)))
3434 need_default_ctor
= true;
3437 case OMP_CLAUSE_REDUCTION
:
3438 if (AGGREGATE_TYPE_P (TREE_TYPE (t
))
3439 || POINTER_TYPE_P (TREE_TYPE (t
)))
3441 error ("%qE has invalid type for %<reduction%>", t
);
3444 else if (FLOAT_TYPE_P (TREE_TYPE (t
)))
3446 enum tree_code r_code
= OMP_CLAUSE_REDUCTION_CODE (c
);
3454 error ("%qE has invalid type for %<reduction(%s)%>",
3455 t
, operator_name_info
[r_code
].name
);
3461 case OMP_CLAUSE_COPYIN
:
3462 if (TREE_CODE (t
) != VAR_DECL
|| !DECL_THREAD_LOCAL_P (t
))
3464 error ("%qE must be %<threadprivate%> for %<copyin%>", t
);
3473 if (need_complete_non_reference
)
3475 t
= require_complete_type (t
);
3476 if (t
== error_mark_node
)
3478 else if (TREE_CODE (TREE_TYPE (t
)) == REFERENCE_TYPE
)
3480 error ("%qE has reference type for %qs", t
, name
);
3484 if (need_implicitly_determined
)
3486 const char *share_name
= NULL
;
3488 if (TREE_CODE (t
) == VAR_DECL
&& DECL_THREAD_LOCAL_P (t
))
3489 share_name
= "threadprivate";
3490 else switch (cxx_omp_predetermined_sharing (t
))
3492 case OMP_CLAUSE_DEFAULT_UNSPECIFIED
:
3494 case OMP_CLAUSE_DEFAULT_SHARED
:
3495 share_name
= "shared";
3497 case OMP_CLAUSE_DEFAULT_PRIVATE
:
3498 share_name
= "private";
3505 error ("%qE is predetermined %qs for %qs",
3506 t
, share_name
, name
);
3511 /* We're interested in the base element, not arrays. */
3512 inner_type
= type
= TREE_TYPE (t
);
3513 while (TREE_CODE (inner_type
) == ARRAY_TYPE
)
3514 inner_type
= TREE_TYPE (inner_type
);
3516 /* Check for special function availability by building a call to one.
3517 Save the results, because later we won't be in the right context
3518 for making these queries. */
3519 if (CLASS_TYPE_P (inner_type
)
3520 && (need_default_ctor
|| need_copy_ctor
|| need_copy_assignment
))
3522 int save_errorcount
= errorcount
;
3525 /* Always allocate 3 elements for simplicity. These are the
3526 function decls for the ctor, dtor, and assignment op.
3527 This layout is known to the three lang hooks,
3528 cxx_omp_clause_default_init, cxx_omp_clause_copy_init,
3529 and cxx_omp_clause_assign_op. */
3530 info
= make_tree_vec (3);
3531 CP_OMP_CLAUSE_INFO (c
) = info
;
3533 if (need_default_ctor
3535 && !TYPE_HAS_TRIVIAL_INIT_REF (inner_type
)))
3537 if (need_default_ctor
)
3541 t
= build_int_cst (build_pointer_type (inner_type
), 0);
3542 t
= build1 (INDIRECT_REF
, inner_type
, t
);
3543 t
= build_tree_list (NULL
, t
);
3545 t
= build_special_member_call (NULL_TREE
,
3546 complete_ctor_identifier
,
3547 t
, inner_type
, LOOKUP_NORMAL
);
3548 t
= get_callee_fndecl (t
);
3549 TREE_VEC_ELT (info
, 0) = t
;
3552 if ((need_default_ctor
|| need_copy_ctor
)
3553 && TYPE_HAS_NONTRIVIAL_DESTRUCTOR (inner_type
))
3555 t
= build_int_cst (build_pointer_type (inner_type
), 0);
3556 t
= build1 (INDIRECT_REF
, inner_type
, t
);
3557 t
= build_special_member_call (t
, complete_dtor_identifier
,
3558 NULL
, inner_type
, LOOKUP_NORMAL
);
3559 t
= get_callee_fndecl (t
);
3560 TREE_VEC_ELT (info
, 1) = t
;
3563 if (need_copy_assignment
3564 && !TYPE_HAS_TRIVIAL_ASSIGN_REF (inner_type
))
3566 t
= build_int_cst (build_pointer_type (inner_type
), 0);
3567 t
= build1 (INDIRECT_REF
, inner_type
, t
);
3568 t
= build_special_member_call (t
, ansi_assopname (NOP_EXPR
),
3569 build_tree_list (NULL
, t
),
3570 inner_type
, LOOKUP_NORMAL
);
3572 /* We'll have called convert_from_reference on the call, which
3573 may well have added an indirect_ref. It's unneeded here,
3574 and in the way, so kill it. */
3575 if (TREE_CODE (t
) == INDIRECT_REF
)
3576 t
= TREE_OPERAND (t
, 0);
3578 t
= get_callee_fndecl (t
);
3579 TREE_VEC_ELT (info
, 2) = t
;
3582 if (errorcount
!= save_errorcount
)
3587 *pc
= OMP_CLAUSE_CHAIN (c
);
3589 pc
= &OMP_CLAUSE_CHAIN (c
);
3592 bitmap_obstack_release (NULL
);
3596 /* For all variables in the tree_list VARS, mark them as thread local. */
3599 finish_omp_threadprivate (tree vars
)
3603 /* Mark every variable in VARS to be assigned thread local storage. */
3604 for (t
= vars
; t
; t
= TREE_CHAIN (t
))
3606 tree v
= TREE_PURPOSE (t
);
3608 /* If V had already been marked threadprivate, it doesn't matter
3609 whether it had been used prior to this point. */
3611 && (DECL_LANG_SPECIFIC (v
) == NULL
3612 || !CP_DECL_THREADPRIVATE_P (v
)))
3613 error ("%qE declared %<threadprivate%> after first use", v
);
3614 else if (! TREE_STATIC (v
) && ! DECL_EXTERNAL (v
))
3615 error ("automatic variable %qE cannot be %<threadprivate%>", v
);
3616 else if (! COMPLETE_TYPE_P (TREE_TYPE (v
)))
3617 error ("%<threadprivate%> %qE has incomplete type", v
);
3618 else if (TREE_STATIC (v
) && TYPE_P (CP_DECL_CONTEXT (v
)))
3619 error ("%<threadprivate%> %qE is not file, namespace "
3620 "or block scope variable", v
);
3623 /* Allocate a LANG_SPECIFIC structure for V, if needed. */
3624 if (DECL_LANG_SPECIFIC (v
) == NULL
)
3626 retrofit_lang_decl (v
);
3628 /* Make sure that DECL_DISCRIMINATOR_P continues to be true
3629 after the allocation of the lang_decl structure. */
3630 if (DECL_DISCRIMINATOR_P (v
))
3631 DECL_LANG_SPECIFIC (v
)->decl_flags
.u2sel
= 1;
3634 if (! DECL_THREAD_LOCAL_P (v
))
3636 DECL_TLS_MODEL (v
) = decl_default_tls_model (v
);
3637 /* If rtl has been already set for this var, call
3638 make_decl_rtl once again, so that encode_section_info
3639 has a chance to look at the new decl flags. */
3640 if (DECL_RTL_SET_P (v
))
3643 CP_DECL_THREADPRIVATE_P (v
) = 1;
3648 /* Build an OpenMP structured block. */
3651 begin_omp_structured_block (void)
3653 return do_pushlevel (sk_omp
);
3657 finish_omp_structured_block (tree block
)
3659 return do_poplevel (block
);
3662 /* Similarly, except force the retention of the BLOCK. */
3665 begin_omp_parallel (void)
3667 keep_next_level (true);
3668 return begin_omp_structured_block ();
3672 finish_omp_parallel (tree clauses
, tree body
)
3676 body
= finish_omp_structured_block (body
);
3678 stmt
= make_node (OMP_PARALLEL
);
3679 TREE_TYPE (stmt
) = void_type_node
;
3680 OMP_PARALLEL_CLAUSES (stmt
) = clauses
;
3681 OMP_PARALLEL_BODY (stmt
) = body
;
3683 return add_stmt (stmt
);
3686 /* Build and validate an OMP_FOR statement. CLAUSES, BODY, COND, INCR
3687 are directly for their associated operands in the statement. DECL
3688 and INIT are a combo; if DECL is NULL then INIT ought to be a
3689 MODIFY_EXPR, and the DECL should be extracted. PRE_BODY are
3690 optional statements that need to go before the loop into its
3694 finish_omp_for (location_t locus
, tree decl
, tree init
, tree cond
,
3695 tree incr
, tree body
, tree pre_body
)
3700 switch (TREE_CODE (init
))
3703 decl
= TREE_OPERAND (init
, 0);
3704 init
= TREE_OPERAND (init
, 1);
3707 if (TREE_CODE (TREE_OPERAND (init
, 1)) == NOP_EXPR
)
3709 decl
= TREE_OPERAND (init
, 0);
3710 init
= TREE_OPERAND (init
, 2);
3719 error ("expected iteration declaration or initialization");
3724 if (type_dependent_expression_p (decl
)
3725 || type_dependent_expression_p (init
)
3726 || (cond
&& type_dependent_expression_p (cond
))
3727 || (incr
&& type_dependent_expression_p (incr
)))
3733 error ("%Hmissing controlling predicate", &locus
);
3739 error ("%Hmissing increment expression", &locus
);
3743 stmt
= make_node (OMP_FOR
);
3745 /* This is really just a place-holder. We'll be decomposing this
3746 again and going through the build_modify_expr path below when
3747 we instantiate the thing. */
3748 init
= build2 (MODIFY_EXPR
, void_type_node
, decl
, init
);
3750 TREE_TYPE (stmt
) = void_type_node
;
3751 OMP_FOR_INIT (stmt
) = init
;
3752 OMP_FOR_COND (stmt
) = cond
;
3753 OMP_FOR_INCR (stmt
) = incr
;
3754 OMP_FOR_BODY (stmt
) = body
;
3755 OMP_FOR_PRE_BODY (stmt
) = pre_body
;
3757 SET_EXPR_LOCATION (stmt
, locus
);
3758 return add_stmt (stmt
);
3763 error ("expected iteration declaration or initialization");
3767 if (pre_body
== NULL
|| IS_EMPTY_STMT (pre_body
))
3769 else if (! processing_template_decl
)
3771 add_stmt (pre_body
);
3774 init
= build_modify_expr (decl
, NOP_EXPR
, init
);
3775 return c_finish_omp_for (locus
, decl
, init
, cond
, incr
, body
, pre_body
);
3779 finish_omp_atomic (enum tree_code code
, tree lhs
, tree rhs
)
3781 /* If either of the operands are dependent, we can't do semantic
3782 processing yet. Stuff the values away for now. We cheat a bit
3783 and use the same tree code for this, even though the operands
3784 are of totally different form, thus we need to remember which
3785 statements are which, thus the lang_flag bit. */
3786 /* ??? We ought to be using type_dependent_expression_p, but the
3787 invocation of build_modify_expr in c_finish_omp_atomic can result
3788 in the creation of CONVERT_EXPRs, which are not handled by
3789 tsubst_copy_and_build. */
3790 if (uses_template_parms (lhs
) || uses_template_parms (rhs
))
3792 tree stmt
= build2 (OMP_ATOMIC
, void_type_node
, lhs
, rhs
);
3793 OMP_ATOMIC_DEPENDENT_P (stmt
) = 1;
3794 OMP_ATOMIC_CODE (stmt
) = code
;
3798 c_finish_omp_atomic (code
, lhs
, rhs
);
3802 finish_omp_barrier (void)
3804 tree fn
= built_in_decls
[BUILT_IN_GOMP_BARRIER
];
3805 tree stmt
= finish_call_expr (fn
, NULL
, false, false);
3806 finish_expr_stmt (stmt
);
3810 finish_omp_flush (void)
3812 tree fn
= built_in_decls
[BUILT_IN_SYNCHRONIZE
];
3813 tree stmt
= finish_call_expr (fn
, NULL
, false, false);
3814 finish_expr_stmt (stmt
);
3817 /* True if OpenMP sharing attribute of DECL is predetermined. */
3819 enum omp_clause_default_kind
3820 cxx_omp_predetermined_sharing (tree decl
)
3822 enum omp_clause_default_kind kind
;
3824 kind
= c_omp_predetermined_sharing (decl
);
3825 if (kind
!= OMP_CLAUSE_DEFAULT_UNSPECIFIED
)
3828 /* Static data members are predetermined as shared. */
3829 if (TREE_STATIC (decl
))
3831 tree ctx
= CP_DECL_CONTEXT (decl
);
3832 if (TYPE_P (ctx
) && IS_AGGR_TYPE (ctx
))
3833 return OMP_CLAUSE_DEFAULT_SHARED
;
3836 return OMP_CLAUSE_DEFAULT_UNSPECIFIED
;
3840 init_cp_semantics (void)
3844 #include "gt-cp-semantics.h"