1 /* C++-specific tree lowering bits; see also c-gimplify.c and tree-gimple.c.
3 Copyright (C) 2002, 2003, 2004, 2005, 2006, 2007, 2008, 2009
4 Free Software Foundation, Inc.
5 Contributed by Jason Merrill <jason@redhat.com>
7 This file is part of GCC.
9 GCC is free software; you can redistribute it and/or modify it under
10 the terms of the GNU General Public License as published by the Free
11 Software Foundation; either version 3, or (at your option) any later
14 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
15 WARRANTY; without even the implied warranty of MERCHANTABILITY or
16 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
19 You should have received a copy of the GNU General Public License
20 along with GCC; see the file COPYING3. If not see
21 <http://www.gnu.org/licenses/>. */
25 #include "coretypes.h"
31 #include "tree-iterator.h"
34 #include "pointer-set.h"
37 /* Local declarations. */
39 enum bc_t { bc_break = 0, bc_continue = 1 };
41 /* Stack of labels which are targets for "break" or "continue",
42 linked through TREE_CHAIN. */
43 static tree bc_label[2];
45 /* Begin a scope which can be exited by a break or continue statement. BC
48 Just creates a label and pushes it into the current context. */
51 begin_bc_block (enum bc_t bc)
53 tree label = create_artificial_label (input_location);
54 TREE_CHAIN (label) = bc_label[bc];
59 /* Finish a scope which can be exited by a break or continue statement.
60 LABEL was returned from the most recent call to begin_bc_block. BODY is
61 an expression for the contents of the scope.
63 If we saw a break (or continue) in the scope, append a LABEL_EXPR to
64 body. Otherwise, just forget the label. */
67 finish_bc_block (enum bc_t bc, tree label, gimple_seq body)
69 gcc_assert (label == bc_label[bc]);
71 if (TREE_USED (label))
73 gimple_seq_add_stmt (&body, gimple_build_label (label));
76 bc_label[bc] = TREE_CHAIN (label);
77 TREE_CHAIN (label) = NULL_TREE;
81 /* Get the LABEL_EXPR to represent a break or continue statement
82 in the current block scope. BC indicates which. */
85 get_bc_label (enum bc_t bc)
87 tree label = bc_label[bc];
89 if (label == NULL_TREE)
92 error ("break statement not within loop or switch");
94 error ("continue statement not within loop or switch");
99 /* Mark the label used for finish_bc_block. */
100 TREE_USED (label) = 1;
104 /* Genericize a TRY_BLOCK. */
107 genericize_try_block (tree *stmt_p)
109 tree body = TRY_STMTS (*stmt_p);
110 tree cleanup = TRY_HANDLERS (*stmt_p);
112 *stmt_p = build2 (TRY_CATCH_EXPR, void_type_node, body, cleanup);
115 /* Genericize a HANDLER by converting to a CATCH_EXPR. */
118 genericize_catch_block (tree *stmt_p)
120 tree type = HANDLER_TYPE (*stmt_p);
121 tree body = HANDLER_BODY (*stmt_p);
123 /* FIXME should the caught type go in TREE_TYPE? */
124 *stmt_p = build2 (CATCH_EXPR, void_type_node, type, body);
127 /* A terser interface for building a representation of an exception
131 build_gimple_eh_filter_tree (tree body, tree allowed, tree failure)
135 /* FIXME should the allowed types go in TREE_TYPE? */
136 t = build2 (EH_FILTER_EXPR, void_type_node, allowed, NULL_TREE);
137 append_to_statement_list (failure, &EH_FILTER_FAILURE (t));
139 t = build2 (TRY_CATCH_EXPR, void_type_node, NULL_TREE, t);
140 append_to_statement_list (body, &TREE_OPERAND (t, 0));
145 /* Genericize an EH_SPEC_BLOCK by converting it to a
146 TRY_CATCH_EXPR/EH_FILTER_EXPR pair. */
149 genericize_eh_spec_block (tree *stmt_p)
151 tree body = EH_SPEC_STMTS (*stmt_p);
152 tree allowed = EH_SPEC_RAISES (*stmt_p);
153 tree failure = build_call_n (call_unexpected_node, 1, build_exc_ptr ());
155 *stmt_p = build_gimple_eh_filter_tree (body, allowed, failure);
156 TREE_NO_WARNING (*stmt_p) = true;
157 TREE_NO_WARNING (TREE_OPERAND (*stmt_p, 1)) = true;
160 /* Genericize an IF_STMT by turning it into a COND_EXPR. */
163 genericize_if_stmt (tree *stmt_p)
165 tree stmt, cond, then_, else_;
166 location_t locus = EXPR_LOCATION (*stmt_p);
169 cond = IF_COND (stmt);
170 then_ = THEN_CLAUSE (stmt);
171 else_ = ELSE_CLAUSE (stmt);
174 then_ = build_empty_stmt (locus);
176 else_ = build_empty_stmt (locus);
178 if (integer_nonzerop (cond) && !TREE_SIDE_EFFECTS (else_))
180 else if (integer_zerop (cond) && !TREE_SIDE_EFFECTS (then_))
183 stmt = build3 (COND_EXPR, void_type_node, cond, then_, else_);
184 if (CAN_HAVE_LOCATION_P (stmt) && !EXPR_HAS_LOCATION (stmt))
185 SET_EXPR_LOCATION (stmt, locus);
189 /* Build a generic representation of one of the C loop forms. COND is the
190 loop condition or NULL_TREE. BODY is the (possibly compound) statement
191 controlled by the loop. INCR is the increment expression of a for-loop,
192 or NULL_TREE. COND_IS_FIRST indicates whether the condition is
193 evaluated before the loop body as in while and for loops, or after the
194 loop body as in do-while loops. */
197 gimplify_cp_loop (tree cond, tree body, tree incr, bool cond_is_first)
199 gimple top, entry, stmt;
200 gimple_seq stmt_list, body_seq, incr_seq, exit_seq;
201 tree cont_block, break_block;
202 location_t stmt_locus;
204 stmt_locus = input_location;
211 break_block = begin_bc_block (bc_break);
212 cont_block = begin_bc_block (bc_continue);
214 /* If condition is zero don't generate a loop construct. */
215 if (cond && integer_zerop (cond))
220 stmt = gimple_build_goto (get_bc_label (bc_break));
221 gimple_set_location (stmt, stmt_locus);
222 gimple_seq_add_stmt (&stmt_list, stmt);
227 /* If we use a LOOP_EXPR here, we have to feed the whole thing
228 back through the main gimplifier to lower it. Given that we
229 have to gimplify the loop body NOW so that we can resolve
230 break/continue stmts, seems easier to just expand to gotos. */
231 top = gimple_build_label (create_artificial_label (stmt_locus));
233 /* If we have an exit condition, then we build an IF with gotos either
234 out of the loop, or to the top of it. If there's no exit condition,
235 then we just build a jump back to the top. */
236 if (cond && !integer_nonzerop (cond))
238 if (cond != error_mark_node)
240 gimplify_expr (&cond, &exit_seq, NULL, is_gimple_val, fb_rvalue);
241 stmt = gimple_build_cond (NE_EXPR, cond,
242 build_int_cst (TREE_TYPE (cond), 0),
243 gimple_label_label (top),
244 get_bc_label (bc_break));
245 gimple_seq_add_stmt (&exit_seq, stmt);
252 entry = gimple_build_label
253 (create_artificial_label (stmt_locus));
254 stmt = gimple_build_goto (gimple_label_label (entry));
257 stmt = gimple_build_goto (get_bc_label (bc_continue));
258 gimple_set_location (stmt, stmt_locus);
259 gimple_seq_add_stmt (&stmt_list, stmt);
264 stmt = gimple_build_goto (gimple_label_label (top));
265 gimple_seq_add_stmt (&exit_seq, stmt);
269 gimplify_stmt (&body, &body_seq);
270 gimplify_stmt (&incr, &incr_seq);
272 body_seq = finish_bc_block (bc_continue, cont_block, body_seq);
274 gimple_seq_add_stmt (&stmt_list, top);
275 gimple_seq_add_seq (&stmt_list, body_seq);
276 gimple_seq_add_seq (&stmt_list, incr_seq);
277 gimple_seq_add_stmt (&stmt_list, entry);
278 gimple_seq_add_seq (&stmt_list, exit_seq);
280 annotate_all_with_location (stmt_list, stmt_locus);
282 return finish_bc_block (bc_break, break_block, stmt_list);
285 /* Gimplify a FOR_STMT node. Move the stuff in the for-init-stmt into the
286 prequeue and hand off to gimplify_cp_loop. */
289 gimplify_for_stmt (tree *stmt_p, gimple_seq *pre_p)
293 if (FOR_INIT_STMT (stmt))
294 gimplify_and_add (FOR_INIT_STMT (stmt), pre_p);
296 gimple_seq_add_seq (pre_p,
297 gimplify_cp_loop (FOR_COND (stmt), FOR_BODY (stmt),
298 FOR_EXPR (stmt), 1));
302 /* Gimplify a WHILE_STMT node. */
305 gimplify_while_stmt (tree *stmt_p, gimple_seq *pre_p)
308 gimple_seq_add_seq (pre_p,
309 gimplify_cp_loop (WHILE_COND (stmt), WHILE_BODY (stmt),
314 /* Gimplify a DO_STMT node. */
317 gimplify_do_stmt (tree *stmt_p, gimple_seq *pre_p)
320 gimple_seq_add_seq (pre_p,
321 gimplify_cp_loop (DO_COND (stmt), DO_BODY (stmt),
326 /* Genericize a SWITCH_STMT by turning it into a SWITCH_EXPR. */
329 gimplify_switch_stmt (tree *stmt_p, gimple_seq *pre_p)
332 tree break_block, body, t;
333 location_t stmt_locus = input_location;
334 gimple_seq seq = NULL;
336 break_block = begin_bc_block (bc_break);
338 body = SWITCH_STMT_BODY (stmt);
340 body = build_empty_stmt (stmt_locus);
342 t = build3 (SWITCH_EXPR, SWITCH_STMT_TYPE (stmt),
343 SWITCH_STMT_COND (stmt), body, NULL_TREE);
344 SET_EXPR_LOCATION (t, stmt_locus);
345 gimplify_and_add (t, &seq);
347 seq = finish_bc_block (bc_break, break_block, seq);
348 gimple_seq_add_seq (pre_p, seq);
352 /* Hook into the middle of gimplifying an OMP_FOR node. This is required
353 in order to properly gimplify CONTINUE statements. Here we merely
354 manage the continue stack; the rest of the job is performed by the
355 regular gimplifier. */
357 static enum gimplify_status
358 cp_gimplify_omp_for (tree *expr_p, gimple_seq *pre_p)
360 tree for_stmt = *expr_p;
363 gimple_seq seq = NULL;
365 /* Protect ourselves from recursion. */
366 if (OMP_FOR_GIMPLIFYING_P (for_stmt))
368 OMP_FOR_GIMPLIFYING_P (for_stmt) = 1;
370 /* Note that while technically the continue label is enabled too soon
371 here, we should have already diagnosed invalid continues nested within
372 statement expressions within the INIT, COND, or INCR expressions. */
373 cont_block = begin_bc_block (bc_continue);
375 gimplify_and_add (for_stmt, &seq);
376 stmt = gimple_seq_last_stmt (seq);
377 if (gimple_code (stmt) == GIMPLE_OMP_FOR)
378 gimple_omp_set_body (stmt, finish_bc_block (bc_continue, cont_block,
379 gimple_omp_body (stmt)));
381 seq = finish_bc_block (bc_continue, cont_block, seq);
382 gimple_seq_add_seq (pre_p, seq);
384 OMP_FOR_GIMPLIFYING_P (for_stmt) = 0;
389 /* Gimplify an EXPR_STMT node. */
392 gimplify_expr_stmt (tree *stmt_p)
394 tree stmt = EXPR_STMT_EXPR (*stmt_p);
396 if (stmt == error_mark_node)
399 /* Gimplification of a statement expression will nullify the
400 statement if all its side effects are moved to *PRE_P and *POST_P.
402 In this case we will not want to emit the gimplified statement.
403 However, we may still want to emit a warning, so we do that before
405 if (stmt && warn_unused_value)
407 if (!TREE_SIDE_EFFECTS (stmt))
409 if (!IS_EMPTY_STMT (stmt)
410 && !VOID_TYPE_P (TREE_TYPE (stmt))
411 && !TREE_NO_WARNING (stmt))
412 warning (OPT_Wunused_value, "statement with no effect");
415 warn_if_unused_value (stmt, input_location);
418 if (stmt == NULL_TREE)
419 stmt = alloc_stmt_list ();
424 /* Gimplify initialization from an AGGR_INIT_EXPR. */
427 cp_gimplify_init_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
429 tree from = TREE_OPERAND (*expr_p, 1);
430 tree to = TREE_OPERAND (*expr_p, 0);
433 /* What about code that pulls out the temp and uses it elsewhere? I
434 think that such code never uses the TARGET_EXPR as an initializer. If
435 I'm wrong, we'll abort because the temp won't have any RTL. In that
436 case, I guess we'll need to replace references somehow. */
437 if (TREE_CODE (from) == TARGET_EXPR)
438 from = TARGET_EXPR_INITIAL (from);
440 /* Look through any COMPOUND_EXPRs, since build_compound_expr pushes them
441 inside the TARGET_EXPR. */
444 tree sub = TREE_CODE (t) == COMPOUND_EXPR ? TREE_OPERAND (t, 0) : t;
446 /* If we are initializing from an AGGR_INIT_EXPR, drop the INIT_EXPR and
447 replace the slot operand with our target.
449 Should we add a target parm to gimplify_expr instead? No, as in this
450 case we want to replace the INIT_EXPR. */
451 if (TREE_CODE (sub) == AGGR_INIT_EXPR
452 || TREE_CODE (sub) == VEC_INIT_EXPR)
454 gimplify_expr (&to, pre_p, post_p, is_gimple_lvalue, fb_lvalue);
455 if (TREE_CODE (sub) == AGGR_INIT_EXPR)
456 AGGR_INIT_EXPR_SLOT (sub) = to;
458 VEC_INIT_EXPR_SLOT (sub) = to;
461 /* The initialization is now a side-effect, so the container can
464 TREE_TYPE (from) = void_type_node;
470 t = TREE_OPERAND (t, 1);
475 /* Gimplify a MUST_NOT_THROW_EXPR. */
477 static enum gimplify_status
478 gimplify_must_not_throw_expr (tree *expr_p, gimple_seq *pre_p)
481 tree temp = voidify_wrapper_expr (stmt, NULL);
482 tree body = TREE_OPERAND (stmt, 0);
484 stmt = build_gimple_eh_filter_tree (body, NULL_TREE,
485 build_call_n (terminate_node, 0));
487 gimplify_and_add (stmt, pre_p);
498 /* Do C++-specific gimplification. Args are as for gimplify_expr. */
501 cp_gimplify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
503 int saved_stmts_are_full_exprs_p = 0;
504 enum tree_code code = TREE_CODE (*expr_p);
505 enum gimplify_status ret;
507 if (STATEMENT_CODE_P (code))
509 saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p ();
510 current_stmt_tree ()->stmts_are_full_exprs_p
511 = STMT_IS_FULL_EXPR_P (*expr_p);
517 *expr_p = cplus_expand_constant (*expr_p);
522 simplify_aggr_init_expr (expr_p);
528 location_t loc = input_location;
529 gcc_assert (EXPR_HAS_LOCATION (*expr_p));
530 input_location = EXPR_LOCATION (*expr_p);
531 *expr_p = build_vec_init (VEC_INIT_EXPR_SLOT (*expr_p), NULL_TREE,
532 VEC_INIT_EXPR_INIT (*expr_p), false, 1,
533 tf_warning_or_error);
535 input_location = loc;
540 /* FIXME communicate throw type to back end, probably by moving
541 THROW_EXPR into ../tree.def. */
542 *expr_p = TREE_OPERAND (*expr_p, 0);
546 case MUST_NOT_THROW_EXPR:
547 ret = gimplify_must_not_throw_expr (expr_p, pre_p);
550 /* We used to do this for MODIFY_EXPR as well, but that's unsafe; the
551 LHS of an assignment might also be involved in the RHS, as in bug
554 cp_gimplify_init_expr (expr_p, pre_p, post_p);
555 if (TREE_CODE (*expr_p) != INIT_EXPR)
557 /* Otherwise fall through. */
560 /* If the back end isn't clever enough to know that the lhs and rhs
561 types are the same, add an explicit conversion. */
562 tree op0 = TREE_OPERAND (*expr_p, 0);
563 tree op1 = TREE_OPERAND (*expr_p, 1);
565 if (!error_operand_p (op0)
566 && !error_operand_p (op1)
567 && (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (op0))
568 || TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (op1)))
569 && !useless_type_conversion_p (TREE_TYPE (op1), TREE_TYPE (op0)))
570 TREE_OPERAND (*expr_p, 1) = build1 (VIEW_CONVERT_EXPR,
571 TREE_TYPE (op0), op1);
573 else if ((rhs_predicate_for (op0)) (op1)
574 && !(TREE_CODE (op1) == CALL_EXPR
575 && CALL_EXPR_RETURN_SLOT_OPT (op1))
576 && is_really_empty_class (TREE_TYPE (op0)))
578 /* Remove any copies of empty classes. We check that the RHS
579 has a simple form so that TARGET_EXPRs and CONSTRUCTORs get
580 reduced properly, and we leave the return slot optimization
581 alone because it isn't a copy.
583 Also drop volatile variables on the RHS to avoid infinite
584 recursion from gimplify_expr trying to load the value. */
585 if (!TREE_SIDE_EFFECTS (op1)
586 || (DECL_P (op1) && TREE_THIS_VOLATILE (op1)))
589 *expr_p = build2 (COMPOUND_EXPR, TREE_TYPE (*expr_p),
596 case EMPTY_CLASS_EXPR:
597 /* We create an empty CONSTRUCTOR with RECORD_TYPE. */
598 *expr_p = build_constructor (TREE_TYPE (*expr_p), NULL);
603 *expr_p = BASELINK_FUNCTIONS (*expr_p);
608 genericize_try_block (expr_p);
613 genericize_catch_block (expr_p);
618 genericize_eh_spec_block (expr_p);
626 gimplify_for_stmt (expr_p, pre_p);
631 gimplify_while_stmt (expr_p, pre_p);
636 gimplify_do_stmt (expr_p, pre_p);
641 gimplify_switch_stmt (expr_p, pre_p);
646 ret = cp_gimplify_omp_for (expr_p, pre_p);
650 gimple_seq_add_stmt (pre_p, gimple_build_predict (PRED_CONTINUE, NOT_TAKEN));
651 gimple_seq_add_stmt (pre_p, gimple_build_goto (get_bc_label (bc_continue)));
657 gimple_seq_add_stmt (pre_p, gimple_build_goto (get_bc_label (bc_break)));
663 gimplify_expr_stmt (expr_p);
667 case UNARY_PLUS_EXPR:
669 tree arg = TREE_OPERAND (*expr_p, 0);
670 tree type = TREE_TYPE (*expr_p);
671 *expr_p = (TREE_TYPE (arg) != type) ? fold_convert (type, arg)
678 ret = (enum gimplify_status) c_gimplify_expr (expr_p, pre_p, post_p);
682 /* Restore saved state. */
683 if (STATEMENT_CODE_P (code))
684 current_stmt_tree ()->stmts_are_full_exprs_p
685 = saved_stmts_are_full_exprs_p;
691 is_invisiref_parm (const_tree t)
693 return ((TREE_CODE (t) == PARM_DECL || TREE_CODE (t) == RESULT_DECL)
694 && DECL_BY_REFERENCE (t));
697 /* Return true if the uid in both int tree maps are equal. */
700 cxx_int_tree_map_eq (const void *va, const void *vb)
702 const struct cxx_int_tree_map *a = (const struct cxx_int_tree_map *) va;
703 const struct cxx_int_tree_map *b = (const struct cxx_int_tree_map *) vb;
704 return (a->uid == b->uid);
707 /* Hash a UID in a cxx_int_tree_map. */
710 cxx_int_tree_map_hash (const void *item)
712 return ((const struct cxx_int_tree_map *)item)->uid;
715 struct cp_genericize_data
717 struct pointer_set_t *p_set;
718 VEC (tree, heap) *bind_expr_stack;
721 /* Perform any pre-gimplification lowering of C++ front end trees to
725 cp_genericize_r (tree *stmt_p, int *walk_subtrees, void *data)
728 struct cp_genericize_data *wtd = (struct cp_genericize_data *) data;
729 struct pointer_set_t *p_set = wtd->p_set;
731 if (is_invisiref_parm (stmt)
732 /* Don't dereference parms in a thunk, pass the references through. */
733 && !(DECL_THUNK_P (current_function_decl)
734 && TREE_CODE (stmt) == PARM_DECL))
736 *stmt_p = convert_from_reference (stmt);
741 /* Map block scope extern declarations to visible declarations with the
742 same name and type in outer scopes if any. */
743 if (cp_function_chain->extern_decl_map
744 && (TREE_CODE (stmt) == FUNCTION_DECL || TREE_CODE (stmt) == VAR_DECL)
745 && DECL_EXTERNAL (stmt))
747 struct cxx_int_tree_map *h, in;
748 in.uid = DECL_UID (stmt);
749 h = (struct cxx_int_tree_map *)
750 htab_find_with_hash (cp_function_chain->extern_decl_map,
760 /* Other than invisiref parms, don't walk the same tree twice. */
761 if (pointer_set_contains (p_set, stmt))
767 if (TREE_CODE (stmt) == ADDR_EXPR
768 && is_invisiref_parm (TREE_OPERAND (stmt, 0)))
770 *stmt_p = convert (TREE_TYPE (stmt), TREE_OPERAND (stmt, 0));
773 else if (TREE_CODE (stmt) == RETURN_EXPR
774 && TREE_OPERAND (stmt, 0)
775 && is_invisiref_parm (TREE_OPERAND (stmt, 0)))
776 /* Don't dereference an invisiref RESULT_DECL inside a RETURN_EXPR. */
778 else if (TREE_CODE (stmt) == OMP_CLAUSE)
779 switch (OMP_CLAUSE_CODE (stmt))
781 case OMP_CLAUSE_LASTPRIVATE:
782 /* Don't dereference an invisiref in OpenMP clauses. */
783 if (is_invisiref_parm (OMP_CLAUSE_DECL (stmt)))
786 if (OMP_CLAUSE_LASTPRIVATE_STMT (stmt))
787 cp_walk_tree (&OMP_CLAUSE_LASTPRIVATE_STMT (stmt),
788 cp_genericize_r, data, NULL);
791 case OMP_CLAUSE_PRIVATE:
792 case OMP_CLAUSE_SHARED:
793 case OMP_CLAUSE_FIRSTPRIVATE:
794 case OMP_CLAUSE_COPYIN:
795 case OMP_CLAUSE_COPYPRIVATE:
796 /* Don't dereference an invisiref in OpenMP clauses. */
797 if (is_invisiref_parm (OMP_CLAUSE_DECL (stmt)))
800 case OMP_CLAUSE_REDUCTION:
801 gcc_assert (!is_invisiref_parm (OMP_CLAUSE_DECL (stmt)));
806 else if (IS_TYPE_OR_DECL_P (stmt))
809 /* Due to the way voidify_wrapper_expr is written, we don't get a chance
810 to lower this construct before scanning it, so we need to lower these
811 before doing anything else. */
812 else if (TREE_CODE (stmt) == CLEANUP_STMT)
813 *stmt_p = build2 (CLEANUP_EH_ONLY (stmt) ? TRY_CATCH_EXPR
817 CLEANUP_EXPR (stmt));
819 else if (TREE_CODE (stmt) == IF_STMT)
821 genericize_if_stmt (stmt_p);
822 /* *stmt_p has changed, tail recurse to handle it again. */
823 return cp_genericize_r (stmt_p, walk_subtrees, data);
826 /* COND_EXPR might have incompatible types in branches if one or both
827 arms are bitfields. Fix it up now. */
828 else if (TREE_CODE (stmt) == COND_EXPR)
831 = (TREE_OPERAND (stmt, 1)
832 ? is_bitfield_expr_with_lowered_type (TREE_OPERAND (stmt, 1))
835 = (TREE_OPERAND (stmt, 2)
836 ? is_bitfield_expr_with_lowered_type (TREE_OPERAND (stmt, 2))
839 && !useless_type_conversion_p (TREE_TYPE (stmt),
840 TREE_TYPE (TREE_OPERAND (stmt, 1))))
842 TREE_OPERAND (stmt, 1)
843 = fold_convert (type_left, TREE_OPERAND (stmt, 1));
844 gcc_assert (useless_type_conversion_p (TREE_TYPE (stmt),
848 && !useless_type_conversion_p (TREE_TYPE (stmt),
849 TREE_TYPE (TREE_OPERAND (stmt, 2))))
851 TREE_OPERAND (stmt, 2)
852 = fold_convert (type_right, TREE_OPERAND (stmt, 2));
853 gcc_assert (useless_type_conversion_p (TREE_TYPE (stmt),
858 else if (TREE_CODE (stmt) == BIND_EXPR)
860 VEC_safe_push (tree, heap, wtd->bind_expr_stack, stmt);
861 cp_walk_tree (&BIND_EXPR_BODY (stmt),
862 cp_genericize_r, data, NULL);
863 VEC_pop (tree, wtd->bind_expr_stack);
866 else if (TREE_CODE (stmt) == USING_STMT)
868 tree block = NULL_TREE;
870 /* Get the innermost inclosing GIMPLE_BIND that has a non NULL
871 BLOCK, and append an IMPORTED_DECL to its
872 BLOCK_VARS chained list. */
873 if (wtd->bind_expr_stack)
876 for (i = VEC_length (tree, wtd->bind_expr_stack) - 1; i >= 0; i--)
877 if ((block = BIND_EXPR_BLOCK (VEC_index (tree,
878 wtd->bind_expr_stack, i))))
883 tree using_directive;
884 gcc_assert (TREE_OPERAND (stmt, 0));
886 using_directive = make_node (IMPORTED_DECL);
887 TREE_TYPE (using_directive) = void_type_node;
889 IMPORTED_DECL_ASSOCIATED_DECL (using_directive)
890 = TREE_OPERAND (stmt, 0);
891 TREE_CHAIN (using_directive) = BLOCK_VARS (block);
892 BLOCK_VARS (block) = using_directive;
894 /* The USING_STMT won't appear in GENERIC. */
895 *stmt_p = build1 (NOP_EXPR, void_type_node, integer_zero_node);
899 else if (TREE_CODE (stmt) == DECL_EXPR
900 && TREE_CODE (DECL_EXPR_DECL (stmt)) == USING_DECL)
902 /* Using decls inside DECL_EXPRs are just dropped on the floor. */
903 *stmt_p = build1 (NOP_EXPR, void_type_node, integer_zero_node);
907 pointer_set_insert (p_set, *stmt_p);
913 cp_genericize (tree fndecl)
916 struct cp_genericize_data wtd;
918 /* Fix up the types of parms passed by invisible reference. */
919 for (t = DECL_ARGUMENTS (fndecl); t; t = TREE_CHAIN (t))
920 if (TREE_ADDRESSABLE (TREE_TYPE (t)))
922 /* If a function's arguments are copied to create a thunk,
923 then DECL_BY_REFERENCE will be set -- but the type of the
924 argument will be a pointer type, so we will never get
926 gcc_assert (!DECL_BY_REFERENCE (t));
927 gcc_assert (DECL_ARG_TYPE (t) != TREE_TYPE (t));
928 TREE_TYPE (t) = DECL_ARG_TYPE (t);
929 DECL_BY_REFERENCE (t) = 1;
930 TREE_ADDRESSABLE (t) = 0;
934 /* Do the same for the return value. */
935 if (TREE_ADDRESSABLE (TREE_TYPE (DECL_RESULT (fndecl))))
937 t = DECL_RESULT (fndecl);
938 TREE_TYPE (t) = build_reference_type (TREE_TYPE (t));
939 DECL_BY_REFERENCE (t) = 1;
940 TREE_ADDRESSABLE (t) = 0;
944 /* If we're a clone, the body is already GIMPLE. */
945 if (DECL_CLONED_FUNCTION_P (fndecl))
948 /* We do want to see every occurrence of the parms, so we can't just use
949 walk_tree's hash functionality. */
950 wtd.p_set = pointer_set_create ();
951 wtd.bind_expr_stack = NULL;
952 cp_walk_tree (&DECL_SAVED_TREE (fndecl), cp_genericize_r, &wtd, NULL);
953 pointer_set_destroy (wtd.p_set);
954 VEC_free (tree, heap, wtd.bind_expr_stack);
956 /* Do everything else. */
957 c_genericize (fndecl);
959 gcc_assert (bc_label[bc_break] == NULL);
960 gcc_assert (bc_label[bc_continue] == NULL);
963 /* Build code to apply FN to each member of ARG1 and ARG2. FN may be
964 NULL if there is in fact nothing to do. ARG2 may be null if FN
965 actually only takes one argument. */
968 cxx_omp_clause_apply_fn (tree fn, tree arg1, tree arg2)
970 tree defparm, parm, t;
978 nargs = list_length (DECL_ARGUMENTS (fn));
979 argarray = (tree *) alloca (nargs * sizeof (tree));
981 defparm = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn)));
983 defparm = TREE_CHAIN (defparm);
985 if (TREE_CODE (TREE_TYPE (arg1)) == ARRAY_TYPE)
987 tree inner_type = TREE_TYPE (arg1);
988 tree start1, end1, p1;
989 tree start2 = NULL, p2 = NULL;
990 tree ret = NULL, lab;
996 inner_type = TREE_TYPE (inner_type);
997 start1 = build4 (ARRAY_REF, inner_type, start1,
998 size_zero_node, NULL, NULL);
1000 start2 = build4 (ARRAY_REF, inner_type, start2,
1001 size_zero_node, NULL, NULL);
1003 while (TREE_CODE (inner_type) == ARRAY_TYPE);
1004 start1 = build_fold_addr_expr_loc (input_location, start1);
1006 start2 = build_fold_addr_expr_loc (input_location, start2);
1008 end1 = TYPE_SIZE_UNIT (TREE_TYPE (arg1));
1009 end1 = build2 (POINTER_PLUS_EXPR, TREE_TYPE (start1), start1, end1);
1011 p1 = create_tmp_var (TREE_TYPE (start1), NULL);
1012 t = build2 (MODIFY_EXPR, TREE_TYPE (p1), p1, start1);
1013 append_to_statement_list (t, &ret);
1017 p2 = create_tmp_var (TREE_TYPE (start2), NULL);
1018 t = build2 (MODIFY_EXPR, TREE_TYPE (p2), p2, start2);
1019 append_to_statement_list (t, &ret);
1022 lab = create_artificial_label (input_location);
1023 t = build1 (LABEL_EXPR, void_type_node, lab);
1024 append_to_statement_list (t, &ret);
1029 /* Handle default arguments. */
1030 for (parm = defparm; parm && parm != void_list_node;
1031 parm = TREE_CHAIN (parm), i++)
1032 argarray[i] = convert_default_arg (TREE_VALUE (parm),
1033 TREE_PURPOSE (parm), fn, i);
1034 t = build_call_a (fn, i, argarray);
1035 t = fold_convert (void_type_node, t);
1036 t = fold_build_cleanup_point_expr (TREE_TYPE (t), t);
1037 append_to_statement_list (t, &ret);
1039 t = TYPE_SIZE_UNIT (inner_type);
1040 t = build2 (POINTER_PLUS_EXPR, TREE_TYPE (p1), p1, t);
1041 t = build2 (MODIFY_EXPR, TREE_TYPE (p1), p1, t);
1042 append_to_statement_list (t, &ret);
1046 t = TYPE_SIZE_UNIT (inner_type);
1047 t = build2 (POINTER_PLUS_EXPR, TREE_TYPE (p2), p2, t);
1048 t = build2 (MODIFY_EXPR, TREE_TYPE (p2), p2, t);
1049 append_to_statement_list (t, &ret);
1052 t = build2 (NE_EXPR, boolean_type_node, p1, end1);
1053 t = build3 (COND_EXPR, void_type_node, t, build_and_jump (&lab), NULL);
1054 append_to_statement_list (t, &ret);
1060 argarray[i++] = build_fold_addr_expr_loc (input_location, arg1);
1062 argarray[i++] = build_fold_addr_expr_loc (input_location, arg2);
1063 /* Handle default arguments. */
1064 for (parm = defparm; parm && parm != void_list_node;
1065 parm = TREE_CHAIN (parm), i++)
1066 argarray[i] = convert_default_arg (TREE_VALUE (parm),
1067 TREE_PURPOSE (parm),
1069 t = build_call_a (fn, i, argarray);
1070 t = fold_convert (void_type_node, t);
1071 return fold_build_cleanup_point_expr (TREE_TYPE (t), t);
1075 /* Return code to initialize DECL with its default constructor, or
1076 NULL if there's nothing to do. */
1079 cxx_omp_clause_default_ctor (tree clause, tree decl,
1080 tree outer ATTRIBUTE_UNUSED)
1082 tree info = CP_OMP_CLAUSE_INFO (clause);
1086 ret = cxx_omp_clause_apply_fn (TREE_VEC_ELT (info, 0), decl, NULL);
1091 /* Return code to initialize DST with a copy constructor from SRC. */
1094 cxx_omp_clause_copy_ctor (tree clause, tree dst, tree src)
1096 tree info = CP_OMP_CLAUSE_INFO (clause);
1100 ret = cxx_omp_clause_apply_fn (TREE_VEC_ELT (info, 0), dst, src);
1102 ret = build2 (MODIFY_EXPR, TREE_TYPE (dst), dst, src);
1107 /* Similarly, except use an assignment operator instead. */
1110 cxx_omp_clause_assign_op (tree clause, tree dst, tree src)
1112 tree info = CP_OMP_CLAUSE_INFO (clause);
1116 ret = cxx_omp_clause_apply_fn (TREE_VEC_ELT (info, 2), dst, src);
1118 ret = build2 (MODIFY_EXPR, TREE_TYPE (dst), dst, src);
1123 /* Return code to destroy DECL. */
1126 cxx_omp_clause_dtor (tree clause, tree decl)
1128 tree info = CP_OMP_CLAUSE_INFO (clause);
1132 ret = cxx_omp_clause_apply_fn (TREE_VEC_ELT (info, 1), decl, NULL);
1137 /* True if OpenMP should privatize what this DECL points to rather
1138 than the DECL itself. */
1141 cxx_omp_privatize_by_reference (const_tree decl)
1143 return is_invisiref_parm (decl);
1146 /* True if OpenMP sharing attribute of DECL is predetermined. */
1148 enum omp_clause_default_kind
1149 cxx_omp_predetermined_sharing (tree decl)
1153 /* Static data members are predetermined as shared. */
1154 if (TREE_STATIC (decl))
1156 tree ctx = CP_DECL_CONTEXT (decl);
1157 if (TYPE_P (ctx) && MAYBE_CLASS_TYPE_P (ctx))
1158 return OMP_CLAUSE_DEFAULT_SHARED;
1161 type = TREE_TYPE (decl);
1162 if (TREE_CODE (type) == REFERENCE_TYPE)
1164 if (!is_invisiref_parm (decl))
1165 return OMP_CLAUSE_DEFAULT_UNSPECIFIED;
1166 type = TREE_TYPE (type);
1168 if (TREE_CODE (decl) == RESULT_DECL && DECL_NAME (decl))
1170 /* NVR doesn't preserve const qualification of the
1172 tree outer = outer_curly_brace_block (current_function_decl);
1176 for (var = BLOCK_VARS (outer); var; var = TREE_CHAIN (var))
1177 if (DECL_NAME (decl) == DECL_NAME (var)
1178 && (TYPE_MAIN_VARIANT (type)
1179 == TYPE_MAIN_VARIANT (TREE_TYPE (var))))
1181 if (TYPE_READONLY (TREE_TYPE (var)))
1182 type = TREE_TYPE (var);
1188 if (type == error_mark_node)
1189 return OMP_CLAUSE_DEFAULT_UNSPECIFIED;
1191 /* Variables with const-qualified type having no mutable member
1192 are predetermined shared. */
1193 if (TYPE_READONLY (type) && !cp_has_mutable_p (type))
1194 return OMP_CLAUSE_DEFAULT_SHARED;
1196 return OMP_CLAUSE_DEFAULT_UNSPECIFIED;
1199 /* Finalize an implicitly determined clause. */
1202 cxx_omp_finish_clause (tree c)
1204 tree decl, inner_type;
1205 bool make_shared = false;
1207 if (OMP_CLAUSE_CODE (c) != OMP_CLAUSE_FIRSTPRIVATE)
1210 decl = OMP_CLAUSE_DECL (c);
1211 decl = require_complete_type (decl);
1212 inner_type = TREE_TYPE (decl);
1213 if (decl == error_mark_node)
1215 else if (TREE_CODE (TREE_TYPE (decl)) == REFERENCE_TYPE)
1217 if (is_invisiref_parm (decl))
1218 inner_type = TREE_TYPE (inner_type);
1221 error ("%qE implicitly determined as %<firstprivate%> has reference type",
1227 /* We're interested in the base element, not arrays. */
1228 while (TREE_CODE (inner_type) == ARRAY_TYPE)
1229 inner_type = TREE_TYPE (inner_type);
1231 /* Check for special function availability by building a call to one.
1232 Save the results, because later we won't be in the right context
1233 for making these queries. */
1235 && CLASS_TYPE_P (inner_type)
1236 && cxx_omp_create_clause_info (c, inner_type, false, true, false))
1240 OMP_CLAUSE_CODE (c) = OMP_CLAUSE_SHARED;