]>
Commit | Line | Data |
---|---|---|
eadf906f | 1 | /* C++-specific tree lowering bits; see also c-gimplify.c and tree-gimple.c. |
6de9cd9a | 2 | |
818ab71a | 3 | Copyright (C) 2002-2016 Free Software Foundation, Inc. |
6de9cd9a DN |
4 | Contributed by Jason Merrill <jason@redhat.com> |
5 | ||
6 | This file is part of GCC. | |
7 | ||
8 | GCC is free software; you can redistribute it and/or modify it under | |
9 | the terms of the GNU General Public License as published by the Free | |
e77f031d | 10 | Software Foundation; either version 3, or (at your option) any later |
6de9cd9a DN |
11 | version. |
12 | ||
13 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
14 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
15 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
16 | for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
e77f031d NC |
19 | along with GCC; see the file COPYING3. If not see |
20 | <http://www.gnu.org/licenses/>. */ | |
6de9cd9a DN |
21 | |
22 | #include "config.h" | |
23 | #include "system.h" | |
24 | #include "coretypes.h" | |
2adfab87 | 25 | #include "target.h" |
c7131fb2 | 26 | #include "basic-block.h" |
6de9cd9a | 27 | #include "cp-tree.h" |
c7131fb2 | 28 | #include "gimple.h" |
2adfab87 | 29 | #include "predict.h" |
c7131fb2 | 30 | #include "stor-layout.h" |
726a989a | 31 | #include "tree-iterator.h" |
45b0be94 | 32 | #include "gimplify.h" |
0a508bb6 | 33 | #include "c-family/c-ubsan.h" |
12893402 | 34 | #include "cilk.h" |
6de9cd9a | 35 | |
b2cb7511 TV |
36 | /* Forward declarations. */ |
37 | ||
38 | static tree cp_genericize_r (tree *, int *, void *); | |
cda0a029 | 39 | static tree cp_fold_r (tree *, int *, void *); |
b2cb7511 | 40 | static void cp_genericize_tree (tree*); |
cda0a029 | 41 | static tree cp_fold (tree); |
b2cb7511 | 42 | |
fbc315db ILT |
43 | /* Local declarations. */ |
44 | ||
45 | enum bc_t { bc_break = 0, bc_continue = 1 }; | |
46 | ||
1799e5d5 RH |
47 | /* Stack of labels which are targets for "break" or "continue", |
48 | linked through TREE_CHAIN. */ | |
49 | static tree bc_label[2]; | |
fbc315db ILT |
50 | |
51 | /* Begin a scope which can be exited by a break or continue statement. BC | |
52 | indicates which. | |
53 | ||
b2cb7511 TV |
54 | Just creates a label with location LOCATION and pushes it into the current |
55 | context. */ | |
fbc315db ILT |
56 | |
57 | static tree | |
b2cb7511 | 58 | begin_bc_block (enum bc_t bc, location_t location) |
fbc315db | 59 | { |
b2cb7511 | 60 | tree label = create_artificial_label (location); |
910ad8de | 61 | DECL_CHAIN (label) = bc_label[bc]; |
1799e5d5 | 62 | bc_label[bc] = label; |
56632b27 JM |
63 | if (bc == bc_break) |
64 | LABEL_DECL_BREAK (label) = true; | |
65 | else | |
66 | LABEL_DECL_CONTINUE (label) = true; | |
fbc315db ILT |
67 | return label; |
68 | } | |
69 | ||
70 | /* Finish a scope which can be exited by a break or continue statement. | |
b2cb7511 | 71 | LABEL was returned from the most recent call to begin_bc_block. BLOCK is |
fbc315db ILT |
72 | an expression for the contents of the scope. |
73 | ||
74 | If we saw a break (or continue) in the scope, append a LABEL_EXPR to | |
b2cb7511 | 75 | BLOCK. Otherwise, just forget the label. */ |
fbc315db | 76 | |
b2cb7511 TV |
77 | static void |
78 | finish_bc_block (tree *block, enum bc_t bc, tree label) | |
fbc315db | 79 | { |
1799e5d5 | 80 | gcc_assert (label == bc_label[bc]); |
fbc315db ILT |
81 | |
82 | if (TREE_USED (label)) | |
b2cb7511 TV |
83 | append_to_statement_list (build1 (LABEL_EXPR, void_type_node, label), |
84 | block); | |
fbc315db | 85 | |
910ad8de NF |
86 | bc_label[bc] = DECL_CHAIN (label); |
87 | DECL_CHAIN (label) = NULL_TREE; | |
fbc315db ILT |
88 | } |
89 | ||
38942840 BI |
90 | /* This function is a wrapper for cilk_gimplify_call_params_in_spawned_fn. |
91 | *EXPR_P can be a CALL_EXPR, INIT_EXPR, MODIFY_EXPR, AGGR_INIT_EXPR or | |
92 | TARGET_EXPR. *PRE_P and *POST_P are gimple sequences from the caller | |
93 | of gimplify_cilk_spawn. */ | |
94 | ||
95 | static void | |
96 | cilk_cp_gimplify_call_params_in_spawned_fn (tree *expr_p, gimple_seq *pre_p, | |
97 | gimple_seq *post_p) | |
98 | { | |
99 | int ii = 0; | |
100 | ||
5d70666e | 101 | cilk_gimplify_call_params_in_spawned_fn (expr_p, pre_p); |
38942840 BI |
102 | if (TREE_CODE (*expr_p) == AGGR_INIT_EXPR) |
103 | for (ii = 0; ii < aggr_init_expr_nargs (*expr_p); ii++) | |
104 | gimplify_expr (&AGGR_INIT_EXPR_ARG (*expr_p, ii), pre_p, post_p, | |
105 | is_gimple_reg, fb_rvalue); | |
106 | } | |
107 | ||
108 | ||
726a989a RB |
109 | /* Get the LABEL_EXPR to represent a break or continue statement |
110 | in the current block scope. BC indicates which. */ | |
fbc315db ILT |
111 | |
112 | static tree | |
726a989a | 113 | get_bc_label (enum bc_t bc) |
fbc315db | 114 | { |
1799e5d5 | 115 | tree label = bc_label[bc]; |
fbc315db | 116 | |
fbc315db ILT |
117 | /* Mark the label used for finish_bc_block. */ |
118 | TREE_USED (label) = 1; | |
726a989a | 119 | return label; |
fbc315db ILT |
120 | } |
121 | ||
6de9cd9a DN |
122 | /* Genericize a TRY_BLOCK. */ |
123 | ||
124 | static void | |
125 | genericize_try_block (tree *stmt_p) | |
126 | { | |
127 | tree body = TRY_STMTS (*stmt_p); | |
128 | tree cleanup = TRY_HANDLERS (*stmt_p); | |
129 | ||
f293ce4b | 130 | *stmt_p = build2 (TRY_CATCH_EXPR, void_type_node, body, cleanup); |
6de9cd9a DN |
131 | } |
132 | ||
133 | /* Genericize a HANDLER by converting to a CATCH_EXPR. */ | |
134 | ||
135 | static void | |
136 | genericize_catch_block (tree *stmt_p) | |
137 | { | |
138 | tree type = HANDLER_TYPE (*stmt_p); | |
139 | tree body = HANDLER_BODY (*stmt_p); | |
140 | ||
6de9cd9a | 141 | /* FIXME should the caught type go in TREE_TYPE? */ |
f293ce4b | 142 | *stmt_p = build2 (CATCH_EXPR, void_type_node, type, body); |
6de9cd9a DN |
143 | } |
144 | ||
726a989a RB |
145 | /* A terser interface for building a representation of an exception |
146 | specification. */ | |
147 | ||
148 | static tree | |
149 | build_gimple_eh_filter_tree (tree body, tree allowed, tree failure) | |
150 | { | |
151 | tree t; | |
152 | ||
153 | /* FIXME should the allowed types go in TREE_TYPE? */ | |
154 | t = build2 (EH_FILTER_EXPR, void_type_node, allowed, NULL_TREE); | |
155 | append_to_statement_list (failure, &EH_FILTER_FAILURE (t)); | |
156 | ||
157 | t = build2 (TRY_CATCH_EXPR, void_type_node, NULL_TREE, t); | |
158 | append_to_statement_list (body, &TREE_OPERAND (t, 0)); | |
159 | ||
160 | return t; | |
161 | } | |
162 | ||
6de9cd9a DN |
163 | /* Genericize an EH_SPEC_BLOCK by converting it to a |
164 | TRY_CATCH_EXPR/EH_FILTER_EXPR pair. */ | |
165 | ||
166 | static void | |
167 | genericize_eh_spec_block (tree *stmt_p) | |
168 | { | |
169 | tree body = EH_SPEC_STMTS (*stmt_p); | |
170 | tree allowed = EH_SPEC_RAISES (*stmt_p); | |
94a0dd7b | 171 | tree failure = build_call_n (call_unexpected_node, 1, build_exc_ptr ()); |
6de9cd9a | 172 | |
726a989a | 173 | *stmt_p = build_gimple_eh_filter_tree (body, allowed, failure); |
d665b6e5 MLI |
174 | TREE_NO_WARNING (*stmt_p) = true; |
175 | TREE_NO_WARNING (TREE_OPERAND (*stmt_p, 1)) = true; | |
6de9cd9a DN |
176 | } |
177 | ||
5a508662 RH |
178 | /* Genericize an IF_STMT by turning it into a COND_EXPR. */ |
179 | ||
180 | static void | |
f74d9c8f | 181 | genericize_if_stmt (tree *stmt_p) |
5a508662 | 182 | { |
eeae0768 | 183 | tree stmt, cond, then_, else_; |
726a989a | 184 | location_t locus = EXPR_LOCATION (*stmt_p); |
5a508662 RH |
185 | |
186 | stmt = *stmt_p; | |
eeae0768 | 187 | cond = IF_COND (stmt); |
5a508662 RH |
188 | then_ = THEN_CLAUSE (stmt); |
189 | else_ = ELSE_CLAUSE (stmt); | |
190 | ||
191 | if (!then_) | |
c2255bc4 | 192 | then_ = build_empty_stmt (locus); |
5a508662 | 193 | if (!else_) |
c2255bc4 | 194 | else_ = build_empty_stmt (locus); |
5a508662 | 195 | |
eeae0768 RS |
196 | if (integer_nonzerop (cond) && !TREE_SIDE_EFFECTS (else_)) |
197 | stmt = then_; | |
198 | else if (integer_zerop (cond) && !TREE_SIDE_EFFECTS (then_)) | |
199 | stmt = else_; | |
200 | else | |
201 | stmt = build3 (COND_EXPR, void_type_node, cond, then_, else_); | |
5b5dce39 MP |
202 | if (!EXPR_HAS_LOCATION (stmt)) |
203 | protected_set_expr_location (stmt, locus); | |
5a508662 RH |
204 | *stmt_p = stmt; |
205 | } | |
206 | ||
fbc315db ILT |
207 | /* Build a generic representation of one of the C loop forms. COND is the |
208 | loop condition or NULL_TREE. BODY is the (possibly compound) statement | |
209 | controlled by the loop. INCR is the increment expression of a for-loop, | |
210 | or NULL_TREE. COND_IS_FIRST indicates whether the condition is | |
211 | evaluated before the loop body as in while and for loops, or after the | |
212 | loop body as in do-while loops. */ | |
213 | ||
b2cb7511 TV |
214 | static void |
215 | genericize_cp_loop (tree *stmt_p, location_t start_locus, tree cond, tree body, | |
216 | tree incr, bool cond_is_first, int *walk_subtrees, | |
217 | void *data) | |
fbc315db | 218 | { |
b2cb7511 | 219 | tree blab, clab; |
27d93d2c | 220 | tree exit = NULL; |
b2cb7511 TV |
221 | tree stmt_list = NULL; |
222 | ||
223 | blab = begin_bc_block (bc_break, start_locus); | |
224 | clab = begin_bc_block (bc_continue, start_locus); | |
fbc315db | 225 | |
5b5dce39 | 226 | protected_set_expr_location (incr, start_locus); |
fbc315db | 227 | |
b2cb7511 TV |
228 | cp_walk_tree (&cond, cp_genericize_r, data, NULL); |
229 | cp_walk_tree (&body, cp_genericize_r, data, NULL); | |
230 | cp_walk_tree (&incr, cp_genericize_r, data, NULL); | |
231 | *walk_subtrees = 0; | |
fbc315db | 232 | |
27d93d2c | 233 | if (cond && TREE_CODE (cond) != INTEGER_CST) |
fbc315db | 234 | { |
27d93d2c JM |
235 | /* If COND is constant, don't bother building an exit. If it's false, |
236 | we won't build a loop. If it's true, any exits are in the body. */ | |
237 | location_t cloc = EXPR_LOC_OR_LOC (cond, start_locus); | |
238 | exit = build1_loc (cloc, GOTO_EXPR, void_type_node, | |
239 | get_bc_label (bc_break)); | |
240 | exit = fold_build3_loc (cloc, COND_EXPR, void_type_node, cond, | |
241 | build_empty_stmt (cloc), exit); | |
b2cb7511 | 242 | } |
fbc315db | 243 | |
27d93d2c JM |
244 | if (exit && cond_is_first) |
245 | append_to_statement_list (exit, &stmt_list); | |
b2cb7511 TV |
246 | append_to_statement_list (body, &stmt_list); |
247 | finish_bc_block (&stmt_list, bc_continue, clab); | |
248 | append_to_statement_list (incr, &stmt_list); | |
27d93d2c JM |
249 | if (exit && !cond_is_first) |
250 | append_to_statement_list (exit, &stmt_list); | |
fbc315db | 251 | |
27d93d2c JM |
252 | if (!stmt_list) |
253 | stmt_list = build_empty_stmt (start_locus); | |
254 | ||
255 | tree loop; | |
256 | if (cond && integer_zerop (cond)) | |
257 | { | |
258 | if (cond_is_first) | |
259 | loop = fold_build3_loc (start_locus, COND_EXPR, | |
260 | void_type_node, cond, stmt_list, | |
261 | build_empty_stmt (start_locus)); | |
262 | else | |
263 | loop = stmt_list; | |
264 | } | |
265 | else | |
9daf14d4 | 266 | { |
fe78aa04 AA |
267 | location_t loc = start_locus; |
268 | if (!cond || integer_nonzerop (cond)) | |
269 | loc = EXPR_LOCATION (expr_first (body)); | |
9daf14d4 AA |
270 | if (loc == UNKNOWN_LOCATION) |
271 | loc = start_locus; | |
272 | loop = build1_loc (loc, LOOP_EXPR, void_type_node, stmt_list); | |
273 | } | |
27d93d2c JM |
274 | |
275 | stmt_list = NULL; | |
276 | append_to_statement_list (loop, &stmt_list); | |
277 | finish_bc_block (&stmt_list, bc_break, blab); | |
278 | if (!stmt_list) | |
279 | stmt_list = build_empty_stmt (start_locus); | |
fbc315db | 280 | |
b2cb7511 | 281 | *stmt_p = stmt_list; |
fbc315db ILT |
282 | } |
283 | ||
b2cb7511 | 284 | /* Genericize a FOR_STMT node *STMT_P. */ |
fbc315db ILT |
285 | |
286 | static void | |
b2cb7511 | 287 | genericize_for_stmt (tree *stmt_p, int *walk_subtrees, void *data) |
fbc315db ILT |
288 | { |
289 | tree stmt = *stmt_p; | |
b2cb7511 TV |
290 | tree expr = NULL; |
291 | tree loop; | |
292 | tree init = FOR_INIT_STMT (stmt); | |
fbc315db | 293 | |
b2cb7511 TV |
294 | if (init) |
295 | { | |
296 | cp_walk_tree (&init, cp_genericize_r, data, NULL); | |
297 | append_to_statement_list (init, &expr); | |
298 | } | |
fbc315db | 299 | |
b2cb7511 TV |
300 | genericize_cp_loop (&loop, EXPR_LOCATION (stmt), FOR_COND (stmt), |
301 | FOR_BODY (stmt), FOR_EXPR (stmt), 1, walk_subtrees, data); | |
302 | append_to_statement_list (loop, &expr); | |
27d93d2c JM |
303 | if (expr == NULL_TREE) |
304 | expr = loop; | |
b2cb7511 | 305 | *stmt_p = expr; |
fbc315db ILT |
306 | } |
307 | ||
b2cb7511 | 308 | /* Genericize a WHILE_STMT node *STMT_P. */ |
fbc315db ILT |
309 | |
310 | static void | |
b2cb7511 | 311 | genericize_while_stmt (tree *stmt_p, int *walk_subtrees, void *data) |
fbc315db ILT |
312 | { |
313 | tree stmt = *stmt_p; | |
b2cb7511 TV |
314 | genericize_cp_loop (stmt_p, EXPR_LOCATION (stmt), WHILE_COND (stmt), |
315 | WHILE_BODY (stmt), NULL_TREE, 1, walk_subtrees, data); | |
fbc315db ILT |
316 | } |
317 | ||
b2cb7511 | 318 | /* Genericize a DO_STMT node *STMT_P. */ |
fbc315db ILT |
319 | |
320 | static void | |
b2cb7511 | 321 | genericize_do_stmt (tree *stmt_p, int *walk_subtrees, void *data) |
fbc315db ILT |
322 | { |
323 | tree stmt = *stmt_p; | |
b2cb7511 TV |
324 | genericize_cp_loop (stmt_p, EXPR_LOCATION (stmt), DO_COND (stmt), |
325 | DO_BODY (stmt), NULL_TREE, 0, walk_subtrees, data); | |
fbc315db ILT |
326 | } |
327 | ||
b2cb7511 | 328 | /* Genericize a SWITCH_STMT node *STMT_P by turning it into a SWITCH_EXPR. */ |
fbc315db ILT |
329 | |
330 | static void | |
b2cb7511 | 331 | genericize_switch_stmt (tree *stmt_p, int *walk_subtrees, void *data) |
fbc315db ILT |
332 | { |
333 | tree stmt = *stmt_p; | |
b2cb7511 TV |
334 | tree break_block, body, cond, type; |
335 | location_t stmt_locus = EXPR_LOCATION (stmt); | |
fbc315db | 336 | |
b2cb7511 | 337 | break_block = begin_bc_block (bc_break, stmt_locus); |
fbc315db ILT |
338 | |
339 | body = SWITCH_STMT_BODY (stmt); | |
340 | if (!body) | |
c2255bc4 | 341 | body = build_empty_stmt (stmt_locus); |
b2cb7511 TV |
342 | cond = SWITCH_STMT_COND (stmt); |
343 | type = SWITCH_STMT_TYPE (stmt); | |
fbc315db | 344 | |
b2cb7511 TV |
345 | cp_walk_tree (&body, cp_genericize_r, data, NULL); |
346 | cp_walk_tree (&cond, cp_genericize_r, data, NULL); | |
347 | cp_walk_tree (&type, cp_genericize_r, data, NULL); | |
348 | *walk_subtrees = 0; | |
fbc315db | 349 | |
b2cb7511 TV |
350 | *stmt_p = build3_loc (stmt_locus, SWITCH_EXPR, type, cond, body, NULL_TREE); |
351 | finish_bc_block (stmt_p, bc_break, break_block); | |
352 | } | |
353 | ||
354 | /* Genericize a CONTINUE_STMT node *STMT_P. */ | |
355 | ||
356 | static void | |
357 | genericize_continue_stmt (tree *stmt_p) | |
358 | { | |
359 | tree stmt_list = NULL; | |
360 | tree pred = build_predict_expr (PRED_CONTINUE, NOT_TAKEN); | |
361 | tree label = get_bc_label (bc_continue); | |
362 | location_t location = EXPR_LOCATION (*stmt_p); | |
363 | tree jump = build1_loc (location, GOTO_EXPR, void_type_node, label); | |
364 | append_to_statement_list (pred, &stmt_list); | |
365 | append_to_statement_list (jump, &stmt_list); | |
366 | *stmt_p = stmt_list; | |
fbc315db ILT |
367 | } |
368 | ||
b2cb7511 TV |
369 | /* Genericize a BREAK_STMT node *STMT_P. */ |
370 | ||
371 | static void | |
372 | genericize_break_stmt (tree *stmt_p) | |
373 | { | |
374 | tree label = get_bc_label (bc_break); | |
375 | location_t location = EXPR_LOCATION (*stmt_p); | |
376 | *stmt_p = build1_loc (location, GOTO_EXPR, void_type_node, label); | |
377 | } | |
378 | ||
379 | /* Genericize a OMP_FOR node *STMT_P. */ | |
380 | ||
381 | static void | |
382 | genericize_omp_for_stmt (tree *stmt_p, int *walk_subtrees, void *data) | |
383 | { | |
384 | tree stmt = *stmt_p; | |
385 | location_t locus = EXPR_LOCATION (stmt); | |
386 | tree clab = begin_bc_block (bc_continue, locus); | |
387 | ||
388 | cp_walk_tree (&OMP_FOR_BODY (stmt), cp_genericize_r, data, NULL); | |
389 | cp_walk_tree (&OMP_FOR_CLAUSES (stmt), cp_genericize_r, data, NULL); | |
390 | cp_walk_tree (&OMP_FOR_INIT (stmt), cp_genericize_r, data, NULL); | |
391 | cp_walk_tree (&OMP_FOR_COND (stmt), cp_genericize_r, data, NULL); | |
392 | cp_walk_tree (&OMP_FOR_INCR (stmt), cp_genericize_r, data, NULL); | |
393 | cp_walk_tree (&OMP_FOR_PRE_BODY (stmt), cp_genericize_r, data, NULL); | |
394 | *walk_subtrees = 0; | |
395 | ||
396 | finish_bc_block (&OMP_FOR_BODY (stmt), bc_continue, clab); | |
397 | } | |
398 | ||
399 | /* Hook into the middle of gimplifying an OMP_FOR node. */ | |
1799e5d5 RH |
400 | |
401 | static enum gimplify_status | |
726a989a | 402 | cp_gimplify_omp_for (tree *expr_p, gimple_seq *pre_p) |
1799e5d5 RH |
403 | { |
404 | tree for_stmt = *expr_p; | |
726a989a | 405 | gimple_seq seq = NULL; |
1799e5d5 RH |
406 | |
407 | /* Protect ourselves from recursion. */ | |
408 | if (OMP_FOR_GIMPLIFYING_P (for_stmt)) | |
409 | return GS_UNHANDLED; | |
410 | OMP_FOR_GIMPLIFYING_P (for_stmt) = 1; | |
411 | ||
726a989a | 412 | gimplify_and_add (for_stmt, &seq); |
726a989a | 413 | gimple_seq_add_seq (pre_p, seq); |
1799e5d5 | 414 | |
1799e5d5 RH |
415 | OMP_FOR_GIMPLIFYING_P (for_stmt) = 0; |
416 | ||
417 | return GS_ALL_DONE; | |
418 | } | |
419 | ||
934790cc ILT |
420 | /* Gimplify an EXPR_STMT node. */ |
421 | ||
422 | static void | |
423 | gimplify_expr_stmt (tree *stmt_p) | |
424 | { | |
425 | tree stmt = EXPR_STMT_EXPR (*stmt_p); | |
426 | ||
427 | if (stmt == error_mark_node) | |
428 | stmt = NULL; | |
429 | ||
430 | /* Gimplification of a statement expression will nullify the | |
431 | statement if all its side effects are moved to *PRE_P and *POST_P. | |
432 | ||
433 | In this case we will not want to emit the gimplified statement. | |
434 | However, we may still want to emit a warning, so we do that before | |
435 | gimplification. */ | |
27f33b15 | 436 | if (stmt && warn_unused_value) |
934790cc ILT |
437 | { |
438 | if (!TREE_SIDE_EFFECTS (stmt)) | |
439 | { | |
440 | if (!IS_EMPTY_STMT (stmt) | |
441 | && !VOID_TYPE_P (TREE_TYPE (stmt)) | |
442 | && !TREE_NO_WARNING (stmt)) | |
27f33b15 | 443 | warning (OPT_Wunused_value, "statement with no effect"); |
934790cc | 444 | } |
27f33b15 | 445 | else |
934790cc ILT |
446 | warn_if_unused_value (stmt, input_location); |
447 | } | |
448 | ||
449 | if (stmt == NULL_TREE) | |
450 | stmt = alloc_stmt_list (); | |
451 | ||
452 | *stmt_p = stmt; | |
453 | } | |
454 | ||
6de9cd9a DN |
455 | /* Gimplify initialization from an AGGR_INIT_EXPR. */ |
456 | ||
457 | static void | |
534ecb17 | 458 | cp_gimplify_init_expr (tree *expr_p) |
6de9cd9a DN |
459 | { |
460 | tree from = TREE_OPERAND (*expr_p, 1); | |
461 | tree to = TREE_OPERAND (*expr_p, 0); | |
0fcedd9c | 462 | tree t; |
6de9cd9a | 463 | |
6de9cd9a DN |
464 | /* What about code that pulls out the temp and uses it elsewhere? I |
465 | think that such code never uses the TARGET_EXPR as an initializer. If | |
466 | I'm wrong, we'll abort because the temp won't have any RTL. In that | |
467 | case, I guess we'll need to replace references somehow. */ | |
468 | if (TREE_CODE (from) == TARGET_EXPR) | |
db80e34e | 469 | from = TARGET_EXPR_INITIAL (from); |
6de9cd9a | 470 | |
c6c7698d JM |
471 | /* Look through any COMPOUND_EXPRs, since build_compound_expr pushes them |
472 | inside the TARGET_EXPR. */ | |
0fcedd9c JM |
473 | for (t = from; t; ) |
474 | { | |
475 | tree sub = TREE_CODE (t) == COMPOUND_EXPR ? TREE_OPERAND (t, 0) : t; | |
6de9cd9a | 476 | |
0fcedd9c JM |
477 | /* If we are initializing from an AGGR_INIT_EXPR, drop the INIT_EXPR and |
478 | replace the slot operand with our target. | |
6de9cd9a | 479 | |
0fcedd9c JM |
480 | Should we add a target parm to gimplify_expr instead? No, as in this |
481 | case we want to replace the INIT_EXPR. */ | |
d5f4eddd JM |
482 | if (TREE_CODE (sub) == AGGR_INIT_EXPR |
483 | || TREE_CODE (sub) == VEC_INIT_EXPR) | |
0fcedd9c | 484 | { |
d5f4eddd JM |
485 | if (TREE_CODE (sub) == AGGR_INIT_EXPR) |
486 | AGGR_INIT_EXPR_SLOT (sub) = to; | |
487 | else | |
488 | VEC_INIT_EXPR_SLOT (sub) = to; | |
0fcedd9c JM |
489 | *expr_p = from; |
490 | ||
491 | /* The initialization is now a side-effect, so the container can | |
492 | become void. */ | |
493 | if (from != sub) | |
494 | TREE_TYPE (from) = void_type_node; | |
495 | } | |
0fcedd9c | 496 | |
3e605b20 JM |
497 | if (cxx_dialect >= cxx14 && TREE_CODE (sub) == CONSTRUCTOR) |
498 | /* Handle aggregate NSDMI. */ | |
499 | replace_placeholders (sub, to); | |
500 | ||
0fcedd9c JM |
501 | if (t == sub) |
502 | break; | |
503 | else | |
504 | t = TREE_OPERAND (t, 1); | |
6de9cd9a | 505 | } |
0fcedd9c | 506 | |
6de9cd9a DN |
507 | } |
508 | ||
509 | /* Gimplify a MUST_NOT_THROW_EXPR. */ | |
510 | ||
726a989a RB |
511 | static enum gimplify_status |
512 | gimplify_must_not_throw_expr (tree *expr_p, gimple_seq *pre_p) | |
6de9cd9a DN |
513 | { |
514 | tree stmt = *expr_p; | |
325c3691 | 515 | tree temp = voidify_wrapper_expr (stmt, NULL); |
6de9cd9a | 516 | tree body = TREE_OPERAND (stmt, 0); |
786f715d JM |
517 | gimple_seq try_ = NULL; |
518 | gimple_seq catch_ = NULL; | |
355fe088 | 519 | gimple *mnt; |
6de9cd9a | 520 | |
786f715d JM |
521 | gimplify_and_add (body, &try_); |
522 | mnt = gimple_build_eh_must_not_throw (terminate_node); | |
a1a6c5b2 | 523 | gimple_seq_add_stmt_without_update (&catch_, mnt); |
786f715d | 524 | mnt = gimple_build_try (try_, catch_, GIMPLE_TRY_CATCH); |
6de9cd9a | 525 | |
a1a6c5b2 | 526 | gimple_seq_add_stmt_without_update (pre_p, mnt); |
6de9cd9a DN |
527 | if (temp) |
528 | { | |
6de9cd9a | 529 | *expr_p = temp; |
726a989a | 530 | return GS_OK; |
6de9cd9a | 531 | } |
726a989a RB |
532 | |
533 | *expr_p = NULL; | |
534 | return GS_ALL_DONE; | |
6de9cd9a | 535 | } |
7c34ced1 | 536 | |
25de0a29 AH |
537 | /* Return TRUE if an operand (OP) of a given TYPE being copied is |
538 | really just an empty class copy. | |
539 | ||
540 | Check that the operand has a simple form so that TARGET_EXPRs and | |
541 | non-empty CONSTRUCTORs get reduced properly, and we leave the | |
542 | return slot optimization alone because it isn't a copy. */ | |
543 | ||
544 | static bool | |
545 | simple_empty_class_p (tree type, tree op) | |
546 | { | |
547 | return | |
548 | ((TREE_CODE (op) == COMPOUND_EXPR | |
549 | && simple_empty_class_p (type, TREE_OPERAND (op, 1))) | |
550 | || is_gimple_lvalue (op) | |
551 | || INDIRECT_REF_P (op) | |
552 | || (TREE_CODE (op) == CONSTRUCTOR | |
553 | && CONSTRUCTOR_NELTS (op) == 0 | |
554 | && !TREE_CLOBBER_P (op)) | |
555 | || (TREE_CODE (op) == CALL_EXPR | |
556 | && !CALL_EXPR_RETURN_SLOT_OPT (op))) | |
557 | && is_really_empty_class (type); | |
558 | } | |
559 | ||
7c34ced1 RH |
560 | /* Do C++-specific gimplification. Args are as for gimplify_expr. */ |
561 | ||
562 | int | |
726a989a | 563 | cp_gimplify_expr (tree *expr_p, gimple_seq *pre_p, gimple_seq *post_p) |
7c34ced1 RH |
564 | { |
565 | int saved_stmts_are_full_exprs_p = 0; | |
566 | enum tree_code code = TREE_CODE (*expr_p); | |
567 | enum gimplify_status ret; | |
568 | ||
569 | if (STATEMENT_CODE_P (code)) | |
570 | { | |
571 | saved_stmts_are_full_exprs_p = stmts_are_full_exprs_p (); | |
572 | current_stmt_tree ()->stmts_are_full_exprs_p | |
573 | = STMT_IS_FULL_EXPR_P (*expr_p); | |
574 | } | |
575 | ||
576 | switch (code) | |
577 | { | |
578 | case PTRMEM_CST: | |
579 | *expr_p = cplus_expand_constant (*expr_p); | |
580 | ret = GS_OK; | |
581 | break; | |
582 | ||
583 | case AGGR_INIT_EXPR: | |
584 | simplify_aggr_init_expr (expr_p); | |
585 | ret = GS_OK; | |
586 | break; | |
587 | ||
d5f4eddd JM |
588 | case VEC_INIT_EXPR: |
589 | { | |
590 | location_t loc = input_location; | |
534ecb17 | 591 | tree init = VEC_INIT_EXPR_INIT (*expr_p); |
b73a4704 | 592 | int from_array = (init && TREE_CODE (TREE_TYPE (init)) == ARRAY_TYPE); |
d5f4eddd JM |
593 | gcc_assert (EXPR_HAS_LOCATION (*expr_p)); |
594 | input_location = EXPR_LOCATION (*expr_p); | |
b73a4704 | 595 | *expr_p = build_vec_init (VEC_INIT_EXPR_SLOT (*expr_p), NULL_TREE, |
4de2f020 | 596 | init, VEC_INIT_EXPR_VALUE_INIT (*expr_p), |
534ecb17 | 597 | from_array, |
d5f4eddd | 598 | tf_warning_or_error); |
b2cb7511 | 599 | cp_genericize_tree (expr_p); |
d5f4eddd JM |
600 | ret = GS_OK; |
601 | input_location = loc; | |
602 | } | |
603 | break; | |
604 | ||
7c34ced1 | 605 | case THROW_EXPR: |
3b426391 | 606 | /* FIXME communicate throw type to back end, probably by moving |
7c34ced1 RH |
607 | THROW_EXPR into ../tree.def. */ |
608 | *expr_p = TREE_OPERAND (*expr_p, 0); | |
609 | ret = GS_OK; | |
610 | break; | |
611 | ||
612 | case MUST_NOT_THROW_EXPR: | |
726a989a | 613 | ret = gimplify_must_not_throw_expr (expr_p, pre_p); |
7c34ced1 RH |
614 | break; |
615 | ||
726a989a | 616 | /* We used to do this for MODIFY_EXPR as well, but that's unsafe; the |
dae7ec87 JM |
617 | LHS of an assignment might also be involved in the RHS, as in bug |
618 | 25979. */ | |
7c34ced1 | 619 | case INIT_EXPR: |
65364cc5 | 620 | if (fn_contains_cilk_spawn_p (cfun)) |
38942840 | 621 | { |
65364cc5 JJ |
622 | if (cilk_detect_spawn_and_unwrap (expr_p)) |
623 | { | |
624 | cilk_cp_gimplify_call_params_in_spawned_fn (expr_p, | |
625 | pre_p, post_p); | |
626 | return (enum gimplify_status) gimplify_cilk_spawn (expr_p); | |
627 | } | |
628 | if (seen_error () && contains_cilk_spawn_stmt (*expr_p)) | |
629 | return GS_ERROR; | |
38942840 | 630 | } |
cc5c5226 | 631 | |
534ecb17 | 632 | cp_gimplify_init_expr (expr_p); |
85a52ea5 JM |
633 | if (TREE_CODE (*expr_p) != INIT_EXPR) |
634 | return GS_OK; | |
635 | /* Otherwise fall through. */ | |
1e2ddf80 | 636 | case MODIFY_EXPR: |
25de0a29 | 637 | modify_expr_case: |
1e2ddf80 | 638 | { |
12893402 BI |
639 | if (fn_contains_cilk_spawn_p (cfun) |
640 | && cilk_detect_spawn_and_unwrap (expr_p) | |
641 | && !seen_error ()) | |
38942840 BI |
642 | { |
643 | cilk_cp_gimplify_call_params_in_spawned_fn (expr_p, pre_p, post_p); | |
644 | return (enum gimplify_status) gimplify_cilk_spawn (expr_p); | |
645 | } | |
1e2ddf80 JM |
646 | /* If the back end isn't clever enough to know that the lhs and rhs |
647 | types are the same, add an explicit conversion. */ | |
648 | tree op0 = TREE_OPERAND (*expr_p, 0); | |
649 | tree op1 = TREE_OPERAND (*expr_p, 1); | |
650 | ||
0d08582e JM |
651 | if (!error_operand_p (op0) |
652 | && !error_operand_p (op1) | |
653 | && (TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (op0)) | |
654 | || TYPE_STRUCTURAL_EQUALITY_P (TREE_TYPE (op1))) | |
1e2ddf80 JM |
655 | && !useless_type_conversion_p (TREE_TYPE (op1), TREE_TYPE (op0))) |
656 | TREE_OPERAND (*expr_p, 1) = build1 (VIEW_CONVERT_EXPR, | |
657 | TREE_TYPE (op0), op1); | |
6d729f28 | 658 | |
25de0a29 | 659 | else if (simple_empty_class_p (TREE_TYPE (op0), op1)) |
6d729f28 | 660 | { |
25de0a29 AH |
661 | /* Remove any copies of empty classes. Also drop volatile |
662 | variables on the RHS to avoid infinite recursion from | |
663 | gimplify_expr trying to load the value. */ | |
664 | gimplify_expr (&TREE_OPERAND (*expr_p, 0), pre_p, post_p, | |
665 | is_gimple_lvalue, fb_lvalue); | |
666 | if (TREE_SIDE_EFFECTS (op1)) | |
667 | { | |
668 | if (TREE_THIS_VOLATILE (op1) | |
669 | && (REFERENCE_CLASS_P (op1) || DECL_P (op1))) | |
670 | op1 = build_fold_addr_expr (op1); | |
671 | ||
672 | gimplify_and_add (op1, pre_p); | |
673 | } | |
674 | *expr_p = TREE_OPERAND (*expr_p, 0); | |
6d729f28 | 675 | } |
1e2ddf80 | 676 | } |
7c34ced1 RH |
677 | ret = GS_OK; |
678 | break; | |
679 | ||
680 | case EMPTY_CLASS_EXPR: | |
f7683d37 RG |
681 | /* We create an empty CONSTRUCTOR with RECORD_TYPE. */ |
682 | *expr_p = build_constructor (TREE_TYPE (*expr_p), NULL); | |
7c34ced1 RH |
683 | ret = GS_OK; |
684 | break; | |
685 | ||
686 | case BASELINK: | |
687 | *expr_p = BASELINK_FUNCTIONS (*expr_p); | |
688 | ret = GS_OK; | |
689 | break; | |
690 | ||
691 | case TRY_BLOCK: | |
692 | genericize_try_block (expr_p); | |
693 | ret = GS_OK; | |
694 | break; | |
695 | ||
696 | case HANDLER: | |
697 | genericize_catch_block (expr_p); | |
698 | ret = GS_OK; | |
699 | break; | |
700 | ||
701 | case EH_SPEC_BLOCK: | |
702 | genericize_eh_spec_block (expr_p); | |
703 | ret = GS_OK; | |
704 | break; | |
705 | ||
706 | case USING_STMT: | |
ac3cbee5 | 707 | gcc_unreachable (); |
7c34ced1 | 708 | |
fbc315db | 709 | case FOR_STMT: |
fbc315db | 710 | case WHILE_STMT: |
fbc315db | 711 | case DO_STMT: |
fbc315db | 712 | case SWITCH_STMT: |
b2cb7511 TV |
713 | case CONTINUE_STMT: |
714 | case BREAK_STMT: | |
715 | gcc_unreachable (); | |
fbc315db | 716 | |
1799e5d5 | 717 | case OMP_FOR: |
acf0174b JJ |
718 | case OMP_SIMD: |
719 | case OMP_DISTRIBUTE: | |
d9a6bd32 | 720 | case OMP_TASKLOOP: |
726a989a | 721 | ret = cp_gimplify_omp_for (expr_p, pre_p); |
1799e5d5 RH |
722 | break; |
723 | ||
934790cc ILT |
724 | case EXPR_STMT: |
725 | gimplify_expr_stmt (expr_p); | |
726 | ret = GS_OK; | |
727 | break; | |
728 | ||
392e3d51 RS |
729 | case UNARY_PLUS_EXPR: |
730 | { | |
731 | tree arg = TREE_OPERAND (*expr_p, 0); | |
732 | tree type = TREE_TYPE (*expr_p); | |
733 | *expr_p = (TREE_TYPE (arg) != type) ? fold_convert (type, arg) | |
734 | : arg; | |
735 | ret = GS_OK; | |
736 | } | |
737 | break; | |
738 | ||
12893402 | 739 | case CILK_SPAWN_STMT: |
cc5c5226 IZ |
740 | gcc_assert(fn_contains_cilk_spawn_p (cfun) |
741 | && cilk_detect_spawn_and_unwrap (expr_p)); | |
12893402 | 742 | |
12893402 | 743 | if (!seen_error ()) |
38942840 BI |
744 | { |
745 | cilk_cp_gimplify_call_params_in_spawned_fn (expr_p, pre_p, post_p); | |
746 | return (enum gimplify_status) gimplify_cilk_spawn (expr_p); | |
747 | } | |
cc5c5226 IZ |
748 | return GS_ERROR; |
749 | ||
12893402 BI |
750 | case CALL_EXPR: |
751 | if (fn_contains_cilk_spawn_p (cfun) | |
752 | && cilk_detect_spawn_and_unwrap (expr_p) | |
753 | && !seen_error ()) | |
38942840 BI |
754 | { |
755 | cilk_cp_gimplify_call_params_in_spawned_fn (expr_p, pre_p, post_p); | |
756 | return (enum gimplify_status) gimplify_cilk_spawn (expr_p); | |
757 | } | |
fe6ebcf1 JM |
758 | /* DR 1030 says that we need to evaluate the elements of an |
759 | initializer-list in forward order even when it's used as arguments to | |
760 | a constructor. So if the target wants to evaluate them in reverse | |
761 | order and there's more than one argument other than 'this', gimplify | |
762 | them in order. */ | |
763 | ret = GS_OK; | |
764 | if (PUSH_ARGS_REVERSED && CALL_EXPR_LIST_INIT_P (*expr_p) | |
765 | && call_expr_nargs (*expr_p) > 2) | |
766 | { | |
767 | int nargs = call_expr_nargs (*expr_p); | |
768 | location_t loc = EXPR_LOC_OR_LOC (*expr_p, input_location); | |
769 | for (int i = 1; i < nargs; ++i) | |
770 | { | |
771 | enum gimplify_status t | |
772 | = gimplify_arg (&CALL_EXPR_ARG (*expr_p, i), pre_p, loc); | |
773 | if (t == GS_ERROR) | |
774 | ret = GS_ERROR; | |
775 | } | |
776 | } | |
777 | break; | |
778 | ||
25de0a29 AH |
779 | case RETURN_EXPR: |
780 | if (TREE_OPERAND (*expr_p, 0) | |
781 | && (TREE_CODE (TREE_OPERAND (*expr_p, 0)) == INIT_EXPR | |
782 | || TREE_CODE (TREE_OPERAND (*expr_p, 0)) == MODIFY_EXPR)) | |
783 | { | |
784 | expr_p = &TREE_OPERAND (*expr_p, 0); | |
785 | code = TREE_CODE (*expr_p); | |
786 | /* Avoid going through the INIT_EXPR case, which can | |
787 | degrade INIT_EXPRs into AGGR_INIT_EXPRs. */ | |
788 | goto modify_expr_case; | |
789 | } | |
790 | /* Fall through. */ | |
791 | ||
7c34ced1 | 792 | default: |
32e8bb8e | 793 | ret = (enum gimplify_status) c_gimplify_expr (expr_p, pre_p, post_p); |
7c34ced1 RH |
794 | break; |
795 | } | |
796 | ||
797 | /* Restore saved state. */ | |
798 | if (STATEMENT_CODE_P (code)) | |
799 | current_stmt_tree ()->stmts_are_full_exprs_p | |
800 | = saved_stmts_are_full_exprs_p; | |
801 | ||
802 | return ret; | |
803 | } | |
5a508662 | 804 | |
d8472c75 | 805 | static inline bool |
58f9752a | 806 | is_invisiref_parm (const_tree t) |
d8472c75 | 807 | { |
cc77ae10 | 808 | return ((TREE_CODE (t) == PARM_DECL || TREE_CODE (t) == RESULT_DECL) |
d8472c75 JM |
809 | && DECL_BY_REFERENCE (t)); |
810 | } | |
811 | ||
10827cd8 JJ |
812 | /* Return true if the uid in both int tree maps are equal. */ |
813 | ||
2a22f99c TS |
814 | bool |
815 | cxx_int_tree_map_hasher::equal (cxx_int_tree_map *a, cxx_int_tree_map *b) | |
10827cd8 | 816 | { |
10827cd8 JJ |
817 | return (a->uid == b->uid); |
818 | } | |
819 | ||
820 | /* Hash a UID in a cxx_int_tree_map. */ | |
821 | ||
822 | unsigned int | |
2a22f99c | 823 | cxx_int_tree_map_hasher::hash (cxx_int_tree_map *item) |
10827cd8 | 824 | { |
2a22f99c | 825 | return item->uid; |
10827cd8 JJ |
826 | } |
827 | ||
4577f730 JJ |
828 | /* A stable comparison routine for use with splay trees and DECLs. */ |
829 | ||
830 | static int | |
831 | splay_tree_compare_decl_uid (splay_tree_key xa, splay_tree_key xb) | |
832 | { | |
833 | tree a = (tree) xa; | |
834 | tree b = (tree) xb; | |
835 | ||
836 | return DECL_UID (a) - DECL_UID (b); | |
837 | } | |
838 | ||
839 | /* OpenMP context during genericization. */ | |
840 | ||
841 | struct cp_genericize_omp_taskreg | |
842 | { | |
843 | bool is_parallel; | |
844 | bool default_shared; | |
845 | struct cp_genericize_omp_taskreg *outer; | |
846 | splay_tree variables; | |
847 | }; | |
848 | ||
849 | /* Return true if genericization should try to determine if | |
850 | DECL is firstprivate or shared within task regions. */ | |
851 | ||
852 | static bool | |
853 | omp_var_to_track (tree decl) | |
854 | { | |
855 | tree type = TREE_TYPE (decl); | |
856 | if (is_invisiref_parm (decl)) | |
857 | type = TREE_TYPE (type); | |
858 | while (TREE_CODE (type) == ARRAY_TYPE) | |
859 | type = TREE_TYPE (type); | |
860 | if (type == error_mark_node || !CLASS_TYPE_P (type)) | |
861 | return false; | |
3048c0c7 | 862 | if (VAR_P (decl) && CP_DECL_THREAD_LOCAL_P (decl)) |
4577f730 JJ |
863 | return false; |
864 | if (cxx_omp_predetermined_sharing (decl) != OMP_CLAUSE_DEFAULT_UNSPECIFIED) | |
865 | return false; | |
866 | return true; | |
867 | } | |
868 | ||
869 | /* Note DECL use in OpenMP region OMP_CTX during genericization. */ | |
870 | ||
871 | static void | |
872 | omp_cxx_notice_variable (struct cp_genericize_omp_taskreg *omp_ctx, tree decl) | |
873 | { | |
874 | splay_tree_node n = splay_tree_lookup (omp_ctx->variables, | |
875 | (splay_tree_key) decl); | |
876 | if (n == NULL) | |
877 | { | |
878 | int flags = OMP_CLAUSE_DEFAULT_SHARED; | |
879 | if (omp_ctx->outer) | |
880 | omp_cxx_notice_variable (omp_ctx->outer, decl); | |
881 | if (!omp_ctx->default_shared) | |
882 | { | |
883 | struct cp_genericize_omp_taskreg *octx; | |
884 | ||
885 | for (octx = omp_ctx->outer; octx; octx = octx->outer) | |
886 | { | |
887 | n = splay_tree_lookup (octx->variables, (splay_tree_key) decl); | |
888 | if (n && n->value != OMP_CLAUSE_DEFAULT_SHARED) | |
889 | { | |
890 | flags = OMP_CLAUSE_DEFAULT_FIRSTPRIVATE; | |
891 | break; | |
892 | } | |
893 | if (octx->is_parallel) | |
894 | break; | |
895 | } | |
896 | if (octx == NULL | |
897 | && (TREE_CODE (decl) == PARM_DECL | |
898 | || (!(TREE_STATIC (decl) || DECL_EXTERNAL (decl)) | |
899 | && DECL_CONTEXT (decl) == current_function_decl))) | |
900 | flags = OMP_CLAUSE_DEFAULT_FIRSTPRIVATE; | |
901 | if (flags == OMP_CLAUSE_DEFAULT_FIRSTPRIVATE) | |
902 | { | |
903 | /* DECL is implicitly determined firstprivate in | |
904 | the current task construct. Ensure copy ctor and | |
905 | dtor are instantiated, because during gimplification | |
906 | it will be already too late. */ | |
907 | tree type = TREE_TYPE (decl); | |
908 | if (is_invisiref_parm (decl)) | |
909 | type = TREE_TYPE (type); | |
910 | while (TREE_CODE (type) == ARRAY_TYPE) | |
911 | type = TREE_TYPE (type); | |
912 | get_copy_ctor (type, tf_none); | |
913 | get_dtor (type, tf_none); | |
914 | } | |
915 | } | |
916 | splay_tree_insert (omp_ctx->variables, (splay_tree_key) decl, flags); | |
917 | } | |
918 | } | |
919 | ||
920 | /* Genericization context. */ | |
921 | ||
ac3cbee5 RG |
922 | struct cp_genericize_data |
923 | { | |
6e2830c3 | 924 | hash_set<tree> *p_set; |
9771b263 | 925 | vec<tree> bind_expr_stack; |
4577f730 | 926 | struct cp_genericize_omp_taskreg *omp_ctx; |
8243e2a9 | 927 | tree try_block; |
7b3a9795 | 928 | bool no_sanitize_p; |
ac3cbee5 RG |
929 | }; |
930 | ||
cda0a029 JM |
931 | /* Perform any pre-gimplification folding of C++ front end trees to |
932 | GENERIC. | |
933 | Note: The folding of none-omp cases is something to move into | |
934 | the middle-end. As for now we have most foldings only on GENERIC | |
935 | in fold-const, we need to perform this before transformation to | |
936 | GIMPLE-form. */ | |
937 | ||
938 | static tree | |
939 | cp_fold_r (tree *stmt_p, int *walk_subtrees, void *data) | |
940 | { | |
941 | tree stmt; | |
942 | enum tree_code code; | |
943 | ||
944 | *stmt_p = stmt = cp_fold (*stmt_p); | |
945 | ||
946 | code = TREE_CODE (stmt); | |
947 | if (code == OMP_FOR || code == OMP_SIMD || code == OMP_DISTRIBUTE | |
f25c3cc0 CP |
948 | || code == OMP_TASKLOOP || code == CILK_FOR || code == CILK_SIMD |
949 | || code == OACC_LOOP) | |
cda0a029 JM |
950 | { |
951 | tree x; | |
952 | int i, n; | |
953 | ||
954 | cp_walk_tree (&OMP_FOR_BODY (stmt), cp_fold_r, data, NULL); | |
955 | cp_walk_tree (&OMP_FOR_CLAUSES (stmt), cp_fold_r, data, NULL); | |
956 | cp_walk_tree (&OMP_FOR_INIT (stmt), cp_fold_r, data, NULL); | |
957 | x = OMP_FOR_COND (stmt); | |
958 | if (x && TREE_CODE_CLASS (TREE_CODE (x)) == tcc_comparison) | |
959 | { | |
960 | cp_walk_tree (&TREE_OPERAND (x, 0), cp_fold_r, data, NULL); | |
961 | cp_walk_tree (&TREE_OPERAND (x, 1), cp_fold_r, data, NULL); | |
962 | } | |
963 | else if (x && TREE_CODE (x) == TREE_VEC) | |
964 | { | |
965 | n = TREE_VEC_LENGTH (x); | |
966 | for (i = 0; i < n; i++) | |
967 | { | |
968 | tree o = TREE_VEC_ELT (x, i); | |
969 | if (o && TREE_CODE_CLASS (TREE_CODE (o)) == tcc_comparison) | |
970 | cp_walk_tree (&TREE_OPERAND (o, 1), cp_fold_r, data, NULL); | |
971 | } | |
972 | } | |
973 | x = OMP_FOR_INCR (stmt); | |
974 | if (x && TREE_CODE (x) == TREE_VEC) | |
975 | { | |
976 | n = TREE_VEC_LENGTH (x); | |
977 | for (i = 0; i < n; i++) | |
978 | { | |
979 | tree o = TREE_VEC_ELT (x, i); | |
980 | if (o && TREE_CODE (o) == MODIFY_EXPR) | |
981 | o = TREE_OPERAND (o, 1); | |
982 | if (o && (TREE_CODE (o) == PLUS_EXPR || TREE_CODE (o) == MINUS_EXPR | |
983 | || TREE_CODE (o) == POINTER_PLUS_EXPR)) | |
984 | { | |
985 | cp_walk_tree (&TREE_OPERAND (o, 0), cp_fold_r, data, NULL); | |
986 | cp_walk_tree (&TREE_OPERAND (o, 1), cp_fold_r, data, NULL); | |
987 | } | |
988 | } | |
989 | } | |
990 | cp_walk_tree (&OMP_FOR_PRE_BODY (stmt), cp_fold_r, data, NULL); | |
991 | *walk_subtrees = 0; | |
992 | } | |
993 | ||
994 | return NULL; | |
995 | } | |
996 | ||
2fa586ad JM |
997 | /* Fold ALL the trees! FIXME we should be able to remove this, but |
998 | apparently that still causes optimization regressions. */ | |
999 | ||
1000 | void | |
1001 | cp_fold_function (tree fndecl) | |
1002 | { | |
1003 | cp_walk_tree (&DECL_SAVED_TREE (fndecl), cp_fold_r, NULL, NULL); | |
1004 | } | |
1005 | ||
d8472c75 JM |
1006 | /* Perform any pre-gimplification lowering of C++ front end trees to |
1007 | GENERIC. */ | |
5a508662 RH |
1008 | |
1009 | static tree | |
d8472c75 | 1010 | cp_genericize_r (tree *stmt_p, int *walk_subtrees, void *data) |
5a508662 RH |
1011 | { |
1012 | tree stmt = *stmt_p; | |
ac3cbee5 | 1013 | struct cp_genericize_data *wtd = (struct cp_genericize_data *) data; |
6e2830c3 | 1014 | hash_set<tree> *p_set = wtd->p_set; |
5a508662 | 1015 | |
4577f730 JJ |
1016 | /* If in an OpenMP context, note var uses. */ |
1017 | if (__builtin_expect (wtd->omp_ctx != NULL, 0) | |
5a6ccc94 | 1018 | && (VAR_P (stmt) |
4577f730 JJ |
1019 | || TREE_CODE (stmt) == PARM_DECL |
1020 | || TREE_CODE (stmt) == RESULT_DECL) | |
1021 | && omp_var_to_track (stmt)) | |
1022 | omp_cxx_notice_variable (wtd->omp_ctx, stmt); | |
1023 | ||
5b009a96 JM |
1024 | if (is_invisiref_parm (stmt) |
1025 | /* Don't dereference parms in a thunk, pass the references through. */ | |
1026 | && !(DECL_THUNK_P (current_function_decl) | |
3db45ab5 | 1027 | && TREE_CODE (stmt) == PARM_DECL)) |
d8472c75 | 1028 | { |
cc77ae10 | 1029 | *stmt_p = convert_from_reference (stmt); |
d8472c75 JM |
1030 | *walk_subtrees = 0; |
1031 | return NULL; | |
1032 | } | |
1033 | ||
10827cd8 JJ |
1034 | /* Map block scope extern declarations to visible declarations with the |
1035 | same name and type in outer scopes if any. */ | |
1036 | if (cp_function_chain->extern_decl_map | |
cb6da767 | 1037 | && VAR_OR_FUNCTION_DECL_P (stmt) |
10827cd8 JJ |
1038 | && DECL_EXTERNAL (stmt)) |
1039 | { | |
1040 | struct cxx_int_tree_map *h, in; | |
1041 | in.uid = DECL_UID (stmt); | |
2a22f99c | 1042 | h = cp_function_chain->extern_decl_map->find_with_hash (&in, in.uid); |
10827cd8 JJ |
1043 | if (h) |
1044 | { | |
1045 | *stmt_p = h->to; | |
1046 | *walk_subtrees = 0; | |
1047 | return NULL; | |
1048 | } | |
1049 | } | |
1050 | ||
d8472c75 | 1051 | /* Other than invisiref parms, don't walk the same tree twice. */ |
6e2830c3 | 1052 | if (p_set->contains (stmt)) |
d8472c75 JM |
1053 | { |
1054 | *walk_subtrees = 0; | |
1055 | return NULL_TREE; | |
1056 | } | |
1057 | ||
1058 | if (TREE_CODE (stmt) == ADDR_EXPR | |
1059 | && is_invisiref_parm (TREE_OPERAND (stmt, 0))) | |
1060 | { | |
4577f730 JJ |
1061 | /* If in an OpenMP context, note var uses. */ |
1062 | if (__builtin_expect (wtd->omp_ctx != NULL, 0) | |
1063 | && omp_var_to_track (TREE_OPERAND (stmt, 0))) | |
1064 | omp_cxx_notice_variable (wtd->omp_ctx, TREE_OPERAND (stmt, 0)); | |
cda0a029 | 1065 | *stmt_p = fold_convert (TREE_TYPE (stmt), TREE_OPERAND (stmt, 0)); |
d8472c75 JM |
1066 | *walk_subtrees = 0; |
1067 | } | |
cc77ae10 JM |
1068 | else if (TREE_CODE (stmt) == RETURN_EXPR |
1069 | && TREE_OPERAND (stmt, 0) | |
1070 | && is_invisiref_parm (TREE_OPERAND (stmt, 0))) | |
1071 | /* Don't dereference an invisiref RESULT_DECL inside a RETURN_EXPR. */ | |
1072 | *walk_subtrees = 0; | |
e02a048f JJ |
1073 | else if (TREE_CODE (stmt) == OMP_CLAUSE) |
1074 | switch (OMP_CLAUSE_CODE (stmt)) | |
1075 | { | |
a68ab351 JJ |
1076 | case OMP_CLAUSE_LASTPRIVATE: |
1077 | /* Don't dereference an invisiref in OpenMP clauses. */ | |
1078 | if (is_invisiref_parm (OMP_CLAUSE_DECL (stmt))) | |
1079 | { | |
1080 | *walk_subtrees = 0; | |
1081 | if (OMP_CLAUSE_LASTPRIVATE_STMT (stmt)) | |
1082 | cp_walk_tree (&OMP_CLAUSE_LASTPRIVATE_STMT (stmt), | |
ac3cbee5 | 1083 | cp_genericize_r, data, NULL); |
a68ab351 JJ |
1084 | } |
1085 | break; | |
e02a048f | 1086 | case OMP_CLAUSE_PRIVATE: |
4577f730 JJ |
1087 | /* Don't dereference an invisiref in OpenMP clauses. */ |
1088 | if (is_invisiref_parm (OMP_CLAUSE_DECL (stmt))) | |
1089 | *walk_subtrees = 0; | |
1090 | else if (wtd->omp_ctx != NULL) | |
1091 | { | |
1092 | /* Private clause doesn't cause any references to the | |
1093 | var in outer contexts, avoid calling | |
1094 | omp_cxx_notice_variable for it. */ | |
1095 | struct cp_genericize_omp_taskreg *old = wtd->omp_ctx; | |
1096 | wtd->omp_ctx = NULL; | |
1097 | cp_walk_tree (&OMP_CLAUSE_DECL (stmt), cp_genericize_r, | |
1098 | data, NULL); | |
1099 | wtd->omp_ctx = old; | |
1100 | *walk_subtrees = 0; | |
1101 | } | |
1102 | break; | |
e02a048f JJ |
1103 | case OMP_CLAUSE_SHARED: |
1104 | case OMP_CLAUSE_FIRSTPRIVATE: | |
e02a048f JJ |
1105 | case OMP_CLAUSE_COPYIN: |
1106 | case OMP_CLAUSE_COPYPRIVATE: | |
1107 | /* Don't dereference an invisiref in OpenMP clauses. */ | |
1108 | if (is_invisiref_parm (OMP_CLAUSE_DECL (stmt))) | |
1109 | *walk_subtrees = 0; | |
1110 | break; | |
1111 | case OMP_CLAUSE_REDUCTION: | |
acf0174b JJ |
1112 | /* Don't dereference an invisiref in reduction clause's |
1113 | OMP_CLAUSE_DECL either. OMP_CLAUSE_REDUCTION_{INIT,MERGE} | |
1114 | still needs to be genericized. */ | |
1115 | if (is_invisiref_parm (OMP_CLAUSE_DECL (stmt))) | |
1116 | { | |
1117 | *walk_subtrees = 0; | |
1118 | if (OMP_CLAUSE_REDUCTION_INIT (stmt)) | |
1119 | cp_walk_tree (&OMP_CLAUSE_REDUCTION_INIT (stmt), | |
1120 | cp_genericize_r, data, NULL); | |
1121 | if (OMP_CLAUSE_REDUCTION_MERGE (stmt)) | |
1122 | cp_walk_tree (&OMP_CLAUSE_REDUCTION_MERGE (stmt), | |
1123 | cp_genericize_r, data, NULL); | |
1124 | } | |
e02a048f JJ |
1125 | break; |
1126 | default: | |
1127 | break; | |
1128 | } | |
6615c446 | 1129 | else if (IS_TYPE_OR_DECL_P (stmt)) |
5a508662 | 1130 | *walk_subtrees = 0; |
d8472c75 JM |
1131 | |
1132 | /* Due to the way voidify_wrapper_expr is written, we don't get a chance | |
1133 | to lower this construct before scanning it, so we need to lower these | |
1134 | before doing anything else. */ | |
5a508662 | 1135 | else if (TREE_CODE (stmt) == CLEANUP_STMT) |
e368f44f DC |
1136 | *stmt_p = build2_loc (EXPR_LOCATION (stmt), |
1137 | CLEANUP_EH_ONLY (stmt) ? TRY_CATCH_EXPR | |
1138 | : TRY_FINALLY_EXPR, | |
1139 | void_type_node, | |
1140 | CLEANUP_BODY (stmt), | |
1141 | CLEANUP_EXPR (stmt)); | |
af76441f | 1142 | |
f74d9c8f JJ |
1143 | else if (TREE_CODE (stmt) == IF_STMT) |
1144 | { | |
1145 | genericize_if_stmt (stmt_p); | |
1146 | /* *stmt_p has changed, tail recurse to handle it again. */ | |
1147 | return cp_genericize_r (stmt_p, walk_subtrees, data); | |
1148 | } | |
1149 | ||
bbdf5682 JJ |
1150 | /* COND_EXPR might have incompatible types in branches if one or both |
1151 | arms are bitfields. Fix it up now. */ | |
1152 | else if (TREE_CODE (stmt) == COND_EXPR) | |
1153 | { | |
1154 | tree type_left | |
1155 | = (TREE_OPERAND (stmt, 1) | |
1156 | ? is_bitfield_expr_with_lowered_type (TREE_OPERAND (stmt, 1)) | |
1157 | : NULL_TREE); | |
1158 | tree type_right | |
1159 | = (TREE_OPERAND (stmt, 2) | |
1160 | ? is_bitfield_expr_with_lowered_type (TREE_OPERAND (stmt, 2)) | |
1161 | : NULL_TREE); | |
d767aebf JJ |
1162 | if (type_left |
1163 | && !useless_type_conversion_p (TREE_TYPE (stmt), | |
1164 | TREE_TYPE (TREE_OPERAND (stmt, 1)))) | |
bbdf5682 JJ |
1165 | { |
1166 | TREE_OPERAND (stmt, 1) | |
1167 | = fold_convert (type_left, TREE_OPERAND (stmt, 1)); | |
1168 | gcc_assert (useless_type_conversion_p (TREE_TYPE (stmt), | |
1169 | type_left)); | |
1170 | } | |
d767aebf JJ |
1171 | if (type_right |
1172 | && !useless_type_conversion_p (TREE_TYPE (stmt), | |
1173 | TREE_TYPE (TREE_OPERAND (stmt, 2)))) | |
bbdf5682 JJ |
1174 | { |
1175 | TREE_OPERAND (stmt, 2) | |
1176 | = fold_convert (type_right, TREE_OPERAND (stmt, 2)); | |
1177 | gcc_assert (useless_type_conversion_p (TREE_TYPE (stmt), | |
1178 | type_right)); | |
1179 | } | |
1180 | } | |
1181 | ||
ac3cbee5 RG |
1182 | else if (TREE_CODE (stmt) == BIND_EXPR) |
1183 | { | |
4577f730 JJ |
1184 | if (__builtin_expect (wtd->omp_ctx != NULL, 0)) |
1185 | { | |
1186 | tree decl; | |
1187 | for (decl = BIND_EXPR_VARS (stmt); decl; decl = DECL_CHAIN (decl)) | |
5a6ccc94 | 1188 | if (VAR_P (decl) |
4577f730 JJ |
1189 | && !DECL_EXTERNAL (decl) |
1190 | && omp_var_to_track (decl)) | |
1191 | { | |
1192 | splay_tree_node n | |
1193 | = splay_tree_lookup (wtd->omp_ctx->variables, | |
1194 | (splay_tree_key) decl); | |
1195 | if (n == NULL) | |
1196 | splay_tree_insert (wtd->omp_ctx->variables, | |
1197 | (splay_tree_key) decl, | |
1198 | TREE_STATIC (decl) | |
1199 | ? OMP_CLAUSE_DEFAULT_SHARED | |
1200 | : OMP_CLAUSE_DEFAULT_PRIVATE); | |
1201 | } | |
1202 | } | |
7b3a9795 MP |
1203 | if (flag_sanitize |
1204 | & (SANITIZE_NULL | SANITIZE_ALIGNMENT | SANITIZE_VPTR)) | |
1205 | { | |
1206 | /* The point here is to not sanitize static initializers. */ | |
1207 | bool no_sanitize_p = wtd->no_sanitize_p; | |
1208 | wtd->no_sanitize_p = true; | |
1209 | for (tree decl = BIND_EXPR_VARS (stmt); | |
1210 | decl; | |
1211 | decl = DECL_CHAIN (decl)) | |
1212 | if (VAR_P (decl) | |
1213 | && TREE_STATIC (decl) | |
1214 | && DECL_INITIAL (decl)) | |
1215 | cp_walk_tree (&DECL_INITIAL (decl), cp_genericize_r, data, NULL); | |
1216 | wtd->no_sanitize_p = no_sanitize_p; | |
1217 | } | |
9771b263 | 1218 | wtd->bind_expr_stack.safe_push (stmt); |
ac3cbee5 RG |
1219 | cp_walk_tree (&BIND_EXPR_BODY (stmt), |
1220 | cp_genericize_r, data, NULL); | |
9771b263 | 1221 | wtd->bind_expr_stack.pop (); |
ac3cbee5 RG |
1222 | } |
1223 | ||
1224 | else if (TREE_CODE (stmt) == USING_STMT) | |
1225 | { | |
1226 | tree block = NULL_TREE; | |
1227 | ||
1228 | /* Get the innermost inclosing GIMPLE_BIND that has a non NULL | |
1229 | BLOCK, and append an IMPORTED_DECL to its | |
1230 | BLOCK_VARS chained list. */ | |
9771b263 | 1231 | if (wtd->bind_expr_stack.exists ()) |
ac3cbee5 RG |
1232 | { |
1233 | int i; | |
9771b263 DN |
1234 | for (i = wtd->bind_expr_stack.length () - 1; i >= 0; i--) |
1235 | if ((block = BIND_EXPR_BLOCK (wtd->bind_expr_stack[i]))) | |
ac3cbee5 RG |
1236 | break; |
1237 | } | |
1238 | if (block) | |
1239 | { | |
1240 | tree using_directive; | |
1241 | gcc_assert (TREE_OPERAND (stmt, 0)); | |
1242 | ||
1243 | using_directive = make_node (IMPORTED_DECL); | |
1244 | TREE_TYPE (using_directive) = void_type_node; | |
1245 | ||
1246 | IMPORTED_DECL_ASSOCIATED_DECL (using_directive) | |
1247 | = TREE_OPERAND (stmt, 0); | |
910ad8de | 1248 | DECL_CHAIN (using_directive) = BLOCK_VARS (block); |
ac3cbee5 RG |
1249 | BLOCK_VARS (block) = using_directive; |
1250 | } | |
1251 | /* The USING_STMT won't appear in GENERIC. */ | |
1252 | *stmt_p = build1 (NOP_EXPR, void_type_node, integer_zero_node); | |
1253 | *walk_subtrees = 0; | |
1254 | } | |
1255 | ||
1256 | else if (TREE_CODE (stmt) == DECL_EXPR | |
1257 | && TREE_CODE (DECL_EXPR_DECL (stmt)) == USING_DECL) | |
1258 | { | |
1259 | /* Using decls inside DECL_EXPRs are just dropped on the floor. */ | |
1260 | *stmt_p = build1 (NOP_EXPR, void_type_node, integer_zero_node); | |
1261 | *walk_subtrees = 0; | |
1262 | } | |
3048c0c7 JM |
1263 | else if (TREE_CODE (stmt) == DECL_EXPR) |
1264 | { | |
1265 | tree d = DECL_EXPR_DECL (stmt); | |
1266 | if (TREE_CODE (d) == VAR_DECL) | |
1267 | gcc_assert (CP_DECL_THREAD_LOCAL_P (d) == DECL_THREAD_LOCAL_P (d)); | |
1268 | } | |
4577f730 JJ |
1269 | else if (TREE_CODE (stmt) == OMP_PARALLEL || TREE_CODE (stmt) == OMP_TASK) |
1270 | { | |
1271 | struct cp_genericize_omp_taskreg omp_ctx; | |
1272 | tree c, decl; | |
1273 | splay_tree_node n; | |
1274 | ||
1275 | *walk_subtrees = 0; | |
1276 | cp_walk_tree (&OMP_CLAUSES (stmt), cp_genericize_r, data, NULL); | |
1277 | omp_ctx.is_parallel = TREE_CODE (stmt) == OMP_PARALLEL; | |
1278 | omp_ctx.default_shared = omp_ctx.is_parallel; | |
1279 | omp_ctx.outer = wtd->omp_ctx; | |
1280 | omp_ctx.variables = splay_tree_new (splay_tree_compare_decl_uid, 0, 0); | |
1281 | wtd->omp_ctx = &omp_ctx; | |
1282 | for (c = OMP_CLAUSES (stmt); c; c = OMP_CLAUSE_CHAIN (c)) | |
1283 | switch (OMP_CLAUSE_CODE (c)) | |
1284 | { | |
1285 | case OMP_CLAUSE_SHARED: | |
1286 | case OMP_CLAUSE_PRIVATE: | |
1287 | case OMP_CLAUSE_FIRSTPRIVATE: | |
1288 | case OMP_CLAUSE_LASTPRIVATE: | |
1289 | decl = OMP_CLAUSE_DECL (c); | |
1290 | if (decl == error_mark_node || !omp_var_to_track (decl)) | |
1291 | break; | |
1292 | n = splay_tree_lookup (omp_ctx.variables, (splay_tree_key) decl); | |
1293 | if (n != NULL) | |
1294 | break; | |
1295 | splay_tree_insert (omp_ctx.variables, (splay_tree_key) decl, | |
1296 | OMP_CLAUSE_CODE (c) == OMP_CLAUSE_SHARED | |
1297 | ? OMP_CLAUSE_DEFAULT_SHARED | |
1298 | : OMP_CLAUSE_DEFAULT_PRIVATE); | |
1299 | if (OMP_CLAUSE_CODE (c) != OMP_CLAUSE_PRIVATE | |
1300 | && omp_ctx.outer) | |
1301 | omp_cxx_notice_variable (omp_ctx.outer, decl); | |
1302 | break; | |
1303 | case OMP_CLAUSE_DEFAULT: | |
1304 | if (OMP_CLAUSE_DEFAULT_KIND (c) == OMP_CLAUSE_DEFAULT_SHARED) | |
1305 | omp_ctx.default_shared = true; | |
1306 | default: | |
1307 | break; | |
1308 | } | |
1309 | cp_walk_tree (&OMP_BODY (stmt), cp_genericize_r, data, NULL); | |
1310 | wtd->omp_ctx = omp_ctx.outer; | |
1311 | splay_tree_delete (omp_ctx.variables); | |
1312 | } | |
8243e2a9 JM |
1313 | else if (TREE_CODE (stmt) == TRY_BLOCK) |
1314 | { | |
1315 | *walk_subtrees = 0; | |
1316 | tree try_block = wtd->try_block; | |
1317 | wtd->try_block = stmt; | |
1318 | cp_walk_tree (&TRY_STMTS (stmt), cp_genericize_r, data, NULL); | |
1319 | wtd->try_block = try_block; | |
1320 | cp_walk_tree (&TRY_HANDLERS (stmt), cp_genericize_r, data, NULL); | |
1321 | } | |
1322 | else if (TREE_CODE (stmt) == MUST_NOT_THROW_EXPR) | |
1323 | { | |
1324 | /* MUST_NOT_THROW_COND might be something else with TM. */ | |
1325 | if (MUST_NOT_THROW_COND (stmt) == NULL_TREE) | |
1326 | { | |
1327 | *walk_subtrees = 0; | |
1328 | tree try_block = wtd->try_block; | |
1329 | wtd->try_block = stmt; | |
1330 | cp_walk_tree (&TREE_OPERAND (stmt, 0), cp_genericize_r, data, NULL); | |
1331 | wtd->try_block = try_block; | |
1332 | } | |
1333 | } | |
1334 | else if (TREE_CODE (stmt) == THROW_EXPR) | |
1335 | { | |
1336 | location_t loc = location_of (stmt); | |
1337 | if (TREE_NO_WARNING (stmt)) | |
1338 | /* Never mind. */; | |
1339 | else if (wtd->try_block) | |
1340 | { | |
1341 | if (TREE_CODE (wtd->try_block) == MUST_NOT_THROW_EXPR | |
1342 | && warning_at (loc, OPT_Wterminate, | |
1343 | "throw will always call terminate()") | |
1344 | && cxx_dialect >= cxx11 | |
1345 | && DECL_DESTRUCTOR_P (current_function_decl)) | |
1346 | inform (loc, "in C++11 destructors default to noexcept"); | |
1347 | } | |
1348 | else | |
1349 | { | |
765189ff | 1350 | if (warn_cxx11_compat && cxx_dialect < cxx11 |
8243e2a9 JM |
1351 | && DECL_DESTRUCTOR_P (current_function_decl) |
1352 | && (TYPE_RAISES_EXCEPTIONS (TREE_TYPE (current_function_decl)) | |
1353 | == NULL_TREE) | |
1354 | && (get_defaulted_eh_spec (current_function_decl) | |
1355 | == empty_except_spec)) | |
765189ff | 1356 | warning_at (loc, OPT_Wc__11_compat, |
8243e2a9 JM |
1357 | "in C++11 this throw will terminate because " |
1358 | "destructors default to noexcept"); | |
1359 | } | |
1360 | } | |
c65b0607 JM |
1361 | else if (TREE_CODE (stmt) == CONVERT_EXPR) |
1362 | gcc_assert (!CONVERT_EXPR_VBASE_PATH (stmt)); | |
b2cb7511 TV |
1363 | else if (TREE_CODE (stmt) == FOR_STMT) |
1364 | genericize_for_stmt (stmt_p, walk_subtrees, data); | |
1365 | else if (TREE_CODE (stmt) == WHILE_STMT) | |
1366 | genericize_while_stmt (stmt_p, walk_subtrees, data); | |
1367 | else if (TREE_CODE (stmt) == DO_STMT) | |
1368 | genericize_do_stmt (stmt_p, walk_subtrees, data); | |
1369 | else if (TREE_CODE (stmt) == SWITCH_STMT) | |
1370 | genericize_switch_stmt (stmt_p, walk_subtrees, data); | |
1371 | else if (TREE_CODE (stmt) == CONTINUE_STMT) | |
1372 | genericize_continue_stmt (stmt_p); | |
1373 | else if (TREE_CODE (stmt) == BREAK_STMT) | |
1374 | genericize_break_stmt (stmt_p); | |
acf0174b JJ |
1375 | else if (TREE_CODE (stmt) == OMP_FOR |
1376 | || TREE_CODE (stmt) == OMP_SIMD | |
d9a6bd32 JJ |
1377 | || TREE_CODE (stmt) == OMP_DISTRIBUTE |
1378 | || TREE_CODE (stmt) == OMP_TASKLOOP) | |
b2cb7511 | 1379 | genericize_omp_for_stmt (stmt_p, walk_subtrees, data); |
7b3a9795 MP |
1380 | else if ((flag_sanitize |
1381 | & (SANITIZE_NULL | SANITIZE_ALIGNMENT | SANITIZE_VPTR)) | |
1382 | && !wtd->no_sanitize_p) | |
944fa280 | 1383 | { |
35228ac7 JJ |
1384 | if ((flag_sanitize & (SANITIZE_NULL | SANITIZE_ALIGNMENT)) |
1385 | && TREE_CODE (stmt) == NOP_EXPR | |
944fa280 JJ |
1386 | && TREE_CODE (TREE_TYPE (stmt)) == REFERENCE_TYPE) |
1387 | ubsan_maybe_instrument_reference (stmt); | |
1388 | else if (TREE_CODE (stmt) == CALL_EXPR) | |
1389 | { | |
1390 | tree fn = CALL_EXPR_FN (stmt); | |
1391 | if (fn != NULL_TREE | |
1392 | && !error_operand_p (fn) | |
1393 | && POINTER_TYPE_P (TREE_TYPE (fn)) | |
1394 | && TREE_CODE (TREE_TYPE (TREE_TYPE (fn))) == METHOD_TYPE) | |
1395 | { | |
1396 | bool is_ctor | |
1397 | = TREE_CODE (fn) == ADDR_EXPR | |
1398 | && TREE_CODE (TREE_OPERAND (fn, 0)) == FUNCTION_DECL | |
1399 | && DECL_CONSTRUCTOR_P (TREE_OPERAND (fn, 0)); | |
35228ac7 JJ |
1400 | if (flag_sanitize & (SANITIZE_NULL | SANITIZE_ALIGNMENT)) |
1401 | ubsan_maybe_instrument_member_call (stmt, is_ctor); | |
1402 | if ((flag_sanitize & SANITIZE_VPTR) && !is_ctor) | |
1403 | cp_ubsan_maybe_instrument_member_call (stmt); | |
944fa280 JJ |
1404 | } |
1405 | } | |
1406 | } | |
ac3cbee5 | 1407 | |
6e2830c3 | 1408 | p_set->add (*stmt_p); |
c8094d83 | 1409 | |
5a508662 RH |
1410 | return NULL; |
1411 | } | |
1412 | ||
b2cb7511 TV |
1413 | /* Lower C++ front end trees to GENERIC in T_P. */ |
1414 | ||
1415 | static void | |
1416 | cp_genericize_tree (tree* t_p) | |
1417 | { | |
1418 | struct cp_genericize_data wtd; | |
1419 | ||
6e2830c3 | 1420 | wtd.p_set = new hash_set<tree>; |
9771b263 | 1421 | wtd.bind_expr_stack.create (0); |
b2cb7511 | 1422 | wtd.omp_ctx = NULL; |
8243e2a9 | 1423 | wtd.try_block = NULL_TREE; |
7b3a9795 | 1424 | wtd.no_sanitize_p = false; |
b2cb7511 | 1425 | cp_walk_tree (t_p, cp_genericize_r, &wtd, NULL); |
6e2830c3 | 1426 | delete wtd.p_set; |
9771b263 | 1427 | wtd.bind_expr_stack.release (); |
35228ac7 JJ |
1428 | if (flag_sanitize & SANITIZE_VPTR) |
1429 | cp_ubsan_instrument_member_accesses (t_p); | |
b2cb7511 TV |
1430 | } |
1431 | ||
0a508bb6 JJ |
1432 | /* If a function that should end with a return in non-void |
1433 | function doesn't obviously end with return, add ubsan | |
6a7253a4 | 1434 | instrumentation code to verify it at runtime. */ |
0a508bb6 JJ |
1435 | |
1436 | static void | |
1437 | cp_ubsan_maybe_instrument_return (tree fndecl) | |
1438 | { | |
1439 | if (VOID_TYPE_P (TREE_TYPE (TREE_TYPE (fndecl))) | |
1440 | || DECL_CONSTRUCTOR_P (fndecl) | |
1441 | || DECL_DESTRUCTOR_P (fndecl) | |
1442 | || !targetm.warn_func_return (fndecl)) | |
1443 | return; | |
1444 | ||
1445 | tree t = DECL_SAVED_TREE (fndecl); | |
1446 | while (t) | |
1447 | { | |
1448 | switch (TREE_CODE (t)) | |
1449 | { | |
1450 | case BIND_EXPR: | |
1451 | t = BIND_EXPR_BODY (t); | |
1452 | continue; | |
1453 | case TRY_FINALLY_EXPR: | |
1454 | t = TREE_OPERAND (t, 0); | |
1455 | continue; | |
1456 | case STATEMENT_LIST: | |
1457 | { | |
1458 | tree_stmt_iterator i = tsi_last (t); | |
1459 | if (!tsi_end_p (i)) | |
1460 | { | |
1461 | t = tsi_stmt (i); | |
1462 | continue; | |
1463 | } | |
1464 | } | |
1465 | break; | |
1466 | case RETURN_EXPR: | |
1467 | return; | |
1468 | default: | |
1469 | break; | |
1470 | } | |
1471 | break; | |
1472 | } | |
1473 | if (t == NULL_TREE) | |
1474 | return; | |
1475 | t = DECL_SAVED_TREE (fndecl); | |
1476 | if (TREE_CODE (t) == BIND_EXPR | |
1477 | && TREE_CODE (BIND_EXPR_BODY (t)) == STATEMENT_LIST) | |
1478 | { | |
1479 | tree_stmt_iterator i = tsi_last (BIND_EXPR_BODY (t)); | |
1480 | t = ubsan_instrument_return (DECL_SOURCE_LOCATION (fndecl)); | |
1481 | tsi_link_after (&i, t, TSI_NEW_STMT); | |
1482 | } | |
1483 | } | |
1484 | ||
5a508662 RH |
1485 | void |
1486 | cp_genericize (tree fndecl) | |
1487 | { | |
d8472c75 | 1488 | tree t; |
d8472c75 JM |
1489 | |
1490 | /* Fix up the types of parms passed by invisible reference. */ | |
910ad8de | 1491 | for (t = DECL_ARGUMENTS (fndecl); t; t = DECL_CHAIN (t)) |
dfb5c523 MM |
1492 | if (TREE_ADDRESSABLE (TREE_TYPE (t))) |
1493 | { | |
1494 | /* If a function's arguments are copied to create a thunk, | |
1495 | then DECL_BY_REFERENCE will be set -- but the type of the | |
1496 | argument will be a pointer type, so we will never get | |
1497 | here. */ | |
1498 | gcc_assert (!DECL_BY_REFERENCE (t)); | |
1499 | gcc_assert (DECL_ARG_TYPE (t) != TREE_TYPE (t)); | |
1500 | TREE_TYPE (t) = DECL_ARG_TYPE (t); | |
1501 | DECL_BY_REFERENCE (t) = 1; | |
1502 | TREE_ADDRESSABLE (t) = 0; | |
1503 | relayout_decl (t); | |
1504 | } | |
d8472c75 | 1505 | |
cc77ae10 JM |
1506 | /* Do the same for the return value. */ |
1507 | if (TREE_ADDRESSABLE (TREE_TYPE (DECL_RESULT (fndecl)))) | |
1508 | { | |
1509 | t = DECL_RESULT (fndecl); | |
1510 | TREE_TYPE (t) = build_reference_type (TREE_TYPE (t)); | |
1511 | DECL_BY_REFERENCE (t) = 1; | |
1512 | TREE_ADDRESSABLE (t) = 0; | |
1513 | relayout_decl (t); | |
140806fa JJ |
1514 | if (DECL_NAME (t)) |
1515 | { | |
1516 | /* Adjust DECL_VALUE_EXPR of the original var. */ | |
1517 | tree outer = outer_curly_brace_block (current_function_decl); | |
1518 | tree var; | |
1519 | ||
1520 | if (outer) | |
1521 | for (var = BLOCK_VARS (outer); var; var = DECL_CHAIN (var)) | |
1522 | if (DECL_NAME (t) == DECL_NAME (var) | |
1523 | && DECL_HAS_VALUE_EXPR_P (var) | |
1524 | && DECL_VALUE_EXPR (var) == t) | |
1525 | { | |
1526 | tree val = convert_from_reference (t); | |
1527 | SET_DECL_VALUE_EXPR (var, val); | |
1528 | break; | |
1529 | } | |
1530 | } | |
cc77ae10 JM |
1531 | } |
1532 | ||
d8472c75 JM |
1533 | /* If we're a clone, the body is already GIMPLE. */ |
1534 | if (DECL_CLONED_FUNCTION_P (fndecl)) | |
1535 | return; | |
1536 | ||
1141ed3f | 1537 | /* Expand all the array notations here. */ |
b72271b9 | 1538 | if (flag_cilkplus |
1141ed3f BI |
1539 | && contains_array_notation_expr (DECL_SAVED_TREE (fndecl))) |
1540 | DECL_SAVED_TREE (fndecl) = | |
1541 | expand_array_notation_exprs (DECL_SAVED_TREE (fndecl)); | |
1542 | ||
d8472c75 JM |
1543 | /* We do want to see every occurrence of the parms, so we can't just use |
1544 | walk_tree's hash functionality. */ | |
b2cb7511 | 1545 | cp_genericize_tree (&DECL_SAVED_TREE (fndecl)); |
5a508662 | 1546 | |
6a7253a4 | 1547 | if (flag_sanitize & SANITIZE_RETURN |
f5481fc4 | 1548 | && do_ubsan_in_current_function ()) |
0a508bb6 JJ |
1549 | cp_ubsan_maybe_instrument_return (fndecl); |
1550 | ||
5a508662 RH |
1551 | /* Do everything else. */ |
1552 | c_genericize (fndecl); | |
1799e5d5 RH |
1553 | |
1554 | gcc_assert (bc_label[bc_break] == NULL); | |
1555 | gcc_assert (bc_label[bc_continue] == NULL); | |
1556 | } | |
1557 | \f | |
1558 | /* Build code to apply FN to each member of ARG1 and ARG2. FN may be | |
1559 | NULL if there is in fact nothing to do. ARG2 may be null if FN | |
1560 | actually only takes one argument. */ | |
1561 | ||
1562 | static tree | |
1563 | cxx_omp_clause_apply_fn (tree fn, tree arg1, tree arg2) | |
1564 | { | |
c2898ec9 | 1565 | tree defparm, parm, t; |
94a0dd7b SL |
1566 | int i = 0; |
1567 | int nargs; | |
1568 | tree *argarray; | |
fae2b46b | 1569 | |
1799e5d5 RH |
1570 | if (fn == NULL) |
1571 | return NULL; | |
1572 | ||
94a0dd7b | 1573 | nargs = list_length (DECL_ARGUMENTS (fn)); |
86b8fed1 | 1574 | argarray = XALLOCAVEC (tree, nargs); |
94a0dd7b | 1575 | |
fae2b46b JJ |
1576 | defparm = TREE_CHAIN (TYPE_ARG_TYPES (TREE_TYPE (fn))); |
1577 | if (arg2) | |
1578 | defparm = TREE_CHAIN (defparm); | |
1579 | ||
1799e5d5 RH |
1580 | if (TREE_CODE (TREE_TYPE (arg1)) == ARRAY_TYPE) |
1581 | { | |
1582 | tree inner_type = TREE_TYPE (arg1); | |
1583 | tree start1, end1, p1; | |
1584 | tree start2 = NULL, p2 = NULL; | |
c2898ec9 | 1585 | tree ret = NULL, lab; |
1799e5d5 RH |
1586 | |
1587 | start1 = arg1; | |
1588 | start2 = arg2; | |
1589 | do | |
1590 | { | |
1591 | inner_type = TREE_TYPE (inner_type); | |
1592 | start1 = build4 (ARRAY_REF, inner_type, start1, | |
1593 | size_zero_node, NULL, NULL); | |
1594 | if (arg2) | |
1595 | start2 = build4 (ARRAY_REF, inner_type, start2, | |
1596 | size_zero_node, NULL, NULL); | |
1597 | } | |
1598 | while (TREE_CODE (inner_type) == ARRAY_TYPE); | |
db3927fb | 1599 | start1 = build_fold_addr_expr_loc (input_location, start1); |
1799e5d5 | 1600 | if (arg2) |
db3927fb | 1601 | start2 = build_fold_addr_expr_loc (input_location, start2); |
1799e5d5 RH |
1602 | |
1603 | end1 = TYPE_SIZE_UNIT (TREE_TYPE (arg1)); | |
5d49b6a7 | 1604 | end1 = fold_build_pointer_plus (start1, end1); |
1799e5d5 | 1605 | |
b731b390 | 1606 | p1 = create_tmp_var (TREE_TYPE (start1)); |
726a989a | 1607 | t = build2 (MODIFY_EXPR, TREE_TYPE (p1), p1, start1); |
1799e5d5 RH |
1608 | append_to_statement_list (t, &ret); |
1609 | ||
1610 | if (arg2) | |
1611 | { | |
b731b390 | 1612 | p2 = create_tmp_var (TREE_TYPE (start2)); |
726a989a | 1613 | t = build2 (MODIFY_EXPR, TREE_TYPE (p2), p2, start2); |
1799e5d5 RH |
1614 | append_to_statement_list (t, &ret); |
1615 | } | |
1616 | ||
c2255bc4 | 1617 | lab = create_artificial_label (input_location); |
1799e5d5 RH |
1618 | t = build1 (LABEL_EXPR, void_type_node, lab); |
1619 | append_to_statement_list (t, &ret); | |
1620 | ||
94a0dd7b | 1621 | argarray[i++] = p1; |
1799e5d5 | 1622 | if (arg2) |
94a0dd7b | 1623 | argarray[i++] = p2; |
fae2b46b | 1624 | /* Handle default arguments. */ |
d2ee546f JJ |
1625 | for (parm = defparm; parm && parm != void_list_node; |
1626 | parm = TREE_CHAIN (parm), i++) | |
94a0dd7b | 1627 | argarray[i] = convert_default_arg (TREE_VALUE (parm), |
b40e334f PC |
1628 | TREE_PURPOSE (parm), fn, i, |
1629 | tf_warning_or_error); | |
94a0dd7b | 1630 | t = build_call_a (fn, i, argarray); |
c2898ec9 JJ |
1631 | t = fold_convert (void_type_node, t); |
1632 | t = fold_build_cleanup_point_expr (TREE_TYPE (t), t); | |
1799e5d5 RH |
1633 | append_to_statement_list (t, &ret); |
1634 | ||
5d49b6a7 | 1635 | t = fold_build_pointer_plus (p1, TYPE_SIZE_UNIT (inner_type)); |
726a989a | 1636 | t = build2 (MODIFY_EXPR, TREE_TYPE (p1), p1, t); |
1799e5d5 RH |
1637 | append_to_statement_list (t, &ret); |
1638 | ||
1639 | if (arg2) | |
1640 | { | |
5d49b6a7 | 1641 | t = fold_build_pointer_plus (p2, TYPE_SIZE_UNIT (inner_type)); |
726a989a | 1642 | t = build2 (MODIFY_EXPR, TREE_TYPE (p2), p2, t); |
1799e5d5 RH |
1643 | append_to_statement_list (t, &ret); |
1644 | } | |
1645 | ||
1646 | t = build2 (NE_EXPR, boolean_type_node, p1, end1); | |
1647 | t = build3 (COND_EXPR, void_type_node, t, build_and_jump (&lab), NULL); | |
1648 | append_to_statement_list (t, &ret); | |
1649 | ||
1650 | return ret; | |
1651 | } | |
1652 | else | |
1653 | { | |
db3927fb | 1654 | argarray[i++] = build_fold_addr_expr_loc (input_location, arg1); |
1799e5d5 | 1655 | if (arg2) |
db3927fb | 1656 | argarray[i++] = build_fold_addr_expr_loc (input_location, arg2); |
fae2b46b | 1657 | /* Handle default arguments. */ |
d2ee546f | 1658 | for (parm = defparm; parm && parm != void_list_node; |
94a0dd7b SL |
1659 | parm = TREE_CHAIN (parm), i++) |
1660 | argarray[i] = convert_default_arg (TREE_VALUE (parm), | |
1661 | TREE_PURPOSE (parm), | |
b40e334f | 1662 | fn, i, tf_warning_or_error); |
c2898ec9 JJ |
1663 | t = build_call_a (fn, i, argarray); |
1664 | t = fold_convert (void_type_node, t); | |
1665 | return fold_build_cleanup_point_expr (TREE_TYPE (t), t); | |
1799e5d5 RH |
1666 | } |
1667 | } | |
1668 | ||
1669 | /* Return code to initialize DECL with its default constructor, or | |
1670 | NULL if there's nothing to do. */ | |
1671 | ||
1672 | tree | |
12308bc6 | 1673 | cxx_omp_clause_default_ctor (tree clause, tree decl, tree /*outer*/) |
1799e5d5 RH |
1674 | { |
1675 | tree info = CP_OMP_CLAUSE_INFO (clause); | |
1676 | tree ret = NULL; | |
1677 | ||
1678 | if (info) | |
1679 | ret = cxx_omp_clause_apply_fn (TREE_VEC_ELT (info, 0), decl, NULL); | |
1680 | ||
1681 | return ret; | |
1682 | } | |
1683 | ||
1684 | /* Return code to initialize DST with a copy constructor from SRC. */ | |
1685 | ||
1686 | tree | |
1687 | cxx_omp_clause_copy_ctor (tree clause, tree dst, tree src) | |
1688 | { | |
1689 | tree info = CP_OMP_CLAUSE_INFO (clause); | |
1690 | tree ret = NULL; | |
1691 | ||
1692 | if (info) | |
1693 | ret = cxx_omp_clause_apply_fn (TREE_VEC_ELT (info, 0), dst, src); | |
1694 | if (ret == NULL) | |
726a989a | 1695 | ret = build2 (MODIFY_EXPR, TREE_TYPE (dst), dst, src); |
1799e5d5 RH |
1696 | |
1697 | return ret; | |
1698 | } | |
1699 | ||
1700 | /* Similarly, except use an assignment operator instead. */ | |
1701 | ||
1702 | tree | |
1703 | cxx_omp_clause_assign_op (tree clause, tree dst, tree src) | |
1704 | { | |
1705 | tree info = CP_OMP_CLAUSE_INFO (clause); | |
1706 | tree ret = NULL; | |
1707 | ||
1708 | if (info) | |
1709 | ret = cxx_omp_clause_apply_fn (TREE_VEC_ELT (info, 2), dst, src); | |
1710 | if (ret == NULL) | |
726a989a | 1711 | ret = build2 (MODIFY_EXPR, TREE_TYPE (dst), dst, src); |
1799e5d5 RH |
1712 | |
1713 | return ret; | |
1714 | } | |
1715 | ||
1716 | /* Return code to destroy DECL. */ | |
1717 | ||
1718 | tree | |
1719 | cxx_omp_clause_dtor (tree clause, tree decl) | |
1720 | { | |
1721 | tree info = CP_OMP_CLAUSE_INFO (clause); | |
1722 | tree ret = NULL; | |
1723 | ||
1724 | if (info) | |
1725 | ret = cxx_omp_clause_apply_fn (TREE_VEC_ELT (info, 1), decl, NULL); | |
1726 | ||
1727 | return ret; | |
5a508662 | 1728 | } |
077b0dfb JJ |
1729 | |
1730 | /* True if OpenMP should privatize what this DECL points to rather | |
1731 | than the DECL itself. */ | |
1732 | ||
1733 | bool | |
58f9752a | 1734 | cxx_omp_privatize_by_reference (const_tree decl) |
077b0dfb | 1735 | { |
acf0174b JJ |
1736 | return (TREE_CODE (TREE_TYPE (decl)) == REFERENCE_TYPE |
1737 | || is_invisiref_parm (decl)); | |
077b0dfb | 1738 | } |
a68ab351 | 1739 | |
20906c66 JJ |
1740 | /* Return true if DECL is const qualified var having no mutable member. */ |
1741 | bool | |
1742 | cxx_omp_const_qual_no_mutable (tree decl) | |
a68ab351 | 1743 | { |
20906c66 | 1744 | tree type = TREE_TYPE (decl); |
a68ab351 JJ |
1745 | if (TREE_CODE (type) == REFERENCE_TYPE) |
1746 | { | |
1747 | if (!is_invisiref_parm (decl)) | |
20906c66 | 1748 | return false; |
a68ab351 JJ |
1749 | type = TREE_TYPE (type); |
1750 | ||
1751 | if (TREE_CODE (decl) == RESULT_DECL && DECL_NAME (decl)) | |
1752 | { | |
1753 | /* NVR doesn't preserve const qualification of the | |
1754 | variable's type. */ | |
1755 | tree outer = outer_curly_brace_block (current_function_decl); | |
1756 | tree var; | |
1757 | ||
1758 | if (outer) | |
910ad8de | 1759 | for (var = BLOCK_VARS (outer); var; var = DECL_CHAIN (var)) |
a68ab351 JJ |
1760 | if (DECL_NAME (decl) == DECL_NAME (var) |
1761 | && (TYPE_MAIN_VARIANT (type) | |
1762 | == TYPE_MAIN_VARIANT (TREE_TYPE (var)))) | |
1763 | { | |
1764 | if (TYPE_READONLY (TREE_TYPE (var))) | |
1765 | type = TREE_TYPE (var); | |
1766 | break; | |
1767 | } | |
1768 | } | |
1769 | } | |
1770 | ||
1771 | if (type == error_mark_node) | |
20906c66 | 1772 | return false; |
a68ab351 JJ |
1773 | |
1774 | /* Variables with const-qualified type having no mutable member | |
1775 | are predetermined shared. */ | |
1776 | if (TYPE_READONLY (type) && !cp_has_mutable_p (type)) | |
20906c66 JJ |
1777 | return true; |
1778 | ||
1779 | return false; | |
1780 | } | |
1781 | ||
1782 | /* True if OpenMP sharing attribute of DECL is predetermined. */ | |
1783 | ||
1784 | enum omp_clause_default_kind | |
1785 | cxx_omp_predetermined_sharing (tree decl) | |
1786 | { | |
1787 | /* Static data members are predetermined shared. */ | |
1788 | if (TREE_STATIC (decl)) | |
1789 | { | |
1790 | tree ctx = CP_DECL_CONTEXT (decl); | |
1791 | if (TYPE_P (ctx) && MAYBE_CLASS_TYPE_P (ctx)) | |
1792 | return OMP_CLAUSE_DEFAULT_SHARED; | |
1793 | } | |
1794 | ||
1795 | /* Const qualified vars having no mutable member are predetermined | |
1796 | shared. */ | |
1797 | if (cxx_omp_const_qual_no_mutable (decl)) | |
a68ab351 JJ |
1798 | return OMP_CLAUSE_DEFAULT_SHARED; |
1799 | ||
1800 | return OMP_CLAUSE_DEFAULT_UNSPECIFIED; | |
1801 | } | |
1802 | ||
1803 | /* Finalize an implicitly determined clause. */ | |
1804 | ||
1805 | void | |
f014c653 | 1806 | cxx_omp_finish_clause (tree c, gimple_seq *) |
a68ab351 JJ |
1807 | { |
1808 | tree decl, inner_type; | |
1809 | bool make_shared = false; | |
1810 | ||
1811 | if (OMP_CLAUSE_CODE (c) != OMP_CLAUSE_FIRSTPRIVATE) | |
1812 | return; | |
1813 | ||
1814 | decl = OMP_CLAUSE_DECL (c); | |
1815 | decl = require_complete_type (decl); | |
1816 | inner_type = TREE_TYPE (decl); | |
1817 | if (decl == error_mark_node) | |
1818 | make_shared = true; | |
1819 | else if (TREE_CODE (TREE_TYPE (decl)) == REFERENCE_TYPE) | |
d9a6bd32 | 1820 | inner_type = TREE_TYPE (inner_type); |
a68ab351 JJ |
1821 | |
1822 | /* We're interested in the base element, not arrays. */ | |
1823 | while (TREE_CODE (inner_type) == ARRAY_TYPE) | |
1824 | inner_type = TREE_TYPE (inner_type); | |
1825 | ||
1826 | /* Check for special function availability by building a call to one. | |
1827 | Save the results, because later we won't be in the right context | |
1828 | for making these queries. */ | |
1829 | if (!make_shared | |
1830 | && CLASS_TYPE_P (inner_type) | |
acf0174b | 1831 | && cxx_omp_create_clause_info (c, inner_type, false, true, false, true)) |
a68ab351 JJ |
1832 | make_shared = true; |
1833 | ||
1834 | if (make_shared) | |
1835 | OMP_CLAUSE_CODE (c) = OMP_CLAUSE_SHARED; | |
1836 | } | |
d9a6bd32 JJ |
1837 | |
1838 | /* Return true if DECL's DECL_VALUE_EXPR (if any) should be | |
1839 | disregarded in OpenMP construct, because it is going to be | |
1840 | remapped during OpenMP lowering. SHARED is true if DECL | |
1841 | is going to be shared, false if it is going to be privatized. */ | |
1842 | ||
1843 | bool | |
1844 | cxx_omp_disregard_value_expr (tree decl, bool shared) | |
1845 | { | |
1846 | return !shared | |
1847 | && VAR_P (decl) | |
1848 | && DECL_HAS_VALUE_EXPR_P (decl) | |
1849 | && DECL_ARTIFICIAL (decl) | |
1850 | && DECL_LANG_SPECIFIC (decl) | |
1851 | && DECL_OMP_PRIVATIZED_MEMBER (decl); | |
1852 | } | |
cda0a029 | 1853 | |
cda0a029 JM |
1854 | /* Perform folding on expression X. */ |
1855 | ||
1856 | tree | |
1857 | cp_fully_fold (tree x) | |
1858 | { | |
1859 | return cp_fold (x); | |
1860 | } | |
1861 | ||
7426fcc8 JM |
1862 | /* Fold expression X which is used as an rvalue if RVAL is true. */ |
1863 | ||
1864 | static tree | |
1865 | cp_fold_maybe_rvalue (tree x, bool rval) | |
1866 | { | |
1867 | if (rval && DECL_P (x)) | |
1868 | { | |
1869 | tree v = decl_constant_value (x); | |
1870 | if (v != error_mark_node) | |
1871 | x = v; | |
1872 | } | |
1873 | return cp_fold (x); | |
1874 | } | |
1875 | ||
1876 | /* Fold expression X which is used as an rvalue. */ | |
1877 | ||
1878 | static tree | |
1879 | cp_fold_rvalue (tree x) | |
1880 | { | |
1881 | return cp_fold_maybe_rvalue (x, true); | |
1882 | } | |
1883 | ||
4250754e JM |
1884 | /* c-common interface to cp_fold. If IN_INIT, this is in a static initializer |
1885 | and certain changes are made to the folding done. Or should be (FIXME). We | |
1886 | never touch maybe_const, as it is only used for the C front-end | |
1887 | C_MAYBE_CONST_EXPR. */ | |
1888 | ||
1889 | tree | |
1890 | c_fully_fold (tree x, bool /*in_init*/, bool */*maybe_const*/) | |
1891 | { | |
7426fcc8 JM |
1892 | /* c_fully_fold is only used on rvalues, and we need to fold CONST_DECL to |
1893 | INTEGER_CST. */ | |
1894 | return cp_fold_rvalue (x); | |
4250754e JM |
1895 | } |
1896 | ||
cda0a029 JM |
1897 | static GTY((cache, deletable)) cache_map fold_cache; |
1898 | ||
1e297006 MP |
1899 | /* Dispose of the whole FOLD_CACHE. */ |
1900 | ||
1901 | void | |
1902 | clear_fold_cache (void) | |
1903 | { | |
1904 | gt_cleare_cache (fold_cache); | |
1905 | } | |
1906 | ||
cda0a029 JM |
1907 | /* This function tries to fold an expression X. |
1908 | To avoid combinatorial explosion, folding results are kept in fold_cache. | |
1909 | If we are processing a template or X is invalid, we don't fold at all. | |
1910 | For performance reasons we don't cache expressions representing a | |
1911 | declaration or constant. | |
1912 | Function returns X or its folded variant. */ | |
1913 | ||
1914 | static tree | |
1915 | cp_fold (tree x) | |
1916 | { | |
1917 | tree op0, op1, op2, op3; | |
1918 | tree org_x = x, r = NULL_TREE; | |
1919 | enum tree_code code; | |
1920 | location_t loc; | |
7426fcc8 | 1921 | bool rval_ops = true; |
cda0a029 | 1922 | |
2fa586ad | 1923 | if (!x || x == error_mark_node) |
cda0a029 JM |
1924 | return x; |
1925 | ||
1926 | if (processing_template_decl | |
2fa586ad | 1927 | || (EXPR_P (x) && (!TREE_TYPE (x) || TREE_TYPE (x) == error_mark_node))) |
cda0a029 JM |
1928 | return x; |
1929 | ||
1930 | /* Don't bother to cache DECLs or constants. */ | |
1931 | if (DECL_P (x) || CONSTANT_CLASS_P (x)) | |
1932 | return x; | |
1933 | ||
1934 | if (tree cached = fold_cache.get (x)) | |
1935 | return cached; | |
1936 | ||
1937 | code = TREE_CODE (x); | |
1938 | switch (code) | |
1939 | { | |
1940 | case SIZEOF_EXPR: | |
1941 | x = fold_sizeof_expr (x); | |
1942 | break; | |
1943 | ||
1944 | case VIEW_CONVERT_EXPR: | |
7426fcc8 | 1945 | rval_ops = false; |
cda0a029 JM |
1946 | case CONVERT_EXPR: |
1947 | case NOP_EXPR: | |
1948 | case NON_LVALUE_EXPR: | |
1949 | ||
1950 | if (VOID_TYPE_P (TREE_TYPE (x))) | |
1951 | return x; | |
1952 | ||
cda0a029 | 1953 | loc = EXPR_LOCATION (x); |
8d8f3235 | 1954 | op0 = cp_fold_maybe_rvalue (TREE_OPERAND (x, 0), rval_ops); |
cda0a029 | 1955 | |
415594bb JM |
1956 | if (code == CONVERT_EXPR |
1957 | && SCALAR_TYPE_P (TREE_TYPE (x)) | |
1958 | && op0 != void_node) | |
1959 | /* During parsing we used convert_to_*_nofold; re-convert now using the | |
1960 | folding variants, since fold() doesn't do those transformations. */ | |
1961 | x = fold (convert (TREE_TYPE (x), op0)); | |
1962 | else if (op0 != TREE_OPERAND (x, 0)) | |
476805ae JJ |
1963 | { |
1964 | if (op0 == error_mark_node) | |
1965 | x = error_mark_node; | |
1966 | else | |
1967 | x = fold_build1_loc (loc, code, TREE_TYPE (x), op0); | |
1968 | } | |
e9ea372d JM |
1969 | else |
1970 | x = fold (x); | |
cda0a029 JM |
1971 | |
1972 | /* Conversion of an out-of-range value has implementation-defined | |
1973 | behavior; the language considers it different from arithmetic | |
1974 | overflow, which is undefined. */ | |
1975 | if (TREE_CODE (op0) == INTEGER_CST | |
1976 | && TREE_OVERFLOW_P (x) && !TREE_OVERFLOW_P (op0)) | |
1977 | TREE_OVERFLOW (x) = false; | |
1978 | ||
1979 | break; | |
1980 | ||
cda0a029 JM |
1981 | case ADDR_EXPR: |
1982 | case REALPART_EXPR: | |
1983 | case IMAGPART_EXPR: | |
7426fcc8 | 1984 | rval_ops = false; |
cda0a029 JM |
1985 | case CONJ_EXPR: |
1986 | case FIX_TRUNC_EXPR: | |
1987 | case FLOAT_EXPR: | |
1988 | case NEGATE_EXPR: | |
1989 | case ABS_EXPR: | |
1990 | case BIT_NOT_EXPR: | |
1991 | case TRUTH_NOT_EXPR: | |
1992 | case FIXED_CONVERT_EXPR: | |
1993 | case UNARY_PLUS_EXPR: | |
1994 | case INDIRECT_REF: | |
1995 | ||
1996 | loc = EXPR_LOCATION (x); | |
7426fcc8 | 1997 | op0 = cp_fold_maybe_rvalue (TREE_OPERAND (x, 0), rval_ops); |
cda0a029 JM |
1998 | |
1999 | if (op0 != TREE_OPERAND (x, 0)) | |
476805ae JJ |
2000 | { |
2001 | if (op0 == error_mark_node) | |
2002 | x = error_mark_node; | |
2003 | else | |
2004 | x = fold_build1_loc (loc, code, TREE_TYPE (x), op0); | |
2005 | } | |
e9ea372d JM |
2006 | else |
2007 | x = fold (x); | |
cda0a029 JM |
2008 | |
2009 | gcc_assert (TREE_CODE (x) != COND_EXPR | |
2010 | || !VOID_TYPE_P (TREE_TYPE (TREE_OPERAND (x, 0)))); | |
2011 | break; | |
2012 | ||
2013 | case POSTDECREMENT_EXPR: | |
2014 | case POSTINCREMENT_EXPR: | |
2015 | case INIT_EXPR: | |
cda0a029 JM |
2016 | case PREDECREMENT_EXPR: |
2017 | case PREINCREMENT_EXPR: | |
2018 | case COMPOUND_EXPR: | |
7426fcc8 JM |
2019 | case MODIFY_EXPR: |
2020 | rval_ops = false; | |
cda0a029 JM |
2021 | case POINTER_PLUS_EXPR: |
2022 | case PLUS_EXPR: | |
2023 | case MINUS_EXPR: | |
2024 | case MULT_EXPR: | |
2025 | case TRUNC_DIV_EXPR: | |
2026 | case CEIL_DIV_EXPR: | |
2027 | case FLOOR_DIV_EXPR: | |
2028 | case ROUND_DIV_EXPR: | |
2029 | case TRUNC_MOD_EXPR: | |
2030 | case CEIL_MOD_EXPR: | |
2031 | case ROUND_MOD_EXPR: | |
2032 | case RDIV_EXPR: | |
2033 | case EXACT_DIV_EXPR: | |
2034 | case MIN_EXPR: | |
2035 | case MAX_EXPR: | |
2036 | case LSHIFT_EXPR: | |
2037 | case RSHIFT_EXPR: | |
2038 | case LROTATE_EXPR: | |
2039 | case RROTATE_EXPR: | |
2040 | case BIT_AND_EXPR: | |
2041 | case BIT_IOR_EXPR: | |
2042 | case BIT_XOR_EXPR: | |
2043 | case TRUTH_AND_EXPR: | |
2044 | case TRUTH_ANDIF_EXPR: | |
2045 | case TRUTH_OR_EXPR: | |
2046 | case TRUTH_ORIF_EXPR: | |
2047 | case TRUTH_XOR_EXPR: | |
2048 | case LT_EXPR: case LE_EXPR: | |
2049 | case GT_EXPR: case GE_EXPR: | |
2050 | case EQ_EXPR: case NE_EXPR: | |
2051 | case UNORDERED_EXPR: case ORDERED_EXPR: | |
2052 | case UNLT_EXPR: case UNLE_EXPR: | |
2053 | case UNGT_EXPR: case UNGE_EXPR: | |
2054 | case UNEQ_EXPR: case LTGT_EXPR: | |
2055 | case RANGE_EXPR: case COMPLEX_EXPR: | |
cda0a029 JM |
2056 | |
2057 | loc = EXPR_LOCATION (x); | |
7426fcc8 JM |
2058 | op0 = cp_fold_maybe_rvalue (TREE_OPERAND (x, 0), rval_ops); |
2059 | op1 = cp_fold_rvalue (TREE_OPERAND (x, 1)); | |
cda0a029 JM |
2060 | |
2061 | if (op0 != TREE_OPERAND (x, 0) || op1 != TREE_OPERAND (x, 1)) | |
476805ae JJ |
2062 | { |
2063 | if (op0 == error_mark_node || op1 == error_mark_node) | |
2064 | x = error_mark_node; | |
2065 | else | |
2066 | x = fold_build2_loc (loc, code, TREE_TYPE (x), op0, op1); | |
2067 | } | |
e9ea372d JM |
2068 | else |
2069 | x = fold (x); | |
cda0a029 | 2070 | |
cda0a029 JM |
2071 | break; |
2072 | ||
2073 | case VEC_COND_EXPR: | |
2074 | case COND_EXPR: | |
2075 | ||
7f26f7df JM |
2076 | /* Don't bother folding a void condition, since it can't produce a |
2077 | constant value. Also, some statement-level uses of COND_EXPR leave | |
2078 | one of the branches NULL, so folding would crash. */ | |
2079 | if (VOID_TYPE_P (TREE_TYPE (x))) | |
2080 | return x; | |
2081 | ||
cda0a029 | 2082 | loc = EXPR_LOCATION (x); |
7426fcc8 | 2083 | op0 = cp_fold_rvalue (TREE_OPERAND (x, 0)); |
cda0a029 JM |
2084 | op1 = cp_fold (TREE_OPERAND (x, 1)); |
2085 | op2 = cp_fold (TREE_OPERAND (x, 2)); | |
2086 | ||
7f26f7df JM |
2087 | if (op0 != TREE_OPERAND (x, 0) |
2088 | || op1 != TREE_OPERAND (x, 1) | |
2089 | || op2 != TREE_OPERAND (x, 2)) | |
476805ae JJ |
2090 | { |
2091 | if (op0 == error_mark_node | |
2092 | || op1 == error_mark_node | |
2093 | || op2 == error_mark_node) | |
2094 | x = error_mark_node; | |
2095 | else | |
2096 | x = fold_build3_loc (loc, code, TREE_TYPE (x), op0, op1, op2); | |
2097 | } | |
7f26f7df | 2098 | else |
cda0a029 JM |
2099 | x = fold (x); |
2100 | ||
2101 | break; | |
2102 | ||
2103 | case CALL_EXPR: | |
2104 | { | |
2105 | int i, m, sv = optimize, nw = sv, changed = 0; | |
2106 | tree callee = get_callee_fndecl (x); | |
2107 | ||
b925d25d JM |
2108 | /* Some built-in function calls will be evaluated at compile-time in |
2109 | fold (). Set optimize to 1 when folding __builtin_constant_p inside | |
2110 | a constexpr function so that fold_builtin_1 doesn't fold it to 0. */ | |
cda0a029 JM |
2111 | if (callee && DECL_BUILT_IN (callee) && !optimize |
2112 | && DECL_IS_BUILTIN_CONSTANT_P (callee) | |
2113 | && current_function_decl | |
2114 | && DECL_DECLARED_CONSTEXPR_P (current_function_decl)) | |
2115 | nw = 1; | |
cda0a029 JM |
2116 | |
2117 | x = copy_node (x); | |
2118 | ||
2119 | m = call_expr_nargs (x); | |
2120 | for (i = 0; i < m; i++) | |
2121 | { | |
2122 | r = cp_fold (CALL_EXPR_ARG (x, i)); | |
2123 | if (r != CALL_EXPR_ARG (x, i)) | |
476805ae JJ |
2124 | { |
2125 | if (r == error_mark_node) | |
2126 | { | |
2127 | x = error_mark_node; | |
2128 | break; | |
2129 | } | |
2130 | changed = 1; | |
2131 | } | |
cda0a029 JM |
2132 | CALL_EXPR_ARG (x, i) = r; |
2133 | } | |
476805ae JJ |
2134 | if (x == error_mark_node) |
2135 | break; | |
cda0a029 JM |
2136 | |
2137 | optimize = nw; | |
2138 | r = fold (x); | |
2139 | optimize = sv; | |
2140 | ||
2141 | if (TREE_CODE (r) != CALL_EXPR) | |
2142 | { | |
2143 | x = cp_fold (r); | |
2144 | break; | |
2145 | } | |
2146 | ||
2147 | optimize = nw; | |
2148 | ||
b925d25d JM |
2149 | /* Invoke maybe_constant_value for functions declared |
2150 | constexpr and not called with AGGR_INIT_EXPRs. | |
cda0a029 | 2151 | TODO: |
b925d25d JM |
2152 | Do constexpr expansion of expressions where the call itself is not |
2153 | constant, but the call followed by an INDIRECT_REF is. */ | |
cda0a029 JM |
2154 | if (callee && DECL_DECLARED_CONSTEXPR_P (callee)) |
2155 | r = maybe_constant_value (x); | |
2156 | optimize = sv; | |
2157 | ||
2158 | if (TREE_CODE (r) != CALL_EXPR) | |
2159 | { | |
2160 | x = r; | |
2161 | break; | |
2162 | } | |
2163 | ||
2164 | if (!changed) | |
2165 | x = org_x; | |
2166 | break; | |
2167 | } | |
2168 | ||
2169 | case CONSTRUCTOR: | |
2170 | { | |
2171 | unsigned i; | |
2172 | constructor_elt *p; | |
4b0b30ef | 2173 | bool changed = false; |
cda0a029 | 2174 | vec<constructor_elt, va_gc> *elts = CONSTRUCTOR_ELTS (x); |
4b0b30ef JM |
2175 | vec<constructor_elt, va_gc> *nelts = NULL; |
2176 | vec_safe_reserve (nelts, vec_safe_length (elts)); | |
cda0a029 | 2177 | FOR_EACH_VEC_SAFE_ELT (elts, i, p) |
4b0b30ef JM |
2178 | { |
2179 | tree op = cp_fold (p->value); | |
2180 | constructor_elt e = { p->index, op }; | |
2181 | nelts->quick_push (e); | |
2182 | if (op != p->value) | |
476805ae JJ |
2183 | { |
2184 | if (op == error_mark_node) | |
2185 | { | |
2186 | x = error_mark_node; | |
2187 | changed = false; | |
2188 | break; | |
2189 | } | |
2190 | changed = true; | |
2191 | } | |
4b0b30ef JM |
2192 | } |
2193 | if (changed) | |
2194 | x = build_constructor (TREE_TYPE (x), nelts); | |
2195 | else | |
2196 | vec_free (nelts); | |
cda0a029 JM |
2197 | break; |
2198 | } | |
2199 | case TREE_VEC: | |
2200 | { | |
2201 | bool changed = false; | |
2202 | vec<tree, va_gc> *vec = make_tree_vector (); | |
2203 | int i, n = TREE_VEC_LENGTH (x); | |
2204 | vec_safe_reserve (vec, n); | |
2205 | ||
2206 | for (i = 0; i < n; i++) | |
2207 | { | |
2208 | tree op = cp_fold (TREE_VEC_ELT (x, i)); | |
2209 | vec->quick_push (op); | |
2210 | if (op != TREE_VEC_ELT (x, i)) | |
2211 | changed = true; | |
2212 | } | |
2213 | ||
2214 | if (changed) | |
2215 | { | |
2216 | r = copy_node (x); | |
2217 | for (i = 0; i < n; i++) | |
2218 | TREE_VEC_ELT (r, i) = (*vec)[i]; | |
2219 | x = r; | |
2220 | } | |
2221 | ||
2222 | release_tree_vector (vec); | |
2223 | } | |
2224 | ||
2225 | break; | |
2226 | ||
2227 | case ARRAY_REF: | |
2228 | case ARRAY_RANGE_REF: | |
2229 | ||
2230 | loc = EXPR_LOCATION (x); | |
2231 | op0 = cp_fold (TREE_OPERAND (x, 0)); | |
2232 | op1 = cp_fold (TREE_OPERAND (x, 1)); | |
2233 | op2 = cp_fold (TREE_OPERAND (x, 2)); | |
2234 | op3 = cp_fold (TREE_OPERAND (x, 3)); | |
2235 | ||
476805ae JJ |
2236 | if (op0 != TREE_OPERAND (x, 0) |
2237 | || op1 != TREE_OPERAND (x, 1) | |
2238 | || op2 != TREE_OPERAND (x, 2) | |
2239 | || op3 != TREE_OPERAND (x, 3)) | |
2240 | { | |
2241 | if (op0 == error_mark_node | |
2242 | || op1 == error_mark_node | |
2243 | || op2 == error_mark_node | |
2244 | || op3 == error_mark_node) | |
2245 | x = error_mark_node; | |
2246 | else | |
2247 | x = build4_loc (loc, code, TREE_TYPE (x), op0, op1, op2, op3); | |
2248 | } | |
cda0a029 JM |
2249 | |
2250 | x = fold (x); | |
2251 | break; | |
2252 | ||
2253 | default: | |
2254 | return org_x; | |
2255 | } | |
2256 | ||
2257 | fold_cache.put (org_x, x); | |
2258 | /* Prevent that we try to fold an already folded result again. */ | |
2259 | if (x != org_x) | |
2260 | fold_cache.put (x, x); | |
2261 | ||
2262 | return x; | |
2263 | } | |
2264 | ||
2265 | #include "gt-cp-cp-gimplify.h" |