rtl: ICE with thread_local and inline asm [PR104777]
[official-gcc.git] / gcc / d / d-gimplify.cc
bloba98089b7ccac604fcaae6cea7ff7e7a1f0da354e
1 /* D-specific tree lowering bits; see also gimple.cc.
2 Copyright (C) 2020-2022 Free Software Foundation, Inc.
4 GCC is free software; you can redistribute it and/or modify
5 it under the terms of the GNU General Public License as published by
6 the Free Software Foundation; either version 3, or (at your option)
7 any later version.
9 GCC is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 GNU General Public License for more details.
14 You should have received a copy of the GNU General Public License
15 along with GCC; see the file COPYING3. If not see
16 <http://www.gnu.org/licenses/>. */
18 #include "config.h"
19 #include "system.h"
20 #include "coretypes.h"
22 #include "dmd/globals.h"
24 #include "tree.h"
25 #include "gimple-expr.h"
26 #include "gimplify.h"
28 #include "d-tree.h"
31 /* Return TRUE if an operand OP of a given TYPE being copied has no data.
32 The middle-end does a similar check with zero sized types. */
34 static bool
35 empty_modify_p (tree type, tree op)
37 tree_code code = TREE_CODE (op);
38 switch (code)
40 case COMPOUND_EXPR:
41 return empty_modify_p (type, TREE_OPERAND (op, 1));
43 case CONSTRUCTOR:
44 /* Non-empty construcors are valid. */
45 if (CONSTRUCTOR_NELTS (op) != 0 || TREE_CLOBBER_P (op))
46 return false;
47 break;
49 case CALL_EXPR:
50 /* Leave nrvo alone because it isn't a copy. */
51 if (CALL_EXPR_RETURN_SLOT_OPT (op))
52 return false;
53 break;
55 default:
56 /* If the operand doesn't have a simple form. */
57 if (!is_gimple_lvalue (op) && !INDIRECT_REF_P (op))
58 return false;
59 break;
62 return empty_aggregate_p (type);
65 /* Return TRUE if EXPR is a COMPONENT_REF to a bit-field declaration. */
67 static bool
68 bit_field_ref (const_tree expr)
70 if (TREE_CODE (expr) == COMPONENT_REF
71 && DECL_BIT_FIELD (TREE_OPERAND (expr, 1)))
72 return true;
74 return false;
77 /* Gimplify assignment from an INIT_EXPR or MODIFY_EXPR. */
79 static gimplify_status
80 d_gimplify_modify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
82 tree op0 = TREE_OPERAND (*expr_p, 0);
83 tree op1 = TREE_OPERAND (*expr_p, 1);
85 if (error_operand_p (op0) || error_operand_p (op1))
86 return GS_UNHANDLED;
88 /* Remove any copies of empty aggregates. */
89 if (empty_modify_p (TREE_TYPE (op0), op1))
91 gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p,
92 is_gimple_lvalue, fb_lvalue);
94 if (TREE_SIDE_EFFECTS (op1))
95 gimplify_and_add (op1, pre_p);
97 *expr_p = TREE_OPERAND (*expr_p, 0);
98 return GS_OK;
101 /* If the back end isn't clever enough to know that the lhs and rhs
102 types are the same, add an explicit conversion. */
103 if ((AGGREGATE_TYPE_P (TREE_TYPE (op0)) || AGGREGATE_TYPE_P (TREE_TYPE (op1)))
104 && !useless_type_conversion_p (TREE_TYPE (op1), TREE_TYPE (op0)))
106 TREE_OPERAND (*expr_p, 1) = build1 (VIEW_CONVERT_EXPR,
107 TREE_TYPE (op0), op1);
108 return GS_OK;
111 /* Same as above, but for bit-field assignments. */
112 if (bit_field_ref (op0) && TREE_TYPE (op0) != TREE_TYPE (op1))
114 TREE_OPERAND (*expr_p, 1) = convert (TREE_TYPE (op0), op1);
115 return GS_OK;
118 return GS_UNHANDLED;
121 /* Gimplify an ADDR_EXPR node. */
123 static gimplify_status
124 d_gimplify_addr_expr (tree *expr_p)
126 tree op0 = TREE_OPERAND (*expr_p, 0);
127 /* Constructors are not lvalues, so make them one. */
128 if (TREE_CODE (op0) == CONSTRUCTOR)
130 TREE_OPERAND (*expr_p, 0) = force_target_expr (op0);
131 return GS_OK;
134 return GS_UNHANDLED;
137 /* Gimplify a CALL_EXPR node. */
139 static gimplify_status
140 d_gimplify_call_expr (tree *expr_p, gimple_seq *pre_p)
142 /* Strictly evaluate all arguments from left to right. */
143 int nargs = call_expr_nargs (*expr_p);
144 location_t loc = EXPR_LOC_OR_LOC (*expr_p, input_location);
146 /* No need to enforce evaluation order if only one argument. */
147 if (nargs < 2)
148 return GS_UNHANDLED;
150 /* Or if all arguments are already free of side-effects. */
151 bool has_side_effects = false;
152 for (int i = 0; i < nargs; i++)
154 if (TREE_SIDE_EFFECTS (CALL_EXPR_ARG (*expr_p, i)))
156 has_side_effects = true;
157 break;
161 if (!has_side_effects)
162 return GS_UNHANDLED;
164 /* Leave the last argument for gimplify_call_expr. */
165 for (int i = 0; i < nargs - 1; i++)
167 tree new_arg = CALL_EXPR_ARG (*expr_p, i);
169 /* If argument has a side-effect, gimplify_arg will handle it. */
170 if (gimplify_arg (&new_arg, pre_p, loc) == GS_ERROR)
171 return GS_ERROR;
173 /* Even if an argument itself doesn't have any side-effects, it
174 might be altered by another argument in the list. */
175 if (new_arg == CALL_EXPR_ARG (*expr_p, i)
176 && !really_constant_p (new_arg))
177 new_arg = get_formal_tmp_var (new_arg, pre_p);
179 CALL_EXPR_ARG (*expr_p, i) = new_arg;
182 return GS_OK;
185 /* Gimplify an UNSIGNED_RSHIFT_EXPR node. */
187 static gimplify_status
188 d_gimplify_unsigned_rshift_expr (tree *expr_p)
190 /* Convert op0 to an unsigned type. */
191 tree op0 = TREE_OPERAND (*expr_p, 0);
192 tree op1 = TREE_OPERAND (*expr_p, 1);
193 tree type = d_unsigned_type (TREE_TYPE (op0));
195 *expr_p = convert (TREE_TYPE (*expr_p),
196 build2 (RSHIFT_EXPR, type, convert (type, op0), op1));
197 return GS_OK;
200 /* Gimplify an unary expression node. */
202 static gimplify_status
203 d_gimplify_unary_expr (tree *expr_p)
205 tree op0 = TREE_OPERAND (*expr_p, 0);
207 if (error_operand_p (op0))
208 return GS_UNHANDLED;
210 /* Front end doesn't know that bit-field types are really different
211 from basic types, add an explicit conversion in unary expressions. */
212 if (bit_field_ref (op0) && TREE_TYPE (op0) != TREE_TYPE (*expr_p))
214 TREE_OPERAND (*expr_p, 0) = convert (TREE_TYPE (*expr_p), op0);
215 return GS_OK;
218 return GS_UNHANDLED;
221 /* Gimplify a binary expression node. */
223 static gimplify_status
224 d_gimplify_binary_expr (tree *expr_p)
226 tree op0 = TREE_OPERAND (*expr_p, 0);
227 tree op1 = TREE_OPERAND (*expr_p, 1);
229 if (error_operand_p (op0) || error_operand_p (op1))
230 return GS_UNHANDLED;
232 /* Front end doesn't know that bit-field types are really different
233 from basic types, add an explicit conversion in binary expressions. */
234 if (bit_field_ref (op0) || bit_field_ref (op1))
236 if (TREE_TYPE (op0) != TREE_TYPE (*expr_p))
237 TREE_OPERAND (*expr_p, 0) = convert (TREE_TYPE (*expr_p), op0);
239 if (TREE_TYPE (op1) != TREE_TYPE (*expr_p))
240 TREE_OPERAND (*expr_p, 1) = convert (TREE_TYPE (*expr_p), op1);
242 return GS_OK;
245 return GS_UNHANDLED;
248 /* Implements the lang_hooks.gimplify_expr routine for language D.
249 Do gimplification of D specific expression trees in EXPR_P. */
252 d_gimplify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p)
254 switch (TREE_CODE (*expr_p))
256 case INIT_EXPR:
257 case MODIFY_EXPR:
258 return d_gimplify_modify_expr (expr_p, pre_p, post_p);
260 case ADDR_EXPR:
261 return d_gimplify_addr_expr (expr_p);
263 case CALL_EXPR:
264 return d_gimplify_call_expr (expr_p, pre_p);
266 case UNSIGNED_RSHIFT_EXPR:
267 return d_gimplify_unsigned_rshift_expr (expr_p);
269 case FLOAT_MOD_EXPR:
270 gcc_unreachable ();
272 default:
273 if (UNARY_CLASS_P (*expr_p) && !CONVERT_EXPR_P (*expr_p))
274 return d_gimplify_unary_expr (expr_p);
275 if (BINARY_CLASS_P (*expr_p))
276 return d_gimplify_binary_expr (expr_p);
277 break;
280 return GS_UNHANDLED;